proposition: Lemma svfl_nth_gen_unchanged: forall from to v l g1 g2, graph_has_gen g1 to -> scan_vertex_for_loop from to v l g1 g2 -> forall gen, gen <> to -> nth_gen g1 gen = nth_gen g2 gen.
proof: Proof. intros. induction H0; subst; try reflexivity. transitivity (nth_gen g2 gen). - eapply fr_O_nth_gen_unchanged; eauto. - apply IHscan_vertex_for_loop. rewrite <- fr_graph_has_gen; 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