file_name
stringlengths 33
36
| verified_c_file_content
stringlengths 38
76k
| dependency_acls
stringlengths 0
9.54k
| function_implementation
stringlengths 12
11.9k
| verified
bool 1
class | total_goals
int64 1
124
| verified_goals
int64 1
124
| error_cause
stringclasses 1
value | c_code_snippet
stringlengths 12
11.9k
| acsl_snippet
stringlengths 0
9.54k
|
|---|---|---|---|---|---|---|---|---|---|
frama_c_files_v2/test_frama_c_1145.c
|
#include <stddef.h>
/*@ predicate monotone_slice(int* a, size_t low, size_t up) =
(\forall integer i,j; low <= i < j < up ==> a[i] < a[j]) ||
(\forall integer i,j; low <= i <= j < up ==> a[i] >= a[j]);
*/
/*@
requires length < 100;
requires a_valid: \valid(a + (0 .. length - 1));
requires res_valid: \valid(cutpoints + (0 .. length));
requires sep: \separated(a + (0 .. length - 1), cutpoints + (0 .. length));
assigns cutpoints[0 .. length];
ensures pos: \result > 0;
ensures beg: cutpoints[0] == 0;
ensures end: cutpoints[\result - 1] == length;
ensures bounds: \forall integer i; 0 <= i < \result ==>
0<= cutpoints[i] <= length;
ensures monotonic:
\forall integer i; 0 <= i < \result - 1 ==>
monotone_slice(a,cutpoints[i],cutpoints[i+1]);
*/
size_t monotonic(int* a, size_t length, size_t* cutpoints) {
cutpoints[0] = 0;
if (length == 0) return 1;
size_t x = 0, y = 1;
size_t res = 1;
/*@
loop invariant outer_bound: 1 <= y <= length;
loop invariant x_1: y < length ==> x == y - 1;
loop invariant x_2: y == length ==> x == y - 1 || x == y;
loop invariant monotone:
\forall integer i; 0 <= i < res - 1 ==>
monotone_slice(a,cutpoints[i],cutpoints[i+1]);
loop invariant res_bounds: 1 <= res <= y;
loop invariant content_bounds:
\forall integer i; 0 <= i < res ==> 0<= cutpoints[i] <= length;
loop invariant cuts_increase:
\forall integer i, j; 0 <= i <= j < res ==> cutpoints[i] <= cutpoints[j];
loop invariant last_write: cutpoints[res - 1] == x;
loop assigns x,y,res,cutpoints[1 .. length];
loop variant length - y;
*/
while (y < length) {
int increasing = a[x] < a[y];
/*@
loop invariant inner_bound: x + 1 <= y <= length;
loop invariant res_low: res <= y;
loop invariant mono_slice_1:
increasing ==> \forall integer i, j; x <= i < j < y ==> a[i] < a[j];
loop invariant mono_slice_2:
(!increasing) ==> \forall integer i, j; x <= i <= j < y ==> a[i] >= a[j];
loop assigns y;
loop variant length - y;
*/
while (y < length && (a[y-1] < a[y]) == increasing) y++;
/*@ assert mono: monotone_slice(a,x,y); */
cutpoints[res] = y;
res++;
/*@ assert mono_res: monotone_slice(a,cutpoints[res-2],cutpoints[res-1]);*/
x = y;
if (y < length) y++;
}
if (x < length) {
/*@ assert last: x == length - 1; */
/*@ assert mono_2: monotone_slice(a,x,length); */
cutpoints[res] = length;
res++;
/*@ assert mono_3: monotone_slice(a,cutpoints[res - 2], cutpoints[res - 1]); */
}
return res;
}
|
#include <stddef.h>
/*@ predicate monotone_slice(int* a, size_t low, size_t up) =
(\forall integer i,j; low <= i < j < up ==> a[i] < a[j]) ||
(\forall integer i,j; low <= i <= j < up ==> a[i] >= a[j]);
*/
/*@
requires length < 100;
requires a_valid: \valid(a + (0 .. length - 1));
requires res_valid: \valid(cutpoints + (0 .. length));
requires sep: \separated(a + (0 .. length - 1), cutpoints + (0 .. length));
assigns cutpoints[0 .. length];
ensures pos: \result > 0;
ensures beg: cutpoints[0] == 0;
ensures end: cutpoints[\result - 1] == length;
ensures bounds: \forall integer i; 0 <= i < \result ==>
0<= cutpoints[i] <= length;
ensures monotonic:
\forall integer i; 0 <= i < \result - 1 ==>
monotone_slice(a,cutpoints[i],cutpoints[i+1]);
*/
|
size_t monotonic(int* a, size_t length, size_t* cutpoints) {
cutpoints[0] = 0;
if (length == 0) return 1;
size_t x = 0, y = 1;
size_t res = 1;
/*@
loop invariant outer_bound: 1 <= y <= length;
loop invariant x_1: y < length ==> x == y - 1;
loop invariant x_2: y == length ==> x == y - 1 || x == y;
loop invariant monotone:
\forall integer i; 0 <= i < res - 1 ==>
monotone_slice(a,cutpoints[i],cutpoints[i+1]);
loop invariant res_bounds: 1 <= res <= y;
loop invariant content_bounds:
\forall integer i; 0 <= i < res ==> 0<= cutpoints[i] <= length;
loop invariant cuts_increase:
\forall integer i, j; 0 <= i <= j < res ==> cutpoints[i] <= cutpoints[j];
loop invariant last_write: cutpoints[res - 1] == x;
loop assigns x,y,res,cutpoints[1 .. length];
loop variant length - y;
*/
while (y < length) {
int increasing = a[x] < a[y];
/*@
loop invariant inner_bound: x + 1 <= y <= length;
loop invariant res_low: res <= y;
loop invariant mono_slice_1:
increasing ==> \forall integer i, j; x <= i < j < y ==> a[i] < a[j];
loop invariant mono_slice_2:
(!increasing) ==> \forall integer i, j; x <= i <= j < y ==> a[i] >= a[j];
loop assigns y;
loop variant length - y;
*/
while (y < length && (a[y-1] < a[y]) == increasing) y++;
/*@ assert mono: monotone_slice(a,x,y); */
cutpoints[res] = y;
res++;
/*@ assert mono_res: monotone_slice(a,cutpoints[res-2],cutpoints[res-1]);*/
x = y;
if (y < length) y++;
}
if (x < length) {
/*@ assert last: x == length - 1; */
/*@ assert mono_2: monotone_slice(a,x,length); */
cutpoints[res] = length;
res++;
/*@ assert mono_3: monotone_slice(a,cutpoints[res - 2], cutpoints[res - 1]); */
}
return res;
}
| true | 57 | 57 |
size_t monotonic(int* a, size_t length, size_t* cutpoints) {
cutpoints[0] = 0;
if (length == 0) return 1;
size_t x = 0, y = 1;
size_t res = 1;
/*@
loop invariant outer_bound: 1 <= y <= length;
loop invariant x_1: y < length ==> x == y - 1;
loop invariant x_2: y == length ==> x == y - 1 || x == y;
loop invariant monotone:
\forall integer i; 0 <= i < res - 1 ==>
monotone_slice(a,cutpoints[i],cutpoints[i+1]);
loop invariant res_bounds: 1 <= res <= y;
loop invariant content_bounds:
\forall integer i; 0 <= i < res ==> 0<= cutpoints[i] <= length;
loop invariant cuts_increase:
\forall integer i, j; 0 <= i <= j < res ==> cutpoints[i] <= cutpoints[j];
loop invariant last_write: cutpoints[res - 1] == x;
loop assigns x,y,res,cutpoints[1 .. length];
loop variant length - y;
*/
while (y < length) {
int increasing = a[x] < a[y];
/*@
loop invariant inner_bound: x + 1 <= y <= length;
loop invariant res_low: res <= y;
loop invariant mono_slice_1:
increasing ==> \forall integer i, j; x <= i < j < y ==> a[i] < a[j];
loop invariant mono_slice_2:
(!increasing) ==> \forall integer i, j; x <= i <= j < y ==> a[i] >= a[j];
loop assigns y;
loop variant length - y;
*/
while (y < length && (a[y-1] < a[y]) == increasing) y++;
/*@ assert mono: monotone_slice(a,x,y); */
cutpoints[res] = y;
res++;
/*@ assert mono_res: monotone_slice(a,cutpoints[res-2],cutpoints[res-1]);*/
x = y;
if (y < length) y++;
}
if (x < length) {
/*@ assert last: x == length - 1; */
/*@ assert mono_2: monotone_slice(a,x,length); */
cutpoints[res] = length;
res++;
/*@ assert mono_3: monotone_slice(a,cutpoints[res - 2], cutpoints[res - 1]); */
}
return res;
}
|
#include <stddef.h>
/*@ predicate monotone_slice(int* a, size_t low, size_t up) =
(\forall integer i,j; low <= i < j < up ==> a[i] < a[j]) ||
(\forall integer i,j; low <= i <= j < up ==> a[i] >= a[j]);
*/
/*@
requires length < 100;
requires a_valid: \valid(a + (0 .. length - 1));
requires res_valid: \valid(cutpoints + (0 .. length));
requires sep: \separated(a + (0 .. length - 1), cutpoints + (0 .. length));
assigns cutpoints[0 .. length];
ensures pos: \result > 0;
ensures beg: cutpoints[0] == 0;
ensures end: cutpoints[\result - 1] == length;
ensures bounds: \forall integer i; 0 <= i < \result ==>
0<= cutpoints[i] <= length;
ensures monotonic:
\forall integer i; 0 <= i < \result - 1 ==>
monotone_slice(a,cutpoints[i],cutpoints[i+1]);
*/
|
|
frama_c_files_v2/test_frama_c_2509.c
|
/*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures (*a) == \old(*b);
ensures (*b) == \old(*a);
*/
void foo(int* a, int* b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
|
/*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures (*a) == \old(*b);
ensures (*b) == \old(*a);
*/
|
void foo(int* a, int* b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
| true | 10 | 10 |
void foo(int* a, int* b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
|
/*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures (*a) == \old(*b);
ensures (*b) == \old(*a);
*/
|
|
frama_c_files_v2/test_frama_c_2563.c
|
/*@requires a>0 && a<2147483647;
ensures\result>1;*/
int next(int a)
{return a + 1;}
|
/*@requires a>0 && a<2147483647;
ensures\result>1;*/
|
int next(int a)
{return a + 1;}
| true | 4 | 4 |
int next(int a)
{return a + 1;}
|
/*@requires a>0 && a<2147483647;
ensures\result>1;*/
|
|
frama_c_files_v2/test_frama_c_2867.c
|
/*@
predicate swapped {L1, L2}(int* a, int* b) =
\at(*a, L1) == \at(*b, L2) &&
\at(*b, L1) == \at(*a, L2);
*/
/*@
requires \valid(a);
requires \valid(b);
assigns *a;
assigns *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
ensures swapped{Here, Old}(a,b);
*/
void swap (int* a, int* b )
{
int c = *a;
*a = *b;
*b = c;
}
|
/*@
predicate swapped {L1, L2}(int* a, int* b) =
\at(*a, L1) == \at(*b, L2) &&
\at(*b, L1) == \at(*a, L2);
*/
/*@
requires \valid(a);
requires \valid(b);
assigns *a;
assigns *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
ensures swapped{Here, Old}(a,b);
*/
|
void swap (int* a, int* b )
{
int c = *a;
*a = *b;
*b = c;
}
| true | 11 | 11 |
void swap (int* a, int* b )
{
int c = *a;
*a = *b;
*b = c;
}
|
/*@
predicate swapped {L1, L2}(int* a, int* b) =
\at(*a, L1) == \at(*b, L2) &&
\at(*b, L1) == \at(*a, L2);
*/
/*@
requires \valid(a);
requires \valid(b);
assigns *a;
assigns *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
ensures swapped{Here, Old}(a,b);
*/
|
|
frama_c_files_v2/test_frama_c_806.c
|
#include <stdio.h>
/*@
requires \valid(a+(0..n-1));
requires n > 0;
ensures \forall integer i,j; 0<=i<=j<=n-1 ==> a[i]<=a[j];
*/
void bubbleSort(int *a, int n) {
int i, j, temp;
/*@
loop invariant \forall integer p,q; i<=p<=q<=n-1 ==> a[p]<=a[q];
loop invariant \forall integer p,q; 0<=p<i+1==q<=n-1 ==> a[p]<=a[q];
loop invariant 0<=i<n;
loop assigns i,j,temp,a[0..n-1];
loop variant i;
*/
for(i=n-1; i>0; i--) {
/*@ loop invariant 0<=j<=i<n;
loop invariant \forall integer k; 0<=k<=j ==> a[k] <= a[j];
loop invariant \forall integer p, q; 0<=p<i+1==q<=n-1 ==> a[p]<=a[q];
loop assigns j,temp,a[0..i];
loop variant i-j;
*/
for(j=0; j<i; j++) {
if (a[j] > a[j+1]) {
temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
}
|
#include <stdio.h>
/*@
requires \valid(a+(0..n-1));
requires n > 0;
ensures \forall integer i,j; 0<=i<=j<=n-1 ==> a[i]<=a[j];
*/
|
void bubbleSort(int *a, int n) {
int i, j, temp;
/*@
loop invariant \forall integer p,q; i<=p<=q<=n-1 ==> a[p]<=a[q];
loop invariant \forall integer p,q; 0<=p<i+1==q<=n-1 ==> a[p]<=a[q];
loop invariant 0<=i<n;
loop assigns i,j,temp,a[0..n-1];
loop variant i;
*/
for(i=n-1; i>0; i--) {
/*@ loop invariant 0<=j<=i<n;
loop invariant \forall integer k; 0<=k<=j ==> a[k] <= a[j];
loop invariant \forall integer p, q; 0<=p<i+1==q<=n-1 ==> a[p]<=a[q];
loop assigns j,temp,a[0..i];
loop variant i-j;
*/
for(j=0; j<i; j++) {
if (a[j] > a[j+1]) {
temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
}
| true | 38 | 38 |
void bubbleSort(int *a, int n) {
int i, j, temp;
/*@
loop invariant \forall integer p,q; i<=p<=q<=n-1 ==> a[p]<=a[q];
loop invariant \forall integer p,q; 0<=p<i+1==q<=n-1 ==> a[p]<=a[q];
loop invariant 0<=i<n;
loop assigns i,j,temp,a[0..n-1];
loop variant i;
*/
for(i=n-1; i>0; i--) {
/*@ loop invariant 0<=j<=i<n;
loop invariant \forall integer k; 0<=k<=j ==> a[k] <= a[j];
loop invariant \forall integer p, q; 0<=p<i+1==q<=n-1 ==> a[p]<=a[q];
loop assigns j,temp,a[0..i];
loop variant i-j;
*/
for(j=0; j<i; j++) {
if (a[j] > a[j+1]) {
temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
}
|
#include <stdio.h>
/*@
requires \valid(a+(0..n-1));
requires n > 0;
ensures \forall integer i,j; 0<=i<=j<=n-1 ==> a[i]<=a[j];
*/
|
|
frama_c_files_v2/test_frama_c_2602.c
|
/*@ requires size >= 0;
requires \valid(a+(0..size-1));
requires \valid(res+(0..size-1));
assigns res[0..size-1];
ensures \forall integer i; 0 <= i < size ==> res[i] == a[size - i - 1];
*/
void reverse(int a[], int res[], int size)
{
int i;
/*@ loop invariant -1 <= i < size; //Найдите ошибку
loop invariant \forall integer j; i < j < size ==> res[j] == a[size - j - 1];
loop assigns i, res[0..size-1];
loop variant i;
*/
for(i = size - 1; i >= 0; --i) {
res[i] = a[size - i - 1];
}
}
#ifdef OUT_OF_TASK
#include <stdio.h>
int main(void)
{
int a[] = {1,2,3,4,5,6,7,8,9,10};
int size = sizeof(a) / sizeof(a[0]);
int b[size];
for(int i = 0; i < size; ++i) {
printf("%d ", a[i]);
}
printf("\n");
reverse(a, b, size);
for(int i = 0; i < size; ++i) {
printf("%d ", b[i]);
}
printf("\n");
}
#endif
|
#include <stdio.h>
/*@ requires size >= 0;
requires \valid(a+(0..size-1));
requires \valid(res+(0..size-1));
assigns res[0..size-1];
ensures \forall integer i; 0 <= i < size ==> res[i] == a[size - i - 1];
*/
|
void reverse(int a[], int res[], int size)
{
int i;
/*@ loop invariant -1 <= i < size; //Найдите ошибку
loop invariant \forall integer j; i < j < size ==> res[j] == a[size - j - 1];
loop assigns i, res[0..size-1];
loop variant i;
*/
for(i = size - 1; i >= 0; --i) {
res[i] = a[size - i - 1];
}
}
| true | 20 | 20 |
void reverse(int a[], int res[], int size)
{
int i;
/*@ loop invariant -1 <= i < size; //Найдите ошибку
loop invariant \forall integer j; i < j < size ==> res[j] == a[size - j - 1];
loop assigns i, res[0..size-1];
loop variant i;
*/
for(i = size - 1; i >= 0; --i) {
res[i] = a[size - i - 1];
}
}
|
#include <stdio.h>
/*@ requires size >= 0;
requires \valid(a+(0..size-1));
requires \valid(res+(0..size-1));
assigns res[0..size-1];
ensures \forall integer i; 0 <= i < size ==> res[i] == a[size - i - 1];
*/
|
|
frama_c_files_v2/test_frama_c_2252.c
|
/*@ predicate Swap{L1,L2}(int *a, integer i, integer j) =
@ \at(a[i],L1) == \at(a[j],L2) &&
@ \at(a[j],L1) == \at(a[i],L2) ;
@*/
/*@ inductive Permuta{L1,L2}(int *a, integer l, integer h) {
@ case Permut_refl{L}:
@ \forall int *a, integer l, h; Permuta{L,L}(a, l, h) ;
@ case Permut_sym{L1,L2}:
@ \forall int *a, integer l, h;
@ Permuta{L1,L2}(a, l, h) ==> Permuta{L2,L1}(a, l, h) ;
@ case Permut_trans{L1,L2,L3}:
@ \forall int *a, integer l, h;
@ Permuta{L1,L2}(a, l, h) && Permuta{L2,L3}(a, l, h) ==>
@ Permuta{L1,L3}(a, l, h) ;
@ case Permut_swap{L1,L2}:
@ \forall int *a, integer l, h, i, j;
@ l <= i <= h && l <= j <= h && Swap{L1,L2}(a, i, j) ==>
@ Permuta{L1,L2}(a, l, h) ;
@ }
@*/
/*@ requires \valid(t+(start..end)) && start <= i <= end && start <= j <= end;
@ ensures Swap{Old,Here}(t,i,j);
@ assigns t[i],t[j];
@*/
void swap(int t[],int i,int j, int start, int end) {
int tmp = t[i];
t[i] = t[j];
t[j] = tmp;
}
/*@ requires 0 <= p <= r && \valid(A+(p..r));
@ assigns A[p..r];
@ behavior partition:
@ ensures
@ p <= \result <= r &&
@ (\forall int l; p <= l < \result ==> A[l] <= A[\result]) &&
@ (\forall int l; \result < l <= r ==> A[l] > A[\result]) &&
@ A[\result] == \old(A[r]) ;
@ behavior permutation:
@ ensures
@ Permuta{Old,Here}(A,p,r);
@*/
int partition (int A[], int p, int r)
{
int x = A[r];
int j, i = p-1;
/*@ loop invariant
@ p <= j <= r && p-1 <= i < j;
@ loop assigns i, j, A[p..r-1];
@ for partition:
@ loop invariant
@ (\forall int k; (p <= k <= i) ==> A[k] <= x) &&
@ (\forall int k; (i < k < j) ==> A[k] > x) &&
@ A[r] == x;
@ for permutation:
@ loop invariant
@ Permuta{Pre,Here}(A,p,r);
@ loop variant (r-j);
@*/
for (j=p; j<r; j++)
if (A[j] <= x) {
i++;
swap(A,i,j,p,r);
}
swap(A,i+1,r,p,r);
return i+1;
}
|
/*@ predicate Swap{L1,L2}(int *a, integer i, integer j) =
@ \at(a[i],L1) == \at(a[j],L2) &&
@ \at(a[j],L1) == \at(a[i],L2) ;
@*/
/*@ inductive Permuta{L1,L2}(int *a, integer l, integer h) {
@ case Permut_refl{L}:
@ \forall int *a, integer l, h; Permuta{L,L}(a, l, h) ;
@ case Permut_sym{L1,L2}:
@ \forall int *a, integer l, h;
@ Permuta{L1,L2}(a, l, h) ==> Permuta{L2,L1}(a, l, h) ;
@ case Permut_trans{L1,L2,L3}:
@ \forall int *a, integer l, h;
@ Permuta{L1,L2}(a, l, h) && Permuta{L2,L3}(a, l, h) ==>
@ Permuta{L1,L3}(a, l, h) ;
@ case Permut_swap{L1,L2}:
@ \forall int *a, integer l, h, i, j;
@ l <= i <= h && l <= j <= h && Swap{L1,L2}(a, i, j) ==>
@ Permuta{L1,L2}(a, l, h) ;
@ }
@*/
/*@ requires \valid(t+(start..end)) && start <= i <= end && start <= j <= end;
@ ensures Swap{Old,Here}(t,i,j);
@ assigns t[i],t[j];
@*/
|
void swap(int t[],int i,int j, int start, int end) {
int tmp = t[i];
t[i] = t[j];
t[j] = tmp;
}
| true | 9 | 9 |
void swap(int t[],int i,int j, int start, int end) {
int tmp = t[i];
t[i] = t[j];
t[j] = tmp;
}
|
/*@ predicate Swap{L1,L2}(int *a, integer i, integer j) =
@ \at(a[i],L1) == \at(a[j],L2) &&
@ \at(a[j],L1) == \at(a[i],L2) ;
@*/
/*@ inductive Permuta{L1,L2}(int *a, integer l, integer h) {
@ case Permut_refl{L}:
@ \forall int *a, integer l, h; Permuta{L,L}(a, l, h) ;
@ case Permut_sym{L1,L2}:
@ \forall int *a, integer l, h;
@ Permuta{L1,L2}(a, l, h) ==> Permuta{L2,L1}(a, l, h) ;
@ case Permut_trans{L1,L2,L3}:
@ \forall int *a, integer l, h;
@ Permuta{L1,L2}(a, l, h) && Permuta{L2,L3}(a, l, h) ==>
@ Permuta{L1,L3}(a, l, h) ;
@ case Permut_swap{L1,L2}:
@ \forall int *a, integer l, h, i, j;
@ l <= i <= h && l <= j <= h && Swap{L1,L2}(a, i, j) ==>
@ Permuta{L1,L2}(a, l, h) ;
@ }
@*/
/*@ requires \valid(t+(start..end)) && start <= i <= end && start <= j <= end;
@ ensures Swap{Old,Here}(t,i,j);
@ assigns t[i],t[j];
@*/
|
|
frama_c_files_v2/test_frama_c_2446.c
|
/*@ requires \valid(&a[i]);
requires \valid(&a[j]);
assigns a[i], a[j];
ensures a[i] == \old(a[j]);
ensures a[j] == \old(a[i]);
*/
void swap(int a[], int i, int j)
#ifndef OUT_OF_TASK
;
#else
{
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
#endif
/*@ predicate reverse{L1,L2}(int* a, integer size, integer i, integer j) =
\forall integer k; i <= k < j ==>
\at(a[k], L1) == \at(a[size - k - 1], L2);
predicate reverse{L1,L2}(int* a, integer size) = reverse{L1,L2}(a, size, 0, size);
*/
/*@ requires size >= 0;
requires \valid(a+(0..size-1));
assigns a[0..size-1];
ensures reverse{Pre,Here}(a, size);
ensures \forall integer i; 0 <= i < size ==>
\exists integer j; 0 <= j < size &&
\old(a[\at(i,Here)]) == a[j];
*/
void reverse_in_place(int a[], int size)
{
int i;
/*@ loop invariant 0 <= i <= size / 2;
loop invariant reverse{Pre,Here}(a, size, 0, i);
loop invariant \forall integer j; i <= j < size - i ==> a[j] == \at(a[\at(j,Here)],Pre);
loop invariant reverse{Pre,Here}(a, size, size - i, size);
loop assigns i, a[0..size-1];
loop variant size / 2 - i;
*/
for(i = 0; i < (size / 2); ++i) {
swap(a, i, size - i - 1);
}
}
#ifdef OUT_OF_TASK
#include <stdio.h>
int main(void)
{
int a[] = {1,2,3,4,5,6,7,8,9,10};
int size = sizeof(a) / sizeof(a[0]);
for(int i = 0; i < size; ++i) {
printf("%d ", a[i]);
}
printf("\n");
reverse_in_place(a, size);
for(int i = 0; i < size; ++i) {
printf("%d ", a[i]);
}
printf("\n");
}
#endif
|
#include <stdio.h>
/*@ requires \valid(&a[i]);
requires \valid(&a[j]);
assigns a[i], a[j];
ensures a[i] == \old(a[j]);
ensures a[j] == \old(a[i]);
*/
void swap(int a[], int i, int j)
#ifndef OUT_OF_TASK
;
#else
{
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
#endif
/*@ predicate reverse{L1,L2}(int* a, integer size, integer i, integer j) =
\forall integer k; i <= k < j ==>
\at(a[k], L1) == \at(a[size - k - 1], L2);
predicate reverse{L1,L2}(int* a, integer size) = reverse{L1,L2}(a, size, 0, size);
*/
/*@ requires size >= 0;
requires \valid(a+(0..size-1));
assigns a[0..size-1];
ensures reverse{Pre,Here}(a, size);
ensures \forall integer i; 0 <= i < size ==>
\exists integer j; 0 <= j < size &&
\old(a[\at(i,Here)]) == a[j];
*/
|
void reverse_in_place(int a[], int size)
{
int i;
/*@ loop invariant 0 <= i <= size / 2;
loop invariant reverse{Pre,Here}(a, size, 0, i);
loop invariant \forall integer j; i <= j < size - i ==> a[j] == \at(a[\at(j,Here)],Pre);
loop invariant reverse{Pre,Here}(a, size, size - i, size);
loop assigns i, a[0..size-1];
loop variant size / 2 - i;
*/
for(i = 0; i < (size / 2); ++i) {
swap(a, i, size - i - 1);
}
}
| true | 28 | 28 |
void reverse_in_place(int a[], int size)
{
int i;
/*@ loop invariant 0 <= i <= size / 2;
loop invariant reverse{Pre,Here}(a, size, 0, i);
loop invariant \forall integer j; i <= j < size - i ==> a[j] == \at(a[\at(j,Here)],Pre);
loop invariant reverse{Pre,Here}(a, size, size - i, size);
loop assigns i, a[0..size-1];
loop variant size / 2 - i;
*/
for(i = 0; i < (size / 2); ++i) {
swap(a, i, size - i - 1);
}
}
|
#include <stdio.h>
/*@ requires \valid(&a[i]);
requires \valid(&a[j]);
assigns a[i], a[j];
ensures a[i] == \old(a[j]);
ensures a[j] == \old(a[i]);
*/
void swap(int a[], int i, int j)
#ifndef OUT_OF_TASK
;
#else
{
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
#endif
/*@ predicate reverse{L1,L2}(int* a, integer size, integer i, integer j) =
\forall integer k; i <= k < j ==>
\at(a[k], L1) == \at(a[size - k - 1], L2);
predicate reverse{L1,L2}(int* a, integer size) = reverse{L1,L2}(a, size, 0, size);
*/
/*@ requires size >= 0;
requires \valid(a+(0..size-1));
assigns a[0..size-1];
ensures reverse{Pre,Here}(a, size);
ensures \forall integer i; 0 <= i < size ==>
\exists integer j; 0 <= j < size &&
\old(a[\at(i,Here)]) == a[j];
*/
|
|
frama_c_files_v2/test_frama_c_502.c
|
/*@
requires n>0;
behavior one:
assumes n>0;
ensures \result == n;
behavior two:
assumes n<0;
ensures \result == (-1)*n;
complete behaviors;
disjoint behaviors;
*/
int ABS(int n)
{
if (n < 0)
{
n = (-1) * n;
}
return n;
}
|
/*@
requires n>0;
behavior one:
assumes n>0;
ensures \result == n;
behavior two:
assumes n<0;
ensures \result == (-1)*n;
complete behaviors;
disjoint behaviors;
*/
|
int ABS(int n)
{
if (n < 0)
{
n = (-1) * n;
}
return n;
}
| true | 8 | 8 |
int ABS(int n)
{
if (n < 0)
{
n = (-1) * n;
}
return n;
}
|
/*@
requires n>0;
behavior one:
assumes n>0;
ensures \result == n;
behavior two:
assumes n<0;
ensures \result == (-1)*n;
complete behaviors;
disjoint behaviors;
*/
|
|
frama_c_files_v2/test_frama_c_1352.c
|
/*@ predicate sorted{L}(int* a, integer length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ predicate swap{L1,L2}(int* a,integer i,integer j,integer length)=
0<=i<j<length
&& \at(a[i],L1) == \at(a[j],L2)
&& \at(a[i],L2) == \at(a[j],L1)
&& \forall integer k; 0<=k<length && k!=i && k!=j ==>
\at(a[k],L1) == \at(a[k],L2);
*/
/*@ inductive same_elements{L1,L2}(int*a , integer length) {
case refl{L}:
\forall int*a, integer length; same_elements{L,L}(a,length);
case swap{L1,L2}: \forall int*a, integer i,j,length;
swap{L1,L2}(a,i,j,length) ==> same_elements{L1,L2}(a,length);
case trans{L1,L2,L3}: \forall int*a, integer length;
same_elements{L1,L2}(a,length)
==> same_elements{L2,L3}(a,length)
==> same_elements{L1,L3}(a,length);
}
*/
/*@ requires valid_array: \valid(a+(0..length-1));
requires non_empty: length > 0;
assigns a[0..length-1];
behavior sorted:
ensures sorted(a,length);
behavior same_elements:
ensures same_elements{Pre,Here}(a,length);
*/
void sort (int* a, int length) {
int current;
/*@ loop invariant outer_bounds: 0<=current<length;
loop assigns a[0..length-1],current;
for sorted: loop invariant begin_sort: sorted(a,current);
for sorted: loop invariant tail_bigger:
\forall integer i,j; 0<=i<current<=j<length ==> a[i] <= a[j];
for same_elements: loop invariant
same_elements{Pre,Here}(a,length);
loop variant length-current;
*/
for (current = 0; current < length - 1; current++) {
int min_idx = current;
int min = a[current];
/*@ loop invariant inner_bounds: current+1<=i<=length;
loop assigns i,min,min_idx;
loop invariant min_idx_bounds: current<=min_idx<i;
loop invariant min_idx_val: a[min_idx] == min;
for sorted: loop invariant min_idx_min:
\forall integer j; current<=j<i ==> min <= a[j];
loop variant length -i;
*/
for (int i = current + 1; i < length; i++) {
if (a[i] < min) {
min = a[i];
min_idx = i;
}
}
if(min_idx != current) {
L: a[min_idx]=a[current];
a[current]=min;
/*@ for same_elements: assert swap:
swap{L,Here}(a,current,min_idx,length);
*/
}
}
}
|
/*@ predicate sorted{L}(int* a, integer length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ predicate swap{L1,L2}(int* a,integer i,integer j,integer length)=
0<=i<j<length
&& \at(a[i],L1) == \at(a[j],L2)
&& \at(a[i],L2) == \at(a[j],L1)
&& \forall integer k; 0<=k<length && k!=i && k!=j ==>
\at(a[k],L1) == \at(a[k],L2);
*/
/*@ inductive same_elements{L1,L2}(int*a , integer length) {
case refl{L}:
\forall int*a, integer length; same_elements{L,L}(a,length);
case swap{L1,L2}: \forall int*a, integer i,j,length;
swap{L1,L2}(a,i,j,length) ==> same_elements{L1,L2}(a,length);
case trans{L1,L2,L3}: \forall int*a, integer length;
same_elements{L1,L2}(a,length)
==> same_elements{L2,L3}(a,length)
==> same_elements{L1,L3}(a,length);
}
*/
/*@ requires valid_array: \valid(a+(0..length-1));
requires non_empty: length > 0;
assigns a[0..length-1];
behavior sorted:
ensures sorted(a,length);
behavior same_elements:
ensures same_elements{Pre,Here}(a,length);
*/
|
void sort (int* a, int length) {
int current;
/*@ loop invariant outer_bounds: 0<=current<length;
loop assigns a[0..length-1],current;
for sorted: loop invariant begin_sort: sorted(a,current);
for sorted: loop invariant tail_bigger:
\forall integer i,j; 0<=i<current<=j<length ==> a[i] <= a[j];
for same_elements: loop invariant
same_elements{Pre,Here}(a,length);
loop variant length-current;
*/
for (current = 0; current < length - 1; current++) {
int min_idx = current;
int min = a[current];
/*@ loop invariant inner_bounds: current+1<=i<=length;
loop assigns i,min,min_idx;
loop invariant min_idx_bounds: current<=min_idx<i;
loop invariant min_idx_val: a[min_idx] == min;
for sorted: loop invariant min_idx_min:
\forall integer j; current<=j<i ==> min <= a[j];
loop variant length -i;
*/
for (int i = current + 1; i < length; i++) {
if (a[i] < min) {
min = a[i];
min_idx = i;
}
}
if(min_idx != current) {
L: a[min_idx]=a[current];
a[current]=min;
/*@ for same_elements: assert swap:
swap{L,Here}(a,current,min_idx,length);
*/
}
}
}
| true | 43 | 43 |
void sort (int* a, int length) {
int current;
/*@ loop invariant outer_bounds: 0<=current<length;
loop assigns a[0..length-1],current;
for sorted: loop invariant begin_sort: sorted(a,current);
for sorted: loop invariant tail_bigger:
\forall integer i,j; 0<=i<current<=j<length ==> a[i] <= a[j];
for same_elements: loop invariant
same_elements{Pre,Here}(a,length);
loop variant length-current;
*/
for (current = 0; current < length - 1; current++) {
int min_idx = current;
int min = a[current];
/*@ loop invariant inner_bounds: current+1<=i<=length;
loop assigns i,min,min_idx;
loop invariant min_idx_bounds: current<=min_idx<i;
loop invariant min_idx_val: a[min_idx] == min;
for sorted: loop invariant min_idx_min:
\forall integer j; current<=j<i ==> min <= a[j];
loop variant length -i;
*/
for (int i = current + 1; i < length; i++) {
if (a[i] < min) {
min = a[i];
min_idx = i;
}
}
if(min_idx != current) {
L: a[min_idx]=a[current];
a[current]=min;
/*@ for same_elements: assert swap:
swap{L,Here}(a,current,min_idx,length);
*/
}
}
}
|
/*@ predicate sorted{L}(int* a, integer length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ predicate swap{L1,L2}(int* a,integer i,integer j,integer length)=
0<=i<j<length
&& \at(a[i],L1) == \at(a[j],L2)
&& \at(a[i],L2) == \at(a[j],L1)
&& \forall integer k; 0<=k<length && k!=i && k!=j ==>
\at(a[k],L1) == \at(a[k],L2);
*/
/*@ inductive same_elements{L1,L2}(int*a , integer length) {
case refl{L}:
\forall int*a, integer length; same_elements{L,L}(a,length);
case swap{L1,L2}: \forall int*a, integer i,j,length;
swap{L1,L2}(a,i,j,length) ==> same_elements{L1,L2}(a,length);
case trans{L1,L2,L3}: \forall int*a, integer length;
same_elements{L1,L2}(a,length)
==> same_elements{L2,L3}(a,length)
==> same_elements{L1,L3}(a,length);
}
*/
/*@ requires valid_array: \valid(a+(0..length-1));
requires non_empty: length > 0;
assigns a[0..length-1];
behavior sorted:
ensures sorted(a,length);
behavior same_elements:
ensures same_elements{Pre,Here}(a,length);
*/
|
|
frama_c_files_v2/test_frama_c_16.c
|
#include <limits.h>
/*@
requires INT_MIN<x && INT_MIN<y;
ensures \result>=x && \result>=y;
ensures \result==x || \result==y;
*/
int max ( int x, int y ) {
if ( x >=y )
return x ;
return y ;
}
void foo()
{
int s = max(34,45);
int t = max(-43,34);
}
|
#include <limits.h>
/*@
requires INT_MIN<x && INT_MIN<y;
ensures \result>=x && \result>=y;
ensures \result==x || \result==y;
*/
|
int max ( int x, int y ) {
if ( x >=y )
return x ;
return y ;
}
| true | 4 | 4 |
int max ( int x, int y ) {
if ( x >=y )
return x ;
return y ;
}
|
#include <limits.h>
/*@
requires INT_MIN<x && INT_MIN<y;
ensures \result>=x && \result>=y;
ensures \result==x || \result==y;
*/
|
|
frama_c_files_v2/test_frama_c_2206.c
|
/*@ requires \valid(&a[i]);
requires \valid(&a[j]);
assigns a[i], a[j];
ensures a[i] == \old(a[j]);
ensures a[j] == \old(a[i]);
*/
void swap(int a[], int i, int j);
/*@ predicate reverse{L1,L2}(int* a, integer size, integer i, integer j) =
\forall integer k; i <= k < j ==>
\at(a[k], L1) == \at(a[size - k - 1], L2);
predicate reverse{L1,L2}(int* a, integer size) = reverse{L1,L2}(a, size, 0, size);
*/
/*@ requires size >= 0;
requires \valid(a+(0..size-1));
assigns a[0..size-1];
ensures reverse{Pre,Here}(a, size);
ensures \forall integer i; 0 <= i < size ==>
\exists integer j; 0 <= j < size &&
\old(a[\at(i,Here)]) == a[j];
*/
void reverse_in_place(int a[], int size)
{
int i;
/*@ loop invariant 0 <= i <= size / 2;
loop invariant reverse{Pre,Here}(a, size, 0, i);
loop invariant \forall integer j; i <= j < size - i ==> a[j] == \at(a[\at(j,Here)],Pre);
loop invariant reverse{Pre,Here}(a, size, size - i, size);
loop assigns i, a[0..size-1];
loop variant size / 2 - i;
*/
for(i = 0; i < (size / 2); ++i) {
swap(a, i, size - i - 1);
}
}
|
/*@ requires \valid(&a[i]);
requires \valid(&a[j]);
assigns a[i], a[j];
ensures a[i] == \old(a[j]);
ensures a[j] == \old(a[i]);
*/
void swap(int a[], int i, int j);
/*@ predicate reverse{L1,L2}(int* a, integer size, integer i, integer j) =
\forall integer k; i <= k < j ==>
\at(a[k], L1) == \at(a[size - k - 1], L2);
predicate reverse{L1,L2}(int* a, integer size) = reverse{L1,L2}(a, size, 0, size);
*/
/*@ requires size >= 0;
requires \valid(a+(0..size-1));
assigns a[0..size-1];
ensures reverse{Pre,Here}(a, size);
ensures \forall integer i; 0 <= i < size ==>
\exists integer j; 0 <= j < size &&
\old(a[\at(i,Here)]) == a[j];
*/
|
void reverse_in_place(int a[], int size)
{
int i;
/*@ loop invariant 0 <= i <= size / 2;
loop invariant reverse{Pre,Here}(a, size, 0, i);
loop invariant \forall integer j; i <= j < size - i ==> a[j] == \at(a[\at(j,Here)],Pre);
loop invariant reverse{Pre,Here}(a, size, size - i, size);
loop assigns i, a[0..size-1];
loop variant size / 2 - i;
*/
for(i = 0; i < (size / 2); ++i) {
swap(a, i, size - i - 1);
}
}
| true | 28 | 28 |
void reverse_in_place(int a[], int size)
{
int i;
/*@ loop invariant 0 <= i <= size / 2;
loop invariant reverse{Pre,Here}(a, size, 0, i);
loop invariant \forall integer j; i <= j < size - i ==> a[j] == \at(a[\at(j,Here)],Pre);
loop invariant reverse{Pre,Here}(a, size, size - i, size);
loop assigns i, a[0..size-1];
loop variant size / 2 - i;
*/
for(i = 0; i < (size / 2); ++i) {
swap(a, i, size - i - 1);
}
}
|
/*@ requires \valid(&a[i]);
requires \valid(&a[j]);
assigns a[i], a[j];
ensures a[i] == \old(a[j]);
ensures a[j] == \old(a[i]);
*/
void swap(int a[], int i, int j);
/*@ predicate reverse{L1,L2}(int* a, integer size, integer i, integer j) =
\forall integer k; i <= k < j ==>
\at(a[k], L1) == \at(a[size - k - 1], L2);
predicate reverse{L1,L2}(int* a, integer size) = reverse{L1,L2}(a, size, 0, size);
*/
/*@ requires size >= 0;
requires \valid(a+(0..size-1));
assigns a[0..size-1];
ensures reverse{Pre,Here}(a, size);
ensures \forall integer i; 0 <= i < size ==>
\exists integer j; 0 <= j < size &&
\old(a[\at(i,Here)]) == a[j];
*/
|
|
frama_c_files_v2/test_frama_c_857.c
|
#include <limits.h>
/*@ requires x < INT_MAX;
ensures \result > x;
*/
int inc (int x) { return x+1; }
|
#include <limits.h>
/*@ requires x < INT_MAX;
ensures \result > x;
*/
|
int inc (int x) { return x+1; }
| true | 4 | 4 |
int inc (int x) { return x+1; }
|
#include <limits.h>
/*@ requires x < INT_MAX;
ensures \result > x;
*/
|
|
frama_c_files_v2/test_frama_c_606.c
|
#include <limits.h>
#include <string.h>
/*@ predicate star_A(char * x93, integer x94, integer x95) = ((x94==x95) || (\exists integer x98; (((x94<x98) &&
(x98<=x95)) ==> ((('A'==x93[x94]) &&
(x98==(x94+1))) &&
star_A(x93,x98,x95)))));*/
/*@ predicate star_D(char * x114, integer x115, integer x116) = ((x115==x116) || (\exists integer x119; (((x115<x119) &&
(x119<=x116)) ==> ((('D'==x114[x115]) &&
(x119==(x115+1))) &&
star_D(x114,x119,x116)))));*/
/*@ predicate star_C(char * x135, integer x136, integer x137) = ((x136==x137) || (\exists integer x140; (((x136<x140) &&
(x140<=x137)) ==> ((('C'==x135[x136]) &&
(x140==(x136+1))) &&
star_C(x135,x140,x137)))));*/
/*@ predicate star__orB_or_C_sCs_Bor_(char * x156, integer x157, integer x158) = ((x157==x158) || (\exists integer x161; (((x157<x161) &&
(x161<=x158)) ==> (((('B'==x156[x157]) &&
(x161==(x157+1))) || (\exists integer x170; ((((x157<=x170) &&
(x170<=x161)) &&
(('C'==x156[x157]) &&
(x170==(x157+1)))) &&
(\exists integer x178; ((((x170<=x178) &&
(x178<=x161)) &&
star_C(x156,x170,x178)) &&
(('B'==x156[x178]) &&
(x161==(x178+1)))))))) &&
star__orB_or_C_sCs_Bor_(x156,x161,x158)))));*/
/*@ predicate re_0(char * x0, integer x1, integer x2) = (\exists integer x4; ((((x1<=x4) &&
(x4<=x2)) &&
(('A'==x0[x1]) &&
(x4==(x1+1)))) &&
(\exists integer x14; ((((x4<=x14) &&
(x14<=x2)) &&
star_A(x0,x4,x14)) &&
(\exists integer x21; ((((x14<=x21) &&
(x21<=x2)) &&
(('B'==x0[x14]) &&
(x21==(x14+1)))) &&
(\exists integer x31; ((((x21<=x31) &&
(x31<=x2)) &&
star__orB_or_C_sCs_Bor_(x0,x21,x31)) &&
(\exists integer x38; ((((x31<=x38) &&
(x38<=x2)) &&
(('C'==x0[x31]) &&
(x38==(x31+1)))) &&
(\exists integer x48; ((((x38<=x48) &&
(x48<=x2)) &&
star_C(x0,x38,x48)) &&
(\exists integer x55; ((((x48<=x55) &&
(x55<=x2)) &&
(('D'==x0[x48]) &&
(x55==(x48+1)))) &&
(\exists integer x65; ((((x55<=x65) &&
(x65<=x2)) &&
star_D(x0,x55,x65)) &&
(x65==x2)))))))))))))))));*/
/*@ predicate re_1(char * x201, integer x202, integer x203) = (\exists integer x205; ((((x202<=x205) &&
(x205<=x203)) &&
star_A(x201,x202,x205)) &&
(\exists integer x211; ((((x205<=x211) &&
(x211<=x203)) &&
(('B'==x201[x205]) &&
(x211==(x205+1)))) &&
(\exists integer x221; ((((x211<=x221) &&
(x221<=x203)) &&
star__orB_or_C_sCs_Bor_(x201,x211,x221)) &&
(\exists integer x227; ((((x221<=x227) &&
(x227<=x203)) &&
(('C'==x201[x221]) &&
(x227==(x221+1)))) &&
(\exists integer x237; ((((x227<=x237) &&
(x237<=x203)) &&
star_C(x201,x227,x237)) &&
(\exists integer x243; ((((x237<=x243) &&
(x243<=x203)) &&
(('D'==x201[x237]) &&
(x243==(x237+1)))) &&
(\exists integer x253; ((((x243<=x253) &&
(x253<=x203)) &&
star_D(x201,x243,x253)) &&
(x253==x203)))))))))))))));*/
/*@ predicate re_2(char * x274, integer x275, integer x276) = (\exists integer x278; ((((x275<=x278) &&
(x278<=x276)) &&
star__orB_or_C_sCs_Bor_(x274,x275,x278)) &&
(\exists integer x284; ((((x278<=x284) &&
(x284<=x276)) &&
(('C'==x274[x278]) &&
(x284==(x278+1)))) &&
(\exists integer x294; ((((x284<=x294) &&
(x294<=x276)) &&
star_C(x274,x284,x294)) &&
(\exists integer x300; ((((x294<=x300) &&
(x300<=x276)) &&
(('D'==x274[x294]) &&
(x300==(x294+1)))) &&
(\exists integer x310; ((((x300<=x310) &&
(x310<=x276)) &&
star_D(x274,x300,x310)) &&
(x310==x276)))))))))));*/
/*@ predicate re_3(char * x327, integer x328, integer x329) = (\exists integer x331; ((((x328<=x331) &&
(x331<=x329)) &&
star_C(x327,x328,x331)) &&
(\exists integer x337; ((((x331<=x337) &&
(x337<=x329)) &&
(('D'==x327[x331]) &&
(x337==(x331+1)))) &&
(\exists integer x347; ((((x337<=x347) &&
(x347<=x329)) &&
star_D(x327,x337,x347)) &&
(x347==x329)))))));*/
/*@ predicate re_4(char * x360, integer x361, integer x362) = (\exists integer x364; ((((x361<=x364) &&
(x364<=x362)) &&
star_D(x360,x361,x364)) &&
(x364==x362)));*/
/*@ predicate re_bwd_0(char * x373, integer x374, integer x375) = (x374==x375);*/
/*@ predicate re_bwd_1(char * x378, integer x379, integer x380) = (\exists integer x382; ((((x379<=x382) &&
(x382<=x380)) &&
(('A'==x378[x379]) &&
(x382==(x379+1)))) &&
(\exists integer x392; ((((x382<=x392) &&
(x392<=x380)) &&
star_A(x378,x382,x392)) &&
(x392==x380)))));*/
/*@ predicate re_bwd_2(char * x403, integer x404, integer x405) = (\exists integer x407; ((((x404<=x407) &&
(x407<=x405)) &&
(('A'==x403[x404]) &&
(x407==(x404+1)))) &&
(\exists integer x417; ((((x407<=x417) &&
(x417<=x405)) &&
star_A(x403,x407,x417)) &&
(\exists integer x423; ((((x417<=x423) &&
(x423<=x405)) &&
(('B'==x403[x417]) &&
(x423==(x417+1)))) &&
(\exists integer x433; ((((x423<=x433) &&
(x433<=x405)) &&
star__orB_or_C_sCs_Bor_(x403,x423,x433)) &&
(x433==x405)))))))));*/
/*@ predicate re_bwd_3(char * x448, integer x449, integer x450) = (\exists integer x452; ((((x449<=x452) &&
(x452<=x450)) &&
(('A'==x448[x449]) &&
(x452==(x449+1)))) &&
(\exists integer x462; ((((x452<=x462) &&
(x462<=x450)) &&
star_A(x448,x452,x462)) &&
(\exists integer x468; ((((x462<=x468) &&
(x468<=x450)) &&
(('B'==x448[x462]) &&
(x468==(x462+1)))) &&
(\exists integer x478; ((((x468<=x478) &&
(x478<=x450)) &&
star__orB_or_C_sCs_Bor_(x448,x468,x478)) &&
(\exists integer x484; ((((x478<=x484) &&
(x484<=x450)) &&
(('C'==x448[x478]) &&
(x484==(x478+1)))) &&
(\exists integer x494; ((((x484<=x494) &&
(x494<=x450)) &&
star_C(x448,x484,x494)) &&
(x494==x450)))))))))))));*/
/*@ predicate re_bwd_4(char * x513, integer x514, integer x515) = (\exists integer x517; ((((x514<=x517) &&
(x517<=x515)) &&
(('A'==x513[x514]) &&
(x517==(x514+1)))) &&
(\exists integer x527; ((((x517<=x527) &&
(x527<=x515)) &&
star_A(x513,x517,x527)) &&
(\exists integer x533; ((((x527<=x533) &&
(x533<=x515)) &&
(('B'==x513[x527]) &&
(x533==(x527+1)))) &&
(\exists integer x543; ((((x533<=x543) &&
(x543<=x515)) &&
star__orB_or_C_sCs_Bor_(x513,x533,x543)) &&
(\exists integer x549; ((((x543<=x549) &&
(x549<=x515)) &&
(('C'==x513[x543]) &&
(x549==(x543+1)))) &&
(\exists integer x559; ((((x549<=x559) &&
(x559<=x515)) &&
star_C(x513,x549,x559)) &&
(\exists integer x565; ((((x559<=x565) &&
(x565<=x515)) &&
(('D'==x513[x559]) &&
(x565==(x559+1)))) &&
(\exists integer x575; ((((x565<=x575) &&
(x575<=x515)) &&
star_D(x513,x565,x575)) &&
(x575==x515)))))))))))))))));*/
/*@ predicate star_starting_D(char * x719, integer x720, integer x721) = ((((x720==x721) || (('D'==x719[x720]) &&
(x721>=(x720+1)))) || (\exists integer x730; (((x720<x730) &&
(x730<=x721)) ==> ((('D'==x719[x720]) &&
(x730==(x720+1))) &&
star_starting_D(x719,x730,x721))))) || (x721>=x720));*/
/*@ predicate star_starting_A(char * x745, integer x746, integer x747) = ((((x746==x747) || (('A'==x745[x746]) &&
(x747>=(x746+1)))) || (\exists integer x756; (((x746<x756) &&
(x756<=x747)) ==> ((('A'==x745[x746]) &&
(x756==(x746+1))) &&
star_starting_A(x745,x756,x747))))) || (x747>=x746));*/
/*@ predicate star_starting_C(char * x771, integer x772, integer x773) = ((((x772==x773) || (('C'==x771[x772]) &&
(x773>=(x772+1)))) || (\exists integer x782; (((x772<x782) &&
(x782<=x773)) ==> ((('C'==x771[x772]) &&
(x782==(x772+1))) &&
star_starting_C(x771,x782,x773))))) || (x773>=x772));*/
/*@ predicate star_starting__orB_or_C_sCs_Bor_(char * x797, integer x798, integer x799) = (((((x798==x799) || (('B'==x797[x798]) &&
(x799>=(x798+1)))) || (((x798==x799) || (('C'==x797[x798]) &&
(x799>=(x798+1)))) || (\exists integer x811; ((((x798<=x811) &&
(x811<=x799)) &&
(('C'==x797[x798]) &&
(x811==(x798+1)))) &&
(star_starting_C(x797,x811,x799) || (\exists integer x819; ((((x811<=x819) &&
(x819<=x799)) &&
star_C(x797,x811,x819)) &&
((x819==x799) || (('B'==x797[x819]) &&
(x799>=(x819+1))))))))))) || (\exists integer x839; (((x798<x839) &&
(x839<=x799)) ==> (((('B'==x797[x798]) &&
(x839==(x798+1))) || (\exists integer x845; ((((x798<=x845) &&
(x845<=x839)) &&
(('C'==x797[x798]) &&
(x845==(x798+1)))) &&
(\exists integer x852; ((((x845<=x852) &&
(x852<=x839)) &&
star_C(x797,x845,x852)) &&
(('B'==x797[x852]) &&
(x839==(x852+1)))))))) &&
star_starting__orB_or_C_sCs_Bor_(x797,x839,x799))))) || (x799>=x798));*/
/*@ predicate re0(char * x598, integer x599, integer x600) = (((x599==x600) || (('A'==x598[x599]) &&
(x600>=(x599+1)))) || (\exists integer x609; ((((x599<=x609) &&
(x609<=x600)) &&
(('A'==x598[x599]) &&
(x609==(x599+1)))) &&
(star_starting_A(x598,x609,x600) || (\exists integer x617; ((((x609<=x617) &&
(x617<=x600)) &&
star_A(x598,x609,x617)) &&
(((x617==x600) || (('B'==x598[x617]) &&
(x600>=(x617+1)))) || (\exists integer x630; ((((x617<=x630) &&
(x630<=x600)) &&
(('B'==x598[x617]) &&
(x630==(x617+1)))) &&
(star_starting__orB_or_C_sCs_Bor_(x598,x630,x600) || (\exists integer x638; ((((x630<=x638) &&
(x638<=x600)) &&
star__orB_or_C_sCs_Bor_(x598,x630,x638)) &&
(((x638==x600) || (('C'==x598[x638]) &&
(x600>=(x638+1)))) || (\exists integer x651; ((((x638<=x651) &&
(x651<=x600)) &&
(('C'==x598[x638]) &&
(x651==(x638+1)))) &&
(star_starting_C(x598,x651,x600) || (\exists integer x659; ((((x651<=x659) &&
(x659<=x600)) &&
star_C(x598,x651,x659)) &&
(((x659==x600) || (('D'==x598[x659]) &&
(x600>=(x659+1)))) || (\exists integer x672; ((((x659<=x672) &&
(x672<=x600)) &&
(('D'==x598[x659]) &&
(x672==(x659+1)))) &&
(star_starting_D(x598,x672,x600) || (\exists integer x680; ((((x672<=x680) &&
(x680<=x600)) &&
star_D(x598,x672,x680)) &&
(x600>=x680)))))))))))))))))))))))));*/
/*@
requires (((strlen(x877)>=0) &&
\valid(x877+(0..strlen(x877)))) &&
(strlen(x877)<=INT_MAX));
assigns \nothing;
ensures (\result ==> re_0(x877,0,strlen(x877)));
*/
int dfa(char * x877) {
int x879 = 1/*true*/;
int x880 = 0;
//@ ghost int x881 = 0;
char *x882 = x877;
/*@
loop invariant (((((((((strlen(x877)>=0) &&
\valid(x877+(0..strlen(x877)))) &&
((0<=x881) &&
(x881<=strlen(x877)))) &&
(x882==(x877+x881))) &&
((strlen((x877+x881))>=0) &&
\valid((x877+x881)+(0..strlen((x877+x881)))))) &&
(x879 ==> (((x880==4) ==> re_bwd_4(x877,0,x881)) &&
(((x880==3) ==> re_bwd_3(x877,0,x881)) &&
(((x880==2) ==> re_bwd_2(x877,0,x881)) &&
(((x880==1) ==> re_bwd_1(x877,0,x881)) &&
((x880==0) ==> re_bwd_0(x877,0,x881)))))))) &&
(x879 ==> re0(x877,0,x881))) &&
((x880==4) ==> (re_bwd_4(x877,0,x881) ==> re_0(x877,0,x881)))) &&
((x880==4) || ((x880==3) || ((x880==2) || ((x880==1) || (x880==0))))));
loop assigns x882, x881, x880, x879;
loop variant strlen(x882);
*/
for (;;) {
char *x884 = x882;
char x885 = x884[0];
int x886 = x885 == '\0';
int x890;
if (x886) {
x890 = 0/*false*/;
} else {
int x888 = x879;
x890 = x888;
}
if (!x890) break;
/*@assert (x879 ==> (((x880==4) ==> re_bwd_4(x877,0,x881)) &&
(((x880==3) ==> re_bwd_3(x877,0,x881)) &&
(((x880==2) ==> re_bwd_2(x877,0,x881)) &&
(((x880==1) ==> re_bwd_1(x877,0,x881)) &&
((x880==0) ==> re_bwd_0(x877,0,x881)))))));*/
/*@assert (((x880==4) ==> re_bwd_4(x877,0,x881)) &&
(((x880==3) ==> re_bwd_3(x877,0,x881)) &&
(((x880==2) ==> re_bwd_2(x877,0,x881)) &&
(((x880==1) ==> re_bwd_1(x877,0,x881)) &&
((x880==0) ==> re_bwd_0(x877,0,x881))))));*/
char *x942 = x882;
int x944 = x880;
int x945 = x944 == 4;
int x1160;
if (x945) {
char x943 = x942[0];
int x946 = 'D' == x943;
int x967;
if (x946) {
/*@assert re_bwd_4(x877,0,(x881+1));*/
x880 = 4;
/*@assert re_bwd_4(x877,0,(x881+1));*/
/*@assert ((x880==4) ==> re_bwd_4(x877,0,(x881+1)));*/
x967 = 1/*true*/;
} else {
x967 = 0/*false*/;
}
x1160 = x967;
} else {
int x969 = x944 == 3;
int x1158;
if (x969) {
char x943 = x942[0];
int x946 = 'D' == x943;
int x1036;
if (x946) {
/*@assert re_bwd_4(x877,0,(x881+1));*/
x880 = 4;
/*@assert re_bwd_4(x877,0,(x881+1));*/
/*@assert ((x880==4) ==> re_bwd_4(x877,0,(x881+1)));*/
x1036 = 1/*true*/;
} else {
int x990 = 'C' == x943;
int x1034;
if (x990) {
/*@assert re_bwd_3(x877,0,(x881+1));*/
x880 = 3;
/*@assert re_bwd_3(x877,0,(x881+1));*/
/*@assert ((x880==3) ==> re_bwd_3(x877,0,(x881+1)));*/
x1034 = 1/*true*/;
} else {
int x1011 = 'B' == x943;
int x1032;
if (x1011) {
/*@assert re_bwd_2(x877,0,(x881+1));*/
x880 = 2;
/*@assert re_bwd_2(x877,0,(x881+1));*/
/*@assert ((x880==2) ==> re_bwd_2(x877,0,(x881+1)));*/
x1032 = 1/*true*/;
} else {
x1032 = 0/*false*/;
}
x1034 = x1032;
}
x1036 = x1034;
}
x1158 = x1036;
} else {
int x1038 = x944 == 2;
int x1156;
if (x1038) {
char x943 = x942[0];
int x990 = 'C' == x943;
int x1081;
if (x990) {
/*@assert re_bwd_3(x877,0,(x881+1));*/
x880 = 3;
/*@assert re_bwd_3(x877,0,(x881+1));*/
/*@assert ((x880==3) ==> re_bwd_3(x877,0,(x881+1)));*/
x1081 = 1/*true*/;
} else {
int x1011 = 'B' == x943;
int x1079;
if (x1011) {
/*@assert re_bwd_2(x877,0,(x881+1));*/
x880 = 2;
/*@assert re_bwd_2(x877,0,(x881+1));*/
/*@assert ((x880==2) ==> re_bwd_2(x877,0,(x881+1)));*/
x1079 = 1/*true*/;
} else {
x1079 = 0/*false*/;
}
x1081 = x1079;
}
x1156 = x1081;
} else {
int x1083 = x944 == 1;
int x1154;
if (x1083) {
char x943 = x942[0];
int x1011 = 'B' == x943;
int x1127;
if (x1011) {
/*@assert re_bwd_2(x877,0,(x881+1));*/
x880 = 2;
/*@assert re_bwd_2(x877,0,(x881+1));*/
/*@assert ((x880==2) ==> re_bwd_2(x877,0,(x881+1)));*/
x1127 = 1/*true*/;
} else {
int x1104 = 'A' == x943;
int x1125;
if (x1104) {
/*@assert re_bwd_1(x877,0,(x881+1));*/
x880 = 1;
/*@assert re_bwd_1(x877,0,(x881+1));*/
/*@assert ((x880==1) ==> re_bwd_1(x877,0,(x881+1)));*/
x1125 = 1/*true*/;
} else {
x1125 = 0/*false*/;
}
x1127 = x1125;
}
x1154 = x1127;
} else {
int x1129 = x944 == 0;
int x1152;
if (x1129) {
char x943 = x942[0];
int x1104 = 'A' == x943;
int x1150;
if (x1104) {
/*@assert re_bwd_1(x877,0,(x881+1));*/
x880 = 1;
/*@assert re_bwd_1(x877,0,(x881+1));*/
/*@assert ((x880==1) ==> re_bwd_1(x877,0,(x881+1)));*/
x1150 = 1/*true*/;
} else {
x1150 = 0/*false*/;
}
x1152 = x1150;
} else {
x1152 = 0/*false*/;
}
x1154 = x1152;
}
x1156 = x1154;
}
x1158 = x1156;
}
x1160 = x1158;
}
x879 = x1160;
/*@assert (x879 ==> (((x880==4) ==> re_bwd_4(x877,0,(x881+1))) &&
(((x880==3) ==> re_bwd_3(x877,0,(x881+1))) &&
(((x880==2) ==> re_bwd_2(x877,0,(x881+1))) &&
(((x880==1) ==> re_bwd_1(x877,0,(x881+1))) &&
((x880==0) ==> re_bwd_0(x877,0,(x881+1))))))));*/
//@ ghost int x1189 = x881;
//@ ghost int x1190 = x1189 + 1;
//@ ghost x881 = x1190;
char *x1192 = x942+1;
x882 = x1192;
/*@assert (x879 ==> (((x880==4) ==> re_bwd_4(x877,0,x881)) &&
(((x880==3) ==> re_bwd_3(x877,0,x881)) &&
(((x880==2) ==> re_bwd_2(x877,0,x881)) &&
(((x880==1) ==> re_bwd_1(x877,0,x881)) &&
((x880==0) ==> re_bwd_0(x877,0,x881)))))));*/
}
int x1312 = x880;
char *x1313 = x882;
char x1314 = x1313[0];
int x1315 = x1314 == '\0';
int x1318;
if (x1315) {
int x1316 = x879;
x1318 = x1316;
} else {
x1318 = 0/*false*/;
}
int x1320;
if (x1318) {
int x1319 = 4 == x1312;
x1320 = x1319;
} else {
x1320 = 0/*false*/;
}
return x1320;
}
|
#include <limits.h>
#include <string.h>
/*@ predicate star_A(char * x93, integer x94, integer x95) = ((x94==x95) || (\exists integer x98; (((x94<x98) &&
(x98<=x95)) ==> ((('A'==x93[x94]) &&
(x98==(x94+1))) &&
star_A(x93,x98,x95)))));*/
/*@ predicate star_D(char * x114, integer x115, integer x116) = ((x115==x116) || (\exists integer x119; (((x115<x119) &&
(x119<=x116)) ==> ((('D'==x114[x115]) &&
(x119==(x115+1))) &&
star_D(x114,x119,x116)))));*/
/*@ predicate star_C(char * x135, integer x136, integer x137) = ((x136==x137) || (\exists integer x140; (((x136<x140) &&
(x140<=x137)) ==> ((('C'==x135[x136]) &&
(x140==(x136+1))) &&
star_C(x135,x140,x137)))));*/
/*@ predicate star__orB_or_C_sCs_Bor_(char * x156, integer x157, integer x158) = ((x157==x158) || (\exists integer x161; (((x157<x161) &&
(x161<=x158)) ==> (((('B'==x156[x157]) &&
(x161==(x157+1))) || (\exists integer x170; ((((x157<=x170) &&
(x170<=x161)) &&
(('C'==x156[x157]) &&
(x170==(x157+1)))) &&
(\exists integer x178; ((((x170<=x178) &&
(x178<=x161)) &&
star_C(x156,x170,x178)) &&
(('B'==x156[x178]) &&
(x161==(x178+1)))))))) &&
star__orB_or_C_sCs_Bor_(x156,x161,x158)))));*/
/*@ predicate re_0(char * x0, integer x1, integer x2) = (\exists integer x4; ((((x1<=x4) &&
(x4<=x2)) &&
(('A'==x0[x1]) &&
(x4==(x1+1)))) &&
(\exists integer x14; ((((x4<=x14) &&
(x14<=x2)) &&
star_A(x0,x4,x14)) &&
(\exists integer x21; ((((x14<=x21) &&
(x21<=x2)) &&
(('B'==x0[x14]) &&
(x21==(x14+1)))) &&
(\exists integer x31; ((((x21<=x31) &&
(x31<=x2)) &&
star__orB_or_C_sCs_Bor_(x0,x21,x31)) &&
(\exists integer x38; ((((x31<=x38) &&
(x38<=x2)) &&
(('C'==x0[x31]) &&
(x38==(x31+1)))) &&
(\exists integer x48; ((((x38<=x48) &&
(x48<=x2)) &&
star_C(x0,x38,x48)) &&
(\exists integer x55; ((((x48<=x55) &&
(x55<=x2)) &&
(('D'==x0[x48]) &&
(x55==(x48+1)))) &&
(\exists integer x65; ((((x55<=x65) &&
(x65<=x2)) &&
star_D(x0,x55,x65)) &&
(x65==x2)))))))))))))))));*/
/*@ predicate re_1(char * x201, integer x202, integer x203) = (\exists integer x205; ((((x202<=x205) &&
(x205<=x203)) &&
star_A(x201,x202,x205)) &&
(\exists integer x211; ((((x205<=x211) &&
(x211<=x203)) &&
(('B'==x201[x205]) &&
(x211==(x205+1)))) &&
(\exists integer x221; ((((x211<=x221) &&
(x221<=x203)) &&
star__orB_or_C_sCs_Bor_(x201,x211,x221)) &&
(\exists integer x227; ((((x221<=x227) &&
(x227<=x203)) &&
(('C'==x201[x221]) &&
(x227==(x221+1)))) &&
(\exists integer x237; ((((x227<=x237) &&
(x237<=x203)) &&
star_C(x201,x227,x237)) &&
(\exists integer x243; ((((x237<=x243) &&
(x243<=x203)) &&
(('D'==x201[x237]) &&
(x243==(x237+1)))) &&
(\exists integer x253; ((((x243<=x253) &&
(x253<=x203)) &&
star_D(x201,x243,x253)) &&
(x253==x203)))))))))))))));*/
/*@ predicate re_2(char * x274, integer x275, integer x276) = (\exists integer x278; ((((x275<=x278) &&
(x278<=x276)) &&
star__orB_or_C_sCs_Bor_(x274,x275,x278)) &&
(\exists integer x284; ((((x278<=x284) &&
(x284<=x276)) &&
(('C'==x274[x278]) &&
(x284==(x278+1)))) &&
(\exists integer x294; ((((x284<=x294) &&
(x294<=x276)) &&
star_C(x274,x284,x294)) &&
(\exists integer x300; ((((x294<=x300) &&
(x300<=x276)) &&
(('D'==x274[x294]) &&
(x300==(x294+1)))) &&
(\exists integer x310; ((((x300<=x310) &&
(x310<=x276)) &&
star_D(x274,x300,x310)) &&
(x310==x276)))))))))));*/
/*@ predicate re_3(char * x327, integer x328, integer x329) = (\exists integer x331; ((((x328<=x331) &&
(x331<=x329)) &&
star_C(x327,x328,x331)) &&
(\exists integer x337; ((((x331<=x337) &&
(x337<=x329)) &&
(('D'==x327[x331]) &&
(x337==(x331+1)))) &&
(\exists integer x347; ((((x337<=x347) &&
(x347<=x329)) &&
star_D(x327,x337,x347)) &&
(x347==x329)))))));*/
/*@ predicate re_4(char * x360, integer x361, integer x362) = (\exists integer x364; ((((x361<=x364) &&
(x364<=x362)) &&
star_D(x360,x361,x364)) &&
(x364==x362)));*/
/*@ predicate re_bwd_0(char * x373, integer x374, integer x375) = (x374==x375);*/
/*@ predicate re_bwd_1(char * x378, integer x379, integer x380) = (\exists integer x382; ((((x379<=x382) &&
(x382<=x380)) &&
(('A'==x378[x379]) &&
(x382==(x379+1)))) &&
(\exists integer x392; ((((x382<=x392) &&
(x392<=x380)) &&
star_A(x378,x382,x392)) &&
(x392==x380)))));*/
/*@ predicate re_bwd_2(char * x403, integer x404, integer x405) = (\exists integer x407; ((((x404<=x407) &&
(x407<=x405)) &&
(('A'==x403[x404]) &&
(x407==(x404+1)))) &&
(\exists integer x417; ((((x407<=x417) &&
(x417<=x405)) &&
star_A(x403,x407,x417)) &&
(\exists integer x423; ((((x417<=x423) &&
(x423<=x405)) &&
(('B'==x403[x417]) &&
(x423==(x417+1)))) &&
(\exists integer x433; ((((x423<=x433) &&
(x433<=x405)) &&
star__orB_or_C_sCs_Bor_(x403,x423,x433)) &&
(x433==x405)))))))));*/
/*@ predicate re_bwd_3(char * x448, integer x449, integer x450) = (\exists integer x452; ((((x449<=x452) &&
(x452<=x450)) &&
(('A'==x448[x449]) &&
(x452==(x449+1)))) &&
(\exists integer x462; ((((x452<=x462) &&
(x462<=x450)) &&
star_A(x448,x452,x462)) &&
(\exists integer x468; ((((x462<=x468) &&
(x468<=x450)) &&
(('B'==x448[x462]) &&
(x468==(x462+1)))) &&
(\exists integer x478; ((((x468<=x478) &&
(x478<=x450)) &&
star__orB_or_C_sCs_Bor_(x448,x468,x478)) &&
(\exists integer x484; ((((x478<=x484) &&
(x484<=x450)) &&
(('C'==x448[x478]) &&
(x484==(x478+1)))) &&
(\exists integer x494; ((((x484<=x494) &&
(x494<=x450)) &&
star_C(x448,x484,x494)) &&
(x494==x450)))))))))))));*/
/*@ predicate re_bwd_4(char * x513, integer x514, integer x515) = (\exists integer x517; ((((x514<=x517) &&
(x517<=x515)) &&
(('A'==x513[x514]) &&
(x517==(x514+1)))) &&
(\exists integer x527; ((((x517<=x527) &&
(x527<=x515)) &&
star_A(x513,x517,x527)) &&
(\exists integer x533; ((((x527<=x533) &&
(x533<=x515)) &&
(('B'==x513[x527]) &&
(x533==(x527+1)))) &&
(\exists integer x543; ((((x533<=x543) &&
(x543<=x515)) &&
star__orB_or_C_sCs_Bor_(x513,x533,x543)) &&
(\exists integer x549; ((((x543<=x549) &&
(x549<=x515)) &&
(('C'==x513[x543]) &&
(x549==(x543+1)))) &&
(\exists integer x559; ((((x549<=x559) &&
(x559<=x515)) &&
star_C(x513,x549,x559)) &&
(\exists integer x565; ((((x559<=x565) &&
(x565<=x515)) &&
(('D'==x513[x559]) &&
(x565==(x559+1)))) &&
(\exists integer x575; ((((x565<=x575) &&
(x575<=x515)) &&
star_D(x513,x565,x575)) &&
(x575==x515)))))))))))))))));*/
/*@ predicate star_starting_D(char * x719, integer x720, integer x721) = ((((x720==x721) || (('D'==x719[x720]) &&
(x721>=(x720+1)))) || (\exists integer x730; (((x720<x730) &&
(x730<=x721)) ==> ((('D'==x719[x720]) &&
(x730==(x720+1))) &&
star_starting_D(x719,x730,x721))))) || (x721>=x720));*/
/*@ predicate star_starting_A(char * x745, integer x746, integer x747) = ((((x746==x747) || (('A'==x745[x746]) &&
(x747>=(x746+1)))) || (\exists integer x756; (((x746<x756) &&
(x756<=x747)) ==> ((('A'==x745[x746]) &&
(x756==(x746+1))) &&
star_starting_A(x745,x756,x747))))) || (x747>=x746));*/
/*@ predicate star_starting_C(char * x771, integer x772, integer x773) = ((((x772==x773) || (('C'==x771[x772]) &&
(x773>=(x772+1)))) || (\exists integer x782; (((x772<x782) &&
(x782<=x773)) ==> ((('C'==x771[x772]) &&
(x782==(x772+1))) &&
star_starting_C(x771,x782,x773))))) || (x773>=x772));*/
/*@ predicate star_starting__orB_or_C_sCs_Bor_(char * x797, integer x798, integer x799) = (((((x798==x799) || (('B'==x797[x798]) &&
(x799>=(x798+1)))) || (((x798==x799) || (('C'==x797[x798]) &&
(x799>=(x798+1)))) || (\exists integer x811; ((((x798<=x811) &&
(x811<=x799)) &&
(('C'==x797[x798]) &&
(x811==(x798+1)))) &&
(star_starting_C(x797,x811,x799) || (\exists integer x819; ((((x811<=x819) &&
(x819<=x799)) &&
star_C(x797,x811,x819)) &&
((x819==x799) || (('B'==x797[x819]) &&
(x799>=(x819+1))))))))))) || (\exists integer x839; (((x798<x839) &&
(x839<=x799)) ==> (((('B'==x797[x798]) &&
(x839==(x798+1))) || (\exists integer x845; ((((x798<=x845) &&
(x845<=x839)) &&
(('C'==x797[x798]) &&
(x845==(x798+1)))) &&
(\exists integer x852; ((((x845<=x852) &&
(x852<=x839)) &&
star_C(x797,x845,x852)) &&
(('B'==x797[x852]) &&
(x839==(x852+1)))))))) &&
star_starting__orB_or_C_sCs_Bor_(x797,x839,x799))))) || (x799>=x798));*/
/*@ predicate re0(char * x598, integer x599, integer x600) = (((x599==x600) || (('A'==x598[x599]) &&
(x600>=(x599+1)))) || (\exists integer x609; ((((x599<=x609) &&
(x609<=x600)) &&
(('A'==x598[x599]) &&
(x609==(x599+1)))) &&
(star_starting_A(x598,x609,x600) || (\exists integer x617; ((((x609<=x617) &&
(x617<=x600)) &&
star_A(x598,x609,x617)) &&
(((x617==x600) || (('B'==x598[x617]) &&
(x600>=(x617+1)))) || (\exists integer x630; ((((x617<=x630) &&
(x630<=x600)) &&
(('B'==x598[x617]) &&
(x630==(x617+1)))) &&
(star_starting__orB_or_C_sCs_Bor_(x598,x630,x600) || (\exists integer x638; ((((x630<=x638) &&
(x638<=x600)) &&
star__orB_or_C_sCs_Bor_(x598,x630,x638)) &&
(((x638==x600) || (('C'==x598[x638]) &&
(x600>=(x638+1)))) || (\exists integer x651; ((((x638<=x651) &&
(x651<=x600)) &&
(('C'==x598[x638]) &&
(x651==(x638+1)))) &&
(star_starting_C(x598,x651,x600) || (\exists integer x659; ((((x651<=x659) &&
(x659<=x600)) &&
star_C(x598,x651,x659)) &&
(((x659==x600) || (('D'==x598[x659]) &&
(x600>=(x659+1)))) || (\exists integer x672; ((((x659<=x672) &&
(x672<=x600)) &&
(('D'==x598[x659]) &&
(x672==(x659+1)))) &&
(star_starting_D(x598,x672,x600) || (\exists integer x680; ((((x672<=x680) &&
(x680<=x600)) &&
star_D(x598,x672,x680)) &&
(x600>=x680)))))))))))))))))))))))));*/
/*@
requires (((strlen(x877)>=0) &&
\valid(x877+(0..strlen(x877)))) &&
(strlen(x877)<=INT_MAX));
assigns \nothing;
ensures (\result ==> re_0(x877,0,strlen(x877)));
*/
|
int dfa(char * x877) {
int x879 = 1/*true*/;
int x880 = 0;
//@ ghost int x881 = 0;
char *x882 = x877;
/*@
loop invariant (((((((((strlen(x877)>=0) &&
\valid(x877+(0..strlen(x877)))) &&
((0<=x881) &&
(x881<=strlen(x877)))) &&
(x882==(x877+x881))) &&
((strlen((x877+x881))>=0) &&
\valid((x877+x881)+(0..strlen((x877+x881)))))) &&
(x879 ==> (((x880==4) ==> re_bwd_4(x877,0,x881)) &&
(((x880==3) ==> re_bwd_3(x877,0,x881)) &&
(((x880==2) ==> re_bwd_2(x877,0,x881)) &&
(((x880==1) ==> re_bwd_1(x877,0,x881)) &&
((x880==0) ==> re_bwd_0(x877,0,x881)))))))) &&
(x879 ==> re0(x877,0,x881))) &&
((x880==4) ==> (re_bwd_4(x877,0,x881) ==> re_0(x877,0,x881)))) &&
((x880==4) || ((x880==3) || ((x880==2) || ((x880==1) || (x880==0))))));
loop assigns x882, x881, x880, x879;
loop variant strlen(x882);
*/
for (;;) {
char *x884 = x882;
char x885 = x884[0];
int x886 = x885 == '\0';
int x890;
if (x886) {
x890 = 0/*false*/;
} else {
int x888 = x879;
x890 = x888;
}
if (!x890) break;
/*@assert (x879 ==> (((x880==4) ==> re_bwd_4(x877,0,x881)) &&
(((x880==3) ==> re_bwd_3(x877,0,x881)) &&
(((x880==2) ==> re_bwd_2(x877,0,x881)) &&
(((x880==1) ==> re_bwd_1(x877,0,x881)) &&
((x880==0) ==> re_bwd_0(x877,0,x881)))))));*/
/*@assert (((x880==4) ==> re_bwd_4(x877,0,x881)) &&
(((x880==3) ==> re_bwd_3(x877,0,x881)) &&
(((x880==2) ==> re_bwd_2(x877,0,x881)) &&
(((x880==1) ==> re_bwd_1(x877,0,x881)) &&
((x880==0) ==> re_bwd_0(x877,0,x881))))));*/
char *x942 = x882;
int x944 = x880;
int x945 = x944 == 4;
int x1160;
if (x945) {
char x943 = x942[0];
int x946 = 'D' == x943;
int x967;
if (x946) {
/*@assert re_bwd_4(x877,0,(x881+1));*/
x880 = 4;
/*@assert re_bwd_4(x877,0,(x881+1));*/
/*@assert ((x880==4) ==> re_bwd_4(x877,0,(x881+1)));*/
x967 = 1/*true*/;
} else {
x967 = 0/*false*/;
}
x1160 = x967;
} else {
int x969 = x944 == 3;
int x1158;
if (x969) {
char x943 = x942[0];
int x946 = 'D' == x943;
int x1036;
if (x946) {
/*@assert re_bwd_4(x877,0,(x881+1));*/
x880 = 4;
/*@assert re_bwd_4(x877,0,(x881+1));*/
/*@assert ((x880==4) ==> re_bwd_4(x877,0,(x881+1)));*/
x1036 = 1/*true*/;
} else {
int x990 = 'C' == x943;
int x1034;
if (x990) {
/*@assert re_bwd_3(x877,0,(x881+1));*/
x880 = 3;
/*@assert re_bwd_3(x877,0,(x881+1));*/
/*@assert ((x880==3) ==> re_bwd_3(x877,0,(x881+1)));*/
x1034 = 1/*true*/;
} else {
int x1011 = 'B' == x943;
int x1032;
if (x1011) {
/*@assert re_bwd_2(x877,0,(x881+1));*/
x880 = 2;
/*@assert re_bwd_2(x877,0,(x881+1));*/
/*@assert ((x880==2) ==> re_bwd_2(x877,0,(x881+1)));*/
x1032 = 1/*true*/;
} else {
x1032 = 0/*false*/;
}
x1034 = x1032;
}
x1036 = x1034;
}
x1158 = x1036;
} else {
int x1038 = x944 == 2;
int x1156;
if (x1038) {
char x943 = x942[0];
int x990 = 'C' == x943;
int x1081;
if (x990) {
/*@assert re_bwd_3(x877,0,(x881+1));*/
x880 = 3;
/*@assert re_bwd_3(x877,0,(x881+1));*/
/*@assert ((x880==3) ==> re_bwd_3(x877,0,(x881+1)));*/
x1081 = 1/*true*/;
} else {
int x1011 = 'B' == x943;
int x1079;
if (x1011) {
/*@assert re_bwd_2(x877,0,(x881+1));*/
x880 = 2;
/*@assert re_bwd_2(x877,0,(x881+1));*/
/*@assert ((x880==2) ==> re_bwd_2(x877,0,(x881+1)));*/
x1079 = 1/*true*/;
} else {
x1079 = 0/*false*/;
}
x1081 = x1079;
}
x1156 = x1081;
} else {
int x1083 = x944 == 1;
int x1154;
if (x1083) {
char x943 = x942[0];
int x1011 = 'B' == x943;
int x1127;
if (x1011) {
/*@assert re_bwd_2(x877,0,(x881+1));*/
x880 = 2;
/*@assert re_bwd_2(x877,0,(x881+1));*/
/*@assert ((x880==2) ==> re_bwd_2(x877,0,(x881+1)));*/
x1127 = 1/*true*/;
} else {
int x1104 = 'A' == x943;
int x1125;
if (x1104) {
/*@assert re_bwd_1(x877,0,(x881+1));*/
x880 = 1;
/*@assert re_bwd_1(x877,0,(x881+1));*/
/*@assert ((x880==1) ==> re_bwd_1(x877,0,(x881+1)));*/
x1125 = 1/*true*/;
} else {
x1125 = 0/*false*/;
}
x1127 = x1125;
}
x1154 = x1127;
} else {
int x1129 = x944 == 0;
int x1152;
if (x1129) {
char x943 = x942[0];
int x1104 = 'A' == x943;
int x1150;
if (x1104) {
/*@assert re_bwd_1(x877,0,(x881+1));*/
x880 = 1;
/*@assert re_bwd_1(x877,0,(x881+1));*/
/*@assert ((x880==1) ==> re_bwd_1(x877,0,(x881+1)));*/
x1150 = 1/*true*/;
} else {
x1150 = 0/*false*/;
}
x1152 = x1150;
} else {
x1152 = 0/*false*/;
}
x1154 = x1152;
}
x1156 = x1154;
}
x1158 = x1156;
}
x1160 = x1158;
}
x879 = x1160;
/*@assert (x879 ==> (((x880==4) ==> re_bwd_4(x877,0,(x881+1))) &&
(((x880==3) ==> re_bwd_3(x877,0,(x881+1))) &&
(((x880==2) ==> re_bwd_2(x877,0,(x881+1))) &&
(((x880==1) ==> re_bwd_1(x877,0,(x881+1))) &&
((x880==0) ==> re_bwd_0(x877,0,(x881+1))))))));*/
//@ ghost int x1189 = x881;
//@ ghost int x1190 = x1189 + 1;
//@ ghost x881 = x1190;
char *x1192 = x942+1;
x882 = x1192;
/*@assert (x879 ==> (((x880==4) ==> re_bwd_4(x877,0,x881)) &&
(((x880==3) ==> re_bwd_3(x877,0,x881)) &&
(((x880==2) ==> re_bwd_2(x877,0,x881)) &&
(((x880==1) ==> re_bwd_1(x877,0,x881)) &&
((x880==0) ==> re_bwd_0(x877,0,x881)))))));*/
}
int x1312 = x880;
char *x1313 = x882;
char x1314 = x1313[0];
int x1315 = x1314 == '\0';
int x1318;
if (x1315) {
int x1316 = x879;
x1318 = x1316;
} else {
x1318 = 0/*false*/;
}
int x1320;
if (x1318) {
int x1319 = 4 == x1312;
x1320 = x1319;
} else {
x1320 = 0/*false*/;
}
return x1320;
}
| true | 84 | 84 |
int dfa(char * x877) {
int x879 = 1/*true*/;
int x880 = 0;
//@ ghost int x881 = 0;
char *x882 = x877;
/*@
loop invariant (((((((((strlen(x877)>=0) &&
\valid(x877+(0..strlen(x877)))) &&
((0<=x881) &&
(x881<=strlen(x877)))) &&
(x882==(x877+x881))) &&
((strlen((x877+x881))>=0) &&
\valid((x877+x881)+(0..strlen((x877+x881)))))) &&
(x879 ==> (((x880==4) ==> re_bwd_4(x877,0,x881)) &&
(((x880==3) ==> re_bwd_3(x877,0,x881)) &&
(((x880==2) ==> re_bwd_2(x877,0,x881)) &&
(((x880==1) ==> re_bwd_1(x877,0,x881)) &&
((x880==0) ==> re_bwd_0(x877,0,x881)))))))) &&
(x879 ==> re0(x877,0,x881))) &&
((x880==4) ==> (re_bwd_4(x877,0,x881) ==> re_0(x877,0,x881)))) &&
((x880==4) || ((x880==3) || ((x880==2) || ((x880==1) || (x880==0))))));
loop assigns x882, x881, x880, x879;
loop variant strlen(x882);
*/
for (;;) {
char *x884 = x882;
char x885 = x884[0];
int x886 = x885 == '\0';
int x890;
if (x886) {
x890 = 0/*false*/;
} else {
int x888 = x879;
x890 = x888;
}
if (!x890) break;
/*@assert (x879 ==> (((x880==4) ==> re_bwd_4(x877,0,x881)) &&
(((x880==3) ==> re_bwd_3(x877,0,x881)) &&
(((x880==2) ==> re_bwd_2(x877,0,x881)) &&
(((x880==1) ==> re_bwd_1(x877,0,x881)) &&
((x880==0) ==> re_bwd_0(x877,0,x881)))))));*/
/*@assert (((x880==4) ==> re_bwd_4(x877,0,x881)) &&
(((x880==3) ==> re_bwd_3(x877,0,x881)) &&
(((x880==2) ==> re_bwd_2(x877,0,x881)) &&
(((x880==1) ==> re_bwd_1(x877,0,x881)) &&
((x880==0) ==> re_bwd_0(x877,0,x881))))));*/
char *x942 = x882;
int x944 = x880;
int x945 = x944 == 4;
int x1160;
if (x945) {
char x943 = x942[0];
int x946 = 'D' == x943;
int x967;
if (x946) {
/*@assert re_bwd_4(x877,0,(x881+1));*/
x880 = 4;
/*@assert re_bwd_4(x877,0,(x881+1));*/
/*@assert ((x880==4) ==> re_bwd_4(x877,0,(x881+1)));*/
x967 = 1/*true*/;
} else {
x967 = 0/*false*/;
}
x1160 = x967;
} else {
int x969 = x944 == 3;
int x1158;
if (x969) {
char x943 = x942[0];
int x946 = 'D' == x943;
int x1036;
if (x946) {
/*@assert re_bwd_4(x877,0,(x881+1));*/
x880 = 4;
/*@assert re_bwd_4(x877,0,(x881+1));*/
/*@assert ((x880==4) ==> re_bwd_4(x877,0,(x881+1)));*/
x1036 = 1/*true*/;
} else {
int x990 = 'C' == x943;
int x1034;
if (x990) {
/*@assert re_bwd_3(x877,0,(x881+1));*/
x880 = 3;
/*@assert re_bwd_3(x877,0,(x881+1));*/
/*@assert ((x880==3) ==> re_bwd_3(x877,0,(x881+1)));*/
x1034 = 1/*true*/;
} else {
int x1011 = 'B' == x943;
int x1032;
if (x1011) {
/*@assert re_bwd_2(x877,0,(x881+1));*/
x880 = 2;
/*@assert re_bwd_2(x877,0,(x881+1));*/
/*@assert ((x880==2) ==> re_bwd_2(x877,0,(x881+1)));*/
x1032 = 1/*true*/;
} else {
x1032 = 0/*false*/;
}
x1034 = x1032;
}
x1036 = x1034;
}
x1158 = x1036;
} else {
int x1038 = x944 == 2;
int x1156;
if (x1038) {
char x943 = x942[0];
int x990 = 'C' == x943;
int x1081;
if (x990) {
/*@assert re_bwd_3(x877,0,(x881+1));*/
x880 = 3;
/*@assert re_bwd_3(x877,0,(x881+1));*/
/*@assert ((x880==3) ==> re_bwd_3(x877,0,(x881+1)));*/
x1081 = 1/*true*/;
} else {
int x1011 = 'B' == x943;
int x1079;
if (x1011) {
/*@assert re_bwd_2(x877,0,(x881+1));*/
x880 = 2;
/*@assert re_bwd_2(x877,0,(x881+1));*/
/*@assert ((x880==2) ==> re_bwd_2(x877,0,(x881+1)));*/
x1079 = 1/*true*/;
} else {
x1079 = 0/*false*/;
}
x1081 = x1079;
}
x1156 = x1081;
} else {
int x1083 = x944 == 1;
int x1154;
if (x1083) {
char x943 = x942[0];
int x1011 = 'B' == x943;
int x1127;
if (x1011) {
/*@assert re_bwd_2(x877,0,(x881+1));*/
x880 = 2;
/*@assert re_bwd_2(x877,0,(x881+1));*/
/*@assert ((x880==2) ==> re_bwd_2(x877,0,(x881+1)));*/
x1127 = 1/*true*/;
} else {
int x1104 = 'A' == x943;
int x1125;
if (x1104) {
/*@assert re_bwd_1(x877,0,(x881+1));*/
x880 = 1;
/*@assert re_bwd_1(x877,0,(x881+1));*/
/*@assert ((x880==1) ==> re_bwd_1(x877,0,(x881+1)));*/
x1125 = 1/*true*/;
} else {
x1125 = 0/*false*/;
}
x1127 = x1125;
}
x1154 = x1127;
} else {
int x1129 = x944 == 0;
int x1152;
if (x1129) {
char x943 = x942[0];
int x1104 = 'A' == x943;
int x1150;
if (x1104) {
/*@assert re_bwd_1(x877,0,(x881+1));*/
x880 = 1;
/*@assert re_bwd_1(x877,0,(x881+1));*/
/*@assert ((x880==1) ==> re_bwd_1(x877,0,(x881+1)));*/
x1150 = 1/*true*/;
} else {
x1150 = 0/*false*/;
}
x1152 = x1150;
} else {
x1152 = 0/*false*/;
}
x1154 = x1152;
}
x1156 = x1154;
}
x1158 = x1156;
}
x1160 = x1158;
}
x879 = x1160;
/*@assert (x879 ==> (((x880==4) ==> re_bwd_4(x877,0,(x881+1))) &&
(((x880==3) ==> re_bwd_3(x877,0,(x881+1))) &&
(((x880==2) ==> re_bwd_2(x877,0,(x881+1))) &&
(((x880==1) ==> re_bwd_1(x877,0,(x881+1))) &&
((x880==0) ==> re_bwd_0(x877,0,(x881+1))))))));*/
//@ ghost int x1189 = x881;
//@ ghost int x1190 = x1189 + 1;
//@ ghost x881 = x1190;
char *x1192 = x942+1;
x882 = x1192;
/*@assert (x879 ==> (((x880==4) ==> re_bwd_4(x877,0,x881)) &&
(((x880==3) ==> re_bwd_3(x877,0,x881)) &&
(((x880==2) ==> re_bwd_2(x877,0,x881)) &&
(((x880==1) ==> re_bwd_1(x877,0,x881)) &&
((x880==0) ==> re_bwd_0(x877,0,x881)))))));*/
}
int x1312 = x880;
char *x1313 = x882;
char x1314 = x1313[0];
int x1315 = x1314 == '\0';
int x1318;
if (x1315) {
int x1316 = x879;
x1318 = x1316;
} else {
x1318 = 0/*false*/;
}
int x1320;
if (x1318) {
int x1319 = 4 == x1312;
x1320 = x1319;
} else {
x1320 = 0/*false*/;
}
return x1320;
}
|
#include <limits.h>
#include <string.h>
/*@ predicate star_A(char * x93, integer x94, integer x95) = ((x94==x95) || (\exists integer x98; (((x94<x98) &&
(x98<=x95)) ==> ((('A'==x93[x94]) &&
(x98==(x94+1))) &&
star_A(x93,x98,x95)))));*/
/*@ predicate star_D(char * x114, integer x115, integer x116) = ((x115==x116) || (\exists integer x119; (((x115<x119) &&
(x119<=x116)) ==> ((('D'==x114[x115]) &&
(x119==(x115+1))) &&
star_D(x114,x119,x116)))));*/
/*@ predicate star_C(char * x135, integer x136, integer x137) = ((x136==x137) || (\exists integer x140; (((x136<x140) &&
(x140<=x137)) ==> ((('C'==x135[x136]) &&
(x140==(x136+1))) &&
star_C(x135,x140,x137)))));*/
/*@ predicate star__orB_or_C_sCs_Bor_(char * x156, integer x157, integer x158) = ((x157==x158) || (\exists integer x161; (((x157<x161) &&
(x161<=x158)) ==> (((('B'==x156[x157]) &&
(x161==(x157+1))) || (\exists integer x170; ((((x157<=x170) &&
(x170<=x161)) &&
(('C'==x156[x157]) &&
(x170==(x157+1)))) &&
(\exists integer x178; ((((x170<=x178) &&
(x178<=x161)) &&
star_C(x156,x170,x178)) &&
(('B'==x156[x178]) &&
(x161==(x178+1)))))))) &&
star__orB_or_C_sCs_Bor_(x156,x161,x158)))));*/
/*@ predicate re_0(char * x0, integer x1, integer x2) = (\exists integer x4; ((((x1<=x4) &&
(x4<=x2)) &&
(('A'==x0[x1]) &&
(x4==(x1+1)))) &&
(\exists integer x14; ((((x4<=x14) &&
(x14<=x2)) &&
star_A(x0,x4,x14)) &&
(\exists integer x21; ((((x14<=x21) &&
(x21<=x2)) &&
(('B'==x0[x14]) &&
(x21==(x14+1)))) &&
(\exists integer x31; ((((x21<=x31) &&
(x31<=x2)) &&
star__orB_or_C_sCs_Bor_(x0,x21,x31)) &&
(\exists integer x38; ((((x31<=x38) &&
(x38<=x2)) &&
(('C'==x0[x31]) &&
(x38==(x31+1)))) &&
(\exists integer x48; ((((x38<=x48) &&
(x48<=x2)) &&
star_C(x0,x38,x48)) &&
(\exists integer x55; ((((x48<=x55) &&
(x55<=x2)) &&
(('D'==x0[x48]) &&
(x55==(x48+1)))) &&
(\exists integer x65; ((((x55<=x65) &&
(x65<=x2)) &&
star_D(x0,x55,x65)) &&
(x65==x2)))))))))))))))));*/
/*@ predicate re_1(char * x201, integer x202, integer x203) = (\exists integer x205; ((((x202<=x205) &&
(x205<=x203)) &&
star_A(x201,x202,x205)) &&
(\exists integer x211; ((((x205<=x211) &&
(x211<=x203)) &&
(('B'==x201[x205]) &&
(x211==(x205+1)))) &&
(\exists integer x221; ((((x211<=x221) &&
(x221<=x203)) &&
star__orB_or_C_sCs_Bor_(x201,x211,x221)) &&
(\exists integer x227; ((((x221<=x227) &&
(x227<=x203)) &&
(('C'==x201[x221]) &&
(x227==(x221+1)))) &&
(\exists integer x237; ((((x227<=x237) &&
(x237<=x203)) &&
star_C(x201,x227,x237)) &&
(\exists integer x243; ((((x237<=x243) &&
(x243<=x203)) &&
(('D'==x201[x237]) &&
(x243==(x237+1)))) &&
(\exists integer x253; ((((x243<=x253) &&
(x253<=x203)) &&
star_D(x201,x243,x253)) &&
(x253==x203)))))))))))))));*/
/*@ predicate re_2(char * x274, integer x275, integer x276) = (\exists integer x278; ((((x275<=x278) &&
(x278<=x276)) &&
star__orB_or_C_sCs_Bor_(x274,x275,x278)) &&
(\exists integer x284; ((((x278<=x284) &&
(x284<=x276)) &&
(('C'==x274[x278]) &&
(x284==(x278+1)))) &&
(\exists integer x294; ((((x284<=x294) &&
(x294<=x276)) &&
star_C(x274,x284,x294)) &&
(\exists integer x300; ((((x294<=x300) &&
(x300<=x276)) &&
(('D'==x274[x294]) &&
(x300==(x294+1)))) &&
(\exists integer x310; ((((x300<=x310) &&
(x310<=x276)) &&
star_D(x274,x300,x310)) &&
(x310==x276)))))))))));*/
/*@ predicate re_3(char * x327, integer x328, integer x329) = (\exists integer x331; ((((x328<=x331) &&
(x331<=x329)) &&
star_C(x327,x328,x331)) &&
(\exists integer x337; ((((x331<=x337) &&
(x337<=x329)) &&
(('D'==x327[x331]) &&
(x337==(x331+1)))) &&
(\exists integer x347; ((((x337<=x347) &&
(x347<=x329)) &&
star_D(x327,x337,x347)) &&
(x347==x329)))))));*/
/*@ predicate re_4(char * x360, integer x361, integer x362) = (\exists integer x364; ((((x361<=x364) &&
(x364<=x362)) &&
star_D(x360,x361,x364)) &&
(x364==x362)));*/
/*@ predicate re_bwd_0(char * x373, integer x374, integer x375) = (x374==x375);*/
/*@ predicate re_bwd_1(char * x378, integer x379, integer x380) = (\exists integer x382; ((((x379<=x382) &&
(x382<=x380)) &&
(('A'==x378[x379]) &&
(x382==(x379+1)))) &&
(\exists integer x392; ((((x382<=x392) &&
(x392<=x380)) &&
star_A(x378,x382,x392)) &&
(x392==x380)))));*/
/*@ predicate re_bwd_2(char * x403, integer x404, integer x405) = (\exists integer x407; ((((x404<=x407) &&
(x407<=x405)) &&
(('A'==x403[x404]) &&
(x407==(x404+1)))) &&
(\exists integer x417; ((((x407<=x417) &&
(x417<=x405)) &&
star_A(x403,x407,x417)) &&
(\exists integer x423; ((((x417<=x423) &&
(x423<=x405)) &&
(('B'==x403[x417]) &&
(x423==(x417+1)))) &&
(\exists integer x433; ((((x423<=x433) &&
(x433<=x405)) &&
star__orB_or_C_sCs_Bor_(x403,x423,x433)) &&
(x433==x405)))))))));*/
/*@ predicate re_bwd_3(char * x448, integer x449, integer x450) = (\exists integer x452; ((((x449<=x452) &&
(x452<=x450)) &&
(('A'==x448[x449]) &&
(x452==(x449+1)))) &&
(\exists integer x462; ((((x452<=x462) &&
(x462<=x450)) &&
star_A(x448,x452,x462)) &&
(\exists integer x468; ((((x462<=x468) &&
(x468<=x450)) &&
(('B'==x448[x462]) &&
(x468==(x462+1)))) &&
(\exists integer x478; ((((x468<=x478) &&
(x478<=x450)) &&
star__orB_or_C_sCs_Bor_(x448,x468,x478)) &&
(\exists integer x484; ((((x478<=x484) &&
(x484<=x450)) &&
(('C'==x448[x478]) &&
(x484==(x478+1)))) &&
(\exists integer x494; ((((x484<=x494) &&
(x494<=x450)) &&
star_C(x448,x484,x494)) &&
(x494==x450)))))))))))));*/
/*@ predicate re_bwd_4(char * x513, integer x514, integer x515) = (\exists integer x517; ((((x514<=x517) &&
(x517<=x515)) &&
(('A'==x513[x514]) &&
(x517==(x514+1)))) &&
(\exists integer x527; ((((x517<=x527) &&
(x527<=x515)) &&
star_A(x513,x517,x527)) &&
(\exists integer x533; ((((x527<=x533) &&
(x533<=x515)) &&
(('B'==x513[x527]) &&
(x533==(x527+1)))) &&
(\exists integer x543; ((((x533<=x543) &&
(x543<=x515)) &&
star__orB_or_C_sCs_Bor_(x513,x533,x543)) &&
(\exists integer x549; ((((x543<=x549) &&
(x549<=x515)) &&
(('C'==x513[x543]) &&
(x549==(x543+1)))) &&
(\exists integer x559; ((((x549<=x559) &&
(x559<=x515)) &&
star_C(x513,x549,x559)) &&
(\exists integer x565; ((((x559<=x565) &&
(x565<=x515)) &&
(('D'==x513[x559]) &&
(x565==(x559+1)))) &&
(\exists integer x575; ((((x565<=x575) &&
(x575<=x515)) &&
star_D(x513,x565,x575)) &&
(x575==x515)))))))))))))))));*/
/*@ predicate star_starting_D(char * x719, integer x720, integer x721) = ((((x720==x721) || (('D'==x719[x720]) &&
(x721>=(x720+1)))) || (\exists integer x730; (((x720<x730) &&
(x730<=x721)) ==> ((('D'==x719[x720]) &&
(x730==(x720+1))) &&
star_starting_D(x719,x730,x721))))) || (x721>=x720));*/
/*@ predicate star_starting_A(char * x745, integer x746, integer x747) = ((((x746==x747) || (('A'==x745[x746]) &&
(x747>=(x746+1)))) || (\exists integer x756; (((x746<x756) &&
(x756<=x747)) ==> ((('A'==x745[x746]) &&
(x756==(x746+1))) &&
star_starting_A(x745,x756,x747))))) || (x747>=x746));*/
/*@ predicate star_starting_C(char * x771, integer x772, integer x773) = ((((x772==x773) || (('C'==x771[x772]) &&
(x773>=(x772+1)))) || (\exists integer x782; (((x772<x782) &&
(x782<=x773)) ==> ((('C'==x771[x772]) &&
(x782==(x772+1))) &&
star_starting_C(x771,x782,x773))))) || (x773>=x772));*/
/*@ predicate star_starting__orB_or_C_sCs_Bor_(char * x797, integer x798, integer x799) = (((((x798==x799) || (('B'==x797[x798]) &&
(x799>=(x798+1)))) || (((x798==x799) || (('C'==x797[x798]) &&
(x799>=(x798+1)))) || (\exists integer x811; ((((x798<=x811) &&
(x811<=x799)) &&
(('C'==x797[x798]) &&
(x811==(x798+1)))) &&
(star_starting_C(x797,x811,x799) || (\exists integer x819; ((((x811<=x819) &&
(x819<=x799)) &&
star_C(x797,x811,x819)) &&
((x819==x799) || (('B'==x797[x819]) &&
(x799>=(x819+1))))))))))) || (\exists integer x839; (((x798<x839) &&
(x839<=x799)) ==> (((('B'==x797[x798]) &&
(x839==(x798+1))) || (\exists integer x845; ((((x798<=x845) &&
(x845<=x839)) &&
(('C'==x797[x798]) &&
(x845==(x798+1)))) &&
(\exists integer x852; ((((x845<=x852) &&
(x852<=x839)) &&
star_C(x797,x845,x852)) &&
(('B'==x797[x852]) &&
(x839==(x852+1)))))))) &&
star_starting__orB_or_C_sCs_Bor_(x797,x839,x799))))) || (x799>=x798));*/
/*@ predicate re0(char * x598, integer x599, integer x600) = (((x599==x600) || (('A'==x598[x599]) &&
(x600>=(x599+1)))) || (\exists integer x609; ((((x599<=x609) &&
(x609<=x600)) &&
(('A'==x598[x599]) &&
(x609==(x599+1)))) &&
(star_starting_A(x598,x609,x600) || (\exists integer x617; ((((x609<=x617) &&
(x617<=x600)) &&
star_A(x598,x609,x617)) &&
(((x617==x600) || (('B'==x598[x617]) &&
(x600>=(x617+1)))) || (\exists integer x630; ((((x617<=x630) &&
(x630<=x600)) &&
(('B'==x598[x617]) &&
(x630==(x617+1)))) &&
(star_starting__orB_or_C_sCs_Bor_(x598,x630,x600) || (\exists integer x638; ((((x630<=x638) &&
(x638<=x600)) &&
star__orB_or_C_sCs_Bor_(x598,x630,x638)) &&
(((x638==x600) || (('C'==x598[x638]) &&
(x600>=(x638+1)))) || (\exists integer x651; ((((x638<=x651) &&
(x651<=x600)) &&
(('C'==x598[x638]) &&
(x651==(x638+1)))) &&
(star_starting_C(x598,x651,x600) || (\exists integer x659; ((((x651<=x659) &&
(x659<=x600)) &&
star_C(x598,x651,x659)) &&
(((x659==x600) || (('D'==x598[x659]) &&
(x600>=(x659+1)))) || (\exists integer x672; ((((x659<=x672) &&
(x672<=x600)) &&
(('D'==x598[x659]) &&
(x672==(x659+1)))) &&
(star_starting_D(x598,x672,x600) || (\exists integer x680; ((((x672<=x680) &&
(x680<=x600)) &&
star_D(x598,x672,x680)) &&
(x600>=x680)))))))))))))))))))))))));*/
/*@
requires (((strlen(x877)>=0) &&
\valid(x877+(0..strlen(x877)))) &&
(strlen(x877)<=INT_MAX));
assigns \nothing;
ensures (\result ==> re_0(x877,0,strlen(x877)));
*/
|
|
frama_c_files_v2/test_frama_c_2778.c
|
/*@ axiomatic abs {
@ logic int abs(int x);
@ axiom pos: \forall int x; x >= 0 ==> abs(x) == x;
@ axiom neg: \forall int x; x <= 0 ==> abs(x) == -x;
@ }
*/
/*@ ensures \result == abs(x);
@ assigns \nothing;
*/
int abs(int x);
/*@ ensures (\result == x || \result == y)
@ && \result >= x && \result >= y;
@ assigns \nothing;
*/
int max(int x, int y);
/*@ ensures \result >= 0;
@ assigns \nothing;
*/
int max_abs(int x, int y) {
x = abs(x);
y = abs(y);
return max(x, y);
}
|
/*@ axiomatic abs {
@ logic int abs(int x);
@ axiom pos: \forall int x; x >= 0 ==> abs(x) == x;
@ axiom neg: \forall int x; x <= 0 ==> abs(x) == -x;
@ }
*/
/*@ ensures \result == abs(x);
@ assigns \nothing;
*/
int abs(int x);
/*@ ensures (\result == x || \result == y)
@ && \result >= x && \result >= y;
@ assigns \nothing;
*/
int max(int x, int y);
/*@ ensures \result >= 0;
@ assigns \nothing;
*/
|
int max_abs(int x, int y) {
x = abs(x);
y = abs(y);
return max(x, y);
}
| true | 10 | 10 |
int max_abs(int x, int y) {
x = abs(x);
y = abs(y);
return max(x, y);
}
|
/*@ axiomatic abs {
@ logic int abs(int x);
@ axiom pos: \forall int x; x >= 0 ==> abs(x) == x;
@ axiom neg: \forall int x; x <= 0 ==> abs(x) == -x;
@ }
*/
/*@ ensures \result == abs(x);
@ assigns \nothing;
*/
int abs(int x);
/*@ ensures (\result == x || \result == y)
@ && \result >= x && \result >= y;
@ assigns \nothing;
*/
int max(int x, int y);
/*@ ensures \result >= 0;
@ assigns \nothing;
*/
|
|
frama_c_files_v2/test_frama_c_2336.c
|
#include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate inv_vec_vec_Int(int * * x16, int * x17, int x18) = (((x18==0) || ((x18>0) &&
(\valid(x16+(0..x18-1)) &&
\valid(x17+(0..x18-1))))) &&
(\forall int x28; (0<=x28<x18) ==> ((x17[x28]==0) || ((x17[x28]>0) &&
\valid(x16[x28]+(0..x17[x28]-1))))));*/
/*@
requires inv_vec_vec_Int(x66,x67,x68);
assigns \nothing;
ensures inv_vec_vec_Int(x66,x67,x68);
*/
int count_pos(int * * x66, int * x67, int x68) {
int x70 = 0;
/*@
loop invariant 0<=x72<=x68;
loop invariant ((0<=x70) &&
(x70<=x72));
loop assigns x72, x70;
loop variant x68-x72;
*/
for(int x72=0; x72 < x68; x72++) {
int x75 = x70;
int x81 = 0;
int x74 = x67[x72];
int *x73 = x66[x72];
/*@
loop invariant 0<=x83<=x74;
loop invariant ((0<=x81) &&
(x81<=x83));
loop assigns x83, x81;
loop variant x74-x83;
*/
for(int x83=0; x83 < x74; x83++) {
int x85 = x81;
int x84 = x73[x83];
int x91 = x84 > 0;
int x92;
if (x91) {
x92 = 1;
} else {
x92 = 0;
}
int x93 = x85 + x92;
x81 = x93;
}
int x97 = x81;
int x98 = x97 > 0;
int x99;
if (x98) {
x99 = 1;
} else {
x99 = 0;
}
int x100 = x75 + x99;
x70 = x100;
}
int x104 = x70;
return x104;
}
|
#include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate inv_vec_vec_Int(int * * x16, int * x17, int x18) = (((x18==0) || ((x18>0) &&
(\valid(x16+(0..x18-1)) &&
\valid(x17+(0..x18-1))))) &&
(\forall int x28; (0<=x28<x18) ==> ((x17[x28]==0) || ((x17[x28]>0) &&
\valid(x16[x28]+(0..x17[x28]-1))))));*/
/*@
requires inv_vec_vec_Int(x66,x67,x68);
assigns \nothing;
ensures inv_vec_vec_Int(x66,x67,x68);
*/
|
int count_pos(int * * x66, int * x67, int x68) {
int x70 = 0;
/*@
loop invariant 0<=x72<=x68;
loop invariant ((0<=x70) &&
(x70<=x72));
loop assigns x72, x70;
loop variant x68-x72;
*/
for(int x72=0; x72 < x68; x72++) {
int x75 = x70;
int x81 = 0;
int x74 = x67[x72];
int *x73 = x66[x72];
/*@
loop invariant 0<=x83<=x74;
loop invariant ((0<=x81) &&
(x81<=x83));
loop assigns x83, x81;
loop variant x74-x83;
*/
for(int x83=0; x83 < x74; x83++) {
int x85 = x81;
int x84 = x73[x83];
int x91 = x84 > 0;
int x92;
if (x91) {
x92 = 1;
} else {
x92 = 0;
}
int x93 = x85 + x92;
x81 = x93;
}
int x97 = x81;
int x98 = x97 > 0;
int x99;
if (x98) {
x99 = 1;
} else {
x99 = 0;
}
int x100 = x75 + x99;
x70 = x100;
}
int x104 = x70;
return x104;
}
| true | 32 | 32 |
int count_pos(int * * x66, int * x67, int x68) {
int x70 = 0;
/*@
loop invariant 0<=x72<=x68;
loop invariant ((0<=x70) &&
(x70<=x72));
loop assigns x72, x70;
loop variant x68-x72;
*/
for(int x72=0; x72 < x68; x72++) {
int x75 = x70;
int x81 = 0;
int x74 = x67[x72];
int *x73 = x66[x72];
/*@
loop invariant 0<=x83<=x74;
loop invariant ((0<=x81) &&
(x81<=x83));
loop assigns x83, x81;
loop variant x74-x83;
*/
for(int x83=0; x83 < x74; x83++) {
int x85 = x81;
int x84 = x73[x83];
int x91 = x84 > 0;
int x92;
if (x91) {
x92 = 1;
} else {
x92 = 0;
}
int x93 = x85 + x92;
x81 = x93;
}
int x97 = x81;
int x98 = x97 > 0;
int x99;
if (x98) {
x99 = 1;
} else {
x99 = 0;
}
int x100 = x75 + x99;
x70 = x100;
}
int x104 = x70;
return x104;
}
|
#include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate inv_vec_vec_Int(int * * x16, int * x17, int x18) = (((x18==0) || ((x18>0) &&
(\valid(x16+(0..x18-1)) &&
\valid(x17+(0..x18-1))))) &&
(\forall int x28; (0<=x28<x18) ==> ((x17[x28]==0) || ((x17[x28]>0) &&
\valid(x16[x28]+(0..x17[x28]-1))))));*/
/*@
requires inv_vec_vec_Int(x66,x67,x68);
assigns \nothing;
ensures inv_vec_vec_Int(x66,x67,x68);
*/
|
|
frama_c_files_v2/test_frama_c_2333.c
|
/*@
requires \valid(q) && \valid(r);
requires 0<y<1000000000 && 0<=x<1000000000;
assigns *q, *r ;
*/
void div_rem(unsigned x,unsigned y,unsigned* q,unsigned* r){
*q = x / y ;
//@ assert *q==x/y;
*r = x % y ;
//@ assert *r==x%y;
}
|
/*@
requires \valid(q) && \valid(r);
requires 0<y<1000000000 && 0<=x<1000000000;
assigns *q, *r ;
*/
|
void div_rem(unsigned x,unsigned y,unsigned* q,unsigned* r){
*q = x / y ;
//@ assert *q==x/y;
*r = x % y ;
//@ assert *r==x%y;
}
| true | 10 | 10 |
void div_rem(unsigned x,unsigned y,unsigned* q,unsigned* r){
*q = x / y ;
//@ assert *q==x/y;
*r = x % y ;
//@ assert *r==x%y;
}
|
/*@
requires \valid(q) && \valid(r);
requires 0<y<1000000000 && 0<=x<1000000000;
assigns *q, *r ;
*/
|
|
frama_c_files_v2/test_frama_c_263.c
|
#include <limits.h>
/*@
requires x > INT_MIN;
ensures 0 <= x ==> \result == x;
ensures 0 > x ==> \result == -x;
*/
int abs_int(int x)
{
return (x >= 0) ? x : -x;
}
|
#include <limits.h>
/*@
requires x > INT_MIN;
ensures 0 <= x ==> \result == x;
ensures 0 > x ==> \result == -x;
*/
|
int abs_int(int x)
{
return (x >= 0) ? x : -x;
}
| true | 5 | 5 |
int abs_int(int x)
{
return (x >= 0) ? x : -x;
}
|
#include <limits.h>
/*@
requires x > INT_MIN;
ensures 0 <= x ==> \result == x;
ensures 0 > x ==> \result == -x;
*/
|
|
frama_c_files_v2/test_frama_c_1451.c
|
#define SPEC_INT_MIN -2147483648
#define SPEC_INT_MAX 2147483647
/*@ assigns \nothing;
ensures \result >= 0;
behavior positive:
assumes a > 0;
ensures \result == a;
behavior zero:
assumes a == 0;
ensures \result == 0;
ensures \result == a;
behavior negative:
assumes a < 0;
ensures \result == -a;
complete behaviors;
disjoint behaviors;
*/
long spec_abs1(int a)
{
long abs;
abs = a;
if (a < 0) {
abs = -abs;
}
return abs;
}
#ifdef OUT_OF_TASK
#include <stdio.h>
int main(void)
{
printf("res: %ld\n", spec_abs1(SPEC_INT_MIN + 1));
return 0;
}
#endif
|
#include <stdio.h>
/*@ assigns \nothing;
ensures \result >= 0;
behavior positive:
assumes a > 0;
ensures \result == a;
behavior zero:
assumes a == 0;
ensures \result == 0;
ensures \result == a;
behavior negative:
assumes a < 0;
ensures \result == -a;
complete behaviors;
disjoint behaviors;
*/
|
long spec_abs1(int a)
{
long abs;
abs = a;
if (a < 0) {
abs = -abs;
}
return abs;
}
| true | 12 | 12 |
long spec_abs1(int a)
{
long abs;
abs = a;
if (a < 0) {
abs = -abs;
}
return abs;
}
|
#include <stdio.h>
/*@ assigns \nothing;
ensures \result >= 0;
behavior positive:
assumes a > 0;
ensures \result == a;
behavior zero:
assumes a == 0;
ensures \result == 0;
ensures \result == a;
behavior negative:
assumes a < 0;
ensures \result == -a;
complete behaviors;
disjoint behaviors;
*/
|
|
frama_c_files_v2/test_frama_c_2483.c
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeDouble someDouble (double val) {
struct maybeDouble result = { true, val };
return result;
}
struct maybeBool {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeBool noneBool () {
struct maybeBool result = { false, false };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeBool someBool (bool val) {
struct maybeBool result = { true, val };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
|
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
| true | 4 | 4 |
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
|
|
frama_c_files_v2/test_frama_c_2483.c
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeDouble someDouble (double val) {
struct maybeDouble result = { true, val };
return result;
}
struct maybeBool {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeBool noneBool () {
struct maybeBool result = { false, false };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeBool someBool (bool val) {
struct maybeBool result = { true, val };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
|
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
| true | 9 | 9 |
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
|
|
frama_c_files_v2/test_frama_c_2483.c
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeDouble someDouble (double val) {
struct maybeDouble result = { true, val };
return result;
}
struct maybeBool {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeBool noneBool () {
struct maybeBool result = { false, false };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeBool someBool (bool val) {
struct maybeBool result = { true, val };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
|
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
| true | 13 | 13 |
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
|
|
frama_c_files_v2/test_frama_c_2483.c
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeDouble someDouble (double val) {
struct maybeDouble result = { true, val };
return result;
}
struct maybeBool {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeBool noneBool () {
struct maybeBool result = { false, false };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeBool someBool (bool val) {
struct maybeBool result = { true, val };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
|
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
| true | 18 | 18 |
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
|
|
frama_c_files_v2/test_frama_c_2483.c
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeDouble someDouble (double val) {
struct maybeDouble result = { true, val };
return result;
}
struct maybeBool {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeBool noneBool () {
struct maybeBool result = { false, false };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeBool someBool (bool val) {
struct maybeBool result = { true, val };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
|
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
| true | 22 | 22 |
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
|
|
frama_c_files_v2/test_frama_c_2483.c
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeDouble someDouble (double val) {
struct maybeDouble result = { true, val };
return result;
}
struct maybeBool {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeBool noneBool () {
struct maybeBool result = { false, false };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeBool someBool (bool val) {
struct maybeBool result = { true, val };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
|
struct maybeDouble someDouble (double val) {
struct maybeDouble result = { true, val };
return result;
}
| true | 27 | 27 |
struct maybeDouble someDouble (double val) {
struct maybeDouble result = { true, val };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
|
|
frama_c_files_v2/test_frama_c_2483.c
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeDouble someDouble (double val) {
struct maybeDouble result = { true, val };
return result;
}
struct maybeBool {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeBool noneBool () {
struct maybeBool result = { false, false };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeBool someBool (bool val) {
struct maybeBool result = { true, val };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeDouble someDouble (double val) {
struct maybeDouble result = { true, val };
return result;
}
struct maybeBool {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
|
struct maybeBool noneBool () {
struct maybeBool result = { false, false };
return result;
}
| true | 31 | 31 |
struct maybeBool noneBool () {
struct maybeBool result = { false, false };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeDouble someDouble (double val) {
struct maybeDouble result = { true, val };
return result;
}
struct maybeBool {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
|
|
frama_c_files_v2/test_frama_c_2483.c
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeDouble someDouble (double val) {
struct maybeDouble result = { true, val };
return result;
}
struct maybeBool {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeBool noneBool () {
struct maybeBool result = { false, false };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeBool someBool (bool val) {
struct maybeBool result = { true, val };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeDouble someDouble (double val) {
struct maybeDouble result = { true, val };
return result;
}
struct maybeBool {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeBool noneBool () {
struct maybeBool result = { false, false };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
|
struct maybeBool someBool (bool val) {
struct maybeBool result = { true, val };
return result;
}
| true | 36 | 36 |
struct maybeBool someBool (bool val) {
struct maybeBool result = { true, val };
return result;
}
|
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct maybeInt {
bool isValid;
int value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeInt none () {
struct maybeInt result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeInt some (int val) {
struct maybeInt result = { true, val };
return result;
}
struct maybeFloat {
bool isValid;
float value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeFloat noneFloat () {
struct maybeFloat result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeFloat someFloat (float val) {
struct maybeFloat result = { true, val };
return result;
}
struct maybeDouble {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeDouble noneDouble () {
struct maybeDouble result = { false, 0 };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
struct maybeDouble someDouble (double val) {
struct maybeDouble result = { true, val };
return result;
}
struct maybeBool {
bool isValid;
double value;
};
/*@ assigns \nothing;
ensures ! \result.isValid;
*/
struct maybeBool noneBool () {
struct maybeBool result = { false, false };
return result;
}
/*@ assigns \nothing;
ensures \result.isValid;
ensures \result.value == val;
*/
|
|
frama_c_files_v2/test_frama_c_2574.c
|
/*@ ensures \result <= sizeof(int); */
int f() { return sizeof(char); }
|
/*@ ensures \result <= sizeof(int); */
|
int f() { return sizeof(char); }
| true | 3 | 3 |
int f() { return sizeof(char); }
|
/*@ ensures \result <= sizeof(int); */
|
|
frama_c_files_v2/test_frama_c_419.c
|
/*
* memswap()
*
* Swaps the contents of two nonoverlapping memory areas.
* This really could be done faster...
*/
#include <string.h>
/*@
requires n >= 0;
requires \valid(((char*)m1)+(0..n-1));
requires \valid(((char*)m2)+(0..n-1));
requires \separated(((char*)m1)+(0..n-1), ((char*)m2)+(0..n-1));
assigns ((char*)m1)[0..n-1];
assigns ((char*)m2)[0..n-1];
ensures \forall integer i; 0 <= i < n ==> ((char*)m1)[i] == \old(((char*)m2)[i]);
ensures \forall integer i; 0 <= i < n ==> ((char*)m2)[i] == \old(((char*)m1)[i]);
@*/
void memswap(void *m1, void *m2, size_t n)
{
char *p = m1;
char *q = m2;
char tmp;
/*@
loop invariant \base_addr(p) == \base_addr(m1);
loop invariant \base_addr(q) == \base_addr(m2);
loop invariant 0 <= n <= \at(n, Pre);
loop invariant p == m1+(\at(n, Pre) - n);
loop invariant q == m2+(\at(n, Pre) - n);
loop invariant \forall integer i; 0 <= i < (\at(n, Pre) - n) ==> ((char*)m2)[i] == \at(((char*)m1)[i], Pre);
loop invariant \forall integer i; 0 <= i < (\at(n, Pre) - n) ==> ((char*)m1)[i] == \at(((char*)m2)[i], Pre);
loop invariant \forall integer i; (\at(n, Pre) - n) <= i < \at(n, Pre) ==> ((char*)m1)[i] == \at(((char*)m1)[i], Pre);
loop invariant \forall integer i; (\at(n, Pre) - n) <= i < \at(n, Pre) ==> ((char*)m2)[i] == \at(((char*)m2)[i], Pre);
loop assigns n, tmp, ((char*)m1)[0..(\at(n, Pre) - n - 1)], ((char*)m2)[0..(\at(n, Pre) - n - 1)], p, q;
loop variant n;
@*/
while (/*n--*/ n) {
tmp = *p;
*p = *q;
*q = tmp;
p++;
q++;
n--; // inserted code
}
}
|
#include <string.h>
/*@
requires n >= 0;
requires \valid(((char*)m1)+(0..n-1));
requires \valid(((char*)m2)+(0..n-1));
requires \separated(((char*)m1)+(0..n-1), ((char*)m2)+(0..n-1));
assigns ((char*)m1)[0..n-1];
assigns ((char*)m2)[0..n-1];
ensures \forall integer i; 0 <= i < n ==> ((char*)m1)[i] == \old(((char*)m2)[i]);
ensures \forall integer i; 0 <= i < n ==> ((char*)m2)[i] == \old(((char*)m1)[i]);
@*/
|
void memswap(void *m1, void *m2, size_t n)
{
char *p = m1;
char *q = m2;
char tmp;
/*@
loop invariant \base_addr(p) == \base_addr(m1);
loop invariant \base_addr(q) == \base_addr(m2);
loop invariant 0 <= n <= \at(n, Pre);
loop invariant p == m1+(\at(n, Pre) - n);
loop invariant q == m2+(\at(n, Pre) - n);
loop invariant \forall integer i; 0 <= i < (\at(n, Pre) - n) ==> ((char*)m2)[i] == \at(((char*)m1)[i], Pre);
loop invariant \forall integer i; 0 <= i < (\at(n, Pre) - n) ==> ((char*)m1)[i] == \at(((char*)m2)[i], Pre);
loop invariant \forall integer i; (\at(n, Pre) - n) <= i < \at(n, Pre) ==> ((char*)m1)[i] == \at(((char*)m1)[i], Pre);
loop invariant \forall integer i; (\at(n, Pre) - n) <= i < \at(n, Pre) ==> ((char*)m2)[i] == \at(((char*)m2)[i], Pre);
loop assigns n, tmp, ((char*)m1)[0..(\at(n, Pre) - n - 1)], ((char*)m2)[0..(\at(n, Pre) - n - 1)], p, q;
loop variant n;
@*/
while (/*n--*/ n) {
tmp = *p;
*p = *q;
*q = tmp;
p++;
q++;
n--; // inserted code
}
}
| true | 33 | 33 |
void memswap(void *m1, void *m2, size_t n)
{
char *p = m1;
char *q = m2;
char tmp;
/*@
loop invariant \base_addr(p) == \base_addr(m1);
loop invariant \base_addr(q) == \base_addr(m2);
loop invariant 0 <= n <= \at(n, Pre);
loop invariant p == m1+(\at(n, Pre) - n);
loop invariant q == m2+(\at(n, Pre) - n);
loop invariant \forall integer i; 0 <= i < (\at(n, Pre) - n) ==> ((char*)m2)[i] == \at(((char*)m1)[i], Pre);
loop invariant \forall integer i; 0 <= i < (\at(n, Pre) - n) ==> ((char*)m1)[i] == \at(((char*)m2)[i], Pre);
loop invariant \forall integer i; (\at(n, Pre) - n) <= i < \at(n, Pre) ==> ((char*)m1)[i] == \at(((char*)m1)[i], Pre);
loop invariant \forall integer i; (\at(n, Pre) - n) <= i < \at(n, Pre) ==> ((char*)m2)[i] == \at(((char*)m2)[i], Pre);
loop assigns n, tmp, ((char*)m1)[0..(\at(n, Pre) - n - 1)], ((char*)m2)[0..(\at(n, Pre) - n - 1)], p, q;
loop variant n;
@*/
while (/*n--*/ n) {
tmp = *p;
*p = *q;
*q = tmp;
p++;
q++;
n--; // inserted code
}
}
|
#include <string.h>
/*@
requires n >= 0;
requires \valid(((char*)m1)+(0..n-1));
requires \valid(((char*)m2)+(0..n-1));
requires \separated(((char*)m1)+(0..n-1), ((char*)m2)+(0..n-1));
assigns ((char*)m1)[0..n-1];
assigns ((char*)m2)[0..n-1];
ensures \forall integer i; 0 <= i < n ==> ((char*)m1)[i] == \old(((char*)m2)[i]);
ensures \forall integer i; 0 <= i < n ==> ((char*)m2)[i] == \old(((char*)m1)[i]);
@*/
|
|
frama_c_files_v2/test_frama_c_207.c
|
/*@ requires \valid(p+ (0..1));
ensures p[0] == \old(p[1]);
ensures p[1] == \old(p[0]);
assigns p[0], p[1];
*/
void array_swap(int* p) {
int tmp = p[0];
p[0] = p[1];
p[1] = tmp;
}
|
/*@ requires \valid(p+ (0..1));
ensures p[0] == \old(p[1]);
ensures p[1] == \old(p[0]);
assigns p[0], p[1];
*/
|
void array_swap(int* p) {
int tmp = p[0];
p[0] = p[1];
p[1] = tmp;
}
| true | 10 | 10 |
void array_swap(int* p) {
int tmp = p[0];
p[0] = p[1];
p[1] = tmp;
}
|
/*@ requires \valid(p+ (0..1));
ensures p[0] == \old(p[1]);
ensures p[1] == \old(p[0]);
assigns p[0], p[1];
*/
|
|
frama_c_files_v2/test_frama_c_420.c
|
#include <limits.h>
/*@ requires x > INT_MIN;
assigns \nothing;
behavior positive:
assumes x >= 0;
ensures \result == x;
behavior negative:
assumes x < 0;
ensures \result == -x;
complete behaviors;
disjoint behaviors;
*/
int abs(int x) {
if (x < 0)
return -x;
else if(x >= 0)
return x;
}
|
#include <limits.h>
/*@ requires x > INT_MIN;
assigns \nothing;
behavior positive:
assumes x >= 0;
ensures \result == x;
behavior negative:
assumes x < 0;
ensures \result == -x;
complete behaviors;
disjoint behaviors;
*/
|
int abs(int x) {
if (x < 0)
return -x;
else if(x >= 0)
return x;
}
| true | 11 | 11 |
int abs(int x) {
if (x < 0)
return -x;
else if(x >= 0)
return x;
}
|
#include <limits.h>
/*@ requires x > INT_MIN;
assigns \nothing;
behavior positive:
assumes x >= 0;
ensures \result == x;
behavior negative:
assumes x < 0;
ensures \result == -x;
complete behaviors;
disjoint behaviors;
*/
|
|
frama_c_files_v2/test_frama_c_175.c
|
/*
* @UBERXMHF_LICENSE_HEADER_START@
*
* uber eXtensible Micro-Hypervisor Framework (Raspberry Pi)
*
* Copyright 2018 Carnegie Mellon University. All Rights Reserved.
*
* NO WARRANTY. THIS CARNEGIE MELLON UNIVERSITY AND SOFTWARE ENGINEERING
* INSTITUTE MATERIAL IS FURNISHED ON AN "AS-IS" BASIS. CARNEGIE MELLON
* UNIVERSITY MAKES NO WARRANTIES OF ANY KIND, EITHER EXPRESSED OR IMPLIED,
* AS TO ANY MATTER INCLUDING, BUT NOT LIMITED TO, WARRANTY OF FITNESS FOR
* PURPOSE OR MERCHANTABILITY, EXCLUSIVITY, OR RESULTS OBTAINED FROM USE OF
* THE MATERIAL. CARNEGIE MELLON UNIVERSITY DOES NOT MAKE ANY WARRANTY OF
* ANY KIND WITH RESPECT TO FREEDOM FROM PATENT, TRADEMARK, OR COPYRIGHT
* INFRINGEMENT.
*
* Released under a BSD (SEI)-style license, please see LICENSE or
* contact [email protected] for full terms.
*
* [DISTRIBUTION STATEMENT A] This material has been approved for public
* release and unlimited distribution. Please see Copyright notice for
* non-US Government use and distribution.
*
* Carnegie Mellon is registered in the U.S. Patent and Trademark Office by
* Carnegie Mellon University.
*
* @UBERXMHF_LICENSE_HEADER_END@
*/
/*
* Author: Amit Vasudevan ([email protected])
*
*/
#include <stdint.h>
#include <string.h>
/*
u32 strnlen(const char * s, u32 count){
const char *sc;
for (sc = s; count-- && *sc != '\0'; ++sc);
return (u32)(sc - s);
}*/
/*@
requires maxlen >= 0;
requires \valid(s+(0..maxlen-1));
assigns \nothing;
behavior bigger:
assumes \forall integer i; 0 <= i < maxlen ==> s[i] != 0;
ensures \result == maxlen;
behavior smaller:
assumes \exists integer i; 0 <= i < maxlen && s[i] == 0;
ensures \result <= maxlen;
complete behaviors;
disjoint behaviors;
*/
size_t strnlen(const char *s, size_t maxlen)
{
const char *ss = s;
/* Important: the maxlen test must precede the reference through ss;
since the byte beyond the maximum may segfault */
/*@
loop invariant 0 <= maxlen <= \at(maxlen,Pre);
loop invariant \forall integer i; 0 <= i < (\at(maxlen, Pre) - maxlen) ==> s[i] != 0;
loop invariant ss == s+(\at(maxlen, Pre) - maxlen);
loop invariant s <= ss <= s+\at(maxlen, Pre);
loop assigns maxlen, ss;
loop variant maxlen;
*/
while ((maxlen > 0) && *ss) {
ss++;
maxlen--;
}
return ss - s;
}
|
#include <stdint.h>
#include <string.h>
/*@
requires maxlen >= 0;
requires \valid(s+(0..maxlen-1));
assigns \nothing;
behavior bigger:
assumes \forall integer i; 0 <= i < maxlen ==> s[i] != 0;
ensures \result == maxlen;
behavior smaller:
assumes \exists integer i; 0 <= i < maxlen && s[i] == 0;
ensures \result <= maxlen;
complete behaviors;
disjoint behaviors;
*/
|
size_t strnlen(const char *s, size_t maxlen)
{
const char *ss = s;
/* Important: the maxlen test must precede the reference through ss;
since the byte beyond the maximum may segfault */
/*@
loop invariant 0 <= maxlen <= \at(maxlen,Pre);
loop invariant \forall integer i; 0 <= i < (\at(maxlen, Pre) - maxlen) ==> s[i] != 0;
loop invariant ss == s+(\at(maxlen, Pre) - maxlen);
loop invariant s <= ss <= s+\at(maxlen, Pre);
loop assigns maxlen, ss;
loop variant maxlen;
*/
while ((maxlen > 0) && *ss) {
ss++;
maxlen--;
}
return ss - s;
}
| true | 21 | 21 |
size_t strnlen(const char *s, size_t maxlen)
{
const char *ss = s;
/* Important: the maxlen test must precede the reference through ss;
since the byte beyond the maximum may segfault */
/*@
loop invariant 0 <= maxlen <= \at(maxlen,Pre);
loop invariant \forall integer i; 0 <= i < (\at(maxlen, Pre) - maxlen) ==> s[i] != 0;
loop invariant ss == s+(\at(maxlen, Pre) - maxlen);
loop invariant s <= ss <= s+\at(maxlen, Pre);
loop assigns maxlen, ss;
loop variant maxlen;
*/
while ((maxlen > 0) && *ss) {
ss++;
maxlen--;
}
return ss - s;
}
|
#include <stdint.h>
#include <string.h>
/*@
requires maxlen >= 0;
requires \valid(s+(0..maxlen-1));
assigns \nothing;
behavior bigger:
assumes \forall integer i; 0 <= i < maxlen ==> s[i] != 0;
ensures \result == maxlen;
behavior smaller:
assumes \exists integer i; 0 <= i < maxlen && s[i] == 0;
ensures \result <= maxlen;
complete behaviors;
disjoint behaviors;
*/
|
|
frama_c_files_v2/test_frama_c_2001.c
|
#include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/
int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invariant ((x5[0]=='\0') ==> (strlen(x0)==x4));
loop invariant ((!(x5[0]=='\0')) ==> (strlen(x0)!=x4));
loop invariant ((x3==4) || ((x3==3) || ((x3==2) || ((x3==1) || (x3==0)))));
loop assigns x5, x4, x3, x2;
loop variant strlen(x5);
*/
for (;;) {
char *x7 = x5;
char x8 = x7[0];
int x9 = x8 == '\0';
int x13;
if (x9) {
x13 = 0/*false*/;
} else {
int x11 = x2;
x13 = x11;
}
if (!x13) break;
char *x41 = x5;
char *x42 = x41+1;
x5 = x42;
/*@ghost x4 = (x4+1);*/
}
char *x88 = x5;
char x89 = x88[0];
int x90 = x89 == '\0';
int x93;
if (x90) {
int x91 = x2;
x93 = x91;
} else {
x93 = 0/*false*/;
}
int x97;
if (x93) {
int x94 = x3;
int x95 = x94 == 4;
x97 = x95;
} else {
x97 = 0/*false*/;
}
/*@assert ((x5[0]=='\0') || (!x2));*/
return x97;
}
|
#include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/
|
int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invariant ((x5[0]=='\0') ==> (strlen(x0)==x4));
loop invariant ((!(x5[0]=='\0')) ==> (strlen(x0)!=x4));
loop invariant ((x3==4) || ((x3==3) || ((x3==2) || ((x3==1) || (x3==0)))));
loop assigns x5, x4, x3, x2;
loop variant strlen(x5);
*/
for (;;) {
char *x7 = x5;
char x8 = x7[0];
int x9 = x8 == '\0';
int x13;
if (x9) {
x13 = 0/*false*/;
} else {
int x11 = x2;
x13 = x11;
}
if (!x13) break;
char *x41 = x5;
char *x42 = x41+1;
x5 = x42;
/*@ghost x4 = (x4+1);*/
}
char *x88 = x5;
char x89 = x88[0];
int x90 = x89 == '\0';
int x93;
if (x90) {
int x91 = x2;
x93 = x91;
} else {
x93 = 0/*false*/;
}
int x97;
if (x93) {
int x94 = x3;
int x95 = x94 == 4;
x97 = x95;
} else {
x97 = 0/*false*/;
}
/*@assert ((x5[0]=='\0') || (!x2));*/
return x97;
}
| true | 26 | 26 |
int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invariant ((x5[0]=='\0') ==> (strlen(x0)==x4));
loop invariant ((!(x5[0]=='\0')) ==> (strlen(x0)!=x4));
loop invariant ((x3==4) || ((x3==3) || ((x3==2) || ((x3==1) || (x3==0)))));
loop assigns x5, x4, x3, x2;
loop variant strlen(x5);
*/
for (;;) {
char *x7 = x5;
char x8 = x7[0];
int x9 = x8 == '\0';
int x13;
if (x9) {
x13 = 0/*false*/;
} else {
int x11 = x2;
x13 = x11;
}
if (!x13) break;
char *x41 = x5;
char *x42 = x41+1;
x5 = x42;
/*@ghost x4 = (x4+1);*/
}
char *x88 = x5;
char x89 = x88[0];
int x90 = x89 == '\0';
int x93;
if (x90) {
int x91 = x2;
x93 = x91;
} else {
x93 = 0/*false*/;
}
int x97;
if (x93) {
int x94 = x3;
int x95 = x94 == 4;
x97 = x95;
} else {
x97 = 0/*false*/;
}
/*@assert ((x5[0]=='\0') || (!x2));*/
return x97;
}
|
#include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/
|
|
frama_c_files_v2/test_frama_c_2743.c
|
#include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@
requires inv_vec_Int(x16,x17);
assigns \nothing;
ensures inv_vec_Int(x16,x17);
*/
int count_pos(int * x16, int x17) {
int x19 = 0;
/*@
loop invariant 0<=x21<=x17;
loop invariant ((0<=x19) &&
(x19<=x21));
loop assigns x21, x19;
loop variant x17-x21;
*/
for(int x21=0; x21 < x17; x21++) {
int x23 = x19;
int x22 = x16[x21];
int x29 = x22 > 0;
int x30;
if (x29) {
x30 = 1;
} else {
x30 = 0;
}
int x31 = x23 + x30;
x19 = x31;
}
int x35 = x19;
return x35;
}
|
#include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@
requires inv_vec_Int(x16,x17);
assigns \nothing;
ensures inv_vec_Int(x16,x17);
*/
|
int count_pos(int * x16, int x17) {
int x19 = 0;
/*@
loop invariant 0<=x21<=x17;
loop invariant ((0<=x19) &&
(x19<=x21));
loop assigns x21, x19;
loop variant x17-x21;
*/
for(int x21=0; x21 < x17; x21++) {
int x23 = x19;
int x22 = x16[x21];
int x29 = x22 > 0;
int x30;
if (x29) {
x30 = 1;
} else {
x30 = 0;
}
int x31 = x23 + x30;
x19 = x31;
}
int x35 = x19;
return x35;
}
| true | 17 | 17 |
int count_pos(int * x16, int x17) {
int x19 = 0;
/*@
loop invariant 0<=x21<=x17;
loop invariant ((0<=x19) &&
(x19<=x21));
loop assigns x21, x19;
loop variant x17-x21;
*/
for(int x21=0; x21 < x17; x21++) {
int x23 = x19;
int x22 = x16[x21];
int x29 = x22 > 0;
int x30;
if (x29) {
x30 = 1;
} else {
x30 = 0;
}
int x31 = x23 + x30;
x19 = x31;
}
int x35 = x19;
return x35;
}
|
#include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@
requires inv_vec_Int(x16,x17);
assigns \nothing;
ensures inv_vec_Int(x16,x17);
*/
|
|
frama_c_files_v2/test_frama_c_1083.c
|
/*@
requires \valid(p);
assigns \nothing;
ensures \result == 42;
*/
int foo(int* p) {
return 42;
}
|
/*@
requires \valid(p);
assigns \nothing;
ensures \result == 42;
*/
|
int foo(int* p) {
return 42;
}
| true | 4 | 4 |
int foo(int* p) {
return 42;
}
|
/*@
requires \valid(p);
assigns \nothing;
ensures \result == 42;
*/
|
|
frama_c_files_v2/test_frama_c_1608.c
|
/*@
requires n >= 0;
requires \valid(t+(0..(n-1)));
behavior empty :
assumes n==0;
ensures \result==0;
behavior not_empty:
assumes n>0;
ensures 0 <= \result < n;
ensures \forall integer k; 0 <= k < n ==> t[k] >= t[\result];
ensures \forall integer k; 0 <= k < \result ==> t[k] > t[\result];
complete behaviors empty, not_empty;
disjoint behaviors empty, not_empty;
*/
int min(int * t, int n) {
if (n==0) {
return 0;
} else {
int maxInd = 0;
int i =0;
/*@
loop assigns i, maxInd;
loop invariant 0 <= i <= n;
loop invariant 0 <= maxInd < n;
loop invariant 0 <= maxInd <= i;
loop invariant \forall integer k; 0 <= k < i ==> t[k] >= t[maxInd];
loop invariant \forall integer k; 0 <= k < maxInd ==> t[k] > t[maxInd];
loop variant n-i;
*/
for(i=0;i<n;i++) {
if (t[i] < t[maxInd]) {
maxInd = i;
}
}
return maxInd;
}
}
|
/*@
requires n >= 0;
requires \valid(t+(0..(n-1)));
behavior empty :
assumes n==0;
ensures \result==0;
behavior not_empty:
assumes n>0;
ensures 0 <= \result < n;
ensures \forall integer k; 0 <= k < n ==> t[k] >= t[\result];
ensures \forall integer k; 0 <= k < \result ==> t[k] > t[\result];
complete behaviors empty, not_empty;
disjoint behaviors empty, not_empty;
*/
|
int min(int * t, int n) {
if (n==0) {
return 0;
} else {
int maxInd = 0;
int i =0;
/*@
loop assigns i, maxInd;
loop invariant 0 <= i <= n;
loop invariant 0 <= maxInd < n;
loop invariant 0 <= maxInd <= i;
loop invariant \forall integer k; 0 <= k < i ==> t[k] >= t[maxInd];
loop invariant \forall integer k; 0 <= k < maxInd ==> t[k] > t[maxInd];
loop variant n-i;
*/
for(i=0;i<n;i++) {
if (t[i] < t[maxInd]) {
maxInd = i;
}
}
return maxInd;
}
}
| true | 24 | 24 |
int min(int * t, int n) {
if (n==0) {
return 0;
} else {
int maxInd = 0;
int i =0;
/*@
loop assigns i, maxInd;
loop invariant 0 <= i <= n;
loop invariant 0 <= maxInd < n;
loop invariant 0 <= maxInd <= i;
loop invariant \forall integer k; 0 <= k < i ==> t[k] >= t[maxInd];
loop invariant \forall integer k; 0 <= k < maxInd ==> t[k] > t[maxInd];
loop variant n-i;
*/
for(i=0;i<n;i++) {
if (t[i] < t[maxInd]) {
maxInd = i;
}
}
return maxInd;
}
}
|
/*@
requires n >= 0;
requires \valid(t+(0..(n-1)));
behavior empty :
assumes n==0;
ensures \result==0;
behavior not_empty:
assumes n>0;
ensures 0 <= \result < n;
ensures \forall integer k; 0 <= k < n ==> t[k] >= t[\result];
ensures \forall integer k; 0 <= k < \result ==> t[k] > t[\result];
complete behaviors empty, not_empty;
disjoint behaviors empty, not_empty;
*/
|
|
frama_c_files_v2/test_frama_c_310.c
|
#include <string.h>
/*@
logic integer cypher(integer s) = s==26 ? 0 : s+1;
logic integer decypher(integer s) = s==0 ? 26 : s-1;
*/
/*@
requires 0 <= s <= 26;
ensures 0 <= \result <= 26;
ensures \result == cypher(s);
assigns \nothing;
*/
int cypher(int s) {
return s==26 ? 0 : s+1;
}
/*@
requires 0 <= s <= 26;
ensures 0 <= \result <= 26;
ensures \result == decypher(s);
assigns \nothing;
*/
int decypher(int s) {
return s==0 ? 26 : s-1;
}
/*@
requires n > 0;
requires \valid(s1+(0..n-1));
requires \valid(s2+(0..n-1));
requires \valid(s3+(0..n-1));
requires \forall int i1,i2,i3; 0 <= i1 < n && 0 <= i2 < n && 0 <= i3 < n ==> \separated(s1+i1,s2+i2,s3+i3);
requires \forall int i; 0 <= i < n ==> 0 <= s1[i] <= 26;
ensures \forall int i; 0 <= i < n ==> s2[i]==cypher(s1[i]);
ensures \forall int i; 0 <= i < n ==> 0 <= s2[i] <= 26;
ensures \forall int i; 0 <= i < n ==> \old(s1[i])==s1[i];
ensures \forall int i; 0 <= i < n ==> \old(s3[i])==s3[i];
assigns s2[0..n-1];
*/
void encode(int* s1, int* s2, int* s3, int n) {
/*@
loop invariant 0 <= i <= n;
loop invariant \forall int j; 0 <= j < n ==> 0 <= s1[j] <= 26;
loop invariant \forall int i; 0 <= i < n ==> \at(s1[i],Pre)==s1[i];
loop invariant \forall int i; 0 <= i < n ==> \at(s3[i],Pre)==s3[i];
loop invariant \forall int j; 0 <= j < i ==> s2[j]==cypher(s1[j]);
loop assigns i, s2[0..n-1];
loop variant n - i;
*/
for (int i=0; i<n; i++) {
s2[i] = cypher(s1[i]);
}
}
/*@
requires n > 0;
requires \valid(s1+(0..n-1));
requires \valid(s2+(0..n-1));
requires \valid(s3+(0..n-1));
requires \forall int i1,i2,i3; 0 <= i1 < n && 0 <= i2 < n && 0 <= i3 < n ==> \separated(s1+i1,s2+i2,s3+i3);
requires \forall int i; 0 <= i < n ==> 0 <= s1[i] <= 26;
ensures \forall int i; 0 <= i < n ==> s2[i]==decypher(s1[i]);
ensures \forall int i; 0 <= i < n ==> 0 <= s2[i] <= 26;
ensures \forall int i; 0 <= i < n ==> \old(s1[i])==s1[i];
ensures \forall int i; 0 <= i < n ==> \old(s3[i])==s3[i];
assigns s2[0..n-1];
*/
void decode(int* s1, int* s2, int* s3, int n) {
/*@
loop invariant 0 <= i <= n;
loop invariant \forall int j; 0 <= j < n ==> 0 <= s1[j] <= 26;
loop invariant \forall int i; 0 <= i < n ==> \at(s1[i],Pre)==s1[i];
loop invariant \forall int i; 0 <= i < n ==> \at(s3[i],Pre)==s3[i];
loop invariant \forall int j; 0 <= j < i ==> s2[j]==decypher(s1[j]);
loop assigns i, s2[0..n-1];
loop variant n - i;
*/
for (int i=0; i<n; i++) {
s2[i] = decypher(s1[i]);
}
}
/*@
requires n > 0;
requires \valid(s1+(0..n-1));
requires \valid(s2+(0..n-1));
requires \valid(s3+(0..n-1));
requires \forall int i1,i2,i3; 0 <= i1 < n && 0 <= i2 < n && 0 <= i3 < n ==> \separated(s1+i1,s2+i2,s3+i3);
requires \forall int i; 0 <= i < n ==> 0 <= s1[i] <= 26;
ensures \forall int i; 0 <= i < n ==> s3[i]==s1[i];
ensures \forall int i; 0 <= i < n ==> \old(s1[i])==s1[i];
assigns s2[0..n-1], s3[0..n-1];
*/
void autoencode(int* s1, int* s2, int* s3, int n) {
encode(s1, s2, s3, n);
decode(s2, s3, s1, n);
//@assert \forall int i; 0 <= i < n ==> \at(s1[i],Pre)==s1[i];
//@assert \forall int i; 0 <= i < n ==> s2[i]==cypher(s1[i]);
//@assert \forall int i; 0 <= i < n ==> s3[i]==decypher(s2[i]);
//@assert \forall int i; 0 <= i < n ==> s3[i]==decypher(cypher(s1[i]));
//@assert \forall int i; 0 <= i < n ==> s3[i]==s1[i];
}
|
#include <string.h>
/*@
logic integer cypher(integer s) = s==26 ? 0 : s+1;
logic integer decypher(integer s) = s==0 ? 26 : s-1;
*/
/*@
requires 0 <= s <= 26;
ensures 0 <= \result <= 26;
ensures \result == cypher(s);
assigns \nothing;
*/
|
int cypher(int s) {
return s==26 ? 0 : s+1;
}
| true | 7 | 7 |
int cypher(int s) {
return s==26 ? 0 : s+1;
}
|
#include <string.h>
/*@
logic integer cypher(integer s) = s==26 ? 0 : s+1;
logic integer decypher(integer s) = s==0 ? 26 : s-1;
*/
/*@
requires 0 <= s <= 26;
ensures 0 <= \result <= 26;
ensures \result == cypher(s);
assigns \nothing;
*/
|
|
frama_c_files_v2/test_frama_c_310.c
|
#include <string.h>
/*@
logic integer cypher(integer s) = s==26 ? 0 : s+1;
logic integer decypher(integer s) = s==0 ? 26 : s-1;
*/
/*@
requires 0 <= s <= 26;
ensures 0 <= \result <= 26;
ensures \result == cypher(s);
assigns \nothing;
*/
int cypher(int s) {
return s==26 ? 0 : s+1;
}
/*@
requires 0 <= s <= 26;
ensures 0 <= \result <= 26;
ensures \result == decypher(s);
assigns \nothing;
*/
int decypher(int s) {
return s==0 ? 26 : s-1;
}
/*@
requires n > 0;
requires \valid(s1+(0..n-1));
requires \valid(s2+(0..n-1));
requires \valid(s3+(0..n-1));
requires \forall int i1,i2,i3; 0 <= i1 < n && 0 <= i2 < n && 0 <= i3 < n ==> \separated(s1+i1,s2+i2,s3+i3);
requires \forall int i; 0 <= i < n ==> 0 <= s1[i] <= 26;
ensures \forall int i; 0 <= i < n ==> s2[i]==cypher(s1[i]);
ensures \forall int i; 0 <= i < n ==> 0 <= s2[i] <= 26;
ensures \forall int i; 0 <= i < n ==> \old(s1[i])==s1[i];
ensures \forall int i; 0 <= i < n ==> \old(s3[i])==s3[i];
assigns s2[0..n-1];
*/
void encode(int* s1, int* s2, int* s3, int n) {
/*@
loop invariant 0 <= i <= n;
loop invariant \forall int j; 0 <= j < n ==> 0 <= s1[j] <= 26;
loop invariant \forall int i; 0 <= i < n ==> \at(s1[i],Pre)==s1[i];
loop invariant \forall int i; 0 <= i < n ==> \at(s3[i],Pre)==s3[i];
loop invariant \forall int j; 0 <= j < i ==> s2[j]==cypher(s1[j]);
loop assigns i, s2[0..n-1];
loop variant n - i;
*/
for (int i=0; i<n; i++) {
s2[i] = cypher(s1[i]);
}
}
/*@
requires n > 0;
requires \valid(s1+(0..n-1));
requires \valid(s2+(0..n-1));
requires \valid(s3+(0..n-1));
requires \forall int i1,i2,i3; 0 <= i1 < n && 0 <= i2 < n && 0 <= i3 < n ==> \separated(s1+i1,s2+i2,s3+i3);
requires \forall int i; 0 <= i < n ==> 0 <= s1[i] <= 26;
ensures \forall int i; 0 <= i < n ==> s2[i]==decypher(s1[i]);
ensures \forall int i; 0 <= i < n ==> 0 <= s2[i] <= 26;
ensures \forall int i; 0 <= i < n ==> \old(s1[i])==s1[i];
ensures \forall int i; 0 <= i < n ==> \old(s3[i])==s3[i];
assigns s2[0..n-1];
*/
void decode(int* s1, int* s2, int* s3, int n) {
/*@
loop invariant 0 <= i <= n;
loop invariant \forall int j; 0 <= j < n ==> 0 <= s1[j] <= 26;
loop invariant \forall int i; 0 <= i < n ==> \at(s1[i],Pre)==s1[i];
loop invariant \forall int i; 0 <= i < n ==> \at(s3[i],Pre)==s3[i];
loop invariant \forall int j; 0 <= j < i ==> s2[j]==decypher(s1[j]);
loop assigns i, s2[0..n-1];
loop variant n - i;
*/
for (int i=0; i<n; i++) {
s2[i] = decypher(s1[i]);
}
}
/*@
requires n > 0;
requires \valid(s1+(0..n-1));
requires \valid(s2+(0..n-1));
requires \valid(s3+(0..n-1));
requires \forall int i1,i2,i3; 0 <= i1 < n && 0 <= i2 < n && 0 <= i3 < n ==> \separated(s1+i1,s2+i2,s3+i3);
requires \forall int i; 0 <= i < n ==> 0 <= s1[i] <= 26;
ensures \forall int i; 0 <= i < n ==> s3[i]==s1[i];
ensures \forall int i; 0 <= i < n ==> \old(s1[i])==s1[i];
assigns s2[0..n-1], s3[0..n-1];
*/
void autoencode(int* s1, int* s2, int* s3, int n) {
encode(s1, s2, s3, n);
decode(s2, s3, s1, n);
//@assert \forall int i; 0 <= i < n ==> \at(s1[i],Pre)==s1[i];
//@assert \forall int i; 0 <= i < n ==> s2[i]==cypher(s1[i]);
//@assert \forall int i; 0 <= i < n ==> s3[i]==decypher(s2[i]);
//@assert \forall int i; 0 <= i < n ==> s3[i]==decypher(cypher(s1[i]));
//@assert \forall int i; 0 <= i < n ==> s3[i]==s1[i];
}
|
#include <string.h>
/*@
logic integer cypher(integer s) = s==26 ? 0 : s+1;
logic integer decypher(integer s) = s==0 ? 26 : s-1;
*/
/*@
requires 0 <= s <= 26;
ensures 0 <= \result <= 26;
ensures \result == cypher(s);
assigns \nothing;
*/
int cypher(int s) {
return s==26 ? 0 : s+1;
}
/*@
requires 0 <= s <= 26;
ensures 0 <= \result <= 26;
ensures \result == decypher(s);
assigns \nothing;
*/
|
int decypher(int s) {
return s==0 ? 26 : s-1;
}
| true | 14 | 14 |
int decypher(int s) {
return s==0 ? 26 : s-1;
}
|
#include <string.h>
/*@
logic integer cypher(integer s) = s==26 ? 0 : s+1;
logic integer decypher(integer s) = s==0 ? 26 : s-1;
*/
/*@
requires 0 <= s <= 26;
ensures 0 <= \result <= 26;
ensures \result == cypher(s);
assigns \nothing;
*/
int cypher(int s) {
return s==26 ? 0 : s+1;
}
/*@
requires 0 <= s <= 26;
ensures 0 <= \result <= 26;
ensures \result == decypher(s);
assigns \nothing;
*/
|
|
frama_c_files_v2/test_frama_c_353.c
|
/*@ predicate Swap{L1,L2}(int *a, integer i, integer j) =
@ \at(a[i],L1) == \at(a[j],L2) &&
@ \at(a[j],L1) == \at(a[i],L2) &&
@ \forall integer k; k != i && k != j
@ ==> \at(a[k],L1) == \at(a[k],L2);
@*/
/*@ predicate sorted(int *t,integer i,integer j) =
@ \forall integer k, integer l; i <= k < l <= j ==> t[k] <= t[l];
@*/
/*@ requires N>=1 && \valid(A+(0..N-1));
@ assigns A[0..N-1];
@ ensures sorted(A,0,N-1);
@*/
void selectionSort(int A[], int N)
{
int i, j, min, temp;
/*@ loop assigns i,j,min,temp, A[0..N-1];
@ loop invariant 0<=i<=N-1 && sorted(A,0,i) && (\forall integer k1, integer k2; (0<=k1<i<k2<N)==>A[k1]<=A[k2]);
@ loop variant N-i;
@*/
for (i = 0; i < N-1; i++)
{
min = i;
/*@ loop assigns j,min;
@ loop invariant i+1<=j<=N && i<=min<j && (\forall integer k; (i<=k<j)==>A[min]<=A[k]);
@ loop variant N-j;
@*/
for (j = i+1; j < N; j++){
if (A[j] < A[min]){
min = j;
}
}
if(min!=i){
temp = A[i];
A[i] = A[min];
A[min] = temp;
}
}
}
|
/*@ predicate Swap{L1,L2}(int *a, integer i, integer j) =
@ \at(a[i],L1) == \at(a[j],L2) &&
@ \at(a[j],L1) == \at(a[i],L2) &&
@ \forall integer k; k != i && k != j
@ ==> \at(a[k],L1) == \at(a[k],L2);
@*/
/*@ predicate sorted(int *t,integer i,integer j) =
@ \forall integer k, integer l; i <= k < l <= j ==> t[k] <= t[l];
@*/
/*@ requires N>=1 && \valid(A+(0..N-1));
@ assigns A[0..N-1];
@ ensures sorted(A,0,N-1);
@*/
|
void selectionSort(int A[], int N)
{
int i, j, min, temp;
/*@ loop assigns i,j,min,temp, A[0..N-1];
@ loop invariant 0<=i<=N-1 && sorted(A,0,i) && (\forall integer k1, integer k2; (0<=k1<i<k2<N)==>A[k1]<=A[k2]);
@ loop variant N-i;
@*/
for (i = 0; i < N-1; i++)
{
min = i;
/*@ loop assigns j,min;
@ loop invariant i+1<=j<=N && i<=min<j && (\forall integer k; (i<=k<j)==>A[min]<=A[k]);
@ loop variant N-j;
@*/
for (j = i+1; j < N; j++){
if (A[j] < A[min]){
min = j;
}
}
if(min!=i){
temp = A[i];
A[i] = A[min];
A[min] = temp;
}
}
}
| true | 28 | 28 |
void selectionSort(int A[], int N)
{
int i, j, min, temp;
/*@ loop assigns i,j,min,temp, A[0..N-1];
@ loop invariant 0<=i<=N-1 && sorted(A,0,i) && (\forall integer k1, integer k2; (0<=k1<i<k2<N)==>A[k1]<=A[k2]);
@ loop variant N-i;
@*/
for (i = 0; i < N-1; i++)
{
min = i;
/*@ loop assigns j,min;
@ loop invariant i+1<=j<=N && i<=min<j && (\forall integer k; (i<=k<j)==>A[min]<=A[k]);
@ loop variant N-j;
@*/
for (j = i+1; j < N; j++){
if (A[j] < A[min]){
min = j;
}
}
if(min!=i){
temp = A[i];
A[i] = A[min];
A[min] = temp;
}
}
}
|
/*@ predicate Swap{L1,L2}(int *a, integer i, integer j) =
@ \at(a[i],L1) == \at(a[j],L2) &&
@ \at(a[j],L1) == \at(a[i],L2) &&
@ \forall integer k; k != i && k != j
@ ==> \at(a[k],L1) == \at(a[k],L2);
@*/
/*@ predicate sorted(int *t,integer i,integer j) =
@ \forall integer k, integer l; i <= k < l <= j ==> t[k] <= t[l];
@*/
/*@ requires N>=1 && \valid(A+(0..N-1));
@ assigns A[0..N-1];
@ ensures sorted(A,0,N-1);
@*/
|
|
frama_c_files_v2/test_frama_c_183.c
|
/*@ requires a_valid: \valid(a);
requires b_valid: \valid(b);
ensures a_value: *a == \at(*b, Pre);
ensures b_value: *b == \at(*a, Pre);
*/
void swap(int* a, int* b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
|
/*@ requires a_valid: \valid(a);
requires b_valid: \valid(b);
ensures a_value: *a == \at(*b, Pre);
ensures b_value: *b == \at(*a, Pre);
*/
|
void swap(int* a, int* b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
| true | 8 | 8 |
void swap(int* a, int* b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
|
/*@ requires a_valid: \valid(a);
requires b_valid: \valid(b);
ensures a_value: *a == \at(*b, Pre);
ensures b_value: *b == \at(*a, Pre);
*/
|
|
frama_c_files_v2/test_frama_c_963.c
|
/*@ requires y > 10;
@ ensures \result >= 0;
*/
int g(int y){
int x=0;
if(y>0){
x=100;
x=x+50;
x=x-100;
}else{
x = x - 150;
x=x-100;
x=x+100;
}
return x;
}
int main(){
int a = g(11);
return a;
}
|
/*@ requires y > 10;
@ ensures \result >= 0;
*/
|
int g(int y){
int x=0;
if(y>0){
x=100;
x=x+50;
x=x-100;
}else{
x = x - 150;
x=x-100;
x=x+100;
}
return x;
}
| true | 8 | 8 |
int g(int y){
int x=0;
if(y>0){
x=100;
x=x+50;
x=x-100;
}else{
x = x - 150;
x=x-100;
x=x+100;
}
return x;
}
|
/*@ requires y > 10;
@ ensures \result >= 0;
*/
|
|
frama_c_files_v2/test_frama_c_132.c
|
#ifndef SPEC_SORTING_H
#define SPEC_SORTING_H
/*@ predicate Swap{L1,L2}(int *a, integer i, integer j) =
\at(a[i],L1) == \at(a[j],L2) &&
\at(a[j],L1) == \at(a[i],L2) &&
\forall integer k; k != i && k != j
==> \at(a[k],L1) == \at(a[k],L2);
*/
/*@ inductive Permut{L1,L2}(int *a, integer l, integer h) {
case Permut_refl{L}:
\forall int *a, integer l, h; Permut{L,L}(a, l, h);
case Permut_sym{L1,L2}:
\forall int *a, integer l, h;
Permut{L1,L2}(a, l, h) ==> Permut{L2,L1}(a, l, h);
case Permut_trans{L1,L2,L3}:
\forall int *a, integer l, h;
Permut{L1,L2}(a, l, h) && Permut{L2,L3}(a, l, h) ==>
Permut{L1,L3}(a, l, h);
case Permut_swap{L1,L2}:
\forall int *a, integer l, h, i, j;
l <= i <= h && l <= j <= h && Swap{L1,L2}(a, i, j) ==>
Permut{L1,L2}(a, l, h);
}
*/
/*@ predicate Sorted{L}(int *a, integer l, integer h) =
\forall integer i,j; l <= i <= j < h ==> a[i] <= a[j];
*/
/*@ requires \valid(t+i);
requires \valid(t+j);
assigns t[i],t[j];
ensures Swap{Old,Here}(t,i,j);
*/
void sort_swap(int t[], int i, int j)
{
int tmp = t[i];
t[i] = t[j];
t[j] = tmp;
}
#endif
|
/*@ predicate Swap{L1,L2}(int *a, integer i, integer j) =
\at(a[i],L1) == \at(a[j],L2) &&
\at(a[j],L1) == \at(a[i],L2) &&
\forall integer k; k != i && k != j
==> \at(a[k],L1) == \at(a[k],L2);
*/
/*@ inductive Permut{L1,L2}(int *a, integer l, integer h) {
case Permut_refl{L}:
\forall int *a, integer l, h; Permut{L,L}(a, l, h);
case Permut_sym{L1,L2}:
\forall int *a, integer l, h;
Permut{L1,L2}(a, l, h) ==> Permut{L2,L1}(a, l, h);
case Permut_trans{L1,L2,L3}:
\forall int *a, integer l, h;
Permut{L1,L2}(a, l, h) && Permut{L2,L3}(a, l, h) ==>
Permut{L1,L3}(a, l, h);
case Permut_swap{L1,L2}:
\forall int *a, integer l, h, i, j;
l <= i <= h && l <= j <= h && Swap{L1,L2}(a, i, j) ==>
Permut{L1,L2}(a, l, h);
}
*/
/*@ predicate Sorted{L}(int *a, integer l, integer h) =
\forall integer i,j; l <= i <= j < h ==> a[i] <= a[j];
*/
/*@ requires \valid(t+i);
requires \valid(t+j);
assigns t[i],t[j];
ensures Swap{Old,Here}(t,i,j);
*/
|
void sort_swap(int t[], int i, int j)
{
int tmp = t[i];
t[i] = t[j];
t[j] = tmp;
}
| true | 9 | 9 |
void sort_swap(int t[], int i, int j)
{
int tmp = t[i];
t[i] = t[j];
t[j] = tmp;
}
|
/*@ predicate Swap{L1,L2}(int *a, integer i, integer j) =
\at(a[i],L1) == \at(a[j],L2) &&
\at(a[j],L1) == \at(a[i],L2) &&
\forall integer k; k != i && k != j
==> \at(a[k],L1) == \at(a[k],L2);
*/
/*@ inductive Permut{L1,L2}(int *a, integer l, integer h) {
case Permut_refl{L}:
\forall int *a, integer l, h; Permut{L,L}(a, l, h);
case Permut_sym{L1,L2}:
\forall int *a, integer l, h;
Permut{L1,L2}(a, l, h) ==> Permut{L2,L1}(a, l, h);
case Permut_trans{L1,L2,L3}:
\forall int *a, integer l, h;
Permut{L1,L2}(a, l, h) && Permut{L2,L3}(a, l, h) ==>
Permut{L1,L3}(a, l, h);
case Permut_swap{L1,L2}:
\forall int *a, integer l, h, i, j;
l <= i <= h && l <= j <= h && Swap{L1,L2}(a, i, j) ==>
Permut{L1,L2}(a, l, h);
}
*/
/*@ predicate Sorted{L}(int *a, integer l, integer h) =
\forall integer i,j; l <= i <= j < h ==> a[i] <= a[j];
*/
/*@ requires \valid(t+i);
requires \valid(t+j);
assigns t[i],t[j];
ensures Swap{Old,Here}(t,i,j);
*/
|
|
frama_c_files_v2/test_frama_c_199.c
|
/*@
requires \valid(a) && \valid(b);
ensures A: *a==\old(*b);
ensures B: *b==\old(*a);
assigns *a, *b;
*/
void swap(int *a, int *b) {
int temp = *a;
*a = *b;
*b = temp;
}
|
/*@
requires \valid(a) && \valid(b);
ensures A: *a==\old(*b);
ensures B: *b==\old(*a);
assigns *a, *b;
*/
|
void swap(int *a, int *b) {
int temp = *a;
*a = *b;
*b = temp;
}
| true | 10 | 10 |
void swap(int *a, int *b) {
int temp = *a;
*a = *b;
*b = temp;
}
|
/*@
requires \valid(a) && \valid(b);
ensures A: *a==\old(*b);
ensures B: *b==\old(*a);
assigns *a, *b;
*/
|
|
frama_c_files_v2/test_frama_c_59.c
|
/*@ requires \valid(p) && \valid(q);
ensures \result >= *p && \result >= *q;
ensures \result == *p || \result == *q;
*/
int max_ptr ( int *p, int *q ) {
*p = 0;
*q = 0;
return 0 ;
}
|
/*@ requires \valid(p) && \valid(q);
ensures \result >= *p && \result >= *q;
ensures \result == *p || \result == *q;
*/
|
int max_ptr ( int *p, int *q ) {
*p = 0;
*q = 0;
return 0 ;
}
| true | 6 | 6 |
int max_ptr ( int *p, int *q ) {
*p = 0;
*q = 0;
return 0 ;
}
|
/*@ requires \valid(p) && \valid(q);
ensures \result >= *p && \result >= *q;
ensures \result == *p || \result == *q;
*/
|
|
frama_c_files_v2/test_frama_c_709.c
|
/*@ predicate sorted{L}(int* a, integer length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ predicate swap{L1,L2}(int* a,integer i,integer j,integer length)=
0<=i<j<length
&& \at(a[i],L1) == \at(a[j],L2)
&& \at(a[i],L2) == \at(a[j],L1)
&& \forall integer k; 0<=k<length && k!=i && k!=j ==>
\at(a[k],L1) == \at(a[k],L2);
*/
/*@ inductive same_elements{L1,L2}(int*a , integer length) {
case refl{L}:
\forall int*a, integer length; same_elements{L,L}(a,length);
case swap{L1,L2}: \forall int*a, integer i,j,length;
swap{L1,L2}(a,i,j,length) ==> same_elements{L1,L2}(a,length);
case trans{L1,L2,L3}: \forall int*a, integer length;
same_elements{L1,L2}(a,length)
==> same_elements{L2,L3}(a,length)
==> same_elements{L1,L3}(a,length);
}
*/
/*@ requires \valid(a+(0..length-1));
requires length > 0;
assigns a[0..length-1];
behavior sorted:
ensures sorted(a,length);
behavior same_elements:
ensures same_elements{Pre,Here}(a,length);
*/
void sort (int* a, int length) {
int current;
/*@ loop invariant 0<=current<length;
loop assigns a[0..length-1],current;
for sorted: loop invariant sorted(a,current);
for sorted: loop invariant
\forall integer i,j; 0<=i<current<=j<length ==> a[i] <= a[j];
for same_elements: loop invariant
same_elements{Pre,Here}(a,length);
loop variant length-current;
*/
for (current = 0; current < length - 1; current++) {
int min_idx = current;
int min = a[current];
/*@ loop invariant current+1<=i<=length;
loop assigns i,min,min_idx;
loop invariant current<=min_idx<i;
loop invariant a[min_idx] == min;
for sorted: loop invariant
\forall integer j; current<=j<i ==> min <= a[j];
loop variant length -i;
*/
for (int i = current + 1; i < length; i++) {
if (a[i] < min) {
min = a[i];
min_idx = i;
}
}
if(min_idx != current) {
L: a[min_idx]=a[current];
a[current]=min;
/*@for same_elements:assert swap{L,Here}(a,current,min_idx,length);*/
}
}
}
|
/*@ predicate sorted{L}(int* a, integer length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ predicate swap{L1,L2}(int* a,integer i,integer j,integer length)=
0<=i<j<length
&& \at(a[i],L1) == \at(a[j],L2)
&& \at(a[i],L2) == \at(a[j],L1)
&& \forall integer k; 0<=k<length && k!=i && k!=j ==>
\at(a[k],L1) == \at(a[k],L2);
*/
/*@ inductive same_elements{L1,L2}(int*a , integer length) {
case refl{L}:
\forall int*a, integer length; same_elements{L,L}(a,length);
case swap{L1,L2}: \forall int*a, integer i,j,length;
swap{L1,L2}(a,i,j,length) ==> same_elements{L1,L2}(a,length);
case trans{L1,L2,L3}: \forall int*a, integer length;
same_elements{L1,L2}(a,length)
==> same_elements{L2,L3}(a,length)
==> same_elements{L1,L3}(a,length);
}
*/
/*@ requires \valid(a+(0..length-1));
requires length > 0;
assigns a[0..length-1];
behavior sorted:
ensures sorted(a,length);
behavior same_elements:
ensures same_elements{Pre,Here}(a,length);
*/
|
void sort (int* a, int length) {
int current;
/*@ loop invariant 0<=current<length;
loop assigns a[0..length-1],current;
for sorted: loop invariant sorted(a,current);
for sorted: loop invariant
\forall integer i,j; 0<=i<current<=j<length ==> a[i] <= a[j];
for same_elements: loop invariant
same_elements{Pre,Here}(a,length);
loop variant length-current;
*/
for (current = 0; current < length - 1; current++) {
int min_idx = current;
int min = a[current];
/*@ loop invariant current+1<=i<=length;
loop assigns i,min,min_idx;
loop invariant current<=min_idx<i;
loop invariant a[min_idx] == min;
for sorted: loop invariant
\forall integer j; current<=j<i ==> min <= a[j];
loop variant length -i;
*/
for (int i = current + 1; i < length; i++) {
if (a[i] < min) {
min = a[i];
min_idx = i;
}
}
if(min_idx != current) {
L: a[min_idx]=a[current];
a[current]=min;
/*@for same_elements:assert swap{L,Here}(a,current,min_idx,length);*/
}
}
}
| true | 43 | 43 |
void sort (int* a, int length) {
int current;
/*@ loop invariant 0<=current<length;
loop assigns a[0..length-1],current;
for sorted: loop invariant sorted(a,current);
for sorted: loop invariant
\forall integer i,j; 0<=i<current<=j<length ==> a[i] <= a[j];
for same_elements: loop invariant
same_elements{Pre,Here}(a,length);
loop variant length-current;
*/
for (current = 0; current < length - 1; current++) {
int min_idx = current;
int min = a[current];
/*@ loop invariant current+1<=i<=length;
loop assigns i,min,min_idx;
loop invariant current<=min_idx<i;
loop invariant a[min_idx] == min;
for sorted: loop invariant
\forall integer j; current<=j<i ==> min <= a[j];
loop variant length -i;
*/
for (int i = current + 1; i < length; i++) {
if (a[i] < min) {
min = a[i];
min_idx = i;
}
}
if(min_idx != current) {
L: a[min_idx]=a[current];
a[current]=min;
/*@for same_elements:assert swap{L,Here}(a,current,min_idx,length);*/
}
}
}
|
/*@ predicate sorted{L}(int* a, integer length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ predicate swap{L1,L2}(int* a,integer i,integer j,integer length)=
0<=i<j<length
&& \at(a[i],L1) == \at(a[j],L2)
&& \at(a[i],L2) == \at(a[j],L1)
&& \forall integer k; 0<=k<length && k!=i && k!=j ==>
\at(a[k],L1) == \at(a[k],L2);
*/
/*@ inductive same_elements{L1,L2}(int*a , integer length) {
case refl{L}:
\forall int*a, integer length; same_elements{L,L}(a,length);
case swap{L1,L2}: \forall int*a, integer i,j,length;
swap{L1,L2}(a,i,j,length) ==> same_elements{L1,L2}(a,length);
case trans{L1,L2,L3}: \forall int*a, integer length;
same_elements{L1,L2}(a,length)
==> same_elements{L2,L3}(a,length)
==> same_elements{L1,L3}(a,length);
}
*/
/*@ requires \valid(a+(0..length-1));
requires length > 0;
assigns a[0..length-1];
behavior sorted:
ensures sorted(a,length);
behavior same_elements:
ensures same_elements{Pre,Here}(a,length);
*/
|
|
frama_c_files_v2/test_frama_c_2218.c
|
#include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/
int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
}
/*@ predicate inv_matrix_Boolean(int * x26, integer x27, integer x28) = (((((x27<100) &&
(x28<100)) &&
(0<x27)) &&
(0<x28)) &&
(((x27*x28)>0) &&
\valid(x26+(0..(x27*x28)-1))));*/
/*@
requires (((((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71)) &&
((x70==x64) &&
(x71==x65))) &&
((x70==x67) &&
(x71==x68))) &&
((\forall int x121; (\forall int x122; ((((0<=x121) &&
(x121<(x70*x71))) &&
((0<=x122) &&
(x122<(x64*x65)))) ==> \separated(x69+x121,x63+x122)))) &&
(\forall int x136; (\forall int x137; ((((0<=x136) &&
(x136<(x70*x71))) &&
((0<=x137) &&
(x137<(x67*x68)))) ==> \separated(x69+x136,x66+x137))))));
ensures (((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71)) &&
(\forall int x157; (((0<=x157) &&
(x157<(x70*x71))) ==> (x69[x157]==(x63[x157] || x66[x157])))));
*/
void add(int * x63, int x64, int x65, int * x66, int x67, int x68, int * x69, int x70, int x71) {
/*@assert \separated(x69+0,x63+0);*/
/*@assert \separated(x69+0,x66+0);*/
int x73 = x70 * x71;
/*@
loop invariant 0<=x81<=x73;
loop invariant (\forall int x82; (((0<=x82) &&
(x82<x81)) ==> (x69[x82]==(x63[x82] || x66[x82]))));
loop assigns x81, x69[(0..x73-1)];
loop variant x73-x81;
*/
for(int x81=0; x81 < x73; x81++) {
int x94 = x63[x81];
int x95 = x66[x81];
int x96 = x94 || x95;
x69[x81] = x96;
/*@assert \separated(x69+x81,x63+x81);*/
/*@assert \separated(x69+x81,x66+x81);*/
}
}
/*@
requires (((inv_matrix_Boolean(x172,x173,x174) &&
inv_matrix_Boolean(x175,x176,x177)) &&
((x176==x173) &&
(x177==x174))) &&
(\forall int x213; (\forall int x214; ((((0<=x213) &&
(x213<(x176*x177))) &&
((0<=x214) &&
(x214<(x173*x174)))) ==> \separated(x175+x213,x172+x214)))));
ensures (((inv_matrix_Boolean(x172,x173,x174) &&
inv_matrix_Boolean(x175,x176,x177)) &&
(\forall int x233; (((0<=x233) &&
(x233<(x176*x177))) ==> (x175[x233]==(x171 &&
x172[x233]))))) &&
((x171==\false) ==> (\forall int x247; (0<=x247<x176) ==> (\forall int x250; (0<=x250<x177) ==> (x175[((x247*x177)+x250)]==\false)))));
*/
void scalar_mult(int x171, int * x172, int x173, int x174, int * x175, int x176, int x177) {
/*@assert \separated(x175+0,x172+0);*/
int x179 = x176 * x177;
/*@
loop invariant 0<=x184<=x179;
loop invariant (\forall int x185; (((0<=x185) &&
(x185<x184)) ==> (x175[x185]==(x171 &&
x172[x185]))));
loop assigns x184, x175[(0..x179-1)];
loop variant x179-x184;
*/
for(int x184=0; x184 < x179; x184++) {
int x197;
if (x171) {
int x196 = x172[x184];
x197 = x196;
} else {
x197 = 0/*false*/;
}
x175[x184] = x197;
/*@assert \separated(x175+x184,x172+x184);*/
}
}
|
#include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/
int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
}
/*@ predicate inv_matrix_Boolean(int * x26, integer x27, integer x28) = (((((x27<100) &&
(x28<100)) &&
(0<x27)) &&
(0<x28)) &&
(((x27*x28)>0) &&
\valid(x26+(0..(x27*x28)-1))));*/
/*@
requires (((((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71)) &&
((x70==x64) &&
(x71==x65))) &&
((x70==x67) &&
(x71==x68))) &&
((\forall int x121; (\forall int x122; ((((0<=x121) &&
(x121<(x70*x71))) &&
((0<=x122) &&
(x122<(x64*x65)))) ==> \separated(x69+x121,x63+x122)))) &&
(\forall int x136; (\forall int x137; ((((0<=x136) &&
(x136<(x70*x71))) &&
((0<=x137) &&
(x137<(x67*x68)))) ==> \separated(x69+x136,x66+x137))))));
ensures (((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71)) &&
(\forall int x157; (((0<=x157) &&
(x157<(x70*x71))) ==> (x69[x157]==(x63[x157] || x66[x157])))));
*/
|
void add(int * x63, int x64, int x65, int * x66, int x67, int x68, int * x69, int x70, int x71) {
/*@assert \separated(x69+0,x63+0);*/
/*@assert \separated(x69+0,x66+0);*/
int x73 = x70 * x71;
/*@
loop invariant 0<=x81<=x73;
loop invariant (\forall int x82; (((0<=x82) &&
(x82<x81)) ==> (x69[x82]==(x63[x82] || x66[x82]))));
loop assigns x81, x69[(0..x73-1)];
loop variant x73-x81;
*/
for(int x81=0; x81 < x73; x81++) {
int x94 = x63[x81];
int x95 = x66[x81];
int x96 = x94 || x95;
x69[x81] = x96;
/*@assert \separated(x69+x81,x63+x81);*/
/*@assert \separated(x69+x81,x66+x81);*/
}
}
| true | 33 | 33 |
void add(int * x63, int x64, int x65, int * x66, int x67, int x68, int * x69, int x70, int x71) {
/*@assert \separated(x69+0,x63+0);*/
/*@assert \separated(x69+0,x66+0);*/
int x73 = x70 * x71;
/*@
loop invariant 0<=x81<=x73;
loop invariant (\forall int x82; (((0<=x82) &&
(x82<x81)) ==> (x69[x82]==(x63[x82] || x66[x82]))));
loop assigns x81, x69[(0..x73-1)];
loop variant x73-x81;
*/
for(int x81=0; x81 < x73; x81++) {
int x94 = x63[x81];
int x95 = x66[x81];
int x96 = x94 || x95;
x69[x81] = x96;
/*@assert \separated(x69+x81,x63+x81);*/
/*@assert \separated(x69+x81,x66+x81);*/
}
}
|
#include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/
int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
}
/*@ predicate inv_matrix_Boolean(int * x26, integer x27, integer x28) = (((((x27<100) &&
(x28<100)) &&
(0<x27)) &&
(0<x28)) &&
(((x27*x28)>0) &&
\valid(x26+(0..(x27*x28)-1))));*/
/*@
requires (((((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71)) &&
((x70==x64) &&
(x71==x65))) &&
((x70==x67) &&
(x71==x68))) &&
((\forall int x121; (\forall int x122; ((((0<=x121) &&
(x121<(x70*x71))) &&
((0<=x122) &&
(x122<(x64*x65)))) ==> \separated(x69+x121,x63+x122)))) &&
(\forall int x136; (\forall int x137; ((((0<=x136) &&
(x136<(x70*x71))) &&
((0<=x137) &&
(x137<(x67*x68)))) ==> \separated(x69+x136,x66+x137))))));
ensures (((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71)) &&
(\forall int x157; (((0<=x157) &&
(x157<(x70*x71))) ==> (x69[x157]==(x63[x157] || x66[x157])))));
*/
|
|
frama_c_files_v2/test_frama_c_2218.c
|
#include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/
int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
}
/*@ predicate inv_matrix_Boolean(int * x26, integer x27, integer x28) = (((((x27<100) &&
(x28<100)) &&
(0<x27)) &&
(0<x28)) &&
(((x27*x28)>0) &&
\valid(x26+(0..(x27*x28)-1))));*/
/*@
requires (((((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71)) &&
((x70==x64) &&
(x71==x65))) &&
((x70==x67) &&
(x71==x68))) &&
((\forall int x121; (\forall int x122; ((((0<=x121) &&
(x121<(x70*x71))) &&
((0<=x122) &&
(x122<(x64*x65)))) ==> \separated(x69+x121,x63+x122)))) &&
(\forall int x136; (\forall int x137; ((((0<=x136) &&
(x136<(x70*x71))) &&
((0<=x137) &&
(x137<(x67*x68)))) ==> \separated(x69+x136,x66+x137))))));
ensures (((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71)) &&
(\forall int x157; (((0<=x157) &&
(x157<(x70*x71))) ==> (x69[x157]==(x63[x157] || x66[x157])))));
*/
void add(int * x63, int x64, int x65, int * x66, int x67, int x68, int * x69, int x70, int x71) {
/*@assert \separated(x69+0,x63+0);*/
/*@assert \separated(x69+0,x66+0);*/
int x73 = x70 * x71;
/*@
loop invariant 0<=x81<=x73;
loop invariant (\forall int x82; (((0<=x82) &&
(x82<x81)) ==> (x69[x82]==(x63[x82] || x66[x82]))));
loop assigns x81, x69[(0..x73-1)];
loop variant x73-x81;
*/
for(int x81=0; x81 < x73; x81++) {
int x94 = x63[x81];
int x95 = x66[x81];
int x96 = x94 || x95;
x69[x81] = x96;
/*@assert \separated(x69+x81,x63+x81);*/
/*@assert \separated(x69+x81,x66+x81);*/
}
}
/*@
requires (((inv_matrix_Boolean(x172,x173,x174) &&
inv_matrix_Boolean(x175,x176,x177)) &&
((x176==x173) &&
(x177==x174))) &&
(\forall int x213; (\forall int x214; ((((0<=x213) &&
(x213<(x176*x177))) &&
((0<=x214) &&
(x214<(x173*x174)))) ==> \separated(x175+x213,x172+x214)))));
ensures (((inv_matrix_Boolean(x172,x173,x174) &&
inv_matrix_Boolean(x175,x176,x177)) &&
(\forall int x233; (((0<=x233) &&
(x233<(x176*x177))) ==> (x175[x233]==(x171 &&
x172[x233]))))) &&
((x171==\false) ==> (\forall int x247; (0<=x247<x176) ==> (\forall int x250; (0<=x250<x177) ==> (x175[((x247*x177)+x250)]==\false)))));
*/
void scalar_mult(int x171, int * x172, int x173, int x174, int * x175, int x176, int x177) {
/*@assert \separated(x175+0,x172+0);*/
int x179 = x176 * x177;
/*@
loop invariant 0<=x184<=x179;
loop invariant (\forall int x185; (((0<=x185) &&
(x185<x184)) ==> (x175[x185]==(x171 &&
x172[x185]))));
loop assigns x184, x175[(0..x179-1)];
loop variant x179-x184;
*/
for(int x184=0; x184 < x179; x184++) {
int x197;
if (x171) {
int x196 = x172[x184];
x197 = x196;
} else {
x197 = 0/*false*/;
}
x175[x184] = x197;
/*@assert \separated(x175+x184,x172+x184);*/
}
}
|
#include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/
int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
}
/*@ predicate inv_matrix_Boolean(int * x26, integer x27, integer x28) = (((((x27<100) &&
(x28<100)) &&
(0<x27)) &&
(0<x28)) &&
(((x27*x28)>0) &&
\valid(x26+(0..(x27*x28)-1))));*/
/*@
requires (((((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71)) &&
((x70==x64) &&
(x71==x65))) &&
((x70==x67) &&
(x71==x68))) &&
((\forall int x121; (\forall int x122; ((((0<=x121) &&
(x121<(x70*x71))) &&
((0<=x122) &&
(x122<(x64*x65)))) ==> \separated(x69+x121,x63+x122)))) &&
(\forall int x136; (\forall int x137; ((((0<=x136) &&
(x136<(x70*x71))) &&
((0<=x137) &&
(x137<(x67*x68)))) ==> \separated(x69+x136,x66+x137))))));
ensures (((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71)) &&
(\forall int x157; (((0<=x157) &&
(x157<(x70*x71))) ==> (x69[x157]==(x63[x157] || x66[x157])))));
*/
void add(int * x63, int x64, int x65, int * x66, int x67, int x68, int * x69, int x70, int x71) {
/*@assert \separated(x69+0,x63+0);*/
/*@assert \separated(x69+0,x66+0);*/
int x73 = x70 * x71;
/*@
loop invariant 0<=x81<=x73;
loop invariant (\forall int x82; (((0<=x82) &&
(x82<x81)) ==> (x69[x82]==(x63[x82] || x66[x82]))));
loop assigns x81, x69[(0..x73-1)];
loop variant x73-x81;
*/
for(int x81=0; x81 < x73; x81++) {
int x94 = x63[x81];
int x95 = x66[x81];
int x96 = x94 || x95;
x69[x81] = x96;
/*@assert \separated(x69+x81,x63+x81);*/
/*@assert \separated(x69+x81,x66+x81);*/
}
}
/*@
requires (((inv_matrix_Boolean(x172,x173,x174) &&
inv_matrix_Boolean(x175,x176,x177)) &&
((x176==x173) &&
(x177==x174))) &&
(\forall int x213; (\forall int x214; ((((0<=x213) &&
(x213<(x176*x177))) &&
((0<=x214) &&
(x214<(x173*x174)))) ==> \separated(x175+x213,x172+x214)))));
ensures (((inv_matrix_Boolean(x172,x173,x174) &&
inv_matrix_Boolean(x175,x176,x177)) &&
(\forall int x233; (((0<=x233) &&
(x233<(x176*x177))) ==> (x175[x233]==(x171 &&
x172[x233]))))) &&
((x171==\false) ==> (\forall int x247; (0<=x247<x176) ==> (\forall int x250; (0<=x250<x177) ==> (x175[((x247*x177)+x250)]==\false)))));
*/
|
void scalar_mult(int x171, int * x172, int x173, int x174, int * x175, int x176, int x177) {
/*@assert \separated(x175+0,x172+0);*/
int x179 = x176 * x177;
/*@
loop invariant 0<=x184<=x179;
loop invariant (\forall int x185; (((0<=x185) &&
(x185<x184)) ==> (x175[x185]==(x171 &&
x172[x185]))));
loop assigns x184, x175[(0..x179-1)];
loop variant x179-x184;
*/
for(int x184=0; x184 < x179; x184++) {
int x197;
if (x171) {
int x196 = x172[x184];
x197 = x196;
} else {
x197 = 0/*false*/;
}
x175[x184] = x197;
/*@assert \separated(x175+x184,x172+x184);*/
}
}
| true | 54 | 54 |
void scalar_mult(int x171, int * x172, int x173, int x174, int * x175, int x176, int x177) {
/*@assert \separated(x175+0,x172+0);*/
int x179 = x176 * x177;
/*@
loop invariant 0<=x184<=x179;
loop invariant (\forall int x185; (((0<=x185) &&
(x185<x184)) ==> (x175[x185]==(x171 &&
x172[x185]))));
loop assigns x184, x175[(0..x179-1)];
loop variant x179-x184;
*/
for(int x184=0; x184 < x179; x184++) {
int x197;
if (x171) {
int x196 = x172[x184];
x197 = x196;
} else {
x197 = 0/*false*/;
}
x175[x184] = x197;
/*@assert \separated(x175+x184,x172+x184);*/
}
}
|
#include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/
int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
}
/*@ predicate inv_matrix_Boolean(int * x26, integer x27, integer x28) = (((((x27<100) &&
(x28<100)) &&
(0<x27)) &&
(0<x28)) &&
(((x27*x28)>0) &&
\valid(x26+(0..(x27*x28)-1))));*/
/*@
requires (((((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71)) &&
((x70==x64) &&
(x71==x65))) &&
((x70==x67) &&
(x71==x68))) &&
((\forall int x121; (\forall int x122; ((((0<=x121) &&
(x121<(x70*x71))) &&
((0<=x122) &&
(x122<(x64*x65)))) ==> \separated(x69+x121,x63+x122)))) &&
(\forall int x136; (\forall int x137; ((((0<=x136) &&
(x136<(x70*x71))) &&
((0<=x137) &&
(x137<(x67*x68)))) ==> \separated(x69+x136,x66+x137))))));
ensures (((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71)) &&
(\forall int x157; (((0<=x157) &&
(x157<(x70*x71))) ==> (x69[x157]==(x63[x157] || x66[x157])))));
*/
void add(int * x63, int x64, int x65, int * x66, int x67, int x68, int * x69, int x70, int x71) {
/*@assert \separated(x69+0,x63+0);*/
/*@assert \separated(x69+0,x66+0);*/
int x73 = x70 * x71;
/*@
loop invariant 0<=x81<=x73;
loop invariant (\forall int x82; (((0<=x82) &&
(x82<x81)) ==> (x69[x82]==(x63[x82] || x66[x82]))));
loop assigns x81, x69[(0..x73-1)];
loop variant x73-x81;
*/
for(int x81=0; x81 < x73; x81++) {
int x94 = x63[x81];
int x95 = x66[x81];
int x96 = x94 || x95;
x69[x81] = x96;
/*@assert \separated(x69+x81,x63+x81);*/
/*@assert \separated(x69+x81,x66+x81);*/
}
}
/*@
requires (((inv_matrix_Boolean(x172,x173,x174) &&
inv_matrix_Boolean(x175,x176,x177)) &&
((x176==x173) &&
(x177==x174))) &&
(\forall int x213; (\forall int x214; ((((0<=x213) &&
(x213<(x176*x177))) &&
((0<=x214) &&
(x214<(x173*x174)))) ==> \separated(x175+x213,x172+x214)))));
ensures (((inv_matrix_Boolean(x172,x173,x174) &&
inv_matrix_Boolean(x175,x176,x177)) &&
(\forall int x233; (((0<=x233) &&
(x233<(x176*x177))) ==> (x175[x233]==(x171 &&
x172[x233]))))) &&
((x171==\false) ==> (\forall int x247; (0<=x247<x176) ==> (\forall int x250; (0<=x250<x177) ==> (x175[((x247*x177)+x250)]==\false)))));
*/
|
|
frama_c_files_v2/test_frama_c_1640.c
|
//binary search
/*@
requires n>0;
requires \valid_read(arr+(0..n-1));
requires val>0;
behavior notfound:
assumes \forall integer nf;
0<=nf<n ==> arr[nf]!= val;
ensures \result == 0;
behavior found:
assumes \exists integer f;
0<=f<n && arr[f]==val;
ensures \result == 1;
complete behaviors;
disjoint behaviors;
*/
int Linear(int arr[], int n, int val){
/*@
loop invariant 0<=i<=n;
loop invariant \forall integer k;
0<=k<i ==> arr[k]!=val;
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++){
if(val==arr[i]){
return 1;
}
}
return 0;
}
|
/*@
requires n>0;
requires \valid_read(arr+(0..n-1));
requires val>0;
behavior notfound:
assumes \forall integer nf;
0<=nf<n ==> arr[nf]!= val;
ensures \result == 0;
behavior found:
assumes \exists integer f;
0<=f<n && arr[f]==val;
ensures \result == 1;
complete behaviors;
disjoint behaviors;
*/
|
int Linear(int arr[], int n, int val){
/*@
loop invariant 0<=i<=n;
loop invariant \forall integer k;
0<=k<i ==> arr[k]!=val;
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++){
if(val==arr[i]){
return 1;
}
}
return 0;
}
| true | 15 | 15 |
int Linear(int arr[], int n, int val){
/*@
loop invariant 0<=i<=n;
loop invariant \forall integer k;
0<=k<i ==> arr[k]!=val;
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++){
if(val==arr[i]){
return 1;
}
}
return 0;
}
|
/*@
requires n>0;
requires \valid_read(arr+(0..n-1));
requires val>0;
behavior notfound:
assumes \forall integer nf;
0<=nf<n ==> arr[nf]!= val;
ensures \result == 0;
behavior found:
assumes \exists integer f;
0<=f<n && arr[f]==val;
ensures \result == 1;
complete behaviors;
disjoint behaviors;
*/
|
|
frama_c_files_v2/test_frama_c_2195.c
|
/*@
requires \valid(a + (0..n-1));
assigns a[0..n]; // should be a[0..n-1]
*/
void foo(int* a, unsigned int n)
{
/*@
loop invariant 0 <= i <= n;
loop assigns i, a[0..n]; // should be a[0..n-1];
loop variant n-i;
*/
for(unsigned int i = 0; i < n; ++i)
a[i] = 0;
}
|
/*@
requires \valid(a + (0..n-1));
assigns a[0..n]; // should be a[0..n-1]
*/
|
void foo(int* a, unsigned int n)
{
/*@
loop invariant 0 <= i <= n;
loop assigns i, a[0..n]; // should be a[0..n-1];
loop variant n-i;
*/
for(unsigned int i = 0; i < n; ++i)
a[i] = 0;
}
| true | 11 | 11 |
void foo(int* a, unsigned int n)
{
/*@
loop invariant 0 <= i <= n;
loop assigns i, a[0..n]; // should be a[0..n-1];
loop variant n-i;
*/
for(unsigned int i = 0; i < n; ++i)
a[i] = 0;
}
|
/*@
requires \valid(a + (0..n-1));
assigns a[0..n]; // should be a[0..n-1]
*/
|
|
frama_c_files_v2/test_frama_c_1519.c
|
#include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/
int matcher_a_end(char * x0) {
int x2 = 0/*false*/;
int x3 = 1/*true*/;
char *x4 = x0;
/*@
loop invariant ((strlen(x4)>=0) &&
\valid(x4+(0..strlen(x4))));
loop assigns x2, x3, x4;
loop variant ((strlen(x4)+((x2) ? (0) : (1)))+((x3) ? (1) : (0)));
*/
for (;;) {
int x5 = x2;
int x9;
if (x5) {
x9 = 0/*false*/;
} else {
int x7 = x3;
x9 = x7;
}
if (!x9) break;
char *x11 = x4;
char x12 = x11[0];
int x13 = x12 == '\0';
int x16;
if (x13) {
x16 = 0/*false*/;
} else {
int x15 = 'a' == x12;
x16 = x15;
}
int x20;
if (x16) {
char *x17 = x11+1;
char x18 = x17[0];
int x19 = x18 == '\0';
x20 = x19;
} else {
x20 = 0/*false*/;
}
x2 = x20;
int x22 = x2;
if (x22) {
} else {
int x14 = !x13;
x3 = x14;
int x25 = x3;
if (x25) {
char *x17 = x11+1;
x4 = x17;
} else {
}
}
}
int x56 = x2;
return x56;
}
|
#include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/
|
int matcher_a_end(char * x0) {
int x2 = 0/*false*/;
int x3 = 1/*true*/;
char *x4 = x0;
/*@
loop invariant ((strlen(x4)>=0) &&
\valid(x4+(0..strlen(x4))));
loop assigns x2, x3, x4;
loop variant ((strlen(x4)+((x2) ? (0) : (1)))+((x3) ? (1) : (0)));
*/
for (;;) {
int x5 = x2;
int x9;
if (x5) {
x9 = 0/*false*/;
} else {
int x7 = x3;
x9 = x7;
}
if (!x9) break;
char *x11 = x4;
char x12 = x11[0];
int x13 = x12 == '\0';
int x16;
if (x13) {
x16 = 0/*false*/;
} else {
int x15 = 'a' == x12;
x16 = x15;
}
int x20;
if (x16) {
char *x17 = x11+1;
char x18 = x17[0];
int x19 = x18 == '\0';
x20 = x19;
} else {
x20 = 0/*false*/;
}
x2 = x20;
int x22 = x2;
if (x22) {
} else {
int x14 = !x13;
x3 = x14;
int x25 = x3;
if (x25) {
char *x17 = x11+1;
x4 = x17;
} else {
}
}
}
int x56 = x2;
return x56;
}
| true | 15 | 15 |
int matcher_a_end(char * x0) {
int x2 = 0/*false*/;
int x3 = 1/*true*/;
char *x4 = x0;
/*@
loop invariant ((strlen(x4)>=0) &&
\valid(x4+(0..strlen(x4))));
loop assigns x2, x3, x4;
loop variant ((strlen(x4)+((x2) ? (0) : (1)))+((x3) ? (1) : (0)));
*/
for (;;) {
int x5 = x2;
int x9;
if (x5) {
x9 = 0/*false*/;
} else {
int x7 = x3;
x9 = x7;
}
if (!x9) break;
char *x11 = x4;
char x12 = x11[0];
int x13 = x12 == '\0';
int x16;
if (x13) {
x16 = 0/*false*/;
} else {
int x15 = 'a' == x12;
x16 = x15;
}
int x20;
if (x16) {
char *x17 = x11+1;
char x18 = x17[0];
int x19 = x18 == '\0';
x20 = x19;
} else {
x20 = 0/*false*/;
}
x2 = x20;
int x22 = x2;
if (x22) {
} else {
int x14 = !x13;
x3 = x14;
int x25 = x3;
if (x25) {
char *x17 = x11+1;
x4 = x17;
} else {
}
}
}
int x56 = x2;
return x56;
}
|
#include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/
|
|
frama_c_files_v2/test_frama_c_442.c
|
/*@
requires 0<=first<=180 && 0<=second<=180;
ensures \result + first + second == 180;
*/
int last_angle(int first,int second){
return 180 - first - second;
}
|
/*@
requires 0<=first<=180 && 0<=second<=180;
ensures \result + first + second == 180;
*/
|
int last_angle(int first,int second){
return 180 - first - second;
}
| true | 6 | 6 |
int last_angle(int first,int second){
return 180 - first - second;
}
|
/*@
requires 0<=first<=180 && 0<=second<=180;
ensures \result + first + second == 180;
*/
|
|
frama_c_files_v2/test_frama_c_1143.c
|
#include <limits.h>
/*@
requires (x0<INT_MAX);
assigns \nothing;
ensures (\result>x0);
*/
int inc(int x0) {
int x2 = x0 + 1;
return x2;
}
|
#include <limits.h>
/*@
requires (x0<INT_MAX);
assigns \nothing;
ensures (\result>x0);
*/
|
int inc(int x0) {
int x2 = x0 + 1;
return x2;
}
| true | 5 | 5 |
int inc(int x0) {
int x2 = x0 + 1;
return x2;
}
|
#include <limits.h>
/*@
requires (x0<INT_MAX);
assigns \nothing;
ensures (\result>x0);
*/
|
|
frama_c_files_v2/test_frama_c_1091.c
|
#include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/
int matcher_a(char * x0) {
int x2 = 0/*false*/;
int x3 = 1/*true*/;
char *x4 = x0;
/*@
loop invariant ((strlen(x4)>=0) &&
\valid(x4+(0..strlen(x4))));
loop assigns x2, x3, x4;
loop variant ((strlen(x4)+((x2) ? (0) : (1)))+((x3) ? (1) : (0)));
*/
for (;;) {
int x5 = x2;
int x9;
if (x5) {
x9 = 0/*false*/;
} else {
int x7 = x3;
x9 = x7;
}
if (!x9) break;
char *x11 = x4;
char x12 = x11[0];
int x13 = x12 == '\0';
int x16;
if (x13) {
x16 = 0/*false*/;
} else {
int x15 = 'a' == x12;
x16 = x15;
}
int x18;
if (x16) {
x18 = 1/*true*/;
} else {
x18 = 0/*false*/;
}
x2 = x18;
int x20 = x2;
if (x20) {
} else {
int x14 = !x13;
x3 = x14;
int x23 = x3;
if (x23) {
char *x17 = x11+1;
x4 = x17;
} else {
}
}
}
int x54 = x2;
return x54;
}
|
#include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/
|
int matcher_a(char * x0) {
int x2 = 0/*false*/;
int x3 = 1/*true*/;
char *x4 = x0;
/*@
loop invariant ((strlen(x4)>=0) &&
\valid(x4+(0..strlen(x4))));
loop assigns x2, x3, x4;
loop variant ((strlen(x4)+((x2) ? (0) : (1)))+((x3) ? (1) : (0)));
*/
for (;;) {
int x5 = x2;
int x9;
if (x5) {
x9 = 0/*false*/;
} else {
int x7 = x3;
x9 = x7;
}
if (!x9) break;
char *x11 = x4;
char x12 = x11[0];
int x13 = x12 == '\0';
int x16;
if (x13) {
x16 = 0/*false*/;
} else {
int x15 = 'a' == x12;
x16 = x15;
}
int x18;
if (x16) {
x18 = 1/*true*/;
} else {
x18 = 0/*false*/;
}
x2 = x18;
int x20 = x2;
if (x20) {
} else {
int x14 = !x13;
x3 = x14;
int x23 = x3;
if (x23) {
char *x17 = x11+1;
x4 = x17;
} else {
}
}
}
int x54 = x2;
return x54;
}
| true | 14 | 14 |
int matcher_a(char * x0) {
int x2 = 0/*false*/;
int x3 = 1/*true*/;
char *x4 = x0;
/*@
loop invariant ((strlen(x4)>=0) &&
\valid(x4+(0..strlen(x4))));
loop assigns x2, x3, x4;
loop variant ((strlen(x4)+((x2) ? (0) : (1)))+((x3) ? (1) : (0)));
*/
for (;;) {
int x5 = x2;
int x9;
if (x5) {
x9 = 0/*false*/;
} else {
int x7 = x3;
x9 = x7;
}
if (!x9) break;
char *x11 = x4;
char x12 = x11[0];
int x13 = x12 == '\0';
int x16;
if (x13) {
x16 = 0/*false*/;
} else {
int x15 = 'a' == x12;
x16 = x15;
}
int x18;
if (x16) {
x18 = 1/*true*/;
} else {
x18 = 0/*false*/;
}
x2 = x18;
int x20 = x2;
if (x20) {
} else {
int x14 = !x13;
x3 = x14;
int x23 = x3;
if (x23) {
char *x17 = x11+1;
x4 = x17;
} else {
}
}
}
int x54 = x2;
return x54;
}
|
#include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/
|
|
frama_c_files_v2/test_frama_c_1587.c
|
#include <stdio.h>
/*@ requires a >= 0 && b > 0;
@ requires \valid(r);
@ assigns *r;
@ ensures a == b * \result + *r;
*/
int idiv(int a, int b, int *r) {
int q = 0;
int p = a;
/*@ assert a == b * q + p;*/
/*@ loop invariant a == b * q + p;
@ loop assigns q, p;
@ loop variant p;
*/
while (p >= b) {
q++;
p -= b;
}
*r = p;
return q;
}
/*
int main(int argc, char** argv) {
int r = 0;
int q = idiv(5, 2, &r);
printf("q=%d, r=%d\n", q,r );
return 0;
}*/
|
#include <stdio.h>
/*@ requires a >= 0 && b > 0;
@ requires \valid(r);
@ assigns *r;
@ ensures a == b * \result + *r;
*/
|
int idiv(int a, int b, int *r) {
int q = 0;
int p = a;
/*@ assert a == b * q + p;*/
/*@ loop invariant a == b * q + p;
@ loop assigns q, p;
@ loop variant p;
*/
while (p >= b) {
q++;
p -= b;
}
*r = p;
return q;
}
| true | 15 | 15 |
int idiv(int a, int b, int *r) {
int q = 0;
int p = a;
/*@ assert a == b * q + p;*/
/*@ loop invariant a == b * q + p;
@ loop assigns q, p;
@ loop variant p;
*/
while (p >= b) {
q++;
p -= b;
}
*r = p;
return q;
}
|
#include <stdio.h>
/*@ requires a >= 0 && b > 0;
@ requires \valid(r);
@ assigns *r;
@ ensures a == b * \result + *r;
*/
|
|
frama_c_files_v2/test_frama_c_1041.c
|
/* run.config
OPT: -wp-no-print -wp-rte
*/
/* run.config_qualif
OPT: -then -wp-rte -wp
*/
/* ************/
/* Solution de TP donné par Julien à L'IFIPS */
/* ************/
/*
Questions:
1. Informellement, que calcule cette fonction?
2. Donner une spécification en ACSL de cette fonction.
3. Prouver cette fonction avec WP et Alt-Ergo. La preuve doit inclure la
terminaison et l'absence d'erreur à l'exécution.
*/
/*@ requires len > 0;
@ requires \valid(a+(0..len-1));
@ ensures 0 <= \result < len;
@ ensures \forall integer i; 0 <= i < len ==> a[i] <= a[\result];
@ assigns \nothing; */
int exo1(int *a, int len) {
int i = 0, j = len - 1;
/*@ loop invariant 0 <= i <= j < len;
@ loop invariant
@ \forall integer k;
@ (0 <= k < i || j < k < len)
@ ==> (a[k] <= a[i] || a[k] <= a[j]);
@ loop assigns i, j;
@ loop variant j - i; */
while (i < j)
if (a[i] <= a[j]) i++;
else j--;
return i;
}
|
/*@ requires len > 0;
@ requires \valid(a+(0..len-1));
@ ensures 0 <= \result < len;
@ ensures \forall integer i; 0 <= i < len ==> a[i] <= a[\result];
@ assigns \nothing; */
|
int exo1(int *a, int len) {
int i = 0, j = len - 1;
/*@ loop invariant 0 <= i <= j < len;
@ loop invariant
@ \forall integer k;
@ (0 <= k < i || j < k < len)
@ ==> (a[k] <= a[i] || a[k] <= a[j]);
@ loop assigns i, j;
@ loop variant j - i; */
while (i < j)
if (a[i] <= a[j]) i++;
else j--;
return i;
}
| true | 17 | 17 |
int exo1(int *a, int len) {
int i = 0, j = len - 1;
/*@ loop invariant 0 <= i <= j < len;
@ loop invariant
@ \forall integer k;
@ (0 <= k < i || j < k < len)
@ ==> (a[k] <= a[i] || a[k] <= a[j]);
@ loop assigns i, j;
@ loop variant j - i; */
while (i < j)
if (a[i] <= a[j]) i++;
else j--;
return i;
}
|
/*@ requires len > 0;
@ requires \valid(a+(0..len-1));
@ ensures 0 <= \result < len;
@ ensures \forall integer i; 0 <= i < len ==> a[i] <= a[\result];
@ assigns \nothing; */
|
|
frama_c_files_v2/test_frama_c_1037.c
|
#include <limits.h>
#include <string.h>
/*@ logic integer cypher(int x0) = (((x0==26)) ? (0) : ((x0+1)));*/
/*@
requires ((0<=x0) &&
(x0<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == cypher(x0);
*/
int cypher(int x0) {
int x2 = x0 == 26;
int x4;
if (x2) {
x4 = 0;
} else {
int x3 = x0 + 1;
x4 = x3;
}
return x4;
}
/*@ logic integer decypher(int x11) = (((x11==0)) ? (26) : ((x11-1)));*/
/*@
requires ((0<=x11) &&
(x11<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == decypher(x11);
*/
int decypher(int x11) {
int x13 = x11 == 0;
int x15;
if (x13) {
x15 = 26;
} else {
int x14 = x11 - 1;
x15 = x14;
}
return x15;
}
/*@
requires ((((((x25>0) &&
\valid(x22+(0..x25-1))) &&
\valid(x23+(0..x25-1))) &&
\valid(x24+(0..x25-1))) &&
(\forall int x88; (((0<=x88) &&
(x88<x25)) ==> (\forall int x92; (((0<=x92) &&
(x92<x25)) ==> (\forall int x96; (((0<=x96) &&
(x96<x25)) ==> ((\separated(x22+x88,x23+x92) &&
\separated(x22+x88,x24+x96)) &&
\separated(x23+x92,x24+x96))))))))) &&
(\forall int x114; (((0<=x114) &&
(x114<x25)) ==> ((0<=x22[x114]) &&
(x22[x114]<=26)))));
ensures ((((\forall int x126; (((0<=x126) &&
(x126<x25)) ==> (x23[x126]==cypher(x22[x126])))) &&
(\forall int x137; (((0<=x137) &&
(x137<x25)) ==> ((0<=x23[x137]) &&
(x23[x137]<=26))))) &&
(\forall int x149; (((0<=x149) &&
(x149<x25)) ==> (\old(x22[x149])==x22[x149])))) &&
(\forall int x159; (((0<=x159) &&
(x159<x25)) ==> (\old(x24[x159])==x24[x159]))));
assigns x23[(0..x25-1)];
*/
void encode(int * x22, int * x23, int * x24, int x25) {
/*@
loop invariant 0<=x28<=x25;
loop invariant (\forall int x29; (((0<=x29) &&
(x29<x25)) ==> ((0<=x22[x29]) &&
(x22[x29]<=26))));
loop invariant (\forall int x39; (((0<=x39) &&
(x39<x25)) ==> (\at(x22[x39],Pre)==x22[x39])));
loop invariant (\forall int x48; (((0<=x48) &&
(x48<x25)) ==> (\at(x24[x48],Pre)==x24[x48])));
loop invariant (\forall int x57; (((0<=x57) &&
(x57<x28)) ==> (x23[x57]==cypher(x22[x57]))));
loop assigns x28, x23[(0..x25-1)];
loop variant x25-x28;
*/
for(int x28=0; x28 < x25; x28++) {
int x71 = x22[x28];
int x72 = cypher(x71);
x23[x28] = x72;
/*@assert (x23[x28]==x72);*/
}
}
/*@
requires ((((((x172>0) &&
\valid(x169+(0..x172-1))) &&
\valid(x170+(0..x172-1))) &&
\valid(x171+(0..x172-1))) &&
(\forall int x235; (((0<=x235) &&
(x235<x172)) ==> (\forall int x239; (((0<=x239) &&
(x239<x172)) ==> (\forall int x243; (((0<=x243) &&
(x243<x172)) ==> ((\separated(x169+x235,x170+x239) &&
\separated(x169+x235,x171+x243)) &&
\separated(x170+x239,x171+x243))))))))) &&
(\forall int x261; (((0<=x261) &&
(x261<x172)) ==> ((0<=x169[x261]) &&
(x169[x261]<=26)))));
ensures ((((\forall int x273; (((0<=x273) &&
(x273<x172)) ==> (x170[x273]==decypher(x169[x273])))) &&
(\forall int x284; (((0<=x284) &&
(x284<x172)) ==> ((0<=x170[x284]) &&
(x170[x284]<=26))))) &&
(\forall int x296; (((0<=x296) &&
(x296<x172)) ==> (\old(x169[x296])==x169[x296])))) &&
(\forall int x306; (((0<=x306) &&
(x306<x172)) ==> (\old(x171[x306])==x171[x306]))));
assigns x170[(0..x172-1)];
*/
void decode(int * x169, int * x170, int * x171, int x172) {
/*@
loop invariant 0<=x175<=x172;
loop invariant (\forall int x176; (((0<=x176) &&
(x176<x172)) ==> ((0<=x169[x176]) &&
(x169[x176]<=26))));
loop invariant (\forall int x186; (((0<=x186) &&
(x186<x172)) ==> (\at(x169[x186],Pre)==x169[x186])));
loop invariant (\forall int x195; (((0<=x195) &&
(x195<x172)) ==> (\at(x171[x195],Pre)==x171[x195])));
loop invariant (\forall int x204; (((0<=x204) &&
(x204<x175)) ==> (x170[x204]==decypher(x169[x204]))));
loop assigns x175, x170[(0..x172-1)];
loop variant x172-x175;
*/
for(int x175=0; x175 < x172; x175++) {
int x218 = x169[x175];
int x219 = decypher(x218);
x170[x175] = x219;
/*@assert (x170[x175]==x219);*/
}
}
/*@
requires ((((((x319>0) &&
\valid(x316+(0..x319-1))) &&
\valid(x317+(0..x319-1))) &&
\valid(x318+(0..x319-1))) &&
(\forall int x332; (((0<=x332) &&
(x332<x319)) ==> (\forall int x336; (((0<=x336) &&
(x336<x319)) ==> (\forall int x340; (((0<=x340) &&
(x340<x319)) ==> ((\separated(x316+x332,x317+x336) &&
\separated(x316+x332,x318+x340)) &&
\separated(x317+x336,x318+x340))))))))) &&
(\forall int x359; (((0<=x359) &&
(x359<x319)) ==> ((0<=x316[x359]) &&
(x316[x359]<=26)))));
ensures ((\forall int x371; (((0<=x371) &&
(x371<x319)) ==> (x318[x371]==x316[x371]))) &&
(\forall int x381; (((0<=x381) &&
(x381<x319)) ==> (\old(x316[x381])==x316[x381]))));
assigns x317[(0..x319-1)], x318[(0..x319-1)];
*/
void autoencode(int * x316, int * x317, int * x318, int x319) {
encode(x316,x317,x318,x319);
decode(x317,x318,x316,x319);
}
|
#include <limits.h>
#include <string.h>
/*@ logic integer cypher(int x0) = (((x0==26)) ? (0) : ((x0+1)));*/
/*@
requires ((0<=x0) &&
(x0<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == cypher(x0);
*/
int cypher(int x0) {
int x2 = x0 == 26;
int x4;
if (x2) {
x4 = 0;
} else {
int x3 = x0 + 1;
x4 = x3;
}
return x4;
}
/*@ logic integer decypher(int x11) = (((x11==0)) ? (26) : ((x11-1)));*/
/*@
requires ((0<=x11) &&
(x11<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == decypher(x11);
*/
|
int decypher(int x11) {
int x13 = x11 == 0;
int x15;
if (x13) {
x15 = 26;
} else {
int x14 = x11 - 1;
x15 = x14;
}
return x15;
}
| true | 14 | 14 |
int decypher(int x11) {
int x13 = x11 == 0;
int x15;
if (x13) {
x15 = 26;
} else {
int x14 = x11 - 1;
x15 = x14;
}
return x15;
}
|
#include <limits.h>
#include <string.h>
/*@ logic integer cypher(int x0) = (((x0==26)) ? (0) : ((x0+1)));*/
/*@
requires ((0<=x0) &&
(x0<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == cypher(x0);
*/
int cypher(int x0) {
int x2 = x0 == 26;
int x4;
if (x2) {
x4 = 0;
} else {
int x3 = x0 + 1;
x4 = x3;
}
return x4;
}
/*@ logic integer decypher(int x11) = (((x11==0)) ? (26) : ((x11-1)));*/
/*@
requires ((0<=x11) &&
(x11<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == decypher(x11);
*/
|
|
frama_c_files_v2/test_frama_c_479.c
|
#include "string.h"
/*@
requires valid_string(s);
assigns s[0..(strlen(s) - 2)];
ensures strlen(s) ≡ \old(strlen(s));
ensures s ≡ \old(s);
*/
void a(char* s);
/*@
requires valid_string(s);
assigns s[0..strlen(\old(s))];
ensures strlen(s) ≡ strlen(s);
ensures s ≡ \old(s);
*/
void b(char *s) {
int x = 0;
a(s);
//@ assert x ≡ 0;
}
/*@
requires valid_string(s);
assigns s[0..n];
*/
void an(char* s, int n);
/*@
requires valid_string(s);
assigns s[0..n];
*/
void bn(char *s, int n) {
an(s, n);
}
|
#include "string.h"
/*@
requires valid_string(s);
assigns s[0..(strlen(s) - 2)];
ensures strlen(s) ≡ \old(strlen(s));
ensures s ≡ \old(s);
*/
void a(char* s);
/*@
requires valid_string(s);
assigns s[0..strlen(\old(s))];
ensures strlen(s) ≡ strlen(s);
ensures s ≡ \old(s);
*/
|
void b(char *s) {
int x = 0;
a(s);
//@ assert x ≡ 0;
}
| true | 8 | 8 |
void b(char *s) {
int x = 0;
a(s);
//@ assert x ≡ 0;
}
|
#include "string.h"
/*@
requires valid_string(s);
assigns s[0..(strlen(s) - 2)];
ensures strlen(s) ≡ \old(strlen(s));
ensures s ≡ \old(s);
*/
void a(char* s);
/*@
requires valid_string(s);
assigns s[0..strlen(\old(s))];
ensures strlen(s) ≡ strlen(s);
ensures s ≡ \old(s);
*/
|
|
frama_c_files_v2/test_frama_c_479.c
|
#include "string.h"
/*@
requires valid_string(s);
assigns s[0..(strlen(s) - 2)];
ensures strlen(s) ≡ \old(strlen(s));
ensures s ≡ \old(s);
*/
void a(char* s);
/*@
requires valid_string(s);
assigns s[0..strlen(\old(s))];
ensures strlen(s) ≡ strlen(s);
ensures s ≡ \old(s);
*/
void b(char *s) {
int x = 0;
a(s);
//@ assert x ≡ 0;
}
/*@
requires valid_string(s);
assigns s[0..n];
*/
void an(char* s, int n);
/*@
requires valid_string(s);
assigns s[0..n];
*/
void bn(char *s, int n) {
an(s, n);
}
|
#include "string.h"
/*@
requires valid_string(s);
assigns s[0..(strlen(s) - 2)];
ensures strlen(s) ≡ \old(strlen(s));
ensures s ≡ \old(s);
*/
void a(char* s);
/*@
requires valid_string(s);
assigns s[0..strlen(\old(s))];
ensures strlen(s) ≡ strlen(s);
ensures s ≡ \old(s);
*/
void b(char *s) {
int x = 0;
a(s);
//@ assert x ≡ 0;
}
/*@
requires valid_string(s);
assigns s[0..n];
*/
void an(char* s, int n);
/*@
requires valid_string(s);
assigns s[0..n];
*/
|
void bn(char *s, int n) {
an(s, n);
}
| true | 13 | 13 |
void bn(char *s, int n) {
an(s, n);
}
|
#include "string.h"
/*@
requires valid_string(s);
assigns s[0..(strlen(s) - 2)];
ensures strlen(s) ≡ \old(strlen(s));
ensures s ≡ \old(s);
*/
void a(char* s);
/*@
requires valid_string(s);
assigns s[0..strlen(\old(s))];
ensures strlen(s) ≡ strlen(s);
ensures s ≡ \old(s);
*/
void b(char *s) {
int x = 0;
a(s);
//@ assert x ≡ 0;
}
/*@
requires valid_string(s);
assigns s[0..n];
*/
void an(char* s, int n);
/*@
requires valid_string(s);
assigns s[0..n];
*/
|
|
frama_c_files_v2/test_frama_c_1751.c
|
/*@ assigns \nothing;
ensures \result == \max(\max(a, b), \max(b, c));
*/
int max3(int a, int b, int c)
{
return a > b ? (a > c ? a : c) : (b > c ? b : c);
}
|
/*@ assigns \nothing;
ensures \result == \max(\max(a, b), \max(b, c));
*/
|
int max3(int a, int b, int c)
{
return a > b ? (a > c ? a : c) : (b > c ? b : c);
}
| true | 9 | 9 |
int max3(int a, int b, int c)
{
return a > b ? (a > c ? a : c) : (b > c ? b : c);
}
|
/*@ assigns \nothing;
ensures \result == \max(\max(a, b), \max(b, c));
*/
|
|
frama_c_files_v2/test_frama_c_837.c
|
#include <stdio.h>
#include <string.h>
#include <limits.h>
/*@ requires N >= 0 && \valid_read(a + (0..N-1));
assigns \nothing;
behavior empty:
assumes N == 0;
ensures \result == 0;
behavior not_empty:
assumes 0 < N;
ensures 0 <= \result < N;
ensures
\forall integer i;
0 <= i < N ==> a[i] <= a[\result];
ensures
\forall integer i;
0 <= i < \result ==> a[i] < a[\result];
complete behaviors;
disjoint behaviors;
*/
int max(int* a, int N)
{
if (N == 0)
{
return 0;
}
int i;
int max = 0;
/*@
loop invariant 0 <= i <= N;
loop invariant 0 <= max < N;
loop invariant
\forall integer k;
0 <= k < i ==> a[k] <= a[max];
loop invariant
\forall integer k;
0 <= k < max ==> a[k] < a[max];
loop assigns max, i;
loop variant N-i;
*/
for (i = 0; i < N; i++)
{
if (a[max] < a[i])
{
max = i;
}
}
return max;
}
int main()
{
int N = 6;
//int* a;
//a = (int*) malloc(N*sizeof(int));
int a[N];
memcpy(a, (int[]) {23, 50, 61, 124, 562, 1000}, sizeof a);
//a = {23, 50, 61, 124, 562, 1000};
//*(a + 0) = 23;
//*(a + 1) = 50;
//*(a + 2) = 61;
//a[3] = 124;
//a[4] = 563;
//a[5] = 1000;
// max from odd numbers
int max_index = max(a, N);
printf("max_from_arr = %i\n", a[max_index]);
return 0;
}
|
#include <stdio.h>
#include <string.h>
#include <limits.h>
/*@ requires N >= 0 && \valid_read(a + (0..N-1));
assigns \nothing;
behavior empty:
assumes N == 0;
ensures \result == 0;
behavior not_empty:
assumes 0 < N;
ensures 0 <= \result < N;
ensures
\forall integer i;
0 <= i < N ==> a[i] <= a[\result];
ensures
\forall integer i;
0 <= i < \result ==> a[i] < a[\result];
complete behaviors;
disjoint behaviors;
*/
|
int max(int* a, int N)
{
if (N == 0)
{
return 0;
}
int i;
int max = 0;
/*@
loop invariant 0 <= i <= N;
loop invariant 0 <= max < N;
loop invariant
\forall integer k;
0 <= k < i ==> a[k] <= a[max];
loop invariant
\forall integer k;
0 <= k < max ==> a[k] < a[max];
loop assigns max, i;
loop variant N-i;
*/
for (i = 0; i < N; i++)
{
if (a[max] < a[i])
{
max = i;
}
}
return max;
}
| true | 26 | 26 |
int max(int* a, int N)
{
if (N == 0)
{
return 0;
}
int i;
int max = 0;
/*@
loop invariant 0 <= i <= N;
loop invariant 0 <= max < N;
loop invariant
\forall integer k;
0 <= k < i ==> a[k] <= a[max];
loop invariant
\forall integer k;
0 <= k < max ==> a[k] < a[max];
loop assigns max, i;
loop variant N-i;
*/
for (i = 0; i < N; i++)
{
if (a[max] < a[i])
{
max = i;
}
}
return max;
}
|
#include <stdio.h>
#include <string.h>
#include <limits.h>
/*@ requires N >= 0 && \valid_read(a + (0..N-1));
assigns \nothing;
behavior empty:
assumes N == 0;
ensures \result == 0;
behavior not_empty:
assumes 0 < N;
ensures 0 <= \result < N;
ensures
\forall integer i;
0 <= i < N ==> a[i] <= a[\result];
ensures
\forall integer i;
0 <= i < \result ==> a[i] < a[\result];
complete behaviors;
disjoint behaviors;
*/
|
|
frama_c_files_v2/test_frama_c_1303.c
|
// __deref_in and deref_out
#pragma JessieIntegerModel(exact)
/*@ requires \valid(ppi) && \valid(ppo) && \valid(*ppi) && \valid(*ppo);
@ assigns **ppo;
@ ensures **ppo == **ppi;
*/
void deref_OutAndIn(int **ppi, int **ppo) {
**ppo = **ppi;
}
void deref_OutAndIn_test()
{
int a = 5;
int b = 0;
int *pb = &b;
int *pa = &a;
deref_OutAndIn(&pa, &pb);
//@ assert *pa == a;
//@ assert *pb == a;
}
|
/*@ requires \valid(ppi) && \valid(ppo) && \valid(*ppi) && \valid(*ppo);
@ assigns **ppo;
@ ensures **ppo == **ppi;
*/
|
void deref_OutAndIn(int **ppi, int **ppo) {
**ppo = **ppi;
}
| true | 8 | 8 |
void deref_OutAndIn(int **ppi, int **ppo) {
**ppo = **ppi;
}
|
/*@ requires \valid(ppi) && \valid(ppo) && \valid(*ppi) && \valid(*ppo);
@ assigns **ppo;
@ ensures **ppo == **ppi;
*/
|
|
frama_c_files_v2/test_frama_c_384.c
|
#include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/
int matcher_ab_dot_star_ab(char * x0) {
int x2 = 0/*false*/;
int x3 = 1/*true*/;
char *x4 = x0;
/*@
loop invariant ((strlen(x4)>=0) &&
\valid(x4+(0..strlen(x4))));
loop assigns x2, x3, x4;
loop variant ((strlen(x4)+((x2) ? (0) : (1)))+((x3) ? (1) : (0)));
*/
for (;;) {
int x5 = x2;
int x9;
if (x5) {
x9 = 0/*false*/;
} else {
int x7 = x3;
x9 = x7;
}
if (!x9) break;
char *x11 = x4;
char x12 = x11[0];
int x13 = x12 == '\0';
int x16;
if (x13) {
x16 = 0/*false*/;
} else {
int x15 = 'a' == x12;
x16 = x15;
}
int x88;
if (x16) {
char *x17 = x11+1;
char x18 = x17[0];
int x19 = x18 == '\0';
int x22;
if (x19) {
x22 = 0/*false*/;
} else {
int x21 = 'b' == x18;
x22 = x21;
}
int x87;
if (x22) {
int x24 = 0/*false*/;
int x25 = 1/*true*/;
char *x23 = x17+1;
char *x26 = x23;
/*@
loop invariant ((strlen(x26)>=0) &&
\valid(x26+(0..strlen(x26))));
loop assigns x24, x25, x26;
loop variant ((strlen(x26)+((x24) ? (0) : (1)))+((x25) ? (1) : (0)));
*/
for (;;) {
int x27 = x24;
int x31;
if (x27) {
x31 = 0/*false*/;
} else {
int x29 = x25;
x31 = x29;
}
if (!x31) break;
char *x33 = x26;
char x34 = x33[0];
int x35 = x34 == '\0';
int x38;
if (x35) {
x38 = 0/*false*/;
} else {
int x37 = 'a' == x34;
x38 = x37;
}
int x47;
if (x38) {
char *x39 = x33+1;
char x40 = x39[0];
int x41 = x40 == '\0';
int x44;
if (x41) {
x44 = 0/*false*/;
} else {
int x43 = 'b' == x40;
x44 = x43;
}
int x46;
if (x44) {
x46 = 1/*true*/;
} else {
x46 = 0/*false*/;
}
x47 = x46;
} else {
x47 = 0/*false*/;
}
x24 = x47;
int x49 = x24;
if (x49) {
} else {
int x36 = !x35;
x25 = x36;
int x52 = x25;
if (x52) {
x25 = 1/*true*/;
char *x39 = x33+1;
x26 = x39;
} else {
}
}
}
int x85 = x24;
x87 = x85;
} else {
x87 = 0/*false*/;
}
x88 = x87;
} else {
x88 = 0/*false*/;
}
x2 = x88;
int x90 = x2;
if (x90) {
} else {
int x14 = !x13;
x3 = x14;
int x93 = x3;
if (x93) {
char *x17 = x11+1;
x4 = x17;
} else {
}
}
}
int x124 = x2;
return x124;
}
|
#include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/
|
int matcher_ab_dot_star_ab(char * x0) {
int x2 = 0/*false*/;
int x3 = 1/*true*/;
char *x4 = x0;
/*@
loop invariant ((strlen(x4)>=0) &&
\valid(x4+(0..strlen(x4))));
loop assigns x2, x3, x4;
loop variant ((strlen(x4)+((x2) ? (0) : (1)))+((x3) ? (1) : (0)));
*/
for (;;) {
int x5 = x2;
int x9;
if (x5) {
x9 = 0/*false*/;
} else {
int x7 = x3;
x9 = x7;
}
if (!x9) break;
char *x11 = x4;
char x12 = x11[0];
int x13 = x12 == '\0';
int x16;
if (x13) {
x16 = 0/*false*/;
} else {
int x15 = 'a' == x12;
x16 = x15;
}
int x88;
if (x16) {
char *x17 = x11+1;
char x18 = x17[0];
int x19 = x18 == '\0';
int x22;
if (x19) {
x22 = 0/*false*/;
} else {
int x21 = 'b' == x18;
x22 = x21;
}
int x87;
if (x22) {
int x24 = 0/*false*/;
int x25 = 1/*true*/;
char *x23 = x17+1;
char *x26 = x23;
/*@
loop invariant ((strlen(x26)>=0) &&
\valid(x26+(0..strlen(x26))));
loop assigns x24, x25, x26;
loop variant ((strlen(x26)+((x24) ? (0) : (1)))+((x25) ? (1) : (0)));
*/
for (;;) {
int x27 = x24;
int x31;
if (x27) {
x31 = 0/*false*/;
} else {
int x29 = x25;
x31 = x29;
}
if (!x31) break;
char *x33 = x26;
char x34 = x33[0];
int x35 = x34 == '\0';
int x38;
if (x35) {
x38 = 0/*false*/;
} else {
int x37 = 'a' == x34;
x38 = x37;
}
int x47;
if (x38) {
char *x39 = x33+1;
char x40 = x39[0];
int x41 = x40 == '\0';
int x44;
if (x41) {
x44 = 0/*false*/;
} else {
int x43 = 'b' == x40;
x44 = x43;
}
int x46;
if (x44) {
x46 = 1/*true*/;
} else {
x46 = 0/*false*/;
}
x47 = x46;
} else {
x47 = 0/*false*/;
}
x24 = x47;
int x49 = x24;
if (x49) {
} else {
int x36 = !x35;
x25 = x36;
int x52 = x25;
if (x52) {
x25 = 1/*true*/;
char *x39 = x33+1;
x26 = x39;
} else {
}
}
}
int x85 = x24;
x87 = x85;
} else {
x87 = 0/*false*/;
}
x88 = x87;
} else {
x88 = 0/*false*/;
}
x2 = x88;
int x90 = x2;
if (x90) {
} else {
int x14 = !x13;
x3 = x14;
int x93 = x3;
if (x93) {
char *x17 = x11+1;
x4 = x17;
} else {
}
}
}
int x124 = x2;
return x124;
}
| true | 39 | 39 |
int matcher_ab_dot_star_ab(char * x0) {
int x2 = 0/*false*/;
int x3 = 1/*true*/;
char *x4 = x0;
/*@
loop invariant ((strlen(x4)>=0) &&
\valid(x4+(0..strlen(x4))));
loop assigns x2, x3, x4;
loop variant ((strlen(x4)+((x2) ? (0) : (1)))+((x3) ? (1) : (0)));
*/
for (;;) {
int x5 = x2;
int x9;
if (x5) {
x9 = 0/*false*/;
} else {
int x7 = x3;
x9 = x7;
}
if (!x9) break;
char *x11 = x4;
char x12 = x11[0];
int x13 = x12 == '\0';
int x16;
if (x13) {
x16 = 0/*false*/;
} else {
int x15 = 'a' == x12;
x16 = x15;
}
int x88;
if (x16) {
char *x17 = x11+1;
char x18 = x17[0];
int x19 = x18 == '\0';
int x22;
if (x19) {
x22 = 0/*false*/;
} else {
int x21 = 'b' == x18;
x22 = x21;
}
int x87;
if (x22) {
int x24 = 0/*false*/;
int x25 = 1/*true*/;
char *x23 = x17+1;
char *x26 = x23;
/*@
loop invariant ((strlen(x26)>=0) &&
\valid(x26+(0..strlen(x26))));
loop assigns x24, x25, x26;
loop variant ((strlen(x26)+((x24) ? (0) : (1)))+((x25) ? (1) : (0)));
*/
for (;;) {
int x27 = x24;
int x31;
if (x27) {
x31 = 0/*false*/;
} else {
int x29 = x25;
x31 = x29;
}
if (!x31) break;
char *x33 = x26;
char x34 = x33[0];
int x35 = x34 == '\0';
int x38;
if (x35) {
x38 = 0/*false*/;
} else {
int x37 = 'a' == x34;
x38 = x37;
}
int x47;
if (x38) {
char *x39 = x33+1;
char x40 = x39[0];
int x41 = x40 == '\0';
int x44;
if (x41) {
x44 = 0/*false*/;
} else {
int x43 = 'b' == x40;
x44 = x43;
}
int x46;
if (x44) {
x46 = 1/*true*/;
} else {
x46 = 0/*false*/;
}
x47 = x46;
} else {
x47 = 0/*false*/;
}
x24 = x47;
int x49 = x24;
if (x49) {
} else {
int x36 = !x35;
x25 = x36;
int x52 = x25;
if (x52) {
x25 = 1/*true*/;
char *x39 = x33+1;
x26 = x39;
} else {
}
}
}
int x85 = x24;
x87 = x85;
} else {
x87 = 0/*false*/;
}
x88 = x87;
} else {
x88 = 0/*false*/;
}
x2 = x88;
int x90 = x2;
if (x90) {
} else {
int x14 = !x13;
x3 = x14;
int x93 = x3;
if (x93) {
char *x17 = x11+1;
x4 = x17;
} else {
}
}
}
int x124 = x2;
return x124;
}
|
#include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/
|
|
frama_c_files_v2/test_frama_c_2282.c
|
/*@
requires n>0;
requires 0<=k<n;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<=k ==>a[k]>=a[i];
*/
void bubbleinnerloop(int a[], int n, int k)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=k;
loop assigns j,a[0..j+1];
loop variant k-j;
*/
for (int j = 0; j < k; j++)
{
if (a[j] > a[j + 1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
|
/*@
requires n>0;
requires 0<=k<n;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<=k ==>a[k]>=a[i];
*/
|
void bubbleinnerloop(int a[], int n, int k)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=k;
loop assigns j,a[0..j+1];
loop variant k-j;
*/
for (int j = 0; j < k; j++)
{
if (a[j] > a[j + 1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
| true | 23 | 23 |
void bubbleinnerloop(int a[], int n, int k)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=k;
loop assigns j,a[0..j+1];
loop variant k-j;
*/
for (int j = 0; j < k; j++)
{
if (a[j] > a[j + 1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
|
/*@
requires n>0;
requires 0<=k<n;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<=k ==>a[k]>=a[i];
*/
|
|
frama_c_files_v2/test_frama_c_794.c
|
#include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int picker_first(int x0) {
return 0;
}
/*@
requires ((x7>0) &&
\valid(x6+(0..x7-1)));
assigns \nothing;
*/
int pick_first_element(int * x6, int x7) {
int x9 = picker_first(x7);
int x10 = x6[x9];
return x10;
}
/*@
requires ((x16>0) &&
\valid(x15+(0..x16-1)));
assigns \nothing;
*/
int pick_first_directly(int * x15, int x16) {
int x18 = x15[0];
return x18;
}
/*@
requires (x23>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x23));
*/
int picker_last(int x23) {
int x25 = x23 - 1;
return x25;
}
/*@
requires ((x31>0) &&
\valid(x30+(0..x31-1)));
assigns \nothing;
*/
int pick_last_element(int * x30, int x31) {
int x33 = picker_last(x31);
int x34 = x30[x33];
return x34;
}
/*@
requires ((x40>0) &&
\valid(x39+(0..x40-1)));
assigns \nothing;
*/
int pick_last_directly(int * x39, int x40) {
int x42 = x40 - 1;
int x43 = x39[x42];
return x43;
}
|
#include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
|
int picker_first(int x0) {
return 0;
}
| true | 4 | 4 |
int picker_first(int x0) {
return 0;
}
|
#include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
|
|
frama_c_files_v2/test_frama_c_794.c
|
#include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int picker_first(int x0) {
return 0;
}
/*@
requires ((x7>0) &&
\valid(x6+(0..x7-1)));
assigns \nothing;
*/
int pick_first_element(int * x6, int x7) {
int x9 = picker_first(x7);
int x10 = x6[x9];
return x10;
}
/*@
requires ((x16>0) &&
\valid(x15+(0..x16-1)));
assigns \nothing;
*/
int pick_first_directly(int * x15, int x16) {
int x18 = x15[0];
return x18;
}
/*@
requires (x23>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x23));
*/
int picker_last(int x23) {
int x25 = x23 - 1;
return x25;
}
/*@
requires ((x31>0) &&
\valid(x30+(0..x31-1)));
assigns \nothing;
*/
int pick_last_element(int * x30, int x31) {
int x33 = picker_last(x31);
int x34 = x30[x33];
return x34;
}
/*@
requires ((x40>0) &&
\valid(x39+(0..x40-1)));
assigns \nothing;
*/
int pick_last_directly(int * x39, int x40) {
int x42 = x40 - 1;
int x43 = x39[x42];
return x43;
}
|
#include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int picker_first(int x0) {
return 0;
}
/*@
requires ((x7>0) &&
\valid(x6+(0..x7-1)));
assigns \nothing;
*/
int pick_first_element(int * x6, int x7) {
int x9 = picker_first(x7);
int x10 = x6[x9];
return x10;
}
/*@
requires ((x16>0) &&
\valid(x15+(0..x16-1)));
assigns \nothing;
*/
|
int pick_first_directly(int * x15, int x16) {
int x18 = x15[0];
return x18;
}
| true | 15 | 15 |
int pick_first_directly(int * x15, int x16) {
int x18 = x15[0];
return x18;
}
|
#include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int picker_first(int x0) {
return 0;
}
/*@
requires ((x7>0) &&
\valid(x6+(0..x7-1)));
assigns \nothing;
*/
int pick_first_element(int * x6, int x7) {
int x9 = picker_first(x7);
int x10 = x6[x9];
return x10;
}
/*@
requires ((x16>0) &&
\valid(x15+(0..x16-1)));
assigns \nothing;
*/
|
|
frama_c_files_v2/test_frama_c_794.c
|
#include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int picker_first(int x0) {
return 0;
}
/*@
requires ((x7>0) &&
\valid(x6+(0..x7-1)));
assigns \nothing;
*/
int pick_first_element(int * x6, int x7) {
int x9 = picker_first(x7);
int x10 = x6[x9];
return x10;
}
/*@
requires ((x16>0) &&
\valid(x15+(0..x16-1)));
assigns \nothing;
*/
int pick_first_directly(int * x15, int x16) {
int x18 = x15[0];
return x18;
}
/*@
requires (x23>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x23));
*/
int picker_last(int x23) {
int x25 = x23 - 1;
return x25;
}
/*@
requires ((x31>0) &&
\valid(x30+(0..x31-1)));
assigns \nothing;
*/
int pick_last_element(int * x30, int x31) {
int x33 = picker_last(x31);
int x34 = x30[x33];
return x34;
}
/*@
requires ((x40>0) &&
\valid(x39+(0..x40-1)));
assigns \nothing;
*/
int pick_last_directly(int * x39, int x40) {
int x42 = x40 - 1;
int x43 = x39[x42];
return x43;
}
|
#include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int picker_first(int x0) {
return 0;
}
/*@
requires ((x7>0) &&
\valid(x6+(0..x7-1)));
assigns \nothing;
*/
int pick_first_element(int * x6, int x7) {
int x9 = picker_first(x7);
int x10 = x6[x9];
return x10;
}
/*@
requires ((x16>0) &&
\valid(x15+(0..x16-1)));
assigns \nothing;
*/
int pick_first_directly(int * x15, int x16) {
int x18 = x15[0];
return x18;
}
/*@
requires (x23>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x23));
*/
|
int picker_last(int x23) {
int x25 = x23 - 1;
return x25;
}
| true | 20 | 20 |
int picker_last(int x23) {
int x25 = x23 - 1;
return x25;
}
|
#include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int picker_first(int x0) {
return 0;
}
/*@
requires ((x7>0) &&
\valid(x6+(0..x7-1)));
assigns \nothing;
*/
int pick_first_element(int * x6, int x7) {
int x9 = picker_first(x7);
int x10 = x6[x9];
return x10;
}
/*@
requires ((x16>0) &&
\valid(x15+(0..x16-1)));
assigns \nothing;
*/
int pick_first_directly(int * x15, int x16) {
int x18 = x15[0];
return x18;
}
/*@
requires (x23>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x23));
*/
|
|
frama_c_files_v2/test_frama_c_794.c
|
#include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int picker_first(int x0) {
return 0;
}
/*@
requires ((x7>0) &&
\valid(x6+(0..x7-1)));
assigns \nothing;
*/
int pick_first_element(int * x6, int x7) {
int x9 = picker_first(x7);
int x10 = x6[x9];
return x10;
}
/*@
requires ((x16>0) &&
\valid(x15+(0..x16-1)));
assigns \nothing;
*/
int pick_first_directly(int * x15, int x16) {
int x18 = x15[0];
return x18;
}
/*@
requires (x23>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x23));
*/
int picker_last(int x23) {
int x25 = x23 - 1;
return x25;
}
/*@
requires ((x31>0) &&
\valid(x30+(0..x31-1)));
assigns \nothing;
*/
int pick_last_element(int * x30, int x31) {
int x33 = picker_last(x31);
int x34 = x30[x33];
return x34;
}
/*@
requires ((x40>0) &&
\valid(x39+(0..x40-1)));
assigns \nothing;
*/
int pick_last_directly(int * x39, int x40) {
int x42 = x40 - 1;
int x43 = x39[x42];
return x43;
}
|
#include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int picker_first(int x0) {
return 0;
}
/*@
requires ((x7>0) &&
\valid(x6+(0..x7-1)));
assigns \nothing;
*/
int pick_first_element(int * x6, int x7) {
int x9 = picker_first(x7);
int x10 = x6[x9];
return x10;
}
/*@
requires ((x16>0) &&
\valid(x15+(0..x16-1)));
assigns \nothing;
*/
int pick_first_directly(int * x15, int x16) {
int x18 = x15[0];
return x18;
}
/*@
requires (x23>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x23));
*/
int picker_last(int x23) {
int x25 = x23 - 1;
return x25;
}
/*@
requires ((x31>0) &&
\valid(x30+(0..x31-1)));
assigns \nothing;
*/
int pick_last_element(int * x30, int x31) {
int x33 = picker_last(x31);
int x34 = x30[x33];
return x34;
}
/*@
requires ((x40>0) &&
\valid(x39+(0..x40-1)));
assigns \nothing;
*/
|
int pick_last_directly(int * x39, int x40) {
int x42 = x40 - 1;
int x43 = x39[x42];
return x43;
}
| true | 32 | 32 |
int pick_last_directly(int * x39, int x40) {
int x42 = x40 - 1;
int x43 = x39[x42];
return x43;
}
|
#include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int picker_first(int x0) {
return 0;
}
/*@
requires ((x7>0) &&
\valid(x6+(0..x7-1)));
assigns \nothing;
*/
int pick_first_element(int * x6, int x7) {
int x9 = picker_first(x7);
int x10 = x6[x9];
return x10;
}
/*@
requires ((x16>0) &&
\valid(x15+(0..x16-1)));
assigns \nothing;
*/
int pick_first_directly(int * x15, int x16) {
int x18 = x15[0];
return x18;
}
/*@
requires (x23>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x23));
*/
int picker_last(int x23) {
int x25 = x23 - 1;
return x25;
}
/*@
requires ((x31>0) &&
\valid(x30+(0..x31-1)));
assigns \nothing;
*/
int pick_last_element(int * x30, int x31) {
int x33 = picker_last(x31);
int x34 = x30[x33];
return x34;
}
/*@
requires ((x40>0) &&
\valid(x39+(0..x40-1)));
assigns \nothing;
*/
|
|
frama_c_files_v2/test_frama_c_734.c
|
/*@ requires \valid(p) && \valid(q);
ensures \result >= *p && \result >= *q;
ensures \result == *p || \result == *q;
assigns \nothing;
*/
int max_ptr ( int *p, int *q ) {
if ( *p >= *q )
return *p ;
return *q ;
}
|
/*@ requires \valid(p) && \valid(q);
ensures \result >= *p && \result >= *q;
ensures \result == *p || \result == *q;
assigns \nothing;
*/
|
int max_ptr ( int *p, int *q ) {
if ( *p >= *q )
return *p ;
return *q ;
}
| true | 10 | 10 |
int max_ptr ( int *p, int *q ) {
if ( *p >= *q )
return *p ;
return *q ;
}
|
/*@ requires \valid(p) && \valid(q);
ensures \result >= *p && \result >= *q;
ensures \result == *p || \result == *q;
assigns \nothing;
*/
|
|
frama_c_files_v2/test_frama_c_2702.c
|
#include <stdio.h>
#include <stdlib.h>
/*@
requires \valid_read(a + (0..n-1));
requires \valid_read(b + (0..n-1));
requires n >= 0;
assigns \nothing;
behavior if_equal:
assumes \forall integer k; 0<=k<n ==> a[k] == b[k];
ensures \result == 1;
behavior if_not_equal:
assumes \exists integer k;0<=k<n && a[k] != b[k];
ensures \result == 0;
*/
int equal(int *a, int n, int *b){
int i;
i = 0;
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer k; 0 <= k < i ==> a[k] == b[k];
loop assigns i;
loop variant n-i;
*/
for (i = 0; i < n; i++) {
if (a[i] != b[i]){
return 0;
}
}
return 1;
}
int main(){
int a[] = {1,2,3,4,5};
int b[] = {1,2,3,4,5};
equal(a,5,b);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
/*@
requires \valid_read(a + (0..n-1));
requires \valid_read(b + (0..n-1));
requires n >= 0;
assigns \nothing;
behavior if_equal:
assumes \forall integer k; 0<=k<n ==> a[k] == b[k];
ensures \result == 1;
behavior if_not_equal:
assumes \exists integer k;0<=k<n && a[k] != b[k];
ensures \result == 0;
*/
|
int equal(int *a, int n, int *b){
int i;
i = 0;
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer k; 0 <= k < i ==> a[k] == b[k];
loop assigns i;
loop variant n-i;
*/
for (i = 0; i < n; i++) {
if (a[i] != b[i]){
return 0;
}
}
return 1;
}
| true | 19 | 19 |
int equal(int *a, int n, int *b){
int i;
i = 0;
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer k; 0 <= k < i ==> a[k] == b[k];
loop assigns i;
loop variant n-i;
*/
for (i = 0; i < n; i++) {
if (a[i] != b[i]){
return 0;
}
}
return 1;
}
|
#include <stdio.h>
#include <stdlib.h>
/*@
requires \valid_read(a + (0..n-1));
requires \valid_read(b + (0..n-1));
requires n >= 0;
assigns \nothing;
behavior if_equal:
assumes \forall integer k; 0<=k<n ==> a[k] == b[k];
ensures \result == 1;
behavior if_not_equal:
assumes \exists integer k;0<=k<n && a[k] != b[k];
ensures \result == 0;
*/
|
|
frama_c_files_v2/test_frama_c_2882.c
|
/*@ requires n >= 0;
requires \valid(a + (0..n-1));
assigns \nothing;
behavior empty:
assumes n == 0;
ensures \result == 0;
behavior not_empty:
assumes 0 < n;
ensures 0 <= \result < n;
ensures \forall integer i; 0 <= i < n ==> a[i] <= a[\result];
ensures \forall integer i; 0 <= i < \result ==> a[i] < a[\result];
complete behaviors;
disjoint behaviors;
*/
int max_element(int* a, int n)
{
if (n == 0) {
return 0;
}
int max = 0;
/*@
loop invariant 0 <= i <= n;
loop invariant 0 <= max < n;
loop invariant \forall integer k; 0 <= k < i ==> a[k] <= a[max];
loop invariant \forall integer k; 0 <= k < max ==> a[k] < a[max];
loop assigns max, i;
loop variant n-i;
*/
for (int i = 1; i < n; i++) {
if (a[max] < a[i]) {
max = i;
}
}
return max;
}
/*@ requires n > 0;
requires \valid(p + (0..n-1));
assigns \nothing;
ensures \forall integer i; 0 <= i <= n-1 ==> \result >= p[i];
ensures \exists integer e; 0 <= e <= n-1 && \result == p[e];
*/
int max_seq(int* p, int n)
{
return p[max_element(p, n)];
}
|
/*@ requires n >= 0;
requires \valid(a + (0..n-1));
assigns \nothing;
behavior empty:
assumes n == 0;
ensures \result == 0;
behavior not_empty:
assumes 0 < n;
ensures 0 <= \result < n;
ensures \forall integer i; 0 <= i < n ==> a[i] <= a[\result];
ensures \forall integer i; 0 <= i < \result ==> a[i] < a[\result];
complete behaviors;
disjoint behaviors;
*/
|
int max_element(int* a, int n)
{
if (n == 0) {
return 0;
}
int max = 0;
/*@
loop invariant 0 <= i <= n;
loop invariant 0 <= max < n;
loop invariant \forall integer k; 0 <= k < i ==> a[k] <= a[max];
loop invariant \forall integer k; 0 <= k < max ==> a[k] < a[max];
loop assigns max, i;
loop variant n-i;
*/
for (int i = 1; i < n; i++) {
if (a[max] < a[i]) {
max = i;
}
}
return max;
}
| true | 25 | 25 |
int max_element(int* a, int n)
{
if (n == 0) {
return 0;
}
int max = 0;
/*@
loop invariant 0 <= i <= n;
loop invariant 0 <= max < n;
loop invariant \forall integer k; 0 <= k < i ==> a[k] <= a[max];
loop invariant \forall integer k; 0 <= k < max ==> a[k] < a[max];
loop assigns max, i;
loop variant n-i;
*/
for (int i = 1; i < n; i++) {
if (a[max] < a[i]) {
max = i;
}
}
return max;
}
|
/*@ requires n >= 0;
requires \valid(a + (0..n-1));
assigns \nothing;
behavior empty:
assumes n == 0;
ensures \result == 0;
behavior not_empty:
assumes 0 < n;
ensures 0 <= \result < n;
ensures \forall integer i; 0 <= i < n ==> a[i] <= a[\result];
ensures \forall integer i; 0 <= i < \result ==> a[i] < a[\result];
complete behaviors;
disjoint behaviors;
*/
|
|
frama_c_files_v2/test_frama_c_599.c
|
/*@ requires \valid(p) && \valid(q);
requires -10000<*p<10000 && -10000<*q<10000;
assigns *p;
assigns *q;
ensures *p==\old(*q);
ensures *q==\old(*p);
*/
void swap(int *p, int *q){
int sum=*p + *q;
*p=sum-*p;
*q=sum-*p;
}
|
/*@ requires \valid(p) && \valid(q);
requires -10000<*p<10000 && -10000<*q<10000;
assigns *p;
assigns *q;
ensures *p==\old(*q);
ensures *q==\old(*p);
*/
|
void swap(int *p, int *q){
int sum=*p + *q;
*p=sum-*p;
*q=sum-*p;
}
| true | 18 | 18 |
void swap(int *p, int *q){
int sum=*p + *q;
*p=sum-*p;
*q=sum-*p;
}
|
/*@ requires \valid(p) && \valid(q);
requires -10000<*p<10000 && -10000<*q<10000;
assigns *p;
assigns *q;
ensures *p==\old(*q);
ensures *q==\old(*p);
*/
|
|
frama_c_files_v2/test_frama_c_2633.c
|
/*@ requires -2147483648<a+b<2147483647;
ensures \result==a+b;
*/
int add(int a,int b){
return a+b ;
}
|
/*@ requires -2147483648<a+b<2147483647;
ensures \result==a+b;
*/
|
int add(int a,int b){
return a+b ;
}
| true | 5 | 5 |
int add(int a,int b){
return a+b ;
}
|
/*@ requires -2147483648<a+b<2147483647;
ensures \result==a+b;
*/
|
|
frama_c_files_v2/test_frama_c_2493.c
|
/*@
requires n>0;
requires \valid_read(a+(0..n-1));
requires \valid_read(b+(0..n-1));
behavior same:
assumes \forall integer i;
0<=i<n ==> a[i] == b[i];
ensures \result == 1;
behavior not_same:
assumes \exists integer i;
0<=i<n && a[i] != b[i];
ensures \result == 0;
*/
int is_same(int a[],int b[],int n) {
/*@
loop invariant \forall integer j;
0<=j<i ==> a[j] == b[j];
loop invariant 0<=i<=n;
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
if(a[i] != b[i])
return 0;
}
return 1;
}
|
/*@
requires n>0;
requires \valid_read(a+(0..n-1));
requires \valid_read(b+(0..n-1));
behavior same:
assumes \forall integer i;
0<=i<n ==> a[i] == b[i];
ensures \result == 1;
behavior not_same:
assumes \exists integer i;
0<=i<n && a[i] != b[i];
ensures \result == 0;
*/
|
int is_same(int a[],int b[],int n) {
/*@
loop invariant \forall integer j;
0<=j<i ==> a[j] == b[j];
loop invariant 0<=i<=n;
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
if(a[i] != b[i])
return 0;
}
return 1;
}
| true | 14 | 14 |
int is_same(int a[],int b[],int n) {
/*@
loop invariant \forall integer j;
0<=j<i ==> a[j] == b[j];
loop invariant 0<=i<=n;
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
if(a[i] != b[i])
return 0;
}
return 1;
}
|
/*@
requires n>0;
requires \valid_read(a+(0..n-1));
requires \valid_read(b+(0..n-1));
behavior same:
assumes \forall integer i;
0<=i<n ==> a[i] == b[i];
ensures \result == 1;
behavior not_same:
assumes \exists integer i;
0<=i<n && a[i] != b[i];
ensures \result == 0;
*/
|
|
frama_c_files_v2/test_frama_c_2318.c
|
#include "stddef.h"
// the 'pos' pre-condition forbids to pass empty arrays to the function:
// otherwise, we would need to make a special case in the code, as initializing
// 'high' with 'length - 1' is not a good idea if 'length' is 0
/*@
requires pos: length > 0;
requires array: \valid_read(a + (0 .. length - 1));
requires sorted: \forall integer i, j; 0 <= i < j < length ==> a[i] <= a[j];
assigns \nothing;
behavior has_key:
assumes has_key: \exists integer i; 0 <= i < length && a[i] == key;
ensures 0 <= \result < length;
ensures a[\result] == key;
behavior no_key:
assumes no_key: \forall integer i; 0 <= i < length ==> a[i] != key;
ensures \result == length;
complete behaviors;
disjoint behaviors;
*/
size_t binary_search(char* a, size_t length, char key) {
size_t low = 0;
size_t high = length - 1;
/*@ loop invariant bounds: 0 <= low <= high + 1 <= length;
loop invariant small_vals: \forall integer i; 0<=i<low ==> a[i] < key;
loop invariant big_vals:
\forall integer i; high < i < length ==> a[i] > key;
loop assigns high, low;
loop variant high - low;
*/
while (high >= low) {
// There was a quite well known bug in the original version of the code:
// for big arrays, computing (low + high) / 2 might overflow when doing
// the addition, resulting in an incorrect middle index.
size_t middle = low + (high - low) / 2;
if (a[middle] == key) return middle;
if (a[middle] < key) low = middle + 1;
else {
// another subtle issue of the original code: if we're looking for a
// small 'key', 'middle' will eventually become '0', in which case we know
// that we won't find 'key'. And of course, we do not want to compute
// 'middle - 1' there
if (middle == 0) return length;
else high = middle - 1;
}
}
return length;
}
|
#include "stddef.h"
/*@
requires pos: length > 0;
requires array: \valid_read(a + (0 .. length - 1));
requires sorted: \forall integer i, j; 0 <= i < j < length ==> a[i] <= a[j];
assigns \nothing;
behavior has_key:
assumes has_key: \exists integer i; 0 <= i < length && a[i] == key;
ensures 0 <= \result < length;
ensures a[\result] == key;
behavior no_key:
assumes no_key: \forall integer i; 0 <= i < length ==> a[i] != key;
ensures \result == length;
complete behaviors;
disjoint behaviors;
*/
|
size_t binary_search(char* a, size_t length, char key) {
size_t low = 0;
size_t high = length - 1;
/*@ loop invariant bounds: 0 <= low <= high + 1 <= length;
loop invariant small_vals: \forall integer i; 0<=i<low ==> a[i] < key;
loop invariant big_vals:
\forall integer i; high < i < length ==> a[i] > key;
loop assigns high, low;
loop variant high - low;
*/
while (high >= low) {
// There was a quite well known bug in the original version of the code:
// for big arrays, computing (low + high) / 2 might overflow when doing
// the addition, resulting in an incorrect middle index.
size_t middle = low + (high - low) / 2;
if (a[middle] == key) return middle;
if (a[middle] < key) low = middle + 1;
else {
// another subtle issue of the original code: if we're looking for a
// small 'key', 'middle' will eventually become '0', in which case we know
// that we won't find 'key'. And of course, we do not want to compute
// 'middle - 1' there
if (middle == 0) return length;
else high = middle - 1;
}
}
return length;
}
| true | 22 | 22 |
size_t binary_search(char* a, size_t length, char key) {
size_t low = 0;
size_t high = length - 1;
/*@ loop invariant bounds: 0 <= low <= high + 1 <= length;
loop invariant small_vals: \forall integer i; 0<=i<low ==> a[i] < key;
loop invariant big_vals:
\forall integer i; high < i < length ==> a[i] > key;
loop assigns high, low;
loop variant high - low;
*/
while (high >= low) {
// There was a quite well known bug in the original version of the code:
// for big arrays, computing (low + high) / 2 might overflow when doing
// the addition, resulting in an incorrect middle index.
size_t middle = low + (high - low) / 2;
if (a[middle] == key) return middle;
if (a[middle] < key) low = middle + 1;
else {
// another subtle issue of the original code: if we're looking for a
// small 'key', 'middle' will eventually become '0', in which case we know
// that we won't find 'key'. And of course, we do not want to compute
// 'middle - 1' there
if (middle == 0) return length;
else high = middle - 1;
}
}
return length;
}
|
#include "stddef.h"
/*@
requires pos: length > 0;
requires array: \valid_read(a + (0 .. length - 1));
requires sorted: \forall integer i, j; 0 <= i < j < length ==> a[i] <= a[j];
assigns \nothing;
behavior has_key:
assumes has_key: \exists integer i; 0 <= i < length && a[i] == key;
ensures 0 <= \result < length;
ensures a[\result] == key;
behavior no_key:
assumes no_key: \forall integer i; 0 <= i < length ==> a[i] != key;
ensures \result == length;
complete behaviors;
disjoint behaviors;
*/
|
|
frama_c_files_v2/test_frama_c_2852.c
|
#include <limits.h>
/*@
assigns \nothing;
ensures (((\result>=x0) &&
(\result>=x1)) &&
((\result==x0) || (\result==x1)));
*/
int max(int x0, int x1) {
int x3 = x0 > x1;
int x4;
if (x3) {
x4 = x0;
} else {
x4 = x1;
}
return x4;
}
|
#include <limits.h>
/*@
assigns \nothing;
ensures (((\result>=x0) &&
(\result>=x1)) &&
((\result==x0) || (\result==x1)));
*/
|
int max(int x0, int x1) {
int x3 = x0 > x1;
int x4;
if (x3) {
x4 = x0;
} else {
x4 = x1;
}
return x4;
}
| true | 5 | 5 |
int max(int x0, int x1) {
int x3 = x0 > x1;
int x4;
if (x3) {
x4 = x0;
} else {
x4 = x1;
}
return x4;
}
|
#include <limits.h>
/*@
assigns \nothing;
ensures (((\result>=x0) &&
(\result>=x1)) &&
((\result==x0) || (\result==x1)));
*/
|
|
frama_c_files_v2/test_frama_c_2189.c
|
/*@
requires \valid(a) && \valid_read(b);
requires \separated(a, b);
assigns *a;
ensures \old(*b) ==> *a == 0;
ensures ! \old(*b) ==> *a == \old(*a);
ensures *b == \old(*b);
*/
void reset_1st_if_2nd_is_true(int* a, int const* b){
if(*b) *a = 0 ;
}
int main(){
int a = 5 ;
int x = 0 ;
reset_1st_if_2nd_is_true(&a, &x);
//@ assert a == 5 ;
//@ assert x == 0 ;
int const b = 1 ;
reset_1st_if_2nd_is_true(&a, &b);
//@ assert a == 0 ;
//@ assert b == 1 ;
}
|
/*@
requires \valid(a) && \valid_read(b);
requires \separated(a, b);
assigns *a;
ensures \old(*b) ==> *a == 0;
ensures ! \old(*b) ==> *a == \old(*a);
ensures *b == \old(*b);
*/
|
void reset_1st_if_2nd_is_true(int* a, int const* b){
if(*b) *a = 0 ;
}
| true | 8 | 8 |
void reset_1st_if_2nd_is_true(int* a, int const* b){
if(*b) *a = 0 ;
}
|
/*@
requires \valid(a) && \valid_read(b);
requires \separated(a, b);
assigns *a;
ensures \old(*b) ==> *a == 0;
ensures ! \old(*b) ==> *a == \old(*a);
ensures *b == \old(*b);
*/
|
|
frama_c_files_v2/test_frama_c_1648.c
|
// pour INT_MIN
#include <limits.h>
// valeur absolue
/*@
requires a != INT_MIN;
ensures \result >= 0;
ensures \result == a || \result == -a;
*/
int abs(int a)
{
return (a > 0) ? a : -a;
}
|
#include <limits.h>
/*@
requires a != INT_MIN;
ensures \result >= 0;
ensures \result == a || \result == -a;
*/
|
int abs(int a)
{
return (a > 0) ? a : -a;
}
| true | 5 | 5 |
int abs(int a)
{
return (a > 0) ? a : -a;
}
|
#include <limits.h>
/*@
requires a != INT_MIN;
ensures \result >= 0;
ensures \result == a || \result == -a;
*/
|
|
frama_c_files_v2/test_frama_c_1332.c
|
/*@
ensures 0 <= \result <= 1;*/
// */
int loop(unsigned N) {
int c = 0;
unsigned i;
/*@
loop invariant 0 <= c <= 1;
loop invariant i <= N;
loop variant N - i;
*/
for (i = 0; i < N; ++i) {
c = 1 - c;
}
return c;
}
|
/*@
ensures 0 <= \result <= 1;*/
// */
|
int loop(unsigned N) {
int c = 0;
unsigned i;
/*@
loop invariant 0 <= c <= 1;
loop invariant i <= N;
loop variant N - i;
*/
for (i = 0; i < N; ++i) {
c = 1 - c;
}
return c;
}
| true | 10 | 10 |
int loop(unsigned N) {
int c = 0;
unsigned i;
/*@
loop invariant 0 <= c <= 1;
loop invariant i <= N;
loop variant N - i;
*/
for (i = 0; i < N; ++i) {
c = 1 - c;
}
return c;
}
|
/*@
ensures 0 <= \result <= 1;*/
// */
|
|
frama_c_files_v2/test_frama_c_1858.c
|
/*@ axiomatic GCD {
@ logic integer gcd(integer x, integer y);
@ axiom gcd_equal:
@ \forall integer x;
@ (x > 0) ==> gcd(x, x) == x;
axiom gcd_comm:
\forall integer x, integer y;
(x > 0 && y > 0) ==> gcd(x, y) == gcd(y, x);
axiom gcd_add:
\forall integer x, integer y;
(x > 0 && y > 0) ==> gcd(x + y, y) == gcd(x, y);
@ }
*/
/*@ requires a > 0 && b > 0;
@ assigns \nothing;
@ ensures \result == gcd(a, b);
*/
int euclid(int a, int b) {
int x = a;
int y = b;
/*@ loop invariant x > 0 && y > 0;
@ loop invariant gcd(x, y) == gcd(a,b);
@ loop assigns x, y;
@ loop variant \max(x, y);
*/
while (x != y) {
if (x > y) {
x -= y;
} else {
y -= x;
}
}
return x;
}
|
/*@ axiomatic GCD {
@ logic integer gcd(integer x, integer y);
@ axiom gcd_equal:
@ \forall integer x;
@ (x > 0) ==> gcd(x, x) == x;
axiom gcd_comm:
\forall integer x, integer y;
(x > 0 && y > 0) ==> gcd(x, y) == gcd(y, x);
axiom gcd_add:
\forall integer x, integer y;
(x > 0 && y > 0) ==> gcd(x + y, y) == gcd(x, y);
@ }
*/
/*@ requires a > 0 && b > 0;
@ assigns \nothing;
@ ensures \result == gcd(a, b);
*/
|
int euclid(int a, int b) {
int x = a;
int y = b;
/*@ loop invariant x > 0 && y > 0;
@ loop invariant gcd(x, y) == gcd(a,b);
@ loop assigns x, y;
@ loop variant \max(x, y);
*/
while (x != y) {
if (x > y) {
x -= y;
} else {
y -= x;
}
}
return x;
}
| true | 15 | 15 |
int euclid(int a, int b) {
int x = a;
int y = b;
/*@ loop invariant x > 0 && y > 0;
@ loop invariant gcd(x, y) == gcd(a,b);
@ loop assigns x, y;
@ loop variant \max(x, y);
*/
while (x != y) {
if (x > y) {
x -= y;
} else {
y -= x;
}
}
return x;
}
|
/*@ axiomatic GCD {
@ logic integer gcd(integer x, integer y);
@ axiom gcd_equal:
@ \forall integer x;
@ (x > 0) ==> gcd(x, x) == x;
axiom gcd_comm:
\forall integer x, integer y;
(x > 0 && y > 0) ==> gcd(x, y) == gcd(y, x);
axiom gcd_add:
\forall integer x, integer y;
(x > 0 && y > 0) ==> gcd(x + y, y) == gcd(x, y);
@ }
*/
/*@ requires a > 0 && b > 0;
@ assigns \nothing;
@ ensures \result == gcd(a, b);
*/
|
|
frama_c_files_v2/test_frama_c_1940.c
|
/*@ predicate inInterval(integer a, integer b, integer c) = a >= b && b <= c;
predicate fourInOrder(integer a, integer b, integer c, integer d) = inInterval(b,a,c) && inInterval(c,b,d);
predicate controlledEquality(integer a, integer b, boolean c) = a == b || c;
*/
/*@ requires inInterval(a,b,c);
requires inInterval(c,a,d);
ensures fourInOrder(\result,a,c,d);
*/
int toto(int a, int b, int c, int d){
return b;
}
|
/*@ predicate inInterval(integer a, integer b, integer c) = a >= b && b <= c;
predicate fourInOrder(integer a, integer b, integer c, integer d) = inInterval(b,a,c) && inInterval(c,b,d);
predicate controlledEquality(integer a, integer b, boolean c) = a == b || c;
*/
/*@ requires inInterval(a,b,c);
requires inInterval(c,a,d);
ensures fourInOrder(\result,a,c,d);
*/
|
int toto(int a, int b, int c, int d){
return b;
}
| true | 3 | 3 |
int toto(int a, int b, int c, int d){
return b;
}
|
/*@ predicate inInterval(integer a, integer b, integer c) = a >= b && b <= c;
predicate fourInOrder(integer a, integer b, integer c, integer d) = inInterval(b,a,c) && inInterval(c,b,d);
predicate controlledEquality(integer a, integer b, boolean c) = a == b || c;
*/
/*@ requires inInterval(a,b,c);
requires inInterval(c,a,d);
ensures fourInOrder(\result,a,c,d);
*/
|
|
frama_c_files_v2/test_frama_c_1446.c
|
/*@ requires i > sizeof(int);
@ ensures \result > sizeof(i);
@*/
int f(int i) {
return i;
}
|
/*@ requires i > sizeof(int);
@ ensures \result > sizeof(i);
@*/
|
int f(int i) {
return i;
}
| true | 3 | 3 |
int f(int i) {
return i;
}
|
/*@ requires i > sizeof(int);
@ ensures \result > sizeof(i);
@*/
|
|
frama_c_files_v2/test_frama_c_1097.c
|
#include <limits.h>
/*@ predicate inv_vec_Int(int * x0, integer x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate eq_vec_Int(int * x15, int x16, int * x17, int x18) = ((x16==x18) &&
(\forall int x22; (0<=x22<x16) ==> (x15[x22]==x17[x22])));*/
/*@
requires (inv_vec_Int(x15,x16) &&
inv_vec_Int(x17,x18));
assigns \nothing;
ensures (inv_vec_Int(x15,x16) &&
inv_vec_Int(x17,x18));
ensures \result <==> eq_vec_Int(x15, x16, x17, x18);
*/
int eq_vec_Int(int * x15, int x16, int * x17, int x18) {
int x20 = x16 == x18;
int x31;
if (x20) {
int x30 = 1;
/*@ loop invariant (0 <= x23 <= x16);
loop invariant \forall int x22; (0 <= x22 < x23) ==> (x15[x22]==x17[x22]);
loop invariant x30==1;
loop assigns x23, x30;
loop variant (x16-x23); */
for (int x23 = 0; x23 < x16; x23++) {
int x27 = x15[x23];
int x28 = x17[x23];
int x29 = x27 == x28;
if (!x29) { x30 = 0; break; }
}
x31 = x30;
} else {
x31 = 0/*false*/;
}
return x31;
}
|
#include <limits.h>
/*@ predicate inv_vec_Int(int * x0, integer x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate eq_vec_Int(int * x15, int x16, int * x17, int x18) = ((x16==x18) &&
(\forall int x22; (0<=x22<x16) ==> (x15[x22]==x17[x22])));*/
/*@
requires (inv_vec_Int(x15,x16) &&
inv_vec_Int(x17,x18));
assigns \nothing;
ensures (inv_vec_Int(x15,x16) &&
inv_vec_Int(x17,x18));
ensures \result <==> eq_vec_Int(x15, x16, x17, x18);
*/
|
int eq_vec_Int(int * x15, int x16, int * x17, int x18) {
int x20 = x16 == x18;
int x31;
if (x20) {
int x30 = 1;
/*@ loop invariant (0 <= x23 <= x16);
loop invariant \forall int x22; (0 <= x22 < x23) ==> (x15[x22]==x17[x22]);
loop invariant x30==1;
loop assigns x23, x30;
loop variant (x16-x23); */
for (int x23 = 0; x23 < x16; x23++) {
int x27 = x15[x23];
int x28 = x17[x23];
int x29 = x27 == x28;
if (!x29) { x30 = 0; break; }
}
x31 = x30;
} else {
x31 = 0/*false*/;
}
return x31;
}
| true | 20 | 20 |
int eq_vec_Int(int * x15, int x16, int * x17, int x18) {
int x20 = x16 == x18;
int x31;
if (x20) {
int x30 = 1;
/*@ loop invariant (0 <= x23 <= x16);
loop invariant \forall int x22; (0 <= x22 < x23) ==> (x15[x22]==x17[x22]);
loop invariant x30==1;
loop assigns x23, x30;
loop variant (x16-x23); */
for (int x23 = 0; x23 < x16; x23++) {
int x27 = x15[x23];
int x28 = x17[x23];
int x29 = x27 == x28;
if (!x29) { x30 = 0; break; }
}
x31 = x30;
} else {
x31 = 0/*false*/;
}
return x31;
}
|
#include <limits.h>
/*@ predicate inv_vec_Int(int * x0, integer x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate eq_vec_Int(int * x15, int x16, int * x17, int x18) = ((x16==x18) &&
(\forall int x22; (0<=x22<x16) ==> (x15[x22]==x17[x22])));*/
/*@
requires (inv_vec_Int(x15,x16) &&
inv_vec_Int(x17,x18));
assigns \nothing;
ensures (inv_vec_Int(x15,x16) &&
inv_vec_Int(x17,x18));
ensures \result <==> eq_vec_Int(x15, x16, x17, x18);
*/
|
|
frama_c_files_v2/test_frama_c_2926.c
|
#include <stddef.h>
/*@ requires \valid(s + (0 .. length - 1));
requires \valid(stack + (0 .. length - 1));
requires \valid(left + (0 .. length - 1));
requires \separated(stack + (0 .. length - 1),left + (0 .. length - 1));
requires \separated(stack + (0 .. length - 1), s + (0 .. length - 1));
requires \separated(left + (0 .. length - 1), s + (0 .. length - 1));
assigns stack[0 .. length - 1], left[0 .. length - 1];
ensures wf_left: \forall integer i; 0 <= i < length ==> 0 <= left[i] <= i;
ensures left_small:
\forall integer i; 0 <= i < length ==> 0 < left[i] ==>
left[i] > 0 ==> s[left[i]-1] < s[i];
ensures left_smallest:
\forall integer i; 0 <= i < length ==>
\forall integer j; left[i] <= j < i ==> s[j] >= s[i];
*/
void neighbor(int* s, size_t length, size_t* stack, size_t* left) {
size_t sidx = 0;
/*@ loop invariant s_untouched:
\forall integer idx; 0 <= idx < length ==> s[idx] == \at(s[idx],Pre);
loop invariant 0 <= x <= length;
loop invariant 0 <= sidx <= x;
loop invariant stack_left:
\forall integer i; 0 <= i < sidx ==> 0 < stack[i] <= x;
loop invariant wf_left:
\forall integer i; 0 <= i < x ==> 0 <= left[i] <= i;
loop invariant left_small:
\forall integer i; 0 <= i < x ==> left[i] > 0 ==> s[left[i] - 1] < s[i];
loop invariant left_smallest:
\forall integer i; 0 <= i < x ==>
\forall integer j; left[i] <= j < i ==> s[j] >= s[i];
loop invariant stack_order:
\forall integer i, j; 0<= i < j < sidx ==> 0 <= stack[i] < stack[j];
loop invariant stack_sorder:
\forall integer i, j;
0<= i < j < sidx ==> s[stack[i]-1] < s[stack[j]-1];
loop invariant s_begin:
sidx > 0 ==>
\forall integer i; 0<=i<stack[0] ==> s[i] >= s[stack[0] - 1];
loop invariant step_n:
x > 0 ==> sidx > 0 && stack[sidx - 1] == x;
loop invariant stack_summary:
\forall integer i; 0<= i < sidx - 1 ==>
\forall integer j; stack[i] <= j < stack[i+1]-1 ==>
s[j] >= s[stack[i+1]-1];
loop invariant stack_push: sidx > 0 ==> stack[sidx-1] == x;
loop assigns x, sidx, stack[0 .. length - 1], left[0 .. length - 1];
loop variant length - x;
*/
for (size_t x = 0; x < length; x++) {
/*@
loop invariant s_untouched_inner:
\forall integer idx; 0 <= idx < length ==> s[idx] == \at(s[idx],Pre);
loop invariant 0 <= sidx <= \at(sidx,LoopEntry);
loop invariant left_bigger:
sidx > 0 ==>
\forall integer i;
stack[sidx-1] <= i < x ==> s[i] >= s[x];
loop invariant stack_empty:
sidx == 0 ==>
\forall integer i; 0 <= i < x ==> s[i] >= s[x];
loop assigns sidx;
loop variant sidx;
*/
while (sidx > 0 && s[stack[sidx-1]-1] >= s[x]) sidx--;
if (sidx == 0) {
left[x] = 0;
} else {
/*@ assert head_ok:
\forall integer i; stack[sidx-1]<=i<x ==> s[i] >= s[x];
*/
left[x] = stack[sidx - 1];
}
//@ assert a1: left[x] > 0 ==> s[left[x] - 1] < s[x];
label:
stack[sidx] = x + 1;
/*@ assert s_untouched:
\forall integer idx; 0 <= idx < length ==> s[idx] == \at(s[idx],Pre);
*/
//@ assert same: left[x] == \at(left[x], label);
//@ assert a2: left[x] > 0 ==> s[left[x] - 1] < s[x];
sidx++;
}
}
|
#include <stddef.h>
/*@ requires \valid(s + (0 .. length - 1));
requires \valid(stack + (0 .. length - 1));
requires \valid(left + (0 .. length - 1));
requires \separated(stack + (0 .. length - 1),left + (0 .. length - 1));
requires \separated(stack + (0 .. length - 1), s + (0 .. length - 1));
requires \separated(left + (0 .. length - 1), s + (0 .. length - 1));
assigns stack[0 .. length - 1], left[0 .. length - 1];
ensures wf_left: \forall integer i; 0 <= i < length ==> 0 <= left[i] <= i;
ensures left_small:
\forall integer i; 0 <= i < length ==> 0 < left[i] ==>
left[i] > 0 ==> s[left[i]-1] < s[i];
ensures left_smallest:
\forall integer i; 0 <= i < length ==>
\forall integer j; left[i] <= j < i ==> s[j] >= s[i];
*/
|
void neighbor(int* s, size_t length, size_t* stack, size_t* left) {
size_t sidx = 0;
/*@ loop invariant s_untouched:
\forall integer idx; 0 <= idx < length ==> s[idx] == \at(s[idx],Pre);
loop invariant 0 <= x <= length;
loop invariant 0 <= sidx <= x;
loop invariant stack_left:
\forall integer i; 0 <= i < sidx ==> 0 < stack[i] <= x;
loop invariant wf_left:
\forall integer i; 0 <= i < x ==> 0 <= left[i] <= i;
loop invariant left_small:
\forall integer i; 0 <= i < x ==> left[i] > 0 ==> s[left[i] - 1] < s[i];
loop invariant left_smallest:
\forall integer i; 0 <= i < x ==>
\forall integer j; left[i] <= j < i ==> s[j] >= s[i];
loop invariant stack_order:
\forall integer i, j; 0<= i < j < sidx ==> 0 <= stack[i] < stack[j];
loop invariant stack_sorder:
\forall integer i, j;
0<= i < j < sidx ==> s[stack[i]-1] < s[stack[j]-1];
loop invariant s_begin:
sidx > 0 ==>
\forall integer i; 0<=i<stack[0] ==> s[i] >= s[stack[0] - 1];
loop invariant step_n:
x > 0 ==> sidx > 0 && stack[sidx - 1] == x;
loop invariant stack_summary:
\forall integer i; 0<= i < sidx - 1 ==>
\forall integer j; stack[i] <= j < stack[i+1]-1 ==>
s[j] >= s[stack[i+1]-1];
loop invariant stack_push: sidx > 0 ==> stack[sidx-1] == x;
loop assigns x, sidx, stack[0 .. length - 1], left[0 .. length - 1];
loop variant length - x;
*/
for (size_t x = 0; x < length; x++) {
/*@
loop invariant s_untouched_inner:
\forall integer idx; 0 <= idx < length ==> s[idx] == \at(s[idx],Pre);
loop invariant 0 <= sidx <= \at(sidx,LoopEntry);
loop invariant left_bigger:
sidx > 0 ==>
\forall integer i;
stack[sidx-1] <= i < x ==> s[i] >= s[x];
loop invariant stack_empty:
sidx == 0 ==>
\forall integer i; 0 <= i < x ==> s[i] >= s[x];
loop assigns sidx;
loop variant sidx;
*/
while (sidx > 0 && s[stack[sidx-1]-1] >= s[x]) sidx--;
if (sidx == 0) {
left[x] = 0;
} else {
/*@ assert head_ok:
\forall integer i; stack[sidx-1]<=i<x ==> s[i] >= s[x];
*/
left[x] = stack[sidx - 1];
}
//@ assert a1: left[x] > 0 ==> s[left[x] - 1] < s[x];
label:
stack[sidx] = x + 1;
/*@ assert s_untouched:
\forall integer idx; 0 <= idx < length ==> s[idx] == \at(s[idx],Pre);
*/
//@ assert same: left[x] == \at(left[x], label);
//@ assert a2: left[x] > 0 ==> s[left[x] - 1] < s[x];
sidx++;
}
}
| true | 62 | 62 |
void neighbor(int* s, size_t length, size_t* stack, size_t* left) {
size_t sidx = 0;
/*@ loop invariant s_untouched:
\forall integer idx; 0 <= idx < length ==> s[idx] == \at(s[idx],Pre);
loop invariant 0 <= x <= length;
loop invariant 0 <= sidx <= x;
loop invariant stack_left:
\forall integer i; 0 <= i < sidx ==> 0 < stack[i] <= x;
loop invariant wf_left:
\forall integer i; 0 <= i < x ==> 0 <= left[i] <= i;
loop invariant left_small:
\forall integer i; 0 <= i < x ==> left[i] > 0 ==> s[left[i] - 1] < s[i];
loop invariant left_smallest:
\forall integer i; 0 <= i < x ==>
\forall integer j; left[i] <= j < i ==> s[j] >= s[i];
loop invariant stack_order:
\forall integer i, j; 0<= i < j < sidx ==> 0 <= stack[i] < stack[j];
loop invariant stack_sorder:
\forall integer i, j;
0<= i < j < sidx ==> s[stack[i]-1] < s[stack[j]-1];
loop invariant s_begin:
sidx > 0 ==>
\forall integer i; 0<=i<stack[0] ==> s[i] >= s[stack[0] - 1];
loop invariant step_n:
x > 0 ==> sidx > 0 && stack[sidx - 1] == x;
loop invariant stack_summary:
\forall integer i; 0<= i < sidx - 1 ==>
\forall integer j; stack[i] <= j < stack[i+1]-1 ==>
s[j] >= s[stack[i+1]-1];
loop invariant stack_push: sidx > 0 ==> stack[sidx-1] == x;
loop assigns x, sidx, stack[0 .. length - 1], left[0 .. length - 1];
loop variant length - x;
*/
for (size_t x = 0; x < length; x++) {
/*@
loop invariant s_untouched_inner:
\forall integer idx; 0 <= idx < length ==> s[idx] == \at(s[idx],Pre);
loop invariant 0 <= sidx <= \at(sidx,LoopEntry);
loop invariant left_bigger:
sidx > 0 ==>
\forall integer i;
stack[sidx-1] <= i < x ==> s[i] >= s[x];
loop invariant stack_empty:
sidx == 0 ==>
\forall integer i; 0 <= i < x ==> s[i] >= s[x];
loop assigns sidx;
loop variant sidx;
*/
while (sidx > 0 && s[stack[sidx-1]-1] >= s[x]) sidx--;
if (sidx == 0) {
left[x] = 0;
} else {
/*@ assert head_ok:
\forall integer i; stack[sidx-1]<=i<x ==> s[i] >= s[x];
*/
left[x] = stack[sidx - 1];
}
//@ assert a1: left[x] > 0 ==> s[left[x] - 1] < s[x];
label:
stack[sidx] = x + 1;
/*@ assert s_untouched:
\forall integer idx; 0 <= idx < length ==> s[idx] == \at(s[idx],Pre);
*/
//@ assert same: left[x] == \at(left[x], label);
//@ assert a2: left[x] > 0 ==> s[left[x] - 1] < s[x];
sidx++;
}
}
|
#include <stddef.h>
/*@ requires \valid(s + (0 .. length - 1));
requires \valid(stack + (0 .. length - 1));
requires \valid(left + (0 .. length - 1));
requires \separated(stack + (0 .. length - 1),left + (0 .. length - 1));
requires \separated(stack + (0 .. length - 1), s + (0 .. length - 1));
requires \separated(left + (0 .. length - 1), s + (0 .. length - 1));
assigns stack[0 .. length - 1], left[0 .. length - 1];
ensures wf_left: \forall integer i; 0 <= i < length ==> 0 <= left[i] <= i;
ensures left_small:
\forall integer i; 0 <= i < length ==> 0 < left[i] ==>
left[i] > 0 ==> s[left[i]-1] < s[i];
ensures left_smallest:
\forall integer i; 0 <= i < length ==>
\forall integer j; left[i] <= j < i ==> s[j] >= s[i];
*/
|
|
frama_c_files_v2/test_frama_c_1445.c
|
/* run.config
DONTRUN: linked with first which is the real test.
*/
/*@ behavior b:
requires \valid(third);
ensures \result == 0;*/
int bar(int *third) {
third=(int*)*third;
return 0;
}
|
/*@ behavior b:
requires \valid(third);
ensures \result == 0;*/
|
int bar(int *third) {
third=(int*)*third;
return 0;
}
| true | 4 | 4 |
int bar(int *third) {
third=(int*)*third;
return 0;
}
|
/*@ behavior b:
requires \valid(third);
ensures \result == 0;*/
|
|
frama_c_files_v2/test_frama_c_2220.c
|
/*@ predicate pcond1(integer p) = (p>0)?\true:\false ;
@ predicate pcond2(integer p) = (p<10)?\true:\false ;
@*/
/*@
//// ensures (pcond1(x) && pcond2(y)) ==> \result == 1 ;
@ ensures \result == 1 <==> pcond1(x) && pcond2(y);
@*/
int ftest1(int x, int y)
{
return (x>0 && y<10);
}
/*@ predicate pcond3(integer p) = p > 0;
@ predicate pcond4(integer p) = p < 10;
@*/
/*@ behavior ok:
@ assumes pcond3(x) && pcond4(y);
@ ensures \result == 1;
@ behavior ko:
@ assumes !pcond3(x) || !pcond4(y);
@ ensures \result == 0;
@*/
int ftest2(int x, int y)
{
return (x>0 && y<10);
}
|
/*@ predicate pcond1(integer p) = (p>0)?\true:\false ;
@ predicate pcond2(integer p) = (p<10)?\true:\false ;
@*/
/*@
//// ensures (pcond1(x) && pcond2(y)) ==> \result == 1 ;
@ ensures \result == 1 <==> pcond1(x) && pcond2(y);
@*/
|
int ftest1(int x, int y)
{
return (x>0 && y<10);
}
| true | 3 | 3 |
int ftest1(int x, int y)
{
return (x>0 && y<10);
}
|
/*@ predicate pcond1(integer p) = (p>0)?\true:\false ;
@ predicate pcond2(integer p) = (p<10)?\true:\false ;
@*/
/*@
//// ensures (pcond1(x) && pcond2(y)) ==> \result == 1 ;
@ ensures \result == 1 <==> pcond1(x) && pcond2(y);
@*/
|
|
frama_c_files_v2/test_frama_c_2220.c
|
/*@ predicate pcond1(integer p) = (p>0)?\true:\false ;
@ predicate pcond2(integer p) = (p<10)?\true:\false ;
@*/
/*@
//// ensures (pcond1(x) && pcond2(y)) ==> \result == 1 ;
@ ensures \result == 1 <==> pcond1(x) && pcond2(y);
@*/
int ftest1(int x, int y)
{
return (x>0 && y<10);
}
/*@ predicate pcond3(integer p) = p > 0;
@ predicate pcond4(integer p) = p < 10;
@*/
/*@ behavior ok:
@ assumes pcond3(x) && pcond4(y);
@ ensures \result == 1;
@ behavior ko:
@ assumes !pcond3(x) || !pcond4(y);
@ ensures \result == 0;
@*/
int ftest2(int x, int y)
{
return (x>0 && y<10);
}
|
/*@ predicate pcond1(integer p) = (p>0)?\true:\false ;
@ predicate pcond2(integer p) = (p<10)?\true:\false ;
@*/
/*@
//// ensures (pcond1(x) && pcond2(y)) ==> \result == 1 ;
@ ensures \result == 1 <==> pcond1(x) && pcond2(y);
@*/
int ftest1(int x, int y)
{
return (x>0 && y<10);
}
/*@ predicate pcond3(integer p) = p > 0;
@ predicate pcond4(integer p) = p < 10;
@*/
/*@ behavior ok:
@ assumes pcond3(x) && pcond4(y);
@ ensures \result == 1;
@ behavior ko:
@ assumes !pcond3(x) || !pcond4(y);
@ ensures \result == 0;
@*/
|
int ftest2(int x, int y)
{
return (x>0 && y<10);
}
| true | 7 | 7 |
int ftest2(int x, int y)
{
return (x>0 && y<10);
}
|
/*@ predicate pcond1(integer p) = (p>0)?\true:\false ;
@ predicate pcond2(integer p) = (p<10)?\true:\false ;
@*/
/*@
//// ensures (pcond1(x) && pcond2(y)) ==> \result == 1 ;
@ ensures \result == 1 <==> pcond1(x) && pcond2(y);
@*/
int ftest1(int x, int y)
{
return (x>0 && y<10);
}
/*@ predicate pcond3(integer p) = p > 0;
@ predicate pcond4(integer p) = p < 10;
@*/
/*@ behavior ok:
@ assumes pcond3(x) && pcond4(y);
@ ensures \result == 1;
@ behavior ko:
@ assumes !pcond3(x) || !pcond4(y);
@ ensures \result == 0;
@*/
|
|
frama_c_files_v2/test_frama_c_1144.c
|
/*@ requires n > 0;
@ ensures \result == \max(0,n-1,\lambda integer k; t[k]);
@*/
double max_array(double t[], int n) {
double m; int i=0;
goto L;
do {
if (t[i] > m) { L: m = t[i]; }
/*@ invariant
@ 0 <= i < n && m == \max(0,i,\lambda integer k; t[k]);
@*/
i++;
}
while (i < n);
return m;
}
|
/*@ requires n > 0;
@ ensures \result == \max(0,n-1,\lambda integer k; t[k]);
@*/
|
double max_array(double t[], int n) {
double m; int i=0;
goto L;
do {
if (t[i] > m) { L: m = t[i]; }
/*@ invariant
@ 0 <= i < n && m == \max(0,i,\lambda integer k; t[k]);
@*/
i++;
}
while (i < n);
return m;
}
| true | 1 | 1 |
double max_array(double t[], int n) {
double m; int i=0;
goto L;
do {
if (t[i] > m) { L: m = t[i]; }
/*@ invariant
@ 0 <= i < n && m == \max(0,i,\lambda integer k; t[k]);
@*/
i++;
}
while (i < n);
return m;
}
|
/*@ requires n > 0;
@ ensures \result == \max(0,n-1,\lambda integer k; t[k]);
@*/
|
|
frama_c_files_v2/test_frama_c_130.c
|
#include<stdio.h>
enum kind {vowel,consonent};
/*@
requires c>='a' && c<='z';
behavior vowel:
assumes c=={'a','e','i','o','u'};
ensures \result==vowel;
behavior consonent:
assumes c=={'b','c','d','f','g','h','j','k','l','m','n','p','q','r','s','t','v','w','x','y','z'};
ensures \result==consonent;
disjoint behaviors;
*/
enum kind kind_of_letter(char c){
if(c=='a' || c=='e' || c=='i' || c=='o' || c=='u'){
return vowel;
}
else{
return consonent;
}
}
/*@
behavior q1:
assumes x>=0 &&y>0;
ensures \result==1;
behavior q2:
assumes x<0 &&y>=0;
ensures \result==2;
behavior q3:
assumes x<=0 &&y<0;
ensures \result==3;
behavior q4:
assumes x>0 &&y<=0;
ensures \result==4;
behavior q0:
assumes x==0 &&y==0;
ensures \result==0;
complete behaviors;
*/
int quadrant(int x,int y){
/*
*Basically remember to check for the logical constrains of quadrants
*/
if(x>=0 && y>0) return 1;
else if (x<0 && y>=0) return 2;
else if (x<=0 && y<0) return 3;
else if (x==0 && y==0) return 0;
else return 4;
}
|
#include<stdio.h>
enum kind {vowel,consonent};
/*@
requires c>='a' && c<='z';
behavior vowel:
assumes c=={'a','e','i','o','u'};
ensures \result==vowel;
behavior consonent:
assumes c=={'b','c','d','f','g','h','j','k','l','m','n','p','q','r','s','t','v','w','x','y','z'};
ensures \result==consonent;
disjoint behaviors;
*/
|
enum kind kind_of_letter(char c){
if(c=='a' || c=='e' || c=='i' || c=='o' || c=='u'){
return vowel;
}
else{
return consonent;
}
}
| true | 5 | 5 |
enum kind kind_of_letter(char c){
if(c=='a' || c=='e' || c=='i' || c=='o' || c=='u'){
return vowel;
}
else{
return consonent;
}
}
|
#include<stdio.h>
enum kind {vowel,consonent};
/*@
requires c>='a' && c<='z';
behavior vowel:
assumes c=={'a','e','i','o','u'};
ensures \result==vowel;
behavior consonent:
assumes c=={'b','c','d','f','g','h','j','k','l','m','n','p','q','r','s','t','v','w','x','y','z'};
ensures \result==consonent;
disjoint behaviors;
*/
|
|
frama_c_files_v2/test_frama_c_130.c
|
#include<stdio.h>
enum kind {vowel,consonent};
/*@
requires c>='a' && c<='z';
behavior vowel:
assumes c=={'a','e','i','o','u'};
ensures \result==vowel;
behavior consonent:
assumes c=={'b','c','d','f','g','h','j','k','l','m','n','p','q','r','s','t','v','w','x','y','z'};
ensures \result==consonent;
disjoint behaviors;
*/
enum kind kind_of_letter(char c){
if(c=='a' || c=='e' || c=='i' || c=='o' || c=='u'){
return vowel;
}
else{
return consonent;
}
}
/*@
behavior q1:
assumes x>=0 &&y>0;
ensures \result==1;
behavior q2:
assumes x<0 &&y>=0;
ensures \result==2;
behavior q3:
assumes x<=0 &&y<0;
ensures \result==3;
behavior q4:
assumes x>0 &&y<=0;
ensures \result==4;
behavior q0:
assumes x==0 &&y==0;
ensures \result==0;
complete behaviors;
*/
int quadrant(int x,int y){
/*
*Basically remember to check for the logical constrains of quadrants
*/
if(x>=0 && y>0) return 1;
else if (x<0 && y>=0) return 2;
else if (x<=0 && y<0) return 3;
else if (x==0 && y==0) return 0;
else return 4;
}
|
#include<stdio.h>
enum kind {vowel,consonent};
/*@
requires c>='a' && c<='z';
behavior vowel:
assumes c=={'a','e','i','o','u'};
ensures \result==vowel;
behavior consonent:
assumes c=={'b','c','d','f','g','h','j','k','l','m','n','p','q','r','s','t','v','w','x','y','z'};
ensures \result==consonent;
disjoint behaviors;
*/
enum kind kind_of_letter(char c){
if(c=='a' || c=='e' || c=='i' || c=='o' || c=='u'){
return vowel;
}
else{
return consonent;
}
}
/*@
behavior q1:
assumes x>=0 &&y>0;
ensures \result==1;
behavior q2:
assumes x<0 &&y>=0;
ensures \result==2;
behavior q3:
assumes x<=0 &&y<0;
ensures \result==3;
behavior q4:
assumes x>0 &&y<=0;
ensures \result==4;
behavior q0:
assumes x==0 &&y==0;
ensures \result==0;
complete behaviors;
*/
|
int quadrant(int x,int y){
/*
*Basically remember to check for the logical constrains of quadrants
*/
if(x>=0 && y>0) return 1;
else if (x<0 && y>=0) return 2;
else if (x<=0 && y<0) return 3;
else if (x==0 && y==0) return 0;
else return 4;
}
| true | 13 | 13 |
int quadrant(int x,int y){
/*
*Basically remember to check for the logical constrains of quadrants
*/
if(x>=0 && y>0) return 1;
else if (x<0 && y>=0) return 2;
else if (x<=0 && y<0) return 3;
else if (x==0 && y==0) return 0;
else return 4;
}
|
#include<stdio.h>
enum kind {vowel,consonent};
/*@
requires c>='a' && c<='z';
behavior vowel:
assumes c=={'a','e','i','o','u'};
ensures \result==vowel;
behavior consonent:
assumes c=={'b','c','d','f','g','h','j','k','l','m','n','p','q','r','s','t','v','w','x','y','z'};
ensures \result==consonent;
disjoint behaviors;
*/
enum kind kind_of_letter(char c){
if(c=='a' || c=='e' || c=='i' || c=='o' || c=='u'){
return vowel;
}
else{
return consonent;
}
}
/*@
behavior q1:
assumes x>=0 &&y>0;
ensures \result==1;
behavior q2:
assumes x<0 &&y>=0;
ensures \result==2;
behavior q3:
assumes x<=0 &&y<0;
ensures \result==3;
behavior q4:
assumes x>0 &&y<=0;
ensures \result==4;
behavior q0:
assumes x==0 &&y==0;
ensures \result==0;
complete behaviors;
*/
|
|
frama_c_files_v2/test_frama_c_1650.c
|
/*@
predicate Positive(int a) = 0 < a;
*/
/*@
predicate Positive(short a) = 0 < a;
*/
/*@
requires Positive(a);
assigns \nothing;
ensures Positive(\result);
*/
int foo(short a)
{
return a;
}
struct Pair
{
int first, second;
};
typedef struct Pair Pair;
/*@
predicate Positive(Pair p) = Positive(p.first) && Positive(p.second);
*/
/*@
requires Positive(a);
assigns \nothing;
ensures Positive(\result);
*/
Pair bar(int a)
{
Pair p;
p.first = a;
p.second = a;
return p;
}
|
/*@
predicate Positive(int a) = 0 < a;
*/
/*@
predicate Positive(short a) = 0 < a;
*/
/*@
requires Positive(a);
assigns \nothing;
ensures Positive(\result);
*/
|
int foo(short a)
{
return a;
}
| true | 4 | 4 |
int foo(short a)
{
return a;
}
|
/*@
predicate Positive(int a) = 0 < a;
*/
/*@
predicate Positive(short a) = 0 < a;
*/
/*@
requires Positive(a);
assigns \nothing;
ensures Positive(\result);
*/
|
|
frama_c_files_v2/test_frama_c_1650.c
|
/*@
predicate Positive(int a) = 0 < a;
*/
/*@
predicate Positive(short a) = 0 < a;
*/
/*@
requires Positive(a);
assigns \nothing;
ensures Positive(\result);
*/
int foo(short a)
{
return a;
}
struct Pair
{
int first, second;
};
typedef struct Pair Pair;
/*@
predicate Positive(Pair p) = Positive(p.first) && Positive(p.second);
*/
/*@
requires Positive(a);
assigns \nothing;
ensures Positive(\result);
*/
Pair bar(int a)
{
Pair p;
p.first = a;
p.second = a;
return p;
}
|
typedef struct Pair Pair;
/*@
predicate Positive(int a) = 0 < a;
*/
/*@
predicate Positive(short a) = 0 < a;
*/
/*@
requires Positive(a);
assigns \nothing;
ensures Positive(\result);
*/
int foo(short a)
{
return a;
}
struct Pair
{
int first, second;
};
typedef struct Pair Pair;
/*@
predicate Positive(Pair p) = Positive(p.first) && Positive(p.second);
*/
/*@
requires Positive(a);
assigns \nothing;
ensures Positive(\result);
*/
|
Pair bar(int a)
{
Pair p;
p.first = a;
p.second = a;
return p;
}
| true | 9 | 9 |
Pair bar(int a)
{
Pair p;
p.first = a;
p.second = a;
return p;
}
|
typedef struct Pair Pair;
/*@
predicate Positive(int a) = 0 < a;
*/
/*@
predicate Positive(short a) = 0 < a;
*/
/*@
requires Positive(a);
assigns \nothing;
ensures Positive(\result);
*/
int foo(short a)
{
return a;
}
struct Pair
{
int first, second;
};
typedef struct Pair Pair;
/*@
predicate Positive(Pair p) = Positive(p.first) && Positive(p.second);
*/
/*@
requires Positive(a);
assigns \nothing;
ensures Positive(\result);
*/
|
|
frama_c_files_v2/test_frama_c_2017.c
|
/*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures *a == \old(*b) && *b == \old(*a);
*/
void swap(int* a, int* b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
int main(){
int a = 37;
int b = 91;
swap(&a, &b);
}
|
/*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures *a == \old(*b) && *b == \old(*a);
*/
|
void swap(int* a, int* b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
| true | 9 | 9 |
void swap(int* a, int* b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
|
/*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures *a == \old(*b) && *b == \old(*a);
*/
|
|
frama_c_files_v2/test_frama_c_2161.c
|
/*@ //requires \nothing;
requires \true;
assigns \nothing;
ensures \result == \max(a, b) - \min(a, b);
*/
unsigned distance(unsigned a, unsigned b)
{
return (a > b) ? (a - b) : (b - a);
}
#ifdef OUT_OF_TASK
#include <stdio.h>
int main(void)
{
printf("res: %d\n", distance(100, 80));
return 0;
}
#endif
|
#include <stdio.h>
/*@ //requires \nothing;
requires \true;
assigns \nothing;
ensures \result == \max(a, b) - \min(a, b);
*/
|
unsigned distance(unsigned a, unsigned b)
{
return (a > b) ? (a - b) : (b - a);
}
| true | 5 | 5 |
unsigned distance(unsigned a, unsigned b)
{
return (a > b) ? (a - b) : (b - a);
}
|
#include <stdio.h>
/*@ //requires \nothing;
requires \true;
assigns \nothing;
ensures \result == \max(a, b) - \min(a, b);
*/
|
|
frama_c_files_v2/test_frama_c_915.c
|
#include <limits.h>
/*@
requires \valid(x0+(0..1));
ensures ((x0[0]==\old(x0[1])) &&
(x0[1]==\old(x0[0])));
*/
void array_swap(int * x0) {
int x2 = x0[0];
int x3 = x0[1];
x0[0] = x3;
x0[1] = x2;
}
|
#include <limits.h>
/*@
requires \valid(x0+(0..1));
ensures ((x0[0]==\old(x0[1])) &&
(x0[1]==\old(x0[0])));
*/
|
void array_swap(int * x0) {
int x2 = x0[0];
int x3 = x0[1];
x0[0] = x3;
x0[1] = x2;
}
| true | 7 | 7 |
void array_swap(int * x0) {
int x2 = x0[0];
int x3 = x0[1];
x0[0] = x3;
x0[1] = x2;
}
|
#include <limits.h>
/*@
requires \valid(x0+(0..1));
ensures ((x0[0]==\old(x0[1])) &&
(x0[1]==\old(x0[0])));
*/
|
|
frama_c_files_v2/test_frama_c_1622.c
|
/*@
requires d > 0;
assigns \nothing;
ensures 0 <= \result < d;
*/
static inline
unsigned int inverse_modulo(unsigned int n, unsigned int d)
{
return d - 1 - (n % d);
}
|
/*@
requires d > 0;
assigns \nothing;
ensures 0 <= \result < d;
*/
|
static inline
unsigned int inverse_modulo(unsigned int n, unsigned int d)
{
return d - 1 - (n % d);
}
| true | 5 | 5 |
static inline
unsigned int inverse_modulo(unsigned int n, unsigned int d)
{
return d - 1 - (n % d);
}
|
/*@
requires d > 0;
assigns \nothing;
ensures 0 <= \result < d;
*/
|
|
frama_c_files_v2/test_frama_c_1766.c
|
/*@ ensures \result >= x && \result >= y;
ensures \result == x || \result == y;
*/
int max (int x, int y) { return (x > y) ? x : y; }
|
/*@ ensures \result >= x && \result >= y;
ensures \result == x || \result == y;
*/
|
int max (int x, int y) { return (x > y) ? x : y; }
| true | 4 | 4 |
int max (int x, int y) { return (x > y) ? x : y; }
|
/*@ ensures \result >= x && \result >= y;
ensures \result == x || \result == y;
*/
|
|
frama_c_files_v2/test_frama_c_282.c
|
/*@ predicate sorted(int *t,integer i,integer j) =
@ \forall integer k, integer l; i <= k < l <= j ==> t[k] <= t[l];
@*/
/*@ requires N >= 1 && \valid(A+(0..N-1));
@ assigns A[0..N-1];
@ ensures sorted(A,0,N-1);
@*/
void insertionSort(int A[], int N) {
int i, j, key;
/*@ loop invariant
@ 1 <= j <= N && sorted(A, 0, j-1);
@ loop assigns
@ j, key, i, A[0..N-1];
@ loop variant
@ N-j;
@*/
for (j=1 ; j<N ; j++) {
key = A[j];
i = j-1;
/*@ loop invariant -1 <= i <= j-1;
@ loop invariant i == j-1 ==> sorted(A, 0, j-1);
@ loop invariant i < j-1 ==> sorted(A, 0, j);
@ loop invariant \forall int k; i < k < j ==> A[k] > key;
@ loop assigns i, A[1..j];
@ loop variant i;
@*/
while (i>=0 && A[i] > key) {
A[i+1] = A[i];
i--;
}
A[i+1] = key;
}
}
|
/*@ predicate sorted(int *t,integer i,integer j) =
@ \forall integer k, integer l; i <= k < l <= j ==> t[k] <= t[l];
@*/
/*@ requires N >= 1 && \valid(A+(0..N-1));
@ assigns A[0..N-1];
@ ensures sorted(A,0,N-1);
@*/
|
void insertionSort(int A[], int N) {
int i, j, key;
/*@ loop invariant
@ 1 <= j <= N && sorted(A, 0, j-1);
@ loop assigns
@ j, key, i, A[0..N-1];
@ loop variant
@ N-j;
@*/
for (j=1 ; j<N ; j++) {
key = A[j];
i = j-1;
/*@ loop invariant -1 <= i <= j-1;
@ loop invariant i == j-1 ==> sorted(A, 0, j-1);
@ loop invariant i < j-1 ==> sorted(A, 0, j);
@ loop invariant \forall int k; i < k < j ==> A[k] > key;
@ loop assigns i, A[1..j];
@ loop variant i;
@*/
while (i>=0 && A[i] > key) {
A[i+1] = A[i];
i--;
}
A[i+1] = key;
}
}
| true | 36 | 36 |
void insertionSort(int A[], int N) {
int i, j, key;
/*@ loop invariant
@ 1 <= j <= N && sorted(A, 0, j-1);
@ loop assigns
@ j, key, i, A[0..N-1];
@ loop variant
@ N-j;
@*/
for (j=1 ; j<N ; j++) {
key = A[j];
i = j-1;
/*@ loop invariant -1 <= i <= j-1;
@ loop invariant i == j-1 ==> sorted(A, 0, j-1);
@ loop invariant i < j-1 ==> sorted(A, 0, j);
@ loop invariant \forall int k; i < k < j ==> A[k] > key;
@ loop assigns i, A[1..j];
@ loop variant i;
@*/
while (i>=0 && A[i] > key) {
A[i+1] = A[i];
i--;
}
A[i+1] = key;
}
}
|
/*@ predicate sorted(int *t,integer i,integer j) =
@ \forall integer k, integer l; i <= k < l <= j ==> t[k] <= t[l];
@*/
/*@ requires N >= 1 && \valid(A+(0..N-1));
@ assigns A[0..N-1];
@ ensures sorted(A,0,N-1);
@*/
|
|
frama_c_files_v2/test_frama_c_2313.c
|
/*@ requires \pointer_comparable((void*)p,(void*)q) && \is_finite(*p) ; */
void f(float*p, char const * q) {
return;
}
|
/*@ requires \pointer_comparable((void*)p,(void*)q) && \is_finite(*p) ; */
|
void f(float*p, char const * q) {
return;
}
| true | 2 | 2 |
void f(float*p, char const * q) {
return;
}
|
/*@ requires \pointer_comparable((void*)p,(void*)q) && \is_finite(*p) ; */
|
|
frama_c_files_v2/test_frama_c_1992.c
|
/*@ requires \valid(t+(0..n-1)) && n > 0;
@ ensures (\forall integer i; 0 <= i < n ==> \result <= t[i]) &&
@ (\exists integer i; 0 <= i < n && \result == t[i]);
@ assigns \nothing;
*/
int getMin(int t[], int n) {
int res = t[0];
/*@ loop invariant 1 <= i <= n &&
@ (\forall integer j; 0 <= j < i ==> res <= t[j]) &&
@ (\exists integer j; 0 <= j < i && res == t[j]);
@ loop assigns i, res;
@ loop variant n - i;
@*/
for (int i = 1; i < n; i++)
{
if (t[i] < res)
res = t[i];
}
return res;
}
|
/*@ requires \valid(t+(0..n-1)) && n > 0;
@ ensures (\forall integer i; 0 <= i < n ==> \result <= t[i]) &&
@ (\exists integer i; 0 <= i < n && \result == t[i]);
@ assigns \nothing;
*/
|
int getMin(int t[], int n) {
int res = t[0];
/*@ loop invariant 1 <= i <= n &&
@ (\forall integer j; 0 <= j < i ==> res <= t[j]) &&
@ (\exists integer j; 0 <= j < i && res == t[j]);
@ loop assigns i, res;
@ loop variant n - i;
@*/
for (int i = 1; i < n; i++)
{
if (t[i] < res)
res = t[i];
}
return res;
}
| true | 13 | 13 |
int getMin(int t[], int n) {
int res = t[0];
/*@ loop invariant 1 <= i <= n &&
@ (\forall integer j; 0 <= j < i ==> res <= t[j]) &&
@ (\exists integer j; 0 <= j < i && res == t[j]);
@ loop assigns i, res;
@ loop variant n - i;
@*/
for (int i = 1; i < n; i++)
{
if (t[i] < res)
res = t[i];
}
return res;
}
|
/*@ requires \valid(t+(0..n-1)) && n > 0;
@ ensures (\forall integer i; 0 <= i < n ==> \result <= t[i]) &&
@ (\exists integer i; 0 <= i < n && \result == t[i]);
@ assigns \nothing;
*/
|
|
frama_c_files_v2/test_frama_c_667.c
|
/*@ requires b != 0;
requires b != -1;
assigns \nothing;
ensures \result == a / b;
*/
int divide(int a, int b)
{
return a / b;
}
|
/*@ requires b != 0;
requires b != -1;
assigns \nothing;
ensures \result == a / b;
*/
|
int divide(int a, int b)
{
return a / b;
}
| true | 6 | 6 |
int divide(int a, int b)
{
return a / b;
}
|
/*@ requires b != 0;
requires b != -1;
assigns \nothing;
ensures \result == a / b;
*/
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.