proposition: Lemma do_gen_no_dangling_dst: forall g1 g2 roots1 roots2 from to, graph_has_gen g1 to -> copy_compatible g1 -> gen_unmarked g1 to -> from <> to -> roots_graph_compatible roots1 g1 -> firstn_gen_clear g1 from -> no_backward_edge g1 -> do_generation_relation from to roots1 roots2 g1 g2 -> no_dangling_dst g1 -> no_dangling_dst g2.
proof: Proof. intros until 3. pose proof I; intros. destruct H7 as [g3 [g4 [? [? ?]]]]. assert (no_dangling_dst g3) by (eapply (frr_no_dangling_dst from); eauto). assert (no_dangling_dst g4). { destruct H9 as [n [? ?]]. eapply (svwl_no_dangling_dst _ _ _ g3); eauto. - rewrite <- frr_graph_has_gen; eauto. - eapply frr_gen_unmarked; eauto. - eapply frr_copy_compatible; eauto. } subst g2. apply no_dangling_dst_reset; auto. eapply frr_dsr_no_edge2gen; eauto. apply fgc_nbe_no_edge2gen; auto. Qed.
imports: Coq.ZArith.ZArith Coq.Program.Basics Coq.micromega.Lia compcert.lib.Integers compcert.common.Values VST.veric.base VST.veric.Clight_lemmas VST.veric.val_lemmas VST.veric.shares VST.msl.seplog VST.msl.shares VST.zlist.sublist VST.floyd.coqlib3 VST.floyd.functional_base VST.floyd.data_at_rec_lemmas VST.zlist.list_solver CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen