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.
Open Scope Z_scope.
Lemma goal0 (a_2 : addr) (a : addr) (a_1 : addr) (i_12 : Z) (i_17 : Z) (i_3 : Z) (i_2 : Z) (i_10 : Z) (t : Z -> Z) (i : Z) (i_1 : Z) (i_11 : Z) (i_13 : Z) (i_14 : Z) (i_15 : Z) (i_18 : Z) (i_19 : Z) (i_4 : Z) (i_5 : Z) (i_6 : Z) (i_7 : Z) (i_8 : Z) (i_9 : Z) (i_16 : Z) : let x : Z := base a_2 in let x_1 : Z := base a in let x_2 : Z := base a_1 in let x_3 : Z := i_12 + i_17 in let x_4 : Z := 2147483648%Z + i_17 in let a_3 : addr := shift a_1 12%Z in let x_6 : Z := 2147483647%Z + i_3 in let a_4 : addr := shift a_2 (i_2 + i_12) in let a_5 : addr := shift a_2 i_12 in ¬ i_10 = 0%Z -> ¬ Mk_addr 0%Z 0%Z = a_2 -> ¬ x = x_1 -> ¬ x = x_2 -> 0%Z ≤ i_10 -> region x_1 ≤ 0%Z -> region x_2 ≤ 0%Z -> region x ≤ 0%Z -> linked t -> is_uint16 i -> is_uint16 i_1 -> is_uint16 i_2 -> is_uint16 i_3 -> is_uint16 i_10 -> is_uint16 i_11 -> is_uint16 i_13 -> is_uint16 i_14 -> is_uint16 i_15 -> is_uint16 i_17 -> is_uint16 i_18 -> is_uint16 i_19 -> is_sint32 i_4 -> is_sint32 i_5 -> is_sint32 i_6 -> is_sint32 i_7 -> is_sint32 i_8 -> is_sint32 i_9 -> is_sint32 i_16 -> valid_rw t a 1%Z -> valid_rw t a_1 15%Z -> separated a 1%Z a_1 15%Z -> (if decide (i_4 = 0%Z) then i_12 = i_11 ∧ 0%Z ≤ i_17 ∧ - 2147483648%Z ≤ x_3 ∧ x_3 ≤ 2147483647%Z ∧ (if decide (i_5 = 0%Z) then i_9 = - 7379%Z ∧ i_14 = i_13 ∧ i_18 = 0%Z ∧ i_14 ≤ x_4 ∧ i_17 ≤ 2147483647%Z + i_14 else (if decide (i_6 = 0%Z) then i_7 ≤ 0%Z ∧ (if decide (i_7 = 0%Z) then to_uint16 (i_17 - i_2) = i ∧ i_2 ≤ x_4 ∧ i_17 ≤ 2147483647%Z + i_2 ∧ (if decide (i_1 = 0%Z) then if decide (i_16 = 0%Z) then i_9 = - 7477%Z else i_9 = 0%Z ∧ valid_rd t a_3 1%Z ∧ valid_rw t a_3 1%Z else i_9 = - 7466%Z) ∧ (if decide (i_8 = 0%Z) then i_16 = 1%Z ∧ to_uint16 (i - i_3) = i_1 ∧ i ≤ x_6 ∧ i_3 ≤ 2147483648%Z + i else i_1 = i ∧ i_16 = 0%Z) ∧ (i = 0%Z -> i_8 < 0%Z) ∧ (i_8 = 0%Z -> i_3 ≤ i ∧ 2%Z ≤ i_3) ∧ (a_4 = Mk_addr 0%Z 0%Z -> i_8 < 0%Z) ∧ (¬ a_4 = Mk_addr 0%Z 0%Z -> 0%Z < i -> valid_rd t a_4 i) ∧ (i_8 = 0%Z ∨ i_8 < 0%Z) else i_9 = i_7) ∧ (i_17 = 0%Z -> i_7 < 0%Z) ∧ (i_7 = 0%Z -> i_2 ≤ i_17) ∧ (a_5 = Mk_addr 0%Z 0%Z -> i_7 < 0%Z) else i_17 = i ∧ (if decide (i_1 = 0%Z) then if decide (i_16 = 0%Z) then i_9 = - 7477%Z else i_9 = 0%Z ∧ valid_rd t a_3 1%Z ∧ valid_rw t a_3 1%Z else i_9 = - 7466%Z) ∧ (if decide (i_8 = 0%Z) then i_16 = 1%Z ∧ to_uint16 (i_17 - i_3) = i_1 ∧ i_3 ≤ x_4 ∧ i_17 ≤ x_6 else i_16 = 0%Z ∧ i_17 = i_1) ∧ (i_17 = 0%Z -> i_8 < 0%Z) ∧ (a_5 = Mk_addr 0%Z 0%Z -> i_8 < 0%Z) ∧ (i_8 = 0%Z -> i_3 ≤ i_17 ∧ 2%Z ≤ i_3) ∧ (i_8 = 0%Z ∨ i_8 < 0%Z)) ∧ (i_17 = 0%Z -> i_6 < 0%Z) ∧ (i_6 = 0%Z -> i_19 ≤ i_17) ∧ (a_5 = Mk_addr 0%Z 0%Z -> i_6 < 0%Z) ∧ (i_6 = 0%Z -> i_15 + i_19 ≤ i_17) ∧ (i_6 = 0%Z -> i_15 ≤ i_17 ∧ 2%Z ≤ i_15) ∧ (i_6 = 0%Z ∨ i_6 < 0%Z)) ∧ (i_17 = 0%Z -> i_5 < 0%Z) ∧ (i_5 = 0%Z -> i_18 ≤ i_17) ∧ (a_5 = Mk_addr 0%Z 0%Z -> i_5 < 0%Z) ∧ (i_5 = 0%Z -> i_13 + i_18 ≤ i_17) ∧ (i_5 = 0%Z -> i_13 ≤ i_17 ∧ 2%Z ≤ i_13) ∧ (¬ a_5 = Mk_addr 0%Z 0%Z -> 0%Z < i_17 -> valid_rd t a_5 i_17) ∧ (i_5 = 0%Z ∨ i_5 < 0%Z) else i_9 = - 7356%Z) -> (i_4 = 0%Z -> i_17 ≤ i_10) -> (i_4 = 0%Z -> i_11 + i_17 ≤ i_10) -> (i_4 = 0%Z -> i_11 ≤ i_10 ∧ 2%Z ≤ i_11) -> (0%Z < i_10 -> valid_rd t (shift a_2 0%Z) i_10) -> i_4 = 0%Z ∨ i_4 < 0%Z -> i_9 ≤ 0%Z.
Admitted.
