proposition: Lemma svwl_stcg: forall from to l g1 g2, graph_has_gen g1 to -> scan_vertex_while_loop from to l g1 g2 -> forall gen1 gen2, graph_has_gen g1 gen2 -> gen2 <> to -> safe_to_copy_gen g1 gen1 gen2 -> safe_to_copy_gen g2 gen1 gen2.
proof: Proof. do 3 intro. induction l; intros; inversion H0; subst; try assumption. 1: apply (IHl g1); auto. apply (IHl g3); auto. - erewrite <- (svfl_graph_has_gen from to); eauto. - erewrite <- (svfl_graph_has_gen from to); eauto. - eapply (svfl_stcg from to); 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