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 klibc_string.Compound.Compound.
Open Scope Z_scope.
Theorem goal52 (a_10 : addr) (a_12 : addr) (t_1 : addr -> Z) (a_1 : addr) (a : addr) (i_2 : Z) (a_8 : addr) (i_1 : Z) (a_9 : addr) (i : Z) (t : Z -> Z) (a_7 : addr) (a_6 : addr) (a_5 : addr) (a_4 : addr) (a_3 : addr) (a_2 : addr) (a_11 : addr) : let x : Z := base a_10 in let x_1 : Z := base a_12 in let x_2 : Z := t_1 (shift a_1 0%Z) in let x_3 : Z := t_1 (shift a i_2) in let x_4 : Z := t_1 (shift a_1 1%Z) in let x_5 : Z := t_1 (shift a (to_uint32 (1%Z + i_2))) in let a_13 : addr := shift a_10 0%Z in let a_14 : addr := shift a_12 0%Z in let a_15 : addr := shift a_8 0%Z in let x_6 : Z := to_uint32 (i_1 - 2%Z) in let a_16 : addr := shift a_9 0%Z in ¬ i = 0%Z -> ¬ i_1 = 0%Z -> ¬ i_1 = 1%Z -> x = base a_1 -> x_1 = base a -> x_2 = x_3 -> x_4 = x_2 -> x_5 = x_4 -> 0%Z ≤ i -> i_1 ≤ i -> 0%Z ≤ i_1 -> 0%Z ≤ i_2 -> region x ≤ 0%Z -> region x_1 ≤ 0%Z -> i_2 ≤ to_uint32 (i - i_1) -> i_1 + i_2 ≤ 2%Z + i -> linked t -> is_uint32 i -> is_uint32 i_1 -> is_uint32 i_2 -> is_uint8 x_3 -> is_uint8 x_2 -> is_uint8 x_4 -> valid_rw t a_13 i_1 -> valid_rw t a_14 i -> separated a_14 i a_13 i_1 -> valid_rw t a_15 x_6 -> valid_rw t a_16 x_6 -> separated a_16 x_6 a_15 x_6 -> is_uint8 x_5 -> (0%Z < x_6 -> ¬ (∃(i_3 : Z), ¬ t_1 (shift a_7 i_3) = t_1 (shift a_6 i_3) ∧ 0%Z ≤ i_3 ∧ i_3 < x_6)) -> (∀(i_3 : Z), 0%Z ≤ i_3 -> i_3 < i_2 -> (∃(i_4 : Z), 0%Z ≤ i_4 -> 3%Z + i_4 ≤ i_1 -> ¬ t_1 (shift a_5 (2%Z + i_4 + i_3)) = t_1 (shift a_4 (2%Z + i_4)))) -> (∀(i_3 : Z), 0%Z ≤ i_3 -> i_3 + i_1 ≤ i -> (∃(i_4 : Z), ¬ t_1 (shift a_3 (i_4 + i_3)) = t_1 (shift a_2 i_4) ∧ 0%Z ≤ i_4 ∧ i_4 < i_1)) -> Mk_addr 0%Z 0%Z = a_11.
Admitted.
