proposition: Lemma ngs_int_signed_range: forall i, 0 <= i < MAX_SPACES -> (if Archi.ptr64 then Int64.min_signed else Int.min_signed) <= nth_gen_size (Z.to_nat i) <= (if Archi.ptr64 then Int64.max_signed else Int.max_signed).
proof: Proof. intros. apply ngs_range in H. destruct H. split. - transitivity 0. 2: assumption. vm_compute. intro HS; inversion HS. - transitivity MAX_SPACE_SIZE. 1: assumption. intro; discriminate. 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