proposition: Lemma cti_gen_size: forall h i s n (Hi : 0 <= i < Zlength (spaces h)) (Hh : has_space (Znth i (spaces h)) s), gen_size (cut_heap h i s Hi Hh) n = gen_size h n.
proof: Proof. intros. unfold gen_size. destruct (Z.eq_dec (Z.of_nat n) i). - subst i. rewrite cti_space_eq. simpl. rewrite nth_space_Znth. reflexivity. - rewrite cti_space_not_eq; [reflexivity | assumption]. 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