fact: Definition cut_heap (h: heap) (i s: Z) (H1: 0 <= i < Zlength (spaces h)) (H2: has_space (Znth i (spaces h)) s): heap := Build_heap (upd_Znth i (spaces h) (cut_space (Znth i (spaces h)) s H2)) (cut_heap_size h i s H2 H1).
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