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 Why3.Cbits.Cbits.
Open Scope Z_scope.
Lemma goal1 (a_4 : addr) (a : addr) (a_1 : addr) (a_2 : addr) (a_3 : addr) (t_2 : addr -> Z) (t_1 : addr -> Z) (i_3 : Z) (t : Z -> Z) (i : Z) (p : bool) (i_2 : Z) (i_1 : Z) : let x : Z := base a_4 in let x_1 : Z := base a in let x_2 : Z := base a_1 in let x_3 : Z := base a_2 in let x_4 : Z := base a_3 in let x_5 : Z := t_2 a_3 in let a_5 : addr := shift a_4 0%Z in let x_6 : Z := t_1 a_5 in let x_7 : Z := land 31%Z x_6 in let x_8 : Z := land 3%Z (lsr x_6 6%Z) in let a_6 : addr := shift a_4 1%Z in let x_9 : Z := to_uint16 (i_3 - 1%Z) in let m : addr -> Z := fun_updt (fun_updt t_1 a_3 x_8) a_1 (land 1%Z (lsr x_6 5%Z)) in ¬ a_1 = a -> ¬ i_3 = 0%Z -> ¬ a_2 = a -> ¬ a_2 = a_1 -> ¬ a_3 = a -> ¬ a_3 = a_1 -> ¬ a_3 = a_2 -> ¬ Mk_addr 0%Z 0%Z = a_4 -> ¬ x = x_1 -> ¬ x = x_2 -> ¬ x = x_3 -> ¬ x = x_4 -> 0%Z ≤ i_3 -> region x_1 ≤ 0%Z -> region x_2 ≤ 0%Z -> region x_3 ≤ 0%Z -> region x_4 ≤ 0%Z -> region x ≤ 0%Z -> linked t -> is_uint16 i -> is_uint16 i_3 -> is_uint8 (t_2 a_1) -> is_uint16 (t_2 a_2) -> is_uint32 x_5 -> valid_rw t a 1%Z -> valid_rw t a_1 1%Z -> valid_rw t a_2 1%Z -> valid_rw t a_3 1%Z -> is_uint8 x_6 -> valid_rd t a_5 1%Z -> is_uint32 x_7 -> is_uint32 x_8 -> (if decide (x_7 = 31%Z) then p = false ∧ ¬ a_6 = Mk_addr 0%Z 0%Z ∧ ¬ x_9 = 0%Z ∧ to_uint16 (1%Z + i) = i_2 ∧ fun_updt (fun_updt m a i_1) a_2 i_2 = t_2 ∧ 0%Z < i ∧ i ≤ x_9 ∧ - 2147483649%Z ≤ i ∧ - 2147483647%Z ≤ i_3 ∧ i ≤ 2147483646%Z ∧ i_3 ≤ 2147483648%Z ∧ (0%Z < x_9 -> valid_rd t a_6 x_9) else x_7 = i_1 ∧ fun_updt (fun_updt m a x_7) a_2 1%Z = t_2) -> (0%Z < i_3 -> valid_rd t a_5 i_3) -> x_8 = 0%Z ∨ x_8 = 1%Z ∨ x_8 = 2%Z ∨ x_8 = 3%Z -> x_5 ≤ 3%Z.
Admitted.
