proposition: Lemma ti_size_gt_0: forall (g : LGraph) (h : heap) (gen : nat), graph_heap_compatible g h -> graph_has_gen g gen -> ti_size_spec h -> 0 < gen_size h gen.
proof: Proof. intros. erewrite ti_size_gen; eauto. unfold nth_gen_size. apply Z.mul_pos_pos. - rewrite NURSERY_SIZE_eq. vm_compute. reflexivity. - cut (two_p (Z.of_nat gen) > 0). 1: lia. apply two_p_gt_ZERO. 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