proposition: Lemma ptrofs_divs_repr : forall i j : Z, Ptrofs.min_signed <= i <= Ptrofs.max_signed -> Ptrofs.min_signed <= j <= Ptrofs.max_signed -> Ptrofs.divs (Ptrofs.repr i) (Ptrofs.repr j) = Ptrofs.repr (i ÷ j).
proof: Proof. intros. unfold Ptrofs.divs. rewrite ?Ptrofs.signed_repr by rep_lia; 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