proposition: Lemma generation_data_at__ptrofs: forall g h gen b i, Vptr b i = gen_start g gen -> generation_data_at_ g h gen |-- !! (WORD_SIZE * gen_size h gen + Ptrofs.unsigned i <= Ptrofs.max_unsigned).
proof: Proof. intros. unfold generation_data_at_. rewrite <- H. entailer!. destruct H0 as [_ [_ [? _]]]. red in H0. simpl sizeof in H0. unfold WORD_SIZE. rewrite Z.max_r in H0; [rep_lia | unfold gen_size; apply (proj1 (total_space_range _))]. 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