Datasets:
File size: 1,859 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 | use vstd::prelude::*;
fn main() {}
verus!{
proof fn f1_lemma_vec_push<T>(vec: Seq<T>, i: T, l: usize)
requires
l == vec.len(),
ensures
forall|k: int| 0 <= k < vec.len() ==> #[trigger] vec[k] == vec.push(i)[k],
vec.push(i).index(l as int) == i,
{
}
fn f1_contains(arr: &Vec<i32>, key: i32) -> (result: bool)
{
let mut index = 0;
while index < arr.len()
{
if (arr[index] == key) {
return true;
}
index += 1;
}
false
}
fn f1_find_dissimilar(arr1: &Vec<i32>, arr2: &Vec<i32>) -> (result: Vec<i32>)
{
let mut result = Vec::new();
let mut index = 0;
while index < arr1.len()
{
if (!f1_contains(arr2, arr1[index]) && !f1_contains(&result, arr1[index])) {
result.push(arr1[index]);
}
index += 1;
}
let mut index = 0;
while index < arr2.len()
{
if (!f1_contains(arr1, arr2[index]) && !f1_contains(&result, arr2[index])) {
result.push(arr2[index]);
}
index += 1;
}
result
}
spec fn step1(__hp0: Seq<i32>, __hp1: Seq<i32>, outp: Seq<i32>) -> bool {
(forall|i: int|
0 <= i < __hp0.len() ==> (!__hp1.contains(#[trigger] __hp0[i]) ==> outp.contains(
__hp0[i],
)))
&& (forall|i: int|
0 <= i < __hp1.len() ==> (!__hp0.contains(#[trigger] __hp1[i]) ==> outp.contains(
__hp1[i],
)))
&& (forall|i: int, j: int|
0 <= i < j < outp.len() ==> #[trigger] outp[i] != #[trigger] outp[j])
}
fn chain_driver(arr1: &Vec<i32>, arr2: &Vec<i32>) -> (r_final: Vec<i32>)
ensures
step1(arr1@, arr2@, r_final@),
{
let x1 = f1_find_dissimilar(arr1, arr2);
proof {
assert(step1(arr1@, arr2@, x1@));
}
x1
}
} // verus!
|