proposition: Lemma lmc_estc: forall (g : LGraph) (h : heap) (v v': VType) (to : nat) (Hi : 0 <= Z.of_nat to < Zlength (spaces h)), enough_space_to_copy g h (vgeneration v) to -> graph_has_v g v -> raw_mark (vlabel g v) = false -> forall Hh : has_space (Znth (Z.of_nat to) (spaces h)) (vertex_size g v), enough_space_to_copy (lgraph_mark_copied g v v') (cut_heap h (Z.of_nat to) (vertex_size g v) Hi Hh) (vgeneration v) to.
proof: Proof. unfold enough_space_to_copy. intros. rewrite (lmc_unmarked_gen_size g v v') in H by assumption. rewrite (cti_rest_gen_size _ _ (vertex_size g v) Hi Hh) in H. lia. 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