Datasets:
File size: 1,216 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 | use vstd::prelude::*;
fn main() {}
verus!{
fn f1_interleave(s1: &Vec<i32>, s2: &Vec<i32>, s3: &Vec<i32>) -> (res: Vec<i32>)
requires
s1@.len() == s2@.len() && s2@.len() == s3@.len(),
0 <= (s1@.len() * 3) <= i32::MAX,
{
let new_seq_len = s1.len() * 3;
let mut output_seq = Vec::with_capacity(new_seq_len);
let mut index = 0;
while index < s1.len()
{
output_seq.push(s1[index]);
output_seq.push(s2[index]);
output_seq.push(s3[index]);
index += 1;
}
output_seq
}
spec fn step1(__hp0: Seq<i32>, __hp1: Seq<i32>, __hp2: Seq<i32>, outp: Seq<i32>) -> bool {
(outp.len() == __hp0.len() * 3)
&& (forall|i: int|
0 <= i < __hp0.len() ==> (outp[3 * i] == __hp0[i] && outp[3 * i + 1] == __hp1[i] && outp[3 * i + 2]
== __hp2[i]))
}
fn chain_driver(s1: &Vec<i32>, s2: &Vec<i32>, s3: &Vec<i32>) -> (r_final: Vec<i32>)
requires
s1@.len() == s2@.len() && s2@.len() == s3@.len(),
0 <= (s1@.len() * 3) <= i32::MAX,
ensures
step1(s1@, s2@, s3@, r_final@),
{
let x1 = f1_interleave(s1, s2, s3);
proof {
assert(step1(s1@, s2@, s3@, x1@));
}
x1
}
} // verus!
|