From Stdlib Require Import Strings.String.
From Stdlib Require Import String Ascii.
From Stdlib Require Arith.
From stdpp Require Import base.
From stdpp Require Import fin_maps.
From stdpp Require Import gmap.
From stdpp Require Import base gmultiset.
From Stdlib Require Classical.
From Stdlib Require Import ZArith.
From stdpp.bitvector Require Import definitions tactics.
From Stdlib Require Import Sorting.Sorted.
From Stdlib Require Import Reals.Rbasic_fun.
From Stdlib Require Import Reals.Abstract.ConstructiveAbs.
From Stdlib Require Import Reals.Rdefinitions.
From stdpp Require Import list_relations.
From stdpp Require Import list_numbers.
From stdpp Require Import functions.
From Stdlib Require Import ClassicalEpsilon.
From stdpp Require Import base decidable.
From Stdlib Require Import ZArith.Zeuclid.
From Stdlib Require Import ZArith.Znumtheory.
From stdpp Require Import propset.
From Stdlib Require Import Reals.
Require Import Why3.Base.
Require Import Why3.Qed.Qed.
Require Import Why3.Memory.Memory.
Require Import Why3.Cint.Cint.
Require Import x509_parser.Compound.Compound.
Require Import x509_parser.Globals.Globals.
Open Scope Z_scope.
Theorem goal15 (a_5 : addr) (i_6 : Z) (i_4 : Z) (i_7 : Z) (i_9 : Z) (i_5 : Z) (i_2 : Z) (i_3 : Z) (a_4 : addr) (a_1 : addr) (a_2 : addr) (a_3 : addr) (t_2 : addr -> addr) (t : Z -> Z) (i : Z) (i_8 : Z) (i_1 : Z) (t_1 : addr -> Z) : let a_6 : addr := shift a_5 i_6 in let a_7 : addr := shift___anonstruct__ext_oid_14 (Mk_addr (- 4284%Z) 0%Z) i_4 in let x : Z := i_6 + i_7 in let x_1 : Z := to_uint16 (i_9 - i_5) in let x_2 : Z := to_uint16 (i_7 - i_2) in let a_8 : addr := shift a_5 (2%Z + i_2 + i_6) in let a_9 : addr := shift a_5 (i_2 + i_6) in ¬ i_2 = 0%Z -> ¬ i_3 = 0%Z -> ¬ i_7 = 0%Z -> ¬ i_9 = 0%Z -> ¬ Mk_addr 0%Z 0%Z = a_4 -> ¬ Mk_addr 0%Z 0%Z = a_5 -> ¬ a_6 = Mk_addr 0%Z 0%Z -> ¬ a_7 = Mk_addr 0%Z 0%Z -> 0%Z ≤ i_2 -> 0%Z ≤ i_3 -> i_6 ≤ i_3 -> i_7 ≤ i_3 -> 0%Z ≤ i_4 -> 0%Z ≤ i_7 -> i_2 ≤ i_7 -> 0%Z ≤ i_9 -> i_5 ≤ i_9 -> x ≤ i_3 -> region (base a_1) ≤ 0%Z -> region (base a_2) ≤ 0%Z -> region (base a_3) ≤ 0%Z -> region (base a_5) ≤ 0%Z -> x_1 ≤ i_9 -> i_5 + x_1 ≤ i_9 -> 2%Z ≤ i_5 -> 2%Z ≤ i_6 -> 3%Z ≤ i_2 -> i_4 ≤ 28%Z -> - 2147483648%Z ≤ x -> x ≤ 2147483647%Z -> i_2 ≤ 2147483648%Z + i_7 -> i_3 ≤ 2147483647%Z + i_6 -> i_5 ≤ 2147483648%Z + i_9 -> i_6 ≤ 2147483648%Z + i_3 -> i_7 ≤ 2147483647%Z + i_2 -> i_9 ≤ 2147483647%Z + i_5 -> framed t_2 -> linked t -> is_uint16 i -> is_uint16 i_2 -> is_uint16 i_3 -> is_uint16 i_5 -> is_uint16 i_6 -> is_uint16 i_7 -> is_uint16 i_8 -> is_uint16 i_9 -> is_sint32 i_1 -> valid_rw t a_1 1%Z -> valid_rw t a_2 1%Z -> valid_rw t a_3 15%Z -> valid_rw t (shift a_1 0%Z) 29%Z -> valid_rd t (shift a_7 2%Z) 1%Z -> (if decide (i_1 = 0%Z) then i = 3%Z ∧ to_uint16 (i_8 - 3%Z) = i_9 ∧ x_2 = i_8 ∧ shift a_5 (3%Z + i_2 + i_6) = a_4 ∧ ¬ t_1 a_8 = 0%Z ∧ valid_rd t a_8 1%Z else a_9 = a_4 ∧ x_2 = i_9) -> (a_9 = Mk_addr 0%Z 0%Z -> i_1 < 0%Z) -> (x_2 = 0%Z -> i_1 < 0%Z) -> (i_1 = 0%Z -> i ≤ x_2) -> (0%Z < i_9 -> valid_rd t (shift a_4 0%Z) i_9) -> (0%Z < i_3 -> valid_rd t (shift a_5 0%Z) i_3) -> (0%Z < i_2 -> valid_rd t a_6 i_2) -> (0%Z < i_7 -> valid_rd t a_6 i_7) -> (¬ a_9 = Mk_addr 0%Z 0%Z -> 0%Z < x_2 -> valid_rd t a_9 x_2) -> ¬ (i_1 = 0%Z ∨ i_1 < 0%Z).
Admitted.
