file_name
stringlengths 5
52
| name
stringlengths 4
95
| original_source_type
stringlengths 0
23k
| source_type
stringlengths 9
23k
| source_definition
stringlengths 9
57.9k
| source
dict | source_range
dict | file_context
stringlengths 0
721k
| dependencies
dict | opens_and_abbrevs
listlengths 2
94
| vconfig
dict | interleaved
bool 1
class | verbose_type
stringlengths 1
7.42k
| effect
stringclasses 118
values | effect_flags
sequencelengths 0
2
| mutual_with
sequencelengths 0
11
| ideal_premises
sequencelengths 0
236
| proof_features
sequencelengths 0
1
| is_simple_lemma
bool 2
classes | is_div
bool 2
classes | is_proof
bool 2
classes | is_simply_typed
bool 2
classes | is_type
bool 2
classes | partial_definition
stringlengths 5
3.99k
| completed_definiton
stringlengths 1
1.63M
| isa_cross_project_example
bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
DM4F.fst | DM4F.ite_wp | val ite_wp (#a: Type) (#st: Type0) (wpf wpg: wp st a) (b: bool) : wp st a | val ite_wp (#a: Type) (#st: Type0) (wpf wpg: wp st a) (b: bool) : wp st a | let ite_wp (#a:Type) (#st:Type0) (wpf wpg:wp st a) (b:bool) : wp st a =
fun s0 p -> (b ==> wpf s0 p) /\ ((~b) ==> wpg s0 p) | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 43,
"start_col": 0,
"start_line": 42
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. p1 r ==> p2 r) ==> w s0 p1 ==> w s0 p2
// ^ this version seems to be less SMT-friendly
forall s0 p1 p2. (forall x s1. p1 (x, s1) ==> p2 (x, s1)) ==> w s0 p1 ==> w s0 p2
type wp st a = w:(wp0 st a){st_monotonic w}
type repr (a:Type u#ua) (st:Type0) (wp : wp u#ua st a) : Type u#ua =
s0:st -> PURE (a & st) (as_pure_wp (wp s0))
unfold
let return_wp (#a:Type) (#st:Type0) (x:a) : wp st a = fun s0 p -> p (x, s0)
let return (a:Type) (x:a) (st:Type0) : repr a st (return_wp x) =
fun s0 -> (x, s0)
unfold
let bind_wp (#a #b:Type) (#st:Type0) (wp_c:wp st a) (wp_f:a -> wp st b) : wp st b =
fun s0 p -> wp_c s0 (fun (y, s1) -> wp_f y s1 p)
let bind (a:Type) (b:Type) (st:Type0)
(wp_c : wp st a)
(wp_f : a -> wp st b)
(c : repr a st wp_c)
(f : (x:a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f)
= fun s0 -> let (y, s1) = c s0 in
f y s1 | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | wpf: DM4F.wp st a -> wpg: DM4F.wp st a -> b: Prims.bool -> DM4F.wp st a | Prims.Tot | [
"total"
] | [] | [
"DM4F.wp",
"Prims.bool",
"FStar.Pervasives.Native.tuple2",
"Prims.l_and",
"Prims.l_imp",
"Prims.b2t",
"Prims.l_not",
"Prims.logical"
] | [] | false | false | false | true | false | let ite_wp (#a: Type) (#st: Type0) (wpf wpg: wp st a) (b: bool) : wp st a =
| fun s0 p -> (b ==> wpf s0 p) /\ ((~b) ==> wpg s0 p) | false |
DM4F.fst | DM4F.lift_pure_st | val lift_pure_st (a wp st: _) (f: (unit -> PURE a wp)) : repr a st (lift_wp wp) | val lift_pure_st (a wp st: _) (f: (unit -> PURE a wp)) : repr a st (lift_wp wp) | let lift_pure_st a wp st (f : unit -> PURE a wp)
: repr a st (lift_wp wp)
= elim_pure_wp_monotonicity_forall ();
fun s0 -> (f (), s0) | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 88,
"start_col": 0,
"start_line": 85
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. p1 r ==> p2 r) ==> w s0 p1 ==> w s0 p2
// ^ this version seems to be less SMT-friendly
forall s0 p1 p2. (forall x s1. p1 (x, s1) ==> p2 (x, s1)) ==> w s0 p1 ==> w s0 p2
type wp st a = w:(wp0 st a){st_monotonic w}
type repr (a:Type u#ua) (st:Type0) (wp : wp u#ua st a) : Type u#ua =
s0:st -> PURE (a & st) (as_pure_wp (wp s0))
unfold
let return_wp (#a:Type) (#st:Type0) (x:a) : wp st a = fun s0 p -> p (x, s0)
let return (a:Type) (x:a) (st:Type0) : repr a st (return_wp x) =
fun s0 -> (x, s0)
unfold
let bind_wp (#a #b:Type) (#st:Type0) (wp_c:wp st a) (wp_f:a -> wp st b) : wp st b =
fun s0 p -> wp_c s0 (fun (y, s1) -> wp_f y s1 p)
let bind (a:Type) (b:Type) (st:Type0)
(wp_c : wp st a)
(wp_f : a -> wp st b)
(c : repr a st wp_c)
(f : (x:a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f)
= fun s0 -> let (y, s1) = c s0 in
f y s1
unfold
let ite_wp (#a:Type) (#st:Type0) (wpf wpg:wp st a) (b:bool) : wp st a =
fun s0 p -> (b ==> wpf s0 p) /\ ((~b) ==> wpg s0 p)
let if_then_else
(a:Type)
(st:Type0)
(wpf wpg : wp st a)
(f : repr a st wpf)
(g : repr a st wpg)
(b : bool)
: Type
= repr a st (ite_wp wpf wpg b)
unfold
let stronger
(#a:Type) (#st:Type0)
(w1 w2 : wp st a)
: Type0
= forall s0 p. w1 s0 p ==> w2 s0 p
let subcomp
(a:Type)
(st:Type0)
(wpf wpg : wp st a)
(f : repr a st wpf)
: Pure (repr a st wpg)
(requires (stronger wpg wpf))
(ensures (fun _ -> True))
= f
total
reifiable
reflectable
effect {
ST (a:Type) ([@@@ effect_param] st:Type0) (_:wp st a)
with {repr; return; bind; if_then_else; subcomp}
}
unfold
let lift_wp (#a:Type) (#st:Type0) (w:pure_wp a) : wp st a =
elim_pure_wp_monotonicity_forall ();
fun s0 p -> w (fun x -> p (x, s0)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: Type -> wp: Prims.pure_wp a -> st: Type0 -> f: (_: Prims.unit -> Prims.PURE a)
-> DM4F.repr a st (DM4F.lift_wp wp) | Prims.Tot | [
"total"
] | [] | [
"Prims.pure_wp",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2",
"FStar.Monotonic.Pure.elim_pure_wp_monotonicity_forall",
"DM4F.repr",
"DM4F.lift_wp"
] | [] | false | false | false | false | false | let lift_pure_st a wp st (f: (unit -> PURE a wp)) : repr a st (lift_wp wp) =
| elim_pure_wp_monotonicity_forall ();
fun s0 -> (f (), s0) | false |
Spec.Curve25519.Test.fst | Spec.Curve25519.Test.point2 | val point2:lbytes 32 | val point2:lbytes 32 | let point2 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0xe5uy; 0x21uy; 0x0fuy; 0x12uy; 0x78uy; 0x68uy; 0x11uy; 0xd3uy;
0xf4uy; 0xb7uy; 0x95uy; 0x9duy; 0x05uy; 0x38uy; 0xaeuy; 0x2cuy;
0x31uy; 0xdbuy; 0xe7uy; 0x10uy; 0x6fuy; 0xc0uy; 0x3cuy; 0x3euy;
0xfcuy; 0x4cuy; 0xd5uy; 0x49uy; 0xc7uy; 0x15uy; 0xa4uy; 0x93uy
] in
assert_norm (List.Tot.length l == 32);
of_list l | {
"file_name": "specs/tests/Spec.Curve25519.Test.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 11,
"end_line": 57,
"start_col": 0,
"start_line": 49
} | module Spec.Curve25519.Test
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Curve25519
module PS = Lib.PrintSequence
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(* ********************* *)
(* RFC 7748 Test Vectors *)
(* ********************* *)
let scalar1 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0xa5uy; 0x46uy; 0xe3uy; 0x6buy; 0xf0uy; 0x52uy; 0x7cuy; 0x9duy;
0x3buy; 0x16uy; 0x15uy; 0x4buy; 0x82uy; 0x46uy; 0x5euy; 0xdduy;
0x62uy; 0x14uy; 0x4cuy; 0x0auy; 0xc1uy; 0xfcuy; 0x5auy; 0x18uy;
0x50uy; 0x6auy; 0x22uy; 0x44uy; 0xbauy; 0x44uy; 0x9auy; 0xc4uy
] in
assert_norm (List.Tot.length l == 32);
of_list l
let scalar2 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0x4buy; 0x66uy; 0xe9uy; 0xd4uy; 0xd1uy; 0xb4uy; 0x67uy; 0x3cuy;
0x5auy; 0xd2uy; 0x26uy; 0x91uy; 0x95uy; 0x7duy; 0x6auy; 0xf5uy;
0xc1uy; 0x1buy; 0x64uy; 0x21uy; 0xe0uy; 0xeauy; 0x01uy; 0xd4uy;
0x2cuy; 0xa4uy; 0x16uy; 0x9euy; 0x79uy; 0x18uy; 0xbauy; 0x0duy
] in
assert_norm (List.Tot.length l == 32);
of_list l
let point1 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0xe6uy; 0xdbuy; 0x68uy; 0x67uy; 0x58uy; 0x30uy; 0x30uy; 0xdbuy;
0x35uy; 0x94uy; 0xc1uy; 0xa4uy; 0x24uy; 0xb1uy; 0x5fuy; 0x7cuy;
0x72uy; 0x66uy; 0x24uy; 0xecuy; 0x26uy; 0xb3uy; 0x35uy; 0x3buy;
0x10uy; 0xa9uy; 0x03uy; 0xa6uy; 0xd0uy; 0xabuy; 0x1cuy; 0x4cuy
] in
assert_norm (List.Tot.length l == 32);
of_list l | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.PrintSequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.IO.fst.checked",
"FStar.All.fst.checked"
],
"interface_file": false,
"source_file": "Spec.Curve25519.Test.fst"
} | [
{
"abbrev": true,
"full_module": "Lib.PrintSequence",
"short_module": "PS"
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Lib.Sequence.lseq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC) 32 | Prims.Tot | [
"total"
] | [] | [
"Lib.Sequence.of_list",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.int",
"FStar.List.Tot.Base.length",
"Prims.list",
"FStar.List.Tot.Base.map",
"FStar.UInt8.t",
"Lib.RawIntTypes.u8_from_UInt8",
"Prims.Cons",
"FStar.UInt8.__uint_to_t",
"Prims.Nil"
] | [] | false | false | false | false | false | let point2:lbytes 32 =
| let l =
List.Tot.map u8_from_UInt8
[
0xe5uy; 0x21uy; 0x0fuy; 0x12uy; 0x78uy; 0x68uy; 0x11uy; 0xd3uy; 0xf4uy; 0xb7uy; 0x95uy; 0x9duy;
0x05uy; 0x38uy; 0xaeuy; 0x2cuy; 0x31uy; 0xdbuy; 0xe7uy; 0x10uy; 0x6fuy; 0xc0uy; 0x3cuy; 0x3euy;
0xfcuy; 0x4cuy; 0xd5uy; 0x49uy; 0xc7uy; 0x15uy; 0xa4uy; 0x93uy
]
in
assert_norm (List.Tot.length l == 32);
of_list l | false |
DM4F.fst | DM4F.bind | val bind
(a b: Type)
(st: Type0)
(wp_c: wp st a)
(wp_f: (a -> wp st b))
(c: repr a st wp_c)
(f: (x: a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f) | val bind
(a b: Type)
(st: Type0)
(wp_c: wp st a)
(wp_f: (a -> wp st b))
(c: repr a st wp_c)
(f: (x: a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f) | let bind (a:Type) (b:Type) (st:Type0)
(wp_c : wp st a)
(wp_f : a -> wp st b)
(c : repr a st wp_c)
(f : (x:a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f)
= fun s0 -> let (y, s1) = c s0 in
f y s1 | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 15,
"end_line": 39,
"start_col": 0,
"start_line": 32
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. p1 r ==> p2 r) ==> w s0 p1 ==> w s0 p2
// ^ this version seems to be less SMT-friendly
forall s0 p1 p2. (forall x s1. p1 (x, s1) ==> p2 (x, s1)) ==> w s0 p1 ==> w s0 p2
type wp st a = w:(wp0 st a){st_monotonic w}
type repr (a:Type u#ua) (st:Type0) (wp : wp u#ua st a) : Type u#ua =
s0:st -> PURE (a & st) (as_pure_wp (wp s0))
unfold
let return_wp (#a:Type) (#st:Type0) (x:a) : wp st a = fun s0 p -> p (x, s0)
let return (a:Type) (x:a) (st:Type0) : repr a st (return_wp x) =
fun s0 -> (x, s0)
unfold
let bind_wp (#a #b:Type) (#st:Type0) (wp_c:wp st a) (wp_f:a -> wp st b) : wp st b =
fun s0 p -> wp_c s0 (fun (y, s1) -> wp_f y s1 p) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
a: Type ->
b: Type ->
st: Type0 ->
wp_c: DM4F.wp st a ->
wp_f: (_: a -> DM4F.wp st b) ->
c: DM4F.repr a st wp_c ->
f: (x: a -> DM4F.repr b st (wp_f x))
-> DM4F.repr b st (DM4F.bind_wp wp_c wp_f) | Prims.Tot | [
"total"
] | [] | [
"DM4F.wp",
"DM4F.repr",
"FStar.Pervasives.Native.tuple2",
"DM4F.bind_wp"
] | [] | false | false | false | false | false | let bind
(a b: Type)
(st: Type0)
(wp_c: wp st a)
(wp_f: (a -> wp st b))
(c: repr a st wp_c)
(f: (x: a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f) =
| fun s0 ->
let y, s1 = c s0 in
f y s1 | false |
DM4F.fst | DM4F.subcomp | val subcomp (a: Type) (st: Type0) (wpf wpg: wp st a) (f: repr a st wpf)
: Pure (repr a st wpg) (requires (stronger wpg wpf)) (ensures (fun _ -> True)) | val subcomp (a: Type) (st: Type0) (wpf wpg: wp st a) (f: repr a st wpf)
: Pure (repr a st wpg) (requires (stronger wpg wpf)) (ensures (fun _ -> True)) | let subcomp
(a:Type)
(st:Type0)
(wpf wpg : wp st a)
(f : repr a st wpf)
: Pure (repr a st wpg)
(requires (stronger wpg wpf))
(ensures (fun _ -> True))
= f | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 70,
"start_col": 0,
"start_line": 62
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. p1 r ==> p2 r) ==> w s0 p1 ==> w s0 p2
// ^ this version seems to be less SMT-friendly
forall s0 p1 p2. (forall x s1. p1 (x, s1) ==> p2 (x, s1)) ==> w s0 p1 ==> w s0 p2
type wp st a = w:(wp0 st a){st_monotonic w}
type repr (a:Type u#ua) (st:Type0) (wp : wp u#ua st a) : Type u#ua =
s0:st -> PURE (a & st) (as_pure_wp (wp s0))
unfold
let return_wp (#a:Type) (#st:Type0) (x:a) : wp st a = fun s0 p -> p (x, s0)
let return (a:Type) (x:a) (st:Type0) : repr a st (return_wp x) =
fun s0 -> (x, s0)
unfold
let bind_wp (#a #b:Type) (#st:Type0) (wp_c:wp st a) (wp_f:a -> wp st b) : wp st b =
fun s0 p -> wp_c s0 (fun (y, s1) -> wp_f y s1 p)
let bind (a:Type) (b:Type) (st:Type0)
(wp_c : wp st a)
(wp_f : a -> wp st b)
(c : repr a st wp_c)
(f : (x:a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f)
= fun s0 -> let (y, s1) = c s0 in
f y s1
unfold
let ite_wp (#a:Type) (#st:Type0) (wpf wpg:wp st a) (b:bool) : wp st a =
fun s0 p -> (b ==> wpf s0 p) /\ ((~b) ==> wpg s0 p)
let if_then_else
(a:Type)
(st:Type0)
(wpf wpg : wp st a)
(f : repr a st wpf)
(g : repr a st wpg)
(b : bool)
: Type
= repr a st (ite_wp wpf wpg b)
unfold
let stronger
(#a:Type) (#st:Type0)
(w1 w2 : wp st a)
: Type0
= forall s0 p. w1 s0 p ==> w2 s0 p | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: Type -> st: Type0 -> wpf: DM4F.wp st a -> wpg: DM4F.wp st a -> f: DM4F.repr a st wpf
-> Prims.Pure (DM4F.repr a st wpg) | Prims.Pure | [] | [] | [
"DM4F.wp",
"DM4F.repr",
"DM4F.stronger",
"Prims.l_True"
] | [] | false | false | false | false | false | let subcomp (a: Type) (st: Type0) (wpf wpg: wp st a) (f: repr a st wpf)
: Pure (repr a st wpg) (requires (stronger wpg wpf)) (ensures (fun _ -> True)) =
| f | false |
DM4F.fst | DM4F.lift_wp | val lift_wp (#a: Type) (#st: Type0) (w: pure_wp a) : wp st a | val lift_wp (#a: Type) (#st: Type0) (w: pure_wp a) : wp st a | let lift_wp (#a:Type) (#st:Type0) (w:pure_wp a) : wp st a =
elim_pure_wp_monotonicity_forall ();
fun s0 p -> w (fun x -> p (x, s0)) | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 83,
"start_col": 0,
"start_line": 81
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. p1 r ==> p2 r) ==> w s0 p1 ==> w s0 p2
// ^ this version seems to be less SMT-friendly
forall s0 p1 p2. (forall x s1. p1 (x, s1) ==> p2 (x, s1)) ==> w s0 p1 ==> w s0 p2
type wp st a = w:(wp0 st a){st_monotonic w}
type repr (a:Type u#ua) (st:Type0) (wp : wp u#ua st a) : Type u#ua =
s0:st -> PURE (a & st) (as_pure_wp (wp s0))
unfold
let return_wp (#a:Type) (#st:Type0) (x:a) : wp st a = fun s0 p -> p (x, s0)
let return (a:Type) (x:a) (st:Type0) : repr a st (return_wp x) =
fun s0 -> (x, s0)
unfold
let bind_wp (#a #b:Type) (#st:Type0) (wp_c:wp st a) (wp_f:a -> wp st b) : wp st b =
fun s0 p -> wp_c s0 (fun (y, s1) -> wp_f y s1 p)
let bind (a:Type) (b:Type) (st:Type0)
(wp_c : wp st a)
(wp_f : a -> wp st b)
(c : repr a st wp_c)
(f : (x:a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f)
= fun s0 -> let (y, s1) = c s0 in
f y s1
unfold
let ite_wp (#a:Type) (#st:Type0) (wpf wpg:wp st a) (b:bool) : wp st a =
fun s0 p -> (b ==> wpf s0 p) /\ ((~b) ==> wpg s0 p)
let if_then_else
(a:Type)
(st:Type0)
(wpf wpg : wp st a)
(f : repr a st wpf)
(g : repr a st wpg)
(b : bool)
: Type
= repr a st (ite_wp wpf wpg b)
unfold
let stronger
(#a:Type) (#st:Type0)
(w1 w2 : wp st a)
: Type0
= forall s0 p. w1 s0 p ==> w2 s0 p
let subcomp
(a:Type)
(st:Type0)
(wpf wpg : wp st a)
(f : repr a st wpf)
: Pure (repr a st wpg)
(requires (stronger wpg wpf))
(ensures (fun _ -> True))
= f
total
reifiable
reflectable
effect {
ST (a:Type) ([@@@ effect_param] st:Type0) (_:wp st a)
with {repr; return; bind; if_then_else; subcomp}
} | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | w: Prims.pure_wp a -> DM4F.wp st a | Prims.Tot | [
"total"
] | [] | [
"Prims.pure_wp",
"FStar.Pervasives.Native.tuple2",
"Prims.l_True",
"FStar.Pervasives.Native.Mktuple2",
"Prims.pure_pre",
"Prims.unit",
"FStar.Monotonic.Pure.elim_pure_wp_monotonicity_forall",
"DM4F.wp"
] | [] | false | false | false | true | false | let lift_wp (#a: Type) (#st: Type0) (w: pure_wp a) : wp st a =
| elim_pure_wp_monotonicity_forall ();
fun s0 p -> w (fun x -> p (x, s0)) | false |
DM4F.fst | DM4F.get | val get: #st: _ -> Prims.unit -> ST st st (fun s0 p -> p (s0, s0)) | val get: #st: _ -> Prims.unit -> ST st st (fun s0 p -> p (s0, s0)) | let get #st () : ST st st (fun s0 p -> p (s0, s0)) =
ST?.reflect (fun s0 -> (s0, s0)) | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 96,
"start_col": 0,
"start_line": 95
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. p1 r ==> p2 r) ==> w s0 p1 ==> w s0 p2
// ^ this version seems to be less SMT-friendly
forall s0 p1 p2. (forall x s1. p1 (x, s1) ==> p2 (x, s1)) ==> w s0 p1 ==> w s0 p2
type wp st a = w:(wp0 st a){st_monotonic w}
type repr (a:Type u#ua) (st:Type0) (wp : wp u#ua st a) : Type u#ua =
s0:st -> PURE (a & st) (as_pure_wp (wp s0))
unfold
let return_wp (#a:Type) (#st:Type0) (x:a) : wp st a = fun s0 p -> p (x, s0)
let return (a:Type) (x:a) (st:Type0) : repr a st (return_wp x) =
fun s0 -> (x, s0)
unfold
let bind_wp (#a #b:Type) (#st:Type0) (wp_c:wp st a) (wp_f:a -> wp st b) : wp st b =
fun s0 p -> wp_c s0 (fun (y, s1) -> wp_f y s1 p)
let bind (a:Type) (b:Type) (st:Type0)
(wp_c : wp st a)
(wp_f : a -> wp st b)
(c : repr a st wp_c)
(f : (x:a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f)
= fun s0 -> let (y, s1) = c s0 in
f y s1
unfold
let ite_wp (#a:Type) (#st:Type0) (wpf wpg:wp st a) (b:bool) : wp st a =
fun s0 p -> (b ==> wpf s0 p) /\ ((~b) ==> wpg s0 p)
let if_then_else
(a:Type)
(st:Type0)
(wpf wpg : wp st a)
(f : repr a st wpf)
(g : repr a st wpg)
(b : bool)
: Type
= repr a st (ite_wp wpf wpg b)
unfold
let stronger
(#a:Type) (#st:Type0)
(w1 w2 : wp st a)
: Type0
= forall s0 p. w1 s0 p ==> w2 s0 p
let subcomp
(a:Type)
(st:Type0)
(wpf wpg : wp st a)
(f : repr a st wpf)
: Pure (repr a st wpg)
(requires (stronger wpg wpf))
(ensures (fun _ -> True))
= f
total
reifiable
reflectable
effect {
ST (a:Type) ([@@@ effect_param] st:Type0) (_:wp st a)
with {repr; return; bind; if_then_else; subcomp}
}
unfold
let lift_wp (#a:Type) (#st:Type0) (w:pure_wp a) : wp st a =
elim_pure_wp_monotonicity_forall ();
fun s0 p -> w (fun x -> p (x, s0))
let lift_pure_st a wp st (f : unit -> PURE a wp)
: repr a st (lift_wp wp)
= elim_pure_wp_monotonicity_forall ();
fun s0 -> (f (), s0)
sub_effect PURE ~> ST = lift_pure_st
let null #st #a : wp st a =
fun s0 p -> forall r. p r | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> DM4F.ST st | DM4F.ST | [] | [] | [
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2"
] | [] | false | true | false | false | false | let get #st () : ST st st (fun s0 p -> p (s0, s0)) =
| ST?.reflect (fun s0 -> (s0, s0)) | false |
DM4F.fst | DM4F.put | val put (#st: _) (s: st) : ST unit st (fun _ p -> p ((), s)) | val put (#st: _) (s: st) : ST unit st (fun _ p -> p ((), s)) | let put #st (s:st) : ST unit st (fun _ p -> p ((), s)) =
ST?.reflect (fun _ -> ((), s)) | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 99,
"start_col": 0,
"start_line": 98
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. p1 r ==> p2 r) ==> w s0 p1 ==> w s0 p2
// ^ this version seems to be less SMT-friendly
forall s0 p1 p2. (forall x s1. p1 (x, s1) ==> p2 (x, s1)) ==> w s0 p1 ==> w s0 p2
type wp st a = w:(wp0 st a){st_monotonic w}
type repr (a:Type u#ua) (st:Type0) (wp : wp u#ua st a) : Type u#ua =
s0:st -> PURE (a & st) (as_pure_wp (wp s0))
unfold
let return_wp (#a:Type) (#st:Type0) (x:a) : wp st a = fun s0 p -> p (x, s0)
let return (a:Type) (x:a) (st:Type0) : repr a st (return_wp x) =
fun s0 -> (x, s0)
unfold
let bind_wp (#a #b:Type) (#st:Type0) (wp_c:wp st a) (wp_f:a -> wp st b) : wp st b =
fun s0 p -> wp_c s0 (fun (y, s1) -> wp_f y s1 p)
let bind (a:Type) (b:Type) (st:Type0)
(wp_c : wp st a)
(wp_f : a -> wp st b)
(c : repr a st wp_c)
(f : (x:a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f)
= fun s0 -> let (y, s1) = c s0 in
f y s1
unfold
let ite_wp (#a:Type) (#st:Type0) (wpf wpg:wp st a) (b:bool) : wp st a =
fun s0 p -> (b ==> wpf s0 p) /\ ((~b) ==> wpg s0 p)
let if_then_else
(a:Type)
(st:Type0)
(wpf wpg : wp st a)
(f : repr a st wpf)
(g : repr a st wpg)
(b : bool)
: Type
= repr a st (ite_wp wpf wpg b)
unfold
let stronger
(#a:Type) (#st:Type0)
(w1 w2 : wp st a)
: Type0
= forall s0 p. w1 s0 p ==> w2 s0 p
let subcomp
(a:Type)
(st:Type0)
(wpf wpg : wp st a)
(f : repr a st wpf)
: Pure (repr a st wpg)
(requires (stronger wpg wpf))
(ensures (fun _ -> True))
= f
total
reifiable
reflectable
effect {
ST (a:Type) ([@@@ effect_param] st:Type0) (_:wp st a)
with {repr; return; bind; if_then_else; subcomp}
}
unfold
let lift_wp (#a:Type) (#st:Type0) (w:pure_wp a) : wp st a =
elim_pure_wp_monotonicity_forall ();
fun s0 p -> w (fun x -> p (x, s0))
let lift_pure_st a wp st (f : unit -> PURE a wp)
: repr a st (lift_wp wp)
= elim_pure_wp_monotonicity_forall ();
fun s0 -> (f (), s0)
sub_effect PURE ~> ST = lift_pure_st
let null #st #a : wp st a =
fun s0 p -> forall r. p r
let get #st () : ST st st (fun s0 p -> p (s0, s0)) =
ST?.reflect (fun s0 -> (s0, s0)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | s: st -> DM4F.ST Prims.unit | DM4F.ST | [] | [] | [
"FStar.Pervasives.Native.Mktuple2",
"Prims.unit",
"FStar.Pervasives.Native.tuple2"
] | [] | false | true | false | false | false | let put #st (s: st) : ST unit st (fun _ p -> p ((), s)) =
| ST?.reflect (fun _ -> ((), s)) | false |
Spec.Curve25519.Test.fst | Spec.Curve25519.Test.point1 | val point1:lbytes 32 | val point1:lbytes 32 | let point1 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0xe6uy; 0xdbuy; 0x68uy; 0x67uy; 0x58uy; 0x30uy; 0x30uy; 0xdbuy;
0x35uy; 0x94uy; 0xc1uy; 0xa4uy; 0x24uy; 0xb1uy; 0x5fuy; 0x7cuy;
0x72uy; 0x66uy; 0x24uy; 0xecuy; 0x26uy; 0xb3uy; 0x35uy; 0x3buy;
0x10uy; 0xa9uy; 0x03uy; 0xa6uy; 0xd0uy; 0xabuy; 0x1cuy; 0x4cuy
] in
assert_norm (List.Tot.length l == 32);
of_list l | {
"file_name": "specs/tests/Spec.Curve25519.Test.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 11,
"end_line": 46,
"start_col": 0,
"start_line": 38
} | module Spec.Curve25519.Test
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Curve25519
module PS = Lib.PrintSequence
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(* ********************* *)
(* RFC 7748 Test Vectors *)
(* ********************* *)
let scalar1 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0xa5uy; 0x46uy; 0xe3uy; 0x6buy; 0xf0uy; 0x52uy; 0x7cuy; 0x9duy;
0x3buy; 0x16uy; 0x15uy; 0x4buy; 0x82uy; 0x46uy; 0x5euy; 0xdduy;
0x62uy; 0x14uy; 0x4cuy; 0x0auy; 0xc1uy; 0xfcuy; 0x5auy; 0x18uy;
0x50uy; 0x6auy; 0x22uy; 0x44uy; 0xbauy; 0x44uy; 0x9auy; 0xc4uy
] in
assert_norm (List.Tot.length l == 32);
of_list l
let scalar2 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0x4buy; 0x66uy; 0xe9uy; 0xd4uy; 0xd1uy; 0xb4uy; 0x67uy; 0x3cuy;
0x5auy; 0xd2uy; 0x26uy; 0x91uy; 0x95uy; 0x7duy; 0x6auy; 0xf5uy;
0xc1uy; 0x1buy; 0x64uy; 0x21uy; 0xe0uy; 0xeauy; 0x01uy; 0xd4uy;
0x2cuy; 0xa4uy; 0x16uy; 0x9euy; 0x79uy; 0x18uy; 0xbauy; 0x0duy
] in
assert_norm (List.Tot.length l == 32);
of_list l | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.PrintSequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.IO.fst.checked",
"FStar.All.fst.checked"
],
"interface_file": false,
"source_file": "Spec.Curve25519.Test.fst"
} | [
{
"abbrev": true,
"full_module": "Lib.PrintSequence",
"short_module": "PS"
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Lib.Sequence.lseq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC) 32 | Prims.Tot | [
"total"
] | [] | [
"Lib.Sequence.of_list",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.int",
"FStar.List.Tot.Base.length",
"Prims.list",
"FStar.List.Tot.Base.map",
"FStar.UInt8.t",
"Lib.RawIntTypes.u8_from_UInt8",
"Prims.Cons",
"FStar.UInt8.__uint_to_t",
"Prims.Nil"
] | [] | false | false | false | false | false | let point1:lbytes 32 =
| let l =
List.Tot.map u8_from_UInt8
[
0xe6uy; 0xdbuy; 0x68uy; 0x67uy; 0x58uy; 0x30uy; 0x30uy; 0xdbuy; 0x35uy; 0x94uy; 0xc1uy; 0xa4uy;
0x24uy; 0xb1uy; 0x5fuy; 0x7cuy; 0x72uy; 0x66uy; 0x24uy; 0xecuy; 0x26uy; 0xb3uy; 0x35uy; 0x3buy;
0x10uy; 0xa9uy; 0x03uy; 0xa6uy; 0xd0uy; 0xabuy; 0x1cuy; 0x4cuy
]
in
assert_norm (List.Tot.length l == 32);
of_list l | false |
Spec.Curve25519.Test.fst | Spec.Curve25519.Test.expected1 | val expected1:lbytes 32 | val expected1:lbytes 32 | let expected1 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0xc3uy; 0xdauy; 0x55uy; 0x37uy; 0x9duy; 0xe9uy; 0xc6uy; 0x90uy;
0x8euy; 0x94uy; 0xeauy; 0x4duy; 0xf2uy; 0x8duy; 0x08uy; 0x4fuy;
0x32uy; 0xecuy; 0xcfuy; 0x03uy; 0x49uy; 0x1cuy; 0x71uy; 0xf7uy;
0x54uy; 0xb4uy; 0x07uy; 0x55uy; 0x77uy; 0xa2uy; 0x85uy; 0x52uy
] in
assert_norm (List.Tot.length l == 32);
of_list l | {
"file_name": "specs/tests/Spec.Curve25519.Test.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 11,
"end_line": 68,
"start_col": 0,
"start_line": 60
} | module Spec.Curve25519.Test
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Curve25519
module PS = Lib.PrintSequence
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(* ********************* *)
(* RFC 7748 Test Vectors *)
(* ********************* *)
let scalar1 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0xa5uy; 0x46uy; 0xe3uy; 0x6buy; 0xf0uy; 0x52uy; 0x7cuy; 0x9duy;
0x3buy; 0x16uy; 0x15uy; 0x4buy; 0x82uy; 0x46uy; 0x5euy; 0xdduy;
0x62uy; 0x14uy; 0x4cuy; 0x0auy; 0xc1uy; 0xfcuy; 0x5auy; 0x18uy;
0x50uy; 0x6auy; 0x22uy; 0x44uy; 0xbauy; 0x44uy; 0x9auy; 0xc4uy
] in
assert_norm (List.Tot.length l == 32);
of_list l
let scalar2 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0x4buy; 0x66uy; 0xe9uy; 0xd4uy; 0xd1uy; 0xb4uy; 0x67uy; 0x3cuy;
0x5auy; 0xd2uy; 0x26uy; 0x91uy; 0x95uy; 0x7duy; 0x6auy; 0xf5uy;
0xc1uy; 0x1buy; 0x64uy; 0x21uy; 0xe0uy; 0xeauy; 0x01uy; 0xd4uy;
0x2cuy; 0xa4uy; 0x16uy; 0x9euy; 0x79uy; 0x18uy; 0xbauy; 0x0duy
] in
assert_norm (List.Tot.length l == 32);
of_list l
let point1 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0xe6uy; 0xdbuy; 0x68uy; 0x67uy; 0x58uy; 0x30uy; 0x30uy; 0xdbuy;
0x35uy; 0x94uy; 0xc1uy; 0xa4uy; 0x24uy; 0xb1uy; 0x5fuy; 0x7cuy;
0x72uy; 0x66uy; 0x24uy; 0xecuy; 0x26uy; 0xb3uy; 0x35uy; 0x3buy;
0x10uy; 0xa9uy; 0x03uy; 0xa6uy; 0xd0uy; 0xabuy; 0x1cuy; 0x4cuy
] in
assert_norm (List.Tot.length l == 32);
of_list l
let point2 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0xe5uy; 0x21uy; 0x0fuy; 0x12uy; 0x78uy; 0x68uy; 0x11uy; 0xd3uy;
0xf4uy; 0xb7uy; 0x95uy; 0x9duy; 0x05uy; 0x38uy; 0xaeuy; 0x2cuy;
0x31uy; 0xdbuy; 0xe7uy; 0x10uy; 0x6fuy; 0xc0uy; 0x3cuy; 0x3euy;
0xfcuy; 0x4cuy; 0xd5uy; 0x49uy; 0xc7uy; 0x15uy; 0xa4uy; 0x93uy
] in
assert_norm (List.Tot.length l == 32);
of_list l | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.PrintSequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.IO.fst.checked",
"FStar.All.fst.checked"
],
"interface_file": false,
"source_file": "Spec.Curve25519.Test.fst"
} | [
{
"abbrev": true,
"full_module": "Lib.PrintSequence",
"short_module": "PS"
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Lib.Sequence.lseq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC) 32 | Prims.Tot | [
"total"
] | [] | [
"Lib.Sequence.of_list",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.int",
"FStar.List.Tot.Base.length",
"Prims.list",
"FStar.List.Tot.Base.map",
"FStar.UInt8.t",
"Lib.RawIntTypes.u8_from_UInt8",
"Prims.Cons",
"FStar.UInt8.__uint_to_t",
"Prims.Nil"
] | [] | false | false | false | false | false | let expected1:lbytes 32 =
| let l =
List.Tot.map u8_from_UInt8
[
0xc3uy; 0xdauy; 0x55uy; 0x37uy; 0x9duy; 0xe9uy; 0xc6uy; 0x90uy; 0x8euy; 0x94uy; 0xeauy; 0x4duy;
0xf2uy; 0x8duy; 0x08uy; 0x4fuy; 0x32uy; 0xecuy; 0xcfuy; 0x03uy; 0x49uy; 0x1cuy; 0x71uy; 0xf7uy;
0x54uy; 0xb4uy; 0x07uy; 0x55uy; 0x77uy; 0xa2uy; 0x85uy; 0x52uy
]
in
assert_norm (List.Tot.length l == 32);
of_list l | false |
DM4F.fst | DM4F.null | val null (#st #a: _) : wp st a | val null (#st #a: _) : wp st a | let null #st #a : wp st a =
fun s0 p -> forall r. p r | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 93,
"start_col": 0,
"start_line": 92
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. p1 r ==> p2 r) ==> w s0 p1 ==> w s0 p2
// ^ this version seems to be less SMT-friendly
forall s0 p1 p2. (forall x s1. p1 (x, s1) ==> p2 (x, s1)) ==> w s0 p1 ==> w s0 p2
type wp st a = w:(wp0 st a){st_monotonic w}
type repr (a:Type u#ua) (st:Type0) (wp : wp u#ua st a) : Type u#ua =
s0:st -> PURE (a & st) (as_pure_wp (wp s0))
unfold
let return_wp (#a:Type) (#st:Type0) (x:a) : wp st a = fun s0 p -> p (x, s0)
let return (a:Type) (x:a) (st:Type0) : repr a st (return_wp x) =
fun s0 -> (x, s0)
unfold
let bind_wp (#a #b:Type) (#st:Type0) (wp_c:wp st a) (wp_f:a -> wp st b) : wp st b =
fun s0 p -> wp_c s0 (fun (y, s1) -> wp_f y s1 p)
let bind (a:Type) (b:Type) (st:Type0)
(wp_c : wp st a)
(wp_f : a -> wp st b)
(c : repr a st wp_c)
(f : (x:a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f)
= fun s0 -> let (y, s1) = c s0 in
f y s1
unfold
let ite_wp (#a:Type) (#st:Type0) (wpf wpg:wp st a) (b:bool) : wp st a =
fun s0 p -> (b ==> wpf s0 p) /\ ((~b) ==> wpg s0 p)
let if_then_else
(a:Type)
(st:Type0)
(wpf wpg : wp st a)
(f : repr a st wpf)
(g : repr a st wpg)
(b : bool)
: Type
= repr a st (ite_wp wpf wpg b)
unfold
let stronger
(#a:Type) (#st:Type0)
(w1 w2 : wp st a)
: Type0
= forall s0 p. w1 s0 p ==> w2 s0 p
let subcomp
(a:Type)
(st:Type0)
(wpf wpg : wp st a)
(f : repr a st wpf)
: Pure (repr a st wpg)
(requires (stronger wpg wpf))
(ensures (fun _ -> True))
= f
total
reifiable
reflectable
effect {
ST (a:Type) ([@@@ effect_param] st:Type0) (_:wp st a)
with {repr; return; bind; if_then_else; subcomp}
}
unfold
let lift_wp (#a:Type) (#st:Type0) (w:pure_wp a) : wp st a =
elim_pure_wp_monotonicity_forall ();
fun s0 p -> w (fun x -> p (x, s0))
let lift_pure_st a wp st (f : unit -> PURE a wp)
: repr a st (lift_wp wp)
= elim_pure_wp_monotonicity_forall ();
fun s0 -> (f (), s0)
sub_effect PURE ~> ST = lift_pure_st | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | DM4F.wp st a | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.tuple2",
"Prims.l_Forall",
"Prims.logical",
"DM4F.wp"
] | [] | false | false | false | true | false | let null #st #a : wp st a =
| fun s0 p -> forall r. p r | false |
Spec.Curve25519.Test.fst | Spec.Curve25519.Test.scalar2 | val scalar2:lbytes 32 | val scalar2:lbytes 32 | let scalar2 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0x4buy; 0x66uy; 0xe9uy; 0xd4uy; 0xd1uy; 0xb4uy; 0x67uy; 0x3cuy;
0x5auy; 0xd2uy; 0x26uy; 0x91uy; 0x95uy; 0x7duy; 0x6auy; 0xf5uy;
0xc1uy; 0x1buy; 0x64uy; 0x21uy; 0xe0uy; 0xeauy; 0x01uy; 0xd4uy;
0x2cuy; 0xa4uy; 0x16uy; 0x9euy; 0x79uy; 0x18uy; 0xbauy; 0x0duy
] in
assert_norm (List.Tot.length l == 32);
of_list l | {
"file_name": "specs/tests/Spec.Curve25519.Test.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 11,
"end_line": 35,
"start_col": 0,
"start_line": 27
} | module Spec.Curve25519.Test
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Curve25519
module PS = Lib.PrintSequence
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(* ********************* *)
(* RFC 7748 Test Vectors *)
(* ********************* *)
let scalar1 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0xa5uy; 0x46uy; 0xe3uy; 0x6buy; 0xf0uy; 0x52uy; 0x7cuy; 0x9duy;
0x3buy; 0x16uy; 0x15uy; 0x4buy; 0x82uy; 0x46uy; 0x5euy; 0xdduy;
0x62uy; 0x14uy; 0x4cuy; 0x0auy; 0xc1uy; 0xfcuy; 0x5auy; 0x18uy;
0x50uy; 0x6auy; 0x22uy; 0x44uy; 0xbauy; 0x44uy; 0x9auy; 0xc4uy
] in
assert_norm (List.Tot.length l == 32);
of_list l | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.PrintSequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.IO.fst.checked",
"FStar.All.fst.checked"
],
"interface_file": false,
"source_file": "Spec.Curve25519.Test.fst"
} | [
{
"abbrev": true,
"full_module": "Lib.PrintSequence",
"short_module": "PS"
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.RawIntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Lib.Sequence.lseq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC) 32 | Prims.Tot | [
"total"
] | [] | [
"Lib.Sequence.of_list",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.int",
"FStar.List.Tot.Base.length",
"Prims.list",
"FStar.List.Tot.Base.map",
"FStar.UInt8.t",
"Lib.RawIntTypes.u8_from_UInt8",
"Prims.Cons",
"FStar.UInt8.__uint_to_t",
"Prims.Nil"
] | [] | false | false | false | false | false | let scalar2:lbytes 32 =
| let l =
List.Tot.map u8_from_UInt8
[
0x4buy; 0x66uy; 0xe9uy; 0xd4uy; 0xd1uy; 0xb4uy; 0x67uy; 0x3cuy; 0x5auy; 0xd2uy; 0x26uy; 0x91uy;
0x95uy; 0x7duy; 0x6auy; 0xf5uy; 0xc1uy; 0x1buy; 0x64uy; 0x21uy; 0xe0uy; 0xeauy; 0x01uy; 0xd4uy;
0x2cuy; 0xa4uy; 0x16uy; 0x9euy; 0x79uy; 0x18uy; 0xbauy; 0x0duy
]
in
assert_norm (List.Tot.length l == 32);
of_list l | false |
Vale.AES.PPC64LE.GF128_Mul.fst | Vale.AES.PPC64LE.GF128_Mul.va_qcode_Gf128MulRev128 | val va_qcode_Gf128MulRev128 (va_mods: va_mods_t) : (va_quickCode unit (va_code_Gf128MulRev128 ())) | val va_qcode_Gf128MulRev128 (va_mods: va_mods_t) : (va_quickCode unit (va_code_Gf128MulRev128 ())) | let va_qcode_Gf128MulRev128 (va_mods:va_mods_t) : (va_quickCode unit (va_code_Gf128MulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(a:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in let
(b:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in va_QBind
va_range1
"***** PRECONDITION NOT MET AT line 372 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ReduceMulRev128 (Vale.Math.Poly2_s.reverse a 127) (Vale.Math.Poly2_s.reverse b 127))
(fun (va_s:va_state) _ -> let (va_arg6:Vale.Math.Poly2_s.poly) = Vale.AES.GF128.gf128_mul_rev a
b in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 373 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg6) (va_QEmpty (()))))) | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Mul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 89,
"end_line": 1091,
"start_col": 0,
"start_line": 1081
} | module Vale.AES.PPC64LE.GF128_Mul
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.TypesNative
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open Vale.AES.GF128
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.InsBasic
open Vale.PPC64LE.InsMem
open Vale.PPC64LE.InsVector
open Vale.PPC64LE.QuickCode
open Vale.PPC64LE.QuickCodes
open Vale.AES.PPC64LE.PolyOps
open Vale.AES.Types_helpers
open Vale.AES.GHash_BE
//-- ShiftLeft128_1
[@ "opaque_to_smt" va_qattr]
let va_code_ShiftLeft128_1 () =
(va_Block (va_CCons (va_code_Vspltisb (va_op_vec_opr_vec 2) 1) (va_CCons (va_code_Vsl
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2)) (va_CNil ()))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ShiftLeft128_1 () =
(va_pbool_and (va_codegen_success_Vspltisb (va_op_vec_opr_vec 2) 1) (va_pbool_and
(va_codegen_success_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2))
(va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ShiftLeft128_1 (va_mods:va_mods_t) (a:poly) : (va_quickCode unit
(va_code_ShiftLeft128_1 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 60 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisb (va_op_vec_opr_vec 2) 1) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 61 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> let (va_arg5:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 63 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_shift_left_1 va_arg5) (va_QEmpty (()))))))
[@"opaque_to_smt"]
let va_lemma_ShiftLeft128_1 va_b0 va_s0 a =
let (va_mods:va_mods_t) = [va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ShiftLeft128_1 va_mods a in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftLeft128_1 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 49 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 58 column 37 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.shift a 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_ShiftLeft128_1 a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftLeft128_1 (va_code_ShiftLeft128_1 ()) va_s0 a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_ok va_sM
va_s0))));
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- ShiftLeft2_128_1
val va_code_ShiftLeft2_128_1 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ShiftLeft2_128_1 () =
(va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0) 0) (va_CCons (va_code_LoadImm64
(va_op_reg_opr_reg 10) 31) (va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg
10)) (va_CCons (va_code_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_CCons (va_code_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0) (va_op_vec_opr_vec 3) 4)
(va_CCons (va_code_Vspltisb (va_op_vec_opr_vec 0) 1) (va_CCons (va_code_Vsl (va_op_vec_opr_vec
1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 0)) (va_CCons (va_code_Vsl (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_CCons (va_code_Vxor (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_CNil ())))))))))))
val va_codegen_success_ShiftLeft2_128_1 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ShiftLeft2_128_1 () =
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 0) 0) (va_pbool_and
(va_codegen_success_LoadImm64 (va_op_reg_opr_reg 10) 31) (va_pbool_and
(va_codegen_success_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_pbool_and
(va_codegen_success_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_pbool_and (va_codegen_success_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0)
(va_op_vec_opr_vec 3) 4) (va_pbool_and (va_codegen_success_Vspltisb (va_op_vec_opr_vec 0) 1)
(va_pbool_and (va_codegen_success_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 0)) (va_pbool_and (va_codegen_success_Vsl (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_pbool_and (va_codegen_success_Vxor
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_ttrue ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ShiftLeft2_128_1 (va_mods:va_mods_t) (lo:poly) (hi:poly) : (va_quickCode unit
(va_code_ShiftLeft2_128_1 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisw (va_op_vec_opr_vec 0) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 84 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_LoadImm64 (va_op_reg_opr_reg 10) 31) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 85 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 86 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 87 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0) (va_op_vec_opr_vec 3) 4) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 88 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisb (va_op_vec_opr_vec 0) 1) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 89 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 0)) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 90 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_QBind
va_range1
"***** PRECONDITION NOT MET AT line 91 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vxor (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (fun
(va_s:va_state) _ -> let (l:(Vale.Def.Words_s.four Vale.Def.Words_s.nat32)) =
Vale.Def.Words.Four_s.four_map #nat32 #Vale.Def.Words_s.nat32 (fun (i:nat32) ->
Vale.Arch.Types.ishl32 i 1) (va_get_vec 2 va_old_s) in let (r:(Vale.Def.Words_s.four
Vale.Def.Words_s.nat32)) = Vale.Def.Words.Four_s.four_map #nat32 #Vale.Def.Words_s.nat32 (fun
(i:nat32) -> Vale.Arch.Types.ishr32 i 31) (va_get_vec 2 va_old_s) in let
(va_arg22:Vale.Def.Types_s.quad32) = va_get_vec 3 va_s in let
(va_arg21:Vale.Def.Types_s.quad32) = Vale.Def.Words_s.Mkfour #Vale.Def.Types_s.nat32 0
(Vale.Def.Words_s.__proj__Mkfour__item__lo0 r) (Vale.Def.Words_s.__proj__Mkfour__item__lo1 r)
(Vale.Def.Words_s.__proj__Mkfour__item__hi2 r) in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 95 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Arch.TypesNative.lemma_quad32_xor_commutes va_arg21 va_arg22) (let
(va_arg20:Vale.Def.Types_s.quad32) = va_get_vec 3 va_s in let
(va_arg19:Vale.Def.Types_s.quad32) = Vale.Def.Words_s.Mkfour #Vale.Def.Types_s.nat32 0
(Vale.Def.Words_s.__proj__Mkfour__item__lo0 r) (Vale.Def.Words_s.__proj__Mkfour__item__lo1 r)
(Vale.Def.Words_s.__proj__Mkfour__item__hi2 r) in let (va_arg18:Vale.Def.Types_s.quad32) = l in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 96 column 32 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Arch.TypesNative.lemma_quad32_xor_associates va_arg18 va_arg19 va_arg20)
(let (va_arg17:Vale.Math.Poly2_s.poly) = hi in let (va_arg16:Vale.Math.Poly2_s.poly) = lo in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 98 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_shift_2_left_1 va_arg16 va_arg17) (va_QEmpty
(())))))))))))))))
val va_lemma_ShiftLeft2_128_1 : va_b0:va_code -> va_s0:va_state -> lo:poly -> hi:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ShiftLeft2_128_1 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree hi < 127 /\ Vale.Math.Poly2_s.degree lo <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 hi))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let n = Vale.Math.Poly2_s.monomial 128 in let a = Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul
hi n) lo in let b = Vale.Math.Poly2_s.shift a 1 in va_get_vec 1 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n) /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)) /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))
[@"opaque_to_smt"]
let va_lemma_ShiftLeft2_128_1 va_b0 va_s0 lo hi =
let (va_mods:va_mods_t) = [va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10;
va_Mod_ok] in
let va_qc = va_qcode_ShiftLeft2_128_1 va_mods lo hi in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftLeft2_128_1 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 66 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 77 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let n = Vale.Math.Poly2_s.monomial 128 in label va_range1
"***** POSTCONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let a = Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul hi n) lo in label va_range1
"***** POSTCONDITION NOT MET AT line 79 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let b = Vale.Math.Poly2_s.shift a 1 in label va_range1
"***** POSTCONDITION NOT MET AT line 80 column 35 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 81 column 35 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)))))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10;
va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_ShiftLeft2_128_1 (lo:poly) (hi:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0))
: Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree hi < 127 /\ Vale.Math.Poly2_s.degree lo <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 hi /\ (forall (va_x_r10:nat64) (va_x_v0:quad32)
(va_x_v1:quad32) (va_x_v2:quad32) (va_x_v3:quad32) . let va_sM = va_upd_vec 3 va_x_v3
(va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1 (va_upd_vec 0 va_x_v0 (va_upd_reg 10 va_x_r10
va_s0)))) in va_get_ok va_sM /\ (let n = Vale.Math.Poly2_s.monomial 128 in let a =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul hi n) lo in let b = Vale.Math.Poly2_s.shift a 1 in
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n) /\
va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)) ==> va_k
va_sM (())))
val va_wpProof_ShiftLeft2_128_1 : lo:poly -> hi:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ShiftLeft2_128_1 lo hi va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ShiftLeft2_128_1 ()) ([va_Mod_vec 3;
va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ShiftLeft2_128_1 lo hi va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftLeft2_128_1 (va_code_ShiftLeft2_128_1 ()) va_s0 lo hi in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM
(va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM va_s0)))))));
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10])
va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ShiftLeft2_128_1 (lo:poly) (hi:poly) : (va_quickCode unit (va_code_ShiftLeft2_128_1
())) =
(va_QProc (va_code_ShiftLeft2_128_1 ()) ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0;
va_Mod_reg 10]) (va_wp_ShiftLeft2_128_1 lo hi) (va_wpProof_ShiftLeft2_128_1 lo hi))
//--
//-- ClmulRev64High
val va_code_ClmulRev64High : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ClmulRev64High () =
(va_Block (va_CCons (va_code_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_ShiftLeft128_1 ()) (va_CNil ()))))
val va_codegen_success_ClmulRev64High : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ClmulRev64High () =
(va_pbool_and (va_codegen_success_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_ShiftLeft128_1 ()) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ClmulRev64High (va_mods:va_mods_t) (a:poly) (b:poly) : (va_quickCode unit
(va_code_ClmulRev64High ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(va_arg18:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 116 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg18) (let
(va_arg17:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 117 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg17) (let
(va_arg16:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 118 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg16 64) (let
(va_arg15:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 119 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg15 64) (let
(va_arg14:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 120 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg14 64) (let
(va_arg13:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 121 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg13 64) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 17 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2))
(va_QBind va_range1
"***** PRECONDITION NOT MET AT line 123 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ShiftLeft128_1 (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.reverse a 63)
(Vale.Math.Poly2_s.reverse b 63))) (fun (va_s:va_state) _ -> let
(va_arg12:Vale.Math.Poly2_s.poly) = b in let (va_arg11:Vale.Math.Poly2_s.poly) = a in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 125 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_reverse_shift_1 va_arg11 va_arg12 63)
(va_QEmpty (()))))))))))))
val va_lemma_ClmulRev64High : va_b0:va_code -> va_s0:va_state -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ClmulRev64High ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 63 /\ Vale.Math.Poly2_s.degree b <= 63 /\
Vale.Math.Poly2_s.reverse a 63 == Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_hi (va_get_vec 1 va_s0)) /\ Vale.Math.Poly2_s.reverse b 63 ==
Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_hi (va_get_vec 2 va_s0)) /\
l_or (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo (va_get_vec 1
va_s0)) == zero) (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo
(va_get_vec 2 va_s0)) == zero)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.Math.Poly2_s.mul a b) 127) /\ va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1
va_sM (va_update_ok va_sM va_s0)))))
[@"opaque_to_smt"]
let va_lemma_ClmulRev64High va_b0 va_s0 a b =
let (va_mods:va_mods_t) = [va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ClmulRev64High va_mods a b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ClmulRev64High ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 101 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 49 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.Math.Poly2_s.mul a b) 127))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_ClmulRev64High (a:poly) (b:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) :
Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree a <= 63 /\ Vale.Math.Poly2_s.degree b <= 63 /\
Vale.Math.Poly2_s.reverse a 63 == Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_hi (va_get_vec 1 va_s0)) /\ Vale.Math.Poly2_s.reverse b 63 ==
Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_hi (va_get_vec 2 va_s0)) /\
l_or (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo (va_get_vec 1
va_s0)) == zero) (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo
(va_get_vec 2 va_s0)) == zero) /\ (forall (va_x_v1:quad32) (va_x_v2:quad32) . let va_sM =
va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1 va_s0) in va_get_ok va_sM /\ va_get_vec 1 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul a b) 127)
==> va_k va_sM (())))
val va_wpProof_ClmulRev64High : a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ClmulRev64High a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ClmulRev64High ()) ([va_Mod_vec 2;
va_Mod_vec 1]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ClmulRev64High a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ClmulRev64High (va_code_ClmulRev64High ()) va_s0 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_ok va_sM
va_s0))));
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ClmulRev64High (a:poly) (b:poly) : (va_quickCode unit (va_code_ClmulRev64High ())) =
(va_QProc (va_code_ClmulRev64High ()) ([va_Mod_vec 2; va_Mod_vec 1]) (va_wp_ClmulRev64High a b)
(va_wpProof_ClmulRev64High a b))
//--
//-- High64ToLow
[@ "opaque_to_smt"]
let va_code_High64ToLow dst src =
(va_Block (va_CCons (va_code_Vsldoi dst (va_op_vec_opr_vec 0) src 8) (va_CNil ())))
[@ "opaque_to_smt"]
let va_codegen_success_High64ToLow dst src =
(va_pbool_and (va_codegen_success_Vsldoi dst (va_op_vec_opr_vec 0) src 8) (va_ttrue ()))
[@"opaque_to_smt"]
let va_lemma_High64ToLow va_b0 va_s0 dst src a =
va_reveal_opaque (`%va_code_High64ToLow) (va_code_High64ToLow dst src);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let (va_s2, va_fc2) = va_lemma_Vsldoi (va_hd va_b1) va_s0 dst (va_op_vec_opr_vec 0) src 8 in
let va_b2 = va_tl va_b1 in
Vale.Math.Poly2.Words.lemma_quad32_double_shift a;
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_High64ToLow dst src a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_High64ToLow (va_code_High64ToLow dst src) va_s0 dst src a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- Low64ToHigh
[@ "opaque_to_smt" va_qattr]
let va_code_Low64ToHigh dst src =
(va_Block (va_CCons (va_code_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (va_CNil ())))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Low64ToHigh dst src =
(va_pbool_and (va_codegen_success_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (va_ttrue ()))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Low64ToHigh (va_mods:va_mods_t) (dst:vec_opr) (src:vec_opr) (a:poly) : (va_quickCode
unit (va_code_Low64ToHigh dst src)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 156 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (fun (va_s:va_state) _ -> let
(va_arg4:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 157 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Words.lemma_quad32_double_shift va_arg4) (va_QEmpty (())))))
[@"opaque_to_smt"]
let va_lemma_Low64ToHigh va_b0 va_s0 dst src a =
let (va_mods:va_mods_t) = [va_Mod_ok; va_mod_vec_opr dst] in
let va_qc = va_qcode_Low64ToHigh va_mods dst src a in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Low64ToHigh dst src) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 144 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 154 column 66 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod a (Vale.Math.Poly2_s.monomial 64)) (Vale.Math.Poly2_s.monomial 64)))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_ok; va_mod_vec_opr dst]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_Low64ToHigh dst src a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Low64ToHigh (va_code_Low64ToHigh dst src) va_s0 dst src a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AddPoly
val va_code_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr -> src2:va_operand_vec_opr
-> Tot va_code
[@ "opaque_to_smt"]
let va_code_AddPoly dst src1 src2 =
(va_Block (va_CCons (va_code_Vxor dst src1 src2) (va_CNil ())))
val va_codegen_success_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr ->
src2:va_operand_vec_opr -> Tot va_pbool
[@ "opaque_to_smt"]
let va_codegen_success_AddPoly dst src1 src2 =
(va_pbool_and (va_codegen_success_Vxor dst src1 src2) (va_ttrue ()))
val va_lemma_AddPoly : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr ->
src1:va_operand_vec_opr -> src2:va_operand_vec_opr -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AddPoly dst src1 src2) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_is_src_vec_opr src1 va_s0 /\ va_is_src_vec_opr src2 va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\ va_eval_vec_opr va_s0
src1 == Vale.Math.Poly2.Bits_s.to_quad32 a /\ va_eval_vec_opr va_s0 src2 ==
Vale.Math.Poly2.Bits_s.to_quad32 b))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add a b) /\
va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0))))
[@"opaque_to_smt"]
let va_lemma_AddPoly va_b0 va_s0 dst src1 src2 a b =
va_reveal_opaque (`%va_code_AddPoly) (va_code_AddPoly dst src1 src2);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let (va_s2, va_fc2) = va_lemma_Vxor (va_hd va_b1) va_s0 dst src1 src2 in
let va_b2 = va_tl va_b1 in
Vale.Math.Poly2.Words.lemma_add128 a b;
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_AddPoly (dst:va_operand_vec_opr) (src1:va_operand_vec_opr) (src2:va_operand_vec_opr)
(a:poly) (b:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_is_dst_vec_opr dst va_s0 /\ va_is_src_vec_opr src1 va_s0 /\ va_is_src_vec_opr src2 va_s0 /\
va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\
va_eval_vec_opr va_s0 src1 == Vale.Math.Poly2.Bits_s.to_quad32 a /\ va_eval_vec_opr va_s0 src2
== Vale.Math.Poly2.Bits_s.to_quad32 b /\ (forall (va_x_dst:va_value_vec_opr) . let va_sM =
va_upd_operand_vec_opr dst va_x_dst va_s0 in va_get_ok va_sM /\ va_eval_vec_opr va_sM dst ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add a b) ==> va_k va_sM (())))
val va_wpProof_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr ->
src2:va_operand_vec_opr -> a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AddPoly dst src1 src2 a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AddPoly dst src1 src2)
([va_mod_vec_opr dst]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_AddPoly dst src1 src2 a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AddPoly (va_code_AddPoly dst src1 src2) va_s0 dst src1 src2 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_AddPoly (dst:va_operand_vec_opr) (src1:va_operand_vec_opr) (src2:va_operand_vec_opr)
(a:poly) (b:poly) : (va_quickCode unit (va_code_AddPoly dst src1 src2)) =
(va_QProc (va_code_AddPoly dst src1 src2) ([va_mod_vec_opr dst]) (va_wp_AddPoly dst src1 src2 a
b) (va_wpProof_AddPoly dst src1 src2 a b))
//--
//-- Clmul128
val va_code_Clmul128 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_Clmul128 () =
(va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0) 0) (va_CCons (va_code_VSwap
(va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (va_CCons (va_code_High64ToLow (va_op_vec_opr_vec
4) (va_op_vec_opr_vec 3)) (va_CCons (va_code_Low64ToHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 3)) (va_CCons (va_code_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec
4) (va_op_vec_opr_vec 2)) (va_CCons (va_code_VPolyMulHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_CCons (va_code_Low64ToHigh (va_op_vec_opr_vec
1) (va_op_vec_opr_vec 3)) (va_CCons (va_code_High64ToLow (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 3)) (va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 4)) (va_CCons (va_code_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 2)) (va_CNil ())))))))))))))
val va_codegen_success_Clmul128 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Clmul128 () =
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 0) 0) (va_pbool_and
(va_codegen_success_VSwap (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (va_pbool_and
(va_codegen_success_High64ToLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 3)) (va_pbool_and
(va_codegen_success_Low64ToHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 3)) (va_pbool_and
(va_codegen_success_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 2))
(va_pbool_and (va_codegen_success_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 4)
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_VPolyMulHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_Low64ToHigh
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_pbool_and (va_codegen_success_High64ToLow
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_pbool_and (va_codegen_success_AddPoly
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 4)) (va_pbool_and
(va_codegen_success_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2))
(va_ttrue ()))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Clmul128 (va_mods:va_mods_t) (ab:poly) (cd:poly) : (va_quickCode (poly & poly)
(va_code_Clmul128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(n:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.monomial 64 in let (a:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.div ab n in let (b:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ab n in
let (c:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div cd n in let (d:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.mod cd n in let (ac:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul a c in
let (ad:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul a d in let (bc:Vale.Math.Poly2_s.poly)
= Vale.Math.Poly2_s.mul b c in let (bd:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul b d in
let (ab_sw:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.swap ab 64 in let
(ab_hi:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ab n in let
(ab_lo:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.div ab n) n in let
(va_arg77:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 202 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg77) (let
(va_arg76:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 203 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg76) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 205 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisw (va_op_vec_opr_vec 0) 0) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 206 column 10 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VSwap (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (fun (va_s:va_state) _ -> let
(va_arg75:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 207 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg75) (let
(va_arg74:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 208 column 29 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Words.lemma_quad32_double_swap va_arg74) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 209 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double ab_sw) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 210 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_High64ToLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 3) ab_sw) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 211 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Low64ToHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 3) ab_sw) (fun (va_s:va_state) _
-> va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 212 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 4 va_s == Vale.Math.Poly2.Bits_s.to_quad32 ab_hi) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 213 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 5 va_s == Vale.Math.Poly2.Bits_s.to_quad32 ab_lo) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 215 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 217 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 ab_hi) (let
(va_arg73:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ab_hi n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 218 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_degree_negative va_arg73) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 219 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_hi 64) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 220 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 222 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 ab_lo) (let
(va_arg72:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ab n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 223 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_div_mod_exact va_arg72 n) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 224 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_lo 64) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 225 column 17 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> let (va_arg71:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 227 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg71) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 228 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_sw 64) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 229 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_sw 64) (let
(va_arg70:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 230 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg70 64) (let
(va_arg69:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 231 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg69 64) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 232 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s) == Vale.Math.Poly2_s.add ad bc) (va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 234 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_hi 64) (let
(va_arg68:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 235 column 18 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mod_mod va_arg68 n) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 236 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 4 va_s) == bd) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 238 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_lo 64) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 239 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 5 va_s) == ac) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 241 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Low64ToHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3) (Vale.Math.Poly2_s.add ad
bc)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 242 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mod_distribute ad bc n) (let
(va_arg67:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod bc n in let
(va_arg66:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ad n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 243 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_distribute_left va_arg66 va_arg67 n)
(va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 244 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_s == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n) (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod bc n) n))) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 246 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_High64ToLow (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3) (Vale.Math.Poly2_s.add ad
bc)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 247 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GHash_BE.lemma_div_distribute ad bc n) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 248 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_s == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.div ad n) (Vale.Math.Poly2_s.div bc n))) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 250 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 4)
(Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n)
(Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod bc n) n)) bd) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 251 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2) ac
(Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.div ad n) (Vale.Math.Poly2_s.div bc n))) (fun
(va_s:va_state) _ -> let (va_arg65:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div bc n in let
(va_arg64:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ad n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 253 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_commute va_arg64 va_arg65) (let
(va_arg63:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ad n in let
(va_arg62:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div bc n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 254 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_associate ac va_arg62 va_arg63) (let (hi:poly) =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.add ac (Vale.Math.Poly2_s.div bc n))
(Vale.Math.Poly2_s.div ad n) in let (va_arg61:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod bc n) n in let (va_arg60:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod ad n) n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 256 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_commute va_arg60 va_arg61) (let (lo:poly) =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod bc
n) n) (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n)) bd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 259 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_mul a b c d 64) (va_QEmpty ((lo,
hi))))))))))))))))))))))))))))))))))))))))))))))))
val va_lemma_Clmul128 : va_b0:va_code -> va_s0:va_state -> ab:poly -> cd:poly
-> Ghost (va_state & va_fuel & poly & poly)
(requires (va_require_total va_b0 (va_code_Clmul128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 ab /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 cd))
(ensures (fun (va_sM, va_fM, lo, hi) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok
va_sM /\ Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi < 127 /\
Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 hi /\ va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec
4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0
va_sM (va_update_ok va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_Clmul128 va_b0 va_s0 ab cd =
let (va_mods:va_mods_t) = [va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_ok] in
let va_qc = va_qcode_Clmul128 va_mods ab cd in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Clmul128 ()) va_qc va_s0 (fun va_s0
va_sM va_g -> let (lo, hi) = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 174 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 184 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree lo <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 185 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree hi < 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 186 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo) /\
label va_range1
"***** POSTCONDITION NOT MET AT line 187 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 188 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_ok]) va_sM va_s0;
let (lo, hi) = va_g in
(va_sM, va_fM, lo, hi)
[@ va_qattr]
let va_wp_Clmul128 (ab:poly) (cd:poly) (va_s0:va_state) (va_k:(va_state -> (poly & poly) -> Type0))
: Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 ab /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 cd /\ (forall (va_x_v0:quad32) (va_x_v1:quad32)
(va_x_v2:quad32) (va_x_v3:quad32) (va_x_v4:quad32) (va_x_v5:quad32) (lo:poly) (hi:poly) . let
va_sM = va_upd_vec 5 va_x_v5 (va_upd_vec 4 va_x_v4 (va_upd_vec 3 va_x_v3 (va_upd_vec 2 va_x_v2
(va_upd_vec 1 va_x_v1 (va_upd_vec 0 va_x_v0 va_s0))))) in va_get_ok va_sM /\
Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi < 127 /\
Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 hi ==> va_k va_sM ((lo, hi))))
val va_wpProof_Clmul128 : ab:poly -> cd:poly -> va_s0:va_state -> va_k:(va_state -> (poly & poly)
-> Type0)
-> Ghost (va_state & va_fuel & (poly & poly))
(requires (va_t_require va_s0 /\ va_wp_Clmul128 ab cd va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Clmul128 ()) ([va_Mod_vec 5;
va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0]) va_s0 va_k ((va_sM,
va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_Clmul128 ab cd va_s0 va_k =
let (va_sM, va_f0, lo, hi) = va_lemma_Clmul128 (va_code_Clmul128 ()) va_s0 ab cd in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM
(va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_ok va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0]) va_sM va_s0;
let va_g = (lo, hi) in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_Clmul128 (ab:poly) (cd:poly) : (va_quickCode (poly & poly) (va_code_Clmul128 ())) =
(va_QProc (va_code_Clmul128 ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0]) (va_wp_Clmul128 ab cd) (va_wpProof_Clmul128 ab cd))
//--
//-- ClmulRev128
val va_code_ClmulRev128 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ClmulRev128 () =
(va_Block (va_CCons (va_code_Clmul128 ()) (va_CCons (va_code_ShiftLeft2_128_1 ()) (va_CNil ()))))
val va_codegen_success_ClmulRev128 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ClmulRev128 () =
(va_pbool_and (va_codegen_success_Clmul128 ()) (va_pbool_and (va_codegen_success_ShiftLeft2_128_1
()) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ClmulRev128 (va_mods:va_mods_t) (ab:poly) (cd:poly) : (va_quickCode (poly & poly)
(va_code_ClmulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 279 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Clmul128 (Vale.Math.Poly2_s.reverse ab 127) (Vale.Math.Poly2_s.reverse cd 127)) (fun
(va_s:va_state) va_g -> let (lo, hi) = va_g in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 280 column 21 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ShiftLeft2_128_1 lo hi) (fun (va_s:va_state) _ -> let (m:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.shift (Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo) 1 in let
(va_arg13:Vale.Math.Poly2_s.poly) = lo in let (va_arg12:Vale.Math.Poly2_s.poly) = hi in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 283 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg12 va_arg13 128) (va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 284 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_split_define m 128) (let (lo:poly) =
Vale.Math.Poly2_s.mod m (Vale.Math.Poly2_s.monomial 128) in let (hi:poly) =
Vale.Math.Poly2_s.div m (Vale.Math.Poly2_s.monomial 128) in let
(va_arg11:Vale.Math.Poly2_s.poly) = cd in let (va_arg10:Vale.Math.Poly2_s.poly) = ab in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 287 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_reverse_shift_1 va_arg10 va_arg11 127)
(va_QEmpty ((lo, hi)))))))))
val va_lemma_ClmulRev128 : va_b0:va_code -> va_s0:va_state -> ab:poly -> cd:poly
-> Ghost (va_state & va_fuel & poly & poly)
(requires (va_require_total va_b0 (va_code_ClmulRev128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse ab 127) /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse cd 127)))
(ensures (fun (va_sM, va_fM, lo, hi) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok
va_sM /\ Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi <= 127 /\
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo /\ va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32
lo /\ va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi /\ va_state_eq va_sM
(va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM
(va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM
va_s0))))))))))
[@"opaque_to_smt"]
let va_lemma_ClmulRev128 va_b0 va_s0 ab cd =
let (va_mods:va_mods_t) = [va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_ClmulRev128 va_mods ab cd in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ClmulRev128 ()) va_qc va_s0 (fun va_s0
va_sM va_g -> let (lo, hi) = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 262 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 273 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree lo <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 274 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree hi <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 275 column 61 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 276 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 277 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok]) va_sM va_s0;
let (lo, hi) = va_g in
(va_sM, va_fM, lo, hi)
[@ va_qattr]
let va_wp_ClmulRev128 (ab:poly) (cd:poly) (va_s0:va_state) (va_k:(va_state -> (poly & poly) ->
Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse ab 127) /\
va_get_vec 2 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse cd 127) /\
(forall (va_x_r10:nat64) (va_x_v0:quad32) (va_x_v1:quad32) (va_x_v2:quad32) (va_x_v3:quad32)
(va_x_v4:quad32) (va_x_v5:quad32) (lo:poly) (hi:poly) . let va_sM = va_upd_vec 5 va_x_v5
(va_upd_vec 4 va_x_v4 (va_upd_vec 3 va_x_v3 (va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1
(va_upd_vec 0 va_x_v0 (va_upd_reg 10 va_x_r10 va_s0)))))) in va_get_ok va_sM /\
Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi <= 127 /\
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo /\ va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32
lo /\ va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi ==> va_k va_sM ((lo, hi))))
val va_wpProof_ClmulRev128 : ab:poly -> cd:poly -> va_s0:va_state -> va_k:(va_state -> (poly &
poly) -> Type0)
-> Ghost (va_state & va_fuel & (poly & poly))
(requires (va_t_require va_s0 /\ va_wp_ClmulRev128 ab cd va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ClmulRev128 ()) ([va_Mod_vec 5;
va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_s0
va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ClmulRev128 ab cd va_s0 va_k =
let (va_sM, va_f0, lo, hi) = va_lemma_ClmulRev128 (va_code_ClmulRev128 ()) va_s0 ab cd in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM
(va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM
(va_update_ok va_sM va_s0)))))))));
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10]) va_sM va_s0;
let va_g = (lo, hi) in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ClmulRev128 (ab:poly) (cd:poly) : (va_quickCode (poly & poly) (va_code_ClmulRev128
())) =
(va_QProc (va_code_ClmulRev128 ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) (va_wp_ClmulRev128 ab cd) (va_wpProof_ClmulRev128
ab cd))
//--
//-- Gf128ModulusRev
val va_code_Gf128ModulusRev : dst:va_operand_vec_opr -> Tot va_code
[@ "opaque_to_smt"]
let va_code_Gf128ModulusRev dst =
(va_Block (va_CCons (va_code_Vxor dst dst dst) (va_CCons (va_code_LoadImmShl64 (va_op_reg_opr_reg
10) (-7936)) (va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_CCons
(va_code_Vsldoi dst (va_op_vec_opr_vec 3) dst 12) (va_CNil ()))))))
val va_codegen_success_Gf128ModulusRev : dst:va_operand_vec_opr -> Tot va_pbool
[@ "opaque_to_smt"]
let va_codegen_success_Gf128ModulusRev dst =
(va_pbool_and (va_codegen_success_Vxor dst dst dst) (va_pbool_and
(va_codegen_success_LoadImmShl64 (va_op_reg_opr_reg 10) (-7936)) (va_pbool_and
(va_codegen_success_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_pbool_and
(va_codegen_success_Vsldoi dst (va_op_vec_opr_vec 3) dst 12) (va_ttrue ())))))
val va_lemma_Gf128ModulusRev : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128ModulusRev dst) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_get_ok va_s0 /\ dst =!= 3))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) /\ Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_lo (va_eval_vec_opr va_sM dst)) == zero /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM (va_update_operand_vec_opr
dst va_sM va_s0))))))
[@"opaque_to_smt"]
let va_lemma_Gf128ModulusRev va_b0 va_s0 dst =
va_reveal_opaque (`%va_code_Gf128ModulusRev) (va_code_Gf128ModulusRev dst);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
Vale.AES.GF128.lemma_gf128_constant_rev (va_eval_vec_opr va_s0 dst);
let (va_s3, va_fc3) = va_lemma_Vxor (va_hd va_b1) va_s0 dst dst dst in
let va_b3 = va_tl va_b1 in
let (va_s4, va_fc4) = va_lemma_LoadImmShl64 (va_hd va_b3) va_s3 (va_op_reg_opr_reg 10) (-7936) in
let va_b4 = va_tl va_b3 in
Vale.AES.Types_helpers.lemma_ishl_64 ((-7936) `op_Modulus` pow2_64) 16;
let (va_s6, va_fc6) = va_lemma_Mtvsrws (va_hd va_b4) va_s4 (va_op_vec_opr_vec 3)
(va_op_reg_opr_reg 10) in
let va_b6 = va_tl va_b4 in
let (va_s7, va_fc7) = va_lemma_Vsldoi (va_hd va_b6) va_s6 dst (va_op_vec_opr_vec 3) dst 12 in
let va_b7 = va_tl va_b6 in
Vale.Math.Poly2.Lemmas.lemma_split_define (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127)
64;
Vale.Math.Poly2.Lemmas.lemma_index_all ();
Vale.Math.Poly2.Lemmas.lemma_reverse_define_all ();
Vale.Math.Poly2.lemma_equal (Vale.Math.Poly2_s.mod (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) (Vale.Math.Poly2_s.monomial 64)) zero;
Vale.Math.Poly2.Bits.lemma_quad32_double (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127);
let (va_sM, va_f7) = va_lemma_empty_total va_s7 va_b7 in
let va_f6 = va_lemma_merge_total va_b6 va_s6 va_fc7 va_s7 va_f7 va_sM in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_sM in
let va_f3 = va_lemma_merge_total va_b3 va_s3 va_fc4 va_s4 va_f4 va_sM in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc3 va_s3 va_f3 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_Gf128ModulusRev (dst:va_operand_vec_opr) (va_s0:va_state) (va_k:(va_state -> unit ->
Type0)) : Type0 =
(va_is_dst_vec_opr dst va_s0 /\ va_get_ok va_s0 /\ dst =!= 3 /\ (forall
(va_x_dst:va_value_vec_opr) (va_x_r10:nat64) (va_x_v3:quad32) . let va_sM = va_upd_vec 3
va_x_v3 (va_upd_reg 10 va_x_r10 (va_upd_operand_vec_opr dst va_x_dst va_s0)) in va_get_ok va_sM
/\ va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) /\ Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_lo (va_eval_vec_opr va_sM dst)) == zero ==> va_k va_sM (())))
val va_wpProof_Gf128ModulusRev : dst:va_operand_vec_opr -> va_s0:va_state -> va_k:(va_state -> unit
-> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Gf128ModulusRev dst va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Gf128ModulusRev dst) ([va_Mod_vec 3;
va_Mod_reg 10; va_mod_vec_opr dst]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_Gf128ModulusRev dst va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Gf128ModulusRev (va_code_Gf128ModulusRev dst) va_s0 dst in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 3 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM
(va_update_operand_vec_opr dst va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_reg 10; va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_Gf128ModulusRev (dst:va_operand_vec_opr) : (va_quickCode unit (va_code_Gf128ModulusRev
dst)) =
(va_QProc (va_code_Gf128ModulusRev dst) ([va_Mod_vec 3; va_Mod_reg 10; va_mod_vec_opr dst])
(va_wp_Gf128ModulusRev dst) (va_wpProof_Gf128ModulusRev dst))
//--
//-- ReduceMulRev128
[@ "opaque_to_smt" va_qattr]
let va_code_ReduceMulRev128 () =
(va_Block (va_CCons (va_code_ClmulRev128 ()) (va_CCons (va_code_Vmr (va_op_vec_opr_vec 6)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_CCons
(va_code_ClmulRev128 ()) (va_CCons (va_code_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2))
(va_CCons (va_code_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_CCons (va_code_ClmulRev64High ())
(va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5))
(va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6))
(va_CNil ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ReduceMulRev128 () =
(va_pbool_and (va_codegen_success_ClmulRev128 ()) (va_pbool_and (va_codegen_success_Vmr
(va_op_vec_opr_vec 6) (va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_Gf128ModulusRev
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_ClmulRev128 ()) (va_pbool_and
(va_codegen_success_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_pbool_and
(va_codegen_success_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_pbool_and
(va_codegen_success_ClmulRev64High ()) (va_pbool_and (va_codegen_success_AddPoly
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5)) (va_pbool_and
(va_codegen_success_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6))
(va_ttrue ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ReduceMulRev128 (va_mods:va_mods_t) (a:poly) (b:poly) : (va_quickCode unit
(va_code_ReduceMulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 329 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_degree ()) (let (va_arg31:Vale.Math.Poly2_s.poly) =
b in let (va_arg30:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 330 column 27 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_reduce_rev va_arg30 va_arg31
gf128_modulus_low_terms 128) (let (m:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.monomial 128
in let (h:Vale.Math.Poly2_s.poly) = gf128_modulus_low_terms in let (ab:Vale.Math.Poly2_s.poly)
= Vale.Math.Poly2_s.mul a b in let (rh:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse h
127 in let (rab:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse ab 255 in let
(rd:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod rab m in let (rdh:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.reverse rd 127) h) 255 in
let (rdhL:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod rdh m in let
(rdhLh:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.reverse rdhL 127) h) 127 in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 341 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev128 a b) (fun (va_s:va_state) va_g -> let ((lo1:poly), (hi1:poly)) = va_g in
let (va_arg29:Vale.Math.Poly2_s.poly) = lo1 in let (va_arg28:Vale.Math.Poly2_s.poly) = hi1 in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 342 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg28 va_arg29 128) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 343 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vmr (va_op_vec_opr_vec 6) (va_op_vec_opr_vec 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 345 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 346 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev128 (Vale.Math.Poly2_s.reverse rd 127) h) (fun (va_s:va_state) va_g -> let
((lo2:poly), (hi2:poly)) = va_g in let (va_arg27:Vale.Math.Poly2_s.poly) = lo2 in let
(va_arg26:Vale.Math.Poly2_s.poly) = hi2 in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 347 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg26 va_arg27 128) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 348 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 350 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Gf128ModulusRev (va_op_vec_opr_vec 2)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 352 column 31 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_quad32_double_hi_rev rdhL) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 353 column 31 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_quad32_double_hi_rev rh) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 354 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev64High (Vale.Math.Poly2_s.reverse rdhL 127) h) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 356 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5) rdhLh
(Vale.Math.Poly2_s.div rdh m)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 357 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6)
(Vale.Math.Poly2_s.add rdhLh (Vale.Math.Poly2_s.div rdh m)) (Vale.Math.Poly2_s.div rab m))
(va_QEmpty (()))))))))))))))))))
[@"opaque_to_smt"]
let va_lemma_ReduceMulRev128 va_b0 va_s0 a b =
let (va_mods:va_mods_t) = [va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_ReduceMulRev128 va_mods a b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ReduceMulRev128 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 315 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 327 column 55 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.AES.GF128_s.gf128_mul a b) 127))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_ReduceMulRev128 a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ReduceMulRev128 (va_code_ReduceMulRev128 ()) va_s0 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 6 va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))));
va_lemma_norm_mods ([va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- Gf128MulRev128
[@ "opaque_to_smt" va_qattr]
let va_code_Gf128MulRev128 () =
(va_Block (va_CCons (va_code_ReduceMulRev128 ()) (va_CNil ())))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Gf128MulRev128 () =
(va_pbool_and (va_codegen_success_ReduceMulRev128 ()) (va_ttrue ())) | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.fsti.checked",
"Vale.PPC64LE.InsBasic.fsti.checked",
"Vale.PPC64LE.Decls.fsti.checked",
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Words.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.TypesNative.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.Types_helpers.fsti.checked",
"Vale.AES.PPC64LE.PolyOps.fsti.checked",
"Vale.AES.GHash_BE.fsti.checked",
"Vale.AES.GF128_s.fsti.checked",
"Vale.AES.GF128.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.PPC64LE.GF128_Mul.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | va_mods: Vale.PPC64LE.QuickCode.va_mods_t
-> Vale.PPC64LE.QuickCode.va_quickCode Prims.unit
(Vale.AES.PPC64LE.GF128_Mul.va_code_Gf128MulRev128 ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.QuickCode.va_mods_t",
"Vale.PPC64LE.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.PPC64LE.Decls.va_code",
"Vale.AES.PPC64LE.GF128_Mul.va_code_ReduceMulRev128",
"Prims.Nil",
"Vale.PPC64LE.Machine_s.precode",
"Vale.PPC64LE.Decls.ins",
"Vale.PPC64LE.Decls.ocmp",
"Vale.PPC64LE.Decls.va_state",
"Vale.PPC64LE.QuickCodes.va_QBind",
"Vale.PPC64LE.QuickCodes.va_range1",
"Vale.AES.PPC64LE.GF128_Mul.va_quick_ReduceMulRev128",
"Vale.Math.Poly2_s.reverse",
"Vale.PPC64LE.QuickCodes.va_qPURE",
"Prims.pure_post",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Vale.Math.Poly2_s.degree",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.eq2",
"Vale.Math.Poly2_s.poly",
"Vale.Math.Poly2.Bits_s.of_quad32",
"Vale.Math.Poly2.Bits_s.to_quad32",
"Vale.Math.Poly2.Bits.lemma_of_to_quad32",
"Vale.PPC64LE.QuickCodes.va_QEmpty",
"Vale.AES.GF128.gf128_mul_rev",
"Vale.PPC64LE.QuickCodes.quickCodes",
"Vale.PPC64LE.Decls.va_get_vec",
"Vale.PPC64LE.Machine_s.state",
"Vale.PPC64LE.QuickCode.va_quickCode",
"Vale.AES.PPC64LE.GF128_Mul.va_code_Gf128MulRev128"
] | [] | false | false | false | false | false | let va_qcode_Gf128MulRev128 (va_mods: va_mods_t) : (va_quickCode unit (va_code_Gf128MulRev128 ())) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
let a:Vale.Math.Poly2_s.poly = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
let b:Vale.Math.Poly2_s.poly = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_QBind va_range1
"***** PRECONDITION NOT MET AT line 372 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ReduceMulRev128 (Vale.Math.Poly2_s.reverse a 127)
(Vale.Math.Poly2_s.reverse b 127))
(fun (va_s: va_state) _ ->
let va_arg6:Vale.Math.Poly2_s.poly = Vale.AES.GF128.gf128_mul_rev a b in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 373 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_: unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg6)
(va_QEmpty (()))))) | false |
DM4F.fst | DM4F.test | val test: Prims.unit -> ST int int null | val test: Prims.unit -> ST int int null | let test () : ST int int null =
let x = get () in
put (x + x);
get () + get () | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 104,
"start_col": 0,
"start_line": 101
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. p1 r ==> p2 r) ==> w s0 p1 ==> w s0 p2
// ^ this version seems to be less SMT-friendly
forall s0 p1 p2. (forall x s1. p1 (x, s1) ==> p2 (x, s1)) ==> w s0 p1 ==> w s0 p2
type wp st a = w:(wp0 st a){st_monotonic w}
type repr (a:Type u#ua) (st:Type0) (wp : wp u#ua st a) : Type u#ua =
s0:st -> PURE (a & st) (as_pure_wp (wp s0))
unfold
let return_wp (#a:Type) (#st:Type0) (x:a) : wp st a = fun s0 p -> p (x, s0)
let return (a:Type) (x:a) (st:Type0) : repr a st (return_wp x) =
fun s0 -> (x, s0)
unfold
let bind_wp (#a #b:Type) (#st:Type0) (wp_c:wp st a) (wp_f:a -> wp st b) : wp st b =
fun s0 p -> wp_c s0 (fun (y, s1) -> wp_f y s1 p)
let bind (a:Type) (b:Type) (st:Type0)
(wp_c : wp st a)
(wp_f : a -> wp st b)
(c : repr a st wp_c)
(f : (x:a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f)
= fun s0 -> let (y, s1) = c s0 in
f y s1
unfold
let ite_wp (#a:Type) (#st:Type0) (wpf wpg:wp st a) (b:bool) : wp st a =
fun s0 p -> (b ==> wpf s0 p) /\ ((~b) ==> wpg s0 p)
let if_then_else
(a:Type)
(st:Type0)
(wpf wpg : wp st a)
(f : repr a st wpf)
(g : repr a st wpg)
(b : bool)
: Type
= repr a st (ite_wp wpf wpg b)
unfold
let stronger
(#a:Type) (#st:Type0)
(w1 w2 : wp st a)
: Type0
= forall s0 p. w1 s0 p ==> w2 s0 p
let subcomp
(a:Type)
(st:Type0)
(wpf wpg : wp st a)
(f : repr a st wpf)
: Pure (repr a st wpg)
(requires (stronger wpg wpf))
(ensures (fun _ -> True))
= f
total
reifiable
reflectable
effect {
ST (a:Type) ([@@@ effect_param] st:Type0) (_:wp st a)
with {repr; return; bind; if_then_else; subcomp}
}
unfold
let lift_wp (#a:Type) (#st:Type0) (w:pure_wp a) : wp st a =
elim_pure_wp_monotonicity_forall ();
fun s0 p -> w (fun x -> p (x, s0))
let lift_pure_st a wp st (f : unit -> PURE a wp)
: repr a st (lift_wp wp)
= elim_pure_wp_monotonicity_forall ();
fun s0 -> (f (), s0)
sub_effect PURE ~> ST = lift_pure_st
let null #st #a : wp st a =
fun s0 p -> forall r. p r
let get #st () : ST st st (fun s0 p -> p (s0, s0)) =
ST?.reflect (fun s0 -> (s0, s0))
let put #st (s:st) : ST unit st (fun _ p -> p ((), s)) =
ST?.reflect (fun _ -> ((), s)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> DM4F.ST Prims.int | DM4F.ST | [] | [] | [
"Prims.unit",
"Prims.op_Addition",
"Prims.int",
"DM4F.get",
"DM4F.put",
"DM4F.null"
] | [] | false | true | false | false | false | let test () : ST int int null =
| let x = get () in
put (x + x);
get () + get () | false |
Vale.AES.PPC64LE.GF128_Mul.fst | Vale.AES.PPC64LE.GF128_Mul.va_lemma_Gf128ModulusRev | val va_lemma_Gf128ModulusRev : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128ModulusRev dst) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_get_ok va_s0 /\ dst =!= 3))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) /\ Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_lo (va_eval_vec_opr va_sM dst)) == zero /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM (va_update_operand_vec_opr
dst va_sM va_s0)))))) | val va_lemma_Gf128ModulusRev : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128ModulusRev dst) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_get_ok va_s0 /\ dst =!= 3))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) /\ Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_lo (va_eval_vec_opr va_sM dst)) == zero /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM (va_update_operand_vec_opr
dst va_sM va_s0)))))) | let va_lemma_Gf128ModulusRev va_b0 va_s0 dst =
va_reveal_opaque (`%va_code_Gf128ModulusRev) (va_code_Gf128ModulusRev dst);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
Vale.AES.GF128.lemma_gf128_constant_rev (va_eval_vec_opr va_s0 dst);
let (va_s3, va_fc3) = va_lemma_Vxor (va_hd va_b1) va_s0 dst dst dst in
let va_b3 = va_tl va_b1 in
let (va_s4, va_fc4) = va_lemma_LoadImmShl64 (va_hd va_b3) va_s3 (va_op_reg_opr_reg 10) (-7936) in
let va_b4 = va_tl va_b3 in
Vale.AES.Types_helpers.lemma_ishl_64 ((-7936) `op_Modulus` pow2_64) 16;
let (va_s6, va_fc6) = va_lemma_Mtvsrws (va_hd va_b4) va_s4 (va_op_vec_opr_vec 3)
(va_op_reg_opr_reg 10) in
let va_b6 = va_tl va_b4 in
let (va_s7, va_fc7) = va_lemma_Vsldoi (va_hd va_b6) va_s6 dst (va_op_vec_opr_vec 3) dst 12 in
let va_b7 = va_tl va_b6 in
Vale.Math.Poly2.Lemmas.lemma_split_define (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127)
64;
Vale.Math.Poly2.Lemmas.lemma_index_all ();
Vale.Math.Poly2.Lemmas.lemma_reverse_define_all ();
Vale.Math.Poly2.lemma_equal (Vale.Math.Poly2_s.mod (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) (Vale.Math.Poly2_s.monomial 64)) zero;
Vale.Math.Poly2.Bits.lemma_quad32_double (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127);
let (va_sM, va_f7) = va_lemma_empty_total va_s7 va_b7 in
let va_f6 = va_lemma_merge_total va_b6 va_s6 va_fc7 va_s7 va_f7 va_sM in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_sM in
let va_f3 = va_lemma_merge_total va_b3 va_s3 va_fc4 va_s4 va_f4 va_sM in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc3 va_s3 va_f3 va_sM in
(va_sM, va_fM) | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Mul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 926,
"start_col": 0,
"start_line": 899
} | module Vale.AES.PPC64LE.GF128_Mul
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.TypesNative
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open Vale.AES.GF128
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.InsBasic
open Vale.PPC64LE.InsMem
open Vale.PPC64LE.InsVector
open Vale.PPC64LE.QuickCode
open Vale.PPC64LE.QuickCodes
open Vale.AES.PPC64LE.PolyOps
open Vale.AES.Types_helpers
open Vale.AES.GHash_BE
//-- ShiftLeft128_1
[@ "opaque_to_smt" va_qattr]
let va_code_ShiftLeft128_1 () =
(va_Block (va_CCons (va_code_Vspltisb (va_op_vec_opr_vec 2) 1) (va_CCons (va_code_Vsl
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2)) (va_CNil ()))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ShiftLeft128_1 () =
(va_pbool_and (va_codegen_success_Vspltisb (va_op_vec_opr_vec 2) 1) (va_pbool_and
(va_codegen_success_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2))
(va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ShiftLeft128_1 (va_mods:va_mods_t) (a:poly) : (va_quickCode unit
(va_code_ShiftLeft128_1 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 60 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisb (va_op_vec_opr_vec 2) 1) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 61 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> let (va_arg5:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 63 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_shift_left_1 va_arg5) (va_QEmpty (()))))))
[@"opaque_to_smt"]
let va_lemma_ShiftLeft128_1 va_b0 va_s0 a =
let (va_mods:va_mods_t) = [va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ShiftLeft128_1 va_mods a in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftLeft128_1 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 49 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 58 column 37 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.shift a 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_ShiftLeft128_1 a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftLeft128_1 (va_code_ShiftLeft128_1 ()) va_s0 a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_ok va_sM
va_s0))));
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- ShiftLeft2_128_1
val va_code_ShiftLeft2_128_1 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ShiftLeft2_128_1 () =
(va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0) 0) (va_CCons (va_code_LoadImm64
(va_op_reg_opr_reg 10) 31) (va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg
10)) (va_CCons (va_code_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_CCons (va_code_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0) (va_op_vec_opr_vec 3) 4)
(va_CCons (va_code_Vspltisb (va_op_vec_opr_vec 0) 1) (va_CCons (va_code_Vsl (va_op_vec_opr_vec
1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 0)) (va_CCons (va_code_Vsl (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_CCons (va_code_Vxor (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_CNil ())))))))))))
val va_codegen_success_ShiftLeft2_128_1 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ShiftLeft2_128_1 () =
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 0) 0) (va_pbool_and
(va_codegen_success_LoadImm64 (va_op_reg_opr_reg 10) 31) (va_pbool_and
(va_codegen_success_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_pbool_and
(va_codegen_success_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_pbool_and (va_codegen_success_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0)
(va_op_vec_opr_vec 3) 4) (va_pbool_and (va_codegen_success_Vspltisb (va_op_vec_opr_vec 0) 1)
(va_pbool_and (va_codegen_success_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 0)) (va_pbool_and (va_codegen_success_Vsl (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_pbool_and (va_codegen_success_Vxor
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_ttrue ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ShiftLeft2_128_1 (va_mods:va_mods_t) (lo:poly) (hi:poly) : (va_quickCode unit
(va_code_ShiftLeft2_128_1 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisw (va_op_vec_opr_vec 0) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 84 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_LoadImm64 (va_op_reg_opr_reg 10) 31) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 85 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 86 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 87 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0) (va_op_vec_opr_vec 3) 4) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 88 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisb (va_op_vec_opr_vec 0) 1) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 89 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 0)) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 90 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_QBind
va_range1
"***** PRECONDITION NOT MET AT line 91 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vxor (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (fun
(va_s:va_state) _ -> let (l:(Vale.Def.Words_s.four Vale.Def.Words_s.nat32)) =
Vale.Def.Words.Four_s.four_map #nat32 #Vale.Def.Words_s.nat32 (fun (i:nat32) ->
Vale.Arch.Types.ishl32 i 1) (va_get_vec 2 va_old_s) in let (r:(Vale.Def.Words_s.four
Vale.Def.Words_s.nat32)) = Vale.Def.Words.Four_s.four_map #nat32 #Vale.Def.Words_s.nat32 (fun
(i:nat32) -> Vale.Arch.Types.ishr32 i 31) (va_get_vec 2 va_old_s) in let
(va_arg22:Vale.Def.Types_s.quad32) = va_get_vec 3 va_s in let
(va_arg21:Vale.Def.Types_s.quad32) = Vale.Def.Words_s.Mkfour #Vale.Def.Types_s.nat32 0
(Vale.Def.Words_s.__proj__Mkfour__item__lo0 r) (Vale.Def.Words_s.__proj__Mkfour__item__lo1 r)
(Vale.Def.Words_s.__proj__Mkfour__item__hi2 r) in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 95 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Arch.TypesNative.lemma_quad32_xor_commutes va_arg21 va_arg22) (let
(va_arg20:Vale.Def.Types_s.quad32) = va_get_vec 3 va_s in let
(va_arg19:Vale.Def.Types_s.quad32) = Vale.Def.Words_s.Mkfour #Vale.Def.Types_s.nat32 0
(Vale.Def.Words_s.__proj__Mkfour__item__lo0 r) (Vale.Def.Words_s.__proj__Mkfour__item__lo1 r)
(Vale.Def.Words_s.__proj__Mkfour__item__hi2 r) in let (va_arg18:Vale.Def.Types_s.quad32) = l in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 96 column 32 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Arch.TypesNative.lemma_quad32_xor_associates va_arg18 va_arg19 va_arg20)
(let (va_arg17:Vale.Math.Poly2_s.poly) = hi in let (va_arg16:Vale.Math.Poly2_s.poly) = lo in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 98 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_shift_2_left_1 va_arg16 va_arg17) (va_QEmpty
(())))))))))))))))
val va_lemma_ShiftLeft2_128_1 : va_b0:va_code -> va_s0:va_state -> lo:poly -> hi:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ShiftLeft2_128_1 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree hi < 127 /\ Vale.Math.Poly2_s.degree lo <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 hi))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let n = Vale.Math.Poly2_s.monomial 128 in let a = Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul
hi n) lo in let b = Vale.Math.Poly2_s.shift a 1 in va_get_vec 1 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n) /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)) /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))
[@"opaque_to_smt"]
let va_lemma_ShiftLeft2_128_1 va_b0 va_s0 lo hi =
let (va_mods:va_mods_t) = [va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10;
va_Mod_ok] in
let va_qc = va_qcode_ShiftLeft2_128_1 va_mods lo hi in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftLeft2_128_1 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 66 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 77 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let n = Vale.Math.Poly2_s.monomial 128 in label va_range1
"***** POSTCONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let a = Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul hi n) lo in label va_range1
"***** POSTCONDITION NOT MET AT line 79 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let b = Vale.Math.Poly2_s.shift a 1 in label va_range1
"***** POSTCONDITION NOT MET AT line 80 column 35 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 81 column 35 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)))))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10;
va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_ShiftLeft2_128_1 (lo:poly) (hi:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0))
: Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree hi < 127 /\ Vale.Math.Poly2_s.degree lo <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 hi /\ (forall (va_x_r10:nat64) (va_x_v0:quad32)
(va_x_v1:quad32) (va_x_v2:quad32) (va_x_v3:quad32) . let va_sM = va_upd_vec 3 va_x_v3
(va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1 (va_upd_vec 0 va_x_v0 (va_upd_reg 10 va_x_r10
va_s0)))) in va_get_ok va_sM /\ (let n = Vale.Math.Poly2_s.monomial 128 in let a =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul hi n) lo in let b = Vale.Math.Poly2_s.shift a 1 in
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n) /\
va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)) ==> va_k
va_sM (())))
val va_wpProof_ShiftLeft2_128_1 : lo:poly -> hi:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ShiftLeft2_128_1 lo hi va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ShiftLeft2_128_1 ()) ([va_Mod_vec 3;
va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ShiftLeft2_128_1 lo hi va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftLeft2_128_1 (va_code_ShiftLeft2_128_1 ()) va_s0 lo hi in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM
(va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM va_s0)))))));
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10])
va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ShiftLeft2_128_1 (lo:poly) (hi:poly) : (va_quickCode unit (va_code_ShiftLeft2_128_1
())) =
(va_QProc (va_code_ShiftLeft2_128_1 ()) ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0;
va_Mod_reg 10]) (va_wp_ShiftLeft2_128_1 lo hi) (va_wpProof_ShiftLeft2_128_1 lo hi))
//--
//-- ClmulRev64High
val va_code_ClmulRev64High : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ClmulRev64High () =
(va_Block (va_CCons (va_code_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_ShiftLeft128_1 ()) (va_CNil ()))))
val va_codegen_success_ClmulRev64High : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ClmulRev64High () =
(va_pbool_and (va_codegen_success_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_ShiftLeft128_1 ()) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ClmulRev64High (va_mods:va_mods_t) (a:poly) (b:poly) : (va_quickCode unit
(va_code_ClmulRev64High ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(va_arg18:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 116 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg18) (let
(va_arg17:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 117 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg17) (let
(va_arg16:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 118 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg16 64) (let
(va_arg15:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 119 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg15 64) (let
(va_arg14:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 120 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg14 64) (let
(va_arg13:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 121 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg13 64) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 17 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2))
(va_QBind va_range1
"***** PRECONDITION NOT MET AT line 123 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ShiftLeft128_1 (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.reverse a 63)
(Vale.Math.Poly2_s.reverse b 63))) (fun (va_s:va_state) _ -> let
(va_arg12:Vale.Math.Poly2_s.poly) = b in let (va_arg11:Vale.Math.Poly2_s.poly) = a in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 125 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_reverse_shift_1 va_arg11 va_arg12 63)
(va_QEmpty (()))))))))))))
val va_lemma_ClmulRev64High : va_b0:va_code -> va_s0:va_state -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ClmulRev64High ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 63 /\ Vale.Math.Poly2_s.degree b <= 63 /\
Vale.Math.Poly2_s.reverse a 63 == Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_hi (va_get_vec 1 va_s0)) /\ Vale.Math.Poly2_s.reverse b 63 ==
Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_hi (va_get_vec 2 va_s0)) /\
l_or (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo (va_get_vec 1
va_s0)) == zero) (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo
(va_get_vec 2 va_s0)) == zero)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.Math.Poly2_s.mul a b) 127) /\ va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1
va_sM (va_update_ok va_sM va_s0)))))
[@"opaque_to_smt"]
let va_lemma_ClmulRev64High va_b0 va_s0 a b =
let (va_mods:va_mods_t) = [va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ClmulRev64High va_mods a b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ClmulRev64High ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 101 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 49 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.Math.Poly2_s.mul a b) 127))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_ClmulRev64High (a:poly) (b:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) :
Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree a <= 63 /\ Vale.Math.Poly2_s.degree b <= 63 /\
Vale.Math.Poly2_s.reverse a 63 == Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_hi (va_get_vec 1 va_s0)) /\ Vale.Math.Poly2_s.reverse b 63 ==
Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_hi (va_get_vec 2 va_s0)) /\
l_or (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo (va_get_vec 1
va_s0)) == zero) (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo
(va_get_vec 2 va_s0)) == zero) /\ (forall (va_x_v1:quad32) (va_x_v2:quad32) . let va_sM =
va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1 va_s0) in va_get_ok va_sM /\ va_get_vec 1 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul a b) 127)
==> va_k va_sM (())))
val va_wpProof_ClmulRev64High : a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ClmulRev64High a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ClmulRev64High ()) ([va_Mod_vec 2;
va_Mod_vec 1]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ClmulRev64High a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ClmulRev64High (va_code_ClmulRev64High ()) va_s0 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_ok va_sM
va_s0))));
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ClmulRev64High (a:poly) (b:poly) : (va_quickCode unit (va_code_ClmulRev64High ())) =
(va_QProc (va_code_ClmulRev64High ()) ([va_Mod_vec 2; va_Mod_vec 1]) (va_wp_ClmulRev64High a b)
(va_wpProof_ClmulRev64High a b))
//--
//-- High64ToLow
[@ "opaque_to_smt"]
let va_code_High64ToLow dst src =
(va_Block (va_CCons (va_code_Vsldoi dst (va_op_vec_opr_vec 0) src 8) (va_CNil ())))
[@ "opaque_to_smt"]
let va_codegen_success_High64ToLow dst src =
(va_pbool_and (va_codegen_success_Vsldoi dst (va_op_vec_opr_vec 0) src 8) (va_ttrue ()))
[@"opaque_to_smt"]
let va_lemma_High64ToLow va_b0 va_s0 dst src a =
va_reveal_opaque (`%va_code_High64ToLow) (va_code_High64ToLow dst src);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let (va_s2, va_fc2) = va_lemma_Vsldoi (va_hd va_b1) va_s0 dst (va_op_vec_opr_vec 0) src 8 in
let va_b2 = va_tl va_b1 in
Vale.Math.Poly2.Words.lemma_quad32_double_shift a;
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_High64ToLow dst src a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_High64ToLow (va_code_High64ToLow dst src) va_s0 dst src a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- Low64ToHigh
[@ "opaque_to_smt" va_qattr]
let va_code_Low64ToHigh dst src =
(va_Block (va_CCons (va_code_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (va_CNil ())))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Low64ToHigh dst src =
(va_pbool_and (va_codegen_success_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (va_ttrue ()))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Low64ToHigh (va_mods:va_mods_t) (dst:vec_opr) (src:vec_opr) (a:poly) : (va_quickCode
unit (va_code_Low64ToHigh dst src)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 156 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (fun (va_s:va_state) _ -> let
(va_arg4:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 157 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Words.lemma_quad32_double_shift va_arg4) (va_QEmpty (())))))
[@"opaque_to_smt"]
let va_lemma_Low64ToHigh va_b0 va_s0 dst src a =
let (va_mods:va_mods_t) = [va_Mod_ok; va_mod_vec_opr dst] in
let va_qc = va_qcode_Low64ToHigh va_mods dst src a in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Low64ToHigh dst src) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 144 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 154 column 66 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod a (Vale.Math.Poly2_s.monomial 64)) (Vale.Math.Poly2_s.monomial 64)))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_ok; va_mod_vec_opr dst]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_Low64ToHigh dst src a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Low64ToHigh (va_code_Low64ToHigh dst src) va_s0 dst src a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AddPoly
val va_code_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr -> src2:va_operand_vec_opr
-> Tot va_code
[@ "opaque_to_smt"]
let va_code_AddPoly dst src1 src2 =
(va_Block (va_CCons (va_code_Vxor dst src1 src2) (va_CNil ())))
val va_codegen_success_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr ->
src2:va_operand_vec_opr -> Tot va_pbool
[@ "opaque_to_smt"]
let va_codegen_success_AddPoly dst src1 src2 =
(va_pbool_and (va_codegen_success_Vxor dst src1 src2) (va_ttrue ()))
val va_lemma_AddPoly : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr ->
src1:va_operand_vec_opr -> src2:va_operand_vec_opr -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AddPoly dst src1 src2) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_is_src_vec_opr src1 va_s0 /\ va_is_src_vec_opr src2 va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\ va_eval_vec_opr va_s0
src1 == Vale.Math.Poly2.Bits_s.to_quad32 a /\ va_eval_vec_opr va_s0 src2 ==
Vale.Math.Poly2.Bits_s.to_quad32 b))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add a b) /\
va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0))))
[@"opaque_to_smt"]
let va_lemma_AddPoly va_b0 va_s0 dst src1 src2 a b =
va_reveal_opaque (`%va_code_AddPoly) (va_code_AddPoly dst src1 src2);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let (va_s2, va_fc2) = va_lemma_Vxor (va_hd va_b1) va_s0 dst src1 src2 in
let va_b2 = va_tl va_b1 in
Vale.Math.Poly2.Words.lemma_add128 a b;
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_AddPoly (dst:va_operand_vec_opr) (src1:va_operand_vec_opr) (src2:va_operand_vec_opr)
(a:poly) (b:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_is_dst_vec_opr dst va_s0 /\ va_is_src_vec_opr src1 va_s0 /\ va_is_src_vec_opr src2 va_s0 /\
va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\
va_eval_vec_opr va_s0 src1 == Vale.Math.Poly2.Bits_s.to_quad32 a /\ va_eval_vec_opr va_s0 src2
== Vale.Math.Poly2.Bits_s.to_quad32 b /\ (forall (va_x_dst:va_value_vec_opr) . let va_sM =
va_upd_operand_vec_opr dst va_x_dst va_s0 in va_get_ok va_sM /\ va_eval_vec_opr va_sM dst ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add a b) ==> va_k va_sM (())))
val va_wpProof_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr ->
src2:va_operand_vec_opr -> a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AddPoly dst src1 src2 a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AddPoly dst src1 src2)
([va_mod_vec_opr dst]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_AddPoly dst src1 src2 a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AddPoly (va_code_AddPoly dst src1 src2) va_s0 dst src1 src2 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_AddPoly (dst:va_operand_vec_opr) (src1:va_operand_vec_opr) (src2:va_operand_vec_opr)
(a:poly) (b:poly) : (va_quickCode unit (va_code_AddPoly dst src1 src2)) =
(va_QProc (va_code_AddPoly dst src1 src2) ([va_mod_vec_opr dst]) (va_wp_AddPoly dst src1 src2 a
b) (va_wpProof_AddPoly dst src1 src2 a b))
//--
//-- Clmul128
val va_code_Clmul128 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_Clmul128 () =
(va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0) 0) (va_CCons (va_code_VSwap
(va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (va_CCons (va_code_High64ToLow (va_op_vec_opr_vec
4) (va_op_vec_opr_vec 3)) (va_CCons (va_code_Low64ToHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 3)) (va_CCons (va_code_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec
4) (va_op_vec_opr_vec 2)) (va_CCons (va_code_VPolyMulHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_CCons (va_code_Low64ToHigh (va_op_vec_opr_vec
1) (va_op_vec_opr_vec 3)) (va_CCons (va_code_High64ToLow (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 3)) (va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 4)) (va_CCons (va_code_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 2)) (va_CNil ())))))))))))))
val va_codegen_success_Clmul128 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Clmul128 () =
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 0) 0) (va_pbool_and
(va_codegen_success_VSwap (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (va_pbool_and
(va_codegen_success_High64ToLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 3)) (va_pbool_and
(va_codegen_success_Low64ToHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 3)) (va_pbool_and
(va_codegen_success_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 2))
(va_pbool_and (va_codegen_success_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 4)
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_VPolyMulHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_Low64ToHigh
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_pbool_and (va_codegen_success_High64ToLow
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_pbool_and (va_codegen_success_AddPoly
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 4)) (va_pbool_and
(va_codegen_success_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2))
(va_ttrue ()))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Clmul128 (va_mods:va_mods_t) (ab:poly) (cd:poly) : (va_quickCode (poly & poly)
(va_code_Clmul128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(n:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.monomial 64 in let (a:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.div ab n in let (b:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ab n in
let (c:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div cd n in let (d:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.mod cd n in let (ac:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul a c in
let (ad:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul a d in let (bc:Vale.Math.Poly2_s.poly)
= Vale.Math.Poly2_s.mul b c in let (bd:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul b d in
let (ab_sw:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.swap ab 64 in let
(ab_hi:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ab n in let
(ab_lo:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.div ab n) n in let
(va_arg77:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 202 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg77) (let
(va_arg76:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 203 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg76) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 205 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisw (va_op_vec_opr_vec 0) 0) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 206 column 10 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VSwap (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (fun (va_s:va_state) _ -> let
(va_arg75:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 207 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg75) (let
(va_arg74:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 208 column 29 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Words.lemma_quad32_double_swap va_arg74) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 209 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double ab_sw) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 210 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_High64ToLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 3) ab_sw) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 211 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Low64ToHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 3) ab_sw) (fun (va_s:va_state) _
-> va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 212 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 4 va_s == Vale.Math.Poly2.Bits_s.to_quad32 ab_hi) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 213 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 5 va_s == Vale.Math.Poly2.Bits_s.to_quad32 ab_lo) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 215 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 217 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 ab_hi) (let
(va_arg73:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ab_hi n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 218 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_degree_negative va_arg73) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 219 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_hi 64) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 220 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 222 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 ab_lo) (let
(va_arg72:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ab n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 223 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_div_mod_exact va_arg72 n) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 224 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_lo 64) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 225 column 17 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> let (va_arg71:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 227 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg71) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 228 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_sw 64) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 229 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_sw 64) (let
(va_arg70:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 230 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg70 64) (let
(va_arg69:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 231 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg69 64) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 232 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s) == Vale.Math.Poly2_s.add ad bc) (va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 234 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_hi 64) (let
(va_arg68:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 235 column 18 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mod_mod va_arg68 n) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 236 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 4 va_s) == bd) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 238 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_lo 64) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 239 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 5 va_s) == ac) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 241 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Low64ToHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3) (Vale.Math.Poly2_s.add ad
bc)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 242 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mod_distribute ad bc n) (let
(va_arg67:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod bc n in let
(va_arg66:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ad n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 243 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_distribute_left va_arg66 va_arg67 n)
(va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 244 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_s == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n) (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod bc n) n))) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 246 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_High64ToLow (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3) (Vale.Math.Poly2_s.add ad
bc)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 247 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GHash_BE.lemma_div_distribute ad bc n) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 248 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_s == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.div ad n) (Vale.Math.Poly2_s.div bc n))) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 250 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 4)
(Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n)
(Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod bc n) n)) bd) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 251 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2) ac
(Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.div ad n) (Vale.Math.Poly2_s.div bc n))) (fun
(va_s:va_state) _ -> let (va_arg65:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div bc n in let
(va_arg64:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ad n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 253 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_commute va_arg64 va_arg65) (let
(va_arg63:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ad n in let
(va_arg62:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div bc n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 254 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_associate ac va_arg62 va_arg63) (let (hi:poly) =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.add ac (Vale.Math.Poly2_s.div bc n))
(Vale.Math.Poly2_s.div ad n) in let (va_arg61:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod bc n) n in let (va_arg60:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod ad n) n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 256 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_commute va_arg60 va_arg61) (let (lo:poly) =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod bc
n) n) (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n)) bd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 259 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_mul a b c d 64) (va_QEmpty ((lo,
hi))))))))))))))))))))))))))))))))))))))))))))))))
val va_lemma_Clmul128 : va_b0:va_code -> va_s0:va_state -> ab:poly -> cd:poly
-> Ghost (va_state & va_fuel & poly & poly)
(requires (va_require_total va_b0 (va_code_Clmul128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 ab /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 cd))
(ensures (fun (va_sM, va_fM, lo, hi) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok
va_sM /\ Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi < 127 /\
Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 hi /\ va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec
4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0
va_sM (va_update_ok va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_Clmul128 va_b0 va_s0 ab cd =
let (va_mods:va_mods_t) = [va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_ok] in
let va_qc = va_qcode_Clmul128 va_mods ab cd in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Clmul128 ()) va_qc va_s0 (fun va_s0
va_sM va_g -> let (lo, hi) = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 174 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 184 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree lo <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 185 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree hi < 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 186 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo) /\
label va_range1
"***** POSTCONDITION NOT MET AT line 187 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 188 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_ok]) va_sM va_s0;
let (lo, hi) = va_g in
(va_sM, va_fM, lo, hi)
[@ va_qattr]
let va_wp_Clmul128 (ab:poly) (cd:poly) (va_s0:va_state) (va_k:(va_state -> (poly & poly) -> Type0))
: Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 ab /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 cd /\ (forall (va_x_v0:quad32) (va_x_v1:quad32)
(va_x_v2:quad32) (va_x_v3:quad32) (va_x_v4:quad32) (va_x_v5:quad32) (lo:poly) (hi:poly) . let
va_sM = va_upd_vec 5 va_x_v5 (va_upd_vec 4 va_x_v4 (va_upd_vec 3 va_x_v3 (va_upd_vec 2 va_x_v2
(va_upd_vec 1 va_x_v1 (va_upd_vec 0 va_x_v0 va_s0))))) in va_get_ok va_sM /\
Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi < 127 /\
Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 hi ==> va_k va_sM ((lo, hi))))
val va_wpProof_Clmul128 : ab:poly -> cd:poly -> va_s0:va_state -> va_k:(va_state -> (poly & poly)
-> Type0)
-> Ghost (va_state & va_fuel & (poly & poly))
(requires (va_t_require va_s0 /\ va_wp_Clmul128 ab cd va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Clmul128 ()) ([va_Mod_vec 5;
va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0]) va_s0 va_k ((va_sM,
va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_Clmul128 ab cd va_s0 va_k =
let (va_sM, va_f0, lo, hi) = va_lemma_Clmul128 (va_code_Clmul128 ()) va_s0 ab cd in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM
(va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_ok va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0]) va_sM va_s0;
let va_g = (lo, hi) in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_Clmul128 (ab:poly) (cd:poly) : (va_quickCode (poly & poly) (va_code_Clmul128 ())) =
(va_QProc (va_code_Clmul128 ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0]) (va_wp_Clmul128 ab cd) (va_wpProof_Clmul128 ab cd))
//--
//-- ClmulRev128
val va_code_ClmulRev128 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ClmulRev128 () =
(va_Block (va_CCons (va_code_Clmul128 ()) (va_CCons (va_code_ShiftLeft2_128_1 ()) (va_CNil ()))))
val va_codegen_success_ClmulRev128 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ClmulRev128 () =
(va_pbool_and (va_codegen_success_Clmul128 ()) (va_pbool_and (va_codegen_success_ShiftLeft2_128_1
()) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ClmulRev128 (va_mods:va_mods_t) (ab:poly) (cd:poly) : (va_quickCode (poly & poly)
(va_code_ClmulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 279 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Clmul128 (Vale.Math.Poly2_s.reverse ab 127) (Vale.Math.Poly2_s.reverse cd 127)) (fun
(va_s:va_state) va_g -> let (lo, hi) = va_g in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 280 column 21 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ShiftLeft2_128_1 lo hi) (fun (va_s:va_state) _ -> let (m:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.shift (Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo) 1 in let
(va_arg13:Vale.Math.Poly2_s.poly) = lo in let (va_arg12:Vale.Math.Poly2_s.poly) = hi in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 283 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg12 va_arg13 128) (va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 284 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_split_define m 128) (let (lo:poly) =
Vale.Math.Poly2_s.mod m (Vale.Math.Poly2_s.monomial 128) in let (hi:poly) =
Vale.Math.Poly2_s.div m (Vale.Math.Poly2_s.monomial 128) in let
(va_arg11:Vale.Math.Poly2_s.poly) = cd in let (va_arg10:Vale.Math.Poly2_s.poly) = ab in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 287 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_reverse_shift_1 va_arg10 va_arg11 127)
(va_QEmpty ((lo, hi)))))))))
val va_lemma_ClmulRev128 : va_b0:va_code -> va_s0:va_state -> ab:poly -> cd:poly
-> Ghost (va_state & va_fuel & poly & poly)
(requires (va_require_total va_b0 (va_code_ClmulRev128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse ab 127) /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse cd 127)))
(ensures (fun (va_sM, va_fM, lo, hi) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok
va_sM /\ Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi <= 127 /\
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo /\ va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32
lo /\ va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi /\ va_state_eq va_sM
(va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM
(va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM
va_s0))))))))))
[@"opaque_to_smt"]
let va_lemma_ClmulRev128 va_b0 va_s0 ab cd =
let (va_mods:va_mods_t) = [va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_ClmulRev128 va_mods ab cd in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ClmulRev128 ()) va_qc va_s0 (fun va_s0
va_sM va_g -> let (lo, hi) = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 262 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 273 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree lo <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 274 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree hi <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 275 column 61 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 276 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 277 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok]) va_sM va_s0;
let (lo, hi) = va_g in
(va_sM, va_fM, lo, hi)
[@ va_qattr]
let va_wp_ClmulRev128 (ab:poly) (cd:poly) (va_s0:va_state) (va_k:(va_state -> (poly & poly) ->
Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse ab 127) /\
va_get_vec 2 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse cd 127) /\
(forall (va_x_r10:nat64) (va_x_v0:quad32) (va_x_v1:quad32) (va_x_v2:quad32) (va_x_v3:quad32)
(va_x_v4:quad32) (va_x_v5:quad32) (lo:poly) (hi:poly) . let va_sM = va_upd_vec 5 va_x_v5
(va_upd_vec 4 va_x_v4 (va_upd_vec 3 va_x_v3 (va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1
(va_upd_vec 0 va_x_v0 (va_upd_reg 10 va_x_r10 va_s0)))))) in va_get_ok va_sM /\
Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi <= 127 /\
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo /\ va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32
lo /\ va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi ==> va_k va_sM ((lo, hi))))
val va_wpProof_ClmulRev128 : ab:poly -> cd:poly -> va_s0:va_state -> va_k:(va_state -> (poly &
poly) -> Type0)
-> Ghost (va_state & va_fuel & (poly & poly))
(requires (va_t_require va_s0 /\ va_wp_ClmulRev128 ab cd va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ClmulRev128 ()) ([va_Mod_vec 5;
va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_s0
va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ClmulRev128 ab cd va_s0 va_k =
let (va_sM, va_f0, lo, hi) = va_lemma_ClmulRev128 (va_code_ClmulRev128 ()) va_s0 ab cd in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM
(va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM
(va_update_ok va_sM va_s0)))))))));
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10]) va_sM va_s0;
let va_g = (lo, hi) in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ClmulRev128 (ab:poly) (cd:poly) : (va_quickCode (poly & poly) (va_code_ClmulRev128
())) =
(va_QProc (va_code_ClmulRev128 ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) (va_wp_ClmulRev128 ab cd) (va_wpProof_ClmulRev128
ab cd))
//--
//-- Gf128ModulusRev
val va_code_Gf128ModulusRev : dst:va_operand_vec_opr -> Tot va_code
[@ "opaque_to_smt"]
let va_code_Gf128ModulusRev dst =
(va_Block (va_CCons (va_code_Vxor dst dst dst) (va_CCons (va_code_LoadImmShl64 (va_op_reg_opr_reg
10) (-7936)) (va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_CCons
(va_code_Vsldoi dst (va_op_vec_opr_vec 3) dst 12) (va_CNil ()))))))
val va_codegen_success_Gf128ModulusRev : dst:va_operand_vec_opr -> Tot va_pbool
[@ "opaque_to_smt"]
let va_codegen_success_Gf128ModulusRev dst =
(va_pbool_and (va_codegen_success_Vxor dst dst dst) (va_pbool_and
(va_codegen_success_LoadImmShl64 (va_op_reg_opr_reg 10) (-7936)) (va_pbool_and
(va_codegen_success_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_pbool_and
(va_codegen_success_Vsldoi dst (va_op_vec_opr_vec 3) dst 12) (va_ttrue ())))))
val va_lemma_Gf128ModulusRev : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128ModulusRev dst) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_get_ok va_s0 /\ dst =!= 3))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) /\ Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_lo (va_eval_vec_opr va_sM dst)) == zero /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM (va_update_operand_vec_opr
dst va_sM va_s0)))))) | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.fsti.checked",
"Vale.PPC64LE.InsBasic.fsti.checked",
"Vale.PPC64LE.Decls.fsti.checked",
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Words.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.TypesNative.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.Types_helpers.fsti.checked",
"Vale.AES.PPC64LE.PolyOps.fsti.checked",
"Vale.AES.GHash_BE.fsti.checked",
"Vale.AES.GF128_s.fsti.checked",
"Vale.AES.GF128.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.PPC64LE.GF128_Mul.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
va_b0: Vale.PPC64LE.Decls.va_code ->
va_s0: Vale.PPC64LE.Decls.va_state ->
dst: Vale.PPC64LE.Decls.va_operand_vec_opr
-> Prims.Ghost (Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.PPC64LE.Decls.va_code",
"Vale.PPC64LE.Decls.va_state",
"Vale.PPC64LE.Decls.va_operand_vec_opr",
"Vale.PPC64LE.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple2",
"Vale.PPC64LE.Decls.va_lemma_merge_total",
"FStar.Pervasives.Native.tuple2",
"Vale.PPC64LE.Machine_s.state",
"Vale.PPC64LE.Decls.va_lemma_empty_total",
"Prims.unit",
"Vale.Math.Poly2.Bits.lemma_quad32_double",
"Vale.Math.Poly2_s.reverse",
"Vale.AES.GF128_s.gf128_modulus_low_terms",
"Vale.Math.Poly2.lemma_equal",
"Vale.Math.Poly2_s.mod",
"Vale.Math.Poly2_s.monomial",
"Vale.Math.Poly2_s.zero",
"Vale.Math.Poly2.Lemmas.lemma_reverse_define_all",
"Vale.Math.Poly2.Lemmas.lemma_index_all",
"Vale.Math.Poly2.Lemmas.lemma_split_define",
"Prims.list",
"Vale.PPC64LE.Machine_s.precode",
"Vale.PPC64LE.Decls.ins",
"Vale.PPC64LE.Decls.ocmp",
"Vale.PPC64LE.Decls.va_tl",
"Vale.PPC64LE.InsVector.va_lemma_Vsldoi",
"Vale.PPC64LE.Decls.va_hd",
"Vale.PPC64LE.Decls.va_op_vec_opr_vec",
"Vale.PPC64LE.InsVector.va_lemma_Mtvsrws",
"Vale.PPC64LE.Decls.va_op_reg_opr_reg",
"Vale.AES.Types_helpers.lemma_ishl_64",
"Prims.op_Modulus",
"Prims.op_Minus",
"Vale.PPC64LE.Machine_s.pow2_64",
"Vale.PPC64LE.InsBasic.va_lemma_LoadImmShl64",
"Vale.PPC64LE.InsVector.va_lemma_Vxor",
"Vale.AES.GF128.lemma_gf128_constant_rev",
"Vale.PPC64LE.Decls.va_eval_vec_opr",
"Vale.PPC64LE.Decls.va_get_block",
"Vale.PPC64LE.Decls.va_reveal_opaque",
"Vale.AES.PPC64LE.GF128_Mul.va_code_Gf128ModulusRev"
] | [] | false | false | false | false | false | let va_lemma_Gf128ModulusRev va_b0 va_s0 dst =
| va_reveal_opaque (`%va_code_Gf128ModulusRev) (va_code_Gf128ModulusRev dst);
let va_old_s:va_state = va_s0 in
let va_b1:va_codes = va_get_block va_b0 in
Vale.AES.GF128.lemma_gf128_constant_rev (va_eval_vec_opr va_s0 dst);
let va_s3, va_fc3 = va_lemma_Vxor (va_hd va_b1) va_s0 dst dst dst in
let va_b3 = va_tl va_b1 in
let va_s4, va_fc4 = va_lemma_LoadImmShl64 (va_hd va_b3) va_s3 (va_op_reg_opr_reg 10) (- 7936) in
let va_b4 = va_tl va_b3 in
Vale.AES.Types_helpers.lemma_ishl_64 ((- 7936) `op_Modulus` pow2_64) 16;
let va_s6, va_fc6 =
va_lemma_Mtvsrws (va_hd va_b4) va_s4 (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)
in
let va_b6 = va_tl va_b4 in
let va_s7, va_fc7 = va_lemma_Vsldoi (va_hd va_b6) va_s6 dst (va_op_vec_opr_vec 3) dst 12 in
let va_b7 = va_tl va_b6 in
Vale.Math.Poly2.Lemmas.lemma_split_define (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127) 64;
Vale.Math.Poly2.Lemmas.lemma_index_all ();
Vale.Math.Poly2.Lemmas.lemma_reverse_define_all ();
Vale.Math.Poly2.lemma_equal (Vale.Math.Poly2_s.mod (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms
127)
(Vale.Math.Poly2_s.monomial 64))
zero;
Vale.Math.Poly2.Bits.lemma_quad32_double (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127);
let va_sM, va_f7 = va_lemma_empty_total va_s7 va_b7 in
let va_f6 = va_lemma_merge_total va_b6 va_s6 va_fc7 va_s7 va_f7 va_sM in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_sM in
let va_f3 = va_lemma_merge_total va_b3 va_s3 va_fc4 va_s4 va_f4 va_sM in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc3 va_s3 va_f3 va_sM in
(va_sM, va_fM) | false |
Vale.AES.PPC64LE.GF128_Mul.fst | Vale.AES.PPC64LE.GF128_Mul.va_qcode_ReduceMulRev128 | val va_qcode_ReduceMulRev128 (va_mods: va_mods_t) (a b: poly)
: (va_quickCode unit (va_code_ReduceMulRev128 ())) | val va_qcode_ReduceMulRev128 (va_mods: va_mods_t) (a b: poly)
: (va_quickCode unit (va_code_ReduceMulRev128 ())) | let va_qcode_ReduceMulRev128 (va_mods:va_mods_t) (a:poly) (b:poly) : (va_quickCode unit
(va_code_ReduceMulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 329 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_degree ()) (let (va_arg31:Vale.Math.Poly2_s.poly) =
b in let (va_arg30:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 330 column 27 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_reduce_rev va_arg30 va_arg31
gf128_modulus_low_terms 128) (let (m:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.monomial 128
in let (h:Vale.Math.Poly2_s.poly) = gf128_modulus_low_terms in let (ab:Vale.Math.Poly2_s.poly)
= Vale.Math.Poly2_s.mul a b in let (rh:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse h
127 in let (rab:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse ab 255 in let
(rd:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod rab m in let (rdh:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.reverse rd 127) h) 255 in
let (rdhL:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod rdh m in let
(rdhLh:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.reverse rdhL 127) h) 127 in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 341 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev128 a b) (fun (va_s:va_state) va_g -> let ((lo1:poly), (hi1:poly)) = va_g in
let (va_arg29:Vale.Math.Poly2_s.poly) = lo1 in let (va_arg28:Vale.Math.Poly2_s.poly) = hi1 in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 342 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg28 va_arg29 128) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 343 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vmr (va_op_vec_opr_vec 6) (va_op_vec_opr_vec 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 345 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 346 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev128 (Vale.Math.Poly2_s.reverse rd 127) h) (fun (va_s:va_state) va_g -> let
((lo2:poly), (hi2:poly)) = va_g in let (va_arg27:Vale.Math.Poly2_s.poly) = lo2 in let
(va_arg26:Vale.Math.Poly2_s.poly) = hi2 in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 347 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg26 va_arg27 128) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 348 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 350 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Gf128ModulusRev (va_op_vec_opr_vec 2)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 352 column 31 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_quad32_double_hi_rev rdhL) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 353 column 31 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_quad32_double_hi_rev rh) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 354 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev64High (Vale.Math.Poly2_s.reverse rdhL 127) h) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 356 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5) rdhLh
(Vale.Math.Poly2_s.div rdh m)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 357 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6)
(Vale.Math.Poly2_s.add rdhLh (Vale.Math.Poly2_s.div rdh m)) (Vale.Math.Poly2_s.div rab m))
(va_QEmpty (())))))))))))))))))) | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Mul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 1037,
"start_col": 0,
"start_line": 986
} | module Vale.AES.PPC64LE.GF128_Mul
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.TypesNative
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open Vale.AES.GF128
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.InsBasic
open Vale.PPC64LE.InsMem
open Vale.PPC64LE.InsVector
open Vale.PPC64LE.QuickCode
open Vale.PPC64LE.QuickCodes
open Vale.AES.PPC64LE.PolyOps
open Vale.AES.Types_helpers
open Vale.AES.GHash_BE
//-- ShiftLeft128_1
[@ "opaque_to_smt" va_qattr]
let va_code_ShiftLeft128_1 () =
(va_Block (va_CCons (va_code_Vspltisb (va_op_vec_opr_vec 2) 1) (va_CCons (va_code_Vsl
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2)) (va_CNil ()))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ShiftLeft128_1 () =
(va_pbool_and (va_codegen_success_Vspltisb (va_op_vec_opr_vec 2) 1) (va_pbool_and
(va_codegen_success_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2))
(va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ShiftLeft128_1 (va_mods:va_mods_t) (a:poly) : (va_quickCode unit
(va_code_ShiftLeft128_1 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 60 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisb (va_op_vec_opr_vec 2) 1) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 61 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> let (va_arg5:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 63 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_shift_left_1 va_arg5) (va_QEmpty (()))))))
[@"opaque_to_smt"]
let va_lemma_ShiftLeft128_1 va_b0 va_s0 a =
let (va_mods:va_mods_t) = [va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ShiftLeft128_1 va_mods a in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftLeft128_1 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 49 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 58 column 37 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.shift a 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_ShiftLeft128_1 a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftLeft128_1 (va_code_ShiftLeft128_1 ()) va_s0 a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_ok va_sM
va_s0))));
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- ShiftLeft2_128_1
val va_code_ShiftLeft2_128_1 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ShiftLeft2_128_1 () =
(va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0) 0) (va_CCons (va_code_LoadImm64
(va_op_reg_opr_reg 10) 31) (va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg
10)) (va_CCons (va_code_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_CCons (va_code_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0) (va_op_vec_opr_vec 3) 4)
(va_CCons (va_code_Vspltisb (va_op_vec_opr_vec 0) 1) (va_CCons (va_code_Vsl (va_op_vec_opr_vec
1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 0)) (va_CCons (va_code_Vsl (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_CCons (va_code_Vxor (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_CNil ())))))))))))
val va_codegen_success_ShiftLeft2_128_1 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ShiftLeft2_128_1 () =
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 0) 0) (va_pbool_and
(va_codegen_success_LoadImm64 (va_op_reg_opr_reg 10) 31) (va_pbool_and
(va_codegen_success_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_pbool_and
(va_codegen_success_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_pbool_and (va_codegen_success_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0)
(va_op_vec_opr_vec 3) 4) (va_pbool_and (va_codegen_success_Vspltisb (va_op_vec_opr_vec 0) 1)
(va_pbool_and (va_codegen_success_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 0)) (va_pbool_and (va_codegen_success_Vsl (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_pbool_and (va_codegen_success_Vxor
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_ttrue ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ShiftLeft2_128_1 (va_mods:va_mods_t) (lo:poly) (hi:poly) : (va_quickCode unit
(va_code_ShiftLeft2_128_1 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisw (va_op_vec_opr_vec 0) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 84 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_LoadImm64 (va_op_reg_opr_reg 10) 31) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 85 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 86 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 87 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0) (va_op_vec_opr_vec 3) 4) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 88 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisb (va_op_vec_opr_vec 0) 1) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 89 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 0)) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 90 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_QBind
va_range1
"***** PRECONDITION NOT MET AT line 91 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vxor (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (fun
(va_s:va_state) _ -> let (l:(Vale.Def.Words_s.four Vale.Def.Words_s.nat32)) =
Vale.Def.Words.Four_s.four_map #nat32 #Vale.Def.Words_s.nat32 (fun (i:nat32) ->
Vale.Arch.Types.ishl32 i 1) (va_get_vec 2 va_old_s) in let (r:(Vale.Def.Words_s.four
Vale.Def.Words_s.nat32)) = Vale.Def.Words.Four_s.four_map #nat32 #Vale.Def.Words_s.nat32 (fun
(i:nat32) -> Vale.Arch.Types.ishr32 i 31) (va_get_vec 2 va_old_s) in let
(va_arg22:Vale.Def.Types_s.quad32) = va_get_vec 3 va_s in let
(va_arg21:Vale.Def.Types_s.quad32) = Vale.Def.Words_s.Mkfour #Vale.Def.Types_s.nat32 0
(Vale.Def.Words_s.__proj__Mkfour__item__lo0 r) (Vale.Def.Words_s.__proj__Mkfour__item__lo1 r)
(Vale.Def.Words_s.__proj__Mkfour__item__hi2 r) in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 95 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Arch.TypesNative.lemma_quad32_xor_commutes va_arg21 va_arg22) (let
(va_arg20:Vale.Def.Types_s.quad32) = va_get_vec 3 va_s in let
(va_arg19:Vale.Def.Types_s.quad32) = Vale.Def.Words_s.Mkfour #Vale.Def.Types_s.nat32 0
(Vale.Def.Words_s.__proj__Mkfour__item__lo0 r) (Vale.Def.Words_s.__proj__Mkfour__item__lo1 r)
(Vale.Def.Words_s.__proj__Mkfour__item__hi2 r) in let (va_arg18:Vale.Def.Types_s.quad32) = l in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 96 column 32 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Arch.TypesNative.lemma_quad32_xor_associates va_arg18 va_arg19 va_arg20)
(let (va_arg17:Vale.Math.Poly2_s.poly) = hi in let (va_arg16:Vale.Math.Poly2_s.poly) = lo in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 98 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_shift_2_left_1 va_arg16 va_arg17) (va_QEmpty
(())))))))))))))))
val va_lemma_ShiftLeft2_128_1 : va_b0:va_code -> va_s0:va_state -> lo:poly -> hi:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ShiftLeft2_128_1 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree hi < 127 /\ Vale.Math.Poly2_s.degree lo <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 hi))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let n = Vale.Math.Poly2_s.monomial 128 in let a = Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul
hi n) lo in let b = Vale.Math.Poly2_s.shift a 1 in va_get_vec 1 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n) /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)) /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))
[@"opaque_to_smt"]
let va_lemma_ShiftLeft2_128_1 va_b0 va_s0 lo hi =
let (va_mods:va_mods_t) = [va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10;
va_Mod_ok] in
let va_qc = va_qcode_ShiftLeft2_128_1 va_mods lo hi in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftLeft2_128_1 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 66 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 77 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let n = Vale.Math.Poly2_s.monomial 128 in label va_range1
"***** POSTCONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let a = Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul hi n) lo in label va_range1
"***** POSTCONDITION NOT MET AT line 79 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let b = Vale.Math.Poly2_s.shift a 1 in label va_range1
"***** POSTCONDITION NOT MET AT line 80 column 35 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 81 column 35 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)))))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10;
va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_ShiftLeft2_128_1 (lo:poly) (hi:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0))
: Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree hi < 127 /\ Vale.Math.Poly2_s.degree lo <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 hi /\ (forall (va_x_r10:nat64) (va_x_v0:quad32)
(va_x_v1:quad32) (va_x_v2:quad32) (va_x_v3:quad32) . let va_sM = va_upd_vec 3 va_x_v3
(va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1 (va_upd_vec 0 va_x_v0 (va_upd_reg 10 va_x_r10
va_s0)))) in va_get_ok va_sM /\ (let n = Vale.Math.Poly2_s.monomial 128 in let a =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul hi n) lo in let b = Vale.Math.Poly2_s.shift a 1 in
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n) /\
va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)) ==> va_k
va_sM (())))
val va_wpProof_ShiftLeft2_128_1 : lo:poly -> hi:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ShiftLeft2_128_1 lo hi va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ShiftLeft2_128_1 ()) ([va_Mod_vec 3;
va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ShiftLeft2_128_1 lo hi va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftLeft2_128_1 (va_code_ShiftLeft2_128_1 ()) va_s0 lo hi in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM
(va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM va_s0)))))));
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10])
va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ShiftLeft2_128_1 (lo:poly) (hi:poly) : (va_quickCode unit (va_code_ShiftLeft2_128_1
())) =
(va_QProc (va_code_ShiftLeft2_128_1 ()) ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0;
va_Mod_reg 10]) (va_wp_ShiftLeft2_128_1 lo hi) (va_wpProof_ShiftLeft2_128_1 lo hi))
//--
//-- ClmulRev64High
val va_code_ClmulRev64High : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ClmulRev64High () =
(va_Block (va_CCons (va_code_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_ShiftLeft128_1 ()) (va_CNil ()))))
val va_codegen_success_ClmulRev64High : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ClmulRev64High () =
(va_pbool_and (va_codegen_success_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_ShiftLeft128_1 ()) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ClmulRev64High (va_mods:va_mods_t) (a:poly) (b:poly) : (va_quickCode unit
(va_code_ClmulRev64High ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(va_arg18:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 116 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg18) (let
(va_arg17:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 117 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg17) (let
(va_arg16:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 118 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg16 64) (let
(va_arg15:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 119 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg15 64) (let
(va_arg14:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 120 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg14 64) (let
(va_arg13:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 121 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg13 64) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 17 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2))
(va_QBind va_range1
"***** PRECONDITION NOT MET AT line 123 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ShiftLeft128_1 (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.reverse a 63)
(Vale.Math.Poly2_s.reverse b 63))) (fun (va_s:va_state) _ -> let
(va_arg12:Vale.Math.Poly2_s.poly) = b in let (va_arg11:Vale.Math.Poly2_s.poly) = a in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 125 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_reverse_shift_1 va_arg11 va_arg12 63)
(va_QEmpty (()))))))))))))
val va_lemma_ClmulRev64High : va_b0:va_code -> va_s0:va_state -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ClmulRev64High ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 63 /\ Vale.Math.Poly2_s.degree b <= 63 /\
Vale.Math.Poly2_s.reverse a 63 == Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_hi (va_get_vec 1 va_s0)) /\ Vale.Math.Poly2_s.reverse b 63 ==
Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_hi (va_get_vec 2 va_s0)) /\
l_or (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo (va_get_vec 1
va_s0)) == zero) (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo
(va_get_vec 2 va_s0)) == zero)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.Math.Poly2_s.mul a b) 127) /\ va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1
va_sM (va_update_ok va_sM va_s0)))))
[@"opaque_to_smt"]
let va_lemma_ClmulRev64High va_b0 va_s0 a b =
let (va_mods:va_mods_t) = [va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ClmulRev64High va_mods a b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ClmulRev64High ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 101 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 49 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.Math.Poly2_s.mul a b) 127))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_ClmulRev64High (a:poly) (b:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) :
Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree a <= 63 /\ Vale.Math.Poly2_s.degree b <= 63 /\
Vale.Math.Poly2_s.reverse a 63 == Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_hi (va_get_vec 1 va_s0)) /\ Vale.Math.Poly2_s.reverse b 63 ==
Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_hi (va_get_vec 2 va_s0)) /\
l_or (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo (va_get_vec 1
va_s0)) == zero) (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo
(va_get_vec 2 va_s0)) == zero) /\ (forall (va_x_v1:quad32) (va_x_v2:quad32) . let va_sM =
va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1 va_s0) in va_get_ok va_sM /\ va_get_vec 1 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul a b) 127)
==> va_k va_sM (())))
val va_wpProof_ClmulRev64High : a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ClmulRev64High a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ClmulRev64High ()) ([va_Mod_vec 2;
va_Mod_vec 1]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ClmulRev64High a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ClmulRev64High (va_code_ClmulRev64High ()) va_s0 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_ok va_sM
va_s0))));
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ClmulRev64High (a:poly) (b:poly) : (va_quickCode unit (va_code_ClmulRev64High ())) =
(va_QProc (va_code_ClmulRev64High ()) ([va_Mod_vec 2; va_Mod_vec 1]) (va_wp_ClmulRev64High a b)
(va_wpProof_ClmulRev64High a b))
//--
//-- High64ToLow
[@ "opaque_to_smt"]
let va_code_High64ToLow dst src =
(va_Block (va_CCons (va_code_Vsldoi dst (va_op_vec_opr_vec 0) src 8) (va_CNil ())))
[@ "opaque_to_smt"]
let va_codegen_success_High64ToLow dst src =
(va_pbool_and (va_codegen_success_Vsldoi dst (va_op_vec_opr_vec 0) src 8) (va_ttrue ()))
[@"opaque_to_smt"]
let va_lemma_High64ToLow va_b0 va_s0 dst src a =
va_reveal_opaque (`%va_code_High64ToLow) (va_code_High64ToLow dst src);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let (va_s2, va_fc2) = va_lemma_Vsldoi (va_hd va_b1) va_s0 dst (va_op_vec_opr_vec 0) src 8 in
let va_b2 = va_tl va_b1 in
Vale.Math.Poly2.Words.lemma_quad32_double_shift a;
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_High64ToLow dst src a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_High64ToLow (va_code_High64ToLow dst src) va_s0 dst src a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- Low64ToHigh
[@ "opaque_to_smt" va_qattr]
let va_code_Low64ToHigh dst src =
(va_Block (va_CCons (va_code_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (va_CNil ())))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Low64ToHigh dst src =
(va_pbool_and (va_codegen_success_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (va_ttrue ()))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Low64ToHigh (va_mods:va_mods_t) (dst:vec_opr) (src:vec_opr) (a:poly) : (va_quickCode
unit (va_code_Low64ToHigh dst src)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 156 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (fun (va_s:va_state) _ -> let
(va_arg4:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 157 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Words.lemma_quad32_double_shift va_arg4) (va_QEmpty (())))))
[@"opaque_to_smt"]
let va_lemma_Low64ToHigh va_b0 va_s0 dst src a =
let (va_mods:va_mods_t) = [va_Mod_ok; va_mod_vec_opr dst] in
let va_qc = va_qcode_Low64ToHigh va_mods dst src a in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Low64ToHigh dst src) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 144 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 154 column 66 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod a (Vale.Math.Poly2_s.monomial 64)) (Vale.Math.Poly2_s.monomial 64)))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_ok; va_mod_vec_opr dst]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_Low64ToHigh dst src a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Low64ToHigh (va_code_Low64ToHigh dst src) va_s0 dst src a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AddPoly
val va_code_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr -> src2:va_operand_vec_opr
-> Tot va_code
[@ "opaque_to_smt"]
let va_code_AddPoly dst src1 src2 =
(va_Block (va_CCons (va_code_Vxor dst src1 src2) (va_CNil ())))
val va_codegen_success_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr ->
src2:va_operand_vec_opr -> Tot va_pbool
[@ "opaque_to_smt"]
let va_codegen_success_AddPoly dst src1 src2 =
(va_pbool_and (va_codegen_success_Vxor dst src1 src2) (va_ttrue ()))
val va_lemma_AddPoly : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr ->
src1:va_operand_vec_opr -> src2:va_operand_vec_opr -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AddPoly dst src1 src2) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_is_src_vec_opr src1 va_s0 /\ va_is_src_vec_opr src2 va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\ va_eval_vec_opr va_s0
src1 == Vale.Math.Poly2.Bits_s.to_quad32 a /\ va_eval_vec_opr va_s0 src2 ==
Vale.Math.Poly2.Bits_s.to_quad32 b))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add a b) /\
va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0))))
[@"opaque_to_smt"]
let va_lemma_AddPoly va_b0 va_s0 dst src1 src2 a b =
va_reveal_opaque (`%va_code_AddPoly) (va_code_AddPoly dst src1 src2);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let (va_s2, va_fc2) = va_lemma_Vxor (va_hd va_b1) va_s0 dst src1 src2 in
let va_b2 = va_tl va_b1 in
Vale.Math.Poly2.Words.lemma_add128 a b;
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_AddPoly (dst:va_operand_vec_opr) (src1:va_operand_vec_opr) (src2:va_operand_vec_opr)
(a:poly) (b:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_is_dst_vec_opr dst va_s0 /\ va_is_src_vec_opr src1 va_s0 /\ va_is_src_vec_opr src2 va_s0 /\
va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\
va_eval_vec_opr va_s0 src1 == Vale.Math.Poly2.Bits_s.to_quad32 a /\ va_eval_vec_opr va_s0 src2
== Vale.Math.Poly2.Bits_s.to_quad32 b /\ (forall (va_x_dst:va_value_vec_opr) . let va_sM =
va_upd_operand_vec_opr dst va_x_dst va_s0 in va_get_ok va_sM /\ va_eval_vec_opr va_sM dst ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add a b) ==> va_k va_sM (())))
val va_wpProof_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr ->
src2:va_operand_vec_opr -> a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AddPoly dst src1 src2 a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AddPoly dst src1 src2)
([va_mod_vec_opr dst]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_AddPoly dst src1 src2 a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AddPoly (va_code_AddPoly dst src1 src2) va_s0 dst src1 src2 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_AddPoly (dst:va_operand_vec_opr) (src1:va_operand_vec_opr) (src2:va_operand_vec_opr)
(a:poly) (b:poly) : (va_quickCode unit (va_code_AddPoly dst src1 src2)) =
(va_QProc (va_code_AddPoly dst src1 src2) ([va_mod_vec_opr dst]) (va_wp_AddPoly dst src1 src2 a
b) (va_wpProof_AddPoly dst src1 src2 a b))
//--
//-- Clmul128
val va_code_Clmul128 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_Clmul128 () =
(va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0) 0) (va_CCons (va_code_VSwap
(va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (va_CCons (va_code_High64ToLow (va_op_vec_opr_vec
4) (va_op_vec_opr_vec 3)) (va_CCons (va_code_Low64ToHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 3)) (va_CCons (va_code_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec
4) (va_op_vec_opr_vec 2)) (va_CCons (va_code_VPolyMulHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_CCons (va_code_Low64ToHigh (va_op_vec_opr_vec
1) (va_op_vec_opr_vec 3)) (va_CCons (va_code_High64ToLow (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 3)) (va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 4)) (va_CCons (va_code_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 2)) (va_CNil ())))))))))))))
val va_codegen_success_Clmul128 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Clmul128 () =
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 0) 0) (va_pbool_and
(va_codegen_success_VSwap (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (va_pbool_and
(va_codegen_success_High64ToLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 3)) (va_pbool_and
(va_codegen_success_Low64ToHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 3)) (va_pbool_and
(va_codegen_success_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 2))
(va_pbool_and (va_codegen_success_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 4)
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_VPolyMulHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_Low64ToHigh
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_pbool_and (va_codegen_success_High64ToLow
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_pbool_and (va_codegen_success_AddPoly
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 4)) (va_pbool_and
(va_codegen_success_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2))
(va_ttrue ()))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Clmul128 (va_mods:va_mods_t) (ab:poly) (cd:poly) : (va_quickCode (poly & poly)
(va_code_Clmul128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(n:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.monomial 64 in let (a:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.div ab n in let (b:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ab n in
let (c:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div cd n in let (d:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.mod cd n in let (ac:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul a c in
let (ad:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul a d in let (bc:Vale.Math.Poly2_s.poly)
= Vale.Math.Poly2_s.mul b c in let (bd:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul b d in
let (ab_sw:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.swap ab 64 in let
(ab_hi:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ab n in let
(ab_lo:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.div ab n) n in let
(va_arg77:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 202 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg77) (let
(va_arg76:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 203 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg76) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 205 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisw (va_op_vec_opr_vec 0) 0) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 206 column 10 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VSwap (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (fun (va_s:va_state) _ -> let
(va_arg75:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 207 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg75) (let
(va_arg74:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 208 column 29 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Words.lemma_quad32_double_swap va_arg74) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 209 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double ab_sw) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 210 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_High64ToLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 3) ab_sw) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 211 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Low64ToHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 3) ab_sw) (fun (va_s:va_state) _
-> va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 212 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 4 va_s == Vale.Math.Poly2.Bits_s.to_quad32 ab_hi) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 213 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 5 va_s == Vale.Math.Poly2.Bits_s.to_quad32 ab_lo) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 215 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 217 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 ab_hi) (let
(va_arg73:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ab_hi n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 218 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_degree_negative va_arg73) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 219 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_hi 64) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 220 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 222 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 ab_lo) (let
(va_arg72:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ab n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 223 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_div_mod_exact va_arg72 n) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 224 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_lo 64) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 225 column 17 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> let (va_arg71:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 227 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg71) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 228 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_sw 64) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 229 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_sw 64) (let
(va_arg70:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 230 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg70 64) (let
(va_arg69:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 231 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg69 64) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 232 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s) == Vale.Math.Poly2_s.add ad bc) (va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 234 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_hi 64) (let
(va_arg68:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 235 column 18 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mod_mod va_arg68 n) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 236 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 4 va_s) == bd) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 238 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_lo 64) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 239 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 5 va_s) == ac) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 241 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Low64ToHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3) (Vale.Math.Poly2_s.add ad
bc)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 242 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mod_distribute ad bc n) (let
(va_arg67:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod bc n in let
(va_arg66:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ad n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 243 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_distribute_left va_arg66 va_arg67 n)
(va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 244 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_s == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n) (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod bc n) n))) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 246 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_High64ToLow (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3) (Vale.Math.Poly2_s.add ad
bc)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 247 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GHash_BE.lemma_div_distribute ad bc n) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 248 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_s == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.div ad n) (Vale.Math.Poly2_s.div bc n))) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 250 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 4)
(Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n)
(Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod bc n) n)) bd) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 251 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2) ac
(Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.div ad n) (Vale.Math.Poly2_s.div bc n))) (fun
(va_s:va_state) _ -> let (va_arg65:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div bc n in let
(va_arg64:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ad n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 253 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_commute va_arg64 va_arg65) (let
(va_arg63:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ad n in let
(va_arg62:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div bc n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 254 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_associate ac va_arg62 va_arg63) (let (hi:poly) =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.add ac (Vale.Math.Poly2_s.div bc n))
(Vale.Math.Poly2_s.div ad n) in let (va_arg61:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod bc n) n in let (va_arg60:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod ad n) n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 256 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_commute va_arg60 va_arg61) (let (lo:poly) =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod bc
n) n) (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n)) bd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 259 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_mul a b c d 64) (va_QEmpty ((lo,
hi))))))))))))))))))))))))))))))))))))))))))))))))
val va_lemma_Clmul128 : va_b0:va_code -> va_s0:va_state -> ab:poly -> cd:poly
-> Ghost (va_state & va_fuel & poly & poly)
(requires (va_require_total va_b0 (va_code_Clmul128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 ab /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 cd))
(ensures (fun (va_sM, va_fM, lo, hi) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok
va_sM /\ Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi < 127 /\
Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 hi /\ va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec
4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0
va_sM (va_update_ok va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_Clmul128 va_b0 va_s0 ab cd =
let (va_mods:va_mods_t) = [va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_ok] in
let va_qc = va_qcode_Clmul128 va_mods ab cd in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Clmul128 ()) va_qc va_s0 (fun va_s0
va_sM va_g -> let (lo, hi) = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 174 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 184 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree lo <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 185 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree hi < 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 186 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo) /\
label va_range1
"***** POSTCONDITION NOT MET AT line 187 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 188 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_ok]) va_sM va_s0;
let (lo, hi) = va_g in
(va_sM, va_fM, lo, hi)
[@ va_qattr]
let va_wp_Clmul128 (ab:poly) (cd:poly) (va_s0:va_state) (va_k:(va_state -> (poly & poly) -> Type0))
: Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 ab /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 cd /\ (forall (va_x_v0:quad32) (va_x_v1:quad32)
(va_x_v2:quad32) (va_x_v3:quad32) (va_x_v4:quad32) (va_x_v5:quad32) (lo:poly) (hi:poly) . let
va_sM = va_upd_vec 5 va_x_v5 (va_upd_vec 4 va_x_v4 (va_upd_vec 3 va_x_v3 (va_upd_vec 2 va_x_v2
(va_upd_vec 1 va_x_v1 (va_upd_vec 0 va_x_v0 va_s0))))) in va_get_ok va_sM /\
Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi < 127 /\
Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 hi ==> va_k va_sM ((lo, hi))))
val va_wpProof_Clmul128 : ab:poly -> cd:poly -> va_s0:va_state -> va_k:(va_state -> (poly & poly)
-> Type0)
-> Ghost (va_state & va_fuel & (poly & poly))
(requires (va_t_require va_s0 /\ va_wp_Clmul128 ab cd va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Clmul128 ()) ([va_Mod_vec 5;
va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0]) va_s0 va_k ((va_sM,
va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_Clmul128 ab cd va_s0 va_k =
let (va_sM, va_f0, lo, hi) = va_lemma_Clmul128 (va_code_Clmul128 ()) va_s0 ab cd in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM
(va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_ok va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0]) va_sM va_s0;
let va_g = (lo, hi) in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_Clmul128 (ab:poly) (cd:poly) : (va_quickCode (poly & poly) (va_code_Clmul128 ())) =
(va_QProc (va_code_Clmul128 ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0]) (va_wp_Clmul128 ab cd) (va_wpProof_Clmul128 ab cd))
//--
//-- ClmulRev128
val va_code_ClmulRev128 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ClmulRev128 () =
(va_Block (va_CCons (va_code_Clmul128 ()) (va_CCons (va_code_ShiftLeft2_128_1 ()) (va_CNil ()))))
val va_codegen_success_ClmulRev128 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ClmulRev128 () =
(va_pbool_and (va_codegen_success_Clmul128 ()) (va_pbool_and (va_codegen_success_ShiftLeft2_128_1
()) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ClmulRev128 (va_mods:va_mods_t) (ab:poly) (cd:poly) : (va_quickCode (poly & poly)
(va_code_ClmulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 279 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Clmul128 (Vale.Math.Poly2_s.reverse ab 127) (Vale.Math.Poly2_s.reverse cd 127)) (fun
(va_s:va_state) va_g -> let (lo, hi) = va_g in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 280 column 21 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ShiftLeft2_128_1 lo hi) (fun (va_s:va_state) _ -> let (m:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.shift (Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo) 1 in let
(va_arg13:Vale.Math.Poly2_s.poly) = lo in let (va_arg12:Vale.Math.Poly2_s.poly) = hi in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 283 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg12 va_arg13 128) (va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 284 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_split_define m 128) (let (lo:poly) =
Vale.Math.Poly2_s.mod m (Vale.Math.Poly2_s.monomial 128) in let (hi:poly) =
Vale.Math.Poly2_s.div m (Vale.Math.Poly2_s.monomial 128) in let
(va_arg11:Vale.Math.Poly2_s.poly) = cd in let (va_arg10:Vale.Math.Poly2_s.poly) = ab in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 287 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_reverse_shift_1 va_arg10 va_arg11 127)
(va_QEmpty ((lo, hi)))))))))
val va_lemma_ClmulRev128 : va_b0:va_code -> va_s0:va_state -> ab:poly -> cd:poly
-> Ghost (va_state & va_fuel & poly & poly)
(requires (va_require_total va_b0 (va_code_ClmulRev128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse ab 127) /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse cd 127)))
(ensures (fun (va_sM, va_fM, lo, hi) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok
va_sM /\ Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi <= 127 /\
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo /\ va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32
lo /\ va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi /\ va_state_eq va_sM
(va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM
(va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM
va_s0))))))))))
[@"opaque_to_smt"]
let va_lemma_ClmulRev128 va_b0 va_s0 ab cd =
let (va_mods:va_mods_t) = [va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_ClmulRev128 va_mods ab cd in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ClmulRev128 ()) va_qc va_s0 (fun va_s0
va_sM va_g -> let (lo, hi) = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 262 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 273 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree lo <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 274 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree hi <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 275 column 61 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 276 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 277 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok]) va_sM va_s0;
let (lo, hi) = va_g in
(va_sM, va_fM, lo, hi)
[@ va_qattr]
let va_wp_ClmulRev128 (ab:poly) (cd:poly) (va_s0:va_state) (va_k:(va_state -> (poly & poly) ->
Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse ab 127) /\
va_get_vec 2 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse cd 127) /\
(forall (va_x_r10:nat64) (va_x_v0:quad32) (va_x_v1:quad32) (va_x_v2:quad32) (va_x_v3:quad32)
(va_x_v4:quad32) (va_x_v5:quad32) (lo:poly) (hi:poly) . let va_sM = va_upd_vec 5 va_x_v5
(va_upd_vec 4 va_x_v4 (va_upd_vec 3 va_x_v3 (va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1
(va_upd_vec 0 va_x_v0 (va_upd_reg 10 va_x_r10 va_s0)))))) in va_get_ok va_sM /\
Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi <= 127 /\
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo /\ va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32
lo /\ va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi ==> va_k va_sM ((lo, hi))))
val va_wpProof_ClmulRev128 : ab:poly -> cd:poly -> va_s0:va_state -> va_k:(va_state -> (poly &
poly) -> Type0)
-> Ghost (va_state & va_fuel & (poly & poly))
(requires (va_t_require va_s0 /\ va_wp_ClmulRev128 ab cd va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ClmulRev128 ()) ([va_Mod_vec 5;
va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_s0
va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ClmulRev128 ab cd va_s0 va_k =
let (va_sM, va_f0, lo, hi) = va_lemma_ClmulRev128 (va_code_ClmulRev128 ()) va_s0 ab cd in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM
(va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM
(va_update_ok va_sM va_s0)))))))));
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10]) va_sM va_s0;
let va_g = (lo, hi) in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ClmulRev128 (ab:poly) (cd:poly) : (va_quickCode (poly & poly) (va_code_ClmulRev128
())) =
(va_QProc (va_code_ClmulRev128 ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) (va_wp_ClmulRev128 ab cd) (va_wpProof_ClmulRev128
ab cd))
//--
//-- Gf128ModulusRev
val va_code_Gf128ModulusRev : dst:va_operand_vec_opr -> Tot va_code
[@ "opaque_to_smt"]
let va_code_Gf128ModulusRev dst =
(va_Block (va_CCons (va_code_Vxor dst dst dst) (va_CCons (va_code_LoadImmShl64 (va_op_reg_opr_reg
10) (-7936)) (va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_CCons
(va_code_Vsldoi dst (va_op_vec_opr_vec 3) dst 12) (va_CNil ()))))))
val va_codegen_success_Gf128ModulusRev : dst:va_operand_vec_opr -> Tot va_pbool
[@ "opaque_to_smt"]
let va_codegen_success_Gf128ModulusRev dst =
(va_pbool_and (va_codegen_success_Vxor dst dst dst) (va_pbool_and
(va_codegen_success_LoadImmShl64 (va_op_reg_opr_reg 10) (-7936)) (va_pbool_and
(va_codegen_success_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_pbool_and
(va_codegen_success_Vsldoi dst (va_op_vec_opr_vec 3) dst 12) (va_ttrue ())))))
val va_lemma_Gf128ModulusRev : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128ModulusRev dst) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_get_ok va_s0 /\ dst =!= 3))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) /\ Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_lo (va_eval_vec_opr va_sM dst)) == zero /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM (va_update_operand_vec_opr
dst va_sM va_s0))))))
[@"opaque_to_smt"]
let va_lemma_Gf128ModulusRev va_b0 va_s0 dst =
va_reveal_opaque (`%va_code_Gf128ModulusRev) (va_code_Gf128ModulusRev dst);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
Vale.AES.GF128.lemma_gf128_constant_rev (va_eval_vec_opr va_s0 dst);
let (va_s3, va_fc3) = va_lemma_Vxor (va_hd va_b1) va_s0 dst dst dst in
let va_b3 = va_tl va_b1 in
let (va_s4, va_fc4) = va_lemma_LoadImmShl64 (va_hd va_b3) va_s3 (va_op_reg_opr_reg 10) (-7936) in
let va_b4 = va_tl va_b3 in
Vale.AES.Types_helpers.lemma_ishl_64 ((-7936) `op_Modulus` pow2_64) 16;
let (va_s6, va_fc6) = va_lemma_Mtvsrws (va_hd va_b4) va_s4 (va_op_vec_opr_vec 3)
(va_op_reg_opr_reg 10) in
let va_b6 = va_tl va_b4 in
let (va_s7, va_fc7) = va_lemma_Vsldoi (va_hd va_b6) va_s6 dst (va_op_vec_opr_vec 3) dst 12 in
let va_b7 = va_tl va_b6 in
Vale.Math.Poly2.Lemmas.lemma_split_define (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127)
64;
Vale.Math.Poly2.Lemmas.lemma_index_all ();
Vale.Math.Poly2.Lemmas.lemma_reverse_define_all ();
Vale.Math.Poly2.lemma_equal (Vale.Math.Poly2_s.mod (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) (Vale.Math.Poly2_s.monomial 64)) zero;
Vale.Math.Poly2.Bits.lemma_quad32_double (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127);
let (va_sM, va_f7) = va_lemma_empty_total va_s7 va_b7 in
let va_f6 = va_lemma_merge_total va_b6 va_s6 va_fc7 va_s7 va_f7 va_sM in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_sM in
let va_f3 = va_lemma_merge_total va_b3 va_s3 va_fc4 va_s4 va_f4 va_sM in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc3 va_s3 va_f3 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_Gf128ModulusRev (dst:va_operand_vec_opr) (va_s0:va_state) (va_k:(va_state -> unit ->
Type0)) : Type0 =
(va_is_dst_vec_opr dst va_s0 /\ va_get_ok va_s0 /\ dst =!= 3 /\ (forall
(va_x_dst:va_value_vec_opr) (va_x_r10:nat64) (va_x_v3:quad32) . let va_sM = va_upd_vec 3
va_x_v3 (va_upd_reg 10 va_x_r10 (va_upd_operand_vec_opr dst va_x_dst va_s0)) in va_get_ok va_sM
/\ va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) /\ Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_lo (va_eval_vec_opr va_sM dst)) == zero ==> va_k va_sM (())))
val va_wpProof_Gf128ModulusRev : dst:va_operand_vec_opr -> va_s0:va_state -> va_k:(va_state -> unit
-> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Gf128ModulusRev dst va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Gf128ModulusRev dst) ([va_Mod_vec 3;
va_Mod_reg 10; va_mod_vec_opr dst]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_Gf128ModulusRev dst va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Gf128ModulusRev (va_code_Gf128ModulusRev dst) va_s0 dst in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 3 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM
(va_update_operand_vec_opr dst va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_reg 10; va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_Gf128ModulusRev (dst:va_operand_vec_opr) : (va_quickCode unit (va_code_Gf128ModulusRev
dst)) =
(va_QProc (va_code_Gf128ModulusRev dst) ([va_Mod_vec 3; va_Mod_reg 10; va_mod_vec_opr dst])
(va_wp_Gf128ModulusRev dst) (va_wpProof_Gf128ModulusRev dst))
//--
//-- ReduceMulRev128
[@ "opaque_to_smt" va_qattr]
let va_code_ReduceMulRev128 () =
(va_Block (va_CCons (va_code_ClmulRev128 ()) (va_CCons (va_code_Vmr (va_op_vec_opr_vec 6)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_CCons
(va_code_ClmulRev128 ()) (va_CCons (va_code_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2))
(va_CCons (va_code_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_CCons (va_code_ClmulRev64High ())
(va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5))
(va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6))
(va_CNil ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ReduceMulRev128 () =
(va_pbool_and (va_codegen_success_ClmulRev128 ()) (va_pbool_and (va_codegen_success_Vmr
(va_op_vec_opr_vec 6) (va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_Gf128ModulusRev
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_ClmulRev128 ()) (va_pbool_and
(va_codegen_success_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_pbool_and
(va_codegen_success_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_pbool_and
(va_codegen_success_ClmulRev64High ()) (va_pbool_and (va_codegen_success_AddPoly
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5)) (va_pbool_and
(va_codegen_success_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6))
(va_ttrue ())))))))))) | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.fsti.checked",
"Vale.PPC64LE.InsBasic.fsti.checked",
"Vale.PPC64LE.Decls.fsti.checked",
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Words.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.TypesNative.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.Types_helpers.fsti.checked",
"Vale.AES.PPC64LE.PolyOps.fsti.checked",
"Vale.AES.GHash_BE.fsti.checked",
"Vale.AES.GF128_s.fsti.checked",
"Vale.AES.GF128.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.PPC64LE.GF128_Mul.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | va_mods: Vale.PPC64LE.QuickCode.va_mods_t -> a: Vale.Math.Poly2_s.poly -> b: Vale.Math.Poly2_s.poly
-> Vale.PPC64LE.QuickCode.va_quickCode Prims.unit
(Vale.AES.PPC64LE.GF128_Mul.va_code_ReduceMulRev128 ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.QuickCode.va_mods_t",
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.PPC64LE.Decls.va_code",
"Vale.AES.PPC64LE.GF128_Mul.va_code_ClmulRev128",
"Vale.PPC64LE.InsVector.va_code_Vmr",
"Vale.PPC64LE.Decls.va_op_vec_opr_vec",
"Vale.AES.PPC64LE.GF128_Mul.va_code_Gf128ModulusRev",
"Vale.AES.PPC64LE.GF128_Mul.va_code_ClmulRev64High",
"Vale.AES.PPC64LE.GF128_Mul.va_code_AddPoly",
"Prims.Nil",
"Vale.PPC64LE.Machine_s.precode",
"Vale.PPC64LE.Decls.ins",
"Vale.PPC64LE.Decls.ocmp",
"Vale.PPC64LE.Decls.va_state",
"Vale.PPC64LE.QuickCodes.va_qPURE",
"Prims.pure_post",
"Prims.l_and",
"Prims.l_True",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.eq2",
"Prims.int",
"Vale.Math.Poly2_s.degree",
"Vale.AES.GF128_s.gf128_modulus_low_terms",
"Vale.Math.Poly2_s.monomial",
"Vale.AES.GF128_s.gf128_modulus",
"Vale.PPC64LE.QuickCodes.va_range1",
"Vale.AES.GF128.lemma_gf128_degree",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"Prims.op_GreaterThan",
"Prims.op_Multiply",
"Vale.Math.Poly2_s.add",
"Prims.op_LessThan",
"Prims.op_LessThanOrEqual",
"Vale.Math.Poly2_s.reverse",
"Vale.Math.Poly2_s.mod",
"Vale.Math.Poly2_s.mul",
"Prims.op_Subtraction",
"Vale.Math.Poly2_s.div",
"Vale.AES.GF128.lemma_gf128_reduce_rev",
"Vale.PPC64LE.QuickCodes.va_QBind",
"FStar.Pervasives.Native.tuple2",
"Vale.AES.PPC64LE.GF128_Mul.va_quick_ClmulRev128",
"Vale.Math.Poly2_s.shift",
"Prims.bool",
"Vale.Math.Poly2_s.poly_index",
"Vale.Math.Poly2.Lemmas.lemma_combine_define",
"Vale.PPC64LE.QuickCodes.va_QSeq",
"Vale.PPC64LE.InsVector.va_quick_Vmr",
"Vale.AES.PPC64LE.GF128_Mul.va_quick_Gf128ModulusRev",
"Vale.Math.Poly2.Bits_s.of_double32",
"Vale.Arch.Types.quad32_double_hi",
"Vale.Math.Poly2.Bits_s.to_quad32",
"Vale.AES.GF128.lemma_quad32_double_hi_rev",
"Vale.AES.PPC64LE.GF128_Mul.va_quick_ClmulRev64High",
"Vale.AES.PPC64LE.GF128_Mul.va_quick_AddPoly",
"Vale.PPC64LE.QuickCodes.va_QEmpty",
"Vale.PPC64LE.QuickCodes.quickCodes",
"Vale.PPC64LE.Machine_s.state",
"Vale.PPC64LE.QuickCode.va_quickCode",
"Vale.AES.PPC64LE.GF128_Mul.va_code_ReduceMulRev128"
] | [] | false | false | false | false | false | let va_qcode_ReduceMulRev128 (va_mods: va_mods_t) (a b: poly)
: (va_quickCode unit (va_code_ReduceMulRev128 ())) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 329 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_: unit) -> Vale.AES.GF128.lemma_gf128_degree ())
(let va_arg31:Vale.Math.Poly2_s.poly = b in
let va_arg30:Vale.Math.Poly2_s.poly = a in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 330 column 27 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_: unit) ->
Vale.AES.GF128.lemma_gf128_reduce_rev va_arg30
va_arg31
gf128_modulus_low_terms
128)
(let m:Vale.Math.Poly2_s.poly = Vale.Math.Poly2_s.monomial 128 in
let h:Vale.Math.Poly2_s.poly = gf128_modulus_low_terms in
let ab:Vale.Math.Poly2_s.poly = Vale.Math.Poly2_s.mul a b in
let rh:Vale.Math.Poly2_s.poly = Vale.Math.Poly2_s.reverse h 127 in
let rab:Vale.Math.Poly2_s.poly = Vale.Math.Poly2_s.reverse ab 255 in
let rd:Vale.Math.Poly2_s.poly = Vale.Math.Poly2_s.mod rab m in
let rdh:Vale.Math.Poly2_s.poly =
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.reverse rd 127
)
h)
255
in
let rdhL:Vale.Math.Poly2_s.poly = Vale.Math.Poly2_s.mod rdh m in
let rdhLh:Vale.Math.Poly2_s.poly =
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.reverse rdhL
127)
h)
127
in
va_QBind va_range1
"***** PRECONDITION NOT MET AT line 341 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev128 a b)
(fun (va_s: va_state) va_g ->
let (lo1: poly), (hi1: poly) = va_g in
let va_arg29:Vale.Math.Poly2_s.poly = lo1 in
let va_arg28:Vale.Math.Poly2_s.poly = hi1 in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 342 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_: unit) ->
Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg28 va_arg29 128)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 343 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vmr (va_op_vec_opr_vec 6) (va_op_vec_opr_vec 2))
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 345 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Gf128ModulusRev (va_op_vec_opr_vec 2))
(va_QBind va_range1
"***** PRECONDITION NOT MET AT line 346 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev128 (Vale.Math.Poly2_s.reverse rd 127) h)
(fun (va_s: va_state) va_g ->
let (lo2: poly), (hi2: poly) = va_g in
let va_arg27:Vale.Math.Poly2_s.poly = lo2 in
let va_arg26:Vale.Math.Poly2_s.poly = hi2 in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 347 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_: unit) ->
Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg26
va_arg27
128)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 348 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vmr (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 2))
(va_QBind va_range1
"***** PRECONDITION NOT MET AT line 350 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Gf128ModulusRev (va_op_vec_opr_vec 2))
(fun (va_s: va_state) _ ->
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 352 column 31 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_: unit) ->
Vale.AES.GF128.lemma_quad32_double_hi_rev
rdhL)
(va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 353 column 31 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_: unit) ->
Vale.AES.GF128.lemma_quad32_double_hi_rev
rh)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 354 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev64High (Vale.Math.Poly2_s.reverse
rdhL
127)
h)
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 356 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec
1)
(va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 5)
rdhLh
(Vale.Math.Poly2_s.div rdh m
))
(va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 357 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec
1)
(va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 6)
(Vale.Math.Poly2_s.add rdhLh
(Vale.Math.Poly2_s.div
rdh
m))
(Vale.Math.Poly2_s.div rab
m))
(va_QEmpty (()))))))))))))))
)))) | false |
Vale.AES.PPC64LE.GF128_Mul.fst | Vale.AES.PPC64LE.GF128_Mul.va_wpProof_ReduceMulRev128 | val va_wpProof_ReduceMulRev128 : a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ReduceMulRev128 a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ReduceMulRev128 ()) ([va_Mod_vec 6;
va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg
10]) va_s0 va_k ((va_sM, va_f0, va_g)))) | val va_wpProof_ReduceMulRev128 : a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ReduceMulRev128 a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ReduceMulRev128 ()) ([va_Mod_vec 6;
va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg
10]) va_s0 va_k ((va_sM, va_f0, va_g)))) | let va_wpProof_ReduceMulRev128 a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ReduceMulRev128 (va_code_ReduceMulRev128 ()) va_s0 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 6 va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))));
va_lemma_norm_mods ([va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g) | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Mul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 1067,
"start_col": 0,
"start_line": 1058
} | module Vale.AES.PPC64LE.GF128_Mul
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.TypesNative
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open Vale.AES.GF128
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.InsBasic
open Vale.PPC64LE.InsMem
open Vale.PPC64LE.InsVector
open Vale.PPC64LE.QuickCode
open Vale.PPC64LE.QuickCodes
open Vale.AES.PPC64LE.PolyOps
open Vale.AES.Types_helpers
open Vale.AES.GHash_BE
//-- ShiftLeft128_1
[@ "opaque_to_smt" va_qattr]
let va_code_ShiftLeft128_1 () =
(va_Block (va_CCons (va_code_Vspltisb (va_op_vec_opr_vec 2) 1) (va_CCons (va_code_Vsl
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2)) (va_CNil ()))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ShiftLeft128_1 () =
(va_pbool_and (va_codegen_success_Vspltisb (va_op_vec_opr_vec 2) 1) (va_pbool_and
(va_codegen_success_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2))
(va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ShiftLeft128_1 (va_mods:va_mods_t) (a:poly) : (va_quickCode unit
(va_code_ShiftLeft128_1 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 60 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisb (va_op_vec_opr_vec 2) 1) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 61 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> let (va_arg5:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 63 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_shift_left_1 va_arg5) (va_QEmpty (()))))))
[@"opaque_to_smt"]
let va_lemma_ShiftLeft128_1 va_b0 va_s0 a =
let (va_mods:va_mods_t) = [va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ShiftLeft128_1 va_mods a in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftLeft128_1 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 49 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 58 column 37 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.shift a 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_ShiftLeft128_1 a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftLeft128_1 (va_code_ShiftLeft128_1 ()) va_s0 a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_ok va_sM
va_s0))));
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- ShiftLeft2_128_1
val va_code_ShiftLeft2_128_1 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ShiftLeft2_128_1 () =
(va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0) 0) (va_CCons (va_code_LoadImm64
(va_op_reg_opr_reg 10) 31) (va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg
10)) (va_CCons (va_code_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_CCons (va_code_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0) (va_op_vec_opr_vec 3) 4)
(va_CCons (va_code_Vspltisb (va_op_vec_opr_vec 0) 1) (va_CCons (va_code_Vsl (va_op_vec_opr_vec
1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 0)) (va_CCons (va_code_Vsl (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_CCons (va_code_Vxor (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_CNil ())))))))))))
val va_codegen_success_ShiftLeft2_128_1 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ShiftLeft2_128_1 () =
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 0) 0) (va_pbool_and
(va_codegen_success_LoadImm64 (va_op_reg_opr_reg 10) 31) (va_pbool_and
(va_codegen_success_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_pbool_and
(va_codegen_success_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_pbool_and (va_codegen_success_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0)
(va_op_vec_opr_vec 3) 4) (va_pbool_and (va_codegen_success_Vspltisb (va_op_vec_opr_vec 0) 1)
(va_pbool_and (va_codegen_success_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 0)) (va_pbool_and (va_codegen_success_Vsl (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_pbool_and (va_codegen_success_Vxor
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_ttrue ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ShiftLeft2_128_1 (va_mods:va_mods_t) (lo:poly) (hi:poly) : (va_quickCode unit
(va_code_ShiftLeft2_128_1 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisw (va_op_vec_opr_vec 0) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 84 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_LoadImm64 (va_op_reg_opr_reg 10) 31) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 85 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 86 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 87 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0) (va_op_vec_opr_vec 3) 4) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 88 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisb (va_op_vec_opr_vec 0) 1) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 89 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 0)) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 90 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_QBind
va_range1
"***** PRECONDITION NOT MET AT line 91 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vxor (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (fun
(va_s:va_state) _ -> let (l:(Vale.Def.Words_s.four Vale.Def.Words_s.nat32)) =
Vale.Def.Words.Four_s.four_map #nat32 #Vale.Def.Words_s.nat32 (fun (i:nat32) ->
Vale.Arch.Types.ishl32 i 1) (va_get_vec 2 va_old_s) in let (r:(Vale.Def.Words_s.four
Vale.Def.Words_s.nat32)) = Vale.Def.Words.Four_s.four_map #nat32 #Vale.Def.Words_s.nat32 (fun
(i:nat32) -> Vale.Arch.Types.ishr32 i 31) (va_get_vec 2 va_old_s) in let
(va_arg22:Vale.Def.Types_s.quad32) = va_get_vec 3 va_s in let
(va_arg21:Vale.Def.Types_s.quad32) = Vale.Def.Words_s.Mkfour #Vale.Def.Types_s.nat32 0
(Vale.Def.Words_s.__proj__Mkfour__item__lo0 r) (Vale.Def.Words_s.__proj__Mkfour__item__lo1 r)
(Vale.Def.Words_s.__proj__Mkfour__item__hi2 r) in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 95 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Arch.TypesNative.lemma_quad32_xor_commutes va_arg21 va_arg22) (let
(va_arg20:Vale.Def.Types_s.quad32) = va_get_vec 3 va_s in let
(va_arg19:Vale.Def.Types_s.quad32) = Vale.Def.Words_s.Mkfour #Vale.Def.Types_s.nat32 0
(Vale.Def.Words_s.__proj__Mkfour__item__lo0 r) (Vale.Def.Words_s.__proj__Mkfour__item__lo1 r)
(Vale.Def.Words_s.__proj__Mkfour__item__hi2 r) in let (va_arg18:Vale.Def.Types_s.quad32) = l in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 96 column 32 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Arch.TypesNative.lemma_quad32_xor_associates va_arg18 va_arg19 va_arg20)
(let (va_arg17:Vale.Math.Poly2_s.poly) = hi in let (va_arg16:Vale.Math.Poly2_s.poly) = lo in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 98 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_shift_2_left_1 va_arg16 va_arg17) (va_QEmpty
(())))))))))))))))
val va_lemma_ShiftLeft2_128_1 : va_b0:va_code -> va_s0:va_state -> lo:poly -> hi:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ShiftLeft2_128_1 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree hi < 127 /\ Vale.Math.Poly2_s.degree lo <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 hi))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let n = Vale.Math.Poly2_s.monomial 128 in let a = Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul
hi n) lo in let b = Vale.Math.Poly2_s.shift a 1 in va_get_vec 1 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n) /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)) /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))
[@"opaque_to_smt"]
let va_lemma_ShiftLeft2_128_1 va_b0 va_s0 lo hi =
let (va_mods:va_mods_t) = [va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10;
va_Mod_ok] in
let va_qc = va_qcode_ShiftLeft2_128_1 va_mods lo hi in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftLeft2_128_1 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 66 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 77 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let n = Vale.Math.Poly2_s.monomial 128 in label va_range1
"***** POSTCONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let a = Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul hi n) lo in label va_range1
"***** POSTCONDITION NOT MET AT line 79 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let b = Vale.Math.Poly2_s.shift a 1 in label va_range1
"***** POSTCONDITION NOT MET AT line 80 column 35 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 81 column 35 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)))))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10;
va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_ShiftLeft2_128_1 (lo:poly) (hi:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0))
: Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree hi < 127 /\ Vale.Math.Poly2_s.degree lo <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 hi /\ (forall (va_x_r10:nat64) (va_x_v0:quad32)
(va_x_v1:quad32) (va_x_v2:quad32) (va_x_v3:quad32) . let va_sM = va_upd_vec 3 va_x_v3
(va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1 (va_upd_vec 0 va_x_v0 (va_upd_reg 10 va_x_r10
va_s0)))) in va_get_ok va_sM /\ (let n = Vale.Math.Poly2_s.monomial 128 in let a =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul hi n) lo in let b = Vale.Math.Poly2_s.shift a 1 in
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n) /\
va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)) ==> va_k
va_sM (())))
val va_wpProof_ShiftLeft2_128_1 : lo:poly -> hi:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ShiftLeft2_128_1 lo hi va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ShiftLeft2_128_1 ()) ([va_Mod_vec 3;
va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ShiftLeft2_128_1 lo hi va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftLeft2_128_1 (va_code_ShiftLeft2_128_1 ()) va_s0 lo hi in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM
(va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM va_s0)))))));
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10])
va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ShiftLeft2_128_1 (lo:poly) (hi:poly) : (va_quickCode unit (va_code_ShiftLeft2_128_1
())) =
(va_QProc (va_code_ShiftLeft2_128_1 ()) ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0;
va_Mod_reg 10]) (va_wp_ShiftLeft2_128_1 lo hi) (va_wpProof_ShiftLeft2_128_1 lo hi))
//--
//-- ClmulRev64High
val va_code_ClmulRev64High : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ClmulRev64High () =
(va_Block (va_CCons (va_code_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_ShiftLeft128_1 ()) (va_CNil ()))))
val va_codegen_success_ClmulRev64High : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ClmulRev64High () =
(va_pbool_and (va_codegen_success_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_ShiftLeft128_1 ()) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ClmulRev64High (va_mods:va_mods_t) (a:poly) (b:poly) : (va_quickCode unit
(va_code_ClmulRev64High ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(va_arg18:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 116 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg18) (let
(va_arg17:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 117 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg17) (let
(va_arg16:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 118 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg16 64) (let
(va_arg15:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 119 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg15 64) (let
(va_arg14:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 120 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg14 64) (let
(va_arg13:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 121 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg13 64) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 17 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2))
(va_QBind va_range1
"***** PRECONDITION NOT MET AT line 123 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ShiftLeft128_1 (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.reverse a 63)
(Vale.Math.Poly2_s.reverse b 63))) (fun (va_s:va_state) _ -> let
(va_arg12:Vale.Math.Poly2_s.poly) = b in let (va_arg11:Vale.Math.Poly2_s.poly) = a in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 125 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_reverse_shift_1 va_arg11 va_arg12 63)
(va_QEmpty (()))))))))))))
val va_lemma_ClmulRev64High : va_b0:va_code -> va_s0:va_state -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ClmulRev64High ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 63 /\ Vale.Math.Poly2_s.degree b <= 63 /\
Vale.Math.Poly2_s.reverse a 63 == Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_hi (va_get_vec 1 va_s0)) /\ Vale.Math.Poly2_s.reverse b 63 ==
Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_hi (va_get_vec 2 va_s0)) /\
l_or (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo (va_get_vec 1
va_s0)) == zero) (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo
(va_get_vec 2 va_s0)) == zero)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.Math.Poly2_s.mul a b) 127) /\ va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1
va_sM (va_update_ok va_sM va_s0)))))
[@"opaque_to_smt"]
let va_lemma_ClmulRev64High va_b0 va_s0 a b =
let (va_mods:va_mods_t) = [va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ClmulRev64High va_mods a b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ClmulRev64High ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 101 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 49 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.Math.Poly2_s.mul a b) 127))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_ClmulRev64High (a:poly) (b:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) :
Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree a <= 63 /\ Vale.Math.Poly2_s.degree b <= 63 /\
Vale.Math.Poly2_s.reverse a 63 == Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_hi (va_get_vec 1 va_s0)) /\ Vale.Math.Poly2_s.reverse b 63 ==
Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_hi (va_get_vec 2 va_s0)) /\
l_or (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo (va_get_vec 1
va_s0)) == zero) (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo
(va_get_vec 2 va_s0)) == zero) /\ (forall (va_x_v1:quad32) (va_x_v2:quad32) . let va_sM =
va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1 va_s0) in va_get_ok va_sM /\ va_get_vec 1 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul a b) 127)
==> va_k va_sM (())))
val va_wpProof_ClmulRev64High : a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ClmulRev64High a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ClmulRev64High ()) ([va_Mod_vec 2;
va_Mod_vec 1]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ClmulRev64High a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ClmulRev64High (va_code_ClmulRev64High ()) va_s0 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_ok va_sM
va_s0))));
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ClmulRev64High (a:poly) (b:poly) : (va_quickCode unit (va_code_ClmulRev64High ())) =
(va_QProc (va_code_ClmulRev64High ()) ([va_Mod_vec 2; va_Mod_vec 1]) (va_wp_ClmulRev64High a b)
(va_wpProof_ClmulRev64High a b))
//--
//-- High64ToLow
[@ "opaque_to_smt"]
let va_code_High64ToLow dst src =
(va_Block (va_CCons (va_code_Vsldoi dst (va_op_vec_opr_vec 0) src 8) (va_CNil ())))
[@ "opaque_to_smt"]
let va_codegen_success_High64ToLow dst src =
(va_pbool_and (va_codegen_success_Vsldoi dst (va_op_vec_opr_vec 0) src 8) (va_ttrue ()))
[@"opaque_to_smt"]
let va_lemma_High64ToLow va_b0 va_s0 dst src a =
va_reveal_opaque (`%va_code_High64ToLow) (va_code_High64ToLow dst src);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let (va_s2, va_fc2) = va_lemma_Vsldoi (va_hd va_b1) va_s0 dst (va_op_vec_opr_vec 0) src 8 in
let va_b2 = va_tl va_b1 in
Vale.Math.Poly2.Words.lemma_quad32_double_shift a;
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_High64ToLow dst src a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_High64ToLow (va_code_High64ToLow dst src) va_s0 dst src a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- Low64ToHigh
[@ "opaque_to_smt" va_qattr]
let va_code_Low64ToHigh dst src =
(va_Block (va_CCons (va_code_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (va_CNil ())))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Low64ToHigh dst src =
(va_pbool_and (va_codegen_success_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (va_ttrue ()))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Low64ToHigh (va_mods:va_mods_t) (dst:vec_opr) (src:vec_opr) (a:poly) : (va_quickCode
unit (va_code_Low64ToHigh dst src)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 156 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (fun (va_s:va_state) _ -> let
(va_arg4:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 157 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Words.lemma_quad32_double_shift va_arg4) (va_QEmpty (())))))
[@"opaque_to_smt"]
let va_lemma_Low64ToHigh va_b0 va_s0 dst src a =
let (va_mods:va_mods_t) = [va_Mod_ok; va_mod_vec_opr dst] in
let va_qc = va_qcode_Low64ToHigh va_mods dst src a in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Low64ToHigh dst src) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 144 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 154 column 66 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod a (Vale.Math.Poly2_s.monomial 64)) (Vale.Math.Poly2_s.monomial 64)))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_ok; va_mod_vec_opr dst]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_Low64ToHigh dst src a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Low64ToHigh (va_code_Low64ToHigh dst src) va_s0 dst src a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AddPoly
val va_code_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr -> src2:va_operand_vec_opr
-> Tot va_code
[@ "opaque_to_smt"]
let va_code_AddPoly dst src1 src2 =
(va_Block (va_CCons (va_code_Vxor dst src1 src2) (va_CNil ())))
val va_codegen_success_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr ->
src2:va_operand_vec_opr -> Tot va_pbool
[@ "opaque_to_smt"]
let va_codegen_success_AddPoly dst src1 src2 =
(va_pbool_and (va_codegen_success_Vxor dst src1 src2) (va_ttrue ()))
val va_lemma_AddPoly : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr ->
src1:va_operand_vec_opr -> src2:va_operand_vec_opr -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AddPoly dst src1 src2) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_is_src_vec_opr src1 va_s0 /\ va_is_src_vec_opr src2 va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\ va_eval_vec_opr va_s0
src1 == Vale.Math.Poly2.Bits_s.to_quad32 a /\ va_eval_vec_opr va_s0 src2 ==
Vale.Math.Poly2.Bits_s.to_quad32 b))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add a b) /\
va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0))))
[@"opaque_to_smt"]
let va_lemma_AddPoly va_b0 va_s0 dst src1 src2 a b =
va_reveal_opaque (`%va_code_AddPoly) (va_code_AddPoly dst src1 src2);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let (va_s2, va_fc2) = va_lemma_Vxor (va_hd va_b1) va_s0 dst src1 src2 in
let va_b2 = va_tl va_b1 in
Vale.Math.Poly2.Words.lemma_add128 a b;
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_AddPoly (dst:va_operand_vec_opr) (src1:va_operand_vec_opr) (src2:va_operand_vec_opr)
(a:poly) (b:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_is_dst_vec_opr dst va_s0 /\ va_is_src_vec_opr src1 va_s0 /\ va_is_src_vec_opr src2 va_s0 /\
va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\
va_eval_vec_opr va_s0 src1 == Vale.Math.Poly2.Bits_s.to_quad32 a /\ va_eval_vec_opr va_s0 src2
== Vale.Math.Poly2.Bits_s.to_quad32 b /\ (forall (va_x_dst:va_value_vec_opr) . let va_sM =
va_upd_operand_vec_opr dst va_x_dst va_s0 in va_get_ok va_sM /\ va_eval_vec_opr va_sM dst ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add a b) ==> va_k va_sM (())))
val va_wpProof_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr ->
src2:va_operand_vec_opr -> a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AddPoly dst src1 src2 a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AddPoly dst src1 src2)
([va_mod_vec_opr dst]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_AddPoly dst src1 src2 a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AddPoly (va_code_AddPoly dst src1 src2) va_s0 dst src1 src2 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_AddPoly (dst:va_operand_vec_opr) (src1:va_operand_vec_opr) (src2:va_operand_vec_opr)
(a:poly) (b:poly) : (va_quickCode unit (va_code_AddPoly dst src1 src2)) =
(va_QProc (va_code_AddPoly dst src1 src2) ([va_mod_vec_opr dst]) (va_wp_AddPoly dst src1 src2 a
b) (va_wpProof_AddPoly dst src1 src2 a b))
//--
//-- Clmul128
val va_code_Clmul128 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_Clmul128 () =
(va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0) 0) (va_CCons (va_code_VSwap
(va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (va_CCons (va_code_High64ToLow (va_op_vec_opr_vec
4) (va_op_vec_opr_vec 3)) (va_CCons (va_code_Low64ToHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 3)) (va_CCons (va_code_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec
4) (va_op_vec_opr_vec 2)) (va_CCons (va_code_VPolyMulHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_CCons (va_code_Low64ToHigh (va_op_vec_opr_vec
1) (va_op_vec_opr_vec 3)) (va_CCons (va_code_High64ToLow (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 3)) (va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 4)) (va_CCons (va_code_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 2)) (va_CNil ())))))))))))))
val va_codegen_success_Clmul128 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Clmul128 () =
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 0) 0) (va_pbool_and
(va_codegen_success_VSwap (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (va_pbool_and
(va_codegen_success_High64ToLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 3)) (va_pbool_and
(va_codegen_success_Low64ToHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 3)) (va_pbool_and
(va_codegen_success_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 2))
(va_pbool_and (va_codegen_success_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 4)
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_VPolyMulHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_Low64ToHigh
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_pbool_and (va_codegen_success_High64ToLow
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_pbool_and (va_codegen_success_AddPoly
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 4)) (va_pbool_and
(va_codegen_success_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2))
(va_ttrue ()))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Clmul128 (va_mods:va_mods_t) (ab:poly) (cd:poly) : (va_quickCode (poly & poly)
(va_code_Clmul128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(n:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.monomial 64 in let (a:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.div ab n in let (b:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ab n in
let (c:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div cd n in let (d:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.mod cd n in let (ac:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul a c in
let (ad:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul a d in let (bc:Vale.Math.Poly2_s.poly)
= Vale.Math.Poly2_s.mul b c in let (bd:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul b d in
let (ab_sw:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.swap ab 64 in let
(ab_hi:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ab n in let
(ab_lo:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.div ab n) n in let
(va_arg77:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 202 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg77) (let
(va_arg76:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 203 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg76) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 205 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisw (va_op_vec_opr_vec 0) 0) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 206 column 10 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VSwap (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (fun (va_s:va_state) _ -> let
(va_arg75:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 207 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg75) (let
(va_arg74:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 208 column 29 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Words.lemma_quad32_double_swap va_arg74) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 209 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double ab_sw) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 210 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_High64ToLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 3) ab_sw) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 211 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Low64ToHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 3) ab_sw) (fun (va_s:va_state) _
-> va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 212 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 4 va_s == Vale.Math.Poly2.Bits_s.to_quad32 ab_hi) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 213 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 5 va_s == Vale.Math.Poly2.Bits_s.to_quad32 ab_lo) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 215 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 217 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 ab_hi) (let
(va_arg73:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ab_hi n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 218 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_degree_negative va_arg73) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 219 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_hi 64) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 220 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 222 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 ab_lo) (let
(va_arg72:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ab n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 223 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_div_mod_exact va_arg72 n) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 224 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_lo 64) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 225 column 17 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> let (va_arg71:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 227 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg71) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 228 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_sw 64) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 229 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_sw 64) (let
(va_arg70:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 230 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg70 64) (let
(va_arg69:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 231 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg69 64) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 232 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s) == Vale.Math.Poly2_s.add ad bc) (va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 234 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_hi 64) (let
(va_arg68:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 235 column 18 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mod_mod va_arg68 n) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 236 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 4 va_s) == bd) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 238 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_lo 64) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 239 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 5 va_s) == ac) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 241 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Low64ToHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3) (Vale.Math.Poly2_s.add ad
bc)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 242 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mod_distribute ad bc n) (let
(va_arg67:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod bc n in let
(va_arg66:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ad n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 243 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_distribute_left va_arg66 va_arg67 n)
(va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 244 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_s == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n) (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod bc n) n))) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 246 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_High64ToLow (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3) (Vale.Math.Poly2_s.add ad
bc)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 247 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GHash_BE.lemma_div_distribute ad bc n) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 248 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_s == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.div ad n) (Vale.Math.Poly2_s.div bc n))) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 250 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 4)
(Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n)
(Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod bc n) n)) bd) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 251 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2) ac
(Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.div ad n) (Vale.Math.Poly2_s.div bc n))) (fun
(va_s:va_state) _ -> let (va_arg65:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div bc n in let
(va_arg64:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ad n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 253 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_commute va_arg64 va_arg65) (let
(va_arg63:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ad n in let
(va_arg62:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div bc n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 254 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_associate ac va_arg62 va_arg63) (let (hi:poly) =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.add ac (Vale.Math.Poly2_s.div bc n))
(Vale.Math.Poly2_s.div ad n) in let (va_arg61:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod bc n) n in let (va_arg60:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod ad n) n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 256 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_commute va_arg60 va_arg61) (let (lo:poly) =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod bc
n) n) (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n)) bd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 259 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_mul a b c d 64) (va_QEmpty ((lo,
hi))))))))))))))))))))))))))))))))))))))))))))))))
val va_lemma_Clmul128 : va_b0:va_code -> va_s0:va_state -> ab:poly -> cd:poly
-> Ghost (va_state & va_fuel & poly & poly)
(requires (va_require_total va_b0 (va_code_Clmul128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 ab /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 cd))
(ensures (fun (va_sM, va_fM, lo, hi) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok
va_sM /\ Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi < 127 /\
Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 hi /\ va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec
4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0
va_sM (va_update_ok va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_Clmul128 va_b0 va_s0 ab cd =
let (va_mods:va_mods_t) = [va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_ok] in
let va_qc = va_qcode_Clmul128 va_mods ab cd in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Clmul128 ()) va_qc va_s0 (fun va_s0
va_sM va_g -> let (lo, hi) = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 174 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 184 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree lo <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 185 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree hi < 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 186 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo) /\
label va_range1
"***** POSTCONDITION NOT MET AT line 187 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 188 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_ok]) va_sM va_s0;
let (lo, hi) = va_g in
(va_sM, va_fM, lo, hi)
[@ va_qattr]
let va_wp_Clmul128 (ab:poly) (cd:poly) (va_s0:va_state) (va_k:(va_state -> (poly & poly) -> Type0))
: Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 ab /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 cd /\ (forall (va_x_v0:quad32) (va_x_v1:quad32)
(va_x_v2:quad32) (va_x_v3:quad32) (va_x_v4:quad32) (va_x_v5:quad32) (lo:poly) (hi:poly) . let
va_sM = va_upd_vec 5 va_x_v5 (va_upd_vec 4 va_x_v4 (va_upd_vec 3 va_x_v3 (va_upd_vec 2 va_x_v2
(va_upd_vec 1 va_x_v1 (va_upd_vec 0 va_x_v0 va_s0))))) in va_get_ok va_sM /\
Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi < 127 /\
Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 hi ==> va_k va_sM ((lo, hi))))
val va_wpProof_Clmul128 : ab:poly -> cd:poly -> va_s0:va_state -> va_k:(va_state -> (poly & poly)
-> Type0)
-> Ghost (va_state & va_fuel & (poly & poly))
(requires (va_t_require va_s0 /\ va_wp_Clmul128 ab cd va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Clmul128 ()) ([va_Mod_vec 5;
va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0]) va_s0 va_k ((va_sM,
va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_Clmul128 ab cd va_s0 va_k =
let (va_sM, va_f0, lo, hi) = va_lemma_Clmul128 (va_code_Clmul128 ()) va_s0 ab cd in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM
(va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_ok va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0]) va_sM va_s0;
let va_g = (lo, hi) in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_Clmul128 (ab:poly) (cd:poly) : (va_quickCode (poly & poly) (va_code_Clmul128 ())) =
(va_QProc (va_code_Clmul128 ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0]) (va_wp_Clmul128 ab cd) (va_wpProof_Clmul128 ab cd))
//--
//-- ClmulRev128
val va_code_ClmulRev128 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ClmulRev128 () =
(va_Block (va_CCons (va_code_Clmul128 ()) (va_CCons (va_code_ShiftLeft2_128_1 ()) (va_CNil ()))))
val va_codegen_success_ClmulRev128 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ClmulRev128 () =
(va_pbool_and (va_codegen_success_Clmul128 ()) (va_pbool_and (va_codegen_success_ShiftLeft2_128_1
()) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ClmulRev128 (va_mods:va_mods_t) (ab:poly) (cd:poly) : (va_quickCode (poly & poly)
(va_code_ClmulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 279 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Clmul128 (Vale.Math.Poly2_s.reverse ab 127) (Vale.Math.Poly2_s.reverse cd 127)) (fun
(va_s:va_state) va_g -> let (lo, hi) = va_g in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 280 column 21 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ShiftLeft2_128_1 lo hi) (fun (va_s:va_state) _ -> let (m:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.shift (Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo) 1 in let
(va_arg13:Vale.Math.Poly2_s.poly) = lo in let (va_arg12:Vale.Math.Poly2_s.poly) = hi in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 283 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg12 va_arg13 128) (va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 284 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_split_define m 128) (let (lo:poly) =
Vale.Math.Poly2_s.mod m (Vale.Math.Poly2_s.monomial 128) in let (hi:poly) =
Vale.Math.Poly2_s.div m (Vale.Math.Poly2_s.monomial 128) in let
(va_arg11:Vale.Math.Poly2_s.poly) = cd in let (va_arg10:Vale.Math.Poly2_s.poly) = ab in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 287 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_reverse_shift_1 va_arg10 va_arg11 127)
(va_QEmpty ((lo, hi)))))))))
val va_lemma_ClmulRev128 : va_b0:va_code -> va_s0:va_state -> ab:poly -> cd:poly
-> Ghost (va_state & va_fuel & poly & poly)
(requires (va_require_total va_b0 (va_code_ClmulRev128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse ab 127) /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse cd 127)))
(ensures (fun (va_sM, va_fM, lo, hi) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok
va_sM /\ Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi <= 127 /\
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo /\ va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32
lo /\ va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi /\ va_state_eq va_sM
(va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM
(va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM
va_s0))))))))))
[@"opaque_to_smt"]
let va_lemma_ClmulRev128 va_b0 va_s0 ab cd =
let (va_mods:va_mods_t) = [va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_ClmulRev128 va_mods ab cd in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ClmulRev128 ()) va_qc va_s0 (fun va_s0
va_sM va_g -> let (lo, hi) = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 262 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 273 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree lo <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 274 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree hi <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 275 column 61 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 276 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 277 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok]) va_sM va_s0;
let (lo, hi) = va_g in
(va_sM, va_fM, lo, hi)
[@ va_qattr]
let va_wp_ClmulRev128 (ab:poly) (cd:poly) (va_s0:va_state) (va_k:(va_state -> (poly & poly) ->
Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse ab 127) /\
va_get_vec 2 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse cd 127) /\
(forall (va_x_r10:nat64) (va_x_v0:quad32) (va_x_v1:quad32) (va_x_v2:quad32) (va_x_v3:quad32)
(va_x_v4:quad32) (va_x_v5:quad32) (lo:poly) (hi:poly) . let va_sM = va_upd_vec 5 va_x_v5
(va_upd_vec 4 va_x_v4 (va_upd_vec 3 va_x_v3 (va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1
(va_upd_vec 0 va_x_v0 (va_upd_reg 10 va_x_r10 va_s0)))))) in va_get_ok va_sM /\
Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi <= 127 /\
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo /\ va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32
lo /\ va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi ==> va_k va_sM ((lo, hi))))
val va_wpProof_ClmulRev128 : ab:poly -> cd:poly -> va_s0:va_state -> va_k:(va_state -> (poly &
poly) -> Type0)
-> Ghost (va_state & va_fuel & (poly & poly))
(requires (va_t_require va_s0 /\ va_wp_ClmulRev128 ab cd va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ClmulRev128 ()) ([va_Mod_vec 5;
va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_s0
va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ClmulRev128 ab cd va_s0 va_k =
let (va_sM, va_f0, lo, hi) = va_lemma_ClmulRev128 (va_code_ClmulRev128 ()) va_s0 ab cd in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM
(va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM
(va_update_ok va_sM va_s0)))))))));
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10]) va_sM va_s0;
let va_g = (lo, hi) in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ClmulRev128 (ab:poly) (cd:poly) : (va_quickCode (poly & poly) (va_code_ClmulRev128
())) =
(va_QProc (va_code_ClmulRev128 ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) (va_wp_ClmulRev128 ab cd) (va_wpProof_ClmulRev128
ab cd))
//--
//-- Gf128ModulusRev
val va_code_Gf128ModulusRev : dst:va_operand_vec_opr -> Tot va_code
[@ "opaque_to_smt"]
let va_code_Gf128ModulusRev dst =
(va_Block (va_CCons (va_code_Vxor dst dst dst) (va_CCons (va_code_LoadImmShl64 (va_op_reg_opr_reg
10) (-7936)) (va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_CCons
(va_code_Vsldoi dst (va_op_vec_opr_vec 3) dst 12) (va_CNil ()))))))
val va_codegen_success_Gf128ModulusRev : dst:va_operand_vec_opr -> Tot va_pbool
[@ "opaque_to_smt"]
let va_codegen_success_Gf128ModulusRev dst =
(va_pbool_and (va_codegen_success_Vxor dst dst dst) (va_pbool_and
(va_codegen_success_LoadImmShl64 (va_op_reg_opr_reg 10) (-7936)) (va_pbool_and
(va_codegen_success_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_pbool_and
(va_codegen_success_Vsldoi dst (va_op_vec_opr_vec 3) dst 12) (va_ttrue ())))))
val va_lemma_Gf128ModulusRev : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128ModulusRev dst) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_get_ok va_s0 /\ dst =!= 3))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) /\ Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_lo (va_eval_vec_opr va_sM dst)) == zero /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM (va_update_operand_vec_opr
dst va_sM va_s0))))))
[@"opaque_to_smt"]
let va_lemma_Gf128ModulusRev va_b0 va_s0 dst =
va_reveal_opaque (`%va_code_Gf128ModulusRev) (va_code_Gf128ModulusRev dst);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
Vale.AES.GF128.lemma_gf128_constant_rev (va_eval_vec_opr va_s0 dst);
let (va_s3, va_fc3) = va_lemma_Vxor (va_hd va_b1) va_s0 dst dst dst in
let va_b3 = va_tl va_b1 in
let (va_s4, va_fc4) = va_lemma_LoadImmShl64 (va_hd va_b3) va_s3 (va_op_reg_opr_reg 10) (-7936) in
let va_b4 = va_tl va_b3 in
Vale.AES.Types_helpers.lemma_ishl_64 ((-7936) `op_Modulus` pow2_64) 16;
let (va_s6, va_fc6) = va_lemma_Mtvsrws (va_hd va_b4) va_s4 (va_op_vec_opr_vec 3)
(va_op_reg_opr_reg 10) in
let va_b6 = va_tl va_b4 in
let (va_s7, va_fc7) = va_lemma_Vsldoi (va_hd va_b6) va_s6 dst (va_op_vec_opr_vec 3) dst 12 in
let va_b7 = va_tl va_b6 in
Vale.Math.Poly2.Lemmas.lemma_split_define (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127)
64;
Vale.Math.Poly2.Lemmas.lemma_index_all ();
Vale.Math.Poly2.Lemmas.lemma_reverse_define_all ();
Vale.Math.Poly2.lemma_equal (Vale.Math.Poly2_s.mod (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) (Vale.Math.Poly2_s.monomial 64)) zero;
Vale.Math.Poly2.Bits.lemma_quad32_double (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127);
let (va_sM, va_f7) = va_lemma_empty_total va_s7 va_b7 in
let va_f6 = va_lemma_merge_total va_b6 va_s6 va_fc7 va_s7 va_f7 va_sM in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_sM in
let va_f3 = va_lemma_merge_total va_b3 va_s3 va_fc4 va_s4 va_f4 va_sM in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc3 va_s3 va_f3 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_Gf128ModulusRev (dst:va_operand_vec_opr) (va_s0:va_state) (va_k:(va_state -> unit ->
Type0)) : Type0 =
(va_is_dst_vec_opr dst va_s0 /\ va_get_ok va_s0 /\ dst =!= 3 /\ (forall
(va_x_dst:va_value_vec_opr) (va_x_r10:nat64) (va_x_v3:quad32) . let va_sM = va_upd_vec 3
va_x_v3 (va_upd_reg 10 va_x_r10 (va_upd_operand_vec_opr dst va_x_dst va_s0)) in va_get_ok va_sM
/\ va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) /\ Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_lo (va_eval_vec_opr va_sM dst)) == zero ==> va_k va_sM (())))
val va_wpProof_Gf128ModulusRev : dst:va_operand_vec_opr -> va_s0:va_state -> va_k:(va_state -> unit
-> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Gf128ModulusRev dst va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Gf128ModulusRev dst) ([va_Mod_vec 3;
va_Mod_reg 10; va_mod_vec_opr dst]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_Gf128ModulusRev dst va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Gf128ModulusRev (va_code_Gf128ModulusRev dst) va_s0 dst in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 3 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM
(va_update_operand_vec_opr dst va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_reg 10; va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_Gf128ModulusRev (dst:va_operand_vec_opr) : (va_quickCode unit (va_code_Gf128ModulusRev
dst)) =
(va_QProc (va_code_Gf128ModulusRev dst) ([va_Mod_vec 3; va_Mod_reg 10; va_mod_vec_opr dst])
(va_wp_Gf128ModulusRev dst) (va_wpProof_Gf128ModulusRev dst))
//--
//-- ReduceMulRev128
[@ "opaque_to_smt" va_qattr]
let va_code_ReduceMulRev128 () =
(va_Block (va_CCons (va_code_ClmulRev128 ()) (va_CCons (va_code_Vmr (va_op_vec_opr_vec 6)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_CCons
(va_code_ClmulRev128 ()) (va_CCons (va_code_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2))
(va_CCons (va_code_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_CCons (va_code_ClmulRev64High ())
(va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5))
(va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6))
(va_CNil ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ReduceMulRev128 () =
(va_pbool_and (va_codegen_success_ClmulRev128 ()) (va_pbool_and (va_codegen_success_Vmr
(va_op_vec_opr_vec 6) (va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_Gf128ModulusRev
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_ClmulRev128 ()) (va_pbool_and
(va_codegen_success_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_pbool_and
(va_codegen_success_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_pbool_and
(va_codegen_success_ClmulRev64High ()) (va_pbool_and (va_codegen_success_AddPoly
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5)) (va_pbool_and
(va_codegen_success_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6))
(va_ttrue ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ReduceMulRev128 (va_mods:va_mods_t) (a:poly) (b:poly) : (va_quickCode unit
(va_code_ReduceMulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 329 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_degree ()) (let (va_arg31:Vale.Math.Poly2_s.poly) =
b in let (va_arg30:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 330 column 27 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_reduce_rev va_arg30 va_arg31
gf128_modulus_low_terms 128) (let (m:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.monomial 128
in let (h:Vale.Math.Poly2_s.poly) = gf128_modulus_low_terms in let (ab:Vale.Math.Poly2_s.poly)
= Vale.Math.Poly2_s.mul a b in let (rh:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse h
127 in let (rab:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse ab 255 in let
(rd:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod rab m in let (rdh:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.reverse rd 127) h) 255 in
let (rdhL:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod rdh m in let
(rdhLh:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.reverse rdhL 127) h) 127 in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 341 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev128 a b) (fun (va_s:va_state) va_g -> let ((lo1:poly), (hi1:poly)) = va_g in
let (va_arg29:Vale.Math.Poly2_s.poly) = lo1 in let (va_arg28:Vale.Math.Poly2_s.poly) = hi1 in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 342 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg28 va_arg29 128) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 343 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vmr (va_op_vec_opr_vec 6) (va_op_vec_opr_vec 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 345 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 346 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev128 (Vale.Math.Poly2_s.reverse rd 127) h) (fun (va_s:va_state) va_g -> let
((lo2:poly), (hi2:poly)) = va_g in let (va_arg27:Vale.Math.Poly2_s.poly) = lo2 in let
(va_arg26:Vale.Math.Poly2_s.poly) = hi2 in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 347 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg26 va_arg27 128) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 348 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 350 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Gf128ModulusRev (va_op_vec_opr_vec 2)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 352 column 31 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_quad32_double_hi_rev rdhL) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 353 column 31 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_quad32_double_hi_rev rh) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 354 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev64High (Vale.Math.Poly2_s.reverse rdhL 127) h) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 356 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5) rdhLh
(Vale.Math.Poly2_s.div rdh m)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 357 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6)
(Vale.Math.Poly2_s.add rdhLh (Vale.Math.Poly2_s.div rdh m)) (Vale.Math.Poly2_s.div rab m))
(va_QEmpty (()))))))))))))))))))
[@"opaque_to_smt"]
let va_lemma_ReduceMulRev128 va_b0 va_s0 a b =
let (va_mods:va_mods_t) = [va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_ReduceMulRev128 va_mods a b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ReduceMulRev128 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 315 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 327 column 55 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.AES.GF128_s.gf128_mul a b) 127))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM) | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.fsti.checked",
"Vale.PPC64LE.InsBasic.fsti.checked",
"Vale.PPC64LE.Decls.fsti.checked",
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Words.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.TypesNative.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.Types_helpers.fsti.checked",
"Vale.AES.PPC64LE.PolyOps.fsti.checked",
"Vale.AES.GHash_BE.fsti.checked",
"Vale.AES.GF128_s.fsti.checked",
"Vale.AES.GF128.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.PPC64LE.GF128_Mul.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
a: Vale.Math.Poly2_s.poly ->
b: Vale.Math.Poly2_s.poly ->
va_s0: Vale.PPC64LE.Decls.va_state ->
va_k: (_: Vale.PPC64LE.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.Decls.va_state",
"Prims.unit",
"Vale.PPC64LE.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.PPC64LE.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod_vec",
"Vale.PPC64LE.QuickCode.va_Mod_reg",
"Prims.Nil",
"Prims._assert",
"Vale.PPC64LE.Decls.va_state_eq",
"Vale.PPC64LE.Decls.va_update_vec",
"Vale.PPC64LE.Decls.va_update_reg",
"Vale.PPC64LE.Decls.va_update_ok",
"Vale.PPC64LE.Decls.va_lemma_upd_update",
"FStar.Pervasives.Native.tuple3",
"FStar.Pervasives.Native.tuple2",
"Vale.PPC64LE.Machine_s.state",
"Vale.AES.PPC64LE.GF128_Mul.va_lemma_ReduceMulRev128",
"Vale.AES.PPC64LE.GF128_Mul.va_code_ReduceMulRev128"
] | [] | false | false | false | false | false | let va_wpProof_ReduceMulRev128 a b va_s0 va_k =
| let va_sM, va_f0 = va_lemma_ReduceMulRev128 (va_code_ReduceMulRev128 ()) va_s0 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_vec 6
va_sM
(va_update_vec 5
va_sM
(va_update_vec 4
va_sM
(va_update_vec 3
va_sM
(va_update_vec 2
va_sM
(va_update_vec 1
va_sM
(va_update_vec 0
va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))));
va_lemma_norm_mods ([
va_Mod_vec 6;
va_Mod_vec 5;
va_Mod_vec 4;
va_Mod_vec 3;
va_Mod_vec 2;
va_Mod_vec 1;
va_Mod_vec 0;
va_Mod_reg 10
])
va_sM
va_s0;
let va_g = () in
(va_sM, va_f0, va_g) | false |
FStar.BV.fst | FStar.BV.bv2int | val bv2int (#n: pos) (vec: bv_t n) : Tot (uint_t n) | val bv2int (#n: pos) (vec: bv_t n) : Tot (uint_t n) | let bv2int = U.from_vec | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 23,
"end_line": 28,
"start_col": 0,
"start_line": 28
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | vec: FStar.BV.bv_t n -> FStar.UInt.uint_t n | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt.from_vec"
] | [] | false | false | false | false | false | let bv2int =
| U.from_vec | false |
FStar.BV.fst | FStar.BV.int2bv_lemma_2 | val int2bv_lemma_2 (#n: pos) (a b: uint_t n)
: Lemma (requires (int2bv a = int2bv b)) (ensures a = b) | val int2bv_lemma_2 (#n: pos) (a b: uint_t n)
: Lemma (requires (int2bv a = int2bv b)) (ensures a = b) | let int2bv_lemma_2 = U.to_vec_lemma_2 | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 31,
"start_col": 0,
"start_line": 31
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n
-> FStar.Pervasives.Lemma (requires FStar.BV.int2bv a = FStar.BV.int2bv b) (ensures a = b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.UInt.to_vec_lemma_2"
] | [] | true | false | true | false | false | let int2bv_lemma_2 =
| U.to_vec_lemma_2 | false |
FStar.BV.fst | FStar.BV.int2bv | val int2bv (#n: pos) (num: uint_t n) : Tot (bv_t n) | val int2bv (#n: pos) (num: uint_t n) : Tot (bv_t n) | let int2bv = U.to_vec | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 27,
"start_col": 0,
"start_line": 27
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | num: FStar.UInt.uint_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt.to_vec"
] | [] | false | false | false | false | false | let int2bv =
| U.to_vec | false |
FStar.BV.fst | FStar.BV.bv_uext | val bv_uext (#n #m: pos) (a: bv_t n) : Tot (normalize (bv_t (m + n))) | val bv_uext (#n #m: pos) (a: bv_t n) : Tot (normalize (bv_t (m + n))) | let bv_uext #n #i a =
Seq.append (Seq.create i false) a | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 25,
"start_col": 0,
"start_line": 24
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> FStar.Pervasives.normalize (FStar.BV.bv_t (m + n)) | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.Seq.Base.append",
"Prims.bool",
"FStar.Seq.Base.create",
"FStar.Pervasives.normalize",
"Prims.op_Addition"
] | [] | false | false | false | false | false | let bv_uext #n #i a =
| Seq.append (Seq.create i false) a | false |
FStar.BV.fst | FStar.BV.int2bv_lemma_1 | val int2bv_lemma_1 (#n: pos) (a b: uint_t n)
: Lemma (requires a = b) (ensures (int2bv #n a = int2bv #n b)) | val int2bv_lemma_1 (#n: pos) (a b: uint_t n)
: Lemma (requires a = b) (ensures (int2bv #n a = int2bv #n b)) | let int2bv_lemma_1 = U.to_vec_lemma_1 | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 30,
"start_col": 0,
"start_line": 30
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n
-> FStar.Pervasives.Lemma (requires a = b) (ensures FStar.BV.int2bv a = FStar.BV.int2bv b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.UInt.to_vec_lemma_1"
] | [] | true | false | true | false | false | let int2bv_lemma_1 =
| U.to_vec_lemma_1 | false |
FStar.BV.fst | FStar.BV.bv_t | val bv_t (n: nat) : eqtype | val bv_t (n: nat) : eqtype | let bv_t (n : nat) = B.bv_t n | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 22,
"start_col": 0,
"start_line": 22
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | n: Prims.nat -> Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.BitVector.bv_t",
"Prims.eqtype"
] | [] | false | false | false | true | false | let bv_t (n: nat) =
| B.bv_t n | false |
FStar.BV.fst | FStar.BV.list2bv | val list2bv (#n: pos) (l: list bool {List.length l = n}) : Tot (bv_t n) | val list2bv (#n: pos) (l: list bool {List.length l = n}) : Tot (bv_t n) | let list2bv #n l = S.seq_of_list l | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 46,
"start_col": 0,
"start_line": 46
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | l: Prims.list Prims.bool {FStar.List.Tot.Base.length l = n} -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"Prims.list",
"Prims.bool",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.l_or",
"Prims.op_GreaterThanOrEqual",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length",
"FStar.Seq.Base.seq_of_list",
"FStar.BV.bv_t"
] | [] | false | false | false | false | false | let list2bv #n l =
| S.seq_of_list l | false |
FStar.BV.fst | FStar.BV.int2bv_nat | val int2bv_nat (#n: pos) (num: nat) : Tot (bv_t n) | val int2bv_nat (#n: pos) (num: nat) : Tot (bv_t n) | let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 75,
"end_line": 37,
"start_col": 0,
"start_line": 37
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | num: Prims.nat -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"Prims.nat",
"FStar.UInt.to_vec",
"Prims.op_Modulus",
"Prims.pow2",
"FStar.BV.bv_t"
] | [] | false | false | false | false | false | let int2bv_nat (#n: pos) (num: nat) : Tot (bv_t n) =
| U.to_vec (num % pow2 n) | false |
FStar.BV.fst | FStar.BV.inverse_vec_lemma | val inverse_vec_lemma (#n: pos) (vec: bv_t n)
: Lemma (requires True) (ensures vec = (int2bv (bv2int vec))) [SMTPat (int2bv (bv2int vec))] | val inverse_vec_lemma (#n: pos) (vec: bv_t n)
: Lemma (requires True) (ensures vec = (int2bv (bv2int vec))) [SMTPat (int2bv (bv2int vec))] | let inverse_vec_lemma = U.inverse_vec_lemma | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"end_line": 32,
"start_col": 0,
"start_line": 32
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1 | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | vec: FStar.BV.bv_t n
-> FStar.Pervasives.Lemma (ensures vec = FStar.BV.int2bv (FStar.BV.bv2int vec))
[SMTPat (FStar.BV.int2bv (FStar.BV.bv2int vec))] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.UInt.inverse_vec_lemma"
] | [] | true | false | true | false | false | let inverse_vec_lemma =
| U.inverse_vec_lemma | false |
FStar.BV.fst | FStar.BV.int2bv_logand | val int2bv_logand:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvand #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (logand #n x y) == z) | val int2bv_logand:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvand #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (logand #n x y) == z) | let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 53,
"start_col": 0,
"start_line": 52
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | pf: Prims.squash (FStar.BV.bvand (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.logand x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvand",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_logand #n #x #y #z pf =
| inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y)) | false |
Vale.AES.PPC64LE.GF128_Mul.fst | Vale.AES.PPC64LE.GF128_Mul.va_lemma_ReduceMulRev128 | val va_lemma_ReduceMulRev128 : va_b0:va_code -> va_s0:va_state -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ReduceMulRev128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\ va_get_vec 1 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse a 127) /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse b 127)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.AES.GF128_s.gf128_mul a b) 127) /\ va_state_eq va_sM (va_update_vec 6 va_sM
(va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM
(va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM
va_s0))))))))))) | val va_lemma_ReduceMulRev128 : va_b0:va_code -> va_s0:va_state -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ReduceMulRev128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\ va_get_vec 1 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse a 127) /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse b 127)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.AES.GF128_s.gf128_mul a b) 127) /\ va_state_eq va_sM (va_update_vec 6 va_sM
(va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM
(va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM
va_s0))))))))))) | let va_lemma_ReduceMulRev128 va_b0 va_s0 a b =
let (va_mods:va_mods_t) = [va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_ReduceMulRev128 va_mods a b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ReduceMulRev128 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 315 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 327 column 55 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.AES.GF128_s.gf128_mul a b) 127))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM) | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Mul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 1054,
"start_col": 0,
"start_line": 1040
} | module Vale.AES.PPC64LE.GF128_Mul
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.TypesNative
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open Vale.AES.GF128
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.InsBasic
open Vale.PPC64LE.InsMem
open Vale.PPC64LE.InsVector
open Vale.PPC64LE.QuickCode
open Vale.PPC64LE.QuickCodes
open Vale.AES.PPC64LE.PolyOps
open Vale.AES.Types_helpers
open Vale.AES.GHash_BE
//-- ShiftLeft128_1
[@ "opaque_to_smt" va_qattr]
let va_code_ShiftLeft128_1 () =
(va_Block (va_CCons (va_code_Vspltisb (va_op_vec_opr_vec 2) 1) (va_CCons (va_code_Vsl
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2)) (va_CNil ()))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ShiftLeft128_1 () =
(va_pbool_and (va_codegen_success_Vspltisb (va_op_vec_opr_vec 2) 1) (va_pbool_and
(va_codegen_success_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2))
(va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ShiftLeft128_1 (va_mods:va_mods_t) (a:poly) : (va_quickCode unit
(va_code_ShiftLeft128_1 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 60 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisb (va_op_vec_opr_vec 2) 1) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 61 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> let (va_arg5:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 63 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_shift_left_1 va_arg5) (va_QEmpty (()))))))
[@"opaque_to_smt"]
let va_lemma_ShiftLeft128_1 va_b0 va_s0 a =
let (va_mods:va_mods_t) = [va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ShiftLeft128_1 va_mods a in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftLeft128_1 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 49 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 58 column 37 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.shift a 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_ShiftLeft128_1 a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftLeft128_1 (va_code_ShiftLeft128_1 ()) va_s0 a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_ok va_sM
va_s0))));
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- ShiftLeft2_128_1
val va_code_ShiftLeft2_128_1 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ShiftLeft2_128_1 () =
(va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0) 0) (va_CCons (va_code_LoadImm64
(va_op_reg_opr_reg 10) 31) (va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg
10)) (va_CCons (va_code_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_CCons (va_code_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0) (va_op_vec_opr_vec 3) 4)
(va_CCons (va_code_Vspltisb (va_op_vec_opr_vec 0) 1) (va_CCons (va_code_Vsl (va_op_vec_opr_vec
1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 0)) (va_CCons (va_code_Vsl (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_CCons (va_code_Vxor (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_CNil ())))))))))))
val va_codegen_success_ShiftLeft2_128_1 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ShiftLeft2_128_1 () =
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 0) 0) (va_pbool_and
(va_codegen_success_LoadImm64 (va_op_reg_opr_reg 10) 31) (va_pbool_and
(va_codegen_success_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_pbool_and
(va_codegen_success_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_pbool_and (va_codegen_success_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0)
(va_op_vec_opr_vec 3) 4) (va_pbool_and (va_codegen_success_Vspltisb (va_op_vec_opr_vec 0) 1)
(va_pbool_and (va_codegen_success_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 0)) (va_pbool_and (va_codegen_success_Vsl (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_pbool_and (va_codegen_success_Vxor
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_ttrue ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ShiftLeft2_128_1 (va_mods:va_mods_t) (lo:poly) (hi:poly) : (va_quickCode unit
(va_code_ShiftLeft2_128_1 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisw (va_op_vec_opr_vec 0) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 84 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_LoadImm64 (va_op_reg_opr_reg 10) 31) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 85 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 86 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 87 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0) (va_op_vec_opr_vec 3) 4) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 88 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisb (va_op_vec_opr_vec 0) 1) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 89 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 0)) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 90 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_QBind
va_range1
"***** PRECONDITION NOT MET AT line 91 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vxor (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (fun
(va_s:va_state) _ -> let (l:(Vale.Def.Words_s.four Vale.Def.Words_s.nat32)) =
Vale.Def.Words.Four_s.four_map #nat32 #Vale.Def.Words_s.nat32 (fun (i:nat32) ->
Vale.Arch.Types.ishl32 i 1) (va_get_vec 2 va_old_s) in let (r:(Vale.Def.Words_s.four
Vale.Def.Words_s.nat32)) = Vale.Def.Words.Four_s.four_map #nat32 #Vale.Def.Words_s.nat32 (fun
(i:nat32) -> Vale.Arch.Types.ishr32 i 31) (va_get_vec 2 va_old_s) in let
(va_arg22:Vale.Def.Types_s.quad32) = va_get_vec 3 va_s in let
(va_arg21:Vale.Def.Types_s.quad32) = Vale.Def.Words_s.Mkfour #Vale.Def.Types_s.nat32 0
(Vale.Def.Words_s.__proj__Mkfour__item__lo0 r) (Vale.Def.Words_s.__proj__Mkfour__item__lo1 r)
(Vale.Def.Words_s.__proj__Mkfour__item__hi2 r) in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 95 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Arch.TypesNative.lemma_quad32_xor_commutes va_arg21 va_arg22) (let
(va_arg20:Vale.Def.Types_s.quad32) = va_get_vec 3 va_s in let
(va_arg19:Vale.Def.Types_s.quad32) = Vale.Def.Words_s.Mkfour #Vale.Def.Types_s.nat32 0
(Vale.Def.Words_s.__proj__Mkfour__item__lo0 r) (Vale.Def.Words_s.__proj__Mkfour__item__lo1 r)
(Vale.Def.Words_s.__proj__Mkfour__item__hi2 r) in let (va_arg18:Vale.Def.Types_s.quad32) = l in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 96 column 32 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Arch.TypesNative.lemma_quad32_xor_associates va_arg18 va_arg19 va_arg20)
(let (va_arg17:Vale.Math.Poly2_s.poly) = hi in let (va_arg16:Vale.Math.Poly2_s.poly) = lo in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 98 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_shift_2_left_1 va_arg16 va_arg17) (va_QEmpty
(())))))))))))))))
val va_lemma_ShiftLeft2_128_1 : va_b0:va_code -> va_s0:va_state -> lo:poly -> hi:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ShiftLeft2_128_1 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree hi < 127 /\ Vale.Math.Poly2_s.degree lo <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 hi))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let n = Vale.Math.Poly2_s.monomial 128 in let a = Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul
hi n) lo in let b = Vale.Math.Poly2_s.shift a 1 in va_get_vec 1 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n) /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)) /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))
[@"opaque_to_smt"]
let va_lemma_ShiftLeft2_128_1 va_b0 va_s0 lo hi =
let (va_mods:va_mods_t) = [va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10;
va_Mod_ok] in
let va_qc = va_qcode_ShiftLeft2_128_1 va_mods lo hi in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftLeft2_128_1 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 66 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 77 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let n = Vale.Math.Poly2_s.monomial 128 in label va_range1
"***** POSTCONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let a = Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul hi n) lo in label va_range1
"***** POSTCONDITION NOT MET AT line 79 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let b = Vale.Math.Poly2_s.shift a 1 in label va_range1
"***** POSTCONDITION NOT MET AT line 80 column 35 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 81 column 35 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)))))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10;
va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_ShiftLeft2_128_1 (lo:poly) (hi:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0))
: Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree hi < 127 /\ Vale.Math.Poly2_s.degree lo <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 hi /\ (forall (va_x_r10:nat64) (va_x_v0:quad32)
(va_x_v1:quad32) (va_x_v2:quad32) (va_x_v3:quad32) . let va_sM = va_upd_vec 3 va_x_v3
(va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1 (va_upd_vec 0 va_x_v0 (va_upd_reg 10 va_x_r10
va_s0)))) in va_get_ok va_sM /\ (let n = Vale.Math.Poly2_s.monomial 128 in let a =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul hi n) lo in let b = Vale.Math.Poly2_s.shift a 1 in
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n) /\
va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)) ==> va_k
va_sM (())))
val va_wpProof_ShiftLeft2_128_1 : lo:poly -> hi:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ShiftLeft2_128_1 lo hi va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ShiftLeft2_128_1 ()) ([va_Mod_vec 3;
va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ShiftLeft2_128_1 lo hi va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftLeft2_128_1 (va_code_ShiftLeft2_128_1 ()) va_s0 lo hi in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM
(va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM va_s0)))))));
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10])
va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ShiftLeft2_128_1 (lo:poly) (hi:poly) : (va_quickCode unit (va_code_ShiftLeft2_128_1
())) =
(va_QProc (va_code_ShiftLeft2_128_1 ()) ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0;
va_Mod_reg 10]) (va_wp_ShiftLeft2_128_1 lo hi) (va_wpProof_ShiftLeft2_128_1 lo hi))
//--
//-- ClmulRev64High
val va_code_ClmulRev64High : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ClmulRev64High () =
(va_Block (va_CCons (va_code_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_ShiftLeft128_1 ()) (va_CNil ()))))
val va_codegen_success_ClmulRev64High : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ClmulRev64High () =
(va_pbool_and (va_codegen_success_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_ShiftLeft128_1 ()) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ClmulRev64High (va_mods:va_mods_t) (a:poly) (b:poly) : (va_quickCode unit
(va_code_ClmulRev64High ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(va_arg18:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 116 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg18) (let
(va_arg17:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 117 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg17) (let
(va_arg16:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 118 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg16 64) (let
(va_arg15:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 119 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg15 64) (let
(va_arg14:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 120 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg14 64) (let
(va_arg13:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 121 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg13 64) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 17 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2))
(va_QBind va_range1
"***** PRECONDITION NOT MET AT line 123 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ShiftLeft128_1 (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.reverse a 63)
(Vale.Math.Poly2_s.reverse b 63))) (fun (va_s:va_state) _ -> let
(va_arg12:Vale.Math.Poly2_s.poly) = b in let (va_arg11:Vale.Math.Poly2_s.poly) = a in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 125 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_reverse_shift_1 va_arg11 va_arg12 63)
(va_QEmpty (()))))))))))))
val va_lemma_ClmulRev64High : va_b0:va_code -> va_s0:va_state -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ClmulRev64High ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 63 /\ Vale.Math.Poly2_s.degree b <= 63 /\
Vale.Math.Poly2_s.reverse a 63 == Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_hi (va_get_vec 1 va_s0)) /\ Vale.Math.Poly2_s.reverse b 63 ==
Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_hi (va_get_vec 2 va_s0)) /\
l_or (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo (va_get_vec 1
va_s0)) == zero) (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo
(va_get_vec 2 va_s0)) == zero)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.Math.Poly2_s.mul a b) 127) /\ va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1
va_sM (va_update_ok va_sM va_s0)))))
[@"opaque_to_smt"]
let va_lemma_ClmulRev64High va_b0 va_s0 a b =
let (va_mods:va_mods_t) = [va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ClmulRev64High va_mods a b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ClmulRev64High ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 101 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 49 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.Math.Poly2_s.mul a b) 127))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_ClmulRev64High (a:poly) (b:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) :
Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree a <= 63 /\ Vale.Math.Poly2_s.degree b <= 63 /\
Vale.Math.Poly2_s.reverse a 63 == Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_hi (va_get_vec 1 va_s0)) /\ Vale.Math.Poly2_s.reverse b 63 ==
Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_hi (va_get_vec 2 va_s0)) /\
l_or (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo (va_get_vec 1
va_s0)) == zero) (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo
(va_get_vec 2 va_s0)) == zero) /\ (forall (va_x_v1:quad32) (va_x_v2:quad32) . let va_sM =
va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1 va_s0) in va_get_ok va_sM /\ va_get_vec 1 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul a b) 127)
==> va_k va_sM (())))
val va_wpProof_ClmulRev64High : a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ClmulRev64High a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ClmulRev64High ()) ([va_Mod_vec 2;
va_Mod_vec 1]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ClmulRev64High a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ClmulRev64High (va_code_ClmulRev64High ()) va_s0 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_ok va_sM
va_s0))));
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ClmulRev64High (a:poly) (b:poly) : (va_quickCode unit (va_code_ClmulRev64High ())) =
(va_QProc (va_code_ClmulRev64High ()) ([va_Mod_vec 2; va_Mod_vec 1]) (va_wp_ClmulRev64High a b)
(va_wpProof_ClmulRev64High a b))
//--
//-- High64ToLow
[@ "opaque_to_smt"]
let va_code_High64ToLow dst src =
(va_Block (va_CCons (va_code_Vsldoi dst (va_op_vec_opr_vec 0) src 8) (va_CNil ())))
[@ "opaque_to_smt"]
let va_codegen_success_High64ToLow dst src =
(va_pbool_and (va_codegen_success_Vsldoi dst (va_op_vec_opr_vec 0) src 8) (va_ttrue ()))
[@"opaque_to_smt"]
let va_lemma_High64ToLow va_b0 va_s0 dst src a =
va_reveal_opaque (`%va_code_High64ToLow) (va_code_High64ToLow dst src);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let (va_s2, va_fc2) = va_lemma_Vsldoi (va_hd va_b1) va_s0 dst (va_op_vec_opr_vec 0) src 8 in
let va_b2 = va_tl va_b1 in
Vale.Math.Poly2.Words.lemma_quad32_double_shift a;
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_High64ToLow dst src a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_High64ToLow (va_code_High64ToLow dst src) va_s0 dst src a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- Low64ToHigh
[@ "opaque_to_smt" va_qattr]
let va_code_Low64ToHigh dst src =
(va_Block (va_CCons (va_code_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (va_CNil ())))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Low64ToHigh dst src =
(va_pbool_and (va_codegen_success_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (va_ttrue ()))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Low64ToHigh (va_mods:va_mods_t) (dst:vec_opr) (src:vec_opr) (a:poly) : (va_quickCode
unit (va_code_Low64ToHigh dst src)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 156 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (fun (va_s:va_state) _ -> let
(va_arg4:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 157 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Words.lemma_quad32_double_shift va_arg4) (va_QEmpty (())))))
[@"opaque_to_smt"]
let va_lemma_Low64ToHigh va_b0 va_s0 dst src a =
let (va_mods:va_mods_t) = [va_Mod_ok; va_mod_vec_opr dst] in
let va_qc = va_qcode_Low64ToHigh va_mods dst src a in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Low64ToHigh dst src) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 144 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 154 column 66 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod a (Vale.Math.Poly2_s.monomial 64)) (Vale.Math.Poly2_s.monomial 64)))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_ok; va_mod_vec_opr dst]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_Low64ToHigh dst src a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Low64ToHigh (va_code_Low64ToHigh dst src) va_s0 dst src a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AddPoly
val va_code_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr -> src2:va_operand_vec_opr
-> Tot va_code
[@ "opaque_to_smt"]
let va_code_AddPoly dst src1 src2 =
(va_Block (va_CCons (va_code_Vxor dst src1 src2) (va_CNil ())))
val va_codegen_success_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr ->
src2:va_operand_vec_opr -> Tot va_pbool
[@ "opaque_to_smt"]
let va_codegen_success_AddPoly dst src1 src2 =
(va_pbool_and (va_codegen_success_Vxor dst src1 src2) (va_ttrue ()))
val va_lemma_AddPoly : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr ->
src1:va_operand_vec_opr -> src2:va_operand_vec_opr -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AddPoly dst src1 src2) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_is_src_vec_opr src1 va_s0 /\ va_is_src_vec_opr src2 va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\ va_eval_vec_opr va_s0
src1 == Vale.Math.Poly2.Bits_s.to_quad32 a /\ va_eval_vec_opr va_s0 src2 ==
Vale.Math.Poly2.Bits_s.to_quad32 b))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add a b) /\
va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0))))
[@"opaque_to_smt"]
let va_lemma_AddPoly va_b0 va_s0 dst src1 src2 a b =
va_reveal_opaque (`%va_code_AddPoly) (va_code_AddPoly dst src1 src2);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let (va_s2, va_fc2) = va_lemma_Vxor (va_hd va_b1) va_s0 dst src1 src2 in
let va_b2 = va_tl va_b1 in
Vale.Math.Poly2.Words.lemma_add128 a b;
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_AddPoly (dst:va_operand_vec_opr) (src1:va_operand_vec_opr) (src2:va_operand_vec_opr)
(a:poly) (b:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_is_dst_vec_opr dst va_s0 /\ va_is_src_vec_opr src1 va_s0 /\ va_is_src_vec_opr src2 va_s0 /\
va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\
va_eval_vec_opr va_s0 src1 == Vale.Math.Poly2.Bits_s.to_quad32 a /\ va_eval_vec_opr va_s0 src2
== Vale.Math.Poly2.Bits_s.to_quad32 b /\ (forall (va_x_dst:va_value_vec_opr) . let va_sM =
va_upd_operand_vec_opr dst va_x_dst va_s0 in va_get_ok va_sM /\ va_eval_vec_opr va_sM dst ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add a b) ==> va_k va_sM (())))
val va_wpProof_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr ->
src2:va_operand_vec_opr -> a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AddPoly dst src1 src2 a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AddPoly dst src1 src2)
([va_mod_vec_opr dst]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_AddPoly dst src1 src2 a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AddPoly (va_code_AddPoly dst src1 src2) va_s0 dst src1 src2 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_AddPoly (dst:va_operand_vec_opr) (src1:va_operand_vec_opr) (src2:va_operand_vec_opr)
(a:poly) (b:poly) : (va_quickCode unit (va_code_AddPoly dst src1 src2)) =
(va_QProc (va_code_AddPoly dst src1 src2) ([va_mod_vec_opr dst]) (va_wp_AddPoly dst src1 src2 a
b) (va_wpProof_AddPoly dst src1 src2 a b))
//--
//-- Clmul128
val va_code_Clmul128 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_Clmul128 () =
(va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0) 0) (va_CCons (va_code_VSwap
(va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (va_CCons (va_code_High64ToLow (va_op_vec_opr_vec
4) (va_op_vec_opr_vec 3)) (va_CCons (va_code_Low64ToHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 3)) (va_CCons (va_code_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec
4) (va_op_vec_opr_vec 2)) (va_CCons (va_code_VPolyMulHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_CCons (va_code_Low64ToHigh (va_op_vec_opr_vec
1) (va_op_vec_opr_vec 3)) (va_CCons (va_code_High64ToLow (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 3)) (va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 4)) (va_CCons (va_code_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 2)) (va_CNil ())))))))))))))
val va_codegen_success_Clmul128 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Clmul128 () =
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 0) 0) (va_pbool_and
(va_codegen_success_VSwap (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (va_pbool_and
(va_codegen_success_High64ToLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 3)) (va_pbool_and
(va_codegen_success_Low64ToHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 3)) (va_pbool_and
(va_codegen_success_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 2))
(va_pbool_and (va_codegen_success_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 4)
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_VPolyMulHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_Low64ToHigh
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_pbool_and (va_codegen_success_High64ToLow
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_pbool_and (va_codegen_success_AddPoly
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 4)) (va_pbool_and
(va_codegen_success_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2))
(va_ttrue ()))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Clmul128 (va_mods:va_mods_t) (ab:poly) (cd:poly) : (va_quickCode (poly & poly)
(va_code_Clmul128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(n:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.monomial 64 in let (a:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.div ab n in let (b:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ab n in
let (c:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div cd n in let (d:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.mod cd n in let (ac:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul a c in
let (ad:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul a d in let (bc:Vale.Math.Poly2_s.poly)
= Vale.Math.Poly2_s.mul b c in let (bd:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul b d in
let (ab_sw:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.swap ab 64 in let
(ab_hi:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ab n in let
(ab_lo:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.div ab n) n in let
(va_arg77:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 202 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg77) (let
(va_arg76:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 203 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg76) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 205 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisw (va_op_vec_opr_vec 0) 0) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 206 column 10 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VSwap (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (fun (va_s:va_state) _ -> let
(va_arg75:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 207 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg75) (let
(va_arg74:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 208 column 29 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Words.lemma_quad32_double_swap va_arg74) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 209 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double ab_sw) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 210 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_High64ToLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 3) ab_sw) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 211 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Low64ToHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 3) ab_sw) (fun (va_s:va_state) _
-> va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 212 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 4 va_s == Vale.Math.Poly2.Bits_s.to_quad32 ab_hi) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 213 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 5 va_s == Vale.Math.Poly2.Bits_s.to_quad32 ab_lo) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 215 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 217 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 ab_hi) (let
(va_arg73:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ab_hi n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 218 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_degree_negative va_arg73) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 219 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_hi 64) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 220 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 222 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 ab_lo) (let
(va_arg72:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ab n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 223 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_div_mod_exact va_arg72 n) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 224 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_lo 64) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 225 column 17 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> let (va_arg71:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 227 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg71) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 228 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_sw 64) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 229 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_sw 64) (let
(va_arg70:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 230 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg70 64) (let
(va_arg69:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 231 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg69 64) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 232 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s) == Vale.Math.Poly2_s.add ad bc) (va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 234 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_hi 64) (let
(va_arg68:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 235 column 18 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mod_mod va_arg68 n) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 236 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 4 va_s) == bd) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 238 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_lo 64) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 239 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 5 va_s) == ac) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 241 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Low64ToHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3) (Vale.Math.Poly2_s.add ad
bc)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 242 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mod_distribute ad bc n) (let
(va_arg67:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod bc n in let
(va_arg66:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ad n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 243 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_distribute_left va_arg66 va_arg67 n)
(va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 244 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_s == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n) (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod bc n) n))) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 246 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_High64ToLow (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3) (Vale.Math.Poly2_s.add ad
bc)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 247 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GHash_BE.lemma_div_distribute ad bc n) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 248 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_s == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.div ad n) (Vale.Math.Poly2_s.div bc n))) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 250 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 4)
(Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n)
(Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod bc n) n)) bd) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 251 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2) ac
(Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.div ad n) (Vale.Math.Poly2_s.div bc n))) (fun
(va_s:va_state) _ -> let (va_arg65:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div bc n in let
(va_arg64:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ad n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 253 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_commute va_arg64 va_arg65) (let
(va_arg63:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ad n in let
(va_arg62:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div bc n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 254 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_associate ac va_arg62 va_arg63) (let (hi:poly) =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.add ac (Vale.Math.Poly2_s.div bc n))
(Vale.Math.Poly2_s.div ad n) in let (va_arg61:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod bc n) n in let (va_arg60:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod ad n) n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 256 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_commute va_arg60 va_arg61) (let (lo:poly) =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod bc
n) n) (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n)) bd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 259 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_mul a b c d 64) (va_QEmpty ((lo,
hi))))))))))))))))))))))))))))))))))))))))))))))))
val va_lemma_Clmul128 : va_b0:va_code -> va_s0:va_state -> ab:poly -> cd:poly
-> Ghost (va_state & va_fuel & poly & poly)
(requires (va_require_total va_b0 (va_code_Clmul128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 ab /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 cd))
(ensures (fun (va_sM, va_fM, lo, hi) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok
va_sM /\ Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi < 127 /\
Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 hi /\ va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec
4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0
va_sM (va_update_ok va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_Clmul128 va_b0 va_s0 ab cd =
let (va_mods:va_mods_t) = [va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_ok] in
let va_qc = va_qcode_Clmul128 va_mods ab cd in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Clmul128 ()) va_qc va_s0 (fun va_s0
va_sM va_g -> let (lo, hi) = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 174 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 184 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree lo <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 185 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree hi < 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 186 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo) /\
label va_range1
"***** POSTCONDITION NOT MET AT line 187 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 188 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_ok]) va_sM va_s0;
let (lo, hi) = va_g in
(va_sM, va_fM, lo, hi)
[@ va_qattr]
let va_wp_Clmul128 (ab:poly) (cd:poly) (va_s0:va_state) (va_k:(va_state -> (poly & poly) -> Type0))
: Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 ab /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 cd /\ (forall (va_x_v0:quad32) (va_x_v1:quad32)
(va_x_v2:quad32) (va_x_v3:quad32) (va_x_v4:quad32) (va_x_v5:quad32) (lo:poly) (hi:poly) . let
va_sM = va_upd_vec 5 va_x_v5 (va_upd_vec 4 va_x_v4 (va_upd_vec 3 va_x_v3 (va_upd_vec 2 va_x_v2
(va_upd_vec 1 va_x_v1 (va_upd_vec 0 va_x_v0 va_s0))))) in va_get_ok va_sM /\
Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi < 127 /\
Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 hi ==> va_k va_sM ((lo, hi))))
val va_wpProof_Clmul128 : ab:poly -> cd:poly -> va_s0:va_state -> va_k:(va_state -> (poly & poly)
-> Type0)
-> Ghost (va_state & va_fuel & (poly & poly))
(requires (va_t_require va_s0 /\ va_wp_Clmul128 ab cd va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Clmul128 ()) ([va_Mod_vec 5;
va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0]) va_s0 va_k ((va_sM,
va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_Clmul128 ab cd va_s0 va_k =
let (va_sM, va_f0, lo, hi) = va_lemma_Clmul128 (va_code_Clmul128 ()) va_s0 ab cd in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM
(va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_ok va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0]) va_sM va_s0;
let va_g = (lo, hi) in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_Clmul128 (ab:poly) (cd:poly) : (va_quickCode (poly & poly) (va_code_Clmul128 ())) =
(va_QProc (va_code_Clmul128 ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0]) (va_wp_Clmul128 ab cd) (va_wpProof_Clmul128 ab cd))
//--
//-- ClmulRev128
val va_code_ClmulRev128 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ClmulRev128 () =
(va_Block (va_CCons (va_code_Clmul128 ()) (va_CCons (va_code_ShiftLeft2_128_1 ()) (va_CNil ()))))
val va_codegen_success_ClmulRev128 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ClmulRev128 () =
(va_pbool_and (va_codegen_success_Clmul128 ()) (va_pbool_and (va_codegen_success_ShiftLeft2_128_1
()) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ClmulRev128 (va_mods:va_mods_t) (ab:poly) (cd:poly) : (va_quickCode (poly & poly)
(va_code_ClmulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 279 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Clmul128 (Vale.Math.Poly2_s.reverse ab 127) (Vale.Math.Poly2_s.reverse cd 127)) (fun
(va_s:va_state) va_g -> let (lo, hi) = va_g in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 280 column 21 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ShiftLeft2_128_1 lo hi) (fun (va_s:va_state) _ -> let (m:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.shift (Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo) 1 in let
(va_arg13:Vale.Math.Poly2_s.poly) = lo in let (va_arg12:Vale.Math.Poly2_s.poly) = hi in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 283 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg12 va_arg13 128) (va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 284 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_split_define m 128) (let (lo:poly) =
Vale.Math.Poly2_s.mod m (Vale.Math.Poly2_s.monomial 128) in let (hi:poly) =
Vale.Math.Poly2_s.div m (Vale.Math.Poly2_s.monomial 128) in let
(va_arg11:Vale.Math.Poly2_s.poly) = cd in let (va_arg10:Vale.Math.Poly2_s.poly) = ab in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 287 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_reverse_shift_1 va_arg10 va_arg11 127)
(va_QEmpty ((lo, hi)))))))))
val va_lemma_ClmulRev128 : va_b0:va_code -> va_s0:va_state -> ab:poly -> cd:poly
-> Ghost (va_state & va_fuel & poly & poly)
(requires (va_require_total va_b0 (va_code_ClmulRev128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse ab 127) /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse cd 127)))
(ensures (fun (va_sM, va_fM, lo, hi) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok
va_sM /\ Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi <= 127 /\
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo /\ va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32
lo /\ va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi /\ va_state_eq va_sM
(va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM
(va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM
va_s0))))))))))
[@"opaque_to_smt"]
let va_lemma_ClmulRev128 va_b0 va_s0 ab cd =
let (va_mods:va_mods_t) = [va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_ClmulRev128 va_mods ab cd in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ClmulRev128 ()) va_qc va_s0 (fun va_s0
va_sM va_g -> let (lo, hi) = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 262 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 273 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree lo <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 274 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree hi <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 275 column 61 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 276 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 277 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok]) va_sM va_s0;
let (lo, hi) = va_g in
(va_sM, va_fM, lo, hi)
[@ va_qattr]
let va_wp_ClmulRev128 (ab:poly) (cd:poly) (va_s0:va_state) (va_k:(va_state -> (poly & poly) ->
Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse ab 127) /\
va_get_vec 2 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse cd 127) /\
(forall (va_x_r10:nat64) (va_x_v0:quad32) (va_x_v1:quad32) (va_x_v2:quad32) (va_x_v3:quad32)
(va_x_v4:quad32) (va_x_v5:quad32) (lo:poly) (hi:poly) . let va_sM = va_upd_vec 5 va_x_v5
(va_upd_vec 4 va_x_v4 (va_upd_vec 3 va_x_v3 (va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1
(va_upd_vec 0 va_x_v0 (va_upd_reg 10 va_x_r10 va_s0)))))) in va_get_ok va_sM /\
Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi <= 127 /\
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo /\ va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32
lo /\ va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi ==> va_k va_sM ((lo, hi))))
val va_wpProof_ClmulRev128 : ab:poly -> cd:poly -> va_s0:va_state -> va_k:(va_state -> (poly &
poly) -> Type0)
-> Ghost (va_state & va_fuel & (poly & poly))
(requires (va_t_require va_s0 /\ va_wp_ClmulRev128 ab cd va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ClmulRev128 ()) ([va_Mod_vec 5;
va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_s0
va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ClmulRev128 ab cd va_s0 va_k =
let (va_sM, va_f0, lo, hi) = va_lemma_ClmulRev128 (va_code_ClmulRev128 ()) va_s0 ab cd in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM
(va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM
(va_update_ok va_sM va_s0)))))))));
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10]) va_sM va_s0;
let va_g = (lo, hi) in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ClmulRev128 (ab:poly) (cd:poly) : (va_quickCode (poly & poly) (va_code_ClmulRev128
())) =
(va_QProc (va_code_ClmulRev128 ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) (va_wp_ClmulRev128 ab cd) (va_wpProof_ClmulRev128
ab cd))
//--
//-- Gf128ModulusRev
val va_code_Gf128ModulusRev : dst:va_operand_vec_opr -> Tot va_code
[@ "opaque_to_smt"]
let va_code_Gf128ModulusRev dst =
(va_Block (va_CCons (va_code_Vxor dst dst dst) (va_CCons (va_code_LoadImmShl64 (va_op_reg_opr_reg
10) (-7936)) (va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_CCons
(va_code_Vsldoi dst (va_op_vec_opr_vec 3) dst 12) (va_CNil ()))))))
val va_codegen_success_Gf128ModulusRev : dst:va_operand_vec_opr -> Tot va_pbool
[@ "opaque_to_smt"]
let va_codegen_success_Gf128ModulusRev dst =
(va_pbool_and (va_codegen_success_Vxor dst dst dst) (va_pbool_and
(va_codegen_success_LoadImmShl64 (va_op_reg_opr_reg 10) (-7936)) (va_pbool_and
(va_codegen_success_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_pbool_and
(va_codegen_success_Vsldoi dst (va_op_vec_opr_vec 3) dst 12) (va_ttrue ())))))
val va_lemma_Gf128ModulusRev : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128ModulusRev dst) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_get_ok va_s0 /\ dst =!= 3))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) /\ Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_lo (va_eval_vec_opr va_sM dst)) == zero /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM (va_update_operand_vec_opr
dst va_sM va_s0))))))
[@"opaque_to_smt"]
let va_lemma_Gf128ModulusRev va_b0 va_s0 dst =
va_reveal_opaque (`%va_code_Gf128ModulusRev) (va_code_Gf128ModulusRev dst);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
Vale.AES.GF128.lemma_gf128_constant_rev (va_eval_vec_opr va_s0 dst);
let (va_s3, va_fc3) = va_lemma_Vxor (va_hd va_b1) va_s0 dst dst dst in
let va_b3 = va_tl va_b1 in
let (va_s4, va_fc4) = va_lemma_LoadImmShl64 (va_hd va_b3) va_s3 (va_op_reg_opr_reg 10) (-7936) in
let va_b4 = va_tl va_b3 in
Vale.AES.Types_helpers.lemma_ishl_64 ((-7936) `op_Modulus` pow2_64) 16;
let (va_s6, va_fc6) = va_lemma_Mtvsrws (va_hd va_b4) va_s4 (va_op_vec_opr_vec 3)
(va_op_reg_opr_reg 10) in
let va_b6 = va_tl va_b4 in
let (va_s7, va_fc7) = va_lemma_Vsldoi (va_hd va_b6) va_s6 dst (va_op_vec_opr_vec 3) dst 12 in
let va_b7 = va_tl va_b6 in
Vale.Math.Poly2.Lemmas.lemma_split_define (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127)
64;
Vale.Math.Poly2.Lemmas.lemma_index_all ();
Vale.Math.Poly2.Lemmas.lemma_reverse_define_all ();
Vale.Math.Poly2.lemma_equal (Vale.Math.Poly2_s.mod (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) (Vale.Math.Poly2_s.monomial 64)) zero;
Vale.Math.Poly2.Bits.lemma_quad32_double (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127);
let (va_sM, va_f7) = va_lemma_empty_total va_s7 va_b7 in
let va_f6 = va_lemma_merge_total va_b6 va_s6 va_fc7 va_s7 va_f7 va_sM in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_sM in
let va_f3 = va_lemma_merge_total va_b3 va_s3 va_fc4 va_s4 va_f4 va_sM in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc3 va_s3 va_f3 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_Gf128ModulusRev (dst:va_operand_vec_opr) (va_s0:va_state) (va_k:(va_state -> unit ->
Type0)) : Type0 =
(va_is_dst_vec_opr dst va_s0 /\ va_get_ok va_s0 /\ dst =!= 3 /\ (forall
(va_x_dst:va_value_vec_opr) (va_x_r10:nat64) (va_x_v3:quad32) . let va_sM = va_upd_vec 3
va_x_v3 (va_upd_reg 10 va_x_r10 (va_upd_operand_vec_opr dst va_x_dst va_s0)) in va_get_ok va_sM
/\ va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) /\ Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_lo (va_eval_vec_opr va_sM dst)) == zero ==> va_k va_sM (())))
val va_wpProof_Gf128ModulusRev : dst:va_operand_vec_opr -> va_s0:va_state -> va_k:(va_state -> unit
-> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Gf128ModulusRev dst va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Gf128ModulusRev dst) ([va_Mod_vec 3;
va_Mod_reg 10; va_mod_vec_opr dst]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_Gf128ModulusRev dst va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Gf128ModulusRev (va_code_Gf128ModulusRev dst) va_s0 dst in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 3 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM
(va_update_operand_vec_opr dst va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_reg 10; va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_Gf128ModulusRev (dst:va_operand_vec_opr) : (va_quickCode unit (va_code_Gf128ModulusRev
dst)) =
(va_QProc (va_code_Gf128ModulusRev dst) ([va_Mod_vec 3; va_Mod_reg 10; va_mod_vec_opr dst])
(va_wp_Gf128ModulusRev dst) (va_wpProof_Gf128ModulusRev dst))
//--
//-- ReduceMulRev128
[@ "opaque_to_smt" va_qattr]
let va_code_ReduceMulRev128 () =
(va_Block (va_CCons (va_code_ClmulRev128 ()) (va_CCons (va_code_Vmr (va_op_vec_opr_vec 6)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_CCons
(va_code_ClmulRev128 ()) (va_CCons (va_code_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2))
(va_CCons (va_code_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_CCons (va_code_ClmulRev64High ())
(va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5))
(va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6))
(va_CNil ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ReduceMulRev128 () =
(va_pbool_and (va_codegen_success_ClmulRev128 ()) (va_pbool_and (va_codegen_success_Vmr
(va_op_vec_opr_vec 6) (va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_Gf128ModulusRev
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_ClmulRev128 ()) (va_pbool_and
(va_codegen_success_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_pbool_and
(va_codegen_success_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_pbool_and
(va_codegen_success_ClmulRev64High ()) (va_pbool_and (va_codegen_success_AddPoly
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5)) (va_pbool_and
(va_codegen_success_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6))
(va_ttrue ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ReduceMulRev128 (va_mods:va_mods_t) (a:poly) (b:poly) : (va_quickCode unit
(va_code_ReduceMulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 329 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_degree ()) (let (va_arg31:Vale.Math.Poly2_s.poly) =
b in let (va_arg30:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 330 column 27 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_reduce_rev va_arg30 va_arg31
gf128_modulus_low_terms 128) (let (m:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.monomial 128
in let (h:Vale.Math.Poly2_s.poly) = gf128_modulus_low_terms in let (ab:Vale.Math.Poly2_s.poly)
= Vale.Math.Poly2_s.mul a b in let (rh:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse h
127 in let (rab:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse ab 255 in let
(rd:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod rab m in let (rdh:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.reverse rd 127) h) 255 in
let (rdhL:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod rdh m in let
(rdhLh:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.reverse rdhL 127) h) 127 in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 341 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev128 a b) (fun (va_s:va_state) va_g -> let ((lo1:poly), (hi1:poly)) = va_g in
let (va_arg29:Vale.Math.Poly2_s.poly) = lo1 in let (va_arg28:Vale.Math.Poly2_s.poly) = hi1 in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 342 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg28 va_arg29 128) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 343 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vmr (va_op_vec_opr_vec 6) (va_op_vec_opr_vec 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 345 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 346 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev128 (Vale.Math.Poly2_s.reverse rd 127) h) (fun (va_s:va_state) va_g -> let
((lo2:poly), (hi2:poly)) = va_g in let (va_arg27:Vale.Math.Poly2_s.poly) = lo2 in let
(va_arg26:Vale.Math.Poly2_s.poly) = hi2 in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 347 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg26 va_arg27 128) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 348 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 350 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Gf128ModulusRev (va_op_vec_opr_vec 2)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 352 column 31 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_quad32_double_hi_rev rdhL) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 353 column 31 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_quad32_double_hi_rev rh) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 354 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev64High (Vale.Math.Poly2_s.reverse rdhL 127) h) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 356 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5) rdhLh
(Vale.Math.Poly2_s.div rdh m)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 357 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6)
(Vale.Math.Poly2_s.add rdhLh (Vale.Math.Poly2_s.div rdh m)) (Vale.Math.Poly2_s.div rab m))
(va_QEmpty (())))))))))))))))))) | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.fsti.checked",
"Vale.PPC64LE.InsBasic.fsti.checked",
"Vale.PPC64LE.Decls.fsti.checked",
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Words.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.TypesNative.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.Types_helpers.fsti.checked",
"Vale.AES.PPC64LE.PolyOps.fsti.checked",
"Vale.AES.GHash_BE.fsti.checked",
"Vale.AES.GF128_s.fsti.checked",
"Vale.AES.GF128.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.PPC64LE.GF128_Mul.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
va_b0: Vale.PPC64LE.Decls.va_code ->
va_s0: Vale.PPC64LE.Decls.va_state ->
a: Vale.Math.Poly2_s.poly ->
b: Vale.Math.Poly2_s.poly
-> Prims.Ghost (Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.PPC64LE.Decls.va_code",
"Vale.PPC64LE.Decls.va_state",
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.PPC64LE.Decls.va_fuel",
"Vale.PPC64LE.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod_vec",
"Vale.PPC64LE.QuickCode.va_Mod_reg",
"Vale.PPC64LE.QuickCode.va_Mod_ok",
"Prims.Nil",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.list",
"Vale.PPC64LE.QuickCode.__proj__QProc__item__mods",
"Vale.AES.PPC64LE.GF128_Mul.va_code_ReduceMulRev128",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.tuple3",
"Vale.PPC64LE.Machine_s.state",
"Vale.PPC64LE.QuickCodes.va_wp_sound_code_norm",
"Prims.l_and",
"Vale.PPC64LE.QuickCodes.label",
"Vale.PPC64LE.QuickCodes.va_range1",
"Prims.b2t",
"Vale.PPC64LE.Decls.va_get_ok",
"Vale.Def.Types_s.quad32",
"Vale.PPC64LE.Decls.va_get_vec",
"Vale.Math.Poly2.Bits_s.to_quad32",
"Vale.Math.Poly2_s.reverse",
"Vale.AES.GF128_s.gf128_mul",
"Vale.PPC64LE.QuickCode.quickCode",
"Vale.AES.PPC64LE.GF128_Mul.va_qcode_ReduceMulRev128"
] | [] | false | false | false | false | false | let va_lemma_ReduceMulRev128 va_b0 va_s0 a b =
| let va_mods:va_mods_t =
[
va_Mod_vec 6;
va_Mod_vec 5;
va_Mod_vec 4;
va_Mod_vec 3;
va_Mod_vec 2;
va_Mod_vec 1;
va_Mod_vec 0;
va_Mod_reg 10;
va_Mod_ok
]
in
let va_qc = va_qcode_ReduceMulRev128 va_mods a b in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_ReduceMulRev128 ())
va_qc
va_s0
(fun va_s0 va_sM va_g ->
let () = va_g in
label va_range1
"***** POSTCONDITION NOT MET AT line 315 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\
label va_range1
"***** POSTCONDITION NOT MET AT line 327 column 55 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse (Vale.AES.GF128_s.gf128_mul a
b)
127)))
in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([
va_Mod_vec 6;
va_Mod_vec 5;
va_Mod_vec 4;
va_Mod_vec 3;
va_Mod_vec 2;
va_Mod_vec 1;
va_Mod_vec 0;
va_Mod_reg 10;
va_Mod_ok
])
va_sM
va_s0;
(va_sM, va_fM) | false |
FStar.BV.fst | FStar.BV.int2bv_nat_lemma | val int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma (ensures (int2bv_nat #n num == int2bv #n num)) | val int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma (ensures (int2bv_nat #n num == int2bv #n num)) | let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 44,
"start_col": 0,
"start_line": 39
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | num: FStar.UInt.uint_t n
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv_nat num == FStar.BV.int2bv num) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"Prims._assert",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Prims.pow2",
"Prims.unit",
"FStar.Math.Lemmas.modulo_lemma",
"Prims.op_LessThan",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bv_t",
"FStar.BV.int2bv_nat",
"FStar.BV.int2bv",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma (ensures (int2bv_nat #n num == int2bv #n num)) =
| assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num) | false |
FStar.BV.fst | FStar.BV.list2bv_bij | val list2bv_bij (#n: pos) (a: list bool {List.length a = n})
: Lemma (requires (True)) (ensures (bv2list (list2bv #n a) = a)) | val list2bv_bij (#n: pos) (a: list bool {List.length a = n})
: Lemma (requires (True)) (ensures (bv2list (list2bv #n a) = a)) | let list2bv_bij #n a = S.lemma_list_seq_bij a | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 48,
"start_col": 0,
"start_line": 48
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: Prims.list Prims.bool {FStar.List.Tot.Base.length a = n}
-> FStar.Pervasives.Lemma (ensures FStar.BV.bv2list (FStar.BV.list2bv a) = a) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"Prims.list",
"Prims.bool",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.l_or",
"Prims.op_GreaterThanOrEqual",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length",
"FStar.Seq.Properties.lemma_list_seq_bij",
"Prims.unit"
] | [] | true | false | true | false | false | let list2bv_bij #n a =
| S.lemma_list_seq_bij a | false |
FStar.BV.fst | FStar.BV.bvand | val bvand (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvand (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvand = B.logand_vec | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 51,
"start_col": 0,
"start_line": 51
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"FStar.BitVector.logand_vec"
] | [] | false | false | false | false | false | let bvand =
| B.logand_vec | false |
FStar.BV.fst | FStar.BV.inverse_num_lemma | val inverse_num_lemma (#n: pos) (num: uint_t n)
: Lemma (requires True)
(ensures num = bv2int #n (int2bv #n num))
[SMTPat (bv2int #n (int2bv #n num))] | val inverse_num_lemma (#n: pos) (num: uint_t n)
: Lemma (requires True)
(ensures num = bv2int #n (int2bv #n num))
[SMTPat (bv2int #n (int2bv #n num))] | let inverse_num_lemma = U.inverse_num_lemma | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"end_line": 33,
"start_col": 0,
"start_line": 33
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2 | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | num: FStar.UInt.uint_t n
-> FStar.Pervasives.Lemma (ensures num = FStar.BV.bv2int (FStar.BV.int2bv num))
[SMTPat (FStar.BV.bv2int (FStar.BV.int2bv num))] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.UInt.inverse_num_lemma"
] | [] | true | false | true | false | false | let inverse_num_lemma =
| U.inverse_num_lemma | false |
Vale.AES.PPC64LE.GF128_Mul.fst | Vale.AES.PPC64LE.GF128_Mul.va_wpProof_Gf128MulRev128 | val va_wpProof_Gf128MulRev128 : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Gf128MulRev128 va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Gf128MulRev128 ()) ([va_Mod_vec 6;
va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg
10]) va_s0 va_k ((va_sM, va_f0, va_g)))) | val va_wpProof_Gf128MulRev128 : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Gf128MulRev128 va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Gf128MulRev128 ()) ([va_Mod_vec 6;
va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg
10]) va_s0 va_k ((va_sM, va_f0, va_g)))) | let va_wpProof_Gf128MulRev128 va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Gf128MulRev128 (va_code_Gf128MulRev128 ()) va_s0 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 6 va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))));
va_lemma_norm_mods ([va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g) | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Mul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 1122,
"start_col": 0,
"start_line": 1113
} | module Vale.AES.PPC64LE.GF128_Mul
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.TypesNative
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open Vale.AES.GF128
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.InsBasic
open Vale.PPC64LE.InsMem
open Vale.PPC64LE.InsVector
open Vale.PPC64LE.QuickCode
open Vale.PPC64LE.QuickCodes
open Vale.AES.PPC64LE.PolyOps
open Vale.AES.Types_helpers
open Vale.AES.GHash_BE
//-- ShiftLeft128_1
[@ "opaque_to_smt" va_qattr]
let va_code_ShiftLeft128_1 () =
(va_Block (va_CCons (va_code_Vspltisb (va_op_vec_opr_vec 2) 1) (va_CCons (va_code_Vsl
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2)) (va_CNil ()))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ShiftLeft128_1 () =
(va_pbool_and (va_codegen_success_Vspltisb (va_op_vec_opr_vec 2) 1) (va_pbool_and
(va_codegen_success_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2))
(va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ShiftLeft128_1 (va_mods:va_mods_t) (a:poly) : (va_quickCode unit
(va_code_ShiftLeft128_1 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 60 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisb (va_op_vec_opr_vec 2) 1) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 61 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> let (va_arg5:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 63 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_shift_left_1 va_arg5) (va_QEmpty (()))))))
[@"opaque_to_smt"]
let va_lemma_ShiftLeft128_1 va_b0 va_s0 a =
let (va_mods:va_mods_t) = [va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ShiftLeft128_1 va_mods a in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftLeft128_1 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 49 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 58 column 37 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.shift a 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_ShiftLeft128_1 a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftLeft128_1 (va_code_ShiftLeft128_1 ()) va_s0 a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_ok va_sM
va_s0))));
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- ShiftLeft2_128_1
val va_code_ShiftLeft2_128_1 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ShiftLeft2_128_1 () =
(va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0) 0) (va_CCons (va_code_LoadImm64
(va_op_reg_opr_reg 10) 31) (va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg
10)) (va_CCons (va_code_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_CCons (va_code_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0) (va_op_vec_opr_vec 3) 4)
(va_CCons (va_code_Vspltisb (va_op_vec_opr_vec 0) 1) (va_CCons (va_code_Vsl (va_op_vec_opr_vec
1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 0)) (va_CCons (va_code_Vsl (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_CCons (va_code_Vxor (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_CNil ())))))))))))
val va_codegen_success_ShiftLeft2_128_1 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ShiftLeft2_128_1 () =
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 0) 0) (va_pbool_and
(va_codegen_success_LoadImm64 (va_op_reg_opr_reg 10) 31) (va_pbool_and
(va_codegen_success_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_pbool_and
(va_codegen_success_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_pbool_and (va_codegen_success_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0)
(va_op_vec_opr_vec 3) 4) (va_pbool_and (va_codegen_success_Vspltisb (va_op_vec_opr_vec 0) 1)
(va_pbool_and (va_codegen_success_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 0)) (va_pbool_and (va_codegen_success_Vsl (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_pbool_and (va_codegen_success_Vxor
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_ttrue ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ShiftLeft2_128_1 (va_mods:va_mods_t) (lo:poly) (hi:poly) : (va_quickCode unit
(va_code_ShiftLeft2_128_1 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisw (va_op_vec_opr_vec 0) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 84 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_LoadImm64 (va_op_reg_opr_reg 10) 31) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 85 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 86 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 87 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0) (va_op_vec_opr_vec 3) 4) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 88 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisb (va_op_vec_opr_vec 0) 1) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 89 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 0)) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 90 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_QBind
va_range1
"***** PRECONDITION NOT MET AT line 91 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vxor (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (fun
(va_s:va_state) _ -> let (l:(Vale.Def.Words_s.four Vale.Def.Words_s.nat32)) =
Vale.Def.Words.Four_s.four_map #nat32 #Vale.Def.Words_s.nat32 (fun (i:nat32) ->
Vale.Arch.Types.ishl32 i 1) (va_get_vec 2 va_old_s) in let (r:(Vale.Def.Words_s.four
Vale.Def.Words_s.nat32)) = Vale.Def.Words.Four_s.four_map #nat32 #Vale.Def.Words_s.nat32 (fun
(i:nat32) -> Vale.Arch.Types.ishr32 i 31) (va_get_vec 2 va_old_s) in let
(va_arg22:Vale.Def.Types_s.quad32) = va_get_vec 3 va_s in let
(va_arg21:Vale.Def.Types_s.quad32) = Vale.Def.Words_s.Mkfour #Vale.Def.Types_s.nat32 0
(Vale.Def.Words_s.__proj__Mkfour__item__lo0 r) (Vale.Def.Words_s.__proj__Mkfour__item__lo1 r)
(Vale.Def.Words_s.__proj__Mkfour__item__hi2 r) in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 95 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Arch.TypesNative.lemma_quad32_xor_commutes va_arg21 va_arg22) (let
(va_arg20:Vale.Def.Types_s.quad32) = va_get_vec 3 va_s in let
(va_arg19:Vale.Def.Types_s.quad32) = Vale.Def.Words_s.Mkfour #Vale.Def.Types_s.nat32 0
(Vale.Def.Words_s.__proj__Mkfour__item__lo0 r) (Vale.Def.Words_s.__proj__Mkfour__item__lo1 r)
(Vale.Def.Words_s.__proj__Mkfour__item__hi2 r) in let (va_arg18:Vale.Def.Types_s.quad32) = l in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 96 column 32 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Arch.TypesNative.lemma_quad32_xor_associates va_arg18 va_arg19 va_arg20)
(let (va_arg17:Vale.Math.Poly2_s.poly) = hi in let (va_arg16:Vale.Math.Poly2_s.poly) = lo in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 98 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_shift_2_left_1 va_arg16 va_arg17) (va_QEmpty
(())))))))))))))))
val va_lemma_ShiftLeft2_128_1 : va_b0:va_code -> va_s0:va_state -> lo:poly -> hi:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ShiftLeft2_128_1 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree hi < 127 /\ Vale.Math.Poly2_s.degree lo <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 hi))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let n = Vale.Math.Poly2_s.monomial 128 in let a = Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul
hi n) lo in let b = Vale.Math.Poly2_s.shift a 1 in va_get_vec 1 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n) /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)) /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))
[@"opaque_to_smt"]
let va_lemma_ShiftLeft2_128_1 va_b0 va_s0 lo hi =
let (va_mods:va_mods_t) = [va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10;
va_Mod_ok] in
let va_qc = va_qcode_ShiftLeft2_128_1 va_mods lo hi in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftLeft2_128_1 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 66 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 77 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let n = Vale.Math.Poly2_s.monomial 128 in label va_range1
"***** POSTCONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let a = Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul hi n) lo in label va_range1
"***** POSTCONDITION NOT MET AT line 79 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let b = Vale.Math.Poly2_s.shift a 1 in label va_range1
"***** POSTCONDITION NOT MET AT line 80 column 35 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 81 column 35 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)))))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10;
va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_ShiftLeft2_128_1 (lo:poly) (hi:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0))
: Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree hi < 127 /\ Vale.Math.Poly2_s.degree lo <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 hi /\ (forall (va_x_r10:nat64) (va_x_v0:quad32)
(va_x_v1:quad32) (va_x_v2:quad32) (va_x_v3:quad32) . let va_sM = va_upd_vec 3 va_x_v3
(va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1 (va_upd_vec 0 va_x_v0 (va_upd_reg 10 va_x_r10
va_s0)))) in va_get_ok va_sM /\ (let n = Vale.Math.Poly2_s.monomial 128 in let a =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul hi n) lo in let b = Vale.Math.Poly2_s.shift a 1 in
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n) /\
va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)) ==> va_k
va_sM (())))
val va_wpProof_ShiftLeft2_128_1 : lo:poly -> hi:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ShiftLeft2_128_1 lo hi va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ShiftLeft2_128_1 ()) ([va_Mod_vec 3;
va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ShiftLeft2_128_1 lo hi va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftLeft2_128_1 (va_code_ShiftLeft2_128_1 ()) va_s0 lo hi in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM
(va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM va_s0)))))));
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10])
va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ShiftLeft2_128_1 (lo:poly) (hi:poly) : (va_quickCode unit (va_code_ShiftLeft2_128_1
())) =
(va_QProc (va_code_ShiftLeft2_128_1 ()) ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0;
va_Mod_reg 10]) (va_wp_ShiftLeft2_128_1 lo hi) (va_wpProof_ShiftLeft2_128_1 lo hi))
//--
//-- ClmulRev64High
val va_code_ClmulRev64High : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ClmulRev64High () =
(va_Block (va_CCons (va_code_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_ShiftLeft128_1 ()) (va_CNil ()))))
val va_codegen_success_ClmulRev64High : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ClmulRev64High () =
(va_pbool_and (va_codegen_success_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_ShiftLeft128_1 ()) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ClmulRev64High (va_mods:va_mods_t) (a:poly) (b:poly) : (va_quickCode unit
(va_code_ClmulRev64High ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(va_arg18:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 116 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg18) (let
(va_arg17:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 117 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg17) (let
(va_arg16:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 118 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg16 64) (let
(va_arg15:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 119 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg15 64) (let
(va_arg14:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 120 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg14 64) (let
(va_arg13:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 121 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg13 64) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 17 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2))
(va_QBind va_range1
"***** PRECONDITION NOT MET AT line 123 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ShiftLeft128_1 (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.reverse a 63)
(Vale.Math.Poly2_s.reverse b 63))) (fun (va_s:va_state) _ -> let
(va_arg12:Vale.Math.Poly2_s.poly) = b in let (va_arg11:Vale.Math.Poly2_s.poly) = a in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 125 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_reverse_shift_1 va_arg11 va_arg12 63)
(va_QEmpty (()))))))))))))
val va_lemma_ClmulRev64High : va_b0:va_code -> va_s0:va_state -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ClmulRev64High ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 63 /\ Vale.Math.Poly2_s.degree b <= 63 /\
Vale.Math.Poly2_s.reverse a 63 == Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_hi (va_get_vec 1 va_s0)) /\ Vale.Math.Poly2_s.reverse b 63 ==
Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_hi (va_get_vec 2 va_s0)) /\
l_or (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo (va_get_vec 1
va_s0)) == zero) (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo
(va_get_vec 2 va_s0)) == zero)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.Math.Poly2_s.mul a b) 127) /\ va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1
va_sM (va_update_ok va_sM va_s0)))))
[@"opaque_to_smt"]
let va_lemma_ClmulRev64High va_b0 va_s0 a b =
let (va_mods:va_mods_t) = [va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ClmulRev64High va_mods a b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ClmulRev64High ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 101 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 49 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.Math.Poly2_s.mul a b) 127))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_ClmulRev64High (a:poly) (b:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) :
Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree a <= 63 /\ Vale.Math.Poly2_s.degree b <= 63 /\
Vale.Math.Poly2_s.reverse a 63 == Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_hi (va_get_vec 1 va_s0)) /\ Vale.Math.Poly2_s.reverse b 63 ==
Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_hi (va_get_vec 2 va_s0)) /\
l_or (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo (va_get_vec 1
va_s0)) == zero) (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo
(va_get_vec 2 va_s0)) == zero) /\ (forall (va_x_v1:quad32) (va_x_v2:quad32) . let va_sM =
va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1 va_s0) in va_get_ok va_sM /\ va_get_vec 1 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul a b) 127)
==> va_k va_sM (())))
val va_wpProof_ClmulRev64High : a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ClmulRev64High a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ClmulRev64High ()) ([va_Mod_vec 2;
va_Mod_vec 1]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ClmulRev64High a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ClmulRev64High (va_code_ClmulRev64High ()) va_s0 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_ok va_sM
va_s0))));
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ClmulRev64High (a:poly) (b:poly) : (va_quickCode unit (va_code_ClmulRev64High ())) =
(va_QProc (va_code_ClmulRev64High ()) ([va_Mod_vec 2; va_Mod_vec 1]) (va_wp_ClmulRev64High a b)
(va_wpProof_ClmulRev64High a b))
//--
//-- High64ToLow
[@ "opaque_to_smt"]
let va_code_High64ToLow dst src =
(va_Block (va_CCons (va_code_Vsldoi dst (va_op_vec_opr_vec 0) src 8) (va_CNil ())))
[@ "opaque_to_smt"]
let va_codegen_success_High64ToLow dst src =
(va_pbool_and (va_codegen_success_Vsldoi dst (va_op_vec_opr_vec 0) src 8) (va_ttrue ()))
[@"opaque_to_smt"]
let va_lemma_High64ToLow va_b0 va_s0 dst src a =
va_reveal_opaque (`%va_code_High64ToLow) (va_code_High64ToLow dst src);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let (va_s2, va_fc2) = va_lemma_Vsldoi (va_hd va_b1) va_s0 dst (va_op_vec_opr_vec 0) src 8 in
let va_b2 = va_tl va_b1 in
Vale.Math.Poly2.Words.lemma_quad32_double_shift a;
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_High64ToLow dst src a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_High64ToLow (va_code_High64ToLow dst src) va_s0 dst src a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- Low64ToHigh
[@ "opaque_to_smt" va_qattr]
let va_code_Low64ToHigh dst src =
(va_Block (va_CCons (va_code_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (va_CNil ())))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Low64ToHigh dst src =
(va_pbool_and (va_codegen_success_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (va_ttrue ()))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Low64ToHigh (va_mods:va_mods_t) (dst:vec_opr) (src:vec_opr) (a:poly) : (va_quickCode
unit (va_code_Low64ToHigh dst src)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 156 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (fun (va_s:va_state) _ -> let
(va_arg4:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 157 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Words.lemma_quad32_double_shift va_arg4) (va_QEmpty (())))))
[@"opaque_to_smt"]
let va_lemma_Low64ToHigh va_b0 va_s0 dst src a =
let (va_mods:va_mods_t) = [va_Mod_ok; va_mod_vec_opr dst] in
let va_qc = va_qcode_Low64ToHigh va_mods dst src a in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Low64ToHigh dst src) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 144 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 154 column 66 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod a (Vale.Math.Poly2_s.monomial 64)) (Vale.Math.Poly2_s.monomial 64)))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_ok; va_mod_vec_opr dst]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_Low64ToHigh dst src a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Low64ToHigh (va_code_Low64ToHigh dst src) va_s0 dst src a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AddPoly
val va_code_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr -> src2:va_operand_vec_opr
-> Tot va_code
[@ "opaque_to_smt"]
let va_code_AddPoly dst src1 src2 =
(va_Block (va_CCons (va_code_Vxor dst src1 src2) (va_CNil ())))
val va_codegen_success_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr ->
src2:va_operand_vec_opr -> Tot va_pbool
[@ "opaque_to_smt"]
let va_codegen_success_AddPoly dst src1 src2 =
(va_pbool_and (va_codegen_success_Vxor dst src1 src2) (va_ttrue ()))
val va_lemma_AddPoly : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr ->
src1:va_operand_vec_opr -> src2:va_operand_vec_opr -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AddPoly dst src1 src2) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_is_src_vec_opr src1 va_s0 /\ va_is_src_vec_opr src2 va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\ va_eval_vec_opr va_s0
src1 == Vale.Math.Poly2.Bits_s.to_quad32 a /\ va_eval_vec_opr va_s0 src2 ==
Vale.Math.Poly2.Bits_s.to_quad32 b))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add a b) /\
va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0))))
[@"opaque_to_smt"]
let va_lemma_AddPoly va_b0 va_s0 dst src1 src2 a b =
va_reveal_opaque (`%va_code_AddPoly) (va_code_AddPoly dst src1 src2);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let (va_s2, va_fc2) = va_lemma_Vxor (va_hd va_b1) va_s0 dst src1 src2 in
let va_b2 = va_tl va_b1 in
Vale.Math.Poly2.Words.lemma_add128 a b;
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_AddPoly (dst:va_operand_vec_opr) (src1:va_operand_vec_opr) (src2:va_operand_vec_opr)
(a:poly) (b:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_is_dst_vec_opr dst va_s0 /\ va_is_src_vec_opr src1 va_s0 /\ va_is_src_vec_opr src2 va_s0 /\
va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\
va_eval_vec_opr va_s0 src1 == Vale.Math.Poly2.Bits_s.to_quad32 a /\ va_eval_vec_opr va_s0 src2
== Vale.Math.Poly2.Bits_s.to_quad32 b /\ (forall (va_x_dst:va_value_vec_opr) . let va_sM =
va_upd_operand_vec_opr dst va_x_dst va_s0 in va_get_ok va_sM /\ va_eval_vec_opr va_sM dst ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add a b) ==> va_k va_sM (())))
val va_wpProof_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr ->
src2:va_operand_vec_opr -> a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AddPoly dst src1 src2 a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AddPoly dst src1 src2)
([va_mod_vec_opr dst]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_AddPoly dst src1 src2 a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AddPoly (va_code_AddPoly dst src1 src2) va_s0 dst src1 src2 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_AddPoly (dst:va_operand_vec_opr) (src1:va_operand_vec_opr) (src2:va_operand_vec_opr)
(a:poly) (b:poly) : (va_quickCode unit (va_code_AddPoly dst src1 src2)) =
(va_QProc (va_code_AddPoly dst src1 src2) ([va_mod_vec_opr dst]) (va_wp_AddPoly dst src1 src2 a
b) (va_wpProof_AddPoly dst src1 src2 a b))
//--
//-- Clmul128
val va_code_Clmul128 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_Clmul128 () =
(va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0) 0) (va_CCons (va_code_VSwap
(va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (va_CCons (va_code_High64ToLow (va_op_vec_opr_vec
4) (va_op_vec_opr_vec 3)) (va_CCons (va_code_Low64ToHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 3)) (va_CCons (va_code_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec
4) (va_op_vec_opr_vec 2)) (va_CCons (va_code_VPolyMulHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_CCons (va_code_Low64ToHigh (va_op_vec_opr_vec
1) (va_op_vec_opr_vec 3)) (va_CCons (va_code_High64ToLow (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 3)) (va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 4)) (va_CCons (va_code_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 2)) (va_CNil ())))))))))))))
val va_codegen_success_Clmul128 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Clmul128 () =
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 0) 0) (va_pbool_and
(va_codegen_success_VSwap (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (va_pbool_and
(va_codegen_success_High64ToLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 3)) (va_pbool_and
(va_codegen_success_Low64ToHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 3)) (va_pbool_and
(va_codegen_success_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 2))
(va_pbool_and (va_codegen_success_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 4)
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_VPolyMulHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_Low64ToHigh
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_pbool_and (va_codegen_success_High64ToLow
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_pbool_and (va_codegen_success_AddPoly
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 4)) (va_pbool_and
(va_codegen_success_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2))
(va_ttrue ()))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Clmul128 (va_mods:va_mods_t) (ab:poly) (cd:poly) : (va_quickCode (poly & poly)
(va_code_Clmul128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(n:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.monomial 64 in let (a:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.div ab n in let (b:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ab n in
let (c:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div cd n in let (d:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.mod cd n in let (ac:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul a c in
let (ad:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul a d in let (bc:Vale.Math.Poly2_s.poly)
= Vale.Math.Poly2_s.mul b c in let (bd:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul b d in
let (ab_sw:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.swap ab 64 in let
(ab_hi:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ab n in let
(ab_lo:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.div ab n) n in let
(va_arg77:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 202 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg77) (let
(va_arg76:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 203 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg76) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 205 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisw (va_op_vec_opr_vec 0) 0) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 206 column 10 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VSwap (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (fun (va_s:va_state) _ -> let
(va_arg75:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 207 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg75) (let
(va_arg74:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 208 column 29 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Words.lemma_quad32_double_swap va_arg74) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 209 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double ab_sw) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 210 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_High64ToLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 3) ab_sw) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 211 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Low64ToHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 3) ab_sw) (fun (va_s:va_state) _
-> va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 212 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 4 va_s == Vale.Math.Poly2.Bits_s.to_quad32 ab_hi) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 213 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 5 va_s == Vale.Math.Poly2.Bits_s.to_quad32 ab_lo) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 215 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 217 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 ab_hi) (let
(va_arg73:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ab_hi n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 218 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_degree_negative va_arg73) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 219 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_hi 64) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 220 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 222 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 ab_lo) (let
(va_arg72:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ab n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 223 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_div_mod_exact va_arg72 n) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 224 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_lo 64) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 225 column 17 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> let (va_arg71:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 227 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg71) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 228 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_sw 64) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 229 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_sw 64) (let
(va_arg70:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 230 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg70 64) (let
(va_arg69:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 231 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg69 64) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 232 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s) == Vale.Math.Poly2_s.add ad bc) (va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 234 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_hi 64) (let
(va_arg68:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 235 column 18 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mod_mod va_arg68 n) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 236 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 4 va_s) == bd) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 238 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_lo 64) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 239 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 5 va_s) == ac) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 241 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Low64ToHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3) (Vale.Math.Poly2_s.add ad
bc)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 242 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mod_distribute ad bc n) (let
(va_arg67:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod bc n in let
(va_arg66:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ad n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 243 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_distribute_left va_arg66 va_arg67 n)
(va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 244 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_s == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n) (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod bc n) n))) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 246 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_High64ToLow (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3) (Vale.Math.Poly2_s.add ad
bc)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 247 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GHash_BE.lemma_div_distribute ad bc n) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 248 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_s == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.div ad n) (Vale.Math.Poly2_s.div bc n))) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 250 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 4)
(Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n)
(Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod bc n) n)) bd) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 251 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2) ac
(Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.div ad n) (Vale.Math.Poly2_s.div bc n))) (fun
(va_s:va_state) _ -> let (va_arg65:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div bc n in let
(va_arg64:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ad n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 253 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_commute va_arg64 va_arg65) (let
(va_arg63:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ad n in let
(va_arg62:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div bc n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 254 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_associate ac va_arg62 va_arg63) (let (hi:poly) =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.add ac (Vale.Math.Poly2_s.div bc n))
(Vale.Math.Poly2_s.div ad n) in let (va_arg61:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod bc n) n in let (va_arg60:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod ad n) n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 256 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_commute va_arg60 va_arg61) (let (lo:poly) =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod bc
n) n) (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n)) bd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 259 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_mul a b c d 64) (va_QEmpty ((lo,
hi))))))))))))))))))))))))))))))))))))))))))))))))
val va_lemma_Clmul128 : va_b0:va_code -> va_s0:va_state -> ab:poly -> cd:poly
-> Ghost (va_state & va_fuel & poly & poly)
(requires (va_require_total va_b0 (va_code_Clmul128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 ab /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 cd))
(ensures (fun (va_sM, va_fM, lo, hi) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok
va_sM /\ Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi < 127 /\
Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 hi /\ va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec
4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0
va_sM (va_update_ok va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_Clmul128 va_b0 va_s0 ab cd =
let (va_mods:va_mods_t) = [va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_ok] in
let va_qc = va_qcode_Clmul128 va_mods ab cd in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Clmul128 ()) va_qc va_s0 (fun va_s0
va_sM va_g -> let (lo, hi) = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 174 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 184 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree lo <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 185 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree hi < 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 186 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo) /\
label va_range1
"***** POSTCONDITION NOT MET AT line 187 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 188 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_ok]) va_sM va_s0;
let (lo, hi) = va_g in
(va_sM, va_fM, lo, hi)
[@ va_qattr]
let va_wp_Clmul128 (ab:poly) (cd:poly) (va_s0:va_state) (va_k:(va_state -> (poly & poly) -> Type0))
: Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 ab /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 cd /\ (forall (va_x_v0:quad32) (va_x_v1:quad32)
(va_x_v2:quad32) (va_x_v3:quad32) (va_x_v4:quad32) (va_x_v5:quad32) (lo:poly) (hi:poly) . let
va_sM = va_upd_vec 5 va_x_v5 (va_upd_vec 4 va_x_v4 (va_upd_vec 3 va_x_v3 (va_upd_vec 2 va_x_v2
(va_upd_vec 1 va_x_v1 (va_upd_vec 0 va_x_v0 va_s0))))) in va_get_ok va_sM /\
Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi < 127 /\
Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 hi ==> va_k va_sM ((lo, hi))))
val va_wpProof_Clmul128 : ab:poly -> cd:poly -> va_s0:va_state -> va_k:(va_state -> (poly & poly)
-> Type0)
-> Ghost (va_state & va_fuel & (poly & poly))
(requires (va_t_require va_s0 /\ va_wp_Clmul128 ab cd va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Clmul128 ()) ([va_Mod_vec 5;
va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0]) va_s0 va_k ((va_sM,
va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_Clmul128 ab cd va_s0 va_k =
let (va_sM, va_f0, lo, hi) = va_lemma_Clmul128 (va_code_Clmul128 ()) va_s0 ab cd in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM
(va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_ok va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0]) va_sM va_s0;
let va_g = (lo, hi) in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_Clmul128 (ab:poly) (cd:poly) : (va_quickCode (poly & poly) (va_code_Clmul128 ())) =
(va_QProc (va_code_Clmul128 ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0]) (va_wp_Clmul128 ab cd) (va_wpProof_Clmul128 ab cd))
//--
//-- ClmulRev128
val va_code_ClmulRev128 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ClmulRev128 () =
(va_Block (va_CCons (va_code_Clmul128 ()) (va_CCons (va_code_ShiftLeft2_128_1 ()) (va_CNil ()))))
val va_codegen_success_ClmulRev128 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ClmulRev128 () =
(va_pbool_and (va_codegen_success_Clmul128 ()) (va_pbool_and (va_codegen_success_ShiftLeft2_128_1
()) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ClmulRev128 (va_mods:va_mods_t) (ab:poly) (cd:poly) : (va_quickCode (poly & poly)
(va_code_ClmulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 279 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Clmul128 (Vale.Math.Poly2_s.reverse ab 127) (Vale.Math.Poly2_s.reverse cd 127)) (fun
(va_s:va_state) va_g -> let (lo, hi) = va_g in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 280 column 21 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ShiftLeft2_128_1 lo hi) (fun (va_s:va_state) _ -> let (m:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.shift (Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo) 1 in let
(va_arg13:Vale.Math.Poly2_s.poly) = lo in let (va_arg12:Vale.Math.Poly2_s.poly) = hi in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 283 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg12 va_arg13 128) (va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 284 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_split_define m 128) (let (lo:poly) =
Vale.Math.Poly2_s.mod m (Vale.Math.Poly2_s.monomial 128) in let (hi:poly) =
Vale.Math.Poly2_s.div m (Vale.Math.Poly2_s.monomial 128) in let
(va_arg11:Vale.Math.Poly2_s.poly) = cd in let (va_arg10:Vale.Math.Poly2_s.poly) = ab in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 287 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_reverse_shift_1 va_arg10 va_arg11 127)
(va_QEmpty ((lo, hi)))))))))
val va_lemma_ClmulRev128 : va_b0:va_code -> va_s0:va_state -> ab:poly -> cd:poly
-> Ghost (va_state & va_fuel & poly & poly)
(requires (va_require_total va_b0 (va_code_ClmulRev128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse ab 127) /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse cd 127)))
(ensures (fun (va_sM, va_fM, lo, hi) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok
va_sM /\ Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi <= 127 /\
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo /\ va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32
lo /\ va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi /\ va_state_eq va_sM
(va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM
(va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM
va_s0))))))))))
[@"opaque_to_smt"]
let va_lemma_ClmulRev128 va_b0 va_s0 ab cd =
let (va_mods:va_mods_t) = [va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_ClmulRev128 va_mods ab cd in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ClmulRev128 ()) va_qc va_s0 (fun va_s0
va_sM va_g -> let (lo, hi) = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 262 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 273 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree lo <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 274 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree hi <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 275 column 61 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 276 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 277 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok]) va_sM va_s0;
let (lo, hi) = va_g in
(va_sM, va_fM, lo, hi)
[@ va_qattr]
let va_wp_ClmulRev128 (ab:poly) (cd:poly) (va_s0:va_state) (va_k:(va_state -> (poly & poly) ->
Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse ab 127) /\
va_get_vec 2 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse cd 127) /\
(forall (va_x_r10:nat64) (va_x_v0:quad32) (va_x_v1:quad32) (va_x_v2:quad32) (va_x_v3:quad32)
(va_x_v4:quad32) (va_x_v5:quad32) (lo:poly) (hi:poly) . let va_sM = va_upd_vec 5 va_x_v5
(va_upd_vec 4 va_x_v4 (va_upd_vec 3 va_x_v3 (va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1
(va_upd_vec 0 va_x_v0 (va_upd_reg 10 va_x_r10 va_s0)))))) in va_get_ok va_sM /\
Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi <= 127 /\
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo /\ va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32
lo /\ va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi ==> va_k va_sM ((lo, hi))))
val va_wpProof_ClmulRev128 : ab:poly -> cd:poly -> va_s0:va_state -> va_k:(va_state -> (poly &
poly) -> Type0)
-> Ghost (va_state & va_fuel & (poly & poly))
(requires (va_t_require va_s0 /\ va_wp_ClmulRev128 ab cd va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ClmulRev128 ()) ([va_Mod_vec 5;
va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_s0
va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ClmulRev128 ab cd va_s0 va_k =
let (va_sM, va_f0, lo, hi) = va_lemma_ClmulRev128 (va_code_ClmulRev128 ()) va_s0 ab cd in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM
(va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM
(va_update_ok va_sM va_s0)))))))));
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10]) va_sM va_s0;
let va_g = (lo, hi) in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ClmulRev128 (ab:poly) (cd:poly) : (va_quickCode (poly & poly) (va_code_ClmulRev128
())) =
(va_QProc (va_code_ClmulRev128 ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) (va_wp_ClmulRev128 ab cd) (va_wpProof_ClmulRev128
ab cd))
//--
//-- Gf128ModulusRev
val va_code_Gf128ModulusRev : dst:va_operand_vec_opr -> Tot va_code
[@ "opaque_to_smt"]
let va_code_Gf128ModulusRev dst =
(va_Block (va_CCons (va_code_Vxor dst dst dst) (va_CCons (va_code_LoadImmShl64 (va_op_reg_opr_reg
10) (-7936)) (va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_CCons
(va_code_Vsldoi dst (va_op_vec_opr_vec 3) dst 12) (va_CNil ()))))))
val va_codegen_success_Gf128ModulusRev : dst:va_operand_vec_opr -> Tot va_pbool
[@ "opaque_to_smt"]
let va_codegen_success_Gf128ModulusRev dst =
(va_pbool_and (va_codegen_success_Vxor dst dst dst) (va_pbool_and
(va_codegen_success_LoadImmShl64 (va_op_reg_opr_reg 10) (-7936)) (va_pbool_and
(va_codegen_success_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_pbool_and
(va_codegen_success_Vsldoi dst (va_op_vec_opr_vec 3) dst 12) (va_ttrue ())))))
val va_lemma_Gf128ModulusRev : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128ModulusRev dst) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_get_ok va_s0 /\ dst =!= 3))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) /\ Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_lo (va_eval_vec_opr va_sM dst)) == zero /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM (va_update_operand_vec_opr
dst va_sM va_s0))))))
[@"opaque_to_smt"]
let va_lemma_Gf128ModulusRev va_b0 va_s0 dst =
va_reveal_opaque (`%va_code_Gf128ModulusRev) (va_code_Gf128ModulusRev dst);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
Vale.AES.GF128.lemma_gf128_constant_rev (va_eval_vec_opr va_s0 dst);
let (va_s3, va_fc3) = va_lemma_Vxor (va_hd va_b1) va_s0 dst dst dst in
let va_b3 = va_tl va_b1 in
let (va_s4, va_fc4) = va_lemma_LoadImmShl64 (va_hd va_b3) va_s3 (va_op_reg_opr_reg 10) (-7936) in
let va_b4 = va_tl va_b3 in
Vale.AES.Types_helpers.lemma_ishl_64 ((-7936) `op_Modulus` pow2_64) 16;
let (va_s6, va_fc6) = va_lemma_Mtvsrws (va_hd va_b4) va_s4 (va_op_vec_opr_vec 3)
(va_op_reg_opr_reg 10) in
let va_b6 = va_tl va_b4 in
let (va_s7, va_fc7) = va_lemma_Vsldoi (va_hd va_b6) va_s6 dst (va_op_vec_opr_vec 3) dst 12 in
let va_b7 = va_tl va_b6 in
Vale.Math.Poly2.Lemmas.lemma_split_define (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127)
64;
Vale.Math.Poly2.Lemmas.lemma_index_all ();
Vale.Math.Poly2.Lemmas.lemma_reverse_define_all ();
Vale.Math.Poly2.lemma_equal (Vale.Math.Poly2_s.mod (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) (Vale.Math.Poly2_s.monomial 64)) zero;
Vale.Math.Poly2.Bits.lemma_quad32_double (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127);
let (va_sM, va_f7) = va_lemma_empty_total va_s7 va_b7 in
let va_f6 = va_lemma_merge_total va_b6 va_s6 va_fc7 va_s7 va_f7 va_sM in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_sM in
let va_f3 = va_lemma_merge_total va_b3 va_s3 va_fc4 va_s4 va_f4 va_sM in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc3 va_s3 va_f3 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_Gf128ModulusRev (dst:va_operand_vec_opr) (va_s0:va_state) (va_k:(va_state -> unit ->
Type0)) : Type0 =
(va_is_dst_vec_opr dst va_s0 /\ va_get_ok va_s0 /\ dst =!= 3 /\ (forall
(va_x_dst:va_value_vec_opr) (va_x_r10:nat64) (va_x_v3:quad32) . let va_sM = va_upd_vec 3
va_x_v3 (va_upd_reg 10 va_x_r10 (va_upd_operand_vec_opr dst va_x_dst va_s0)) in va_get_ok va_sM
/\ va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) /\ Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_lo (va_eval_vec_opr va_sM dst)) == zero ==> va_k va_sM (())))
val va_wpProof_Gf128ModulusRev : dst:va_operand_vec_opr -> va_s0:va_state -> va_k:(va_state -> unit
-> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Gf128ModulusRev dst va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Gf128ModulusRev dst) ([va_Mod_vec 3;
va_Mod_reg 10; va_mod_vec_opr dst]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_Gf128ModulusRev dst va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Gf128ModulusRev (va_code_Gf128ModulusRev dst) va_s0 dst in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 3 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM
(va_update_operand_vec_opr dst va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_reg 10; va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_Gf128ModulusRev (dst:va_operand_vec_opr) : (va_quickCode unit (va_code_Gf128ModulusRev
dst)) =
(va_QProc (va_code_Gf128ModulusRev dst) ([va_Mod_vec 3; va_Mod_reg 10; va_mod_vec_opr dst])
(va_wp_Gf128ModulusRev dst) (va_wpProof_Gf128ModulusRev dst))
//--
//-- ReduceMulRev128
[@ "opaque_to_smt" va_qattr]
let va_code_ReduceMulRev128 () =
(va_Block (va_CCons (va_code_ClmulRev128 ()) (va_CCons (va_code_Vmr (va_op_vec_opr_vec 6)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_CCons
(va_code_ClmulRev128 ()) (va_CCons (va_code_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2))
(va_CCons (va_code_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_CCons (va_code_ClmulRev64High ())
(va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5))
(va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6))
(va_CNil ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ReduceMulRev128 () =
(va_pbool_and (va_codegen_success_ClmulRev128 ()) (va_pbool_and (va_codegen_success_Vmr
(va_op_vec_opr_vec 6) (va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_Gf128ModulusRev
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_ClmulRev128 ()) (va_pbool_and
(va_codegen_success_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_pbool_and
(va_codegen_success_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_pbool_and
(va_codegen_success_ClmulRev64High ()) (va_pbool_and (va_codegen_success_AddPoly
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5)) (va_pbool_and
(va_codegen_success_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6))
(va_ttrue ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ReduceMulRev128 (va_mods:va_mods_t) (a:poly) (b:poly) : (va_quickCode unit
(va_code_ReduceMulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 329 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_degree ()) (let (va_arg31:Vale.Math.Poly2_s.poly) =
b in let (va_arg30:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 330 column 27 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_reduce_rev va_arg30 va_arg31
gf128_modulus_low_terms 128) (let (m:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.monomial 128
in let (h:Vale.Math.Poly2_s.poly) = gf128_modulus_low_terms in let (ab:Vale.Math.Poly2_s.poly)
= Vale.Math.Poly2_s.mul a b in let (rh:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse h
127 in let (rab:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse ab 255 in let
(rd:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod rab m in let (rdh:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.reverse rd 127) h) 255 in
let (rdhL:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod rdh m in let
(rdhLh:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.reverse rdhL 127) h) 127 in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 341 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev128 a b) (fun (va_s:va_state) va_g -> let ((lo1:poly), (hi1:poly)) = va_g in
let (va_arg29:Vale.Math.Poly2_s.poly) = lo1 in let (va_arg28:Vale.Math.Poly2_s.poly) = hi1 in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 342 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg28 va_arg29 128) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 343 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vmr (va_op_vec_opr_vec 6) (va_op_vec_opr_vec 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 345 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 346 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev128 (Vale.Math.Poly2_s.reverse rd 127) h) (fun (va_s:va_state) va_g -> let
((lo2:poly), (hi2:poly)) = va_g in let (va_arg27:Vale.Math.Poly2_s.poly) = lo2 in let
(va_arg26:Vale.Math.Poly2_s.poly) = hi2 in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 347 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg26 va_arg27 128) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 348 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 350 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Gf128ModulusRev (va_op_vec_opr_vec 2)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 352 column 31 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_quad32_double_hi_rev rdhL) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 353 column 31 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_quad32_double_hi_rev rh) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 354 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev64High (Vale.Math.Poly2_s.reverse rdhL 127) h) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 356 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5) rdhLh
(Vale.Math.Poly2_s.div rdh m)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 357 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6)
(Vale.Math.Poly2_s.add rdhLh (Vale.Math.Poly2_s.div rdh m)) (Vale.Math.Poly2_s.div rab m))
(va_QEmpty (()))))))))))))))))))
[@"opaque_to_smt"]
let va_lemma_ReduceMulRev128 va_b0 va_s0 a b =
let (va_mods:va_mods_t) = [va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_ReduceMulRev128 va_mods a b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ReduceMulRev128 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 315 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 327 column 55 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.AES.GF128_s.gf128_mul a b) 127))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_ReduceMulRev128 a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ReduceMulRev128 (va_code_ReduceMulRev128 ()) va_s0 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 6 va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))));
va_lemma_norm_mods ([va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- Gf128MulRev128
[@ "opaque_to_smt" va_qattr]
let va_code_Gf128MulRev128 () =
(va_Block (va_CCons (va_code_ReduceMulRev128 ()) (va_CNil ())))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Gf128MulRev128 () =
(va_pbool_and (va_codegen_success_ReduceMulRev128 ()) (va_ttrue ()))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Gf128MulRev128 (va_mods:va_mods_t) : (va_quickCode unit (va_code_Gf128MulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(a:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in let
(b:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in va_QBind
va_range1
"***** PRECONDITION NOT MET AT line 372 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ReduceMulRev128 (Vale.Math.Poly2_s.reverse a 127) (Vale.Math.Poly2_s.reverse b 127))
(fun (va_s:va_state) _ -> let (va_arg6:Vale.Math.Poly2_s.poly) = Vale.AES.GF128.gf128_mul_rev a
b in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 373 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg6) (va_QEmpty (())))))
[@"opaque_to_smt"]
let va_lemma_Gf128MulRev128 va_b0 va_s0 =
let (va_mods:va_mods_t) = [va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_Gf128MulRev128 va_mods in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Gf128MulRev128 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 360 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ (let (a:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32
(va_get_vec 1 va_s0) in let (b:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32
(va_get_vec 2 va_s0) in label va_range1
"***** POSTCONDITION NOT MET AT line 370 column 45 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_sM) == Vale.AES.GF128.gf128_mul_rev a b))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM) | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.fsti.checked",
"Vale.PPC64LE.InsBasic.fsti.checked",
"Vale.PPC64LE.Decls.fsti.checked",
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Words.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.TypesNative.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.Types_helpers.fsti.checked",
"Vale.AES.PPC64LE.PolyOps.fsti.checked",
"Vale.AES.GHash_BE.fsti.checked",
"Vale.AES.GF128_s.fsti.checked",
"Vale.AES.GF128.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.PPC64LE.GF128_Mul.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
va_s0: Vale.PPC64LE.Decls.va_state ->
va_k: (_: Vale.PPC64LE.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.PPC64LE.Decls.va_state",
"Prims.unit",
"Vale.PPC64LE.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.PPC64LE.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod_vec",
"Vale.PPC64LE.QuickCode.va_Mod_reg",
"Prims.Nil",
"Prims._assert",
"Vale.PPC64LE.Decls.va_state_eq",
"Vale.PPC64LE.Decls.va_update_vec",
"Vale.PPC64LE.Decls.va_update_reg",
"Vale.PPC64LE.Decls.va_update_ok",
"Vale.PPC64LE.Decls.va_lemma_upd_update",
"FStar.Pervasives.Native.tuple3",
"FStar.Pervasives.Native.tuple2",
"Vale.PPC64LE.Machine_s.state",
"Vale.AES.PPC64LE.GF128_Mul.va_lemma_Gf128MulRev128",
"Vale.AES.PPC64LE.GF128_Mul.va_code_Gf128MulRev128"
] | [] | false | false | false | false | false | let va_wpProof_Gf128MulRev128 va_s0 va_k =
| let va_sM, va_f0 = va_lemma_Gf128MulRev128 (va_code_Gf128MulRev128 ()) va_s0 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_vec 6
va_sM
(va_update_vec 5
va_sM
(va_update_vec 4
va_sM
(va_update_vec 3
va_sM
(va_update_vec 2
va_sM
(va_update_vec 1
va_sM
(va_update_vec 0
va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))));
va_lemma_norm_mods ([
va_Mod_vec 6;
va_Mod_vec 5;
va_Mod_vec 4;
va_Mod_vec 3;
va_Mod_vec 2;
va_Mod_vec 1;
va_Mod_vec 0;
va_Mod_reg 10
])
va_sM
va_s0;
let va_g = () in
(va_sM, va_f0, va_g) | false |
FStar.BV.fst | FStar.BV.bvor | val bvor (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvor (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvor = B.logor_vec | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 22,
"end_line": 59,
"start_col": 0,
"start_line": 59
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"FStar.BitVector.logor_vec"
] | [] | false | false | false | false | false | let bvor =
| B.logor_vec | false |
FStar.BV.fst | FStar.BV.bv2list_bij | val bv2list_bij (#n: pos) (a: bv_t n)
: Lemma (requires (True)) (ensures (list2bv (bv2list #n a) = a)) | val bv2list_bij (#n: pos) (a: bv_t n)
: Lemma (requires (True)) (ensures (list2bv (bv2list #n a) = a)) | let bv2list_bij #n a = S.lemma_seq_list_bij a | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 49,
"start_col": 0,
"start_line": 49
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> FStar.Pervasives.Lemma (ensures FStar.BV.list2bv (FStar.BV.bv2list a) = a) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.Seq.Properties.lemma_seq_list_bij",
"Prims.bool",
"Prims.unit"
] | [] | true | false | true | false | false | let bv2list_bij #n a =
| S.lemma_seq_list_bij a | false |
FStar.BV.fst | FStar.BV.int2bv_logxor | val int2bv_logxor:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvxor #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (logxor #n x y) == z) | val int2bv_logxor:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvxor #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (logxor #n x y) == z) | let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 55,
"end_line": 57,
"start_col": 0,
"start_line": 56
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | pf: Prims.squash (FStar.BV.bvxor (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.logxor x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvxor",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_logxor #n #x #y #z pf =
| inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y)) | false |
FStar.BV.fst | FStar.BV.int2bv_lognot | val int2bv_lognot: #n: pos -> #x: uint_t n -> #z: bv_t n -> squash (bvnot #n (int2bv #n x) == z)
-> Lemma (int2bv #n (lognot #n x) == z) | val int2bv_lognot: #n: pos -> #x: uint_t n -> #z: bv_t n -> squash (bvnot #n (int2bv #n x) == z)
-> Lemma (int2bv #n (lognot #n x) == z) | let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 65,
"start_col": 0,
"start_line": 64
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | pf: Prims.squash (FStar.BV.bvnot (FStar.BV.int2bv x) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.lognot x) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvnot",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_lognot #n #x #y pf =
| inverse_vec_lemma #n (bvnot #n (int2bv x)) | false |
FStar.BV.fst | FStar.BV.bvnot | val bvnot (#n: pos) (a: bv_t n) : Tot (bv_t n) | val bvnot (#n: pos) (a: bv_t n) : Tot (bv_t n) | let bvnot = B.lognot_vec | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 63,
"start_col": 0,
"start_line": 63
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"FStar.BitVector.lognot_vec"
] | [] | false | false | false | false | false | let bvnot =
| B.lognot_vec | false |
FStar.BV.fst | FStar.BV.bv2list | val bv2list: #n: pos -> bv_t n -> Tot (l: list bool {List.length l = n}) | val bv2list: #n: pos -> bv_t n -> Tot (l: list bool {List.length l = n}) | let bv2list #n s = S.seq_to_list s | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 47,
"start_col": 0,
"start_line": 47
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | s: FStar.BV.bv_t n -> l: Prims.list Prims.bool {FStar.List.Tot.Base.length l = n} | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.Seq.Base.seq_to_list",
"Prims.bool",
"Prims.list",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.l_or",
"Prims.op_GreaterThanOrEqual",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length"
] | [] | false | false | false | false | false | let bv2list #n s =
| S.seq_to_list s | false |
FStar.BV.fst | FStar.BV.int2bv_logor | val int2bv_logor:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvor #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (logor #n x y) == z) | val int2bv_logor:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvor #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (logor #n x y) == z) | let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 61,
"start_col": 0,
"start_line": 60
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | pf: Prims.squash (FStar.BV.bvor (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.logor x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvor",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_logor #n #x #y #z pf =
| inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y)) | false |
FStar.BV.fst | FStar.BV.bvshl' | val bvshl' (#n: pos) (a: bv_t n) (s: bv_t n) : Tot (bv_t n) | val bvshl' (#n: pos) (a: bv_t n) (s: bv_t n) : Tot (bv_t n) | let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 69,
"start_col": 0,
"start_line": 68
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> s: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.BitVector.shift_left_vec",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvshl' (#n: pos) (a s: bv_t n) : bv_t n =
| B.shift_left_vec #n a (bv2int #n s) | false |
FStar.BV.fst | FStar.BV.int2bv_shr' | val int2bv_shr':
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshr' #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (shift_right #n x y) == z) | val int2bv_shr':
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshr' #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (shift_right #n x y) == z) | let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 84,
"start_col": 0,
"start_line": 83
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n = | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | pf: Prims.squash (FStar.BV.bvshr' (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.shift_right x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvshr'",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_shr' #n #x #y #z pf =
| inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y)) | false |
FStar.BV.fst | FStar.BV.bvshr' | val bvshr' (#n: pos) (a: bv_t n) (s: bv_t n) : Tot (bv_t n) | val bvshr' (#n: pos) (a: bv_t n) (s: bv_t n) : Tot (bv_t n) | let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 80,
"start_col": 0,
"start_line": 79
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> s: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.BitVector.shift_right_vec",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvshr' (#n: pos) (a s: bv_t n) : bv_t n =
| B.shift_right_vec #n a (bv2int #n s) | false |
FStar.BV.fst | FStar.BV.int2bv_shl' | val int2bv_shl':
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshl' #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (shift_left #n x y) == z) | val int2bv_shl':
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshl' #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (shift_left #n x y) == z) | let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 74,
"start_col": 0,
"start_line": 73
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | pf: Prims.squash (FStar.BV.bvshl' (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.shift_left x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvshl'",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_shl' #n #x #y #z pf =
| inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y)) | false |
FStar.BV.fst | FStar.BV.bvxor | val bvxor (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvxor (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvxor = B.logxor_vec | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 55,
"start_col": 0,
"start_line": 55
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"FStar.BitVector.logxor_vec"
] | [] | false | false | false | false | false | let bvxor =
| B.logxor_vec | false |
FStar.BV.fst | FStar.BV.bvshl | val bvshl (#n: pos) (a: bv_t n) (s: nat) : Tot (bv_t n) | val bvshl (#n: pos) (a: bv_t n) (s: nat) : Tot (bv_t n) | let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 71,
"start_col": 0,
"start_line": 70
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n = | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> s: Prims.nat -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"Prims.nat",
"FStar.BV.bvshl'",
"FStar.BV.int2bv_nat"
] | [] | false | false | false | false | false | let bvshl (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
| bvshl' #n a (int2bv_nat #n s) | false |
Vale.AES.PPC64LE.GF128_Mul.fst | Vale.AES.PPC64LE.GF128_Mul.va_lemma_Gf128MulRev128 | val va_lemma_Gf128MulRev128 : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128MulRev128 ()) va_s0 /\ va_get_ok va_s0))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let (a:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s0) in let
(b:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s0) in
Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_sM) == Vale.AES.GF128.gf128_mul_rev a b) /\
va_state_eq va_sM (va_update_vec 6 va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))))) | val va_lemma_Gf128MulRev128 : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128MulRev128 ()) va_s0 /\ va_get_ok va_s0))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let (a:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s0) in let
(b:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s0) in
Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_sM) == Vale.AES.GF128.gf128_mul_rev a b) /\
va_state_eq va_sM (va_update_vec 6 va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))))) | let va_lemma_Gf128MulRev128 va_b0 va_s0 =
let (va_mods:va_mods_t) = [va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_Gf128MulRev128 va_mods in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Gf128MulRev128 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 360 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ (let (a:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32
(va_get_vec 1 va_s0) in let (b:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32
(va_get_vec 2 va_s0) in label va_range1
"***** POSTCONDITION NOT MET AT line 370 column 45 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_sM) == Vale.AES.GF128.gf128_mul_rev a b))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM) | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Mul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 1109,
"start_col": 0,
"start_line": 1094
} | module Vale.AES.PPC64LE.GF128_Mul
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.TypesNative
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open Vale.AES.GF128
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.InsBasic
open Vale.PPC64LE.InsMem
open Vale.PPC64LE.InsVector
open Vale.PPC64LE.QuickCode
open Vale.PPC64LE.QuickCodes
open Vale.AES.PPC64LE.PolyOps
open Vale.AES.Types_helpers
open Vale.AES.GHash_BE
//-- ShiftLeft128_1
[@ "opaque_to_smt" va_qattr]
let va_code_ShiftLeft128_1 () =
(va_Block (va_CCons (va_code_Vspltisb (va_op_vec_opr_vec 2) 1) (va_CCons (va_code_Vsl
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2)) (va_CNil ()))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ShiftLeft128_1 () =
(va_pbool_and (va_codegen_success_Vspltisb (va_op_vec_opr_vec 2) 1) (va_pbool_and
(va_codegen_success_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2))
(va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ShiftLeft128_1 (va_mods:va_mods_t) (a:poly) : (va_quickCode unit
(va_code_ShiftLeft128_1 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 60 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisb (va_op_vec_opr_vec 2) 1) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 61 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> let (va_arg5:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 63 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_shift_left_1 va_arg5) (va_QEmpty (()))))))
[@"opaque_to_smt"]
let va_lemma_ShiftLeft128_1 va_b0 va_s0 a =
let (va_mods:va_mods_t) = [va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ShiftLeft128_1 va_mods a in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftLeft128_1 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 49 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 58 column 37 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.shift a 1))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_ShiftLeft128_1 a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftLeft128_1 (va_code_ShiftLeft128_1 ()) va_s0 a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_ok va_sM
va_s0))));
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- ShiftLeft2_128_1
val va_code_ShiftLeft2_128_1 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ShiftLeft2_128_1 () =
(va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0) 0) (va_CCons (va_code_LoadImm64
(va_op_reg_opr_reg 10) 31) (va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg
10)) (va_CCons (va_code_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_CCons (va_code_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0) (va_op_vec_opr_vec 3) 4)
(va_CCons (va_code_Vspltisb (va_op_vec_opr_vec 0) 1) (va_CCons (va_code_Vsl (va_op_vec_opr_vec
1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 0)) (va_CCons (va_code_Vsl (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_CCons (va_code_Vxor (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_CNil ())))))))))))
val va_codegen_success_ShiftLeft2_128_1 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ShiftLeft2_128_1 () =
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 0) 0) (va_pbool_and
(va_codegen_success_LoadImm64 (va_op_reg_opr_reg 10) 31) (va_pbool_and
(va_codegen_success_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_pbool_and
(va_codegen_success_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_pbool_and (va_codegen_success_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0)
(va_op_vec_opr_vec 3) 4) (va_pbool_and (va_codegen_success_Vspltisb (va_op_vec_opr_vec 0) 1)
(va_pbool_and (va_codegen_success_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 0)) (va_pbool_and (va_codegen_success_Vsl (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_pbool_and (va_codegen_success_Vxor
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_ttrue ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ShiftLeft2_128_1 (va_mods:va_mods_t) (lo:poly) (hi:poly) : (va_quickCode unit
(va_code_ShiftLeft2_128_1 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 83 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisw (va_op_vec_opr_vec 0) 0) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 84 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_LoadImm64 (va_op_reg_opr_reg 10) 31) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 85 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 86 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsrw (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 87 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsldoi (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 0) (va_op_vec_opr_vec 3) 4) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 88 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisb (va_op_vec_opr_vec 0) 1) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 89 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 0)) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 90 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsl (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 0)) (va_QBind
va_range1
"***** PRECONDITION NOT MET AT line 91 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vxor (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (fun
(va_s:va_state) _ -> let (l:(Vale.Def.Words_s.four Vale.Def.Words_s.nat32)) =
Vale.Def.Words.Four_s.four_map #nat32 #Vale.Def.Words_s.nat32 (fun (i:nat32) ->
Vale.Arch.Types.ishl32 i 1) (va_get_vec 2 va_old_s) in let (r:(Vale.Def.Words_s.four
Vale.Def.Words_s.nat32)) = Vale.Def.Words.Four_s.four_map #nat32 #Vale.Def.Words_s.nat32 (fun
(i:nat32) -> Vale.Arch.Types.ishr32 i 31) (va_get_vec 2 va_old_s) in let
(va_arg22:Vale.Def.Types_s.quad32) = va_get_vec 3 va_s in let
(va_arg21:Vale.Def.Types_s.quad32) = Vale.Def.Words_s.Mkfour #Vale.Def.Types_s.nat32 0
(Vale.Def.Words_s.__proj__Mkfour__item__lo0 r) (Vale.Def.Words_s.__proj__Mkfour__item__lo1 r)
(Vale.Def.Words_s.__proj__Mkfour__item__hi2 r) in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 95 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Arch.TypesNative.lemma_quad32_xor_commutes va_arg21 va_arg22) (let
(va_arg20:Vale.Def.Types_s.quad32) = va_get_vec 3 va_s in let
(va_arg19:Vale.Def.Types_s.quad32) = Vale.Def.Words_s.Mkfour #Vale.Def.Types_s.nat32 0
(Vale.Def.Words_s.__proj__Mkfour__item__lo0 r) (Vale.Def.Words_s.__proj__Mkfour__item__lo1 r)
(Vale.Def.Words_s.__proj__Mkfour__item__hi2 r) in let (va_arg18:Vale.Def.Types_s.quad32) = l in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 96 column 32 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Arch.TypesNative.lemma_quad32_xor_associates va_arg18 va_arg19 va_arg20)
(let (va_arg17:Vale.Math.Poly2_s.poly) = hi in let (va_arg16:Vale.Math.Poly2_s.poly) = lo in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 98 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_shift_2_left_1 va_arg16 va_arg17) (va_QEmpty
(())))))))))))))))
val va_lemma_ShiftLeft2_128_1 : va_b0:va_code -> va_s0:va_state -> lo:poly -> hi:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ShiftLeft2_128_1 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree hi < 127 /\ Vale.Math.Poly2_s.degree lo <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 hi))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let n = Vale.Math.Poly2_s.monomial 128 in let a = Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul
hi n) lo in let b = Vale.Math.Poly2_s.shift a 1 in va_get_vec 1 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n) /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)) /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))
[@"opaque_to_smt"]
let va_lemma_ShiftLeft2_128_1 va_b0 va_s0 lo hi =
let (va_mods:va_mods_t) = [va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10;
va_Mod_ok] in
let va_qc = va_qcode_ShiftLeft2_128_1 va_mods lo hi in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftLeft2_128_1 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 66 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 77 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let n = Vale.Math.Poly2_s.monomial 128 in label va_range1
"***** POSTCONDITION NOT MET AT line 78 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let a = Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul hi n) lo in label va_range1
"***** POSTCONDITION NOT MET AT line 79 column 9 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(let b = Vale.Math.Poly2_s.shift a 1 in label va_range1
"***** POSTCONDITION NOT MET AT line 80 column 35 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n)) /\ label
va_range1
"***** POSTCONDITION NOT MET AT line 81 column 35 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)))))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10;
va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_ShiftLeft2_128_1 (lo:poly) (hi:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0))
: Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree hi < 127 /\ Vale.Math.Poly2_s.degree lo <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 hi /\ (forall (va_x_r10:nat64) (va_x_v0:quad32)
(va_x_v1:quad32) (va_x_v2:quad32) (va_x_v3:quad32) . let va_sM = va_upd_vec 3 va_x_v3
(va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1 (va_upd_vec 0 va_x_v0 (va_upd_reg 10 va_x_r10
va_s0)))) in va_get_ok va_sM /\ (let n = Vale.Math.Poly2_s.monomial 128 in let a =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul hi n) lo in let b = Vale.Math.Poly2_s.shift a 1 in
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mod b n) /\
va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.div b n)) ==> va_k
va_sM (())))
val va_wpProof_ShiftLeft2_128_1 : lo:poly -> hi:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ShiftLeft2_128_1 lo hi va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ShiftLeft2_128_1 ()) ([va_Mod_vec 3;
va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ShiftLeft2_128_1 lo hi va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftLeft2_128_1 (va_code_ShiftLeft2_128_1 ()) va_s0 lo hi in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM
(va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM va_s0)))))));
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10])
va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ShiftLeft2_128_1 (lo:poly) (hi:poly) : (va_quickCode unit (va_code_ShiftLeft2_128_1
())) =
(va_QProc (va_code_ShiftLeft2_128_1 ()) ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0;
va_Mod_reg 10]) (va_wp_ShiftLeft2_128_1 lo hi) (va_wpProof_ShiftLeft2_128_1 lo hi))
//--
//-- ClmulRev64High
val va_code_ClmulRev64High : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ClmulRev64High () =
(va_Block (va_CCons (va_code_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_ShiftLeft128_1 ()) (va_CNil ()))))
val va_codegen_success_ClmulRev64High : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ClmulRev64High () =
(va_pbool_and (va_codegen_success_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_ShiftLeft128_1 ()) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ClmulRev64High (va_mods:va_mods_t) (a:poly) (b:poly) : (va_quickCode unit
(va_code_ClmulRev64High ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(va_arg18:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 116 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg18) (let
(va_arg17:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 117 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg17) (let
(va_arg16:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 118 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg16 64) (let
(va_arg15:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 119 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg15 64) (let
(va_arg14:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 120 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg14 64) (let
(va_arg13:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 121 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg13 64) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 122 column 17 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 2))
(va_QBind va_range1
"***** PRECONDITION NOT MET AT line 123 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ShiftLeft128_1 (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.reverse a 63)
(Vale.Math.Poly2_s.reverse b 63))) (fun (va_s:va_state) _ -> let
(va_arg12:Vale.Math.Poly2_s.poly) = b in let (va_arg11:Vale.Math.Poly2_s.poly) = a in va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 125 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_reverse_shift_1 va_arg11 va_arg12 63)
(va_QEmpty (()))))))))))))
val va_lemma_ClmulRev64High : va_b0:va_code -> va_s0:va_state -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ClmulRev64High ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 63 /\ Vale.Math.Poly2_s.degree b <= 63 /\
Vale.Math.Poly2_s.reverse a 63 == Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_hi (va_get_vec 1 va_s0)) /\ Vale.Math.Poly2_s.reverse b 63 ==
Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_hi (va_get_vec 2 va_s0)) /\
l_or (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo (va_get_vec 1
va_s0)) == zero) (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo
(va_get_vec 2 va_s0)) == zero)))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.Math.Poly2_s.mul a b) 127) /\ va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1
va_sM (va_update_ok va_sM va_s0)))))
[@"opaque_to_smt"]
let va_lemma_ClmulRev64High va_b0 va_s0 a b =
let (va_mods:va_mods_t) = [va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ClmulRev64High va_mods a b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ClmulRev64High ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 101 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 114 column 49 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.Math.Poly2_s.mul a b) 127))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@ va_qattr]
let va_wp_ClmulRev64High (a:poly) (b:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) :
Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree a <= 63 /\ Vale.Math.Poly2_s.degree b <= 63 /\
Vale.Math.Poly2_s.reverse a 63 == Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_hi (va_get_vec 1 va_s0)) /\ Vale.Math.Poly2_s.reverse b 63 ==
Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_hi (va_get_vec 2 va_s0)) /\
l_or (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo (va_get_vec 1
va_s0)) == zero) (Vale.Math.Poly2.Bits_s.of_double32 (Vale.Arch.Types.quad32_double_lo
(va_get_vec 2 va_s0)) == zero) /\ (forall (va_x_v1:quad32) (va_x_v2:quad32) . let va_sM =
va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1 va_s0) in va_get_ok va_sM /\ va_get_vec 1 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul a b) 127)
==> va_k va_sM (())))
val va_wpProof_ClmulRev64High : a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ClmulRev64High a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ClmulRev64High ()) ([va_Mod_vec 2;
va_Mod_vec 1]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ClmulRev64High a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ClmulRev64High (va_code_ClmulRev64High ()) va_s0 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_ok va_sM
va_s0))));
va_lemma_norm_mods ([va_Mod_vec 2; va_Mod_vec 1]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ClmulRev64High (a:poly) (b:poly) : (va_quickCode unit (va_code_ClmulRev64High ())) =
(va_QProc (va_code_ClmulRev64High ()) ([va_Mod_vec 2; va_Mod_vec 1]) (va_wp_ClmulRev64High a b)
(va_wpProof_ClmulRev64High a b))
//--
//-- High64ToLow
[@ "opaque_to_smt"]
let va_code_High64ToLow dst src =
(va_Block (va_CCons (va_code_Vsldoi dst (va_op_vec_opr_vec 0) src 8) (va_CNil ())))
[@ "opaque_to_smt"]
let va_codegen_success_High64ToLow dst src =
(va_pbool_and (va_codegen_success_Vsldoi dst (va_op_vec_opr_vec 0) src 8) (va_ttrue ()))
[@"opaque_to_smt"]
let va_lemma_High64ToLow va_b0 va_s0 dst src a =
va_reveal_opaque (`%va_code_High64ToLow) (va_code_High64ToLow dst src);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let (va_s2, va_fc2) = va_lemma_Vsldoi (va_hd va_b1) va_s0 dst (va_op_vec_opr_vec 0) src 8 in
let va_b2 = va_tl va_b1 in
Vale.Math.Poly2.Words.lemma_quad32_double_shift a;
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_High64ToLow dst src a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_High64ToLow (va_code_High64ToLow dst src) va_s0 dst src a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- Low64ToHigh
[@ "opaque_to_smt" va_qattr]
let va_code_Low64ToHigh dst src =
(va_Block (va_CCons (va_code_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (va_CNil ())))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Low64ToHigh dst src =
(va_pbool_and (va_codegen_success_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (va_ttrue ()))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Low64ToHigh (va_mods:va_mods_t) (dst:vec_opr) (src:vec_opr) (a:poly) : (va_quickCode
unit (va_code_Low64ToHigh dst src)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 156 column 11 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vsldoi dst src (va_op_vec_opr_vec 0) 8) (fun (va_s:va_state) _ -> let
(va_arg4:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 157 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Words.lemma_quad32_double_shift va_arg4) (va_QEmpty (())))))
[@"opaque_to_smt"]
let va_lemma_Low64ToHigh va_b0 va_s0 dst src a =
let (va_mods:va_mods_t) = [va_Mod_ok; va_mod_vec_opr dst] in
let va_qc = va_qcode_Low64ToHigh va_mods dst src a in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Low64ToHigh dst src) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 144 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 154 column 66 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod a (Vale.Math.Poly2_s.monomial 64)) (Vale.Math.Poly2_s.monomial 64)))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_ok; va_mod_vec_opr dst]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_Low64ToHigh dst src a va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Low64ToHigh (va_code_Low64ToHigh dst src) va_s0 dst src a in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- AddPoly
val va_code_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr -> src2:va_operand_vec_opr
-> Tot va_code
[@ "opaque_to_smt"]
let va_code_AddPoly dst src1 src2 =
(va_Block (va_CCons (va_code_Vxor dst src1 src2) (va_CNil ())))
val va_codegen_success_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr ->
src2:va_operand_vec_opr -> Tot va_pbool
[@ "opaque_to_smt"]
let va_codegen_success_AddPoly dst src1 src2 =
(va_pbool_and (va_codegen_success_Vxor dst src1 src2) (va_ttrue ()))
val va_lemma_AddPoly : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr ->
src1:va_operand_vec_opr -> src2:va_operand_vec_opr -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AddPoly dst src1 src2) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_is_src_vec_opr src1 va_s0 /\ va_is_src_vec_opr src2 va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\ va_eval_vec_opr va_s0
src1 == Vale.Math.Poly2.Bits_s.to_quad32 a /\ va_eval_vec_opr va_s0 src2 ==
Vale.Math.Poly2.Bits_s.to_quad32 b))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add a b) /\
va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0))))
[@"opaque_to_smt"]
let va_lemma_AddPoly va_b0 va_s0 dst src1 src2 a b =
va_reveal_opaque (`%va_code_AddPoly) (va_code_AddPoly dst src1 src2);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let (va_s2, va_fc2) = va_lemma_Vxor (va_hd va_b1) va_s0 dst src1 src2 in
let va_b2 = va_tl va_b1 in
Vale.Math.Poly2.Words.lemma_add128 a b;
let (va_sM, va_f2) = va_lemma_empty_total va_s2 va_b2 in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc2 va_s2 va_f2 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_AddPoly (dst:va_operand_vec_opr) (src1:va_operand_vec_opr) (src2:va_operand_vec_opr)
(a:poly) (b:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_is_dst_vec_opr dst va_s0 /\ va_is_src_vec_opr src1 va_s0 /\ va_is_src_vec_opr src2 va_s0 /\
va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\
va_eval_vec_opr va_s0 src1 == Vale.Math.Poly2.Bits_s.to_quad32 a /\ va_eval_vec_opr va_s0 src2
== Vale.Math.Poly2.Bits_s.to_quad32 b /\ (forall (va_x_dst:va_value_vec_opr) . let va_sM =
va_upd_operand_vec_opr dst va_x_dst va_s0 in va_get_ok va_sM /\ va_eval_vec_opr va_sM dst ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add a b) ==> va_k va_sM (())))
val va_wpProof_AddPoly : dst:va_operand_vec_opr -> src1:va_operand_vec_opr ->
src2:va_operand_vec_opr -> a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AddPoly dst src1 src2 a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AddPoly dst src1 src2)
([va_mod_vec_opr dst]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_AddPoly dst src1 src2 a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AddPoly (va_code_AddPoly dst src1 src2) va_s0 dst src1 src2 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_ok va_sM (va_update_operand_vec_opr dst va_sM va_s0)));
va_lemma_norm_mods ([va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_AddPoly (dst:va_operand_vec_opr) (src1:va_operand_vec_opr) (src2:va_operand_vec_opr)
(a:poly) (b:poly) : (va_quickCode unit (va_code_AddPoly dst src1 src2)) =
(va_QProc (va_code_AddPoly dst src1 src2) ([va_mod_vec_opr dst]) (va_wp_AddPoly dst src1 src2 a
b) (va_wpProof_AddPoly dst src1 src2 a b))
//--
//-- Clmul128
val va_code_Clmul128 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_Clmul128 () =
(va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0) 0) (va_CCons (va_code_VSwap
(va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (va_CCons (va_code_High64ToLow (va_op_vec_opr_vec
4) (va_op_vec_opr_vec 3)) (va_CCons (va_code_Low64ToHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 3)) (va_CCons (va_code_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec
4) (va_op_vec_opr_vec 2)) (va_CCons (va_code_VPolyMulHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_CCons (va_code_Low64ToHigh (va_op_vec_opr_vec
1) (va_op_vec_opr_vec 3)) (va_CCons (va_code_High64ToLow (va_op_vec_opr_vec 2)
(va_op_vec_opr_vec 3)) (va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1)
(va_op_vec_opr_vec 4)) (va_CCons (va_code_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 2)) (va_CNil ())))))))))))))
val va_codegen_success_Clmul128 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Clmul128 () =
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 0) 0) (va_pbool_and
(va_codegen_success_VSwap (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (va_pbool_and
(va_codegen_success_High64ToLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 3)) (va_pbool_and
(va_codegen_success_Low64ToHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 3)) (va_pbool_and
(va_codegen_success_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 2))
(va_pbool_and (va_codegen_success_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 4)
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_VPolyMulHigh (va_op_vec_opr_vec 5)
(va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_Low64ToHigh
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_pbool_and (va_codegen_success_High64ToLow
(va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3)) (va_pbool_and (va_codegen_success_AddPoly
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 4)) (va_pbool_and
(va_codegen_success_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2))
(va_ttrue ()))))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Clmul128 (va_mods:va_mods_t) (ab:poly) (cd:poly) : (va_quickCode (poly & poly)
(va_code_Clmul128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(n:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.monomial 64 in let (a:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.div ab n in let (b:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ab n in
let (c:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div cd n in let (d:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.mod cd n in let (ac:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul a c in
let (ad:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul a d in let (bc:Vale.Math.Poly2_s.poly)
= Vale.Math.Poly2_s.mul b c in let (bd:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul b d in
let (ab_sw:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.swap ab 64 in let
(ab_hi:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ab n in let
(ab_lo:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.div ab n) n in let
(va_arg77:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 202 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg77) (let
(va_arg76:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 203 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double va_arg76) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 205 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vspltisw (va_op_vec_opr_vec 0) 0) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 206 column 10 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VSwap (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 1)) (fun (va_s:va_state) _ -> let
(va_arg75:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 207 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg75) (let
(va_arg74:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 208 column 29 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Words.lemma_quad32_double_swap va_arg74) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 209 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_quad32_double ab_sw) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 210 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_High64ToLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 3) ab_sw) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 211 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Low64ToHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 3) ab_sw) (fun (va_s:va_state) _
-> va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 212 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 4 va_s == Vale.Math.Poly2.Bits_s.to_quad32 ab_hi) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 213 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 5 va_s == Vale.Math.Poly2.Bits_s.to_quad32 ab_lo) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 215 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMul (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 217 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 ab_hi) (let
(va_arg73:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ab_hi n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 218 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_degree_negative va_arg73) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 219 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_hi 64) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 220 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulLow (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 4) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 222 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 ab_lo) (let
(va_arg72:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ab n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 223 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_div_mod_exact va_arg72 n) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 224 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_lo 64) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 225 column 17 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_VPolyMulHigh (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (fun
(va_s:va_state) _ -> let (va_arg71:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 227 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg71) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 228 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_sw 64) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 229 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_sw 64) (let
(va_arg70:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 230 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod va_arg70 64) (let
(va_arg69:Vale.Math.Poly2_s.poly) = cd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 231 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div va_arg69 64) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 232 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s) == Vale.Math.Poly2_s.add ad bc) (va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 234 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mask_is_mod ab_hi 64) (let
(va_arg68:Vale.Math.Poly2_s.poly) = ab in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 235 column 18 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mod_mod va_arg68 n) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 236 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 4 va_s) == bd) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 238 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_shift_is_div ab_lo 64) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 239 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 5 va_s) == ac) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 241 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Low64ToHigh (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3) (Vale.Math.Poly2_s.add ad
bc)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 242 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mod_distribute ad bc n) (let
(va_arg67:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod bc n in let
(va_arg66:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod ad n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 243 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_distribute_left va_arg66 va_arg67 n)
(va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 244 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_s == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n) (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod bc n) n))) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 246 column 16 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_High64ToLow (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 3) (Vale.Math.Poly2_s.add ad
bc)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 247 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GHash_BE.lemma_div_distribute ad bc n) (va_qAssert va_range1
"***** PRECONDITION NOT MET AT line 248 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_s == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.div ad n) (Vale.Math.Poly2_s.div bc n))) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 250 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 4)
(Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n)
(Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod bc n) n)) bd) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 251 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 2) (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2) ac
(Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.div ad n) (Vale.Math.Poly2_s.div bc n))) (fun
(va_s:va_state) _ -> let (va_arg65:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div bc n in let
(va_arg64:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ad n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 253 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_commute va_arg64 va_arg65) (let
(va_arg63:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div ad n in let
(va_arg62:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.div bc n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 254 column 24 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_associate ac va_arg62 va_arg63) (let (hi:poly) =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.add ac (Vale.Math.Poly2_s.div bc n))
(Vale.Math.Poly2_s.div ad n) in let (va_arg61:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod bc n) n in let (va_arg60:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.mod ad n) n in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 256 column 22 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.lemma_add_commute va_arg60 va_arg61) (let (lo:poly) =
Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod bc
n) n) (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.mod ad n) n)) bd in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 259 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_mul a b c d 64) (va_QEmpty ((lo,
hi))))))))))))))))))))))))))))))))))))))))))))))))
val va_lemma_Clmul128 : va_b0:va_code -> va_s0:va_state -> ab:poly -> cd:poly
-> Ghost (va_state & va_fuel & poly & poly)
(requires (va_require_total va_b0 (va_code_Clmul128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 ab /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 cd))
(ensures (fun (va_sM, va_fM, lo, hi) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok
va_sM /\ Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi < 127 /\
Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 hi /\ va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec
4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0
va_sM (va_update_ok va_sM va_s0)))))))))
[@"opaque_to_smt"]
let va_lemma_Clmul128 va_b0 va_s0 ab cd =
let (va_mods:va_mods_t) = [va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_ok] in
let va_qc = va_qcode_Clmul128 va_mods ab cd in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Clmul128 ()) va_qc va_s0 (fun va_s0
va_sM va_g -> let (lo, hi) = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 174 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 184 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree lo <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 185 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree hi < 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 186 column 47 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo) /\
label va_range1
"***** POSTCONDITION NOT MET AT line 187 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 188 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_ok]) va_sM va_s0;
let (lo, hi) = va_g in
(va_sM, va_fM, lo, hi)
[@ va_qattr]
let va_wp_Clmul128 (ab:poly) (cd:poly) (va_s0:va_state) (va_k:(va_state -> (poly & poly) -> Type0))
: Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 ab /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 cd /\ (forall (va_x_v0:quad32) (va_x_v1:quad32)
(va_x_v2:quad32) (va_x_v3:quad32) (va_x_v4:quad32) (va_x_v5:quad32) (lo:poly) (hi:poly) . let
va_sM = va_upd_vec 5 va_x_v5 (va_upd_vec 4 va_x_v4 (va_upd_vec 3 va_x_v3 (va_upd_vec 2 va_x_v2
(va_upd_vec 1 va_x_v1 (va_upd_vec 0 va_x_v0 va_s0))))) in va_get_ok va_sM /\
Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi < 127 /\
Vale.Math.Poly2_s.mul ab cd == Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo /\
va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo /\ va_get_vec 2 va_sM ==
Vale.Math.Poly2.Bits_s.to_quad32 hi ==> va_k va_sM ((lo, hi))))
val va_wpProof_Clmul128 : ab:poly -> cd:poly -> va_s0:va_state -> va_k:(va_state -> (poly & poly)
-> Type0)
-> Ghost (va_state & va_fuel & (poly & poly))
(requires (va_t_require va_s0 /\ va_wp_Clmul128 ab cd va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Clmul128 ()) ([va_Mod_vec 5;
va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0]) va_s0 va_k ((va_sM,
va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_Clmul128 ab cd va_s0 va_k =
let (va_sM, va_f0, lo, hi) = va_lemma_Clmul128 (va_code_Clmul128 ()) va_s0 ab cd in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM
(va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_ok va_sM
va_s0))))))));
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0]) va_sM va_s0;
let va_g = (lo, hi) in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_Clmul128 (ab:poly) (cd:poly) : (va_quickCode (poly & poly) (va_code_Clmul128 ())) =
(va_QProc (va_code_Clmul128 ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0]) (va_wp_Clmul128 ab cd) (va_wpProof_Clmul128 ab cd))
//--
//-- ClmulRev128
val va_code_ClmulRev128 : va_dummy:unit -> Tot va_code
[@ "opaque_to_smt" va_qattr]
let va_code_ClmulRev128 () =
(va_Block (va_CCons (va_code_Clmul128 ()) (va_CCons (va_code_ShiftLeft2_128_1 ()) (va_CNil ()))))
val va_codegen_success_ClmulRev128 : va_dummy:unit -> Tot va_pbool
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ClmulRev128 () =
(va_pbool_and (va_codegen_success_Clmul128 ()) (va_pbool_and (va_codegen_success_ShiftLeft2_128_1
()) (va_ttrue ())))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ClmulRev128 (va_mods:va_mods_t) (ab:poly) (cd:poly) : (va_quickCode (poly & poly)
(va_code_ClmulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 279 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Clmul128 (Vale.Math.Poly2_s.reverse ab 127) (Vale.Math.Poly2_s.reverse cd 127)) (fun
(va_s:va_state) va_g -> let (lo, hi) = va_g in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 280 column 21 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ShiftLeft2_128_1 lo hi) (fun (va_s:va_state) _ -> let (m:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.shift (Vale.Math.Poly2_s.add (Vale.Math.Poly2_s.shift hi 128) lo) 1 in let
(va_arg13:Vale.Math.Poly2_s.poly) = lo in let (va_arg12:Vale.Math.Poly2_s.poly) = hi in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 283 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg12 va_arg13 128) (va_qPURE
va_range1
"***** PRECONDITION NOT MET AT line 284 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_split_define m 128) (let (lo:poly) =
Vale.Math.Poly2_s.mod m (Vale.Math.Poly2_s.monomial 128) in let (hi:poly) =
Vale.Math.Poly2_s.div m (Vale.Math.Poly2_s.monomial 128) in let
(va_arg11:Vale.Math.Poly2_s.poly) = cd in let (va_arg10:Vale.Math.Poly2_s.poly) = ab in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 287 column 30 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_mul_reverse_shift_1 va_arg10 va_arg11 127)
(va_QEmpty ((lo, hi)))))))))
val va_lemma_ClmulRev128 : va_b0:va_code -> va_s0:va_state -> ab:poly -> cd:poly
-> Ghost (va_state & va_fuel & poly & poly)
(requires (va_require_total va_b0 (va_code_ClmulRev128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\ va_get_vec 1 va_s0
== Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse ab 127) /\ va_get_vec 2 va_s0 ==
Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse cd 127)))
(ensures (fun (va_sM, va_fM, lo, hi) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok
va_sM /\ Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi <= 127 /\
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo /\ va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32
lo /\ va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi /\ va_state_eq va_sM
(va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM
(va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM
va_s0))))))))))
[@"opaque_to_smt"]
let va_lemma_ClmulRev128 va_b0 va_s0 ab cd =
let (va_mods:va_mods_t) = [va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_ClmulRev128 va_mods ab cd in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ClmulRev128 ()) va_qc va_s0 (fun va_s0
va_sM va_g -> let (lo, hi) = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 262 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 273 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree lo <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 274 column 26 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.degree hi <= 127) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 275 column 61 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 276 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 lo) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 277 column 28 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi)) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok]) va_sM va_s0;
let (lo, hi) = va_g in
(va_sM, va_fM, lo, hi)
[@ va_qattr]
let va_wp_ClmulRev128 (ab:poly) (cd:poly) (va_s0:va_state) (va_k:(va_state -> (poly & poly) ->
Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.Math.Poly2_s.degree ab <= 127 /\ Vale.Math.Poly2_s.degree cd <= 127 /\
va_get_vec 1 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse ab 127) /\
va_get_vec 2 va_s0 == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse cd 127) /\
(forall (va_x_r10:nat64) (va_x_v0:quad32) (va_x_v1:quad32) (va_x_v2:quad32) (va_x_v3:quad32)
(va_x_v4:quad32) (va_x_v5:quad32) (lo:poly) (hi:poly) . let va_sM = va_upd_vec 5 va_x_v5
(va_upd_vec 4 va_x_v4 (va_upd_vec 3 va_x_v3 (va_upd_vec 2 va_x_v2 (va_upd_vec 1 va_x_v1
(va_upd_vec 0 va_x_v0 (va_upd_reg 10 va_x_r10 va_s0)))))) in va_get_ok va_sM /\
Vale.Math.Poly2_s.degree lo <= 127 /\ Vale.Math.Poly2_s.degree hi <= 127 /\
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul ab cd) 255 == Vale.Math.Poly2_s.add
(Vale.Math.Poly2_s.shift hi 128) lo /\ va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32
lo /\ va_get_vec 2 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 hi ==> va_k va_sM ((lo, hi))))
val va_wpProof_ClmulRev128 : ab:poly -> cd:poly -> va_s0:va_state -> va_k:(va_state -> (poly &
poly) -> Type0)
-> Ghost (va_state & va_fuel & (poly & poly))
(requires (va_t_require va_s0 /\ va_wp_ClmulRev128 ab cd va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ClmulRev128 ()) ([va_Mod_vec 5;
va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_s0
va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_ClmulRev128 ab cd va_s0 va_k =
let (va_sM, va_f0, lo, hi) = va_lemma_ClmulRev128 (va_code_ClmulRev128 ()) va_s0 ab cd in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM
(va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM (va_update_reg 10 va_sM
(va_update_ok va_sM va_s0)))))))));
va_lemma_norm_mods ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10]) va_sM va_s0;
let va_g = (lo, hi) in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_ClmulRev128 (ab:poly) (cd:poly) : (va_quickCode (poly & poly) (va_code_ClmulRev128
())) =
(va_QProc (va_code_ClmulRev128 ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) (va_wp_ClmulRev128 ab cd) (va_wpProof_ClmulRev128
ab cd))
//--
//-- Gf128ModulusRev
val va_code_Gf128ModulusRev : dst:va_operand_vec_opr -> Tot va_code
[@ "opaque_to_smt"]
let va_code_Gf128ModulusRev dst =
(va_Block (va_CCons (va_code_Vxor dst dst dst) (va_CCons (va_code_LoadImmShl64 (va_op_reg_opr_reg
10) (-7936)) (va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_CCons
(va_code_Vsldoi dst (va_op_vec_opr_vec 3) dst 12) (va_CNil ()))))))
val va_codegen_success_Gf128ModulusRev : dst:va_operand_vec_opr -> Tot va_pbool
[@ "opaque_to_smt"]
let va_codegen_success_Gf128ModulusRev dst =
(va_pbool_and (va_codegen_success_Vxor dst dst dst) (va_pbool_and
(va_codegen_success_LoadImmShl64 (va_op_reg_opr_reg 10) (-7936)) (va_pbool_and
(va_codegen_success_Mtvsrws (va_op_vec_opr_vec 3) (va_op_reg_opr_reg 10)) (va_pbool_and
(va_codegen_success_Vsldoi dst (va_op_vec_opr_vec 3) dst 12) (va_ttrue ())))))
val va_lemma_Gf128ModulusRev : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128ModulusRev dst) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_get_ok va_s0 /\ dst =!= 3))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) /\ Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_lo (va_eval_vec_opr va_sM dst)) == zero /\ va_state_eq va_sM
(va_update_vec 3 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM (va_update_operand_vec_opr
dst va_sM va_s0))))))
[@"opaque_to_smt"]
let va_lemma_Gf128ModulusRev va_b0 va_s0 dst =
va_reveal_opaque (`%va_code_Gf128ModulusRev) (va_code_Gf128ModulusRev dst);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
Vale.AES.GF128.lemma_gf128_constant_rev (va_eval_vec_opr va_s0 dst);
let (va_s3, va_fc3) = va_lemma_Vxor (va_hd va_b1) va_s0 dst dst dst in
let va_b3 = va_tl va_b1 in
let (va_s4, va_fc4) = va_lemma_LoadImmShl64 (va_hd va_b3) va_s3 (va_op_reg_opr_reg 10) (-7936) in
let va_b4 = va_tl va_b3 in
Vale.AES.Types_helpers.lemma_ishl_64 ((-7936) `op_Modulus` pow2_64) 16;
let (va_s6, va_fc6) = va_lemma_Mtvsrws (va_hd va_b4) va_s4 (va_op_vec_opr_vec 3)
(va_op_reg_opr_reg 10) in
let va_b6 = va_tl va_b4 in
let (va_s7, va_fc7) = va_lemma_Vsldoi (va_hd va_b6) va_s6 dst (va_op_vec_opr_vec 3) dst 12 in
let va_b7 = va_tl va_b6 in
Vale.Math.Poly2.Lemmas.lemma_split_define (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127)
64;
Vale.Math.Poly2.Lemmas.lemma_index_all ();
Vale.Math.Poly2.Lemmas.lemma_reverse_define_all ();
Vale.Math.Poly2.lemma_equal (Vale.Math.Poly2_s.mod (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) (Vale.Math.Poly2_s.monomial 64)) zero;
Vale.Math.Poly2.Bits.lemma_quad32_double (Vale.Math.Poly2_s.reverse gf128_modulus_low_terms 127);
let (va_sM, va_f7) = va_lemma_empty_total va_s7 va_b7 in
let va_f6 = va_lemma_merge_total va_b6 va_s6 va_fc7 va_s7 va_f7 va_sM in
let va_f4 = va_lemma_merge_total va_b4 va_s4 va_fc6 va_s6 va_f6 va_sM in
let va_f3 = va_lemma_merge_total va_b3 va_s3 va_fc4 va_s4 va_f4 va_sM in
let va_fM = va_lemma_merge_total va_b1 va_s0 va_fc3 va_s3 va_f3 va_sM in
(va_sM, va_fM)
[@ va_qattr]
let va_wp_Gf128ModulusRev (dst:va_operand_vec_opr) (va_s0:va_state) (va_k:(va_state -> unit ->
Type0)) : Type0 =
(va_is_dst_vec_opr dst va_s0 /\ va_get_ok va_s0 /\ dst =!= 3 /\ (forall
(va_x_dst:va_value_vec_opr) (va_x_r10:nat64) (va_x_v3:quad32) . let va_sM = va_upd_vec 3
va_x_v3 (va_upd_reg 10 va_x_r10 (va_upd_operand_vec_opr dst va_x_dst va_s0)) in va_get_ok va_sM
/\ va_eval_vec_opr va_sM dst == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
gf128_modulus_low_terms 127) /\ Vale.Math.Poly2.Bits_s.of_double32
(Vale.Arch.Types.quad32_double_lo (va_eval_vec_opr va_sM dst)) == zero ==> va_k va_sM (())))
val va_wpProof_Gf128ModulusRev : dst:va_operand_vec_opr -> va_s0:va_state -> va_k:(va_state -> unit
-> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Gf128ModulusRev dst va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Gf128ModulusRev dst) ([va_Mod_vec 3;
va_Mod_reg 10; va_mod_vec_opr dst]) va_s0 va_k ((va_sM, va_f0, va_g))))
[@"opaque_to_smt"]
let va_wpProof_Gf128ModulusRev dst va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Gf128ModulusRev (va_code_Gf128ModulusRev dst) va_s0 dst in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 3 va_sM (va_update_reg 10 va_sM (va_update_ok va_sM
(va_update_operand_vec_opr dst va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_reg 10; va_mod_vec_opr dst]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
[@ "opaque_to_smt" va_qattr]
let va_quick_Gf128ModulusRev (dst:va_operand_vec_opr) : (va_quickCode unit (va_code_Gf128ModulusRev
dst)) =
(va_QProc (va_code_Gf128ModulusRev dst) ([va_Mod_vec 3; va_Mod_reg 10; va_mod_vec_opr dst])
(va_wp_Gf128ModulusRev dst) (va_wpProof_Gf128ModulusRev dst))
//--
//-- ReduceMulRev128
[@ "opaque_to_smt" va_qattr]
let va_code_ReduceMulRev128 () =
(va_Block (va_CCons (va_code_ClmulRev128 ()) (va_CCons (va_code_Vmr (va_op_vec_opr_vec 6)
(va_op_vec_opr_vec 2)) (va_CCons (va_code_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_CCons
(va_code_ClmulRev128 ()) (va_CCons (va_code_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2))
(va_CCons (va_code_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_CCons (va_code_ClmulRev64High ())
(va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5))
(va_CCons (va_code_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6))
(va_CNil ())))))))))))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_ReduceMulRev128 () =
(va_pbool_and (va_codegen_success_ClmulRev128 ()) (va_pbool_and (va_codegen_success_Vmr
(va_op_vec_opr_vec 6) (va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_Gf128ModulusRev
(va_op_vec_opr_vec 2)) (va_pbool_and (va_codegen_success_ClmulRev128 ()) (va_pbool_and
(va_codegen_success_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_pbool_and
(va_codegen_success_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_pbool_and
(va_codegen_success_ClmulRev64High ()) (va_pbool_and (va_codegen_success_AddPoly
(va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5)) (va_pbool_and
(va_codegen_success_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6))
(va_ttrue ()))))))))))
[@ "opaque_to_smt" va_qattr]
let va_qcode_ReduceMulRev128 (va_mods:va_mods_t) (a:poly) (b:poly) : (va_quickCode unit
(va_code_ReduceMulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 329 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_degree ()) (let (va_arg31:Vale.Math.Poly2_s.poly) =
b in let (va_arg30:Vale.Math.Poly2_s.poly) = a in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 330 column 27 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_gf128_reduce_rev va_arg30 va_arg31
gf128_modulus_low_terms 128) (let (m:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.monomial 128
in let (h:Vale.Math.Poly2_s.poly) = gf128_modulus_low_terms in let (ab:Vale.Math.Poly2_s.poly)
= Vale.Math.Poly2_s.mul a b in let (rh:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse h
127 in let (rab:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse ab 255 in let
(rd:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod rab m in let (rdh:Vale.Math.Poly2_s.poly) =
Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul (Vale.Math.Poly2_s.reverse rd 127) h) 255 in
let (rdhL:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.mod rdh m in let
(rdhLh:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.reverse (Vale.Math.Poly2_s.mul
(Vale.Math.Poly2_s.reverse rdhL 127) h) 127 in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 341 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev128 a b) (fun (va_s:va_state) va_g -> let ((lo1:poly), (hi1:poly)) = va_g in
let (va_arg29:Vale.Math.Poly2_s.poly) = lo1 in let (va_arg28:Vale.Math.Poly2_s.poly) = hi1 in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 342 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg28 va_arg29 128) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 343 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vmr (va_op_vec_opr_vec 6) (va_op_vec_opr_vec 2)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 345 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Gf128ModulusRev (va_op_vec_opr_vec 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 346 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev128 (Vale.Math.Poly2_s.reverse rd 127) h) (fun (va_s:va_state) va_g -> let
((lo2:poly), (hi2:poly)) = va_g in let (va_arg27:Vale.Math.Poly2_s.poly) = lo2 in let
(va_arg26:Vale.Math.Poly2_s.poly) = hi2 in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 347 column 25 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Lemmas.lemma_combine_define va_arg26 va_arg27 128) (va_QSeq
va_range1
"***** PRECONDITION NOT MET AT line 348 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Vmr (va_op_vec_opr_vec 5) (va_op_vec_opr_vec 2)) (va_QBind va_range1
"***** PRECONDITION NOT MET AT line 350 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_Gf128ModulusRev (va_op_vec_opr_vec 2)) (fun (va_s:va_state) _ -> va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 352 column 31 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_quad32_double_hi_rev rdhL) (va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 353 column 31 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.AES.GF128.lemma_quad32_double_hi_rev rh) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 354 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ClmulRev64High (Vale.Math.Poly2_s.reverse rdhL 127) h) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 356 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 5) rdhLh
(Vale.Math.Poly2_s.div rdh m)) (va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 357 column 12 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_AddPoly (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 6)
(Vale.Math.Poly2_s.add rdhLh (Vale.Math.Poly2_s.div rdh m)) (Vale.Math.Poly2_s.div rab m))
(va_QEmpty (()))))))))))))))))))
[@"opaque_to_smt"]
let va_lemma_ReduceMulRev128 va_b0 va_s0 a b =
let (va_mods:va_mods_t) = [va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_ReduceMulRev128 va_mods a b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ReduceMulRev128 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label va_range1
"***** POSTCONDITION NOT MET AT line 315 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\ label va_range1
"***** POSTCONDITION NOT MET AT line 327 column 55 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_vec 1 va_sM == Vale.Math.Poly2.Bits_s.to_quad32 (Vale.Math.Poly2_s.reverse
(Vale.AES.GF128_s.gf128_mul a b) 127))) in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok]) va_sM va_s0;
(va_sM, va_fM)
[@"opaque_to_smt"]
let va_wpProof_ReduceMulRev128 a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ReduceMulRev128 (va_code_ReduceMulRev128 ()) va_s0 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 6 va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_vec 0 va_sM
(va_update_reg 10 va_sM (va_update_ok va_sM va_s0))))))))));
va_lemma_norm_mods ([va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10]) va_sM va_s0;
let va_g = () in
(va_sM, va_f0, va_g)
//--
//-- Gf128MulRev128
[@ "opaque_to_smt" va_qattr]
let va_code_Gf128MulRev128 () =
(va_Block (va_CCons (va_code_ReduceMulRev128 ()) (va_CNil ())))
[@ "opaque_to_smt" va_qattr]
let va_codegen_success_Gf128MulRev128 () =
(va_pbool_and (va_codegen_success_ReduceMulRev128 ()) (va_ttrue ()))
[@ "opaque_to_smt" va_qattr]
let va_qcode_Gf128MulRev128 (va_mods:va_mods_t) : (va_quickCode unit (va_code_Gf128MulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(a:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in let
(b:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in va_QBind
va_range1
"***** PRECONDITION NOT MET AT line 372 column 20 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_quick_ReduceMulRev128 (Vale.Math.Poly2_s.reverse a 127) (Vale.Math.Poly2_s.reverse b 127))
(fun (va_s:va_state) _ -> let (va_arg6:Vale.Math.Poly2_s.poly) = Vale.AES.GF128.gf128_mul_rev a
b in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 373 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_:unit) -> Vale.Math.Poly2.Bits.lemma_of_to_quad32 va_arg6) (va_QEmpty (()))))) | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.fsti.checked",
"Vale.PPC64LE.InsBasic.fsti.checked",
"Vale.PPC64LE.Decls.fsti.checked",
"Vale.Math.Poly2_s.fsti.checked",
"Vale.Math.Poly2.Words.fsti.checked",
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.Bits_s.fsti.checked",
"Vale.Math.Poly2.Bits.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.TypesNative.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.Types_helpers.fsti.checked",
"Vale.AES.PPC64LE.PolyOps.fsti.checked",
"Vale.AES.GHash_BE.fsti.checked",
"Vale.AES.GF128_s.fsti.checked",
"Vale.AES.GF128.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.AES.PPC64LE.GF128_Mul.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCodes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.QuickCode",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsMem",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.InsBasic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Decls",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GF128_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Bits_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | va_b0: Vale.PPC64LE.Decls.va_code -> va_s0: Vale.PPC64LE.Decls.va_state
-> Prims.Ghost (Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.PPC64LE.Decls.va_code",
"Vale.PPC64LE.Decls.va_state",
"Vale.PPC64LE.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.PPC64LE.Decls.va_fuel",
"Vale.PPC64LE.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod_vec",
"Vale.PPC64LE.QuickCode.va_Mod_reg",
"Vale.PPC64LE.QuickCode.va_Mod_ok",
"Prims.Nil",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.list",
"Vale.PPC64LE.QuickCode.__proj__QProc__item__mods",
"Vale.AES.PPC64LE.GF128_Mul.va_code_Gf128MulRev128",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.tuple3",
"Vale.PPC64LE.Machine_s.state",
"Vale.PPC64LE.QuickCodes.va_wp_sound_code_norm",
"Prims.l_and",
"Vale.PPC64LE.QuickCodes.label",
"Vale.PPC64LE.QuickCodes.va_range1",
"Prims.b2t",
"Vale.PPC64LE.Decls.va_get_ok",
"Vale.Math.Poly2_s.poly",
"Vale.Math.Poly2.Bits_s.of_quad32",
"Vale.PPC64LE.Decls.va_get_vec",
"Vale.AES.GF128.gf128_mul_rev",
"Vale.PPC64LE.QuickCode.quickCode",
"Vale.AES.PPC64LE.GF128_Mul.va_qcode_Gf128MulRev128"
] | [] | false | false | false | false | false | let va_lemma_Gf128MulRev128 va_b0 va_s0 =
| let va_mods:va_mods_t =
[
va_Mod_vec 6;
va_Mod_vec 5;
va_Mod_vec 4;
va_Mod_vec 3;
va_Mod_vec 2;
va_Mod_vec 1;
va_Mod_vec 0;
va_Mod_reg 10;
va_Mod_ok
]
in
let va_qc = va_qcode_Gf128MulRev128 va_mods in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_Gf128MulRev128 ())
va_qc
va_s0
(fun va_s0 va_sM va_g ->
let () = va_g in
label va_range1
"***** POSTCONDITION NOT MET AT line 360 column 1 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(va_get_ok va_sM) /\
(let a:Vale.Math.Poly2_s.poly = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s0) in
let b:Vale.Math.Poly2_s.poly = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s0) in
label va_range1
"***** POSTCONDITION NOT MET AT line 370 column 45 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_sM) ==
Vale.AES.GF128.gf128_mul_rev a b)))
in
assert_norm (va_qc.mods == va_mods);
va_lemma_norm_mods ([
va_Mod_vec 6;
va_Mod_vec 5;
va_Mod_vec 4;
va_Mod_vec 3;
va_Mod_vec 2;
va_Mod_vec 1;
va_Mod_vec 0;
va_Mod_reg 10;
va_Mod_ok
])
va_sM
va_s0;
(va_sM, va_fM) | false |
FStar.BV.fst | FStar.BV.bvshr | val bvshr (#n: pos) (a: bv_t n) (s: nat) : Tot (bv_t n) | val bvshr (#n: pos) (a: bv_t n) (s: nat) : Tot (bv_t n) | let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 82,
"start_col": 0,
"start_line": 81
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n = | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> s: Prims.nat -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"Prims.nat",
"FStar.BV.bvshr'",
"FStar.BV.int2bv_nat"
] | [] | false | false | false | false | false | let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
| bvshr' #n a (int2bv_nat #n s) | false |
FStar.BV.fst | FStar.BV.int2bv_shl | val int2bv_shl:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshl #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (shift_left #n x y) == z) | val int2bv_shl:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshl #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (shift_left #n x y) == z) | let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 77,
"start_col": 0,
"start_line": 75
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf = | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | pf: Prims.squash (FStar.BV.bvshl (FStar.BV.int2bv x) y == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.shift_left x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvshl",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit",
"FStar.BV.int2bv_nat_lemma"
] | [] | true | false | true | false | false | let int2bv_shl #n #x #y #z pf =
| int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y) | false |
FStar.BV.fst | FStar.BV.bvsub | val bvsub (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvsub (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvsub #n a b =
int2bv #n (U.sub_mod (bv2int #n a) (bv2int #n b)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 108,
"start_col": 0,
"start_line": 107
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b)
let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let bvadd #n a b =
int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b))
let int2bv_add #n #x #y #z pf =
inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.BV.int2bv",
"FStar.UInt.sub_mod",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvsub #n a b =
| int2bv #n (U.sub_mod (bv2int #n a) (bv2int #n b)) | false |
FStar.BV.fst | FStar.BV.bvult | val bvult (#n: pos) (a b: bv_t n) : Tot (bool) | val bvult (#n: pos) (a b: bv_t n) : Tot (bool) | let bvult #n a b = (bv2int #n a) < (bv2int #n b) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 48,
"end_line": 91,
"start_col": 0,
"start_line": 91
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"Prims.op_LessThan",
"FStar.BV.bv2int",
"Prims.bool"
] | [] | false | false | false | false | false | let bvult #n a b =
| (bv2int #n a) < (bv2int #n b) | false |
FStar.BV.fst | FStar.BV.int2bv_shr | val int2bv_shr:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshr #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (shift_right #n x y) == z) | val int2bv_shr:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshr #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (shift_right #n x y) == z) | let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 87,
"start_col": 0,
"start_line": 85
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf = | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | pf: Prims.squash (FStar.BV.bvshr (FStar.BV.int2bv x) y == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.shift_right x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvshr",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit",
"FStar.BV.int2bv_nat_lemma"
] | [] | true | false | true | false | false | let int2bv_shr #n #x #y #z pf =
| int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y) | false |
FStar.WellFounded.fst | FStar.WellFounded.binrel | val binrel : a: Type -> Type | let binrel (a:Type) = a -> a -> Type | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 27,
"start_col": 0,
"start_line": 27
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
Authors: Chantal Keller, Catalin Hritcu, Aseem Rastogi, Nikhil Swamy
*)
(* Defining accessibility predicates and well-founded recursion like in Coq
https://coq.inria.fr/library/Coq.Init.Wf.html
*)
module FStar.WellFounded
#push-options "--warn_error -242" //inner let recs not encoded to SMT; ok | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: Type -> Type | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | true | let binrel (a: Type) =
| a -> a -> Type | false |
|
FStar.WellFounded.fst | FStar.WellFounded.well_founded | val well_founded : r: FStar.WellFounded.binrel a -> Type | let well_founded (#a:Type u#a) (r:binrel u#a u#r a) = x:a -> acc r x | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 68,
"end_line": 43,
"start_col": 0,
"start_line": 43
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
Authors: Chantal Keller, Catalin Hritcu, Aseem Rastogi, Nikhil Swamy
*)
(* Defining accessibility predicates and well-founded recursion like in Coq
https://coq.inria.fr/library/Coq.Init.Wf.html
*)
module FStar.WellFounded
#push-options "--warn_error -242" //inner let recs not encoded to SMT; ok
let binrel (a:Type) = a -> a -> Type
(*
* The accessibility relation
* -- Marked erasable, since this is a singleton type anyway
* -- Erasability also simplifies proofs that use accessibility in
* with axioms like indefinitedescription
*)
[@@ erasable]
noeq
type acc (#a:Type u#a) (r:binrel u#a u#r a) (x:a) : Type u#(max a r) =
| AccIntro : access_smaller:(y:a -> r y x -> acc r y) -> acc r x
(*
* A binrel r is well-founded if every element is accessible | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | r: FStar.WellFounded.binrel a -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.acc"
] | [] | false | false | false | true | true | let well_founded (#a: Type u#a) (r: binrel u#a u#r a) =
| x: a -> acc r x | false |
|
FStar.BV.fst | FStar.BV.int2bv_lemma_ult_2 | val int2bv_lemma_ult_2 (#n: pos) (a b: uint_t n)
: Lemma (requires (bvult #n (int2bv #n a) (int2bv #n b))) (ensures a < b) | val int2bv_lemma_ult_2 (#n: pos) (a b: uint_t n)
: Lemma (requires (bvult #n (int2bv #n a) (int2bv #n b))) (ensures a < b) | let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 99,
"start_col": 0,
"start_line": 97
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b)
let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n
-> FStar.Pervasives.Lemma (requires FStar.BV.bvult (FStar.BV.int2bv a) (FStar.BV.int2bv b))
(ensures a < b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.inverse_num_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_lemma_ult_2 #n a b =
| inverse_num_lemma #n a;
inverse_num_lemma #n b | false |
FStar.BV.fst | FStar.BV.int2bv_add | val int2bv_add:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvadd #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (add_mod #n x y) == z) | val int2bv_add:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvadd #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (add_mod #n x y) == z) | let int2bv_add #n #x #y #z pf =
inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 105,
"start_col": 0,
"start_line": 104
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b)
let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let bvadd #n a b = | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | pf: Prims.squash (FStar.BV.bvadd (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.add_mod x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvadd",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_add #n #x #y #z pf =
| inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y)) | false |
FStar.WellFounded.fst | FStar.WellFounded.well_founded_relation | val well_founded_relation : a: Type -> Type | let well_founded_relation (a:Type) = rel:binrel a{is_well_founded rel} | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 70,
"end_line": 64,
"start_col": 0,
"start_line": 64
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
Authors: Chantal Keller, Catalin Hritcu, Aseem Rastogi, Nikhil Swamy
*)
(* Defining accessibility predicates and well-founded recursion like in Coq
https://coq.inria.fr/library/Coq.Init.Wf.html
*)
module FStar.WellFounded
#push-options "--warn_error -242" //inner let recs not encoded to SMT; ok
let binrel (a:Type) = a -> a -> Type
(*
* The accessibility relation
* -- Marked erasable, since this is a singleton type anyway
* -- Erasability also simplifies proofs that use accessibility in
* with axioms like indefinitedescription
*)
[@@ erasable]
noeq
type acc (#a:Type u#a) (r:binrel u#a u#r a) (x:a) : Type u#(max a r) =
| AccIntro : access_smaller:(y:a -> r y x -> acc r y) -> acc r x
(*
* A binrel r is well-founded if every element is accessible
*)
let well_founded (#a:Type u#a) (r:binrel u#a u#r a) = x:a -> acc r x
(*
* Accessibility predicates can be used for implementing
* total fix points
*)
let rec fix_F (#aa:Type) (#r:binrel aa) (#p:(aa -> Type))
(f: (x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa) (a:acc r x)
: Tot (p x) (decreases a)
= f x (fun y h -> fix_F f y (a.access_smaller y h))
let fix (#aa:Type) (#r:binrel aa) (rwf:well_founded r)
(p:aa -> Type) (f:(x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa)
: p x
= fix_F f x (rwf x)
let is_well_founded (#a:Type) (rel:binrel a) =
forall (x:a). squash (acc rel x) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: Type -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.is_well_founded"
] | [] | false | false | false | true | true | let well_founded_relation (a: Type) =
| rel: binrel a {is_well_founded rel} | false |
|
FStar.BV.fst | FStar.BV.int2bv_lemma_ult_1 | val int2bv_lemma_ult_1 (#n: pos) (a b: uint_t n)
: Lemma (requires a < b) (ensures (bvult #n (int2bv #n a) (int2bv #n b))) | val int2bv_lemma_ult_1 (#n: pos) (a b: uint_t n)
: Lemma (requires a < b) (ensures (bvult #n (int2bv #n a) (int2bv #n b))) | let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 95,
"start_col": 0,
"start_line": 93
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n
-> FStar.Pervasives.Lemma (requires a < b)
(ensures FStar.BV.bvult (FStar.BV.int2bv a) (FStar.BV.int2bv b)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.inverse_num_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_lemma_ult_1 #n a b =
| inverse_num_lemma #n a;
inverse_num_lemma #n b | false |
FStar.WellFounded.fst | FStar.WellFounded.is_well_founded | val is_well_founded : rel: FStar.WellFounded.binrel a -> Prims.logical | let is_well_founded (#a:Type) (rel:binrel a) =
forall (x:a). squash (acc rel x) | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 62,
"start_col": 0,
"start_line": 61
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
Authors: Chantal Keller, Catalin Hritcu, Aseem Rastogi, Nikhil Swamy
*)
(* Defining accessibility predicates and well-founded recursion like in Coq
https://coq.inria.fr/library/Coq.Init.Wf.html
*)
module FStar.WellFounded
#push-options "--warn_error -242" //inner let recs not encoded to SMT; ok
let binrel (a:Type) = a -> a -> Type
(*
* The accessibility relation
* -- Marked erasable, since this is a singleton type anyway
* -- Erasability also simplifies proofs that use accessibility in
* with axioms like indefinitedescription
*)
[@@ erasable]
noeq
type acc (#a:Type u#a) (r:binrel u#a u#r a) (x:a) : Type u#(max a r) =
| AccIntro : access_smaller:(y:a -> r y x -> acc r y) -> acc r x
(*
* A binrel r is well-founded if every element is accessible
*)
let well_founded (#a:Type u#a) (r:binrel u#a u#r a) = x:a -> acc r x
(*
* Accessibility predicates can be used for implementing
* total fix points
*)
let rec fix_F (#aa:Type) (#r:binrel aa) (#p:(aa -> Type))
(f: (x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa) (a:acc r x)
: Tot (p x) (decreases a)
= f x (fun y h -> fix_F f y (a.access_smaller y h))
let fix (#aa:Type) (#r:binrel aa) (rwf:well_founded r)
(p:aa -> Type) (f:(x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa)
: p x
= fix_F f x (rwf x) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | rel: FStar.WellFounded.binrel a -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel",
"Prims.l_Forall",
"Prims.squash",
"FStar.WellFounded.acc",
"Prims.logical"
] | [] | false | false | false | true | true | let is_well_founded (#a: Type) (rel: binrel a) =
| forall (x: a). squash (acc rel x) | false |
|
FStar.WellFounded.fst | FStar.WellFounded.fix | val fix
(#aa: Type)
(#r: binrel aa)
(rwf: well_founded r)
(p: (aa -> Type))
(f: (x: aa -> (y: aa -> r y x -> p y) -> p x))
(x: aa)
: p x | val fix
(#aa: Type)
(#r: binrel aa)
(rwf: well_founded r)
(p: (aa -> Type))
(f: (x: aa -> (y: aa -> r y x -> p y) -> p x))
(x: aa)
: p x | let fix (#aa:Type) (#r:binrel aa) (rwf:well_founded r)
(p:aa -> Type) (f:(x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa)
: p x
= fix_F f x (rwf x) | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 59,
"start_col": 0,
"start_line": 55
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
Authors: Chantal Keller, Catalin Hritcu, Aseem Rastogi, Nikhil Swamy
*)
(* Defining accessibility predicates and well-founded recursion like in Coq
https://coq.inria.fr/library/Coq.Init.Wf.html
*)
module FStar.WellFounded
#push-options "--warn_error -242" //inner let recs not encoded to SMT; ok
let binrel (a:Type) = a -> a -> Type
(*
* The accessibility relation
* -- Marked erasable, since this is a singleton type anyway
* -- Erasability also simplifies proofs that use accessibility in
* with axioms like indefinitedescription
*)
[@@ erasable]
noeq
type acc (#a:Type u#a) (r:binrel u#a u#r a) (x:a) : Type u#(max a r) =
| AccIntro : access_smaller:(y:a -> r y x -> acc r y) -> acc r x
(*
* A binrel r is well-founded if every element is accessible
*)
let well_founded (#a:Type u#a) (r:binrel u#a u#r a) = x:a -> acc r x
(*
* Accessibility predicates can be used for implementing
* total fix points
*)
let rec fix_F (#aa:Type) (#r:binrel aa) (#p:(aa -> Type))
(f: (x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa) (a:acc r x)
: Tot (p x) (decreases a)
= f x (fun y h -> fix_F f y (a.access_smaller y h)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
rwf: FStar.WellFounded.well_founded r ->
p: (_: aa -> Type) ->
f: (x: aa -> _: (y: aa -> _: r y x -> p y) -> p x) ->
x: aa
-> p x | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.well_founded",
"FStar.WellFounded.fix_F"
] | [] | false | false | false | false | false | let fix
(#aa: Type)
(#r: binrel aa)
(rwf: well_founded r)
(p: (aa -> Type))
(f: (x: aa -> (y: aa -> r y x -> p y) -> p x))
(x: aa)
: p x =
| fix_F f x (rwf x) | false |
FStar.BV.fst | FStar.BV.bvadd | val bvadd (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvadd (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvadd #n a b =
int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 103,
"start_col": 0,
"start_line": 102
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b)
let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.BV.int2bv",
"FStar.UInt.add_mod",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvadd #n a b =
| int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b)) | false |
FStar.WellFounded.fst | FStar.WellFounded.inverse_image | val inverse_image (#a: Type u#a) (#b: Type u#b) (r_b: binrel u#b u#r b) (f: (a -> b))
: binrel u#a u#r a | val inverse_image (#a: Type u#a) (#b: Type u#b) (r_b: binrel u#b u#r b) (f: (a -> b))
: binrel u#a u#r a | let inverse_image (#a:Type u#a) (#b:Type u#b) (r_b:binrel u#b u#r b) (f:a -> b) : binrel u#a u#r a =
fun x y -> r_b (f x) (f y) | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 28,
"end_line": 120,
"start_col": 0,
"start_line": 119
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
Authors: Chantal Keller, Catalin Hritcu, Aseem Rastogi, Nikhil Swamy
*)
(* Defining accessibility predicates and well-founded recursion like in Coq
https://coq.inria.fr/library/Coq.Init.Wf.html
*)
module FStar.WellFounded
#push-options "--warn_error -242" //inner let recs not encoded to SMT; ok
let binrel (a:Type) = a -> a -> Type
(*
* The accessibility relation
* -- Marked erasable, since this is a singleton type anyway
* -- Erasability also simplifies proofs that use accessibility in
* with axioms like indefinitedescription
*)
[@@ erasable]
noeq
type acc (#a:Type u#a) (r:binrel u#a u#r a) (x:a) : Type u#(max a r) =
| AccIntro : access_smaller:(y:a -> r y x -> acc r y) -> acc r x
(*
* A binrel r is well-founded if every element is accessible
*)
let well_founded (#a:Type u#a) (r:binrel u#a u#r a) = x:a -> acc r x
(*
* Accessibility predicates can be used for implementing
* total fix points
*)
let rec fix_F (#aa:Type) (#r:binrel aa) (#p:(aa -> Type))
(f: (x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa) (a:acc r x)
: Tot (p x) (decreases a)
= f x (fun y h -> fix_F f y (a.access_smaller y h))
let fix (#aa:Type) (#r:binrel aa) (rwf:well_founded r)
(p:aa -> Type) (f:(x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa)
: p x
= fix_F f x (rwf x)
let is_well_founded (#a:Type) (rel:binrel a) =
forall (x:a). squash (acc rel x)
let well_founded_relation (a:Type) = rel:binrel a{is_well_founded rel}
unfold
let as_well_founded (#a:Type u#a)
(#rel:binrel u#a u#r a)
(f:well_founded rel)
: well_founded_relation a
= introduce forall (x:a). squash (acc rel x)
with FStar.Squash.return_squash (FStar.Squash.return_squash (f x));
rel
open FStar.IndefiniteDescription
(*
* Proofs that subrelation and inverse image commute with well-foundedness
*
* Reference: Constructing Recursion Operators in Type Theory, L. Paulson JSC (1986) 2, 325-355
*)
let subrelation_wf (#a:Type) (#r #sub_r:binrel a)
(sub_w:(x:a -> y:a -> sub_r x y -> r x y))
(r_wf:well_founded r)
: well_founded sub_r
= let rec aux (x:a) (acc_r:acc r x) : Tot (acc sub_r x) (decreases acc_r) =
AccIntro (fun y sub_r_y_x ->
aux y
(match acc_r with
| AccIntro f -> f y (sub_w y x sub_r_y_x))) in
fun x -> aux x (r_wf x)
let subrelation_squash_wf (#a:Type u#a)
(#r:binrel u#a u#r a)
(#sub_r:binrel u#a u#sr a)
(sub_w:(x:a -> y:a -> sub_r x y -> squash (r x y)))
(r_wf:well_founded r)
: Lemma (is_well_founded sub_r)
= introduce forall (x:a). squash (acc sub_r x)
with (
let rec acc_y (x:a) (acc_r:acc r x) (y:a) (p:sub_r y x)
: Tot (acc sub_r y)
(decreases acc_r)
= AccIntro (acc_y y (acc_r.access_smaller
y
(elim_squash (sub_w y x p))))
in
FStar.Squash.return_squash (FStar.Squash.return_squash (AccIntro (acc_y x (r_wf x))))
)
unfold
let subrelation_as_wf (#a:Type u#a) (#r #sub_r:binrel u#a u#r a)
(sub_w:(x:a -> y:a -> sub_r x y -> squash (r x y)))
(r_wf:well_founded r)
: well_founded_relation a
= subrelation_squash_wf sub_w r_wf;
sub_r | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.IndefiniteDescription",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | r_b: FStar.WellFounded.binrel b -> f: (_: a -> b) -> FStar.WellFounded.binrel a | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel"
] | [] | false | false | false | true | false | let inverse_image (#a: Type u#a) (#b: Type u#b) (r_b: binrel u#b u#r b) (f: (a -> b))
: binrel u#a u#r a =
| fun x y -> r_b (f x) (f y) | false |
FStar.BV.fst | FStar.BV.bvmul' | val bvmul' (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvmul' (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvmul' #n a b =
int2bv #n (U.mul_mod #n (bv2int #n a) (bv2int #n b)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 136,
"start_col": 0,
"start_line": 135
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b)
let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let bvadd #n a b =
int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b))
let int2bv_add #n #x #y #z pf =
inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y))
let bvsub #n a b =
int2bv #n (U.sub_mod (bv2int #n a) (bv2int #n b))
let int2bv_sub #n #x #y #z pf =
inverse_vec_lemma #n (bvsub #n (int2bv #n x) (int2bv #n y))
let bvdiv #n a b =
int2bv #n (U.udiv #n (bv2int #n a) b)
let int2bv_div #n #x #y #z pf =
inverse_vec_lemma #n (bvdiv #n (int2bv #n x) y)
let bvdiv_unsafe #n a b = if (bv2int b <> 0) then bvdiv a (bv2int b) else int2bv 0
let bvdiv_unsafe_sound #n #a #b b_nonzero_pf = ()
let bvmod #n a b =
int2bv #n (U.mod #n (bv2int #n a) b)
let int2bv_mod #n #x #y #z pf =
inverse_vec_lemma #n (bvmod #n (int2bv #n x) y)
let bvmod_unsafe #n a b = if (bv2int b <> 0) then bvmod a (bv2int b) else int2bv 0
let bvmod_unsafe_sound #n #a #b b_nonzero_pf = ()
// Z3's bvmul is also modulo
let bvmul #n a b =
int2bv #n (U.mul_mod #n (bv2int #n a) b)
let int2bv_mul #n #x #y #z pf =
inverse_vec_lemma #n (bvmul #n (int2bv #n x) y) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.BV.int2bv",
"FStar.UInt.mul_mod",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvmul' #n a b =
| int2bv #n (U.mul_mod #n (bv2int #n a) (bv2int #n b)) | false |
FStar.BV.fst | FStar.BV.int2bv_sub | val int2bv_sub:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvsub #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (sub_mod #n x y) == z) | val int2bv_sub:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvsub #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (sub_mod #n x y) == z) | let int2bv_sub #n #x #y #z pf =
inverse_vec_lemma #n (bvsub #n (int2bv #n x) (int2bv #n y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 110,
"start_col": 0,
"start_line": 109
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b)
let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let bvadd #n a b =
int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b))
let int2bv_add #n #x #y #z pf =
inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y))
let bvsub #n a b = | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | pf: Prims.squash (FStar.BV.bvsub (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.sub_mod x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvsub",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_sub #n #x #y #z pf =
| inverse_vec_lemma #n (bvsub #n (int2bv #n x) (int2bv #n y)) | false |
FStar.BV.fst | FStar.BV.int2bv_mod | val int2bv_mod:
#n: pos ->
#x: uint_t n ->
#y: uint_t n {y <> 0} ->
#z: bv_t n ->
squash (bvmod #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (mod #n x y) == z) | val int2bv_mod:
#n: pos ->
#x: uint_t n ->
#y: uint_t n {y <> 0} ->
#z: bv_t n ->
squash (bvmod #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (mod #n x y) == z) | let int2bv_mod #n #x #y #z pf =
inverse_vec_lemma #n (bvmod #n (int2bv #n x) y) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 124,
"start_col": 0,
"start_line": 123
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b)
let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let bvadd #n a b =
int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b))
let int2bv_add #n #x #y #z pf =
inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y))
let bvsub #n a b =
int2bv #n (U.sub_mod (bv2int #n a) (bv2int #n b))
let int2bv_sub #n #x #y #z pf =
inverse_vec_lemma #n (bvsub #n (int2bv #n x) (int2bv #n y))
let bvdiv #n a b =
int2bv #n (U.udiv #n (bv2int #n a) b)
let int2bv_div #n #x #y #z pf =
inverse_vec_lemma #n (bvdiv #n (int2bv #n x) y)
let bvdiv_unsafe #n a b = if (bv2int b <> 0) then bvdiv a (bv2int b) else int2bv 0
let bvdiv_unsafe_sound #n #a #b b_nonzero_pf = ()
let bvmod #n a b = | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | pf: Prims.squash (FStar.BV.bvmod (FStar.BV.int2bv x) y == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.mod x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"Prims.b2t",
"Prims.op_disEquality",
"Prims.int",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvmod",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_mod #n #x #y #z pf =
| inverse_vec_lemma #n (bvmod #n (int2bv #n x) y) | false |
FStar.BV.fst | FStar.BV.bvdiv | val bvdiv (#n: pos) (a: bv_t n) (b: uint_t n {b <> 0}) : Tot (bv_t n) | val bvdiv (#n: pos) (a: bv_t n) (b: uint_t n {b <> 0}) : Tot (bv_t n) | let bvdiv #n a b =
int2bv #n (U.udiv #n (bv2int #n a) b) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 113,
"start_col": 0,
"start_line": 112
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b)
let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let bvadd #n a b =
int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b))
let int2bv_add #n #x #y #z pf =
inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y))
let bvsub #n a b =
int2bv #n (U.sub_mod (bv2int #n a) (bv2int #n b))
let int2bv_sub #n #x #y #z pf =
inverse_vec_lemma #n (bvsub #n (int2bv #n x) (int2bv #n y)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> b: FStar.UInt.uint_t n {b <> 0} -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.UInt.uint_t",
"Prims.b2t",
"Prims.op_disEquality",
"Prims.int",
"FStar.BV.int2bv",
"FStar.UInt.udiv",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvdiv #n a b =
| int2bv #n (U.udiv #n (bv2int #n a) b) | false |
FStar.BV.fst | FStar.BV.bvdiv_unsafe | val bvdiv_unsafe (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvdiv_unsafe (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvdiv_unsafe #n a b = if (bv2int b <> 0) then bvdiv a (bv2int b) else int2bv 0 | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 82,
"end_line": 117,
"start_col": 0,
"start_line": 117
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b)
let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let bvadd #n a b =
int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b))
let int2bv_add #n #x #y #z pf =
inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y))
let bvsub #n a b =
int2bv #n (U.sub_mod (bv2int #n a) (bv2int #n b))
let int2bv_sub #n #x #y #z pf =
inverse_vec_lemma #n (bvsub #n (int2bv #n x) (int2bv #n y))
let bvdiv #n a b =
int2bv #n (U.udiv #n (bv2int #n a) b)
let int2bv_div #n #x #y #z pf =
inverse_vec_lemma #n (bvdiv #n (int2bv #n x) y) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"Prims.op_disEquality",
"Prims.int",
"FStar.BV.bv2int",
"FStar.BV.bvdiv",
"Prims.bool",
"FStar.BV.int2bv"
] | [] | false | false | false | false | false | let bvdiv_unsafe #n a b =
| if (bv2int b <> 0) then bvdiv a (bv2int b) else int2bv 0 | false |
FStar.BV.fst | FStar.BV.bvmod | val bvmod (#n: pos) (a: bv_t n) (b: uint_t n {b <> 0}) : Tot (bv_t n) | val bvmod (#n: pos) (a: bv_t n) (b: uint_t n {b <> 0}) : Tot (bv_t n) | let bvmod #n a b =
int2bv #n (U.mod #n (bv2int #n a) b) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 122,
"start_col": 0,
"start_line": 121
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b)
let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let bvadd #n a b =
int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b))
let int2bv_add #n #x #y #z pf =
inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y))
let bvsub #n a b =
int2bv #n (U.sub_mod (bv2int #n a) (bv2int #n b))
let int2bv_sub #n #x #y #z pf =
inverse_vec_lemma #n (bvsub #n (int2bv #n x) (int2bv #n y))
let bvdiv #n a b =
int2bv #n (U.udiv #n (bv2int #n a) b)
let int2bv_div #n #x #y #z pf =
inverse_vec_lemma #n (bvdiv #n (int2bv #n x) y)
let bvdiv_unsafe #n a b = if (bv2int b <> 0) then bvdiv a (bv2int b) else int2bv 0
let bvdiv_unsafe_sound #n #a #b b_nonzero_pf = () | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> b: FStar.UInt.uint_t n {b <> 0} -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.UInt.uint_t",
"Prims.b2t",
"Prims.op_disEquality",
"Prims.int",
"FStar.BV.int2bv",
"FStar.UInt.mod",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvmod #n a b =
| int2bv #n (U.mod #n (bv2int #n a) b) | false |
FStar.BV.fst | FStar.BV.bvmul | val bvmul (#n: pos) (a: bv_t n) (b: uint_t n) : Tot (bv_t n) | val bvmul (#n: pos) (a: bv_t n) (b: uint_t n) : Tot (bv_t n) | let bvmul #n a b =
int2bv #n (U.mul_mod #n (bv2int #n a) b) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"end_line": 131,
"start_col": 0,
"start_line": 130
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b)
let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let bvadd #n a b =
int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b))
let int2bv_add #n #x #y #z pf =
inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y))
let bvsub #n a b =
int2bv #n (U.sub_mod (bv2int #n a) (bv2int #n b))
let int2bv_sub #n #x #y #z pf =
inverse_vec_lemma #n (bvsub #n (int2bv #n x) (int2bv #n y))
let bvdiv #n a b =
int2bv #n (U.udiv #n (bv2int #n a) b)
let int2bv_div #n #x #y #z pf =
inverse_vec_lemma #n (bvdiv #n (int2bv #n x) y)
let bvdiv_unsafe #n a b = if (bv2int b <> 0) then bvdiv a (bv2int b) else int2bv 0
let bvdiv_unsafe_sound #n #a #b b_nonzero_pf = ()
let bvmod #n a b =
int2bv #n (U.mod #n (bv2int #n a) b)
let int2bv_mod #n #x #y #z pf =
inverse_vec_lemma #n (bvmod #n (int2bv #n x) y)
let bvmod_unsafe #n a b = if (bv2int b <> 0) then bvmod a (bv2int b) else int2bv 0
let bvmod_unsafe_sound #n #a #b b_nonzero_pf = () | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> b: FStar.UInt.uint_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.UInt.uint_t",
"FStar.BV.int2bv",
"FStar.UInt.mul_mod",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvmul #n a b =
| int2bv #n (U.mul_mod #n (bv2int #n a) b) | false |
FStar.BV.fst | FStar.BV.bvmod_unsafe | val bvmod_unsafe (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvmod_unsafe (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvmod_unsafe #n a b = if (bv2int b <> 0) then bvmod a (bv2int b) else int2bv 0 | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 82,
"end_line": 126,
"start_col": 0,
"start_line": 126
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b)
let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let bvadd #n a b =
int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b))
let int2bv_add #n #x #y #z pf =
inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y))
let bvsub #n a b =
int2bv #n (U.sub_mod (bv2int #n a) (bv2int #n b))
let int2bv_sub #n #x #y #z pf =
inverse_vec_lemma #n (bvsub #n (int2bv #n x) (int2bv #n y))
let bvdiv #n a b =
int2bv #n (U.udiv #n (bv2int #n a) b)
let int2bv_div #n #x #y #z pf =
inverse_vec_lemma #n (bvdiv #n (int2bv #n x) y)
let bvdiv_unsafe #n a b = if (bv2int b <> 0) then bvdiv a (bv2int b) else int2bv 0
let bvdiv_unsafe_sound #n #a #b b_nonzero_pf = ()
let bvmod #n a b =
int2bv #n (U.mod #n (bv2int #n a) b)
let int2bv_mod #n #x #y #z pf =
inverse_vec_lemma #n (bvmod #n (int2bv #n x) y) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"Prims.op_disEquality",
"Prims.int",
"FStar.BV.bv2int",
"FStar.BV.bvmod",
"Prims.bool",
"FStar.BV.int2bv"
] | [] | false | false | false | false | false | let bvmod_unsafe #n a b =
| if (bv2int b <> 0) then bvmod a (bv2int b) else int2bv 0 | false |
FStar.BV.fst | FStar.BV.int2bv_mul' | val int2bv_mul':
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvmul' #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (mul_mod #n x y) == z) | val int2bv_mul':
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvmul' #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (mul_mod #n x y) == z) | let int2bv_mul' #n #x #y #z pf =
inverse_vec_lemma #n (bvmul' #n (int2bv #n x) (int2bv #n y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 139,
"start_col": 0,
"start_line": 138
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b)
let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let bvadd #n a b =
int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b))
let int2bv_add #n #x #y #z pf =
inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y))
let bvsub #n a b =
int2bv #n (U.sub_mod (bv2int #n a) (bv2int #n b))
let int2bv_sub #n #x #y #z pf =
inverse_vec_lemma #n (bvsub #n (int2bv #n x) (int2bv #n y))
let bvdiv #n a b =
int2bv #n (U.udiv #n (bv2int #n a) b)
let int2bv_div #n #x #y #z pf =
inverse_vec_lemma #n (bvdiv #n (int2bv #n x) y)
let bvdiv_unsafe #n a b = if (bv2int b <> 0) then bvdiv a (bv2int b) else int2bv 0
let bvdiv_unsafe_sound #n #a #b b_nonzero_pf = ()
let bvmod #n a b =
int2bv #n (U.mod #n (bv2int #n a) b)
let int2bv_mod #n #x #y #z pf =
inverse_vec_lemma #n (bvmod #n (int2bv #n x) y)
let bvmod_unsafe #n a b = if (bv2int b <> 0) then bvmod a (bv2int b) else int2bv 0
let bvmod_unsafe_sound #n #a #b b_nonzero_pf = ()
// Z3's bvmul is also modulo
let bvmul #n a b =
int2bv #n (U.mul_mod #n (bv2int #n a) b)
let int2bv_mul #n #x #y #z pf =
inverse_vec_lemma #n (bvmul #n (int2bv #n x) y)
let bvmul' #n a b =
int2bv #n (U.mul_mod #n (bv2int #n a) (bv2int #n b)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | pf: Prims.squash (FStar.BV.bvmul' (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.mul_mod x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvmul'",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_mul' #n #x #y #z pf =
| inverse_vec_lemma #n (bvmul' #n (int2bv #n x) (int2bv #n y)) | false |
FStar.BV.fst | FStar.BV.int2bv_mul | val int2bv_mul:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvmul #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (mul_mod #n x y) == z) | val int2bv_mul:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvmul #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (mul_mod #n x y) == z) | let int2bv_mul #n #x #y #z pf =
inverse_vec_lemma #n (bvmul #n (int2bv #n x) y) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 133,
"start_col": 0,
"start_line": 132
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b)
let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let bvadd #n a b =
int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b))
let int2bv_add #n #x #y #z pf =
inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y))
let bvsub #n a b =
int2bv #n (U.sub_mod (bv2int #n a) (bv2int #n b))
let int2bv_sub #n #x #y #z pf =
inverse_vec_lemma #n (bvsub #n (int2bv #n x) (int2bv #n y))
let bvdiv #n a b =
int2bv #n (U.udiv #n (bv2int #n a) b)
let int2bv_div #n #x #y #z pf =
inverse_vec_lemma #n (bvdiv #n (int2bv #n x) y)
let bvdiv_unsafe #n a b = if (bv2int b <> 0) then bvdiv a (bv2int b) else int2bv 0
let bvdiv_unsafe_sound #n #a #b b_nonzero_pf = ()
let bvmod #n a b =
int2bv #n (U.mod #n (bv2int #n a) b)
let int2bv_mod #n #x #y #z pf =
inverse_vec_lemma #n (bvmod #n (int2bv #n x) y)
let bvmod_unsafe #n a b = if (bv2int b <> 0) then bvmod a (bv2int b) else int2bv 0
let bvmod_unsafe_sound #n #a #b b_nonzero_pf = ()
// Z3's bvmul is also modulo
let bvmul #n a b = | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | pf: Prims.squash (FStar.BV.bvmul (FStar.BV.int2bv x) y == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.mul_mod x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvmul",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_mul #n #x #y #z pf =
| inverse_vec_lemma #n (bvmul #n (int2bv #n x) y) | false |
Hacl.P256.PrecompTable.fst | Hacl.P256.PrecompTable.lemma_proj_g_pow2_64_eval | val lemma_proj_g_pow2_64_eval : unit ->
Lemma (SE.exp_pow2 S.mk_p256_concrete_ops S.base_point 64 == proj_g_pow2_64) | val lemma_proj_g_pow2_64_eval : unit ->
Lemma (SE.exp_pow2 S.mk_p256_concrete_ops S.base_point 64 == proj_g_pow2_64) | let lemma_proj_g_pow2_64_eval () =
SPT256.exp_pow2_rec_is_exp_pow2 S.mk_p256_concrete_ops S.base_point 64;
let qX, qY, qZ = normalize_term (SPT256.exp_pow2_rec S.mk_p256_concrete_ops S.base_point 64) in
normalize_term_spec (SPT256.exp_pow2_rec S.mk_p256_concrete_ops S.base_point 64);
let rX : S.felem = 0x000931f4ae428a4ad81ee0aa89cf5247ce85d4dd696c61b4bb9d4761e57b7fbe in
let rY : S.felem = 0x7e88e5e6a142d5c2269f21a158e82ab2c79fcecb26e397b96fd5b9fbcd0a69a5 in
let rZ : S.felem = 0x02626dc2dd5e06cd19de5e6afb6c5dbdd3e41dc1472e7b8ef11eb0662e41c44b in
assert_norm (qX == rX /\ qY == rY /\ qZ == rZ) | {
"file_name": "code/ecdsap256/Hacl.P256.PrecompTable.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 48,
"end_line": 56,
"start_col": 0,
"start_line": 49
} | module Hacl.P256.PrecompTable
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module SPT = Hacl.Spec.PrecompBaseTable
module SPT256 = Hacl.Spec.PrecompBaseTable256
module SPTK = Hacl.Spec.P256.PrecompTable
module S = Spec.P256
module SL = Spec.P256.Lemmas
open Hacl.Impl.P256.Point
include Hacl.Impl.P256.Group
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let proj_point_to_list p =
SPTK.proj_point_to_list_lemma p;
SPTK.proj_point_to_list p
let lemma_refl x =
SPTK.proj_point_to_list_lemma x
//-----------------
inline_for_extraction noextract
let proj_g_pow2_64 : S.proj_point =
[@inline_let]
let rX : S.felem = 0x000931f4ae428a4ad81ee0aa89cf5247ce85d4dd696c61b4bb9d4761e57b7fbe in
[@inline_let]
let rY : S.felem = 0x7e88e5e6a142d5c2269f21a158e82ab2c79fcecb26e397b96fd5b9fbcd0a69a5 in
[@inline_let]
let rZ : S.felem = 0x02626dc2dd5e06cd19de5e6afb6c5dbdd3e41dc1472e7b8ef11eb0662e41c44b in
(rX, rY, rZ)
val lemma_proj_g_pow2_64_eval : unit ->
Lemma (SE.exp_pow2 S.mk_p256_concrete_ops S.base_point 64 == proj_g_pow2_64) | {
"checked_file": "/",
"dependencies": [
"Spec.P256.Lemmas.fsti.checked",
"Spec.P256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.PrecompBaseTable256.fsti.checked",
"Hacl.Spec.PrecompBaseTable.fsti.checked",
"Hacl.Spec.P256.PrecompTable.fsti.checked",
"Hacl.Impl.P256.Point.fsti.checked",
"Hacl.Impl.P256.Group.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": true,
"source_file": "Hacl.P256.PrecompTable.fst"
} | [
{
"abbrev": false,
"full_module": "Hacl.Impl.P256.Group",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.P256.Point",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.P256.Lemmas",
"short_module": "SL"
},
{
"abbrev": true,
"full_module": "Spec.P256",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.P256.PrecompTable",
"short_module": "SPTK"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.PrecompBaseTable256",
"short_module": "SPT256"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.PrecompBaseTable",
"short_module": "SPT"
},
{
"abbrev": true,
"full_module": "Spec.Exponentiation",
"short_module": "SE"
},
{
"abbrev": true,
"full_module": "Lib.Exponentiation",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.Buffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.P256.Group",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.P256.Point",
"short_module": null
},
{
"abbrev": true,
"full_module": "Hacl.Spec.P256.Montgomery",
"short_module": "SM"
},
{
"abbrev": true,
"full_module": "Spec.P256",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.PrecompBaseTable",
"short_module": "SPT"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation.Definitions",
"short_module": "BE"
},
{
"abbrev": true,
"full_module": "Spec.Exponentiation",
"short_module": "SE"
},
{
"abbrev": true,
"full_module": "Lib.Exponentiation.Definition",
"short_module": "LE"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.Buffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.P256",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.P256",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures
Spec.Exponentiation.exp_pow2 Spec.P256.mk_p256_concrete_ops Spec.P256.PointOps.base_point 64 ==
Hacl.P256.PrecompTable.proj_g_pow2_64) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"Prims.nat",
"FStar.Pervasives.assert_norm",
"Prims.l_and",
"Prims.eq2",
"Spec.P256.PointOps.felem",
"FStar.Pervasives.normalize_term_spec",
"Spec.P256.PointOps.proj_point",
"Hacl.Spec.PrecompBaseTable256.exp_pow2_rec",
"Spec.P256.mk_p256_concrete_ops",
"Spec.P256.PointOps.base_point",
"FStar.Pervasives.Native.tuple3",
"FStar.Pervasives.normalize_term",
"Hacl.Spec.PrecompBaseTable256.exp_pow2_rec_is_exp_pow2"
] | [] | false | false | true | false | false | let lemma_proj_g_pow2_64_eval () =
| SPT256.exp_pow2_rec_is_exp_pow2 S.mk_p256_concrete_ops S.base_point 64;
let qX, qY, qZ = normalize_term (SPT256.exp_pow2_rec S.mk_p256_concrete_ops S.base_point 64) in
normalize_term_spec (SPT256.exp_pow2_rec S.mk_p256_concrete_ops S.base_point 64);
let rX:S.felem = 0x000931f4ae428a4ad81ee0aa89cf5247ce85d4dd696c61b4bb9d4761e57b7fbe in
let rY:S.felem = 0x7e88e5e6a142d5c2269f21a158e82ab2c79fcecb26e397b96fd5b9fbcd0a69a5 in
let rZ:S.felem = 0x02626dc2dd5e06cd19de5e6afb6c5dbdd3e41dc1472e7b8ef11eb0662e41c44b in
assert_norm (qX == rX /\ qY == rY /\ qZ == rZ) | false |
FStar.BV.fst | FStar.BV.int2bv_div | val int2bv_div:
#n: pos ->
#x: uint_t n ->
#y: uint_t n {y <> 0} ->
#z: bv_t n ->
squash (bvdiv #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (udiv #n x y) == z) | val int2bv_div:
#n: pos ->
#x: uint_t n ->
#y: uint_t n {y <> 0} ->
#z: bv_t n ->
squash (bvdiv #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (udiv #n x y) == z) | let int2bv_div #n #x #y #z pf =
inverse_vec_lemma #n (bvdiv #n (int2bv #n x) y) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 115,
"start_col": 0,
"start_line": 114
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.BV
module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq
let bv_t (n : nat) = B.bv_t n
let bv_uext #n #i a =
Seq.append (Seq.create i false) a
let int2bv = U.to_vec
let bv2int = U.from_vec
let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
(** Mapping an unbounded nat to a bitvector; only used for bvshl and bvshr
compatibility funs *)
let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n)
let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num)
let list2bv #n l = S.seq_of_list l
let bv2list #n s = S.seq_to_list s
let list2bv_bij #n a = S.lemma_list_seq_bij a
let bv2list_bij #n a = S.lemma_seq_list_bij a
let bvand = B.logand_vec
let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y))
let bvxor = B.logxor_vec
let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y))
let bvor = B.logor_vec
let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y))
let bvnot = B.lognot_vec
let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x))
(*TODO: specify index functions? *)
let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s)
let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s)
let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y))
let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y)
let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s)
let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s)
let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y))
let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y)
let bvult #n a b = (bv2int #n a) < (bv2int #n b)
let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b
let bvadd #n a b =
int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b))
let int2bv_add #n #x #y #z pf =
inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y))
let bvsub #n a b =
int2bv #n (U.sub_mod (bv2int #n a) (bv2int #n b))
let int2bv_sub #n #x #y #z pf =
inverse_vec_lemma #n (bvsub #n (int2bv #n x) (int2bv #n y))
let bvdiv #n a b = | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | pf: Prims.squash (FStar.BV.bvdiv (FStar.BV.int2bv x) y == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.udiv x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"Prims.b2t",
"Prims.op_disEquality",
"Prims.int",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvdiv",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_div #n #x #y #z pf =
| inverse_vec_lemma #n (bvdiv #n (int2bv #n x) y) | false |
PulseTutorial.HigherOrder.fst | PulseTutorial.HigherOrder.id_t_a | val id_t_a : a: Type0 -> Type0 | let id_t_a (a:Type0) = x:a -> stt a emp (fun _ -> emp) | {
"file_name": "share/steel/examples/pulse/by-example/PulseTutorial.HigherOrder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 54,
"end_line": 44,
"start_col": 0,
"start_line": 44
} | module PulseTutorial.HigherOrder
open Pulse.Lib.Pervasives
module B = Pulse.Lib.Box
```pulse //apply$
fn apply (#a:Type0)
(#b:a -> Type0)
(#pre:a -> vprop)
(#post: (x:a -> b x -> vprop))
(f: (x:a -> stt (b x) (pre x) (fun y -> post x y)))
(x:a)
requires pre x
returns y:b x
ensures post x y
{
f x
}
```
```pulse //apply_ghost$
ghost
fn apply_ghost
(#a:Type0)
(#b:a -> Type0)
(#pre:a -> vprop)
(#post: (x:a -> b x -> vprop))
(f: (x:a -> stt_ghost (b x) (pre x) (fun y -> post x y)))
(x:a)
requires pre x
returns y:b x
ensures post x y
{
f x
}
```
let id_t = (#a:Type0) -> x:a -> stt a emp (fun _ -> emp)
```pulse
fn id ()
: id_t
= (#a:Type0) (x:a) { x }
``` | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Box.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "PulseTutorial.HigherOrder.fst"
} | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Box",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseTutorial",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseTutorial",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: Type0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.Core.stt",
"Pulse.Lib.Core.emp",
"Pulse.Lib.Core.vprop"
] | [] | false | false | false | true | true | let id_t_a (a: Type0) =
| x: a -> stt a emp (fun _ -> emp) | false |
|
FStar.WellFounded.fst | FStar.WellFounded.subrelation_wf | val subrelation_wf
(#a: Type)
(#r #sub_r: binrel a)
(sub_w: (x: a -> y: a -> sub_r x y -> r x y))
(r_wf: well_founded r)
: well_founded sub_r | val subrelation_wf
(#a: Type)
(#r #sub_r: binrel a)
(sub_w: (x: a -> y: a -> sub_r x y -> r x y))
(r_wf: well_founded r)
: well_founded sub_r | let subrelation_wf (#a:Type) (#r #sub_r:binrel a)
(sub_w:(x:a -> y:a -> sub_r x y -> r x y))
(r_wf:well_founded r)
: well_founded sub_r
= let rec aux (x:a) (acc_r:acc r x) : Tot (acc sub_r x) (decreases acc_r) =
AccIntro (fun y sub_r_y_x ->
aux y
(match acc_r with
| AccIntro f -> f y (sub_w y x sub_r_y_x))) in
fun x -> aux x (r_wf x) | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 91,
"start_col": 0,
"start_line": 82
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
Authors: Chantal Keller, Catalin Hritcu, Aseem Rastogi, Nikhil Swamy
*)
(* Defining accessibility predicates and well-founded recursion like in Coq
https://coq.inria.fr/library/Coq.Init.Wf.html
*)
module FStar.WellFounded
#push-options "--warn_error -242" //inner let recs not encoded to SMT; ok
let binrel (a:Type) = a -> a -> Type
(*
* The accessibility relation
* -- Marked erasable, since this is a singleton type anyway
* -- Erasability also simplifies proofs that use accessibility in
* with axioms like indefinitedescription
*)
[@@ erasable]
noeq
type acc (#a:Type u#a) (r:binrel u#a u#r a) (x:a) : Type u#(max a r) =
| AccIntro : access_smaller:(y:a -> r y x -> acc r y) -> acc r x
(*
* A binrel r is well-founded if every element is accessible
*)
let well_founded (#a:Type u#a) (r:binrel u#a u#r a) = x:a -> acc r x
(*
* Accessibility predicates can be used for implementing
* total fix points
*)
let rec fix_F (#aa:Type) (#r:binrel aa) (#p:(aa -> Type))
(f: (x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa) (a:acc r x)
: Tot (p x) (decreases a)
= f x (fun y h -> fix_F f y (a.access_smaller y h))
let fix (#aa:Type) (#r:binrel aa) (rwf:well_founded r)
(p:aa -> Type) (f:(x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa)
: p x
= fix_F f x (rwf x)
let is_well_founded (#a:Type) (rel:binrel a) =
forall (x:a). squash (acc rel x)
let well_founded_relation (a:Type) = rel:binrel a{is_well_founded rel}
unfold
let as_well_founded (#a:Type u#a)
(#rel:binrel u#a u#r a)
(f:well_founded rel)
: well_founded_relation a
= introduce forall (x:a). squash (acc rel x)
with FStar.Squash.return_squash (FStar.Squash.return_squash (f x));
rel
open FStar.IndefiniteDescription
(*
* Proofs that subrelation and inverse image commute with well-foundedness
*
* Reference: Constructing Recursion Operators in Type Theory, L. Paulson JSC (1986) 2, 325-355 | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.IndefiniteDescription",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | sub_w: (x: a -> y: a -> _: sub_r x y -> r x y) -> r_wf: FStar.WellFounded.well_founded r
-> FStar.WellFounded.well_founded sub_r | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.well_founded",
"FStar.WellFounded.acc",
"FStar.WellFounded.AccIntro",
"Prims.precedes"
] | [] | false | false | false | false | false | let subrelation_wf
(#a: Type)
(#r #sub_r: binrel a)
(sub_w: (x: a -> y: a -> sub_r x y -> r x y))
(r_wf: well_founded r)
: well_founded sub_r =
| let rec aux (x: a) (acc_r: acc r x) : Tot (acc sub_r x) (decreases acc_r) =
AccIntro (fun y sub_r_y_x -> aux y (match acc_r with | AccIntro f -> f y (sub_w y x sub_r_y_x)))
in
fun x -> aux x (r_wf x) | false |
FStar.WellFounded.fst | FStar.WellFounded.fix_F | val fix_F
(#aa: Type)
(#r: binrel aa)
(#p: (aa -> Type))
(f: (x: aa -> (y: aa -> r y x -> p y) -> p x))
(x: aa)
(a: acc r x)
: Tot (p x) (decreases a) | val fix_F
(#aa: Type)
(#r: binrel aa)
(#p: (aa -> Type))
(f: (x: aa -> (y: aa -> r y x -> p y) -> p x))
(x: aa)
(a: acc r x)
: Tot (p x) (decreases a) | let rec fix_F (#aa:Type) (#r:binrel aa) (#p:(aa -> Type))
(f: (x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa) (a:acc r x)
: Tot (p x) (decreases a)
= f x (fun y h -> fix_F f y (a.access_smaller y h)) | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 53,
"start_col": 0,
"start_line": 49
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
Authors: Chantal Keller, Catalin Hritcu, Aseem Rastogi, Nikhil Swamy
*)
(* Defining accessibility predicates and well-founded recursion like in Coq
https://coq.inria.fr/library/Coq.Init.Wf.html
*)
module FStar.WellFounded
#push-options "--warn_error -242" //inner let recs not encoded to SMT; ok
let binrel (a:Type) = a -> a -> Type
(*
* The accessibility relation
* -- Marked erasable, since this is a singleton type anyway
* -- Erasability also simplifies proofs that use accessibility in
* with axioms like indefinitedescription
*)
[@@ erasable]
noeq
type acc (#a:Type u#a) (r:binrel u#a u#r a) (x:a) : Type u#(max a r) =
| AccIntro : access_smaller:(y:a -> r y x -> acc r y) -> acc r x
(*
* A binrel r is well-founded if every element is accessible
*)
let well_founded (#a:Type u#a) (r:binrel u#a u#r a) = x:a -> acc r x
(*
* Accessibility predicates can be used for implementing
* total fix points | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | f: (x: aa -> _: (y: aa -> _: r y x -> p y) -> p x) -> x: aa -> a: FStar.WellFounded.acc r x
-> Prims.Tot (p x) | Prims.Tot | [
"total",
""
] | [] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.acc",
"FStar.WellFounded.fix_F",
"FStar.WellFounded.__proj__AccIntro__item__access_smaller"
] | [
"recursion"
] | false | false | false | false | false | let rec fix_F
(#aa: Type)
(#r: binrel aa)
(#p: (aa -> Type))
(f: (x: aa -> (y: aa -> r y x -> p y) -> p x))
(x: aa)
(a: acc r x)
: Tot (p x) (decreases a) =
| f x (fun y h -> fix_F f y (a.access_smaller y h)) | false |
FStar.WellFounded.fst | FStar.WellFounded.subrelation_squash_wf | val subrelation_squash_wf
(#a: Type u#a)
(#r: binrel u#a u#r a)
(#sub_r: binrel u#a u#sr a)
(sub_w: (x: a -> y: a -> sub_r x y -> squash (r x y)))
(r_wf: well_founded r)
: Lemma (is_well_founded sub_r) | val subrelation_squash_wf
(#a: Type u#a)
(#r: binrel u#a u#r a)
(#sub_r: binrel u#a u#sr a)
(sub_w: (x: a -> y: a -> sub_r x y -> squash (r x y)))
(r_wf: well_founded r)
: Lemma (is_well_founded sub_r) | let subrelation_squash_wf (#a:Type u#a)
(#r:binrel u#a u#r a)
(#sub_r:binrel u#a u#sr a)
(sub_w:(x:a -> y:a -> sub_r x y -> squash (r x y)))
(r_wf:well_founded r)
: Lemma (is_well_founded sub_r)
= introduce forall (x:a). squash (acc sub_r x)
with (
let rec acc_y (x:a) (acc_r:acc r x) (y:a) (p:sub_r y x)
: Tot (acc sub_r y)
(decreases acc_r)
= AccIntro (acc_y y (acc_r.access_smaller
y
(elim_squash (sub_w y x p))))
in
FStar.Squash.return_squash (FStar.Squash.return_squash (AccIntro (acc_y x (r_wf x))))
) | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 109,
"start_col": 0,
"start_line": 93
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
Authors: Chantal Keller, Catalin Hritcu, Aseem Rastogi, Nikhil Swamy
*)
(* Defining accessibility predicates and well-founded recursion like in Coq
https://coq.inria.fr/library/Coq.Init.Wf.html
*)
module FStar.WellFounded
#push-options "--warn_error -242" //inner let recs not encoded to SMT; ok
let binrel (a:Type) = a -> a -> Type
(*
* The accessibility relation
* -- Marked erasable, since this is a singleton type anyway
* -- Erasability also simplifies proofs that use accessibility in
* with axioms like indefinitedescription
*)
[@@ erasable]
noeq
type acc (#a:Type u#a) (r:binrel u#a u#r a) (x:a) : Type u#(max a r) =
| AccIntro : access_smaller:(y:a -> r y x -> acc r y) -> acc r x
(*
* A binrel r is well-founded if every element is accessible
*)
let well_founded (#a:Type u#a) (r:binrel u#a u#r a) = x:a -> acc r x
(*
* Accessibility predicates can be used for implementing
* total fix points
*)
let rec fix_F (#aa:Type) (#r:binrel aa) (#p:(aa -> Type))
(f: (x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa) (a:acc r x)
: Tot (p x) (decreases a)
= f x (fun y h -> fix_F f y (a.access_smaller y h))
let fix (#aa:Type) (#r:binrel aa) (rwf:well_founded r)
(p:aa -> Type) (f:(x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa)
: p x
= fix_F f x (rwf x)
let is_well_founded (#a:Type) (rel:binrel a) =
forall (x:a). squash (acc rel x)
let well_founded_relation (a:Type) = rel:binrel a{is_well_founded rel}
unfold
let as_well_founded (#a:Type u#a)
(#rel:binrel u#a u#r a)
(f:well_founded rel)
: well_founded_relation a
= introduce forall (x:a). squash (acc rel x)
with FStar.Squash.return_squash (FStar.Squash.return_squash (f x));
rel
open FStar.IndefiniteDescription
(*
* Proofs that subrelation and inverse image commute with well-foundedness
*
* Reference: Constructing Recursion Operators in Type Theory, L. Paulson JSC (1986) 2, 325-355
*)
let subrelation_wf (#a:Type) (#r #sub_r:binrel a)
(sub_w:(x:a -> y:a -> sub_r x y -> r x y))
(r_wf:well_founded r)
: well_founded sub_r
= let rec aux (x:a) (acc_r:acc r x) : Tot (acc sub_r x) (decreases acc_r) =
AccIntro (fun y sub_r_y_x ->
aux y
(match acc_r with
| AccIntro f -> f y (sub_w y x sub_r_y_x))) in
fun x -> aux x (r_wf x) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.IndefiniteDescription",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
sub_w: (x: a -> y: a -> _: sub_r x y -> Prims.squash (r x y)) ->
r_wf: FStar.WellFounded.well_founded r
-> FStar.Pervasives.Lemma (ensures FStar.WellFounded.is_well_founded sub_r) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.WellFounded.binrel",
"Prims.squash",
"FStar.WellFounded.well_founded",
"FStar.Classical.Sugar.forall_intro",
"FStar.WellFounded.acc",
"FStar.Squash.return_squash",
"FStar.WellFounded.AccIntro",
"FStar.WellFounded.__proj__AccIntro__item__access_smaller",
"FStar.IndefiniteDescription.elim_squash",
"Prims.unit",
"Prims.l_True",
"FStar.WellFounded.is_well_founded",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | false | false | true | false | false | let subrelation_squash_wf
(#a: Type u#a)
(#r: binrel u#a u#r a)
(#sub_r: binrel u#a u#sr a)
(sub_w: (x: a -> y: a -> sub_r x y -> squash (r x y)))
(r_wf: well_founded r)
: Lemma (is_well_founded sub_r) =
| introduce forall (x: a) . squash (acc sub_r x)
with (let rec acc_y (x: a) (acc_r: acc r x) (y: a) (p: sub_r y x)
: Tot (acc sub_r y) (decreases acc_r) =
AccIntro (acc_y y (acc_r.access_smaller y (elim_squash (sub_w y x p))))
in
FStar.Squash.return_squash (FStar.Squash.return_squash (AccIntro (acc_y x (r_wf x))))) | false |
PulseTutorial.HigherOrder.fst | PulseTutorial.HigherOrder.id_t | val id_t : Type | let id_t = (#a:Type0) -> x:a -> stt a emp (fun _ -> emp) | {
"file_name": "share/steel/examples/pulse/by-example/PulseTutorial.HigherOrder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 56,
"end_line": 36,
"start_col": 0,
"start_line": 36
} | module PulseTutorial.HigherOrder
open Pulse.Lib.Pervasives
module B = Pulse.Lib.Box
```pulse //apply$
fn apply (#a:Type0)
(#b:a -> Type0)
(#pre:a -> vprop)
(#post: (x:a -> b x -> vprop))
(f: (x:a -> stt (b x) (pre x) (fun y -> post x y)))
(x:a)
requires pre x
returns y:b x
ensures post x y
{
f x
}
```
```pulse //apply_ghost$
ghost
fn apply_ghost
(#a:Type0)
(#b:a -> Type0)
(#pre:a -> vprop)
(#post: (x:a -> b x -> vprop))
(f: (x:a -> stt_ghost (b x) (pre x) (fun y -> post x y)))
(x:a)
requires pre x
returns y:b x
ensures post x y
{
f x
}
``` | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Box.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "PulseTutorial.HigherOrder.fst"
} | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Box",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseTutorial",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseTutorial",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Type | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.Core.stt",
"Pulse.Lib.Core.emp",
"Pulse.Lib.Core.vprop"
] | [] | false | false | false | true | true | let id_t =
| #a: Type0 -> x: a -> stt a emp (fun _ -> emp) | false |
|
FStar.WellFounded.fst | FStar.WellFounded.inverse_image_wf | val inverse_image_wf
(#a: Type u#a)
(#b: Type u#b)
(#r_b: binrel u#b u#r b)
(f: (a -> b))
(r_b_wf: well_founded r_b)
: well_founded (inverse_image r_b f) | val inverse_image_wf
(#a: Type u#a)
(#b: Type u#b)
(#r_b: binrel u#b u#r b)
(f: (a -> b))
(r_b_wf: well_founded r_b)
: well_founded (inverse_image r_b f) | let inverse_image_wf (#a:Type u#a) (#b:Type u#b) (#r_b:binrel u#b u#r b)
(f:a -> b)
(r_b_wf:well_founded r_b)
: well_founded (inverse_image r_b f)
= let rec aux (x:a) (acc_r_b:acc r_b (f x))
: Tot (acc (inverse_image r_b f) x)
(decreases acc_r_b) =
AccIntro (fun y p -> aux y (acc_r_b.access_smaller (f y) p))
in
fun x -> aux x (r_b_wf (f x)) | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"end_line": 131,
"start_col": 0,
"start_line": 122
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
Authors: Chantal Keller, Catalin Hritcu, Aseem Rastogi, Nikhil Swamy
*)
(* Defining accessibility predicates and well-founded recursion like in Coq
https://coq.inria.fr/library/Coq.Init.Wf.html
*)
module FStar.WellFounded
#push-options "--warn_error -242" //inner let recs not encoded to SMT; ok
let binrel (a:Type) = a -> a -> Type
(*
* The accessibility relation
* -- Marked erasable, since this is a singleton type anyway
* -- Erasability also simplifies proofs that use accessibility in
* with axioms like indefinitedescription
*)
[@@ erasable]
noeq
type acc (#a:Type u#a) (r:binrel u#a u#r a) (x:a) : Type u#(max a r) =
| AccIntro : access_smaller:(y:a -> r y x -> acc r y) -> acc r x
(*
* A binrel r is well-founded if every element is accessible
*)
let well_founded (#a:Type u#a) (r:binrel u#a u#r a) = x:a -> acc r x
(*
* Accessibility predicates can be used for implementing
* total fix points
*)
let rec fix_F (#aa:Type) (#r:binrel aa) (#p:(aa -> Type))
(f: (x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa) (a:acc r x)
: Tot (p x) (decreases a)
= f x (fun y h -> fix_F f y (a.access_smaller y h))
let fix (#aa:Type) (#r:binrel aa) (rwf:well_founded r)
(p:aa -> Type) (f:(x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa)
: p x
= fix_F f x (rwf x)
let is_well_founded (#a:Type) (rel:binrel a) =
forall (x:a). squash (acc rel x)
let well_founded_relation (a:Type) = rel:binrel a{is_well_founded rel}
unfold
let as_well_founded (#a:Type u#a)
(#rel:binrel u#a u#r a)
(f:well_founded rel)
: well_founded_relation a
= introduce forall (x:a). squash (acc rel x)
with FStar.Squash.return_squash (FStar.Squash.return_squash (f x));
rel
open FStar.IndefiniteDescription
(*
* Proofs that subrelation and inverse image commute with well-foundedness
*
* Reference: Constructing Recursion Operators in Type Theory, L. Paulson JSC (1986) 2, 325-355
*)
let subrelation_wf (#a:Type) (#r #sub_r:binrel a)
(sub_w:(x:a -> y:a -> sub_r x y -> r x y))
(r_wf:well_founded r)
: well_founded sub_r
= let rec aux (x:a) (acc_r:acc r x) : Tot (acc sub_r x) (decreases acc_r) =
AccIntro (fun y sub_r_y_x ->
aux y
(match acc_r with
| AccIntro f -> f y (sub_w y x sub_r_y_x))) in
fun x -> aux x (r_wf x)
let subrelation_squash_wf (#a:Type u#a)
(#r:binrel u#a u#r a)
(#sub_r:binrel u#a u#sr a)
(sub_w:(x:a -> y:a -> sub_r x y -> squash (r x y)))
(r_wf:well_founded r)
: Lemma (is_well_founded sub_r)
= introduce forall (x:a). squash (acc sub_r x)
with (
let rec acc_y (x:a) (acc_r:acc r x) (y:a) (p:sub_r y x)
: Tot (acc sub_r y)
(decreases acc_r)
= AccIntro (acc_y y (acc_r.access_smaller
y
(elim_squash (sub_w y x p))))
in
FStar.Squash.return_squash (FStar.Squash.return_squash (AccIntro (acc_y x (r_wf x))))
)
unfold
let subrelation_as_wf (#a:Type u#a) (#r #sub_r:binrel u#a u#r a)
(sub_w:(x:a -> y:a -> sub_r x y -> squash (r x y)))
(r_wf:well_founded r)
: well_founded_relation a
= subrelation_squash_wf sub_w r_wf;
sub_r
let inverse_image (#a:Type u#a) (#b:Type u#b) (r_b:binrel u#b u#r b) (f:a -> b) : binrel u#a u#r a =
fun x y -> r_b (f x) (f y) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.IndefiniteDescription",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | f: (_: a -> b) -> r_b_wf: FStar.WellFounded.well_founded r_b
-> FStar.WellFounded.well_founded (FStar.WellFounded.inverse_image r_b f) | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.well_founded",
"FStar.WellFounded.acc",
"FStar.WellFounded.inverse_image",
"FStar.WellFounded.AccIntro",
"FStar.WellFounded.__proj__AccIntro__item__access_smaller"
] | [] | false | false | false | false | false | let inverse_image_wf
(#a: Type u#a)
(#b: Type u#b)
(#r_b: binrel u#b u#r b)
(f: (a -> b))
(r_b_wf: well_founded r_b)
: well_founded (inverse_image r_b f) =
| let rec aux (x: a) (acc_r_b: acc r_b (f x)) : Tot (acc (inverse_image r_b f) x) (decreases acc_r_b)
=
AccIntro (fun y p -> aux y (acc_r_b.access_smaller (f y) p))
in
fun x -> aux x (r_b_wf (f x)) | false |
PulseTutorial.HigherOrder.fst | PulseTutorial.HigherOrder.next | val next : c: PulseTutorial.HigherOrder.ctr -> i: FStar.Ghost.erased Prims.int
-> Pulse.Lib.Core.stt Prims.int
(Mkctr?.inv c (FStar.Ghost.reveal i))
(fun y ->
Mkctr?.inv c (FStar.Ghost.reveal i + 1) ** Pulse.Lib.Core.pure (y == FStar.Ghost.reveal i)
) | let next c = c.next | {
"file_name": "share/steel/examples/pulse/by-example/PulseTutorial.HigherOrder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 19,
"end_line": 60,
"start_col": 0,
"start_line": 60
} | module PulseTutorial.HigherOrder
open Pulse.Lib.Pervasives
module B = Pulse.Lib.Box
```pulse //apply$
fn apply (#a:Type0)
(#b:a -> Type0)
(#pre:a -> vprop)
(#post: (x:a -> b x -> vprop))
(f: (x:a -> stt (b x) (pre x) (fun y -> post x y)))
(x:a)
requires pre x
returns y:b x
ensures post x y
{
f x
}
```
```pulse //apply_ghost$
ghost
fn apply_ghost
(#a:Type0)
(#b:a -> Type0)
(#pre:a -> vprop)
(#post: (x:a -> b x -> vprop))
(f: (x:a -> stt_ghost (b x) (pre x) (fun y -> post x y)))
(x:a)
requires pre x
returns y:b x
ensures post x y
{
f x
}
```
let id_t = (#a:Type0) -> x:a -> stt a emp (fun _ -> emp)
```pulse
fn id ()
: id_t
= (#a:Type0) (x:a) { x }
```
let id_t_a (a:Type0) = x:a -> stt a emp (fun _ -> emp)
```pulse
fn id_a (a:Type0)
: id_t_a a
= (x:a) { x }
```
//ctr$
noeq
type ctr = {
inv: int -> vprop;
next: i:erased int -> stt int (inv i) (fun y -> inv (i + 1) ** pure (y == reveal i));
destroy: i:erased int -> stt unit (inv i) (fun _ -> emp)
} | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Box.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "PulseTutorial.HigherOrder.fst"
} | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Box",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseTutorial",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseTutorial",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | c: PulseTutorial.HigherOrder.ctr -> i: FStar.Ghost.erased Prims.int
-> Pulse.Lib.Core.stt Prims.int
(Mkctr?.inv c (FStar.Ghost.reveal i))
(fun y ->
Mkctr?.inv c (FStar.Ghost.reveal i + 1) ** Pulse.Lib.Core.pure (y == FStar.Ghost.reveal i)
) | Prims.Tot | [
"total"
] | [] | [
"PulseTutorial.HigherOrder.ctr",
"PulseTutorial.HigherOrder.__proj__Mkctr__item__next",
"FStar.Ghost.erased",
"Prims.int",
"Pulse.Lib.Core.stt",
"PulseTutorial.HigherOrder.__proj__Mkctr__item__inv",
"FStar.Ghost.reveal",
"Pulse.Lib.Core.op_Star_Star",
"Prims.op_Addition",
"Pulse.Lib.Core.pure",
"Prims.eq2",
"Pulse.Lib.Core.vprop"
] | [] | false | false | false | false | false | let next c =
| c.next | false |
|
PulseTutorial.HigherOrder.fst | PulseTutorial.HigherOrder.destroy | val destroy : c: PulseTutorial.HigherOrder.ctr -> i: FStar.Ghost.erased Prims.int
-> Pulse.Lib.Core.stt Prims.unit
(Mkctr?.inv c (FStar.Ghost.reveal i))
(fun _ -> Pulse.Lib.Core.emp) | let destroy c = c.destroy | {
"file_name": "share/steel/examples/pulse/by-example/PulseTutorial.HigherOrder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 25,
"end_line": 61,
"start_col": 0,
"start_line": 61
} | module PulseTutorial.HigherOrder
open Pulse.Lib.Pervasives
module B = Pulse.Lib.Box
```pulse //apply$
fn apply (#a:Type0)
(#b:a -> Type0)
(#pre:a -> vprop)
(#post: (x:a -> b x -> vprop))
(f: (x:a -> stt (b x) (pre x) (fun y -> post x y)))
(x:a)
requires pre x
returns y:b x
ensures post x y
{
f x
}
```
```pulse //apply_ghost$
ghost
fn apply_ghost
(#a:Type0)
(#b:a -> Type0)
(#pre:a -> vprop)
(#post: (x:a -> b x -> vprop))
(f: (x:a -> stt_ghost (b x) (pre x) (fun y -> post x y)))
(x:a)
requires pre x
returns y:b x
ensures post x y
{
f x
}
```
let id_t = (#a:Type0) -> x:a -> stt a emp (fun _ -> emp)
```pulse
fn id ()
: id_t
= (#a:Type0) (x:a) { x }
```
let id_t_a (a:Type0) = x:a -> stt a emp (fun _ -> emp)
```pulse
fn id_a (a:Type0)
: id_t_a a
= (x:a) { x }
```
//ctr$
noeq
type ctr = {
inv: int -> vprop;
next: i:erased int -> stt int (inv i) (fun y -> inv (i + 1) ** pure (y == reveal i));
destroy: i:erased int -> stt unit (inv i) (fun _ -> emp)
}
//ctr$ | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Box.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "PulseTutorial.HigherOrder.fst"
} | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Box",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseTutorial",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseTutorial",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | c: PulseTutorial.HigherOrder.ctr -> i: FStar.Ghost.erased Prims.int
-> Pulse.Lib.Core.stt Prims.unit
(Mkctr?.inv c (FStar.Ghost.reveal i))
(fun _ -> Pulse.Lib.Core.emp) | Prims.Tot | [
"total"
] | [] | [
"PulseTutorial.HigherOrder.ctr",
"PulseTutorial.HigherOrder.__proj__Mkctr__item__destroy",
"FStar.Ghost.erased",
"Prims.int",
"Pulse.Lib.Core.stt",
"Prims.unit",
"PulseTutorial.HigherOrder.__proj__Mkctr__item__inv",
"FStar.Ghost.reveal",
"Pulse.Lib.Core.emp",
"Pulse.Lib.Core.vprop"
] | [] | false | false | false | false | false | let destroy c =
| c.destroy | false |
|
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.op_At | val op_At : x: Prims.list _ -> y: Prims.list _ -> Prims.list _ | let (@) = L.op_At | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 25,
"end_line": 30,
"start_col": 8,
"start_line": 30
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.Tactics.V1.Derived
open FStar.Reflection.V1
open FStar.Reflection.V1.Formula
open FStar.Tactics.Effect
open FStar.Stubs.Tactics.Types
open FStar.Stubs.Tactics.Result
open FStar.Tactics.Util
open FStar.Stubs.Tactics.V1.Builtins
open FStar.Tactics.V1.SyntaxHelpers
open FStar.VConfig
module L = FStar.List.Tot.Base | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checked",
"FStar.Stubs.Tactics.Types.fsti.checked",
"FStar.Stubs.Tactics.Result.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V1.Formula.fst.checked",
"FStar.Reflection.V1.fst.checked",
"FStar.Range.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Tactics.V1.Derived.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1.SyntaxHelpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.V1.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Result",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | x: Prims.list _ -> y: Prims.list _ -> Prims.list _ | Prims.Tot | [
"total"
] | [] | [
"FStar.List.Tot.Base.op_At",
"Prims.list"
] | [] | false | false | false | true | false | <UNK> | <UNK> | false |
|
Hacl.Spec.Bignum.Karatsuba.fst | Hacl.Spec.Bignum.Karatsuba.bn_mul_threshold | val bn_mul_threshold : Prims.int | let bn_mul_threshold = 32 | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Karatsuba.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 25,
"end_line": 23,
"start_col": 0,
"start_line": 23
} | module Hacl.Spec.Bignum.Karatsuba
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
open Hacl.Spec.Bignum.Base
open Hacl.Spec.Bignum.Lib
open Hacl.Spec.Lib
open Hacl.Spec.Bignum.Addition
open Hacl.Spec.Bignum.Multiplication
open Hacl.Spec.Bignum.Squaring
module K = Hacl.Spec.Karatsuba.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0" | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Lib.fst.checked",
"Hacl.Spec.Karatsuba.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Squaring.fst.checked",
"Hacl.Spec.Bignum.Multiplication.fst.checked",
"Hacl.Spec.Bignum.Lib.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Base.fst.checked",
"Hacl.Spec.Bignum.Addition.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Bignum.Karatsuba.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Karatsuba.Lemmas",
"short_module": "K"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Squaring",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Multiplication",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Addition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.int | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let bn_mul_threshold =
| 32 | false |
|
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.name_of_bv | val name_of_bv (bv: bv) : Tac string | val name_of_bv (bv: bv) : Tac string | let name_of_bv (bv : bv) : Tac string =
unseal ((inspect_bv bv).bv_ppname) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 33,
"start_col": 0,
"start_line": 32
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.Tactics.V1.Derived
open FStar.Reflection.V1
open FStar.Reflection.V1.Formula
open FStar.Tactics.Effect
open FStar.Stubs.Tactics.Types
open FStar.Stubs.Tactics.Result
open FStar.Tactics.Util
open FStar.Stubs.Tactics.V1.Builtins
open FStar.Tactics.V1.SyntaxHelpers
open FStar.VConfig
module L = FStar.List.Tot.Base
module V = FStar.Tactics.Visit
private let (@) = L.op_At | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checked",
"FStar.Stubs.Tactics.Types.fsti.checked",
"FStar.Stubs.Tactics.Result.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V1.Formula.fst.checked",
"FStar.Reflection.V1.fst.checked",
"FStar.Range.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Tactics.V1.Derived.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1.SyntaxHelpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.V1.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Result",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | bv: FStar.Stubs.Reflection.Types.bv -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.bv",
"FStar.Tactics.Unseal.unseal",
"Prims.string",
"FStar.Stubs.Reflection.V1.Data.__proj__Mkbv_view__item__bv_ppname",
"FStar.Stubs.Reflection.V1.Builtins.inspect_bv"
] | [] | false | true | false | false | false | let name_of_bv (bv: bv) : Tac string =
| unseal ((inspect_bv bv).bv_ppname) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.name_of_binder | val name_of_binder (b: binder) : Tac string | val name_of_binder (b: binder) : Tac string | let name_of_binder (b : binder) : Tac string =
name_of_bv (bv_of_binder b) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 40,
"start_col": 0,
"start_line": 39
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.Tactics.V1.Derived
open FStar.Reflection.V1
open FStar.Reflection.V1.Formula
open FStar.Tactics.Effect
open FStar.Stubs.Tactics.Types
open FStar.Stubs.Tactics.Result
open FStar.Tactics.Util
open FStar.Stubs.Tactics.V1.Builtins
open FStar.Tactics.V1.SyntaxHelpers
open FStar.VConfig
module L = FStar.List.Tot.Base
module V = FStar.Tactics.Visit
private let (@) = L.op_At
let name_of_bv (bv : bv) : Tac string =
unseal ((inspect_bv bv).bv_ppname)
let bv_to_string (bv : bv) : Tac string =
(* Could also print type...? *)
name_of_bv bv | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checked",
"FStar.Stubs.Tactics.Types.fsti.checked",
"FStar.Stubs.Tactics.Result.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V1.Formula.fst.checked",
"FStar.Reflection.V1.fst.checked",
"FStar.Range.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Tactics.V1.Derived.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1.SyntaxHelpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.V1.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Result",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | b: FStar.Stubs.Reflection.Types.binder -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.binder",
"FStar.Tactics.V1.Derived.name_of_bv",
"FStar.Reflection.V1.Derived.bv_of_binder",
"Prims.string"
] | [] | false | true | false | false | false | let name_of_binder (b: binder) : Tac string =
| name_of_bv (bv_of_binder b) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.bv_to_string | val bv_to_string (bv: bv) : Tac string | val bv_to_string (bv: bv) : Tac string | let bv_to_string (bv : bv) : Tac string =
(* Could also print type...? *)
name_of_bv bv | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 37,
"start_col": 0,
"start_line": 35
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.Tactics.V1.Derived
open FStar.Reflection.V1
open FStar.Reflection.V1.Formula
open FStar.Tactics.Effect
open FStar.Stubs.Tactics.Types
open FStar.Stubs.Tactics.Result
open FStar.Tactics.Util
open FStar.Stubs.Tactics.V1.Builtins
open FStar.Tactics.V1.SyntaxHelpers
open FStar.VConfig
module L = FStar.List.Tot.Base
module V = FStar.Tactics.Visit
private let (@) = L.op_At
let name_of_bv (bv : bv) : Tac string =
unseal ((inspect_bv bv).bv_ppname) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checked",
"FStar.Stubs.Tactics.Types.fsti.checked",
"FStar.Stubs.Tactics.Result.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V1.Formula.fst.checked",
"FStar.Reflection.V1.fst.checked",
"FStar.Range.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Tactics.V1.Derived.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1.SyntaxHelpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.V1.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Result",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | bv: FStar.Stubs.Reflection.Types.bv -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.bv",
"FStar.Tactics.V1.Derived.name_of_bv",
"Prims.string"
] | [] | false | true | false | false | false | let bv_to_string (bv: bv) : Tac string =
| name_of_bv bv | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.binder_to_string | val binder_to_string (b: binder) : Tac string | val binder_to_string (b: binder) : Tac string | let binder_to_string (b : binder) : Tac string =
bv_to_string (bv_of_binder b) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"end_line": 43,
"start_col": 0,
"start_line": 42
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.Tactics.V1.Derived
open FStar.Reflection.V1
open FStar.Reflection.V1.Formula
open FStar.Tactics.Effect
open FStar.Stubs.Tactics.Types
open FStar.Stubs.Tactics.Result
open FStar.Tactics.Util
open FStar.Stubs.Tactics.V1.Builtins
open FStar.Tactics.V1.SyntaxHelpers
open FStar.VConfig
module L = FStar.List.Tot.Base
module V = FStar.Tactics.Visit
private let (@) = L.op_At
let name_of_bv (bv : bv) : Tac string =
unseal ((inspect_bv bv).bv_ppname)
let bv_to_string (bv : bv) : Tac string =
(* Could also print type...? *)
name_of_bv bv
let name_of_binder (b : binder) : Tac string =
name_of_bv (bv_of_binder b) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checked",
"FStar.Stubs.Tactics.Types.fsti.checked",
"FStar.Stubs.Tactics.Result.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V1.Formula.fst.checked",
"FStar.Reflection.V1.fst.checked",
"FStar.Range.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Tactics.V1.Derived.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1.SyntaxHelpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.V1.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Result",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | b: FStar.Stubs.Reflection.Types.binder -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.binder",
"FStar.Tactics.V1.Derived.bv_to_string",
"FStar.Reflection.V1.Derived.bv_of_binder",
"Prims.string"
] | [] | false | true | false | false | false | let binder_to_string (b: binder) : Tac string =
| bv_to_string (bv_of_binder b) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.goals | val goals: Prims.unit -> Tac (list goal) | val goals: Prims.unit -> Tac (list goal) | let goals () : Tac (list goal) = goals_of (get ()) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 47,
"start_col": 0,
"start_line": 47
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.Tactics.V1.Derived
open FStar.Reflection.V1
open FStar.Reflection.V1.Formula
open FStar.Tactics.Effect
open FStar.Stubs.Tactics.Types
open FStar.Stubs.Tactics.Result
open FStar.Tactics.Util
open FStar.Stubs.Tactics.V1.Builtins
open FStar.Tactics.V1.SyntaxHelpers
open FStar.VConfig
module L = FStar.List.Tot.Base
module V = FStar.Tactics.Visit
private let (@) = L.op_At
let name_of_bv (bv : bv) : Tac string =
unseal ((inspect_bv bv).bv_ppname)
let bv_to_string (bv : bv) : Tac string =
(* Could also print type...? *)
name_of_bv bv
let name_of_binder (b : binder) : Tac string =
name_of_bv (bv_of_binder b)
let binder_to_string (b : binder) : Tac string =
bv_to_string (bv_of_binder b) //TODO: print aqual, attributes
exception Goal_not_trivial | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checked",
"FStar.Stubs.Tactics.Types.fsti.checked",
"FStar.Stubs.Tactics.Result.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V1.Formula.fst.checked",
"FStar.Reflection.V1.fst.checked",
"FStar.Range.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Tactics.V1.Derived.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1.SyntaxHelpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.V1.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Result",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.Tactics.Effect.Tac (Prims.list FStar.Stubs.Tactics.Types.goal) | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Stubs.Tactics.Types.goals_of",
"Prims.list",
"FStar.Stubs.Tactics.Types.goal",
"FStar.Stubs.Tactics.Types.proofstate",
"FStar.Tactics.Effect.get"
] | [] | false | true | false | false | false | let goals () : Tac (list goal) =
| goals_of (get ()) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.smt_goals | val smt_goals: Prims.unit -> Tac (list goal) | val smt_goals: Prims.unit -> Tac (list goal) | let smt_goals () : Tac (list goal) = smt_goals_of (get ()) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 48,
"start_col": 0,
"start_line": 48
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.Tactics.V1.Derived
open FStar.Reflection.V1
open FStar.Reflection.V1.Formula
open FStar.Tactics.Effect
open FStar.Stubs.Tactics.Types
open FStar.Stubs.Tactics.Result
open FStar.Tactics.Util
open FStar.Stubs.Tactics.V1.Builtins
open FStar.Tactics.V1.SyntaxHelpers
open FStar.VConfig
module L = FStar.List.Tot.Base
module V = FStar.Tactics.Visit
private let (@) = L.op_At
let name_of_bv (bv : bv) : Tac string =
unseal ((inspect_bv bv).bv_ppname)
let bv_to_string (bv : bv) : Tac string =
(* Could also print type...? *)
name_of_bv bv
let name_of_binder (b : binder) : Tac string =
name_of_bv (bv_of_binder b)
let binder_to_string (b : binder) : Tac string =
bv_to_string (bv_of_binder b) //TODO: print aqual, attributes
exception Goal_not_trivial | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checked",
"FStar.Stubs.Tactics.Types.fsti.checked",
"FStar.Stubs.Tactics.Result.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V1.Formula.fst.checked",
"FStar.Reflection.V1.fst.checked",
"FStar.Range.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Tactics.V1.Derived.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1.SyntaxHelpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.V1.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Result",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.Tactics.Effect.Tac (Prims.list FStar.Stubs.Tactics.Types.goal) | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Stubs.Tactics.Types.smt_goals_of",
"Prims.list",
"FStar.Stubs.Tactics.Types.goal",
"FStar.Stubs.Tactics.Types.proofstate",
"FStar.Tactics.Effect.get"
] | [] | false | true | false | false | false | let smt_goals () : Tac (list goal) =
| smt_goals_of (get ()) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.cur_env | val cur_env: Prims.unit -> Tac env | val cur_env: Prims.unit -> Tac env | let cur_env () : Tac env = goal_env (_cur_goal ()) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 66,
"start_col": 0,
"start_line": 66
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.Tactics.V1.Derived
open FStar.Reflection.V1
open FStar.Reflection.V1.Formula
open FStar.Tactics.Effect
open FStar.Stubs.Tactics.Types
open FStar.Stubs.Tactics.Result
open FStar.Tactics.Util
open FStar.Stubs.Tactics.V1.Builtins
open FStar.Tactics.V1.SyntaxHelpers
open FStar.VConfig
module L = FStar.List.Tot.Base
module V = FStar.Tactics.Visit
private let (@) = L.op_At
let name_of_bv (bv : bv) : Tac string =
unseal ((inspect_bv bv).bv_ppname)
let bv_to_string (bv : bv) : Tac string =
(* Could also print type...? *)
name_of_bv bv
let name_of_binder (b : binder) : Tac string =
name_of_bv (bv_of_binder b)
let binder_to_string (b : binder) : Tac string =
bv_to_string (bv_of_binder b) //TODO: print aqual, attributes
exception Goal_not_trivial
let goals () : Tac (list goal) = goals_of (get ())
let smt_goals () : Tac (list goal) = smt_goals_of (get ())
let fail (#a:Type) (m:string)
: TAC a (fun ps post -> post (Failed (TacticFailure m) ps))
= raise #a (TacticFailure m)
let fail_silently (#a:Type) (m:string)
: TAC a (fun _ post -> forall ps. post (Failed (TacticFailure m) ps))
= set_urgency 0;
raise #a (TacticFailure m)
(** Return the current *goal*, not its type. (Ignores SMT goals) *)
let _cur_goal () : Tac goal =
match goals () with
| [] -> fail "no more goals"
| g::_ -> g | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checked",
"FStar.Stubs.Tactics.Types.fsti.checked",
"FStar.Stubs.Tactics.Result.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V1.Formula.fst.checked",
"FStar.Reflection.V1.fst.checked",
"FStar.Range.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Tactics.V1.Derived.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1.SyntaxHelpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.V1.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Result",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.Tactics.Effect.Tac FStar.Stubs.Reflection.Types.env | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Stubs.Tactics.Types.goal_env",
"FStar.Stubs.Reflection.Types.env",
"FStar.Stubs.Tactics.Types.goal",
"FStar.Tactics.V1.Derived._cur_goal"
] | [] | false | true | false | false | false | let cur_env () : Tac env =
| goal_env (_cur_goal ()) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.cur_goal | val cur_goal: Prims.unit -> Tac typ | val cur_goal: Prims.unit -> Tac typ | let cur_goal () : Tac typ = goal_type (_cur_goal ()) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 69,
"start_col": 0,
"start_line": 69
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.Tactics.V1.Derived
open FStar.Reflection.V1
open FStar.Reflection.V1.Formula
open FStar.Tactics.Effect
open FStar.Stubs.Tactics.Types
open FStar.Stubs.Tactics.Result
open FStar.Tactics.Util
open FStar.Stubs.Tactics.V1.Builtins
open FStar.Tactics.V1.SyntaxHelpers
open FStar.VConfig
module L = FStar.List.Tot.Base
module V = FStar.Tactics.Visit
private let (@) = L.op_At
let name_of_bv (bv : bv) : Tac string =
unseal ((inspect_bv bv).bv_ppname)
let bv_to_string (bv : bv) : Tac string =
(* Could also print type...? *)
name_of_bv bv
let name_of_binder (b : binder) : Tac string =
name_of_bv (bv_of_binder b)
let binder_to_string (b : binder) : Tac string =
bv_to_string (bv_of_binder b) //TODO: print aqual, attributes
exception Goal_not_trivial
let goals () : Tac (list goal) = goals_of (get ())
let smt_goals () : Tac (list goal) = smt_goals_of (get ())
let fail (#a:Type) (m:string)
: TAC a (fun ps post -> post (Failed (TacticFailure m) ps))
= raise #a (TacticFailure m)
let fail_silently (#a:Type) (m:string)
: TAC a (fun _ post -> forall ps. post (Failed (TacticFailure m) ps))
= set_urgency 0;
raise #a (TacticFailure m)
(** Return the current *goal*, not its type. (Ignores SMT goals) *)
let _cur_goal () : Tac goal =
match goals () with
| [] -> fail "no more goals"
| g::_ -> g
(** [cur_env] returns the current goal's environment *)
let cur_env () : Tac env = goal_env (_cur_goal ()) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checked",
"FStar.Stubs.Tactics.Types.fsti.checked",
"FStar.Stubs.Tactics.Result.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V1.Formula.fst.checked",
"FStar.Reflection.V1.fst.checked",
"FStar.Range.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Tactics.V1.Derived.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1.SyntaxHelpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.V1.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Result",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.Tactics.Effect.Tac FStar.Stubs.Reflection.Types.typ | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Stubs.Tactics.Types.goal_type",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Stubs.Tactics.Types.goal",
"FStar.Tactics.V1.Derived._cur_goal"
] | [] | false | true | false | false | false | let cur_goal () : Tac typ =
| goal_type (_cur_goal ()) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.cur_witness | val cur_witness: Prims.unit -> Tac term | val cur_witness: Prims.unit -> Tac term | let cur_witness () : Tac term = goal_witness (_cur_goal ()) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 59,
"end_line": 72,
"start_col": 0,
"start_line": 72
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.Tactics.V1.Derived
open FStar.Reflection.V1
open FStar.Reflection.V1.Formula
open FStar.Tactics.Effect
open FStar.Stubs.Tactics.Types
open FStar.Stubs.Tactics.Result
open FStar.Tactics.Util
open FStar.Stubs.Tactics.V1.Builtins
open FStar.Tactics.V1.SyntaxHelpers
open FStar.VConfig
module L = FStar.List.Tot.Base
module V = FStar.Tactics.Visit
private let (@) = L.op_At
let name_of_bv (bv : bv) : Tac string =
unseal ((inspect_bv bv).bv_ppname)
let bv_to_string (bv : bv) : Tac string =
(* Could also print type...? *)
name_of_bv bv
let name_of_binder (b : binder) : Tac string =
name_of_bv (bv_of_binder b)
let binder_to_string (b : binder) : Tac string =
bv_to_string (bv_of_binder b) //TODO: print aqual, attributes
exception Goal_not_trivial
let goals () : Tac (list goal) = goals_of (get ())
let smt_goals () : Tac (list goal) = smt_goals_of (get ())
let fail (#a:Type) (m:string)
: TAC a (fun ps post -> post (Failed (TacticFailure m) ps))
= raise #a (TacticFailure m)
let fail_silently (#a:Type) (m:string)
: TAC a (fun _ post -> forall ps. post (Failed (TacticFailure m) ps))
= set_urgency 0;
raise #a (TacticFailure m)
(** Return the current *goal*, not its type. (Ignores SMT goals) *)
let _cur_goal () : Tac goal =
match goals () with
| [] -> fail "no more goals"
| g::_ -> g
(** [cur_env] returns the current goal's environment *)
let cur_env () : Tac env = goal_env (_cur_goal ())
(** [cur_goal] returns the current goal's type *)
let cur_goal () : Tac typ = goal_type (_cur_goal ()) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checked",
"FStar.Stubs.Tactics.Types.fsti.checked",
"FStar.Stubs.Tactics.Result.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V1.Formula.fst.checked",
"FStar.Reflection.V1.fst.checked",
"FStar.Range.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Tactics.V1.Derived.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1.SyntaxHelpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.V1.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Result",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.Tactics.Effect.Tac FStar.Stubs.Reflection.Types.term | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Stubs.Tactics.Types.goal_witness",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Tactics.Types.goal",
"FStar.Tactics.V1.Derived._cur_goal"
] | [] | false | true | false | false | false | let cur_witness () : Tac term =
| goal_witness (_cur_goal ()) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.cur_binders | val cur_binders: Prims.unit -> Tac binders | val cur_binders: Prims.unit -> Tac binders | let cur_binders () : Tac binders =
binders_of_env (cur_env ()) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 84,
"start_col": 0,
"start_line": 83
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.Tactics.V1.Derived
open FStar.Reflection.V1
open FStar.Reflection.V1.Formula
open FStar.Tactics.Effect
open FStar.Stubs.Tactics.Types
open FStar.Stubs.Tactics.Result
open FStar.Tactics.Util
open FStar.Stubs.Tactics.V1.Builtins
open FStar.Tactics.V1.SyntaxHelpers
open FStar.VConfig
module L = FStar.List.Tot.Base
module V = FStar.Tactics.Visit
private let (@) = L.op_At
let name_of_bv (bv : bv) : Tac string =
unseal ((inspect_bv bv).bv_ppname)
let bv_to_string (bv : bv) : Tac string =
(* Could also print type...? *)
name_of_bv bv
let name_of_binder (b : binder) : Tac string =
name_of_bv (bv_of_binder b)
let binder_to_string (b : binder) : Tac string =
bv_to_string (bv_of_binder b) //TODO: print aqual, attributes
exception Goal_not_trivial
let goals () : Tac (list goal) = goals_of (get ())
let smt_goals () : Tac (list goal) = smt_goals_of (get ())
let fail (#a:Type) (m:string)
: TAC a (fun ps post -> post (Failed (TacticFailure m) ps))
= raise #a (TacticFailure m)
let fail_silently (#a:Type) (m:string)
: TAC a (fun _ post -> forall ps. post (Failed (TacticFailure m) ps))
= set_urgency 0;
raise #a (TacticFailure m)
(** Return the current *goal*, not its type. (Ignores SMT goals) *)
let _cur_goal () : Tac goal =
match goals () with
| [] -> fail "no more goals"
| g::_ -> g
(** [cur_env] returns the current goal's environment *)
let cur_env () : Tac env = goal_env (_cur_goal ())
(** [cur_goal] returns the current goal's type *)
let cur_goal () : Tac typ = goal_type (_cur_goal ())
(** [cur_witness] returns the current goal's witness *)
let cur_witness () : Tac term = goal_witness (_cur_goal ())
(** [cur_goal_safe] will always return the current goal, without failing.
It must be statically verified that there indeed is a goal in order to
call it. *)
let cur_goal_safe () : TacH goal (requires (fun ps -> ~(goals_of ps == [])))
(ensures (fun ps0 r -> exists g. r == Success g ps0))
= match goals_of (get ()) with
| g :: _ -> g | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checked",
"FStar.Stubs.Tactics.Types.fsti.checked",
"FStar.Stubs.Tactics.Result.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V1.Formula.fst.checked",
"FStar.Reflection.V1.fst.checked",
"FStar.Range.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Tactics.V1.Derived.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1.SyntaxHelpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.V1.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Result",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.Tactics.Effect.Tac FStar.Stubs.Reflection.Types.binders | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Stubs.Reflection.V1.Builtins.binders_of_env",
"FStar.Stubs.Reflection.Types.binders",
"FStar.Stubs.Reflection.Types.env",
"FStar.Tactics.V1.Derived.cur_env"
] | [] | false | true | false | false | false | let cur_binders () : Tac binders =
| binders_of_env (cur_env ()) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.exact | val exact (t: term) : Tac unit | val exact (t: term) : Tac unit | let exact (t : term) : Tac unit =
with_policy SMT (fun () -> t_exact true false t) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 97,
"start_col": 0,
"start_line": 96
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.Tactics.V1.Derived
open FStar.Reflection.V1
open FStar.Reflection.V1.Formula
open FStar.Tactics.Effect
open FStar.Stubs.Tactics.Types
open FStar.Stubs.Tactics.Result
open FStar.Tactics.Util
open FStar.Stubs.Tactics.V1.Builtins
open FStar.Tactics.V1.SyntaxHelpers
open FStar.VConfig
module L = FStar.List.Tot.Base
module V = FStar.Tactics.Visit
private let (@) = L.op_At
let name_of_bv (bv : bv) : Tac string =
unseal ((inspect_bv bv).bv_ppname)
let bv_to_string (bv : bv) : Tac string =
(* Could also print type...? *)
name_of_bv bv
let name_of_binder (b : binder) : Tac string =
name_of_bv (bv_of_binder b)
let binder_to_string (b : binder) : Tac string =
bv_to_string (bv_of_binder b) //TODO: print aqual, attributes
exception Goal_not_trivial
let goals () : Tac (list goal) = goals_of (get ())
let smt_goals () : Tac (list goal) = smt_goals_of (get ())
let fail (#a:Type) (m:string)
: TAC a (fun ps post -> post (Failed (TacticFailure m) ps))
= raise #a (TacticFailure m)
let fail_silently (#a:Type) (m:string)
: TAC a (fun _ post -> forall ps. post (Failed (TacticFailure m) ps))
= set_urgency 0;
raise #a (TacticFailure m)
(** Return the current *goal*, not its type. (Ignores SMT goals) *)
let _cur_goal () : Tac goal =
match goals () with
| [] -> fail "no more goals"
| g::_ -> g
(** [cur_env] returns the current goal's environment *)
let cur_env () : Tac env = goal_env (_cur_goal ())
(** [cur_goal] returns the current goal's type *)
let cur_goal () : Tac typ = goal_type (_cur_goal ())
(** [cur_witness] returns the current goal's witness *)
let cur_witness () : Tac term = goal_witness (_cur_goal ())
(** [cur_goal_safe] will always return the current goal, without failing.
It must be statically verified that there indeed is a goal in order to
call it. *)
let cur_goal_safe () : TacH goal (requires (fun ps -> ~(goals_of ps == [])))
(ensures (fun ps0 r -> exists g. r == Success g ps0))
= match goals_of (get ()) with
| g :: _ -> g
(** [cur_binders] returns the list of binders in the current goal. *)
let cur_binders () : Tac binders =
binders_of_env (cur_env ())
(** Set the guard policy only locally, without affecting calling code *)
let with_policy pol (f : unit -> Tac 'a) : Tac 'a =
let old_pol = get_guard_policy () in
set_guard_policy pol;
let r = f () in
set_guard_policy old_pol;
r
(** [exact e] will solve a goal [Gamma |- w : t] if [e] has type exactly | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checked",
"FStar.Stubs.Tactics.Types.fsti.checked",
"FStar.Stubs.Tactics.Result.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V1.Formula.fst.checked",
"FStar.Reflection.V1.fst.checked",
"FStar.Range.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Tactics.V1.Derived.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1.SyntaxHelpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.V1.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Result",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | t: FStar.Stubs.Reflection.Types.term -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.term",
"FStar.Tactics.V1.Derived.with_policy",
"Prims.unit",
"FStar.Stubs.Tactics.Types.SMT",
"FStar.Stubs.Tactics.V1.Builtins.t_exact"
] | [] | false | true | false | false | false | let exact (t: term) : Tac unit =
| with_policy SMT (fun () -> t_exact true false t) | false |
Hacl.Spec.Bignum.Karatsuba.fst | Hacl.Spec.Bignum.Karatsuba.bn_sign_abs | val bn_sign_abs:
#t:limb_t
-> #aLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t aLen ->
tuple2 (carry t) (lbignum t aLen) | val bn_sign_abs:
#t:limb_t
-> #aLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t aLen ->
tuple2 (carry t) (lbignum t aLen) | let bn_sign_abs #t #aLen a b =
let c0, t0 = bn_sub a b in
let c1, t1 = bn_sub b a in
let res = map2 (mask_select (uint #t 0 -. c0)) t1 t0 in
c0, res | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Karatsuba.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 9,
"end_line": 37,
"start_col": 0,
"start_line": 33
} | module Hacl.Spec.Bignum.Karatsuba
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
open Hacl.Spec.Bignum.Base
open Hacl.Spec.Bignum.Lib
open Hacl.Spec.Lib
open Hacl.Spec.Bignum.Addition
open Hacl.Spec.Bignum.Multiplication
open Hacl.Spec.Bignum.Squaring
module K = Hacl.Spec.Karatsuba.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
inline_for_extraction noextract
let bn_mul_threshold = 32
(* this carry means nothing but the sign of the result *)
val bn_sign_abs:
#t:limb_t
-> #aLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t aLen ->
tuple2 (carry t) (lbignum t aLen) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Lib.fst.checked",
"Hacl.Spec.Karatsuba.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Squaring.fst.checked",
"Hacl.Spec.Bignum.Multiplication.fst.checked",
"Hacl.Spec.Bignum.Lib.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Base.fst.checked",
"Hacl.Spec.Bignum.Addition.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Bignum.Karatsuba.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Karatsuba.Lemmas",
"short_module": "K"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Squaring",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Multiplication",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Addition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: Hacl.Spec.Bignum.Definitions.lbignum t aLen -> b: Hacl.Spec.Bignum.Definitions.lbignum t aLen
-> Hacl.Spec.Bignum.Base.carry t * Hacl.Spec.Bignum.Definitions.lbignum t aLen | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_nat",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Spec.Bignum.Base.carry",
"FStar.Pervasives.Native.Mktuple2",
"Lib.Sequence.lseq",
"Hacl.Spec.Bignum.Definitions.limb",
"Prims.l_Forall",
"Prims.nat",
"Prims.l_imp",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.eq2",
"Lib.Sequence.index",
"Hacl.Spec.Bignum.Base.mask_select",
"Lib.IntTypes.sub_mod",
"Lib.IntTypes.SEC",
"Lib.IntTypes.mk_int",
"Lib.Sequence.map2",
"Lib.IntTypes.op_Subtraction_Dot",
"Lib.IntTypes.uint",
"FStar.Pervasives.Native.tuple2",
"Hacl.Spec.Bignum.Addition.bn_sub"
] | [] | false | false | false | false | false | let bn_sign_abs #t #aLen a b =
| let c0, t0 = bn_sub a b in
let c1, t1 = bn_sub b a in
let res = map2 (mask_select (uint #t 0 -. c0)) t1 t0 in
c0, res | false |
Hacl.Spec.Bignum.Karatsuba.fst | Hacl.Spec.Bignum.Karatsuba.bn_middle_karatsuba | val bn_middle_karatsuba:
#t:limb_t
-> #aLen:size_nat
-> c0:carry t
-> c1:carry t
-> c2:carry t
-> t01:lbignum t aLen
-> t23:lbignum t aLen ->
limb t & lbignum t aLen | val bn_middle_karatsuba:
#t:limb_t
-> #aLen:size_nat
-> c0:carry t
-> c1:carry t
-> c2:carry t
-> t01:lbignum t aLen
-> t23:lbignum t aLen ->
limb t & lbignum t aLen | let bn_middle_karatsuba #t #aLen c0 c1 c2 t01 t23 =
let c_sign = c0 ^. c1 in
let c3, t45 = bn_sub t01 t23 in let c3 = c2 -. c3 in
let c4, t67 = bn_add t01 t23 in let c4 = c2 +. c4 in
let mask = uint #t 0 -. c_sign in
let t45 = map2 (mask_select mask) t67 t45 in
let c5 = mask_select mask c4 c3 in
c5, t45 | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Karatsuba.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 9,
"end_line": 99,
"start_col": 0,
"start_line": 92
} | module Hacl.Spec.Bignum.Karatsuba
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
open Hacl.Spec.Bignum.Base
open Hacl.Spec.Bignum.Lib
open Hacl.Spec.Lib
open Hacl.Spec.Bignum.Addition
open Hacl.Spec.Bignum.Multiplication
open Hacl.Spec.Bignum.Squaring
module K = Hacl.Spec.Karatsuba.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
inline_for_extraction noextract
let bn_mul_threshold = 32
(* this carry means nothing but the sign of the result *)
val bn_sign_abs:
#t:limb_t
-> #aLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t aLen ->
tuple2 (carry t) (lbignum t aLen)
let bn_sign_abs #t #aLen a b =
let c0, t0 = bn_sub a b in
let c1, t1 = bn_sub b a in
let res = map2 (mask_select (uint #t 0 -. c0)) t1 t0 in
c0, res
val bn_sign_abs_lemma:
#t:limb_t
-> #aLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t aLen ->
Lemma (let c, res = bn_sign_abs a b in
bn_v res == K.abs (bn_v a) (bn_v b) /\
v c == (if bn_v a < bn_v b then 1 else 0))
let bn_sign_abs_lemma #t #aLen a b =
let s, r = K.sign_abs (bn_v a) (bn_v b) in
let c0, t0 = bn_sub a b in
bn_sub_lemma a b;
assert (bn_v t0 - v c0 * pow2 (bits t * aLen) == bn_v a - bn_v b);
let c1, t1 = bn_sub b a in
bn_sub_lemma b a;
assert (bn_v t1 - v c1 * pow2 (bits t * aLen) == bn_v b - bn_v a);
let mask = uint #t 0 -. c0 in
assert (v mask == (if v c0 = 0 then 0 else v (ones t SEC)));
let res = map2 (mask_select mask) t1 t0 in
lseq_mask_select_lemma t1 t0 mask;
assert (bn_v res == (if v mask = 0 then bn_v t0 else bn_v t1));
bn_eval_bound a aLen;
bn_eval_bound b aLen;
bn_eval_bound t0 aLen;
bn_eval_bound t1 aLen
// if bn_v a < bn_v b then begin
// assert (v mask = v (ones U64 SEC));
// assert (bn_v res == bn_v b - bn_v a);
// assert (bn_v res == r /\ v c0 = 1) end
// else begin
// assert (v mask = 0);
// assert (bn_v res == bn_v a - bn_v b);
// assert (bn_v res == r /\ v c0 = 0) end;
// assert (bn_v res == r /\ v c0 == (if bn_v a < bn_v b then 1 else 0))
val bn_middle_karatsuba:
#t:limb_t
-> #aLen:size_nat
-> c0:carry t
-> c1:carry t
-> c2:carry t
-> t01:lbignum t aLen
-> t23:lbignum t aLen ->
limb t & lbignum t aLen | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Lib.fst.checked",
"Hacl.Spec.Karatsuba.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Squaring.fst.checked",
"Hacl.Spec.Bignum.Multiplication.fst.checked",
"Hacl.Spec.Bignum.Lib.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Base.fst.checked",
"Hacl.Spec.Bignum.Addition.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Bignum.Karatsuba.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Karatsuba.Lemmas",
"short_module": "K"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Squaring",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Multiplication",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Addition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
c0: Hacl.Spec.Bignum.Base.carry t ->
c1: Hacl.Spec.Bignum.Base.carry t ->
c2: Hacl.Spec.Bignum.Base.carry t ->
t01: Hacl.Spec.Bignum.Definitions.lbignum t aLen ->
t23: Hacl.Spec.Bignum.Definitions.lbignum t aLen
-> Hacl.Spec.Bignum.Definitions.limb t * Hacl.Spec.Bignum.Definitions.lbignum t aLen | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_nat",
"Hacl.Spec.Bignum.Base.carry",
"Hacl.Spec.Bignum.Definitions.lbignum",
"FStar.Pervasives.Native.Mktuple2",
"Hacl.Spec.Bignum.Definitions.limb",
"Hacl.Spec.Bignum.Base.mask_select",
"Lib.Sequence.lseq",
"Prims.l_Forall",
"Prims.nat",
"Prims.l_imp",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.eq2",
"Lib.Sequence.index",
"Lib.Sequence.map2",
"Lib.IntTypes.int_t",
"Lib.IntTypes.SEC",
"Lib.IntTypes.op_Subtraction_Dot",
"Lib.IntTypes.uint",
"Lib.IntTypes.op_Plus_Dot",
"FStar.Pervasives.Native.tuple2",
"Hacl.Spec.Bignum.Addition.bn_add",
"Hacl.Spec.Bignum.Addition.bn_sub",
"Lib.IntTypes.op_Hat_Dot"
] | [] | false | false | false | false | false | let bn_middle_karatsuba #t #aLen c0 c1 c2 t01 t23 =
| let c_sign = c0 ^. c1 in
let c3, t45 = bn_sub t01 t23 in
let c3 = c2 -. c3 in
let c4, t67 = bn_add t01 t23 in
let c4 = c2 +. c4 in
let mask = uint #t 0 -. c_sign in
let t45 = map2 (mask_select mask) t67 t45 in
let c5 = mask_select mask c4 c3 in
c5, t45 | false |
Hacl.Spec.Bignum.Karatsuba.fst | Hacl.Spec.Bignum.Karatsuba.bn_lshift_add_early_stop | val bn_lshift_add_early_stop:
#t:limb_t
-> #aLen:size_nat
-> #bLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t bLen
-> i:nat{i + bLen <= aLen} ->
tuple2 (carry t) (lbignum t aLen) | val bn_lshift_add_early_stop:
#t:limb_t
-> #aLen:size_nat
-> #bLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t bLen
-> i:nat{i + bLen <= aLen} ->
tuple2 (carry t) (lbignum t aLen) | let bn_lshift_add_early_stop #t #aLen #bLen a b i =
let r = sub a i bLen in
let c, r' = bn_add r b in
let a' = update_sub a i bLen r' in
c, a' | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Karatsuba.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 7,
"end_line": 304,
"start_col": 0,
"start_line": 300
} | module Hacl.Spec.Bignum.Karatsuba
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
open Hacl.Spec.Bignum.Base
open Hacl.Spec.Bignum.Lib
open Hacl.Spec.Lib
open Hacl.Spec.Bignum.Addition
open Hacl.Spec.Bignum.Multiplication
open Hacl.Spec.Bignum.Squaring
module K = Hacl.Spec.Karatsuba.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
inline_for_extraction noextract
let bn_mul_threshold = 32
(* this carry means nothing but the sign of the result *)
val bn_sign_abs:
#t:limb_t
-> #aLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t aLen ->
tuple2 (carry t) (lbignum t aLen)
let bn_sign_abs #t #aLen a b =
let c0, t0 = bn_sub a b in
let c1, t1 = bn_sub b a in
let res = map2 (mask_select (uint #t 0 -. c0)) t1 t0 in
c0, res
val bn_sign_abs_lemma:
#t:limb_t
-> #aLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t aLen ->
Lemma (let c, res = bn_sign_abs a b in
bn_v res == K.abs (bn_v a) (bn_v b) /\
v c == (if bn_v a < bn_v b then 1 else 0))
let bn_sign_abs_lemma #t #aLen a b =
let s, r = K.sign_abs (bn_v a) (bn_v b) in
let c0, t0 = bn_sub a b in
bn_sub_lemma a b;
assert (bn_v t0 - v c0 * pow2 (bits t * aLen) == bn_v a - bn_v b);
let c1, t1 = bn_sub b a in
bn_sub_lemma b a;
assert (bn_v t1 - v c1 * pow2 (bits t * aLen) == bn_v b - bn_v a);
let mask = uint #t 0 -. c0 in
assert (v mask == (if v c0 = 0 then 0 else v (ones t SEC)));
let res = map2 (mask_select mask) t1 t0 in
lseq_mask_select_lemma t1 t0 mask;
assert (bn_v res == (if v mask = 0 then bn_v t0 else bn_v t1));
bn_eval_bound a aLen;
bn_eval_bound b aLen;
bn_eval_bound t0 aLen;
bn_eval_bound t1 aLen
// if bn_v a < bn_v b then begin
// assert (v mask = v (ones U64 SEC));
// assert (bn_v res == bn_v b - bn_v a);
// assert (bn_v res == r /\ v c0 = 1) end
// else begin
// assert (v mask = 0);
// assert (bn_v res == bn_v a - bn_v b);
// assert (bn_v res == r /\ v c0 = 0) end;
// assert (bn_v res == r /\ v c0 == (if bn_v a < bn_v b then 1 else 0))
val bn_middle_karatsuba:
#t:limb_t
-> #aLen:size_nat
-> c0:carry t
-> c1:carry t
-> c2:carry t
-> t01:lbignum t aLen
-> t23:lbignum t aLen ->
limb t & lbignum t aLen
let bn_middle_karatsuba #t #aLen c0 c1 c2 t01 t23 =
let c_sign = c0 ^. c1 in
let c3, t45 = bn_sub t01 t23 in let c3 = c2 -. c3 in
let c4, t67 = bn_add t01 t23 in let c4 = c2 +. c4 in
let mask = uint #t 0 -. c_sign in
let t45 = map2 (mask_select mask) t67 t45 in
let c5 = mask_select mask c4 c3 in
c5, t45
val sign_lemma: #t:limb_t -> c0:carry t -> c1:carry t ->
Lemma (v (c0 ^. c1) == (if v c0 = v c1 then 0 else 1))
let sign_lemma #t c0 c1 =
logxor_spec c0 c1;
match t with
| U32 ->
assert_norm (UInt32.logxor 0ul 0ul == 0ul);
assert_norm (UInt32.logxor 0ul 1ul == 1ul);
assert_norm (UInt32.logxor 1ul 0ul == 1ul);
assert_norm (UInt32.logxor 1ul 1ul == 0ul)
| U64 ->
assert_norm (UInt64.logxor 0uL 0uL == 0uL);
assert_norm (UInt64.logxor 0uL 1uL == 1uL);
assert_norm (UInt64.logxor 1uL 0uL == 1uL);
assert_norm (UInt64.logxor 1uL 1uL == 0uL)
val bn_middle_karatsuba_lemma:
#t:limb_t
-> #aLen:size_nat
-> c0:carry t
-> c1:carry t
-> c2:carry t
-> t01:lbignum t aLen
-> t23:lbignum t aLen ->
Lemma (let (c, res) = bn_middle_karatsuba c0 c1 c2 t01 t23 in
let c3, t45 = bn_sub t01 t23 in let c3' = c2 -. c3 in
let c4, t67 = bn_add t01 t23 in let c4' = c2 +. c4 in
if v c0 = v c1 then
v c == v c3' /\ bn_v res == bn_v t45
else
v c == v c4' /\ bn_v res == bn_v t67)
let bn_middle_karatsuba_lemma #t #aLen c0 c1 c2 t01 t23 =
let lp = bn_v t01 + v c2 * pow2 (bits t * aLen) - bn_v t23 in
let rp = bn_v t01 + v c2 * pow2 (bits t * aLen) + bn_v t23 in
let c_sign = c0 ^. c1 in
sign_lemma c0 c1;
assert (v c_sign == (if v c0 = v c1 then 0 else 1));
let c3, t45 = bn_sub t01 t23 in let c3' = c2 -. c3 in
let c4, t67 = bn_add t01 t23 in let c4' = c2 +. c4 in
let mask = uint #t 0 -. c_sign in
let t45' = map2 (mask_select mask) t67 t45 in
lseq_mask_select_lemma t67 t45 mask;
//assert (bn_v t45' == (if v mask = 0 then bn_v t45 else bn_v t67));
let c5 = mask_select mask c4' c3' in
mask_select_lemma mask c4' c3'
//assert (v c5 == (if v mask = 0 then v c3' else v c4'));
val bn_middle_karatsuba_eval_aux:
#t:limb_t
-> #aLen:size_nat
-> a0:lbignum t (aLen / 2)
-> a1:lbignum t (aLen / 2)
-> b0:lbignum t (aLen / 2)
-> b1:lbignum t (aLen / 2)
-> res:lbignum t aLen
-> c2:carry t
-> c3:carry t -> Lemma
(requires
bn_v res + (v c2 - v c3) * pow2 (bits t * aLen) ==
bn_v a0 * bn_v b1 + bn_v a1 * bn_v b0)
(ensures 0 <= v c2 - v c3 /\ v c2 - v c3 <= 1)
let bn_middle_karatsuba_eval_aux #t #aLen a0 a1 b0 b1 res c2 c3 =
bn_eval_bound res aLen
val bn_middle_karatsuba_eval:
#t:limb_t
-> #aLen:size_nat
-> a0:lbignum t (aLen / 2)
-> a1:lbignum t (aLen / 2)
-> b0:lbignum t (aLen / 2)
-> b1:lbignum t (aLen / 2)
-> c2:carry t
-> t01:lbignum t aLen
-> t23:lbignum t aLen ->
Lemma
(requires
(let t0 = K.abs (bn_v a0) (bn_v a1) in
let t1 = K.abs (bn_v b0) (bn_v b1) in
bn_v t01 + v c2 * pow2 (bits t * aLen) == bn_v a0 * bn_v b0 + bn_v a1 * bn_v b1 /\
bn_v t23 == t0 * t1))
(ensures
(let c0, t0 = bn_sign_abs a0 a1 in
let c1, t1 = bn_sign_abs b0 b1 in
let c, res = bn_middle_karatsuba c0 c1 c2 t01 t23 in
bn_v res + v c * pow2 (bits t * aLen) == bn_v a0 * bn_v b1 + bn_v a1 * bn_v b0))
let bn_middle_karatsuba_eval #t #aLen a0 a1 b0 b1 c2 t01 t23 =
let pbits = bits t in
let c0, t0 = bn_sign_abs a0 a1 in
bn_sign_abs_lemma a0 a1;
assert (bn_v t0 == K.abs (bn_v a0) (bn_v a1));
assert (v c0 == (if bn_v a0 < bn_v a1 then 1 else 0));
let c1, t1 = bn_sign_abs b0 b1 in
bn_sign_abs_lemma b0 b1;
assert (bn_v t1 == K.abs (bn_v b0) (bn_v b1));
assert (v c1 == (if bn_v b0 < bn_v b1 then 1 else 0));
let c, res = bn_middle_karatsuba c0 c1 c2 t01 t23 in
bn_middle_karatsuba_lemma c0 c1 c2 t01 t23;
let c3, t45 = bn_sub t01 t23 in let c3' = c2 -. c3 in
let c4, t67 = bn_add t01 t23 in let c4' = c2 +. c4 in
if v c0 = v c1 then begin
assert (bn_v a0 * bn_v b0 + bn_v a1 * bn_v b1 - bn_v t0 * bn_v t1 == bn_v a0 * bn_v b1 + bn_v a1 * bn_v b0);
assert (v c2 * pow2 (pbits * aLen) + bn_v t01 - bn_v t23 == bn_v a0 * bn_v b1 + bn_v a1 * bn_v b0);
assert (v c == v c3' /\ bn_v res == bn_v t45);
//assert (v c = (v c2 - v c3) % pow2 pb);
bn_sub_lemma t01 t23;
assert (bn_v res - v c3 * pow2 (pbits * aLen) == bn_v t01 - bn_v t23);
Math.Lemmas.distributivity_sub_left (v c2) (v c3) (pow2 (pbits * aLen));
assert (bn_v res + (v c2 - v c3) * pow2 (pbits * aLen) == v c2 * pow2 (pbits * aLen) + bn_v t01 - bn_v t23);
bn_middle_karatsuba_eval_aux a0 a1 b0 b1 res c2 c3;
Math.Lemmas.small_mod (v c2 - v c3) (pow2 pbits);
assert (bn_v res + v c * pow2 (pbits * aLen) == v c2 * pow2 (pbits * aLen) + bn_v t01 - bn_v t23);
() end
else begin
assert (bn_v a0 * bn_v b0 + bn_v a1 * bn_v b1 + bn_v t0 * bn_v t1 == bn_v a0 * bn_v b1 + bn_v a1 * bn_v b0);
assert (v c2 * pow2 (pbits * aLen) + bn_v t01 + bn_v t23 == bn_v a0 * bn_v b1 + bn_v a1 * bn_v b0);
assert (v c == v c4' /\ bn_v res == bn_v t67);
//assert (v c = v c2 + v c4);
bn_add_lemma t01 t23;
assert (bn_v res + v c4 * pow2 (pbits * aLen) == bn_v t01 + bn_v t23);
Math.Lemmas.distributivity_add_left (v c2) (v c4) (pow2 (pbits * aLen));
Math.Lemmas.small_mod (v c2 + v c4) (pow2 pbits);
assert (bn_v res + v c * pow2 (pbits * aLen) == v c2 * pow2 (pbits * aLen) + bn_v t01 + bn_v t23);
() end
val bn_lshift_add:
#t:limb_t
-> #aLen:size_nat
-> a:lbignum t aLen
-> b1:limb t
-> i:nat{i + 1 <= aLen} ->
tuple2 (carry t) (lbignum t aLen)
let bn_lshift_add #t #aLen a b1 i =
let r = sub a i (aLen - i) in
let c, r' = bn_add1 r b1 in
let a' = update_sub a i (aLen - i) r' in
c, a'
val bn_lshift_add_lemma:
#t:limb_t
-> #aLen:size_nat
-> a:lbignum t aLen
-> b1:limb t
-> i:nat{i + 1 <= aLen} ->
Lemma (let c, res = bn_lshift_add a b1 i in
bn_v res + v c * pow2 (bits t * aLen) == bn_v a + v b1 * pow2 (bits t * i))
let bn_lshift_add_lemma #t #aLen a b1 i =
let pbits = bits t in
let r = sub a i (aLen - i) in
let c, r' = bn_add1 r b1 in
let a' = update_sub a i (aLen - i) r' in
let p = pow2 (pbits * aLen) in
calc (==) {
bn_v a' + v c * p;
(==) { bn_update_sub_eval a r' i }
bn_v a - bn_v r * pow2 (pbits * i) + bn_v r' * pow2 (pbits * i) + v c * p;
(==) { bn_add1_lemma r b1 }
bn_v a - bn_v r * pow2 (pbits * i) + (bn_v r + v b1 - v c * pow2 (pbits * (aLen - i))) * pow2 (pbits * i) + v c * p;
(==) { Math.Lemmas.distributivity_add_left (bn_v r) (v b1 - v c * pow2 (pbits * (aLen - i))) (pow2 (pbits * i)) }
bn_v a + (v b1 - v c * pow2 (pbits * (aLen - i))) * pow2 (pbits * i) + v c * p;
(==) { Math.Lemmas.distributivity_sub_left (v b1) (v c * pow2 (pbits * (aLen - i))) (pow2 (pbits * i)) }
bn_v a + v b1 * pow2 (pbits * i) - (v c * pow2 (pbits * (aLen - i))) * pow2 (pbits * i) + v c * p;
(==) { Math.Lemmas.paren_mul_right (v c) (pow2 (pbits * (aLen - i))) (pow2 (pbits * i));
Math.Lemmas.pow2_plus (pbits * (aLen - i)) (pbits * i) }
bn_v a + v b1 * pow2 (pbits * i);
}
val bn_lshift_add_early_stop:
#t:limb_t
-> #aLen:size_nat
-> #bLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t bLen
-> i:nat{i + bLen <= aLen} ->
tuple2 (carry t) (lbignum t aLen) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Lib.fst.checked",
"Hacl.Spec.Karatsuba.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Squaring.fst.checked",
"Hacl.Spec.Bignum.Multiplication.fst.checked",
"Hacl.Spec.Bignum.Lib.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Base.fst.checked",
"Hacl.Spec.Bignum.Addition.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Spec.Bignum.Karatsuba.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Karatsuba.Lemmas",
"short_module": "K"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Squaring",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Multiplication",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Addition",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.LoopCombinators",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 50,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
a: Hacl.Spec.Bignum.Definitions.lbignum t aLen ->
b: Hacl.Spec.Bignum.Definitions.lbignum t bLen ->
i: Prims.nat{i + bLen <= aLen}
-> Hacl.Spec.Bignum.Base.carry t * Hacl.Spec.Bignum.Definitions.lbignum t aLen | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_nat",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Hacl.Spec.Bignum.Base.carry",
"FStar.Pervasives.Native.Mktuple2",
"Lib.Sequence.lseq",
"Hacl.Spec.Bignum.Definitions.limb",
"Prims.l_and",
"Prims.eq2",
"Lib.Sequence.sub",
"Prims.l_Forall",
"Prims.l_or",
"Prims.op_LessThan",
"FStar.Seq.Base.index",
"Lib.Sequence.to_seq",
"Lib.Sequence.index",
"Lib.Sequence.update_sub",
"FStar.Pervasives.Native.tuple2",
"Hacl.Spec.Bignum.Addition.bn_add",
"FStar.Seq.Base.seq",
"FStar.Seq.Base.slice"
] | [] | false | false | false | false | false | let bn_lshift_add_early_stop #t #aLen #bLen a b i =
| let r = sub a i bLen in
let c, r' = bn_add r b in
let a' = update_sub a i bLen r' in
c, a' | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.exact_with_ref | val exact_with_ref (t: term) : Tac unit | val exact_with_ref (t: term) : Tac unit | let exact_with_ref (t : term) : Tac unit =
with_policy SMT (fun () -> t_exact true true t) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 103,
"start_col": 0,
"start_line": 102
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.Tactics.V1.Derived
open FStar.Reflection.V1
open FStar.Reflection.V1.Formula
open FStar.Tactics.Effect
open FStar.Stubs.Tactics.Types
open FStar.Stubs.Tactics.Result
open FStar.Tactics.Util
open FStar.Stubs.Tactics.V1.Builtins
open FStar.Tactics.V1.SyntaxHelpers
open FStar.VConfig
module L = FStar.List.Tot.Base
module V = FStar.Tactics.Visit
private let (@) = L.op_At
let name_of_bv (bv : bv) : Tac string =
unseal ((inspect_bv bv).bv_ppname)
let bv_to_string (bv : bv) : Tac string =
(* Could also print type...? *)
name_of_bv bv
let name_of_binder (b : binder) : Tac string =
name_of_bv (bv_of_binder b)
let binder_to_string (b : binder) : Tac string =
bv_to_string (bv_of_binder b) //TODO: print aqual, attributes
exception Goal_not_trivial
let goals () : Tac (list goal) = goals_of (get ())
let smt_goals () : Tac (list goal) = smt_goals_of (get ())
let fail (#a:Type) (m:string)
: TAC a (fun ps post -> post (Failed (TacticFailure m) ps))
= raise #a (TacticFailure m)
let fail_silently (#a:Type) (m:string)
: TAC a (fun _ post -> forall ps. post (Failed (TacticFailure m) ps))
= set_urgency 0;
raise #a (TacticFailure m)
(** Return the current *goal*, not its type. (Ignores SMT goals) *)
let _cur_goal () : Tac goal =
match goals () with
| [] -> fail "no more goals"
| g::_ -> g
(** [cur_env] returns the current goal's environment *)
let cur_env () : Tac env = goal_env (_cur_goal ())
(** [cur_goal] returns the current goal's type *)
let cur_goal () : Tac typ = goal_type (_cur_goal ())
(** [cur_witness] returns the current goal's witness *)
let cur_witness () : Tac term = goal_witness (_cur_goal ())
(** [cur_goal_safe] will always return the current goal, without failing.
It must be statically verified that there indeed is a goal in order to
call it. *)
let cur_goal_safe () : TacH goal (requires (fun ps -> ~(goals_of ps == [])))
(ensures (fun ps0 r -> exists g. r == Success g ps0))
= match goals_of (get ()) with
| g :: _ -> g
(** [cur_binders] returns the list of binders in the current goal. *)
let cur_binders () : Tac binders =
binders_of_env (cur_env ())
(** Set the guard policy only locally, without affecting calling code *)
let with_policy pol (f : unit -> Tac 'a) : Tac 'a =
let old_pol = get_guard_policy () in
set_guard_policy pol;
let r = f () in
set_guard_policy old_pol;
r
(** [exact e] will solve a goal [Gamma |- w : t] if [e] has type exactly
[t] in [Gamma]. *)
let exact (t : term) : Tac unit =
with_policy SMT (fun () -> t_exact true false t)
(** [exact_with_ref e] will solve a goal [Gamma |- w : t] if [e] has
type [t'] where [t'] is a subtype of [t] in [Gamma]. This is a more | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checked",
"FStar.Stubs.Tactics.Types.fsti.checked",
"FStar.Stubs.Tactics.Result.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V1.Formula.fst.checked",
"FStar.Reflection.V1.fst.checked",
"FStar.Range.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Tactics.V1.Derived.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1.SyntaxHelpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.V1.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Result",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | t: FStar.Stubs.Reflection.Types.term -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.term",
"FStar.Tactics.V1.Derived.with_policy",
"Prims.unit",
"FStar.Stubs.Tactics.Types.SMT",
"FStar.Stubs.Tactics.V1.Builtins.t_exact"
] | [] | false | true | false | false | false | let exact_with_ref (t: term) : Tac unit =
| with_policy SMT (fun () -> t_exact true true t) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.trivial | val trivial: Prims.unit -> Tac unit | val trivial: Prims.unit -> Tac unit | let trivial () : Tac unit =
norm [iota; zeta; reify_; delta; primops; simplify; unmeta];
let g = cur_goal () in
match term_as_formula g with
| True_ -> exact (`())
| _ -> raise Goal_not_trivial | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 110,
"start_col": 0,
"start_line": 105
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module FStar.Tactics.V1.Derived
open FStar.Reflection.V1
open FStar.Reflection.V1.Formula
open FStar.Tactics.Effect
open FStar.Stubs.Tactics.Types
open FStar.Stubs.Tactics.Result
open FStar.Tactics.Util
open FStar.Stubs.Tactics.V1.Builtins
open FStar.Tactics.V1.SyntaxHelpers
open FStar.VConfig
module L = FStar.List.Tot.Base
module V = FStar.Tactics.Visit
private let (@) = L.op_At
let name_of_bv (bv : bv) : Tac string =
unseal ((inspect_bv bv).bv_ppname)
let bv_to_string (bv : bv) : Tac string =
(* Could also print type...? *)
name_of_bv bv
let name_of_binder (b : binder) : Tac string =
name_of_bv (bv_of_binder b)
let binder_to_string (b : binder) : Tac string =
bv_to_string (bv_of_binder b) //TODO: print aqual, attributes
exception Goal_not_trivial
let goals () : Tac (list goal) = goals_of (get ())
let smt_goals () : Tac (list goal) = smt_goals_of (get ())
let fail (#a:Type) (m:string)
: TAC a (fun ps post -> post (Failed (TacticFailure m) ps))
= raise #a (TacticFailure m)
let fail_silently (#a:Type) (m:string)
: TAC a (fun _ post -> forall ps. post (Failed (TacticFailure m) ps))
= set_urgency 0;
raise #a (TacticFailure m)
(** Return the current *goal*, not its type. (Ignores SMT goals) *)
let _cur_goal () : Tac goal =
match goals () with
| [] -> fail "no more goals"
| g::_ -> g
(** [cur_env] returns the current goal's environment *)
let cur_env () : Tac env = goal_env (_cur_goal ())
(** [cur_goal] returns the current goal's type *)
let cur_goal () : Tac typ = goal_type (_cur_goal ())
(** [cur_witness] returns the current goal's witness *)
let cur_witness () : Tac term = goal_witness (_cur_goal ())
(** [cur_goal_safe] will always return the current goal, without failing.
It must be statically verified that there indeed is a goal in order to
call it. *)
let cur_goal_safe () : TacH goal (requires (fun ps -> ~(goals_of ps == [])))
(ensures (fun ps0 r -> exists g. r == Success g ps0))
= match goals_of (get ()) with
| g :: _ -> g
(** [cur_binders] returns the list of binders in the current goal. *)
let cur_binders () : Tac binders =
binders_of_env (cur_env ())
(** Set the guard policy only locally, without affecting calling code *)
let with_policy pol (f : unit -> Tac 'a) : Tac 'a =
let old_pol = get_guard_policy () in
set_guard_policy pol;
let r = f () in
set_guard_policy old_pol;
r
(** [exact e] will solve a goal [Gamma |- w : t] if [e] has type exactly
[t] in [Gamma]. *)
let exact (t : term) : Tac unit =
with_policy SMT (fun () -> t_exact true false t)
(** [exact_with_ref e] will solve a goal [Gamma |- w : t] if [e] has
type [t'] where [t'] is a subtype of [t] in [Gamma]. This is a more
flexible variant of [exact]. *)
let exact_with_ref (t : term) : Tac unit =
with_policy SMT (fun () -> t_exact true true t) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checked",
"FStar.Stubs.Tactics.Types.fsti.checked",
"FStar.Stubs.Tactics.Result.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Reflection.V1.Formula.fst.checked",
"FStar.Reflection.V1.fst.checked",
"FStar.Range.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Tactics.V1.Derived.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1.SyntaxHelpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.V1.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Result",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V1",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Tactics.V1.Derived.exact",
"FStar.Reflection.V1.Formula.formula",
"FStar.Tactics.Effect.raise",
"FStar.Tactics.V1.Derived.Goal_not_trivial",
"FStar.Reflection.V1.Formula.term_as_formula",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Tactics.V1.Derived.cur_goal",
"FStar.Stubs.Tactics.V1.Builtins.norm",
"Prims.Cons",
"FStar.Pervasives.norm_step",
"FStar.Pervasives.iota",
"FStar.Pervasives.zeta",
"FStar.Pervasives.reify_",
"FStar.Pervasives.delta",
"FStar.Pervasives.primops",
"FStar.Pervasives.simplify",
"FStar.Pervasives.unmeta",
"Prims.Nil"
] | [] | false | true | false | false | false | let trivial () : Tac unit =
| norm [iota; zeta; reify_; delta; primops; simplify; unmeta];
let g = cur_goal () in
match term_as_formula g with
| True_ -> exact (`())
| _ -> raise Goal_not_trivial | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.