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 contiki_memb.Compound.Compound.
Require Import contiki_memb.Axiomatic13.Axiomatic13.
Require Import contiki_memb.A_OccArray.A_OccArray.
Open Scope Z_scope.
Theorem goal11 (t_3 : addr -> addr) (t_1 : addr -> Z) (a_1 : addr) (a : addr) (t : Z -> Z) (t_2 : addr -> Z) : let x : Z := l__memb_index t_3 t_1 a_1 a in let a_2 : addr := shift a_1 1%Z in let x_1 : Z := t_1 a_2 in let a_3 : addr := shift a_1 3%Z in l__memb_ptr t_3 t_1 a_1 x = a -> region (base a) ≤ 0%Z -> region (base a_1) ≤ 0%Z -> 0%Z ≤ x -> x < x_1 -> x ≤ x_1 -> framed t_3 -> linked t -> sconst t_2 -> is_uint16 x_1 -> p_valid_memb t t_3 t_1 a_1 -> valid_rd t a_3 1%Z -> valid_rd t a_2 1%Z -> is_sint32 x -> (∀(i : Z), 0%Z ≤ i -> i < x -> ¬ shift (t_3 a_3) (i * t_1 (shift a_1 0%Z)) = a) -> valid_rd t (shift a_1 2%Z) 1%Z.
Admitted.
