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 x509_parser.Globals.Globals.
Open Scope Z_scope.
Theorem goal0 : let a : addr := Mk_addr 2708%Z 0%Z in ∀(i_9 : Z) (i_8 : Z) (i_7 : Z) (i_6 : Z) (i_5 : Z) (i_4 : Z) (i_3 : Z) (i_2 : Z) (i_1 : Z) (i : Z) (t_1 : Z -> Z) (t : Z -> Z) (t_2 : Z -> addr) (t_5 : addr -> Z) (t_4 : addr -> Z) (t_3 : addr -> Z) (t_7 : addr -> addr) (t_6 : addr -> addr) (a_4 : addr) (a_3 : addr) (a_2 : addr) (a_1 : addr), let x : Z := base a_3 in let x_1 : Z := base a_2 in let a_5 : addr := shift a_4 4%Z in let x_2 : Z := t_5 a_5 in let a_6 : addr := shift a_3 i_6 in let m : Z -> Z := fun_updt t 2708%Z 4%Z in let a_7 : addr := shift a_4 6%Z in let x_3 : Z := i_7 + i_9 in let a_8 : addr := shift a_3 0%Z in ¬ i_5 = 0%Z -> ¬ Mk_addr 0%Z 0%Z = a_3 -> ¬ x = x_1 -> 0%Z ≤ i_5 -> region x_1 ≤ 0%Z -> region x ≤ 0%Z -> framed t_7 -> linked t -> is_uint16 i_1 -> 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_2 -> is_sint32 i_3 -> is_sint32 i_4 -> valid_rw t a_2 1%Z -> is_uint8 x_2 -> (if decide (i_4 = 0%Z) then 0%Z ≤ i_8 ∧ separated a_6 1%Z a 4%Z ∧ (if decide (i_3 = 0%Z) then havoc t_3 (fun_updt (fun_updt t_4 (shift a 2%Z) 0%Z) (shift a 3%Z) 0%Z) a 4%Z = t_5 ∧ valid_rd m a_5 1%Z ∧ (if decide (x_2 = 2%Z) then i_1 ≤ 2147483648%Z + i_8 ∧ i_8 ≤ 2147483647%Z + i_1 ∧ valid_rd m a_7 1%Z ∧ (if decide (havoc t_6 (fun_updt (fun_updt t_7 (shift a 0%Z) (Mk_addr 0%Z 0%Z)) (shift a 1%Z) (Mk_addr 0%Z 0%Z)) a 4%Z a_7 = Mk_addr 0%Z 0%Z) then i_2 = - 4371%Z else if decide (i = 0%Z) then i_2 = 0%Z ∧ - 2147483648%Z ≤ x_3 ∧ x_3 ≤ 2147483647%Z ∧ valid_rw t_1 a_1 1%Z else i_2 = i) else i_2 = - 4358%Z) else i_3 = i_2) ∧ (i_8 = 0%Z -> i_3 < 0%Z) ∧ (a_6 = Mk_addr 0%Z 0%Z -> i_3 < 0%Z) ∧ (i_3 = 0%Z -> i_1 ≤ i_8 ∧ 2%Z ≤ i_1) ∧ (i_3 = 0%Z -> valid_rd m a_4 8%Z) ∧ (¬ a_6 = Mk_addr 0%Z 0%Z -> 0%Z < i_8 -> valid_rd m a_6 i_8) ∧ (i_3 = 0%Z -> (∃(i_10 : Z), t_2 i_10 = a_4 ∧ is_uint8 i_10)) ∧ (i_3 = 0%Z ∨ i_3 < 0%Z) else i_4 = i_2) -> (i_4 = 0%Z -> i_8 ≤ i_5) -> (i_4 = 0%Z -> i_6 + i_8 ≤ i_5) -> (i_4 = 0%Z -> i_6 ≤ i_5 ∧ 2%Z ≤ i_6) -> (0%Z < i_5 -> valid_rd t a_8 i_5) -> (0%Z < i_5 -> valid_rd m a_8 i_5) -> i_4 = 0%Z ∨ i_4 < 0%Z -> i_2 = 0%Z ∨ i_2 < 0%Z.
Admitted.
