Datasets:
File size: 1,822 Bytes
c62beea | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 | use vstd::prelude::*;
fn main() {}
verus!{
fn f1_square_nums(nums: &Vec<i32>) -> (squared: Vec<i32>)
requires
forall|k: int|
0 <= k < nums.len() ==> (0 <= #[trigger] nums[k] * #[trigger] nums[k] < i32::MAX),
{
let mut result: Vec<i32> = Vec::new();
let mut index = 0;
while index < nums.len()
{
result.push(nums[index] * nums[index]);
index += 1
}
result
}
fn f2_contains(arr: &Vec<i32>, key: i32) -> (result: bool)
{
let mut i = 0;
while i < arr.len()
{
if (arr[i] == key) {
return true;
}
i += 1;
}
false
}
fn f2_intersection(arr1: &Vec<i32>, arr2: &Vec<i32>) -> (result: Vec<i32>)
{
let mut output_arr = Vec::new();
let mut index = 0;
while index < arr1.len()
{
if (f2_contains(arr2, arr1[index]) && !f2_contains(&output_arr, arr1[index])) {
output_arr.push(arr1[index]);
}
index += 1;
}
output_arr
}
spec fn step1(__hp0: Seq<i32>, outp: Seq<i32>) -> bool {
(__hp0.len() == outp.len())
&& (forall|k: int| 0 <= k < __hp0.len() ==> (#[trigger] outp[k] == __hp0[k] * __hp0[k]))
}
spec fn step2(inp: Seq<i32>, p2_key: i32, outp: bool) -> bool {
(outp == (exists|i: int| 0 <= i < inp.len() && (inp[i] == p2_key)))
}
fn chain_driver(nums: &Vec<i32>, p2_key: i32) -> (r_final: bool)
requires
forall|k: int|
0 <= k < nums.len() ==> (0 <= #[trigger] nums[k] * #[trigger] nums[k] < i32::MAX),
ensures
exists|v1: Seq<i32>| #[trigger] step1(nums@, v1) && step2(v1, p2_key, r_final),
{
let x1 = f1_square_nums(nums);
let x2 = f2_contains(&x1, p2_key);
proof {
assert(step1(nums@, x1@));
assert(step2(x1@, p2_key, x2));
}
x2
}
} // verus!
|