proposition: Lemma cti_eq: forall h i s1 s2 (H1: 0 <= i < Zlength (spaces h)) (Hs1: has_space (Znth i (spaces h)) s1) (Hs2: has_space (Znth i (spaces h)) s2), s1 = s2 -> cut_heap h i s1 H1 Hs1 = cut_heap h i s2 H1 Hs2.
proof: Proof. intros. unfold cut_thread_info. f_equal. subst s1. f_equal. apply proof_irr. 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