proposition: Lemma svfl_copy_compatible: forall from to v l g1 g2, from <> to -> graph_has_gen g1 to -> scan_vertex_for_loop from to v l g1 g2 -> copy_compatible g1 -> copy_compatible g2.
proof: Proof. do 4 intro. induction l; intros; inversion H1; subst. 1: assumption. cut (copy_compatible g3). - intros. apply (IHl g3); auto. erewrite <- fr_graph_has_gen; eauto. - eapply fr_copy_compatible; eauto. 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