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 klibc_stdio.Compound.Compound.
Require Import Why3.Cint.Cint.
Require Import klibc_stdio.Axiomatic3.Axiomatic3.
Open Scope Z_scope.
Theorem goal85 (a_17 : addr) (t_1 : addr -> Z) (a_15 : addr) (t_2 : addr -> Z) (a_16 : addr) (a : addr) (a_6 : addr) (t_4 : addr -> addr) (a_3 : addr) (a_9 : addr) (a_2 : addr) (a_8 : addr) (a_1 : addr) (a_7 : addr) (i : Z) (i_1 : Z) (a_10 : addr) (a_4 : addr) (a_13 : addr) (a_12 : addr) (a_14 : addr) (i_3 : Z) (i_2 : Z) (i_4 : Z) (t : Z -> Z) (t_3 : addr -> Z) (a_5 : addr) (a_11 : addr) : let x : Z := base a_17 in let x_1 : Z := t_1 (shift a_15 8%Z) in let x_2 : Z := t_2 (shift a_16 9%Z) in let x_3 : Z := t_1 (shift a 9%Z) in let x_4 : Z := t_1 (shift a_6 9%Z) in let x_5 : Z := t_1 (shift a_15 9%Z) in let a_18 : addr := shift a_17 0%Z in let x_6 : Z := t_2 (shift (shift a_16 0%Z) 0%Z) in let a_19 : addr := t_4 (shift a_3 4%Z) in let a_20 : addr := t_4 (shift a_9 4%Z) in let a_21 : addr := t_4 (shift a_2 3%Z) in let a_22 : addr := t_4 (shift a_8 3%Z) in let a_23 : addr := shift (t_4 (shift a_1 5%Z)) 0%Z in let x_7 : Z := 32%Z + x_3 in let a_24 : addr := shift (t_4 (shift a_7 5%Z)) 0%Z in let x_8 : Z := 32%Z + x_4 in ¬ i = 0%Z -> ¬ i_1 = 0%Z -> shift a_10 0%Z = shift a_4 0%Z -> base a_13 = base a_12 -> x = base a_14 -> ¬ x_1 = 0%Z -> t_2 (shift a_16 7%Z) = 0%Z -> 0%Z ≤ i -> 0%Z ≤ i_1 -> 0%Z ≤ i_3 -> x_2 ≤ i_2 -> region (base a_10) ≤ 0%Z -> region x ≤ 0%Z -> - 1%Z ≤ i_4 -> framed t_4 -> linked t -> sconst t_3 -> is_uint32 i -> is_uint32 i_1 -> is_uint32 i_2 -> is_uint32 i_3 -> is_sint32 i_4 -> addr_le a_12 a_13 -> addr_le a_17 a_14 -> is_uint32 x_3 -> is_uint32 x_4 -> is_uint32 x_5 -> is_uint32 x_1 -> is_uint32 x_2 -> p_valid_io_file_pvt t t_4 t_1 a_5 -> p_valid_io_file_pvt t t_4 t_1 a_11 -> p_valid_io_file_pvt t t_4 t_1 a_15 -> addr_le a_14 (shift a_17 i_1) -> valid_rw t a_18 i_1 -> is_sint32 x_6 -> separated a_18 i_1 a_19 11%Z -> separated a_18 i_1 a_20 11%Z -> separated a_18 i_1 a_21 11%Z -> separated a_18 i_1 a_22 11%Z -> separated a_19 11%Z a_21 11%Z -> separated a_20 11%Z a_22 11%Z -> separated a_18 i_1 a_23 x_7 -> separated a_18 i_1 a_24 x_8 -> separated a_19 11%Z a_23 x_7 -> separated a_20 11%Z a_24 x_8 -> separated a_21 11%Z a_23 x_7 -> separated a_22 11%Z a_24 x_8 -> addr_le a_13 (shift a_12 (32%Z + x_5)) -> 0%Z ≤ x_6.
Admitted.
