proposition: Lemma generation_rep_reset_same: forall (g: LGraph) i, graph_has_gen g i -> generation_rep (reset_graph i g) i = emp.
proof: Proof. intros. unfold generation_rep. rewrite <- !iter_sepcon_map. unfold nth_gen, reset_graph at 1. simpl. rewrite reset_nth_gen_info_same. simpl. reflexivity. Qed.
imports: VST.veric.compcert_rmaps VST.msl.shares VST.msl.wand_frame VST.concurrency.conclib CertiGraph.lib.List_ext CertiGraph.msl_ext.log_normalize CertiGraph.msl_ext.ramification_lemmas CertiGraph.graph.graph_model CertiGraph.CertiGC.GCGraph CertiGraph.CertiGC.env_graph_gc CertiGraph.msl_ext.iter_sepcon Coq.Lists.List