C++ (Cpp) __CPROVER_jsa_assume_valid_list Examples

Example #1

File: main.c Project: AnnaTrost/cbmc

int main(void)
{
  __CPROVER_jsa_abstract_heapt heap;
  __CPROVER_jsa_assume_valid_heap(&heap);
  const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_j=0;
  __CPROVER_jsa_assume_valid_list(&heap, __CPROVER_jsa_list_j);
  const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_a=1;
  __CPROVER_jsa_assume_valid_list(&heap, __CPROVER_jsa_list_a);
  const __CPROVER_jsa_data_t n;
  for (const __CPROVER_jsa_iterator_id_t __CPROVER_jsa_iterator_it=__CPROVER_jsa_iterator(&heap, __CPROVER_jsa_list_j);
       __CPROVER_jsa_hasNext(&heap, __CPROVER_jsa_iterator_it);)
  {
    const __CPROVER_jsa_data_t tmp=__CPROVER_jsa_next(&heap, __CPROVER_jsa_iterator_it);
    if (n == tmp)
    {
      __CPROVER_jsa_remove(&heap, __CPROVER_jsa_iterator_it);
      __CPROVER_jsa_add(&heap, __CPROVER_jsa_list_a, tmp);
      // break; // Transformed "find" to "filter" to accommodate for front-end restrictions.
    }
  }

  return 0;
}

Example #2

File: main.c Project: diffblue/cbmc

int main(void)
{
    __CPROVER_jsa_abstract_heapt heap;
    __CPROVER_jsa_assume_valid_heap(&heap);
    const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_l;
    __CPROVER_jsa_assume_valid_list(&heap, __CPROVER_jsa_list_l);
    for (const __CPROVER_jsa_iterator_id_t __CPROVER_jsa_iterator_it=__CPROVER_jsa_iterator(&heap, __CPROVER_jsa_list_l);
            __CPROVER_jsa_hasNext(&heap, __CPROVER_jsa_iterator_it);)
    {
        const __CPROVER_jsa_word_t next=__CPROVER_jsa_next(&heap, __CPROVER_jsa_iterator_it);
        __CPROVER_jsa_set(&heap, __CPROVER_jsa_iterator_it, __CPROVER_jsa_plus(next, 1));
    }

    return 0;
}

Example #3

File: main.c Project: diffblue/cbmc

int main(void)
{
    __CPROVER_jsa_abstract_heapt heap;
    __CPROVER_jsa_assume_valid_heap(&heap);
    const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_list;
    __CPROVER_jsa_assume_valid_list(&heap, __CPROVER_jsa_list_list);
    int count=0;
    const __CPROVER_jsa_iterator_id_t __CPROVER_jsa_iterator_it=__CPROVER_jsa_iterator(&heap, __CPROVER_jsa_list_list);
    for (; __CPROVER_jsa_hasNext(&heap, __CPROVER_jsa_iterator_it);)
    {
        const __CPROVER_jsa_data_t value=__CPROVER_jsa_next(&heap, __CPROVER_jsa_iterator_it);
        count+=value;
    }

    return 0;
}

Example #4

File: main.c Project: romainbrenguier/cbmc

int main(void)
{
  __CPROVER_jsa_abstract_heapt heap;
  __CPROVER_jsa_assume_valid_heap(&heap);
  const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_list=0;
  __CPROVER_jsa_assume_valid_list(&heap, __CPROVER_jsa_list_list);
  const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_copy=1;
  __CPROVER_jsa_assume_new_list(&heap, __CPROVER_jsa_list_copy);
  for (const __CPROVER_jsa_iterator_id_t __CPROVER_jsa_iterator_it=__CPROVER_jsa_iterator(&heap, __CPROVER_jsa_list_list);
       __CPROVER_jsa_hasNext(&heap, __CPROVER_jsa_iterator_it);)
  {
    const __CPROVER_jsa_data_t value=__CPROVER_jsa_next(&heap, __CPROVER_jsa_iterator_it);
    __CPROVER_jsa_add(&heap, __CPROVER_jsa_list_copy, __CPROVER_jsa_mult(value, 2));
  }

  return 0;
}

Example #5

File: main.c Project: romainbrenguier/cbmc

int main(void)
{
  __CPROVER_jsa_abstract_heapt heap;
  __CPROVER_jsa_assume_valid_heap(&heap);
  const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_list;
  __CPROVER_jsa_assume_valid_list(&heap, __CPROVER_jsa_list_list);
  for (const __CPROVER_jsa_iterator_id_t __CPROVER_jsa_iterator_it=__CPROVER_jsa_iterator(&heap, __CPROVER_jsa_list_list);
       __CPROVER_jsa_hasNext(&heap, __CPROVER_jsa_iterator_it);)
  {
    const __CPROVER_jsa_data_t num=__CPROVER_jsa_next(&heap, __CPROVER_jsa_iterator_it);
    if (num%2 == 0)
    {
      __CPROVER_jsa_remove(&heap, __CPROVER_jsa_iterator_it);
    }
  }

  return 0;
}

Example #6

File: main.c Project: AnnaTrost/cbmc

int main(void)
{
  __CPROVER_jsa_abstract_heapt heap;
  __CPROVER_jsa_assume_valid_heap(&heap);
  const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_tempList;
  __CPROVER_jsa_assume_valid_list(&heap, __CPROVER_jsa_list_tempList);
  const __CPROVER_jsa_data_t A_index;
  const __CPROVER_jsa_data_t i;
  __CPROVER_jsa_data_t counter=0;
  // "generate" not yet in query instruction set
  while(counter!=i)
  {
    __CPROVER_jsa_add(&heap, __CPROVER_jsa_list_tempList, A_index);
    counter++;
  }

  return 0;
}

Example #7

File: main.c Project: AnnaTrost/cbmc

int main(void)
{
  __CPROVER_jsa_abstract_heapt heap;
  __CPROVER_jsa_assume_valid_heap(&heap);
  const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_l;
  __CPROVER_jsa_assume_valid_list(&heap, __CPROVER_jsa_list_l);
  for (const __CPROVER_jsa_iterator_id_t __CPROVER_jsa_iterator_it=__CPROVER_jsa_iterator(&heap, __CPROVER_jsa_list_l);
       __CPROVER_jsa_hasNext(&heap, __CPROVER_jsa_iterator_it);)
  {
    const __CPROVER_jsa_word_t x=__CPROVER_jsa_next(&heap, __CPROVER_jsa_iterator_it);
    if(__CPROVER_jsa_mod(x, 2) == 0)
    {
      __CPROVER_jsa_set(&heap, __CPROVER_jsa_iterator_it, 0);
    }
  }

  return 1;
}

Example #8

File: main.c Project: AnnaTrost/cbmc

int main(void)
{
  __CPROVER_jsa_abstract_heapt heap;
  __CPROVER_jsa_assume_valid_heap(&heap);
  const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_list;
  __CPROVER_jsa_assume_valid_list(&heap, __CPROVER_jsa_list_list);
  const __CPROVER_jsa_data_t x;
  const __CPROVER_jsa_iterator_id_t __CPROVER_jsa_iterator_it=__CPROVER_jsa_iterator(&heap, __CPROVER_jsa_list_list);
  while (__CPROVER_jsa_hasNext(&heap, __CPROVER_jsa_iterator_it))
  {
    const __CPROVER_jsa_data_t temp=__CPROVER_jsa_next(&heap, __CPROVER_jsa_iterator_it);
    if (x == temp)
    {
      __CPROVER_jsa_remove(&heap, __CPROVER_jsa_iterator_it);
    }
  }

  return 0;
}

Example #9

File: main.c Project: romainbrenguier/cbmc

int main(void)
{
  __CPROVER_jsa_abstract_heapt heap;
  __CPROVER_jsa_assume_valid_heap(&heap);
  const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_list;
  __CPROVER_jsa_assume_valid_list(&heap, __CPROVER_jsa_list_list);
  const __CPROVER_jsa_iterator_id_t __CPROVER_jsa_iterator_it=__CPROVER_jsa_iterator(&heap, __CPROVER_jsa_list_list);
  while (__CPROVER_jsa_hasNext(&heap, __CPROVER_jsa_iterator_it))
  {
    const __CPROVER_jsa_data_t i=__CPROVER_jsa_next(&heap, __CPROVER_jsa_iterator_it);
    if (i % 2 == 0)
    {
      __CPROVER_jsa_remove(&heap, __CPROVER_jsa_iterator_it);
    }
    // System_out_println(list);
  }

  return 0;
}

Example #10

File: main.c Project: AnnaTrost/cbmc

int main(void)
{
  __CPROVER_jsa_abstract_heapt heap;
  __CPROVER_jsa_assume_valid_heap(&heap);
  const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_list;
  __CPROVER_jsa_assume_valid_list(&heap, __CPROVER_jsa_list_list);
  const __CPROVER_jsa_iterator_id_t __CPROVER_jsa_iterator_it=__CPROVER_jsa_iterator(&heap, __CPROVER_jsa_list_list);
  __CPROVER_jsa_data_t i=0;
  while (__CPROVER_jsa_hasNext(&heap, __CPROVER_jsa_iterator_it))
  {
    const __CPROVER_jsa_data_t el=__CPROVER_jsa_next(&heap, __CPROVER_jsa_iterator_it);
    if (__CPROVER_jsa_mod(i, 2) == 0)
    {
      __CPROVER_jsa_remove(&heap, __CPROVER_jsa_iterator_it);
    }
    i++;
  }

  return 1;
}

Example #11

File: main.c Project: AnnaTrost/cbmc

int main(void)
{
  __CPROVER_jsa_abstract_heapt heap;
  __CPROVER_jsa_assume_valid_heap(&heap);
  const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_list;
  __CPROVER_jsa_assume_valid_list(&heap, __CPROVER_jsa_list_list);
  const __CPROVER_jsa_data_t i;
  const __CPROVER_jsa_iterator_id_t __CPROVER_jsa_iterator_it=__CPROVER_jsa_iterator(&heap, __CPROVER_jsa_list_list);
  while (__CPROVER_jsa_hasNext(&heap, __CPROVER_jsa_iterator_it))
  {
    const __CPROVER_jsa_data_t j=__CPROVER_jsa_next(&heap, __CPROVER_jsa_iterator_it);
    if (__CPROVER_jsa_mod(i, j) == 0)
    {
      __CPROVER_jsa_remove(&heap, __CPROVER_jsa_iterator_it);
      // Transformed "find" to "filter" to accommodate front-end limitations.
    }
  }

  return 0;
}

Example #12

File: main.c Project: AnnaTrost/cbmc

int main(void)
{
  __CPROVER_jsa_abstract_heapt heap;
  __CPROVER_jsa_assume_valid_heap(&heap);
  const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_ps;
  __CPROVER_jsa_assume_valid_list(&heap, __CPROVER_jsa_list_ps);
  const __CPROVER_jsa_data_t i;
  const __CPROVER_jsa_iterator_id_t __CPROVER_jsa_iterator_it=__CPROVER_jsa_iterator(&heap, __CPROVER_jsa_list_ps);
  for (;__CPROVER_jsa_hasNext(&heap, __CPROVER_jsa_iterator_it);)
  {
    const __CPROVER_jsa_data_t p=__CPROVER_jsa_next(&heap, __CPROVER_jsa_iterator_it);
    // Transformed "find" to "filter" to accommodate front-end restrictions.
    if (__CPROVER_jsa_div(i, p) == 0)
    {
      __CPROVER_jsa_remove(&heap, __CPROVER_jsa_iterator_it);
    }
  }

  return 0;
}

Example #13

File: main.c Project: AnnaTrost/cbmc

int main(void)
{
  __CPROVER_jsa_abstract_heapt heap;
  __CPROVER_jsa_assume_valid_heap(&heap);
  const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_list=0;
  __CPROVER_jsa_assume_valid_list(&heap, __CPROVER_jsa_list_list);
  const __CPROVER_jsa_list_id_t __CPROVER_jsa_list_nonZero=1;
  __CPROVER_jsa_assume_new_list(&heap, __CPROVER_jsa_list_nonZero);
  const __CPROVER_jsa_iterator_id_t __CPROVER_jsa_iterator_it=__CPROVER_jsa_iterator(&heap, __CPROVER_jsa_list_list);
  __CPROVER_jsa_assume(__CPROVER_jsa_hasNext(&heap, __CPROVER_jsa_iterator_it));

  const __CPROVER_jsa_data_t tmp=__CPROVER_jsa_next(&heap, __CPROVER_jsa_iterator_it);
  __CPROVER_jsa_add(&heap, __CPROVER_jsa_list_nonZero, tmp);
  __CPORVER_assert(!__CPROVER_jsa_hasNext(&heap, __CPROVER_jsa_iterator_it));
  const __CPROVER_jsa_iterator_id_t __CPROVER_jsa_iterator_copy_it=__CPROVER_jsa_iterator(&heap, __CPROVER_jsa_list_nonZero);
  const __CPROVER_jsa_data_t tmp2=__CPROVER_jsa_next(&heap, __CPROVER_jsa_iterator_copy_it);
  __CPROVER_jsa_assume(tmp == tmp2);

  __CPROVER_assert(0 == 1, "");

  return 0;
}