use vstd::prelude::*;
fn main() {}
verus!{



fn f1_cube_element(nums: &Vec<i32>) -> (cubed: Vec<i32>)
    requires
        forall|k: int|
            0 <= k < nums.len() ==> (i32::MIN <= #[trigger] nums[k] * #[trigger] nums[k]
                <= i32::MAX),
        forall|k: int|
            0 <= k < nums.len() ==> (i32::MIN <= #[trigger] nums[k] * #[trigger] nums[k]
                * #[trigger] nums[k] <= i32::MAX),
{
    let mut cubed_array: Vec<i32> = Vec::new();
    let mut i = 0;
    while i < nums.len()
    {
        cubed_array.push(nums[i] * nums[i] * nums[i]);
        i += 1;
    }
    cubed_array
}





fn f2_find_negative_numbers(arr: &Vec<i32>) -> (negative_list: Vec<i32>)
{
    let mut negative_list: Vec<i32> = Vec::new();
    let input_len = arr.len();

    let mut index = 0;
    while index < arr.len()
    {
        if (arr[index] < 0) {
            negative_list.push(arr[index]);
        }
        index += 1;
    }
    negative_list
}





proof fn f3_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 f3_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 f3_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 (!f3_contains(arr2, arr1[index]) && !f3_contains(&result, arr1[index])) {
            
            result.push(arr1[index]);

        }
        index += 1;
    }
    let mut index = 0;
    while index < arr2.len()
    {
        if (!f3_contains(arr1, arr2[index]) && !f3_contains(&result, arr2[index])) {
            
            result.push(arr2[index]);
        }
        index += 1;
    }

    result
}



spec fn step1(__hp0: Seq<i32>, outp: Seq<i32>) -> bool {
    (forall|i: int|
            0 <= i < __hp0.len() ==> outp[i] == #[trigger] __hp0[i] * #[trigger] __hp0[i]
                * #[trigger] __hp0[i])
}

spec fn step2(inp: Seq<i32>, outp: Seq<i32>) -> bool {
    (outp == inp.filter(|x: i32| x < 0))
}

spec fn step3(inp: Seq<i32>, p3_key: i32, outp: bool) -> bool {
    (outp == (exists|i: int| 0 <= i < inp.len() && (inp[i] == p3_key)))
}

fn chain_driver(nums: &Vec<i32>, p3_key: i32) -> (r_final: bool)
    requires
        forall|k: int|
            0 <= k < nums.len() ==> (i32::MIN <= #[trigger] nums[k] * #[trigger] nums[k]
                <= i32::MAX),
        forall|k: int|
            0 <= k < nums.len() ==> (i32::MIN <= #[trigger] nums[k] * #[trigger] nums[k]
                * #[trigger] nums[k] <= i32::MAX),
    ensures
        exists|v1: Seq<i32>, v2: Seq<i32>| #[trigger] step1(nums@, v1) && #[trigger] step2(v1, v2) && step3(v2, p3_key, r_final),
{
    let x1 = f1_cube_element(nums);
    let x2 = f2_find_negative_numbers(&x1);
    let x3 = f3_contains(&x2, p3_key);
    proof {
        assert(step1(nums@, x1@));
        assert(step2(x1@, x2@));
        assert(step3(x2@, p3_key, x3));
    }
    x3
}

} // verus!