proposition: Lemma utiacti_space_start: forall h i1 s n (Hi : 0 <= i1 < Zlength (spaces h)) (Hh : has_space (Znth i1 (spaces h)) s), space_start (nth_space (cut_heap h i1 s Hi Hh) n) = space_start (nth_space h n).
proof: Proof. intros. unfold nth_space. apply cti_space_start. 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