proposition: Lemma int_lt_ptrofs_to_int_: forall x y, Archi.ptr64 = false -> Int.lt (Ptrofs.to_int x) (Ptrofs.to_int y) = Ptrofs.lt x y.
proof: Proof. intros. unfold Int.lt, Ptrofs.lt. rewrite <- (Ptrofs.repr_signed x), <- (Ptrofs.repr_signed y). rewrite !ptrofs_to_int_repr by auto. pose proof Ptrofs.signed_range. unfold Ptrofs.min_signed, Ptrofs.max_signed in H0. unfold Ptrofs.half_modulus, Ptrofs.modulus, Ptrofs.wordsize, Wordsize_Ptrofs.wordsize in H0. rewrite H in H0. rewrite !Int.signed_repr by apply H0. rewrite !Ptrofs.signed_repr by apply Ptrofs.signed_range. auto. 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