proposition: Lemma graph_has_v_reset: forall (g: LGraph) gen v, graph_has_v (reset_graph gen g) v <-> graph_has_v g v /\ gen <> vgeneration v.
proof: Proof. intros. split; intros; destruct v; unfold graph_has_v in *; simpl in *. - rewrite graph_has_gen_reset, gen_has_index_reset in H. intuition auto. - rewrite graph_has_gen_reset, gen_has_index_reset. intuition 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