CodeWalk's picture
Add CodeWalk verus-proof-completion benchmark
c62beea verified
Raw History Blame Contribute Delete
1.25 kB
use vstd::prelude::*;
fn main() {}
verus!{
fn f1_remove_odds(arr: &Vec<u32>) -> (even_list: Vec<u32>)
{
let mut even_list: Vec<u32> = Vec::new();
let input_len = arr.len();
let mut index = 0;
while index < arr.len()
{
if (arr[index] % 2 == 0) {
even_list.push(arr[index]);
}
index += 1;
}
even_list
}
fn f2_filter_odd_numbers(arr: &Vec<u32>) -> (odd_list: Vec<u32>)
{
let mut odd_list: Vec<u32> = Vec::new();
let input_len = arr.len();
let mut index = 0;
while index < arr.len()
{
if (arr[index] % 2 != 0) {
odd_list.push(arr[index]);
}
index += 1;
}
odd_list
}
spec fn step1(__hp0: Seq<u32>, outp: Seq<u32>) -> bool {
(outp == __hp0.filter(|x: u32| x % 2 == 0))
}
spec fn step2(inp: Seq<u32>, outp: Seq<u32>) -> bool {
(outp == inp.filter(|x: u32| x % 2 != 0))
}
fn chain_driver(arr: &Vec<u32>) -> (r_final: Vec<u32>)
ensures
exists|v1: Seq<u32>| #[trigger] step1(arr@, v1) && step2(v1, r_final@),
{
let x1 = f1_remove_odds(arr);
let x2 = f2_filter_odd_numbers(&x1);
proof {
assert(step1(arr@, x1@));
assert(step2(x1@, x2@));
}
x2
}
} // verus!