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!