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 goal24 (a_3 : addr) (a : addr) (a_1 : addr) (i_9 : Z) (i_11 : Z) (i : Z) (i_12 : Z) (i_14 : Z) (i_8 : Z) (t_1 : addr -> Z) (i_2 : Z) (t : Z -> Z) (i_1 : Z) (i_3 : Z) (i_4 : Z) (i_5 : Z) (i_10 : Z) (i_13 : Z) (i_6 : Z) (i_7 : Z) (a_2 : addr) : let x : Z := base a_3 in let x_1 : Z := base a in let x_2 : Z := base a_1 in let a_4 : addr := shift a_3 i_9 in let a_5 : addr := shift a_3 (i_9 + i_11) in let x_3 : Z := i + i_9 in let x_4 : Z := to_uint16 (i - i_11) in let a_6 : addr := shift a_3 (i_9 + i_11 + i_12) in let x_5 : Z := to_uint16 (x_4 - i_14) in ¬ i = 0%Z -> ¬ i_8 = 0%Z -> ¬ i_14 = 0%Z -> ¬ Mk_addr 0%Z 0%Z = a_3 -> ¬ x = x_1 -> ¬ x = x_2 -> ¬ a_4 = Mk_addr 0%Z 0%Z -> ¬ a_5 = Mk_addr 0%Z 0%Z -> to_uint16 (i_14 - i_12) = 0%Z -> t_1 a_5 = 160%Z -> 0%Z ≤ i -> i_11 ≤ i -> i_14 ≤ i -> 0%Z ≤ i_2 -> 0%Z ≤ i_8 -> i ≤ i_8 -> i_9 ≤ i_8 -> 0%Z ≤ i_14 -> i_12 ≤ i_14 -> i_11 + i_14 ≤ i -> x_3 ≤ i_8 -> region x_1 ≤ 0%Z -> region x_2 ≤ 0%Z -> region x ≤ 0%Z -> 2%Z ≤ i_9 -> 2%Z ≤ i_11 -> 2%Z ≤ i_12 -> - 2147483648%Z ≤ x_3 -> x_3 ≤ 2147483647%Z -> i ≤ 2147483647%Z + i_11 -> i_11 ≤ 2147483648%Z + i -> i_12 ≤ 2147483648%Z + i_14 -> i_14 ≤ 2147483647%Z + i_12 -> x_4 ≤ 2147483647%Z + i_14 -> i_14 ≤ 2147483648%Z + x_4 -> linked t -> is_uint16 i -> is_uint16 i_1 -> is_uint16 i_2 -> is_uint16 i_3 -> is_uint16 i_4 -> is_uint16 i_5 -> is_uint16 i_8 -> is_uint16 i_9 -> is_uint16 i_10 -> is_uint16 i_11 -> is_uint16 i_12 -> is_uint16 i_13 -> is_uint16 i_14 -> is_sint32 i_6 -> is_sint32 i_7 -> valid_rw t a 1%Z -> valid_rw t a_1 15%Z -> separated a 1%Z a_1 15%Z -> valid_rd t a_5 1%Z -> (if decide (i_7 = 0%Z) then i_3 = i_2 ∧ to_uint16 (i_3 - i_5) = 0%Z ∧ i_3 ≤ 2147483647%Z + i_5 ∧ i_5 ≤ 2147483648%Z + i_3 else i_2 = 0%Z) -> (if decide (i_6 = 0%Z) then ¬ i_1 = 0%Z ∧ to_uint16 (i_1 - i_4) = i_2 ∧ ¬ a_6 = Mk_addr 0%Z 0%Z ∧ shift a_3 (i_4 + i_9 + i_11 + i_12) = a_2 ∧ x_5 = i_1 ∧ i_4 ≤ i_1 ∧ i_1 ≤ 2147483647%Z + i_4 ∧ i_4 ≤ 2147483648%Z + i_1 ∧ (0%Z < i_1 -> valid_rd t a_6 i_1) else a_6 = a_2 ∧ x_5 = i_2) -> (i_2 = 0%Z -> i_7 < 0%Z) -> (Mk_addr 0%Z 0%Z = a_2 -> i_7 < 0%Z) -> (i_7 = 0%Z -> i_5 ≤ i_2 ∧ 2%Z ≤ i_5) -> (0%Z < i_8 -> valid_rd t (shift a_3 0%Z) i_8) -> (0%Z < i -> valid_rd t a_4 i) -> (a_6 = Mk_addr 0%Z 0%Z -> i_6 < 0%Z) -> (¬ Mk_addr 0%Z 0%Z = a_2 -> 0%Z < i_2 -> valid_rd t (shift a_2 0%Z) i_2) -> (0%Z < i_14 -> valid_rd t a_5 i_14) -> (x_5 = 0%Z -> i_6 < 0%Z) -> (i_6 = 0%Z -> i_13 ≤ x_5) -> (i_6 = 0%Z -> i_10 + i_13 ≤ x_5) -> (i_6 = 0%Z -> i_10 ≤ x_5 ∧ 2%Z ≤ i_10) -> (¬ a_6 = Mk_addr 0%Z 0%Z -> 0%Z < x_5 -> valid_rd t a_6 x_5) -> i_6 = 0%Z ∨ i_6 < 0%Z -> i_7 = 0%Z ∨ i_7 < 0%Z -> valid_rd t (shift a_1 12%Z) 1%Z.
Admitted.
