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.
Theorem goal0 (i_7 : Z) (i_9 : Z) (a_4 : addr) (i_6 : Z) (i_5 : Z) (a_3 : addr) (a_6 : addr) (a : addr) (t_3 : addr -> addr) (t : Z -> Z) (i_4 : Z) (i_8 : Z) (i : Z) (i_1 : Z) (i_2 : Z) (i_3 : Z) (a_1 : addr) (t_1 : Z -> Z) (a_2 : addr) (a_5 : addr) (t_2 : Z -> addr) : let x : Z := i_7 + i_9 in let a_7 : addr := shift a_4 i_6 in ¬ i_5 = 0%Z -> ¬ a_4 = a_3 -> ¬ a_6 = a_3 -> ¬ a_6 = a_4 -> ¬ Mk_addr 0%Z 0%Z = a_4 -> 0%Z ≤ i_5 -> region (base a) ≤ 0%Z -> region (base a_3) ≤ 0%Z -> region (base a_4) ≤ 0%Z -> region (base a_6) ≤ 0%Z -> framed t_3 -> linked t -> is_uint16 i_4 -> is_uint16 i_5 -> is_uint16 i_6 -> is_uint16 i_7 -> is_uint16 i_8 -> is_uint16 i_9 -> is_sint32 i -> is_sint32 i_1 -> is_sint32 i_2 -> is_sint32 i_3 -> valid_rw t a 4%Z -> valid_rw t a_6 1%Z -> separated a 4%Z a_3 1%Z -> separated a_4 1%Z a 4%Z -> separated a_6 1%Z a 4%Z -> (if decide (i_2 = 0%Z) then 0%Z ≤ i_8 ∧ (if decide (i_3 = 0%Z) then 0%Z ≤ i_4 ∧ (if decide (Mk_addr 0%Z 0%Z = a_1) then i_1 = - 2368%Z else i_4 ≤ 2147483648%Z + i_8 ∧ i_8 ≤ 2147483647%Z + i_4 ∧ valid_rd t (shift a_1 7%Z) 1%Z ∧ (if decide (i = 0%Z) then i_1 = 0%Z ∧ - 2147483648%Z ≤ x ∧ x ≤ 2147483647%Z ∧ valid_rw t_1 a_2 1%Z ∧ valid_rw t_1 a_5 1%Z else i_1 = i)) ∧ (i_4 = 0%Z -> Mk_addr 0%Z 0%Z = a_1) ∧ (a_7 = Mk_addr 0%Z 0%Z -> Mk_addr 0%Z 0%Z = a_1) ∧ (¬ a_7 = Mk_addr 0%Z 0%Z -> 0%Z < i_4 -> valid_rd t a_7 i_4) ∧ (¬ Mk_addr 0%Z 0%Z = a_1 -> (∃(i_10 : Z), t_2 i_10 = a_1 ∧ 0%Z ≤ i_10 ∧ i_10 ≤ 26%Z)) else i_3 = i_1) ∧ (i_8 = 0%Z -> i_3 < 0%Z) ∧ (a_7 = Mk_addr 0%Z 0%Z -> i_3 < 0%Z) ∧ (i_3 = 0%Z -> i_4 ≤ i_8 ∧ 3%Z ≤ i_4) ∧ (¬ a_7 = Mk_addr 0%Z 0%Z -> 0%Z < i_8 -> valid_rd t a_7 i_8) ∧ (i_3 = 0%Z ∨ i_3 < 0%Z) else i_2 = i_1) -> (i_2 = 0%Z -> i_8 ≤ i_5) -> (i_2 = 0%Z -> i_6 + i_8 ≤ i_5) -> (i_2 = 0%Z -> i_6 ≤ i_5 ∧ 2%Z ≤ i_6) -> (0%Z < i_5 -> valid_rd t (shift a_4 0%Z) i_5) -> i_2 = 0%Z ∨ i_2 < 0%Z -> i_1 = 0%Z ∨ i_1 < 0%Z.
Admitted.
