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 : addr) (i_10 : Z) (i_9 : Z) (t : Z -> Z) (i_5 : Z) (i_6 : Z) (i_7 : Z) (i_8 : Z) (i : Z) (i_1 : Z) (i_3 : Z) (i_4 : Z) (i_11 : Z) (i_12 : Z) (i_13 : Z) (i_14 : Z) (p : bool) (p_4 : bool) (p_1 : bool) (p_5 : bool) (p_2 : bool) (p_6 : bool) (p_3 : bool) (p_7 : bool) (i_2 : Z) (t_1 : addr -> Z) : let a_1 : addr := shift a (4%Z + i_10) in ¬ i_9 = 0%Z -> ¬ Mk_addr 0%Z 0%Z = a -> 0%Z ≤ i_9 -> region (base a) ≤ 0%Z -> linked t -> is_uint16 i_5 -> is_uint16 i_6 -> is_uint16 i_7 -> is_uint16 i_8 -> is_uint16 i_9 -> is_uint16 i_10 -> is_sint32 i -> is_sint32 i_1 -> is_sint32 i_3 -> is_sint32 i_4 -> is_sint32 i_11 -> is_sint32 i_12 -> is_sint32 i_13 -> is_sint32 i_14 -> (if decide (i_4 = 0%Z) then to_uint16 (i_9 - 2%Z) = i_5 ∧ - 2147483646%Z ≤ i_9 ∧ valid_rd t (shift a 2%Z) 1%Z ∧ (if decide (i_13 = 0%Z) then p = true ∧ p_4 = true ∧ (if decide (i_11 = 0%Z) then i = 0%Z else i = 1%Z) else p = true ∧ p_4 = true ∧ i = 1%Z) ∧ (if decide (i = 0%Z) then p = true ∧ p_4 = true ∧ i_3 = - 3293%Z else (p_1 = true) = (p = true) ∧ (p_5 = true) = (p_4 = true) ∧ to_uint16 (i_5 - 1%Z) = i_6 ∧ (if decide (i_6 = 0%Z) then p_1 = true ∧ p_5 = true ∧ i_3 = 0%Z else (p_2 = true) = (p_1 = true) ∧ (p_6 = true) = (p_5 = true) ∧ valid_rd t (shift a (2%Z + i_6)) 1%Z ∧ (if decide (i_14 = 0%Z) then if decide (i_12 = 0%Z) then i_1 = 0%Z else i_1 = 1%Z else i_1 = 1%Z) ∧ (if decide (i_1 = 0%Z) then p_2 = true ∧ p_6 = true ∧ i_3 = - 3310%Z else (p_3 = true) = (p_2 = true) ∧ (p_7 = true) = (p_6 = true) ∧ i_2 = i_1 ∧ i_8 = i_7 ∧ to_uint16 (i_6 - 1%Z) = i_8 ∧ i_10 ≤ i_8 ∧ 0%Z ≤ i_10 ∧ (if decide (i_10 < i_8) then p_3 = true ∧ p_7 = true ∧ i_3 = - 3328%Z ∧ ¬ t_1 a_1 = 45%Z ∧ valid_rd t a_1 1%Z else p_3 = true ∧ p_7 = true ∧ i_3 = 0%Z)))) else i_4 = i_3) -> (i_4 = 0%Z -> 2%Z ≤ i_9 ∧ 3%Z ≤ i_9 ∧ i_9 ≤ 65%Z) -> (0%Z < i_9 -> valid_rd t (shift a 0%Z) i_9) -> i_4 = 0%Z ∨ i_4 < 0%Z -> i_3 = 0%Z ∨ i_3 < 0%Z.
Admitted.
