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 contiki_memb.Axiomatic13.Axiomatic13.
Require Import Why3.Memory.Memory.
Require Import contiki_memb.Compound.Compound.
Require Import contiki_memb.A_OccArray.A_OccArray.
Require Import Why3.Cint.Cint.
Open Scope Z_scope.
Theorem goal4 (a : addr) (t_3 : addr -> addr) (i : Z) (t_2 : addr -> Z) (t_1 : addr -> Z) (i_1 : Z) (t : Z -> Z) : let a_1 : addr := shift a 2%Z in let a_2 : addr := t_3 a_1 in let a_3 : addr := shift a_2 i in let x : Z := t_2 a_3 in let a_4 : addr := shift a 1%Z in let x_1 : Z := t_1 a_4 in ¬ x = 0%Z -> 0%Z ≤ i -> i_1 ≤ i -> 0%Z ≤ i_1 -> i < x_1 -> i ≤ x_1 -> region (base a) ≤ 0%Z -> i ≤ 2147483646%Z -> framed t_3 -> linked t -> sconst t_2 -> is_sint32 i -> is_sint32 i_1 -> is_uint16 x_1 -> is_sint32 (1%Z + i) -> p_valid_memb t t_3 t_1 a -> valid_rd t a_1 1%Z -> valid_rd t a_4 1%Z -> is_sint8 x -> valid_rd t a_3 1%Z -> (∀(i_2 : Z), 0%Z ≤ i_2 -> i_2 < i -> ¬ t_2 (shift a_2 i_2) = 0%Z) -> ¬ t_2 (shift a_2 i_1) = 0%Z.
Admitted.
