proposition: Lemma ltu64_repr_false: forall x y, 0 <= y <= Int64.max_unsigned -> 0 <= x <= Int64.max_unsigned -> Int64.ltu (Int64.repr x) (Int64.repr y) = false -> x >= y.
proof: Proof. intros. unfold Int64.ltu in H1. rewrite !Int64.unsigned_repr in H1; auto. if_tac in H1; auto. inversion H1. 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