proposition: Lemma svwl_graph_has_v: forall from to l g1 g2, graph_has_gen g1 to -> scan_vertex_while_loop from to l g1 g2 -> forall v, graph_has_v g1 v -> graph_has_v g2 v.
proof: Proof. intros ? ? ?. induction l; intros; inversion H0; subst. 1: assumption. 1: eapply IHl; eauto. assert (graph_has_gen g3 to) by (rewrite <- svfl_graph_has_gen; eauto). eapply IHl; eauto. eapply (svfl_graph_has_v _ _ _ _ g1 g3); 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