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_2021.c | #include <limits.h>
/*@
requires (((x1>0) &&
\valid(x0+(0..x1-1))) &&
\valid(x2+(0..x1-1)));
ensures ((((0<=\result) &&
(\result<=x1)) &&
(\forall int x74; (((0<=x74) &&
(x74<\result)) ==> ((0<=x2[x74]) &&
(x2[x74]<x1))))) &&
(\forall int x86; (((0<x86) &&
(x86<\result)) ==> (x2[(x86-1)]<x2[x86]))));
assigns x2[(0..x... | #include <limits.h>
/*@
requires (((x1>0) &&
\valid(x0+(0..x1-1))) &&
\valid(x2+(0..x1-1)));
ensures ((((0<=\result) &&
(\result<=x1)) &&
(\forall int x74; (((0<=x74) &&
(x74<\result)) ==> ((0<=x2[x74]) &&
(x2[x74]<x1))))) &&
(\forall int x86; (((0<x86) &&
(x86<\result)) ==> (x2[(x86-1)]<x2[x86]))));
assigns x2[(0..... | int index_where_even(int * x0, int x1, int * x2) {
int x5 = 0;
/*@
loop invariant ((((((0<=x6) &&
(x6<=x1)) &&
(0<=x5)) &&
(x5<=x6)) &&
(\forall int x28; (((0<=x28) &&
(x28<x5)) ==> ((0<=x2[x28]) &&
(x2[x28]<x6))))) &&
(\forall int x42; (((0<x42) &&
(x42<x5)) ==> (x2[(x42-1)]<x2[x42]))));
l... | true | 15 | 15 | int index_where_even(int * x0, int x1, int * x2) {
int x5 = 0;
/*@
loop invariant ((((((0<=x6) &&
(x6<=x1)) &&
(0<=x5)) &&
(x5<=x6)) &&
(\forall int x28; (((0<=x28) &&
(x28<x5)) ==> ((0<=x2[x28]) &&
(x2[x28]<x6))))) &&
(\forall int x42; (((0<x42) &&
(x42<x5)) ==> (x2[(x42-1)]<x2[x42]))));
l... | #include <limits.h>
/*@
requires (((x1>0) &&
\valid(x0+(0..x1-1))) &&
\valid(x2+(0..x1-1)));
ensures ((((0<=\result) &&
(\result<=x1)) &&
(\forall int x74; (((0<=x74) &&
(x74<\result)) ==> ((0<=x2[x74]) &&
(x2[x74]<x1))))) &&
(\forall int x86; (((0<x86) &&
(x86<\result)) ==> (x2[(x86-1)]<x2[x86]))));
assigns x2[(0..... | |
frama_c_files_v2/test_frama_c_2289.c | #include <stdlib.h>
/*@
requires n >= 0 && n <= 100;
ensures \result >= 0;
ensures \result == (int)((n+1)*(n)/2);
assigns \nothing;
*/
int sum(char n) {
int s = 0;
char k = 0;
/*@
loop invariant 0 <= k <= n+1;
loop invariant s == (k-1)*(k)/2;
loop assigns k, s;
... | #include <stdlib.h>
/*@
requires n >= 0 && n <= 100;
ensures \result >= 0;
ensures \result == (int)((n+1)*(n)/2);
assigns \nothing;
*/ | int sum(char n) {
int s = 0;
char k = 0;
/*@
loop invariant 0 <= k <= n+1;
loop invariant s == (k-1)*(k)/2;
loop assigns k, s;
loop variant n - k;
*/
while(k <= n) {
s = s + (int)k;
k = k + 1;
}
return (int)s;
} | true | 15 | 15 | int sum(char n) {
int s = 0;
char k = 0;
/*@
loop invariant 0 <= k <= n+1;
loop invariant s == (k-1)*(k)/2;
loop assigns k, s;
loop variant n - k;
*/
while(k <= n) {
s = s + (int)k;
k = k + 1;
}
return (int)s;
} | #include <stdlib.h>
/*@
requires n >= 0 && n <= 100;
ensures \result >= 0;
ensures \result == (int)((n+1)*(n)/2);
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2309.c | #include<stdio.h>
/*@
requires \valid(a) && \valid(b) && \valid(c) ;
requires \separated(a, b, c);
assigns *a, *b, *c ;
ensures *a <= *b <= *c ;
ensures { *a, *b, *c } == \old({ *a, *b, *c }) ;
ensures \old(*a == *b == *c) ==> *a == *b == *c ;
ensures \old(*a == *b < *c || *a == *c < *b || *b == *c < *a) ==> *a ... | #include<stdio.h>
/*@
requires \valid(a) && \valid(b) && \valid(c) ;
requires \separated(a, b, c);
assigns *a, *b, *c ;
ensures *a <= *b <= *c ;
ensures { *a, *b, *c } == \old({ *a, *b, *c }) ;
ensures \old(*a == *b == *c) ==> *a == *b == *c ;
ensures \old(*a == *b < *c || *a == *c < *b || *b == *c < *a) ==> *a... | void order_3(int* a,int* b,int* c){
if(*a > *b){int tmp = *b ;*b = *a ;*a = tmp ; }
if(*a > *c){int tmp = *c ; *c = *a ;*a = tmp ; }
if(*b > *c){int tmp = *b ;*b = *c ;*c = tmp ;}
} | true | 31 | 31 | void order_3(int* a,int* b,int* c){
if(*a > *b){int tmp = *b ;*b = *a ;*a = tmp ; }
if(*a > *c){int tmp = *c ; *c = *a ;*a = tmp ; }
if(*b > *c){int tmp = *b ;*b = *c ;*c = tmp ;}
} | #include<stdio.h>
/*@
requires \valid(a) && \valid(b) && \valid(c) ;
requires \separated(a, b, c);
assigns *a, *b, *c ;
ensures *a <= *b <= *c ;
ensures { *a, *b, *c } == \old({ *a, *b, *c }) ;
ensures \old(*a == *b == *c) ==> *a == *b == *c ;
ensures \old(*a == *b < *c || *a == *c < *b || *b == *c < *a) ==> *a... | |
frama_c_files_v2/test_frama_c_2622.c | // =================== Exercies 1 ===================
/*@
@ ensures \result >= a;
@ ensures \result >= b;
@ ensures \result >= c;
@ ensures \result == a || \result == b || \result == c;
@ assigns \nothing;
*/
int max3(int a, int b, int c) {
if (a >= b && a >= c) return a;
if (b >= b && b >= c) return... |
/*@
@ ensures \result >= a;
@ ensures \result >= b;
@ ensures \result >= c;
@ ensures \result == a || \result == b || \result == c;
@ assigns \nothing;
*/ | int max3(int a, int b, int c) {
if (a >= b && a >= c) return a;
if (b >= b && b >= c) return b;
return c;
} | true | 9 | 9 | int max3(int a, int b, int c) {
if (a >= b && a >= c) return a;
if (b >= b && b >= c) return b;
return c;
} | /*@
@ ensures \result >= a;
@ ensures \result >= b;
@ ensures \result >= c;
@ ensures \result == a || \result == b || \result == c;
@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2784.c | /*@ inductive is_gcd(integer a, integer b, integer d) {
case gcd_zero:
\forall integer n; is_gcd(n,0,n);
case gcd_succ:
\forall integer a,b,d; is_gcd(b, a % b, d) ==> is_gcd(a,b,d);
}
*/
/*@ axiomatic gcd {
logic integer gcd(integer a, integer b);
axiom nil:
... |
/*@ inductive is_gcd(integer a, integer b, integer d) {
case gcd_zero:
\forall integer n; is_gcd(n,0,n);
case gcd_succ:
\forall integer a,b,d; is_gcd(b, a % b, d) ==> is_gcd(a,b,d);
}
*/
/*@ axiomatic gcd {
logic integer gcd(integer a, integer b);
axiom nil:
... | unsigned gcd_rec(unsigned a, unsigned b)
{
if (b == 0)
return a;
return gcd_rec(b, a % b);
} | true | 11 | 11 | unsigned gcd_rec(unsigned a, unsigned b)
{
if (b == 0)
return a;
return gcd_rec(b, a % b);
} | /*@ inductive is_gcd(integer a, integer b, integer d) {
case gcd_zero:
\forall integer n; is_gcd(n,0,n);
case gcd_succ:
\forall integer a,b,d; is_gcd(b, a % b, d) ==> is_gcd(a,b,d);
}
*/
/*@ axiomatic gcd {
logic integer gcd(integer a, integer b);
axiom nil:
... | |
frama_c_files_v2/test_frama_c_152.c |
/*@ assigns \nothing;
ensures \result == a / 2;
*/
unsigned rshift(unsigned a)
{
return a >> 1;
}
|
/*@ assigns \nothing;
ensures \result == a / 2;
*/ | unsigned rshift(unsigned a)
{
return a >> 1;
} | true | 4 | 4 | unsigned rshift(unsigned a)
{
return a >> 1;
} | /*@ assigns \nothing;
ensures \result == a / 2;
*/ | |
frama_c_files_v2/test_frama_c_2592.c | // Program to find index of an element in an array
// Behaviors not used in this program
/*@
requires n >= 0;
requires \valid_read(arr+(0..n-1));
assigns \nothing;
ensures -1 <= \result < n;
ensures 0 <= \result < n ==> arr[\result] == x;
ensures (\result == -1) ==> (\forall integer i; 0 <= i... |
/*@
requires n >= 0;
requires \valid_read(arr+(0..n-1));
assigns \nothing;
ensures -1 <= \result < n;
ensures 0 <= \result < n ==> arr[\result] == x;
ensures (\result == -1) ==> (\forall integer i; 0 <= i < n ==> arr[i] != x);
assigns \nothing;
*/ | int array_find(int* arr, int n, int x) {
int i = 0;
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer k; 0 <= k < i ==> arr[k] != x;
loop assigns i;
loop variant n-i;
*/
for (i = 0; i < n; i++) {
if (arr[i] == x) {
return i;
}
... | true | 18 | 18 | int array_find(int* arr, int n, int x) {
int i = 0;
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer k; 0 <= k < i ==> arr[k] != x;
loop assigns i;
loop variant n-i;
*/
for (i = 0; i < n; i++) {
if (arr[i] == x) {
return i;
}
... | /*@
requires n >= 0;
requires \valid_read(arr+(0..n-1));
assigns \nothing;
ensures -1 <= \result < n;
ensures 0 <= \result < n ==> arr[\result] == x;
ensures (\result == -1) ==> (\forall integer i; 0 <= i < n ==> arr[i] != x);
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1355.c | #include <limits.h>
/*@
requires ((x1>0) &&
\valid(x0+(0..x1-1)));
assigns \nothing;
ensures (((\result==-1) ==> (!(\exists int x56; (((0<=x56) &&
(x56<x1)) &&
(x0[x56]==x2))))) &&
((\result!=-1) ==> (((0<=\result) &&
(\result<x1)) &&
(x0[\result]==x2))));
*/
int member(int * x0, int x1, int x2) {
int x4 = -1;
... | #include <limits.h>
/*@
requires ((x1>0) &&
\valid(x0+(0..x1-1)));
assigns \nothing;
ensures (((\result==-1) ==> (!(\exists int x56; (((0<=x56) &&
(x56<x1)) &&
(x0[x56]==x2))))) &&
((\result!=-1) ==> (((0<=\result) &&
(\result<x1)) &&
(x0[\result]==x2))));
*/ | int member(int * x0, int x1, int x2) {
int x4 = -1;
/*@
loop invariant ((((0<=x6) &&
(x6<=x1)) &&
((x4==-1) ==> (!(\exists int x22; (((0<=x22) &&
(x22<x6)) &&
(x0[x22]==x2)))))) &&
((x4!=-1) ==> (((0<=x4) &&
(x4<x6)) &&
(x0[x4]==x2))));
loop assigns x6, x4;
loop variant (x1-x6);
*/
for(i... | true | 13 | 13 | int member(int * x0, int x1, int x2) {
int x4 = -1;
/*@
loop invariant ((((0<=x6) &&
(x6<=x1)) &&
((x4==-1) ==> (!(\exists int x22; (((0<=x22) &&
(x22<x6)) &&
(x0[x22]==x2)))))) &&
((x4!=-1) ==> (((0<=x4) &&
(x4<x6)) &&
(x0[x4]==x2))));
loop assigns x6, x4;
loop variant (x1-x6);
*/
for(i... | #include <limits.h>
/*@
requires ((x1>0) &&
\valid(x0+(0..x1-1)));
assigns \nothing;
ensures (((\result==-1) ==> (!(\exists int x56; (((0<=x56) &&
(x56<x1)) &&
(x0[x56]==x2))))) &&
((\result!=-1) ==> (((0<=\result) &&
(\result<x1)) &&
(x0[\result]==x2))));
*/ | |
frama_c_files_v2/test_frama_c_340.c | /*@ predicate swapped{L1,L2}(int *a, int *b) =
\at(*a, L2) == \at(*b,L1) &&
\at(*b, L2) == \at(*a,L1);
*/
/*@ requires \valid(a);
requires \valid(b);
assigns *a, *b;
ensures swapped{Pre, Post}(a, b);
*/
void swap(int *a, int *b)
{
int tmp = *a;
*a = *b;
*b = tmp;
}
|
/*@ predicate swapped{L1,L2}(int *a, int *b) =
\at(*a, L2) == \at(*b,L1) &&
\at(*b, L2) == \at(*a,L1);
*/
/*@ requires \valid(a);
requires \valid(b);
assigns *a, *b;
ensures swapped{Pre, Post}(a, b);
*/ | 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;
} | /*@ predicate swapped{L1,L2}(int *a, int *b) =
\at(*a, L2) == \at(*b,L1) &&
\at(*b, L2) == \at(*a,L1);
*/
/*@ requires \valid(a);
requires \valid(b);
assigns *a, *b;
ensures swapped{Pre, Post}(a, b);
*/ | |
frama_c_files_v2/test_frama_c_769.c | /*@
requires a >= -2147483648 && a <= 2147483647;
requires b >= -2147483648 && b <= 2147483647;
ensures \result == a;
*/
int trans(int a, int b){
int c = a;
b = c;
return b;
}
|
/*@
requires a >= -2147483648 && a <= 2147483647;
requires b >= -2147483648 && b <= 2147483647;
ensures \result == a;
*/ | int trans(int a, int b){
int c = a;
b = c;
return b;
} | true | 3 | 3 | int trans(int a, int b){
int c = a;
b = c;
return b;
} | /*@
requires a >= -2147483648 && a <= 2147483647;
requires b >= -2147483648 && b <= 2147483647;
ensures \result == a;
*/ | |
frama_c_files_v2/test_frama_c_456.c | /*@
requires \valid(p);
requires \valid(q);
assigns *p;
assigns *q;
ensures *p == \old(*q);
ensures *q == \old(*p);
*/
void swap(int* p, int* q){
int tmp = *p;
*p=*q;
*q=tmp;
return;
} |
/*@
requires \valid(p);
requires \valid(q);
assigns *p;
assigns *q;
ensures *p == \old(*q);
ensures *q == \old(*p);
*/ | void swap(int* p, int* q){
int tmp = *p;
*p=*q;
*q=tmp;
return;
} | true | 10 | 10 | void swap(int* p, int* q){
int tmp = *p;
*p=*q;
*q=tmp;
return;
} | /*@
requires \valid(p);
requires \valid(q);
assigns *p;
assigns *q;
ensures *p == \old(*q);
ensures *q == \old(*p);
*/ | |
frama_c_files_v2/test_frama_c_1378.c |
//find the max element of array
/*@
requires n>0;
requires \valid_read(arr+(0..n-1));
ensures \forall integer res;
0<=res<n ==> \result >= arr[res];
*/
int checkPrime(int arr[], int n)
{
int max = arr[0];
/*@
loop invariant \forall integer k;
0<=k<i ==> max>=arr[k];
loop invari... |
/*@
requires n>0;
requires \valid_read(arr+(0..n-1));
ensures \forall integer res;
0<=res<n ==> \result >= arr[res];
*/ | int checkPrime(int arr[], int n)
{
int max = arr[0];
/*@
loop invariant \forall integer k;
0<=k<i ==> max>=arr[k];
loop invariant 1<=i<=n;
loop assigns i, max;
loop variant n-i;
*/
for (int i = 1; i < n; i++)
{
if (max < arr[i])
{
max = arr[... | true | 14 | 14 | int checkPrime(int arr[], int n)
{
int max = arr[0];
/*@
loop invariant \forall integer k;
0<=k<i ==> max>=arr[k];
loop invariant 1<=i<=n;
loop assigns i, max;
loop variant n-i;
*/
for (int i = 1; i < n; i++)
{
if (max < arr[i])
{
max = arr[... | /*@
requires n>0;
requires \valid_read(arr+(0..n-1));
ensures \forall integer res;
0<=res<n ==> \result >= arr[res];
*/ | |
frama_c_files_v2/test_frama_c_490.c | /*@ requires \valid(a);
requires \valid(b);
assigns *a;
assigns *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
*/
void swap(int *a, int *b);
/*@ requires \valid(a);
requires \valid(b);
assigns *a, *b;
ensures *a <= *b;
behavior ret:
assumes *a <= *b;
ensures *a... |
/*@ requires \valid(a);
requires \valid(b);
assigns *a;
assigns *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
*/
void swap(int *a, int *b);
/*@ requires \valid(a);
requires \valid(b);
assigns *a, *b;
ensures *a <= *b;
behavior ret:
assumes *a <= *b;
ensures ... | void max_ptr(int *a, int *b)
{
if (*a <= *b) {
return;
} else {
swap(a, b);
}
} | true | 15 | 15 | void max_ptr(int *a, int *b)
{
if (*a <= *b) {
return;
} else {
swap(a, b);
}
} | /*@ requires \valid(a);
requires \valid(b);
assigns *a;
assigns *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
*/
void swap(int *a, int *b);
/*@ requires \valid(a);
requires \valid(b);
assigns *a, *b;
ensures *a <= *b;
behavior ret:
assumes *a <= *b;
ensures *a... | |
frama_c_files_v2/test_frama_c_2075.c | # pragma SeparationPolicy(none)
/*@
requires \valid(p);
requires \valid(q);
assigns *p;
assigns *q;
ensures *p == \old(*q);
ensures *q == \old(*p);
*/
void swap(int* p, int* q)
{
int const save = *p;
*p = *q;
*q = save;
}
int main () {
int p[2] = { 0,1};
int *q = (int *)((char*)q+1);
... |
/*@
requires \valid(p);
requires \valid(q);
assigns *p;
assigns *q;
ensures *p == \old(*q);
ensures *q == \old(*p);
*/ | void swap(int* p, int* q)
{
int const save = *p;
*p = *q;
*q = save;
} | true | 10 | 10 | void swap(int* p, int* q)
{
int const save = *p;
*p = *q;
*q = save;
} | /*@
requires \valid(p);
requires \valid(q);
assigns *p;
assigns *q;
ensures *p == \old(*q);
ensures *q == \old(*p);
*/ | |
frama_c_files_v2/test_frama_c_1166.c | #include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
assigns \nothing;
ensures ((\result==-1) || ((0<=\result) &&
(\result<=9)));
*/
int p(char * x0) {
int x8 = -1;
int x9 = 1/*true*/;
char x10 = '\0';
char *x11 = 0/*null*/;
char x2 = x0[0];
int x3 = x2 == ... | #include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
assigns \nothing;
ensures ((\result==-1) || ((0<=\result) &&
(\result<=9)));
*/ | int p(char * x0) {
int x8 = -1;
int x9 = 1/*true*/;
char x10 = '\0';
char *x11 = 0/*null*/;
char x2 = x0[0];
int x3 = x2 == '\0';
if (x3) {
x11 = x0;
} else {
int x4 = x2 >= '0';
int x6;
if (x4) {
int x5 = x2 <= '9';
x6 = x5;
} else {
x6 = 0/*false*/;
}
if... | true | 13 | 13 | int p(char * x0) {
int x8 = -1;
int x9 = 1/*true*/;
char x10 = '\0';
char *x11 = 0/*null*/;
char x2 = x0[0];
int x3 = x2 == '\0';
if (x3) {
x11 = x0;
} else {
int x4 = x2 >= '0';
int x6;
if (x4) {
int x5 = x2 <= '9';
x6 = x5;
} else {
x6 = 0/*false*/;
}
if... | #include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
assigns \nothing;
ensures ((\result==-1) || ((0<=\result) &&
(\result<=9)));
*/ | |
frama_c_files_v2/test_frama_c_1048.c | /* ****************************************************************************
MATRICE SYMÉTRIQUE
L'énoncé est introduit sous la forme de commentaires C. Les différents
morceaux de programme et de spécification à considérer sont mentionnés en
programmation littéraire :
... | #include <stdbool.h>
/*@ requires \valid(matrix[0..len-1]+(0..len-1));
@ requires \valid(matrix+(0..len-1));
@ requires len >= 0;
@ assigns \nothing;
@ behavior symm:
@ assumes \forall integer i,j; 0 <= i < len ==> 0 <= j < len ==> matrix[i][j] == matrix[j][i];
@ ensures \result == true;
@ behavior... | _Bool is_symmetric(int **matrix, int len) {
/*@loop invariant 0 <= i <= len;
@loop invariant \forall integer k, l; 0 <= k < i ==> 0 <= l < k ==> matrix[k][l] == matrix[l][k];
@loop assigns i;
@loop variant len - i;
@ */
for (int i = 0; i < len; i++)
/*@loop invariant 0 <= j <= i;
@loop invar... | true | 31 | 31 | _Bool is_symmetric(int **matrix, int len) {
/*@loop invariant 0 <= i <= len;
@loop invariant \forall integer k, l; 0 <= k < i ==> 0 <= l < k ==> matrix[k][l] == matrix[l][k];
@loop assigns i;
@loop variant len - i;
@ */
for (int i = 0; i < len; i++)
/*@loop invariant 0 <= j <= i;
@loop invar... | #include <stdbool.h>
/*@ requires \valid(matrix[0..len-1]+(0..len-1));
@ requires \valid(matrix+(0..len-1));
@ requires len >= 0;
@ assigns \nothing;
@ behavior symm:
@ assumes \forall integer i,j; 0 <= i < len ==> 0 <= j < len ==> matrix[i][j] == matrix[j][i];
@ ensures \result == true;
@ behavior... | |
frama_c_files_v2/test_frama_c_1499.c | /*@ assigns \nothing;
ensures \result == \max(a, b) - \min(a, b);
*/
unsigned distance(unsigned a, unsigned b)
{
return (a > b) ? (a - b) : (b - a);
}
|
/*@ 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);
} | /*@ assigns \nothing;
ensures \result == \max(a, b) - \min(a, b);
*/ | |
frama_c_files_v2/test_frama_c_365.c | #include <stdbool.h>
/*@ requires N > 0;
@ requires \valid(a+(0..N-1));
@ requires \forall integer i;
@ 0 <= i < N ==> -1000000000 <= a[i] <= 1000000000;
@ ensures \result <==> (\exists integer i, j;
@ 0 <= i < j < N && a[i] + a[j] == X);
@*/
bool sumx (int N, int a[], i... | #include <stdbool.h>
/*@ requires N > 0;
@ requires \valid(a+(0..N-1));
@ requires \forall integer i;
@ 0 <= i < N ==> -1000000000 <= a[i] <= 1000000000;
@ ensures \result <==> (\exists integer i, j;
@ 0 <= i < j < N && a[i] + a[j] == X);
@*/ | bool sumx (int N, int a[], int X)
{
int i, j;
/*@ loop invariant 0 <= i < N;
@ loop invariant \forall integer ii, jj;
@ 0 <= ii < jj < N && ii < i ==> a[ii] + a[jj] != X;
@ loop assigns i, j;
@ loop variant N-i-2;
@*/
for (i=0; i<N-1; i++)
/*@ loop invariant i+1 <= j <= N;... | true | 27 | 27 | bool sumx (int N, int a[], int X)
{
int i, j;
/*@ loop invariant 0 <= i < N;
@ loop invariant \forall integer ii, jj;
@ 0 <= ii < jj < N && ii < i ==> a[ii] + a[jj] != X;
@ loop assigns i, j;
@ loop variant N-i-2;
@*/
for (i=0; i<N-1; i++)
/*@ loop invariant i+1 <= j <= N;... | #include <stdbool.h>
/*@ requires N > 0;
@ requires \valid(a+(0..N-1));
@ requires \forall integer i;
@ 0 <= i < N ==> -1000000000 <= a[i] <= 1000000000;
@ ensures \result <==> (\exists integer i, j;
@ 0 <= i < j < N && a[i] + a[j] == X);
@*/ | |
frama_c_files_v2/test_frama_c_1194.c | #include <string.h>
/*@
requires strlen(a)>=0 && \valid(a+(0..strlen(a)));
assigns \nothing;
ensures 0<=\result || \result==-1;
*/
int my_atoi(char* a) {
int m = INT_MAX/10 - 10;
int r = 0;
char* s = a;
/*@
loop invariant strlen(s)>=0 && \valid(s+(0..strlen(s)));
loop invariant 0 <= r;
loop ass... | #include <string.h>
/*@
requires strlen(a)>=0 && \valid(a+(0..strlen(a)));
assigns \nothing;
ensures 0<=\result || \result==-1;
*/ | int my_atoi(char* a) {
int m = INT_MAX/10 - 10;
int r = 0;
char* s = a;
/*@
loop invariant strlen(s)>=0 && \valid(s+(0..strlen(s)));
loop invariant 0 <= r;
loop assigns r, s;
loop variant strlen(s);
*/
while ('0' <= *s && *s <= '9') {
if (r > m) return -1;
r = 10*r + (*s - '0');
... | true | 21 | 21 | int my_atoi(char* a) {
int m = INT_MAX/10 - 10;
int r = 0;
char* s = a;
/*@
loop invariant strlen(s)>=0 && \valid(s+(0..strlen(s)));
loop invariant 0 <= r;
loop assigns r, s;
loop variant strlen(s);
*/
while ('0' <= *s && *s <= '9') {
if (r > m) return -1;
r = 10*r + (*s - '0');
... | #include <string.h>
/*@
requires strlen(a)>=0 && \valid(a+(0..strlen(a)));
assigns \nothing;
ensures 0<=\result || \result==-1;
*/ | |
frama_c_files_v2/test_frama_c_1205.c | /*@ logic integer \fact(integer n) = (n <= 0) ? 1 : n * \fact(n-1);
*/
/*@ requires n >= 0 && n <= 10;
ensures \result == \fact(n);
assigns \nothing;
*/
int factorial(int n)
{
int i = 1;
int f = 1;
/*@
loop invariant 1 <= i <= n+1;
loop invariant f == \fact(i-1);
loop ass... |
/*@ logic integer \fact(integer n) = (n <= 0) ? 1 : n * \fact(n-1);
*/
/*@ requires n >= 0 && n <= 10;
ensures \result == \fact(n);
assigns \nothing;
*/ | int factorial(int n)
{
int i = 1;
int f = 1;
/*@
loop invariant 1 <= i <= n+1;
loop invariant f == \fact(i-1);
loop assigns f, i;
loop variant n-i+1;
*/
while (i<=n) {
f = f * i;
i = i + 1;
}
return f;
} | true | 14 | 14 | int factorial(int n)
{
int i = 1;
int f = 1;
/*@
loop invariant 1 <= i <= n+1;
loop invariant f == \fact(i-1);
loop assigns f, i;
loop variant n-i+1;
*/
while (i<=n) {
f = f * i;
i = i + 1;
}
return f;
} | /*@ logic integer \fact(integer n) = (n <= 0) ? 1 : n * \fact(n-1);
*/
/*@ requires n >= 0 && n <= 10;
ensures \result == \fact(n);
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2766.c | /* Generated by Frama-C */
int global_i;
int *global_i_ptr = & global_i;
int global_i = 0;
/*@ assigns \nothing; */
void loop(void)
{
return;
}
/*@ assigns \nothing; */
void __gen_e_acsl_loop(void)
{
loop();
return;
}
/*@ assigns global_i, global_i_ptr; */
int main(void)
{
int __retres;
/* Initialize glob... |
/*@ assigns \nothing; */ | void loop(void)
{
return;
} | true | 3 | 3 | void loop(void)
{
return;
} | /*@ assigns \nothing; */ | |
frama_c_files_v2/test_frama_c_422.c | /*@ axiomatic ellipsoids_proof_tactics {
@ type ellipsoids_tactics = Intuition | Tactic2;
@ predicate use_strategy (ellipsoids_tactics t);
@ }
*/
/*@ requires x < 0 && x > -1073741824;
@ ensures \result == 2 * (x + 1);
@ assigns \nothing;
*/
int plus_one (int x) {
int y,z;
{
/*@ assert x + 1 <= 107374... |
/*@ axiomatic ellipsoids_proof_tactics {
@ type ellipsoids_tactics = Intuition | Tactic2;
@ predicate use_strategy (ellipsoids_tactics t);
@ }
*/
/*@ requires x < 0 && x > -1073741824;
@ ensures \result == 2 * (x + 1);
@ assigns \nothing;
*/ | int plus_one (int x) {
int y,z;
{
/*@ assert x + 1 <= 1073741823; */
y = x + 1;
}
{
/*@ assert 2 * y <= 2147483647; */
z = 2 * y;
}
return z;
} | true | 10 | 10 | int plus_one (int x) {
int y,z;
{
/*@ assert x + 1 <= 1073741823; */
y = x + 1;
}
{
/*@ assert 2 * y <= 2147483647; */
z = 2 * y;
}
return z;
} | /*@ axiomatic ellipsoids_proof_tactics {
@ type ellipsoids_tactics = Intuition | Tactic2;
@ predicate use_strategy (ellipsoids_tactics t);
@ }
*/
/*@ requires x < 0 && x > -1073741824;
@ ensures \result == 2 * (x + 1);
@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1547.c | /*@
@ requires n > 0;
@ requires \valid_read(a+(0..n - 1));
@ requires \valid_read(b+(0..n - 1));
@ requires \valid(c+(0..n - 1));
@ requires \separated(a+(0..n-1), b+(0..n-1), c+(0..n-1));
@ requires \forall integer i; 0 <= i < n ==> -10000 <= a[i] <= 10000;
@ requires \forall integer i; 0 <= i < n ==> -... |
/*@
@ requires n > 0;
@ requires \valid_read(a+(0..n - 1));
@ requires \valid_read(b+(0..n - 1));
@ requires \valid(c+(0..n - 1));
@ requires \separated(a+(0..n-1), b+(0..n-1), c+(0..n-1));
@ requires \forall integer i; 0 <= i < n ==> -10000 <= a[i] <= 10000;
@ requires \forall integer i; 0 <= i < n ==>... | void sum_array(int a[], int b[], int c[], int n) {
/*@
@ loop invariant 0 <= i <= n;
@ loop invariant \valid_read(a+(0..n - 1));
@ loop invariant \valid_read(b+(0..n - 1));
@ loop invariant \valid(c+(0..n - 1));
@ loop invariant \forall integer j; 0 <= j < i ==> c[j] == a[j] + b[j];
... | true | 25 | 25 | void sum_array(int a[], int b[], int c[], int n) {
/*@
@ loop invariant 0 <= i <= n;
@ loop invariant \valid_read(a+(0..n - 1));
@ loop invariant \valid_read(b+(0..n - 1));
@ loop invariant \valid(c+(0..n - 1));
@ loop invariant \forall integer j; 0 <= j < i ==> c[j] == a[j] + b[j];
... | /*@
@ requires n > 0;
@ requires \valid_read(a+(0..n - 1));
@ requires \valid_read(b+(0..n - 1));
@ requires \valid(c+(0..n - 1));
@ requires \separated(a+(0..n-1), b+(0..n-1), c+(0..n-1));
@ requires \forall integer i; 0 <= i < n ==> -10000 <= a[i] <= 10000;
@ requires \forall integer i; 0 <= i < n ==> -... | |
frama_c_files_v2/test_frama_c_1212.c | /*@
requires \valid_read(p) && \valid_read(q);
requires -10000000<*p<10000000 && -10000000<*q<10000000;
ensures \result==*p+*q;
assigns \nothing;
*/
int add(int*p,int*q){
return*p + *q ;
}
/*@ assigns \nothing; */
int main(){
int a =24,b =42,x ;
x = add(&a, &b) ;
x = add(&a, &a) ;
} |
/*@
requires \valid_read(p) && \valid_read(q);
requires -10000000<*p<10000000 && -10000000<*q<10000000;
ensures \result==*p+*q;
assigns \nothing;
*/ | int add(int*p,int*q){
return*p + *q ;
} | true | 8 | 8 | int add(int*p,int*q){
return*p + *q ;
} | /*@
requires \valid_read(p) && \valid_read(q);
requires -10000000<*p<10000000 && -10000000<*q<10000000;
ensures \result==*p+*q;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_491.c | /*@
requires \valid(t+(0..n-1)) && n>0;
ensures (\forall integer i; 0<=i<n ==> t[i] == 0) ==> \result == 1;
ensures (\exists integer i; 0<=i<n && t[i] != 0) ==> \result == 0;
*/
int all_zeros(int t[], int n){
/*@
loop invariant 0<=i<=n;
loop invariant \forall integer j; 0 <= j < i ==> t[j] == 0;
loop assigns i;... |
/*@
requires \valid(t+(0..n-1)) && n>0;
ensures (\forall integer i; 0<=i<n ==> t[i] == 0) ==> \result == 1;
ensures (\exists integer i; 0<=i<n && t[i] != 0) ==> \result == 0;
*/ | int all_zeros(int t[], int n){
/*@
loop invariant 0<=i<=n;
loop invariant \forall integer j; 0 <= j < i ==> t[j] == 0;
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++){
if(t[i] != 0)
return 0;
}
return 1;
} | true | 13 | 13 | int all_zeros(int t[], int n){
/*@
loop invariant 0<=i<=n;
loop invariant \forall integer j; 0 <= j < i ==> t[j] == 0;
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++){
if(t[i] != 0)
return 0;
}
return 1;
} | /*@
requires \valid(t+(0..n-1)) && n>0;
ensures (\forall integer i; 0<=i<n ==> t[i] == 0) ==> \result == 1;
ensures (\exists integer i; 0<=i<n && t[i] != 0) ==> \result == 0;
*/ | |
frama_c_files_v2/test_frama_c_764.c | /*@
requires x >= 0;
ensures \result == x;
assigns \nothing;
*/
int foo(int x) {
return x;
} |
/*@
requires x >= 0;
ensures \result == x;
assigns \nothing;
*/ | int foo(int x) {
return x;
} | true | 4 | 4 | int foo(int x) {
return x;
} | /*@
requires x >= 0;
ensures \result == x;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_88.c | /*@ requires n <= 2147483646;
ensures \result == \old(n) + 1 ;
assigns \nothing; */
int incr(int n)
{
return n+1;
}; |
/*@ requires n <= 2147483646;
ensures \result == \old(n) + 1 ;
assigns \nothing; */ | int incr(int n)
{
return n+1;
} | true | 5 | 5 | int incr(int n)
{
return n+1;
} | /*@ requires n <= 2147483646;
ensures \result == \old(n) + 1 ;
assigns \nothing; */ | |
frama_c_files_v2/test_frama_c_2478.c | //@ predicate null(char *x) = x == 0;
//@ predicate eq(char *x, char *y) = x == y;
//@predicate my_null(char *x) = x == (void*)0;
void f(char *x) {
x = 0;
//@ assert x == (void*)0;
//@ assert my_null(x);
//@ assert null(x);
//@ assert eq(x,0);
}
//@ ensures \result == \true;
int g() { return 1; }
/*@ predi... |
/*@ predicate foo (integer x) = x != 0; */
/*@ ensures foo(1); */ | int h() { return 1; } | true | 3 | 3 | int h() { return 1; } | /*@ predicate foo (integer x) = x != 0; */
/*@ ensures foo(1); */ | |
frama_c_files_v2/test_frama_c_738.c | /*@ requires size>0;
requires \valid(t+(0..size-1));
requires \valid(s+(0..size-1));
requires \valid(r+(0..size-1));
requires \separated(t+(0..size-1), s+(0..size-1));
requires \separated(t+(0..size-1), r+(0..size-1));
requires \separated(s+(0..size-1), r+(0..size-1));
requires \forall integ... |
/*@ requires size>0;
requires \valid(t+(0..size-1));
requires \valid(s+(0..size-1));
requires \valid(r+(0..size-1));
requires \separated(t+(0..size-1), s+(0..size-1));
requires \separated(t+(0..size-1), r+(0..size-1));
requires \separated(s+(0..size-1), r+(0..size-1));
requires \forall int... | void sum(int t[],int s[], int r[], int size) {
/*@ loop invariant 0<=i<=size;
loop invariant \forall integer j; 0<=j<i ==> r[j]==t[j]+s[j];
loop assigns i, r[0..size-1];
loop variant size-i;
*/
for(int i=0;i<size;i++) {
r[i]=t[i]+s[i];
}
} | true | 22 | 22 | void sum(int t[],int s[], int r[], int size) {
/*@ loop invariant 0<=i<=size;
loop invariant \forall integer j; 0<=j<i ==> r[j]==t[j]+s[j];
loop assigns i, r[0..size-1];
loop variant size-i;
*/
for(int i=0;i<size;i++) {
r[i]=t[i]+s[i];
}
} | /*@ requires size>0;
requires \valid(t+(0..size-1));
requires \valid(s+(0..size-1));
requires \valid(r+(0..size-1));
requires \separated(t+(0..size-1), s+(0..size-1));
requires \separated(t+(0..size-1), r+(0..size-1));
requires \separated(s+(0..size-1), r+(0..size-1));
requires \forall integ... | |
frama_c_files_v2/test_frama_c_1862.c | #include <limits.h>
#include <string.h>
/*@ predicate submatcher_0(char * x22) = ((x22[0]=='\0') || (((x22[0]=='\0')) ? (0) : (((x22[0]=='a') &&
submatcher_0((x22+1))))));*/
/*@
requires ((strlen(x22)>=0) &&
\valid_read(x22+(0..strlen(x22))));
decreases strlen(x22);
assigns \nothing;
ensures \result <==> submatcher_0(... | #include <limits.h>
#include <string.h>
/*@ predicate submatcher_0(char * x22) = ((x22[0]=='\0') || (((x22[0]=='\0')) ? (0) : (((x22[0]=='a') &&
submatcher_0((x22+1))))));*/
/*@
requires ((strlen(x22)>=0) &&
\valid_read(x22+(0..strlen(x22))));
decreases strlen(x22);
assigns \nothing;
ensures \result <==> submatcher_0... | int submatcher_0(char * x22) {
char x24 = x22[0];
int x25 = x24 == '\0';
int x32;
if (x25) {
x32 = 0/*false*/;
} else {
int x26 = x24 == 'a';
int x30;
if (x26) {
char *x27 = x22+1;
int x28 = submatcher_0(x27);
x30 = x28;
} else {
x30 = 0/*false*/;
}
x32 = ... | true | 16 | 16 | int submatcher_0(char * x22) {
char x24 = x22[0];
int x25 = x24 == '\0';
int x32;
if (x25) {
x32 = 0/*false*/;
} else {
int x26 = x24 == 'a';
int x30;
if (x26) {
char *x27 = x22+1;
int x28 = submatcher_0(x27);
x30 = x28;
} else {
x30 = 0/*false*/;
}
x32 = ... | #include <limits.h>
#include <string.h>
/*@ predicate submatcher_0(char * x22) = ((x22[0]=='\0') || (((x22[0]=='\0')) ? (0) : (((x22[0]=='a') &&
submatcher_0((x22+1))))));*/
/*@
requires ((strlen(x22)>=0) &&
\valid_read(x22+(0..strlen(x22))));
decreases strlen(x22);
assigns \nothing;
ensures \result <==> submatcher_0... | |
frama_c_files_v2/test_frama_c_2779.c | #include<limits.h>
/*@ requires 0 < length <= INT_MAX && \valid_read(arr+(0..length-1));
requires \forall integer i,j; 0 <= i < j < length ==> arr[i] <= arr[j];
assigns \nothing;
ensures -1 <= \result < length &&
(\result == -1 ==> (\forall integer i; 0 <= i < length ==> arr[i] != query)) &&
(\... | #include<limits.h>
/*@ requires 0 < length <= INT_MAX && \valid_read(arr+(0..length-1));
requires \forall integer i,j; 0 <= i < j < length ==> arr[i] <= arr[j];
assigns \nothing;
ensures -1 <= \result < length &&
(\result == -1 ==> (\forall integer i; 0 <= i < length ==> arr[i] != query)) &&
(\... | int binary_search(int* arr, int length, int query) {
int low = 0;
int high = length - 1;
/*@
loop invariant 0 <= low <= high+1 <= length;
loop invariant \forall integer i; 0 <= i < low ==> arr[i] < query;
loop invariant \forall integer i; high < i < length ==> arr[i] > query;
loop assigns low, hig... | true | 25 | 25 | int binary_search(int* arr, int length, int query) {
int low = 0;
int high = length - 1;
/*@
loop invariant 0 <= low <= high+1 <= length;
loop invariant \forall integer i; 0 <= i < low ==> arr[i] < query;
loop invariant \forall integer i; high < i < length ==> arr[i] > query;
loop assigns low, hig... | #include<limits.h>
/*@ requires 0 < length <= INT_MAX && \valid_read(arr+(0..length-1));
requires \forall integer i,j; 0 <= i < j < length ==> arr[i] <= arr[j];
assigns \nothing;
ensures -1 <= \result < length &&
(\result == -1 ==> (\forall integer i; 0 <= i < length ==> arr[i] != query)) &&
(\... | |
frama_c_files_v2/test_frama_c_2936.c | /* This file is part of CPAchecker,
// a tool for configurable software verification:
// https://cpachecker.sosy-lab.org
//
// SPDX-FileCopyrightText: 2007-2020 Dirk Beyer <https://www.sosy-lab.org>
//
// SPDX-License-Identifier: Apache-2.0
*/
/*@
requires x > -2147483648;
assigns \nothing;
ensures \result... |
/*@
requires x > -2147483648;
assigns \nothing;
ensures \result >= 0;
behavior positive:
assumes x >= 0;
ensures \result == x;
behavior negative:
assumes x < 0;
ensures x != -2147483648 ==> \result == -x;
complete behaviors positive, negative;
disjoint behaviors pos... | int abs(int x) {
if (x < 0) {
return -x;
}
return x;
} | true | 10 | 10 | int abs(int x) {
if (x < 0) {
return -x;
}
return x;
} | /*@
requires x > -2147483648;
assigns \nothing;
ensures \result >= 0;
behavior positive:
assumes x >= 0;
ensures \result == x;
behavior negative:
assumes x < 0;
ensures x != -2147483648 ==> \result == -x;
complete behaviors positive, negative;
disjoint behaviors posit... | |
frama_c_files_v2/test_frama_c_2105.c | /*@ requires n>0 && \valid(a+(0..n-1));
@ assigns \nothing;
@ behavior success:
@ assumes \forall integer i; 0<=i<n-1 ==> a[i]<=a[i+1];
@ ensures \result==1;
@ behavior failure:
@ assumes \exists integer i; 0<=i<n-1 && a[i]>a[i+1];
@ ensures \result==0;
@ complete behaviors success, failure;
@... |
/*@ requires n>0 && \valid(a+(0..n-1));
@ assigns \nothing;
@ behavior success:
@ assumes \forall integer i; 0<=i<n-1 ==> a[i]<=a[i+1];
@ ensures \result==1;
@ behavior failure:
@ assumes \exists integer i; 0<=i<n-1 && a[i]>a[i+1];
@ ensures \result==0;
@ complete behaviors success, failure;
... | int isIncreasing(int a[], int n){
/*@ loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> a[j]<=a[j+1];
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n-1;i++){
if(a[i]>a[i+1]) return 0;
}
return 1;
} | true | 21 | 21 | int isIncreasing(int a[], int n){
/*@ loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> a[j]<=a[j+1];
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n-1;i++){
if(a[i]>a[i+1]) return 0;
}
return 1;
} | /*@ requires n>0 && \valid(a+(0..n-1));
@ assigns \nothing;
@ behavior success:
@ assumes \forall integer i; 0<=i<n-1 ==> a[i]<=a[i+1];
@ ensures \result==1;
@ behavior failure:
@ assumes \exists integer i; 0<=i<n-1 && a[i]>a[i+1];
@ ensures \result==0;
@ complete behaviors success, failure;
@... | |
frama_c_files_v2/test_frama_c_375.c | /*@
requires c > 0;
ensures \result == c;
assigns \nothing;
*/
int loop(int c) {
int x = c;
int y = 0;
/*@
loop invariant c == x + y && x >= 0 ;
loop assigns x, y;
loop variant x;
*/
while(x > 0) {
x = x - 1;
y = y + 1;
}
return y;
}
/*@ assigns \nothing; */
int main()
{
int result = loop(6);
return... |
/*@
requires c > 0;
ensures \result == c;
assigns \nothing;
*/ | int loop(int c) {
int x = c;
int y = 0;
/*@
loop invariant c == x + y && x >= 0 ;
loop assigns x, y;
loop variant x;
*/
while(x > 0) {
x = x - 1;
y = y + 1;
}
return y;
} | true | 11 | 11 | int loop(int c) {
int x = c;
int y = 0;
/*@
loop invariant c == x + y && x >= 0 ;
loop assigns x, y;
loop variant x;
*/
while(x > 0) {
x = x - 1;
y = y + 1;
}
return y;
} | /*@
requires c > 0;
ensures \result == c;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2149.c | /*@ assigns \nothing;
*/
void inconditional_exit(int state) {
exit (state);
} |
/*@ assigns \nothing;
*/ | void inconditional_exit(int state) {
exit (state);
} | true | 4 | 4 | void inconditional_exit(int state) {
exit (state);
} | /*@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1078.c | /*@
requires n > 0;
requires \valid_read(a + (0..n-1));
ensures \forall integer j; 0 <= j < n ==> \result >= a[j];
assigns \nothing;
*/
int Max_element(int a[], int n)
{
int max = a[0];
int i = 0;
/*@
loop invariant \forall integer j; 0 <= j < i ==> max >= a[j];
loop invariant 1 <= i <= n;
loo... |
/*@
requires n > 0;
requires \valid_read(a + (0..n-1));
ensures \forall integer j; 0 <= j < n ==> \result >= a[j];
assigns \nothing;
*/ | int Max_element(int a[], int n)
{
int max = a[0];
int i = 0;
/*@
loop invariant \forall integer j; 0 <= j < i ==> max >= a[j];
loop invariant 1 <= i <= n;
loop assigns i, max;
loop variant n - i;
*/
for (int i = 1; i < n; i++)
{
if (a[i] > max)
{
max = a[i];
... | true | 15 | 15 | int Max_element(int a[], int n)
{
int max = a[0];
int i = 0;
/*@
loop invariant \forall integer j; 0 <= j < i ==> max >= a[j];
loop invariant 1 <= i <= n;
loop assigns i, max;
loop variant n - i;
*/
for (int i = 1; i < n; i++)
{
if (a[i] > max)
{
max = a[i];
... | /*@
requires n > 0;
requires \valid_read(a + (0..n-1));
ensures \forall integer j; 0 <= j < n ==> \result >= a[j];
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2263.c | /*@
requires n > 0;
requires \valid(a + (0..n-1));
ensures \forall integer k; (0<=k<n) && (k%2==0) ==> (a[k] == 0);
assigns a[0..n-1];
*/
void func(int *a, int n) {
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer k; (0 <= k < i) && (k%2==0) ==> a[k] == 0;
loop invariant \vali... |
/*@
requires n > 0;
requires \valid(a + (0..n-1));
ensures \forall integer k; (0<=k<n) && (k%2==0) ==> (a[k] == 0);
assigns a[0..n-1];
*/ | void func(int *a, int n) {
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer k; (0 <= k < i) && (k%2==0) ==> a[k] == 0;
loop invariant \valid(a + (0..n-1));
loop assigns i, a[0..n-1];
loop variant n-i;
*/
for (int i = 0; i < n; i++) {
if (i%2==0)... | true | 17 | 17 | void func(int *a, int n) {
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer k; (0 <= k < i) && (k%2==0) ==> a[k] == 0;
loop invariant \valid(a + (0..n-1));
loop assigns i, a[0..n-1];
loop variant n-i;
*/
for (int i = 0; i < n; i++) {
if (i%2==0)... | /*@
requires n > 0;
requires \valid(a + (0..n-1));
ensures \forall integer k; (0<=k<n) && (k%2==0) ==> (a[k] == 0);
assigns a[0..n-1];
*/ | |
frama_c_files_v2/test_frama_c_33.c | /*@
@ requires -10000 <= x <= 10000;
@ requires 0 <= y <= 10000;
@
@ ensures \result == x * y;
@ assigns \nothing;
*/
int mult(int x, int y) {
int res = 0;
/*@
@ loop invariant 0 <= i <= y;
@ loop invariant res == i * x;
@ loop assigns res, i;
@ loop variant y - i;
... |
/*@
@ requires -10000 <= x <= 10000;
@ requires 0 <= y <= 10000;
@
@ ensures \result == x * y;
@ assigns \nothing;
*/ | int mult(int x, int y) {
int res = 0;
/*@
@ loop invariant 0 <= i <= y;
@ loop invariant res == i * x;
@ loop assigns res, i;
@ loop variant y - i;
*/
for (int i = 0; i < y; ++i) {
res += x;
}
return res;
} | true | 14 | 14 | int mult(int x, int y) {
int res = 0;
/*@
@ loop invariant 0 <= i <= y;
@ loop invariant res == i * x;
@ loop assigns res, i;
@ loop variant y - i;
*/
for (int i = 0; i < y; ++i) {
res += x;
}
return res;
} | /*@
@ requires -10000 <= x <= 10000;
@ requires 0 <= y <= 10000;
@
@ ensures \result == x * y;
@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1393.c | /* run.config
EXECNOW: make -s @PTEST_DIR@/@PTEST_NAME@.cmxs
OPT: -load-module @PTEST_DIR@/@PTEST_NAME@.cmxs
*/
/*@ requires x <= 0;
ensures \result == x;
assigns \nothing;
*/
int f(int x) { //@ assert x<=0;
int y = x;
/*@ assert y <= 0 &&
x == y; */
return y;
}
struct inner {
int a, b;
... |
/*@ requires x <= 0;
ensures \result == x;
assigns \nothing;
*/ | int f(int x) { //@ assert x<=0;
int y = x;
/*@ assert y <= 0 &&
x == y; */
return y;
} | true | 6 | 6 | int f(int x) { //@ assert x<=0;
int y = x;
/*@ assert y <= 0 &&
x == y; */
return y;
} | /*@ requires x <= 0;
ensures \result == x;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1123.c | /*@ axiomatic Count {
logic integer count{L}(int *a, integer m, integer n, integer p);
axiom count_base:
\forall int *a, integer m, integer n, integer p; m >= n ==> count(a, m, n, p) == 0;
axiom count_split:
\forall int *a, integer m, integer n, integer k, integer p; m <= n <= k ==> count(a, m... |
/*@ axiomatic Count {
logic integer count{L}(int *a, integer m, integer n, integer p);
axiom count_base:
\forall int *a, integer m, integer n, integer p; m >= n ==> count(a, m, n, p) == 0;
axiom count_split:
\forall int *a, integer m, integer n, integer k, integer p; m <= n <= k ==> count(a,... | void sort(int *a, int n)
{
/*@
loop invariant ordered(a, 0, i);
loop invariant 0 <= i <= n;
loop assigns i, a[0 .. n-1];
loop variant n - i;
*/
for (int i = 0; i < n; ++i) {
int min_pos = i;
/*@
loop invariant minimum(a, i, j, min_pos);
... | true | 34 | 34 | void sort(int *a, int n)
{
/*@
loop invariant ordered(a, 0, i);
loop invariant 0 <= i <= n;
loop assigns i, a[0 .. n-1];
loop variant n - i;
*/
for (int i = 0; i < n; ++i) {
int min_pos = i;
/*@
loop invariant minimum(a, i, j, min_pos);
... | /*@ axiomatic Count {
logic integer count{L}(int *a, integer m, integer n, integer p);
axiom count_base:
\forall int *a, integer m, integer n, integer p; m >= n ==> count(a, m, n, p) == 0;
axiom count_split:
\forall int *a, integer m, integer n, integer k, integer p; m <= n <= k ==> count(a, m... | |
frama_c_files_v2/test_frama_c_1986.c | /*@ axiomatic A {
}
*/
/*@ assigns \nothing; */
int main() { return 0; }
/*@ assigns \nothing; */
void f() {
int x = 0;
}
/*@ assigns \nothing; */
void g(char*s); |
/*@ axiomatic A {
}
*/
/*@ assigns \nothing; */
int main() { return 0; }
/*@ assigns \nothing; */ | void f() {
int x = 0;
} | true | 6 | 6 | void f() {
int x = 0;
} | /*@ axiomatic A {
}
*/
/*@ assigns \nothing; */
int main() { return 0; }
/*@ assigns \nothing; */ | |
frama_c_files_v2/test_frama_c_1726.c | #include <limits.h>
/* run.config
EXECNOW: make -s tests/aorai/Aorai_test.cmxs
OPT: -aorai-automata tests/aorai/test_acces_params.ya -aorai-test 1 -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
int status=0;
int rr=1;
//@ global invariant inv : 0<=rr<=5000;
/*@ requires rr<5000 &&... | #include <limits.h>
int rr=1;
/*@ requires rr<5000 && i >= INT_MIN - j && i <= INT_MAX - j;
@ assigns rr;
@ ensures rr == i + j;
@*/ | void opa(int i, int j) {
rr=i+j;
} | true | 6 | 6 | void opa(int i, int j) {
rr=i+j;
} | #include <limits.h>
int rr=1;
/*@ requires rr<5000 && i >= INT_MIN - j && i <= INT_MAX - j;
@ assigns rr;
@ ensures rr == i + j;
@*/ | |
frama_c_files_v2/test_frama_c_2942.c | #include <limits.h>
int e;
/*@ requires
INT_MIN / 4 <= x <= INT_MAX / 4;
ensures
\result == 4 * x && e == 4 * x;
assigns e;
*/
int f(int x) {
int y = 4 * x;
e = y;
return y;
}
int main() {
f(42);
return 0;
} | #include <limits.h>
int e;
/*@ requires
INT_MIN / 4 <= x <= INT_MAX / 4;
ensures
\result == 4 * x && e == 4 * x;
assigns e;
*/ | int f(int x) {
int y = 4 * x;
e = y;
return y;
} | true | 6 | 6 | int f(int x) {
int y = 4 * x;
e = y;
return y;
} | #include <limits.h>
int e;
/*@ requires
INT_MIN / 4 <= x <= INT_MAX / 4;
ensures
\result == 4 * x && e == 4 * x;
assigns e;
*/ | |
frama_c_files_v2/test_frama_c_496.c | /*@
requires -1000 <= n <= 1000; // Add a reasonable input range
decreases n > 100 ? 1 : 102 - n;
assigns \nothing;
ensures ((n <= 100) ==> (\result == 91));
ensures ((n > 100) ==> (\result == (n-10)));
*/
int foo(int n) {
if (n > 100) {
return n - 10;
} else {
return foo(foo(n + 11));
}
} |
/*@
requires -1000 <= n <= 1000; // Add a reasonable input range
decreases n > 100 ? 1 : 102 - n;
assigns \nothing;
ensures ((n <= 100) ==> (\result == 91));
ensures ((n > 100) ==> (\result == (n-10)));
*/ | int foo(int n) {
if (n > 100) {
return n - 10;
} else {
return foo(foo(n + 11));
}
} | true | 17 | 17 | int foo(int n) {
if (n > 100) {
return n - 10;
} else {
return foo(foo(n + 11));
}
} | /*@
requires -1000 <= n <= 1000; // Add a reasonable input range
decreases n > 100 ? 1 : 102 - n;
assigns \nothing;
ensures ((n <= 100) ==> (\result == 91));
ensures ((n > 100) ==> (\result == (n-10)));
*/ | |
frama_c_files_v2/test_frama_c_492.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_1799.c | /*@
requires n > 0;
requires \valid(arr+(0..n-1));
ensures \forall integer i; 0 <= i < n ==> arr[i] == 0;
*/
void arrayreset(int arr[], int n) {
/*@
loop invariant 0 <= j <= n;
loop invariant \forall integer i; 0 <= i < j ==> arr[i] == 0;
loop assigns j, arr[0..n-1];
loop variant n - j;
*/
for (int j=0; ... |
/*@
requires n > 0;
requires \valid(arr+(0..n-1));
ensures \forall integer i; 0 <= i < n ==> arr[i] == 0;
*/ | void arrayreset(int arr[], int n) {
/*@
loop invariant 0 <= j <= n;
loop invariant \forall integer i; 0 <= i < j ==> arr[i] == 0;
loop assigns j, arr[0..n-1];
loop variant n - j;
*/
for (int j=0; j<n; j++)
{
arr[j]=0;
}
} | true | 14 | 14 | void arrayreset(int arr[], int n) {
/*@
loop invariant 0 <= j <= n;
loop invariant \forall integer i; 0 <= i < j ==> arr[i] == 0;
loop assigns j, arr[0..n-1];
loop variant n - j;
*/
for (int j=0; j<n; j++)
{
arr[j]=0;
}
} | /*@
requires n > 0;
requires \valid(arr+(0..n-1));
ensures \forall integer i; 0 <= i < n ==> arr[i] == 0;
*/ | |
frama_c_files_v2/test_frama_c_2570.c | // In some versions of Frama-C, an additional option -pp-annot should be used to parse this example
#include <limits.h>
/*@
requires (*b >= 0 && *a <= INT_MAX - *b);
requires (*b < 0 && *a >= INT_MIN - *b);
requires \valid(a) && \valid(a);
assigns *a;
ensures *a == \old(*a) + *b;
*/
void incr_a_by_b(int* a,... | #include <limits.h>
/*@
requires (*b >= 0 && *a <= INT_MAX - *b);
requires (*b < 0 && *a >= INT_MIN - *b);
requires \valid(a) && \valid(a);
assigns *a;
ensures *a == \old(*a) + *b;
*/ | void incr_a_by_b(int* a, int const* b){
*a += *b;
} | true | 9 | 9 | void incr_a_by_b(int* a, int const* b){
*a += *b;
} | #include <limits.h>
/*@
requires (*b >= 0 && *a <= INT_MAX - *b);
requires (*b < 0 && *a >= INT_MIN - *b);
requires \valid(a) && \valid(a);
assigns *a;
ensures *a == \old(*a) + *b;
*/ | |
frama_c_files_v2/test_frama_c_1758.c | /*@ requires \valid(a+(0..length-1));
@ requires length > 0;
@ ensures \forall integer j; 0 <= j < length ==> a[\result] <= a[j];
@ assigns \nothing;
*/
int find_min(int* a, int length) {
int min, min_idx;
min_idx = 0;
min = a[0];
/*@ loop invariant 1 <= i <= length;
@ loop invariant 0 <= min_idx <... |
/*@ requires \valid(a+(0..length-1));
@ requires length > 0;
@ ensures \forall integer j; 0 <= j < length ==> a[\result] <= a[j];
@ assigns \nothing;
*/ | int find_min(int* a, int length) {
int min, min_idx;
min_idx = 0;
min = a[0];
/*@ loop invariant 1 <= i <= length;
@ loop invariant 0 <= min_idx < length;
@ loop invariant min == a[min_idx];
@ loop invariant \forall integer j; 0 <= j < i ==> min <= a[j];
@ loop assigns i, min_idx, min;
... | true | 22 | 22 | int find_min(int* a, int length) {
int min, min_idx;
min_idx = 0;
min = a[0];
/*@ loop invariant 1 <= i <= length;
@ loop invariant 0 <= min_idx < length;
@ loop invariant min == a[min_idx];
@ loop invariant \forall integer j; 0 <= j < i ==> min <= a[j];
@ loop assigns i, min_idx, min;
... | /*@ requires \valid(a+(0..length-1));
@ requires length > 0;
@ ensures \forall integer j; 0 <= j < length ==> a[\result] <= a[j];
@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1670.c | /* run.config
OPT: -load-module lib/plugins/Report -rte -rte-precond -then -val -then -report -report-print-properties
OPT: -load-module lib/plugins/Report -val -then -rte -rte-precond -then -report -report-print-properties
*/
// Fuse with precond.c when bts #1208 is solved
int x = 0;
/*@ requires i >= -1;
as... | int x = 0;
/*@ requires i >= -1;
assigns x;
ensures x == i;
*/ | void f (int i) {
x = i;
} | true | 4 | 4 | void f (int i) {
x = i;
} | int x = 0;
/*@ requires i >= -1;
assigns x;
ensures x == i;
*/ | |
frama_c_files_v2/test_frama_c_2047.c | /* run.config
EXECNOW: make tests/aorai/Aorai_test.cmxs
OPT: -aorai-ltl tests/aorai/test_boucle.ltl -aorai-test 1 -aorai-acceptance -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
/*@ requires \true;
@ ensures 0<=\result<=1;
@ assigns \nothing;
*/
int a() {
return 1;
}
/*@ re... |
/*@ requires \true;
@ ensures 0<=\result<=1;
@ assigns \nothing;
*/ | int a() {
return 1;
} | true | 4 | 4 | int a() {
return 1;
} | /*@ requires \true;
@ ensures 0<=\result<=1;
@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2047.c | /* run.config
EXECNOW: make tests/aorai/Aorai_test.cmxs
OPT: -aorai-ltl tests/aorai/test_boucle.ltl -aorai-test 1 -aorai-acceptance -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
/*@ requires \true;
@ ensures 0<=\result<=1;
@ assigns \nothing;
*/
int a() {
return 1;
}
/*@ re... |
/*@ requires \true;
@ ensures 0<=\result<=1;
@ assigns \nothing;
*/
int a() {
return 1;
}
/*@ requires \true;
@ ensures 1<=\result<=2;
@ assigns \nothing;
*/ | int b() {
//call_to_an_undefined_function();
return 2;
} | true | 8 | 8 | int b() {
//call_to_an_undefined_function();
return 2;
} | /*@ requires \true;
@ ensures 0<=\result<=1;
@ assigns \nothing;
*/
int a() {
return 1;
}
/*@ requires \true;
@ ensures 1<=\result<=2;
@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1621.c | /*@ requires \true;
@ behavior x_ge_y:
@ assumes x >= y;
@ ensures \result == x;
@ behavior x_lt_y:
@ assumes x < y;
@ ensures \result == y;
@ complete behaviors x_ge_y, x_lt_y;
@ disjoint behaviors x_ge_y, x_lt_y;
@*/
int max (int x, int y) {
if (x >= y) {
return x;
} else {
retur... |
/*@ requires \true;
@ behavior x_ge_y:
@ assumes x >= y;
@ ensures \result == x;
@ behavior x_lt_y:
@ assumes x < y;
@ ensures \result == y;
@ complete behaviors x_ge_y, x_lt_y;
@ disjoint behaviors x_ge_y, x_lt_y;
@*/ | int max (int x, int y) {
if (x >= y) {
return x;
} else {
return y;
}
} | true | 6 | 6 | int max (int x, int y) {
if (x >= y) {
return x;
} else {
return y;
}
} | /*@ requires \true;
@ behavior x_ge_y:
@ assumes x >= y;
@ ensures \result == x;
@ behavior x_lt_y:
@ assumes x < y;
@ ensures \result == y;
@ complete behaviors x_ge_y, x_lt_y;
@ disjoint behaviors x_ge_y, x_lt_y;
@*/ | |
frama_c_files_v2/test_frama_c_2457.c | /* run.config
COMMENT: test option -e-acsl-functions
LOG: gen_@PTEST_NAME@.c
OPT: -machdep gcc_x86_64 -e-acsl-functions f -e-acsl -then-last -load-script tests/print.cmxs -print -ocode tests/special/result/gen_@PTEST_NAME@.c -kernel-verbose 0 -eva-verbose 0 -eva -wp-rte
*/
/*@ requires \valid(p);
@ requires... |
/*@ requires \valid(p);
@ requires *p == 0;
@ ensures \result == 0;
@ assigns \nothing; */ | int f(int *p) {
/*@ loop invariant 0 <= i <= 1;
loop assigns i;
loop variant 1 - i; */
for(int i = 0; i < 1; i++) ;
return 0;
} | true | 11 | 11 | int f(int *p) {
/*@ loop invariant 0 <= i <= 1;
loop assigns i;
loop variant 1 - i; */
for(int i = 0; i < 1; i++) ;
return 0;
} | /*@ requires \valid(p);
@ requires *p == 0;
@ ensures \result == 0;
@ assigns \nothing; */ | |
frama_c_files_v2/test_frama_c_2457.c | /* run.config
COMMENT: test option -e-acsl-functions
LOG: gen_@PTEST_NAME@.c
OPT: -machdep gcc_x86_64 -e-acsl-functions f -e-acsl -then-last -load-script tests/print.cmxs -print -ocode tests/special/result/gen_@PTEST_NAME@.c -kernel-verbose 0 -eva-verbose 0 -eva -wp-rte
*/
/*@ requires \valid(p);
@ requires... |
/*@ requires \valid(p);
@ requires *p == 0;
@ ensures \result == 0;
@ assigns \nothing; */
int f(int *p) {
/*@ loop invariant 0 <= i <= 1;
loop assigns i;
loop variant 1 - i; */
for(int i = 0; i < 1; i++) ;
return 0;
}
/*@ requires \valid(p);
@ requires *p == 1;
@ ensures \result == 0;
... | int g(int *p) {
/*@ loop invariant 0 <= i <= 1;
loop assigns i;
loop variant 1 - i; */
for(int i = 0; i < 1; i++) ;
return 0;
} | true | 22 | 22 | int g(int *p) {
/*@ loop invariant 0 <= i <= 1;
loop assigns i;
loop variant 1 - i; */
for(int i = 0; i < 1; i++) ;
return 0;
} | /*@ requires \valid(p);
@ requires *p == 0;
@ ensures \result == 0;
@ assigns \nothing; */
int f(int *p) {
/*@ loop invariant 0 <= i <= 1;
loop assigns i;
loop variant 1 - i; */
for(int i = 0; i < 1; i++) ;
return 0;
}
/*@ requires \valid(p);
@ requires *p == 1;
@ ensures \result == 0;
@ ... | |
frama_c_files_v2/test_frama_c_371.c | /*@
@ requires 0 <= n <= 1000;
@ ensures \result == n * n;
@ assigns \nothing;
*/
int sum_n_odds(int n) {
int res = 0;
/*@
@ loop invariant 0 <= i <= n;
@ loop invariant res == i * i;
@ loop assigns res, i;
@ loop variant n - i;
*/
for (int i = 0; i < n; ++i) {
re... |
/*@
@ requires 0 <= n <= 1000;
@ ensures \result == n * n;
@ assigns \nothing;
*/ | int sum_n_odds(int n) {
int res = 0;
/*@
@ loop invariant 0 <= i <= n;
@ loop invariant res == i * i;
@ loop assigns res, i;
@ loop variant n - i;
*/
for (int i = 0; i < n; ++i) {
res += (2 * i) + 1;
}
return res;
} | true | 17 | 17 | int sum_n_odds(int n) {
int res = 0;
/*@
@ loop invariant 0 <= i <= n;
@ loop invariant res == i * i;
@ loop assigns res, i;
@ loop variant n - i;
*/
for (int i = 0; i < n; ++i) {
res += (2 * i) + 1;
}
return res;
} | /*@
@ requires 0 <= n <= 1000;
@ ensures \result == n * n;
@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1586.c | /*@ requires x >= -2147483647;
assigns \nothing;
ensures \result >= 0;
ensures x < 0 ==> \result == -x;
ensures x >= 0 ==> \result == x;
*/
int abs(int x)
{
if (x < 0)
return -x;
else
return x;
} |
/*@ requires x >= -2147483647;
assigns \nothing;
ensures \result >= 0;
ensures x < 0 ==> \result == -x;
ensures x >= 0 ==> \result == x;
*/ | int abs(int x)
{
if (x < 0)
return -x;
else
return x;
} | true | 8 | 8 | int abs(int x)
{
if (x < 0)
return -x;
else
return x;
} | /*@ requires x >= -2147483647;
assigns \nothing;
ensures \result >= 0;
ensures x < 0 ==> \result == -x;
ensures x >= 0 ==> \result == x;
*/ | |
frama_c_files_v2/test_frama_c_526.c | #include <stdbool.h>
/*@ requires n >= 0;
requires \valid_read(a + (0 .. n-1));
requires \valid_read(b + (0 .. n-1));
assigns \nothing;
behavior eq:
assumes \forall integer i; 0 <= i < n ==> a[i] == b[i];
ensures \result;
behavior neq:
assumes \exists integer i; 0 <= i < n && a[... | #include <stdbool.h>
/*@ requires n >= 0;
requires \valid_read(a + (0 .. n-1));
requires \valid_read(b + (0 .. n-1));
assigns \nothing;
behavior eq:
assumes \forall integer i; 0 <= i < n ==> a[i] == b[i];
ensures \result;
behavior neq:
assumes \exists integer i; 0 <= i < n && a[... | bool equal(int *a, int n, int *b)
{
/*@ 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(int i = 0; i < n; ++i) {
if (a[i] != b[i]) {
return false;
}
}
return true;
} | true | 19 | 19 | bool equal(int *a, int n, int *b)
{
/*@ 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(int i = 0; i < n; ++i) {
if (a[i] != b[i]) {
return false;
}
}
return true;
} | #include <stdbool.h>
/*@ requires n >= 0;
requires \valid_read(a + (0 .. n-1));
requires \valid_read(b + (0 .. n-1));
assigns \nothing;
behavior eq:
assumes \forall integer i; 0 <= i < n ==> a[i] == b[i];
ensures \result;
behavior neq:
assumes \exists integer i; 0 <= i < n && a[... | |
frama_c_files_v2/test_frama_c_1850.c | /*@
requires \valid(a) && \valid(b);
requires \separated(a,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 x = 2;
int y = 4;
swap(&x, &y);
//@ assert x == 4 && y == 2 ;
} |
/*@
requires \valid(a) && \valid(b);
requires \separated(a,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);
requires \separated(a,b);
assigns *a, *b;
ensures *a == \old(*b) && *b == \old(*a);
*/ | |
frama_c_files_v2/test_frama_c_569.c | /*@
requires x >= y > 0;
requires \valid (r);
ensures *r < y;
ensures x == \result*y + *r;
assigns *r;
*/
int fun(int x, int y , int *r) {
*r = x;
int d = 0;
/*@
loop invariant *r == x - y*d;
loop invariant d >= 0;
loop assigns *r, d;
loop variant *r;
... |
/*@
requires x >= y > 0;
requires \valid (r);
ensures *r < y;
ensures x == \result*y + *r;
assigns *r;
*/ | int fun(int x, int y , int *r) {
*r = x;
int d = 0;
/*@
loop invariant *r == x - y*d;
loop invariant d >= 0;
loop assigns *r, d;
loop variant *r;
*/
while (*r >= y) {
*r = *r - y;
d = d + 1;
}
return d;
} | true | 21 | 21 | int fun(int x, int y , int *r) {
*r = x;
int d = 0;
/*@
loop invariant *r == x - y*d;
loop invariant d >= 0;
loop assigns *r, d;
loop variant *r;
*/
while (*r >= y) {
*r = *r - y;
d = d + 1;
}
return d;
} | /*@
requires x >= y > 0;
requires \valid (r);
ensures *r < y;
ensures x == \result*y + *r;
assigns *r;
*/ | |
frama_c_files_v2/test_frama_c_1334.c | // complete is not effective, although negative is missing, taking it in/out doesn't make a difference still proved.
#pragma JessieIntegerModel(exact)
/*@ requires -2147483647 <= a <= 2147483647;
assigns \nothing;
behavior zero:
assumes a == 0;
ensures \result == 0;
behavior positive:
... |
/*@ requires -2147483647 <= a <= 2147483647;
assigns \nothing;
behavior zero:
assumes a == 0;
ensures \result == 0;
behavior positive:
assumes a > 0;
ensures \result == a;
behavior negative:
assumes a < 0;
ensures \result == -a;
complete behaviors zero... | int abs(int a)
{
if (a == 0)
return 0;
else if (a > 0)
return a;
else
return -a;
} | true | 11 | 11 | int abs(int a)
{
if (a == 0)
return 0;
else if (a > 0)
return a;
else
return -a;
} | /*@ requires -2147483647 <= a <= 2147483647;
assigns \nothing;
behavior zero:
assumes a == 0;
ensures \result == 0;
behavior positive:
assumes a > 0;
ensures \result == a;
behavior negative:
assumes a < 0;
ensures \result == -a;
complete behaviors zero, ... | |
frama_c_files_v2/test_frama_c_1047.c | /*@ requires 1==1;
*/
void test(long x)
{
unsigned a = 0x10203040;
unsigned b = (a << 16);
unsigned long long al = a;
unsigned long long bl = al << 16;
//@ assert b == (unsigned)bl;
//@ assert b == 0x30400000;
} |
/*@ requires 1==1;
*/ | void test(long x)
{
unsigned a = 0x10203040;
unsigned b = (a << 16);
unsigned long long al = a;
unsigned long long bl = al << 16;
//@ assert b == (unsigned)bl;
//@ assert b == 0x30400000;
} | true | 4 | 4 | void test(long x)
{
unsigned a = 0x10203040;
unsigned b = (a << 16);
unsigned long long al = a;
unsigned long long bl = al << 16;
//@ assert b == (unsigned)bl;
//@ assert b == 0x30400000;
} | /*@ requires 1==1;
*/ | |
frama_c_files_v2/test_frama_c_43.c | /*@ requires -1000000 < x < 1000000;
ensures \result == x + 1;
assigns \nothing; */
int f(int x) { return x+1; }
/*@ requires -1000000 < x < 1000000;
requires -1000000 < y < 1000000;
ensures \result == x + y + 1;
assigns \nothing; */
int g(int x, int y) { return (x+y+1); } |
/*@ requires -1000000 < x < 1000000;
ensures \result == x + 1;
assigns \nothing; */ | int f(int x) { return x+1; } | true | 5 | 5 | int f(int x) { return x+1; } | /*@ requires -1000000 < x < 1000000;
ensures \result == x + 1;
assigns \nothing; */ | |
frama_c_files_v2/test_frama_c_43.c | /*@ requires -1000000 < x < 1000000;
ensures \result == x + 1;
assigns \nothing; */
int f(int x) { return x+1; }
/*@ requires -1000000 < x < 1000000;
requires -1000000 < y < 1000000;
ensures \result == x + y + 1;
assigns \nothing; */
int g(int x, int y) { return (x+y+1); } |
/*@ requires -1000000 < x < 1000000;
ensures \result == x + 1;
assigns \nothing; */
int f(int x) { return x+1; }
/*@ requires -1000000 < x < 1000000;
requires -1000000 < y < 1000000;
ensures \result == x + y + 1;
assigns \nothing; */ | int g(int x, int y) { return (x+y+1); } | true | 12 | 12 | int g(int x, int y) { return (x+y+1); } | /*@ requires -1000000 < x < 1000000;
ensures \result == x + 1;
assigns \nothing; */
int f(int x) { return x+1; }
/*@ requires -1000000 < x < 1000000;
requires -1000000 < y < 1000000;
ensures \result == x + y + 1;
assigns \nothing; */ | |
frama_c_files_v2/test_frama_c_580.c | /*@
requires n > 0;
requires \valid(a + (0..n-1));
ensures \forall integer i;
0 <= i < n ==> a[i]==0;
*/
void Zero_array(int a[], int n)
{
/*@
loop invariant \forall integer i;
0 <= i < j ==> a[i]==0;
loop invariant 0 <= j <= n;
loop assigns j,a[0..n-1];
loop variant n - j;
*/
for (int j =... |
/*@
requires n > 0;
requires \valid(a + (0..n-1));
ensures \forall integer i;
0 <= i < n ==> a[i]==0;
*/ | void Zero_array(int a[], int n)
{
/*@
loop invariant \forall integer i;
0 <= i < j ==> a[i]==0;
loop invariant 0 <= j <= n;
loop assigns j,a[0..n-1];
loop variant n - j;
*/
for (int j = 0; j < n; j++)
{
a[j] = 0;
}
} | true | 14 | 14 | void Zero_array(int a[], int n)
{
/*@
loop invariant \forall integer i;
0 <= i < j ==> a[i]==0;
loop invariant 0 <= j <= n;
loop assigns j,a[0..n-1];
loop variant n - j;
*/
for (int j = 0; j < n; j++)
{
a[j] = 0;
}
} | /*@
requires n > 0;
requires \valid(a + (0..n-1));
ensures \forall integer i;
0 <= i < n ==> a[i]==0;
*/ | |
frama_c_files_v2/test_frama_c_2678.c | /*@ requires \valid(a+(0..n-1));
requires 0 <= i < n;
requires 0 <= j < n;
assigns a[i], a[j];
ensures a[i] == \old(a[j]);
ensures a[j] == \old(a[i]);
*/
static inline void swap(int a[], int i, int j, int n)
{
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
} |
/*@ requires \valid(a+(0..n-1));
requires 0 <= i < n;
requires 0 <= j < n;
assigns a[i], a[j];
ensures a[i] == \old(a[j]);
ensures a[j] == \old(a[i]);
*/ | static inline void swap(int a[], int i, int j, int n)
{
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
} | true | 10 | 10 | static inline void swap(int a[], int i, int j, int n)
{
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
} | /*@ requires \valid(a+(0..n-1));
requires 0 <= i < n;
requires 0 <= j < n;
assigns a[i], a[j];
ensures a[i] == \old(a[j]);
ensures a[j] == \old(a[i]);
*/ | |
frama_c_files_v2/test_frama_c_2944.c | /*@
requires -2147483647 <= n <= 2147483647;
ensures \result >=0;
assigns \nothing;
behavior positive:
assumes n >= 0;
ensures \result == n;
assigns \nothing;
behavior negative:
assumes n < 0;
ensures \result == -n;
assigns \nothing;
complete behaviors positive, negative;
disjoi... |
/*@
requires -2147483647 <= n <= 2147483647;
ensures \result >=0;
assigns \nothing;
behavior positive:
assumes n >= 0;
ensures \result == n;
assigns \nothing;
behavior negative:
assumes n < 0;
ensures \result == -n;
assigns \nothing;
complete behaviors positive, negative;
disj... | int abs(int n){
if(n<0){
return -n;
}
return n;
} | true | 14 | 14 | int abs(int n){
if(n<0){
return -n;
}
return n;
} | /*@
requires -2147483647 <= n <= 2147483647;
ensures \result >=0;
assigns \nothing;
behavior positive:
assumes n >= 0;
ensures \result == n;
assigns \nothing;
behavior negative:
assumes n < 0;
ensures \result == -n;
assigns \nothing;
complete behaviors positive, negative;
disjoi... | |
frama_c_files_v2/test_frama_c_1168.c | #include <limits.h>
/*@
requires (x > INT_MIN) && (y > INT_MIN) && (x >= y && x - y <= INT_MAX || x < y && x - y >= INT_MIN);
ensures y == x-\result;
assigns \nothing;
*/
int diff (int x, int y) {
return x-y;
}
/*@ assigns \nothing; */
void main() {
int t = diff(10, 5);
//@ assert t == 5;
} | #include <limits.h>
/*@
requires (x > INT_MIN) && (y > INT_MIN) && (x >= y && x - y <= INT_MAX || x < y && x - y >= INT_MIN);
ensures y == x-\result;
assigns \nothing;
*/ | int diff (int x, int y) {
return x-y;
} | true | 6 | 6 | int diff (int x, int y) {
return x-y;
} | #include <limits.h>
/*@
requires (x > INT_MIN) && (y > INT_MIN) && (x >= y && x - y <= INT_MAX || x < y && x - y >= INT_MIN);
ensures y == x-\result;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_286.c | #include "limits.h"
/*@ requires b != 0;
@ requires !(a == INT_MIN && b == -1);
@ ensures \result == a/b;
@ assigns \nothing;
@*/
int div(int a, int b) {
return a / b;
} | #include "limits.h"
/*@ requires b != 0;
@ requires !(a == INT_MIN && b == -1);
@ ensures \result == a/b;
@ assigns \nothing;
@*/ | int div(int a, int b) {
return a / b;
} | true | 6 | 6 | int div(int a, int b) {
return a / b;
} | #include "limits.h"
/*@ requires b != 0;
@ requires !(a == INT_MIN && b == -1);
@ ensures \result == a/b;
@ assigns \nothing;
@*/ | |
frama_c_files_v2/test_frama_c_1562.c | /* run.config
OPT: -rpp
*/
/*
* Based on http://stackoverflow.xluat.com/questions/31235938/java-order-by-priority-list
*
*/
struct MyClass{
int Name;
};
struct hack{
int t[3];
};
/*@ assigns \result \from x,y;
@ ensures x < y ==> \result == -1;
@ ensures x > y ==> \result == 1;
@ ensures x == y ==> ... |
/*@ assigns \result \from x,y;
@ ensures x < y ==> \result == -1;
@ ensures x > y ==> \result == 1;
@ ensures x == y ==> \result == 0;
*/ | int IntCompare(int x, int y){
if (x < y){
return -1;
}
if(x > y){
return 1;
}
return 0;
} | true | 8 | 8 | int IntCompare(int x, int y){
if (x < y){
return -1;
}
if(x > y){
return 1;
}
return 0;
} | /*@ assigns \result \from x,y;
@ ensures x < y ==> \result == -1;
@ ensures x > y ==> \result == 1;
@ ensures x == y ==> \result == 0;
*/ | |
frama_c_files_v2/test_frama_c_348.c | /*@ requires n>0;
requires \valid(t+(0..n-1));
assigns t[0..n-1];
ensures \forall integer i; 0<=i<n ==> t[i] == i ;
ensures \forall integer i; 0<=i<n-1 ==> t[i] <= t[i+1];
*/
int doubleint(int t[],int n) {
/*@ loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> t[j] == j ;
loo... |
/*@ requires n>0;
requires \valid(t+(0..n-1));
assigns t[0..n-1];
ensures \forall integer i; 0<=i<n ==> t[i] == i ;
ensures \forall integer i; 0<=i<n-1 ==> t[i] <= t[i+1];
*/ | int doubleint(int t[],int n) {
/*@ loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> t[j] == j ;
loop assigns i, t[0..n-1];
loop variant n-i;
*/
for(int i=0;i<n;i++) {
t[i]=i;
}
return 0;
} | true | 17 | 17 | int doubleint(int t[],int n) {
/*@ loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> t[j] == j ;
loop assigns i, t[0..n-1];
loop variant n-i;
*/
for(int i=0;i<n;i++) {
t[i]=i;
}
return 0;
} | /*@ requires n>0;
requires \valid(t+(0..n-1));
assigns t[0..n-1];
ensures \forall integer i; 0<=i<n ==> t[i] == i ;
ensures \forall integer i; 0<=i<n-1 ==> t[i] <= t[i+1];
*/ | |
frama_c_files_v2/test_frama_c_2821.c | /*@
requires \valid(t+(0..taille-1)) && taille>0;
assigns \nothing;
ensures (\forall integer i; 0<=i<taille-1 ==> t[i]<=t[i+1]) ==> \result==1;
ensures (\exists integer i; 0<=i<taille-1 && t[i]>t[i+1]) ==> \result==0;
*/
int increasing(int t[], int taille){
/*@
loop invariant 0<=i<=taille-1;
loop in... |
/*@
requires \valid(t+(0..taille-1)) && taille>0;
assigns \nothing;
ensures (\forall integer i; 0<=i<taille-1 ==> t[i]<=t[i+1]) ==> \result==1;
ensures (\exists integer i; 0<=i<taille-1 && t[i]>t[i+1]) ==> \result==0;
*/ | int increasing(int t[], int taille){
/*@
loop invariant 0<=i<=taille-1;
loop invariant \forall integer j; 0<=j<i ==> t[j]<=t[j+1];
loop assigns i;
loop variant taille-i-1;
*/
for(int i=0;i<taille-1;i++){
if(t[i]>t[i+1]) return 0;
}
return 1;
} | true | 19 | 19 | int increasing(int t[], int taille){
/*@
loop invariant 0<=i<=taille-1;
loop invariant \forall integer j; 0<=j<i ==> t[j]<=t[j+1];
loop assigns i;
loop variant taille-i-1;
*/
for(int i=0;i<taille-1;i++){
if(t[i]>t[i+1]) return 0;
}
return 1;
} | /*@
requires \valid(t+(0..taille-1)) && taille>0;
assigns \nothing;
ensures (\forall integer i; 0<=i<taille-1 ==> t[i]<=t[i+1]) ==> \result==1;
ensures (\exists integer i; 0<=i<taille-1 && t[i]>t[i+1]) ==> \result==0;
*/ | |
frama_c_files_v2/test_frama_c_1158.c | #pragma CIVL ACSL
enum t{RED, BLUE};
/*@ requires \valid_read(a) && *a==BLUE;
@ ensures \result == 2;
@ assigns \nothing;
@*/
int f(enum t* a){
return (*a)*2;
} | enum t{RED, BLUE};
/*@ requires \valid_read(a) && *a==BLUE;
@ ensures \result == 2;
@ assigns \nothing;
@*/ | int f(enum t* a){
return (*a)*2;
} | true | 5 | 5 | int f(enum t* a){
return (*a)*2;
} | enum t{RED, BLUE};
/*@ requires \valid_read(a) && *a==BLUE;
@ ensures \result == 2;
@ assigns \nothing;
@*/ | |
frama_c_files_v2/test_frama_c_815.c | /*@
requires n > 0;
requires \valid_read(a + (0..n-1));
ensures \forall integer i; 0 <= i < n ==> \result <= a[i];
*/
int Min_elements(int a[], int n)
{
int min = a[0];
/*@
loop invariant 1 <= j <= n;
loop invariant \forall integer k; 0 <= k < j ==> min <= a[k];
loop assigns j, min;
loop variant n - j... |
/*@
requires n > 0;
requires \valid_read(a + (0..n-1));
ensures \forall integer i; 0 <= i < n ==> \result <= a[i];
*/ | int Min_elements(int a[], int n)
{
int min = a[0];
/*@
loop invariant 1 <= j <= n;
loop invariant \forall integer k; 0 <= k < j ==> min <= a[k];
loop assigns j, min;
loop variant n - j;
*/
for (int j = 1; j < n; j++)
{
if (a[j] < min)
min = a[j];
}
return min;
} | true | 14 | 14 | int Min_elements(int a[], int n)
{
int min = a[0];
/*@
loop invariant 1 <= j <= n;
loop invariant \forall integer k; 0 <= k < j ==> min <= a[k];
loop assigns j, min;
loop variant n - j;
*/
for (int j = 1; j < n; j++)
{
if (a[j] < min)
min = a[j];
}
return min;
} | /*@
requires n > 0;
requires \valid_read(a + (0..n-1));
ensures \forall integer i; 0 <= i < n ==> \result <= a[i];
*/ | |
frama_c_files_v2/test_frama_c_1891.c | #include <limits.h>
/*@
requires INT_MIN <= a - b <= INT_MAX;
ensures (\result == a - b);
assigns \nothing;
*/
int sub(int a,int b)
{
int diff = a - b;
return diff;
}
/*@ assigns \nothing; */
int main(void)
{
int a = 7;
int b = 6;
sub(a,b);
return 0;
} | #include <limits.h>
/*@
requires INT_MIN <= a - b <= INT_MAX;
ensures (\result == a - b);
assigns \nothing;
*/ | int sub(int a,int b)
{
int diff = a - b;
return diff;
} | true | 6 | 6 | int sub(int a,int b)
{
int diff = a - b;
return diff;
} | #include <limits.h>
/*@
requires INT_MIN <= a - b <= INT_MAX;
ensures (\result == a - b);
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_482.c | /*@ requires \valid_read(t+(0..tt-1)) && tt>0;
requires \valid_read(s+(0..ts-1)) && ts>0;
requires \valid(r+(0..tt+ts-1));
requires 0<tt<100;
requires 0<ts<100;
requires \separated(t+(0..tt-1), s+(0..ts-1), r+(0..tt+ts-1));
ensures \forall integer i; 0<=i<tt ==> r[i]==t[i];
ensures \forall i... |
/*@ requires \valid_read(t+(0..tt-1)) && tt>0;
requires \valid_read(s+(0..ts-1)) && ts>0;
requires \valid(r+(0..tt+ts-1));
requires 0<tt<100;
requires 0<ts<100;
requires \separated(t+(0..tt-1), s+(0..ts-1), r+(0..tt+ts-1));
ensures \forall integer i; 0<=i<tt ==> r[i]==t[i];
ensures \forall... | void concat(int t[], int tt, int s[], int ts, int r[]){
/*@ loop invariant 0<=i<=tt;
loop invariant \forall integer j; 0<=j<i ==> r[j]==t[j];
loop assigns i, r[0..tt+ts-1];
loop variant tt-i;
*/
for(int i=0;i<tt;i++){
/*@ assert \forall integer j; 0<=j<i ==> r[j]==t[j]; */
r[i]=t[i];
}... | true | 36 | 36 | void concat(int t[], int tt, int s[], int ts, int r[]){
/*@ loop invariant 0<=i<=tt;
loop invariant \forall integer j; 0<=j<i ==> r[j]==t[j];
loop assigns i, r[0..tt+ts-1];
loop variant tt-i;
*/
for(int i=0;i<tt;i++){
/*@ assert \forall integer j; 0<=j<i ==> r[j]==t[j]; */
r[i]=t[i];
}... | /*@ requires \valid_read(t+(0..tt-1)) && tt>0;
requires \valid_read(s+(0..ts-1)) && ts>0;
requires \valid(r+(0..tt+ts-1));
requires 0<tt<100;
requires 0<ts<100;
requires \separated(t+(0..tt-1), s+(0..ts-1), r+(0..tt+ts-1));
ensures \forall integer i; 0<=i<tt ==> r[i]==t[i];
ensures \forall i... | |
frama_c_files_v2/test_frama_c_2479.c | #include "limits.h"
/*@
requires
a*x <= INT_MAX
&& a*x+b <= INT_MAX
&& a*x >= INT_MIN
&& a*x+b >= INT_MIN;
ensures \result >= INT_MIN && \result <= INT_MAX && \result == a*x+b;
*/
int f(int a,int b,int x) {
return a*x+b;
} | #include "limits.h"
/*@
requires
a*x <= INT_MAX
&& a*x+b <= INT_MAX
&& a*x >= INT_MIN
&& a*x+b >= INT_MIN;
ensures \result >= INT_MIN && \result <= INT_MAX && \result == a*x+b;
*/ | int f(int a,int b,int x) {
return a*x+b;
} | true | 7 | 7 | int f(int a,int b,int x) {
return a*x+b;
} | #include "limits.h"
/*@
requires
a*x <= INT_MAX
&& a*x+b <= INT_MAX
&& a*x >= INT_MIN
&& a*x+b >= INT_MIN;
ensures \result >= INT_MIN && \result <= INT_MAX && \result == a*x+b;
*/ | |
frama_c_files_v2/test_frama_c_1549.c | /*@ requires \valid(t+(0..n-1)) && n>0;
behavior success:
assumes \exists integer i; 0<=i<n && t[i]==val;
ensures 0<=\result<n;
behavior failure:
assumes \forall integer i; 0<=i<n ==> t[i]!=val;
ensures \result==-1;
complete behaviors success, failure;
disjoint behaviors ... |
/*@ requires \valid(t+(0..n-1)) && n>0;
behavior success:
assumes \exists integer i; 0<=i<n && t[i]==val;
ensures 0<=\result<n;
behavior failure:
assumes \forall integer i; 0<=i<n ==> t[i]!=val;
ensures \result==-1;
complete behaviors success, failure;
disjoint behavior... | int index(int t[], int val, int n){
/*@ loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> t[j]!=val;
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++){
if(t[i]==val) return i;
}
return -1;
} | true | 15 | 15 | int index(int t[], int val, int n){
/*@ loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> t[j]!=val;
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++){
if(t[i]==val) return i;
}
return -1;
} | /*@ requires \valid(t+(0..n-1)) && n>0;
behavior success:
assumes \exists integer i; 0<=i<n && t[i]==val;
ensures 0<=\result<n;
behavior failure:
assumes \forall integer i; 0<=i<n ==> t[i]!=val;
ensures \result==-1;
complete behaviors success, failure;
disjoint behaviors ... | |
frama_c_files_v2/test_frama_c_2295.c | /*@
requires \valid(t+(0..n-1)) && n > 0;
ensures \forall integer i; 0<=i<n ==> t[\result] <= t[i];
ensures \exists integer i; 0<=i<n && i == \result;
assigns \nothing;
*/
int min(int t[], int n) {
int index = 0;
/*@
loop invariant 1 <= i <= n;
loop invariant 0<=index<n;
loop invariant \forall integer j; 0<=j<i ==... |
/*@
requires \valid(t+(0..n-1)) && n > 0;
ensures \forall integer i; 0<=i<n ==> t[\result] <= t[i];
ensures \exists integer i; 0<=i<n && i == \result;
assigns \nothing;
*/ | int min(int t[], int n) {
int index = 0;
/*@
loop invariant 1 <= i <= n;
loop invariant 0<=index<n;
loop invariant \forall integer j; 0<=j<i ==> t[index] <= t[j];
loop assigns index, i;
loop variant n - i;
*/
for (int i = 1; i < n; i++){
if (t[i] < t[index]) {
index=i;
//@ assert ... | true | 18 | 18 | int min(int t[], int n) {
int index = 0;
/*@
loop invariant 1 <= i <= n;
loop invariant 0<=index<n;
loop invariant \forall integer j; 0<=j<i ==> t[index] <= t[j];
loop assigns index, i;
loop variant n - i;
*/
for (int i = 1; i < n; i++){
if (t[i] < t[index]) {
index=i;
//@ assert ... | /*@
requires \valid(t+(0..n-1)) && n > 0;
ensures \forall integer i; 0<=i<n ==> t[\result] <= t[i];
ensures \exists integer i; 0<=i<n && i == \result;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1729.c | /*@ requires \valid_read(p+(0..n-1));
@ ensures \result == 0;
@ assigns \nothing;
@ */
int somefun(char *p, int n) {
return 0;
} |
/*@ requires \valid_read(p+(0..n-1));
@ ensures \result == 0;
@ assigns \nothing;
@ */ | int somefun(char *p, int n) {
return 0;
} | true | 4 | 4 | int somefun(char *p, int n) {
return 0;
} | /*@ requires \valid_read(p+(0..n-1));
@ ensures \result == 0;
@ assigns \nothing;
@ */ | |
frama_c_files_v2/test_frama_c_2489.c | /*@ ensures (x==0||y==1)?\result==1:\result == 0;
assigns \nothing;
*/
int f(int x, int y) { return (x==0||y==1); }
/*@ assigns \nothing; */
int main() {
int x = f(42,1);
int y = f(0,36);
return 0;
} |
/*@ ensures (x==0||y==1)?\result==1:\result == 0;
assigns \nothing;
*/ | int f(int x, int y) { return (x==0||y==1); } | true | 6 | 6 | int f(int x, int y) { return (x==0||y==1); } | /*@ ensures (x==0||y==1)?\result==1:\result == 0;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_186.c | /*@ requires 0 <= n <= 1000;
ensures \result == n*(n-1)/2;
*/
int sum(int n){
int res=0;
/*@ loop invariant 0<=i<=n;
loop invariant res == i*(i-1)/2;
loop assigns res, i;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
res+=i;
}
return res;
} |
/*@ requires 0 <= n <= 1000;
ensures \result == n*(n-1)/2;
*/ | int sum(int n){
int res=0;
/*@ loop invariant 0<=i<=n;
loop invariant res == i*(i-1)/2;
loop assigns res, i;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
res+=i;
}
return res;
} | true | 13 | 13 | int sum(int n){
int res=0;
/*@ loop invariant 0<=i<=n;
loop invariant res == i*(i-1)/2;
loop assigns res, i;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
res+=i;
}
return res;
} | /*@ requires 0 <= n <= 1000;
ensures \result == n*(n-1)/2;
*/ | |
frama_c_files_v2/test_frama_c_1009.c | /*@ requires b != 0 && (a != -2147483648 || b != -1); // Prevent potential overflow
assigns \nothing;
ensures \result == (a % b);
*/
int mod(int a, int b)
{
return a % b;
} |
/*@ requires b != 0 && (a != -2147483648 || b != -1); // Prevent potential overflow
assigns \nothing;
ensures \result == (a % b);
*/ | int mod(int a, int b)
{
return a % b;
} | true | 6 | 6 | int mod(int a, int b)
{
return a % b;
} | /*@ requires b != 0 && (a != -2147483648 || b != -1); // Prevent potential overflow
assigns \nothing;
ensures \result == (a % b);
*/ | |
frama_c_files_v2/test_frama_c_2409.c | #include <stdbool.h>
/*@
requires \valid(t1+(0..n-1)) && \valid(t2+(0..n-1)) && n>0;
ensures (\forall integer i; 0<=i<n ==> t1[i] == t2[i]) ==> \result==1;
ensures (\exists integer i; 0<=i<n && t1[i] != t2[i]) ==> \result==0;
assigns \nothing;
*/
int compare(int t1[], int t2[], int n){
int i=0;
bool diff_found =... | #include <stdbool.h>
/*@
requires \valid(t1+(0..n-1)) && \valid(t2+(0..n-1)) && n>0;
ensures (\forall integer i; 0<=i<n ==> t1[i] == t2[i]) ==> \result==1;
ensures (\exists integer i; 0<=i<n && t1[i] != t2[i]) ==> \result==0;
assigns \nothing;
*/ | int compare(int t1[], int t2[], int n){
int i=0;
bool diff_found = 0;
/*@
loop invariant 0<=i<=n;
loop invariant (\forall integer j; 0<=j<i ==> t1[j] == t2[j]) || (i == 0);
loop invariant !diff_found ==> (\forall integer j; 0<=j<i ==> t1[j] == t2[j]);
loop invariant diff_found ==> (\exists integer j; 0<=j<i ... | true | 23 | 23 | int compare(int t1[], int t2[], int n){
int i=0;
bool diff_found = 0;
/*@
loop invariant 0<=i<=n;
loop invariant (\forall integer j; 0<=j<i ==> t1[j] == t2[j]) || (i == 0);
loop invariant !diff_found ==> (\forall integer j; 0<=j<i ==> t1[j] == t2[j]);
loop invariant diff_found ==> (\exists integer j; 0<=j<i ... | #include <stdbool.h>
/*@
requires \valid(t1+(0..n-1)) && \valid(t2+(0..n-1)) && n>0;
ensures (\forall integer i; 0<=i<n ==> t1[i] == t2[i]) ==> \result==1;
ensures (\exists integer i; 0<=i<n && t1[i] != t2[i]) ==> \result==0;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2892.c | /*@
requires \valid_read(t+(0..n-1)) && n > 0;
ensures \forall integer i; 0<=i<n ==> \result <= t[i];
ensures \exists integer i; 0<=i<n && t[i] == \result;
assigns \nothing;
*/
int min(int t[], int n) {
int res = t[0];
/*@
loop invariant 1 <= i <= n;
loop invariant \forall integer j; 0 <= j < i ==> res <= t[j];
lo... |
/*@
requires \valid_read(t+(0..n-1)) && n > 0;
ensures \forall integer i; 0<=i<n ==> \result <= t[i];
ensures \exists integer i; 0<=i<n && t[i] == \result;
assigns \nothing;
*/ | int min(int t[], int n) {
int res = t[0];
/*@
loop invariant 1 <= i <= n;
loop invariant \forall integer j; 0 <= j < i ==> res <= t[j];
loop invariant \exists integer j; 0 <= j < i && res == t[j];
loop assigns res, i;
loop variant n - i;
*/
for (int i = 1; i < n; i++)
if (t[i] < res) res = t[i];
return res;... | true | 18 | 18 | int min(int t[], int n) {
int res = t[0];
/*@
loop invariant 1 <= i <= n;
loop invariant \forall integer j; 0 <= j < i ==> res <= t[j];
loop invariant \exists integer j; 0 <= j < i && res == t[j];
loop assigns res, i;
loop variant n - i;
*/
for (int i = 1; i < n; i++)
if (t[i] < res) res = t[i];
return res;... | /*@
requires \valid_read(t+(0..n-1)) && n > 0;
ensures \forall integer i; 0<=i<n ==> \result <= t[i];
ensures \exists integer i; 0<=i<n && t[i] == \result;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2638.c | /*@
axiomatic LCM {
logic integer lcm(integer m, integer n);
}
*/
/*@ requires a>0 && b>0;
decreases a+b;
assigns \nothing;
ensures a == 0 ==> \result == b;
ensures b == 0 ==> \result == a;
ensures a == b ==> \result == a;
*/
int gcd(int a, int b) {
if (a == 0)
return b;
if (b == 0)
... |
/*@
axiomatic LCM {
logic integer lcm(integer m, integer n);
}
*/
/*@ requires a>0 && b>0;
decreases a+b;
assigns \nothing;
ensures a == 0 ==> \result == b;
ensures b == 0 ==> \result == a;
ensures a == b ==> \result == a;
*/ | int gcd(int a, int b) {
if (a == 0)
return b;
if (b == 0)
return a;
if (a == b)
return a;
if (a > b)
return gcd(a-b, b);
return gcd(a, b-a);
} | true | 22 | 22 | int gcd(int a, int b) {
if (a == 0)
return b;
if (b == 0)
return a;
if (a == b)
return a;
if (a > b)
return gcd(a-b, b);
return gcd(a, b-a);
} | /*@
axiomatic LCM {
logic integer lcm(integer m, integer n);
}
*/
/*@ requires a>0 && b>0;
decreases a+b;
assigns \nothing;
ensures a == 0 ==> \result == b;
ensures b == 0 ==> \result == a;
ensures a == b ==> \result == a;
*/ | |
frama_c_files_v2/test_frama_c_259.c | /*@
requires \valid (s+(0..n-1));
requires \valid (t+(0..n-1));
requires n > 0;
assigns \nothing;
ensures \result <==> (\forall integer i; 0 <= i < n ==> s[i] == t[i]);
*/
int compare_array(int s[], int t[], int n)
{
int i = 0;
/*@
loop invariant \forall integer j; 0 <= j < i ==> s[j] == t[j];
loop invaria... |
/*@
requires \valid (s+(0..n-1));
requires \valid (t+(0..n-1));
requires n > 0;
assigns \nothing;
ensures \result <==> (\forall integer i; 0 <= i < n ==> s[i] == t[i]);
*/ | int compare_array(int s[], int t[], int n)
{
int i = 0;
/*@
loop invariant \forall integer j; 0 <= j < i ==> s[j] == t[j];
loop invariant 0 <= i <= n;
loop assigns i;
loop variant n-i;
*/
while (i < n && s[i] == t[i])
{
i++;
}
return i == n;
} | true | 15 | 15 | int compare_array(int s[], int t[], int n)
{
int i = 0;
/*@
loop invariant \forall integer j; 0 <= j < i ==> s[j] == t[j];
loop invariant 0 <= i <= n;
loop assigns i;
loop variant n-i;
*/
while (i < n && s[i] == t[i])
{
i++;
}
return i == n;
} | /*@
requires \valid (s+(0..n-1));
requires \valid (t+(0..n-1));
requires n > 0;
assigns \nothing;
ensures \result <==> (\forall integer i; 0 <= i < n ==> s[i] == t[i]);
*/ | |
frama_c_files_v2/test_frama_c_2273.c | /*@
@ requires n > 0;
@ requires \valid(a+(0..n-1));
@
@ assigns \nothing;
@ behavior true_:
@ assumes \forall integer i; 0 <= i < n / 2 ==> a[i] == a[n - i - 1];
@ ensures \result == 1;
@ behavior false_:
@ assumes \exists integer i; 0 <= i < n / 2 && a[i] != a[n - i - 1];
@ ensures \resu... |
/*@
@ requires n > 0;
@ requires \valid(a+(0..n-1));
@
@ assigns \nothing;
@ behavior true_:
@ assumes \forall integer i; 0 <= i < n / 2 ==> a[i] == a[n - i - 1];
@ ensures \result == 1;
@ behavior false_:
@ assumes \exists integer i; 0 <= i < n / 2 && a[i] != a[n - i - 1];
@ ensures \re... | int palindrome(int a[], int n) {
/*@
@ loop invariant 0 <= i <= n / 2;
@ loop invariant \forall integer j; 0 <= j < i ==> a[j] == a[n - j - 1];
@ loop assigns i;
@ loop variant n - 2 * i;
*/
for (int i = 0; i < n / 2; ++i) {
if (a[i] != a[n - i - 1]) return 0;
}
ret... | true | 22 | 22 | int palindrome(int a[], int n) {
/*@
@ loop invariant 0 <= i <= n / 2;
@ loop invariant \forall integer j; 0 <= j < i ==> a[j] == a[n - j - 1];
@ loop assigns i;
@ loop variant n - 2 * i;
*/
for (int i = 0; i < n / 2; ++i) {
if (a[i] != a[n - i - 1]) return 0;
}
ret... | /*@
@ requires n > 0;
@ requires \valid(a+(0..n-1));
@
@ assigns \nothing;
@ behavior true_:
@ assumes \forall integer i; 0 <= i < n / 2 ==> a[i] == a[n - i - 1];
@ ensures \result == 1;
@ behavior false_:
@ assumes \exists integer i; 0 <= i < n / 2 && a[i] != a[n - i - 1];
@ ensures \resu... | |
frama_c_files_v2/test_frama_c_122.c | /* bts 60: 1 should be lifted to a real number implicitely. */
/*@ ensures 1.0 == 1;
assigns \nothing;*/
void f();
/*@ lemma foo: 1.0 == (float)1; */
void f() {
double B;
}
typedef int T, T4[4], *T_PTR;
const T X, Tab[4];
typedef T_PTR T_PTR_T4[4];
const T_PTR_T4 Tab_Ptr = { &X, &X, &X, &X};
|
/*@ ensures 1.0 == 1;
assigns \nothing;*/
void f();
/*@ lemma foo: 1.0 == (float)1; */ | void f() {
double B;
} | true | 5 | 5 | void f() {
double B;
} | /*@ ensures 1.0 == 1;
assigns \nothing;*/
void f();
/*@ lemma foo: 1.0 == (float)1; */ | |
frama_c_files_v2/test_frama_c_10.c | /*@ predicate dom{L}(int k,int n) = k >= 0 && k <= n - 1;
*/
/*@
requires A: n >= 0 && \valid (a +(0.. n-1));
requires B: dom( i, n ) && dom( j, n );
assigns a[i], a[j];
ensures \old(a[i]) == a[j] && \old(a[j]) == a[i];
ensures \forall int i1; dom(i1,n) ==>
\exists i... |
/*@ predicate dom{L}(int k,int n) = k >= 0 && k <= n - 1;
*/
/*@
requires A: n >= 0 && \valid (a +(0.. n-1));
requires B: dom( i, n ) && dom( j, n );
assigns a[i], a[j];
ensures \old(a[i]) == a[j] && \old(a[j]) == a[i];
ensures \forall int i1; dom(i1,n) ==>
\exists... | void swap3(int *a, int n, int i, int j) {
int temp = a[i];
a[i] = a[j];
a[j] = temp;
} | true | 10 | 10 | void swap3(int *a, int n, int i, int j) {
int temp = a[i];
a[i] = a[j];
a[j] = temp;
} | /*@ predicate dom{L}(int k,int n) = k >= 0 && k <= n - 1;
*/
/*@
requires A: n >= 0 && \valid (a +(0.. n-1));
requires B: dom( i, n ) && dom( j, n );
assigns a[i], a[j];
ensures \old(a[i]) == a[j] && \old(a[j]) == a[i];
ensures \forall int i1; dom(i1,n) ==>
\exists i... | |
frama_c_files_v2/test_frama_c_2477.c | /* public interface */
/*@ assigns \nothing;
@ ensures \result >= 0;
@*/
int gen() {
return 0;
} |
/*@ assigns \nothing;
@ ensures \result >= 0;
@*/ | int gen() {
return 0;
} | true | 4 | 4 | int gen() {
return 0;
} | /*@ assigns \nothing;
@ ensures \result >= 0;
@*/ | |
frama_c_files_v2/test_frama_c_1922.c | /*@ requires \valid_read(p+(0..n-1));
@ ensures \result > 0;
@ assigns \nothing;
@ */
int somefun(char *p, int n) {
return 1;
} |
/*@ requires \valid_read(p+(0..n-1));
@ ensures \result > 0;
@ assigns \nothing;
@ */ | int somefun(char *p, int n) {
return 1;
} | true | 4 | 4 | int somefun(char *p, int n) {
return 1;
} | /*@ requires \valid_read(p+(0..n-1));
@ ensures \result > 0;
@ assigns \nothing;
@ */ | |
frama_c_files_v2/test_frama_c_2616.c | /*@
requires n > 0;
requires \valid_read(arr + (0..n-1));
ensures \forall integer i; 0 <= i < n ==> \result >= arr[i];
*/
int arraymax(int arr[], int n) {
int max = arr[0];
/*@
loop invariant 1 <= j <= n;
loop invariant \forall integer i; 0 <= i < j ==> max >= arr[i];
loop invariant max >= arr[0];
loop as... |
/*@
requires n > 0;
requires \valid_read(arr + (0..n-1));
ensures \forall integer i; 0 <= i < n ==> \result >= arr[i];
*/ | int arraymax(int arr[], int n) {
int max = arr[0];
/*@
loop invariant 1 <= j <= n;
loop invariant \forall integer i; 0 <= i < j ==> max >= arr[i];
loop invariant max >= arr[0];
loop assigns j, max;
loop variant n - j;
*/
for (int j=1; j<n; j++)
{
if (arr[j] > max)
max = arr[j];
}
return max;
} | true | 16 | 16 | int arraymax(int arr[], int n) {
int max = arr[0];
/*@
loop invariant 1 <= j <= n;
loop invariant \forall integer i; 0 <= i < j ==> max >= arr[i];
loop invariant max >= arr[0];
loop assigns j, max;
loop variant n - j;
*/
for (int j=1; j<n; j++)
{
if (arr[j] > max)
max = arr[j];
}
return max;
} | /*@
requires n > 0;
requires \valid_read(arr + (0..n-1));
ensures \forall integer i; 0 <= i < n ==> \result >= arr[i];
*/ | |
frama_c_files_v2/test_frama_c_739.c | /*@ requires 0 <= n <= 1000;
ensures \result == n*n;
assigns \nothing;
*/
int oddsum(int n) {
int sum=0;
/*@ loop invariant 0<=i<=n;
loop invariant sum==i*i;
loop assigns i, sum;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
sum += i*2 + 1;
}
return sum;
} |
/*@ requires 0 <= n <= 1000;
ensures \result == n*n;
assigns \nothing;
*/ | int oddsum(int n) {
int sum=0;
/*@ loop invariant 0<=i<=n;
loop invariant sum==i*i;
loop assigns i, sum;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
sum += i*2 + 1;
}
return sum;
} | true | 17 | 17 | int oddsum(int n) {
int sum=0;
/*@ loop invariant 0<=i<=n;
loop invariant sum==i*i;
loop assigns i, sum;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
sum += i*2 + 1;
}
return sum;
} | /*@ requires 0 <= n <= 1000;
ensures \result == n*n;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2078.c | /* run.config
EXECNOW: make tests/aorai/Aorai_test.cmxs
OPT: -aorai-automata tests/aorai/test_boucle_rechercheTableau.ya -aorai-test 1 -aorai-acceptance -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
/*@ requires \valid(t+(0..max));
@ requires max>=0;
@ requires max < 2147483... |
/*@ requires \valid(t+(0..max));
@ requires max>=0;
@ requires max < 2147483647;
@ ensures 0<=\result && \result<=max || \result==-1 ;
@ ensures 0<=\result && \result<=max ==> t[\result]==val;
@ ensures \result==-1 ==> (\forall integer j; 0<=j<=max ==> t[j]!=val);
@ assigns \nothing;
*/ | int isPresent(int t[], int max, int val) {
int i=0;
/*@ loop invariant inv :
@ 0<=i<=max+1
@ && \valid(t+(0..max))
@ && max>=0
@ && (\forall integer j; 0<=j<i ==> t[j]!=val);
@ loop assigns i;
@ loop variant v : max-i ;
*/
while (i<max+1 && t[i]!=val) {
i++;
}
if(... | true | 17 | 17 | int isPresent(int t[], int max, int val) {
int i=0;
/*@ loop invariant inv :
@ 0<=i<=max+1
@ && \valid(t+(0..max))
@ && max>=0
@ && (\forall integer j; 0<=j<i ==> t[j]!=val);
@ loop assigns i;
@ loop variant v : max-i ;
*/
while (i<max+1 && t[i]!=val) {
i++;
}
if(... | /*@ requires \valid(t+(0..max));
@ requires max>=0;
@ requires max < 2147483647;
@ ensures 0<=\result && \result<=max || \result==-1 ;
@ ensures 0<=\result && \result<=max ==> t[\result]==val;
@ ensures \result==-1 ==> (\forall integer j; 0<=j<=max ==> t[j]!=val);
@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2078.c | /* run.config
EXECNOW: make tests/aorai/Aorai_test.cmxs
OPT: -aorai-automata tests/aorai/test_boucle_rechercheTableau.ya -aorai-test 1 -aorai-acceptance -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
/*@ requires \valid(t+(0..max));
@ requires max>=0;
@ requires max < 2147483... |
/*@ requires \valid(t+(0..max));
@ requires max>=0;
@ requires max < 2147483647;
@ ensures 0<=\result && \result<=max || \result==-1 ;
@ ensures 0<=\result && \result<=max ==> t[\result]==val;
@ ensures \result==-1 ==> (\forall integer j; 0<=j<=max ==> t[j]!=val);
@ assigns \nothing;
*/
int isPresent(int... | void foo(){} | true | 20 | 20 | void foo(){} | /*@ requires \valid(t+(0..max));
@ requires max>=0;
@ requires max < 2147483647;
@ ensures 0<=\result && \result<=max || \result==-1 ;
@ ensures 0<=\result && \result<=max ==> t[\result]==val;
@ ensures \result==-1 ==> (\forall integer j; 0<=j<=max ==> t[j]!=val);
@ assigns \nothing;
*/
int isPresent(int t... | |
frama_c_files_v2/test_frama_c_468.c | /*@
requires \valid_read(a + (0..n-1));
requires n > 0;
ensures \forall integer k; 0 <= k < n ==> \result >= a[k];
ensures \exists integer k; 0 <= k < n && \result == a[k];
assigns \nothing;
*/
int arraymax(int* a, int n) {
int i = 1;
int max = a[0];
/*@
loop invariant \forall integer k; 0 <= k < n =... |
/*@
requires \valid_read(a + (0..n-1));
requires n > 0;
ensures \forall integer k; 0 <= k < n ==> \result >= a[k];
ensures \exists integer k; 0 <= k < n && \result == a[k];
assigns \nothing;
*/ | int arraymax(int* a, int n) {
int i = 1;
int max = a[0];
/*@
loop invariant \forall integer k; 0 <= k < n ==> (k < i ==> max >= a[k]);
loop invariant \exists integer k; 0 <= k < i && max == a[k];
loop invariant 0 <= i <= n;
loop assigns i,max;
loop variant n - i;
*/
while (i < n) {... | true | 18 | 18 | int arraymax(int* a, int n) {
int i = 1;
int max = a[0];
/*@
loop invariant \forall integer k; 0 <= k < n ==> (k < i ==> max >= a[k]);
loop invariant \exists integer k; 0 <= k < i && max == a[k];
loop invariant 0 <= i <= n;
loop assigns i,max;
loop variant n - i;
*/
while (i < n) {... | /*@
requires \valid_read(a + (0..n-1));
requires n > 0;
ensures \forall integer k; 0 <= k < n ==> \result >= a[k];
ensures \exists integer k; 0 <= k < n && \result == a[k];
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2496.c | /*@ requires 1000>taille>0;
requires \valid(t+(0..taille-1));
ensures \forall integer i; 0<=i<taille ==> t[i] == (i*2) ;
ensures \forall integer i; 0<=i<taille-1 ==> t[i]<=t[i+1];
*/
void doubleint(int t[],int taille) { // void double() --> not possible since datatype!
/*@ loop invariant 0<=i<=t... |
/*@ requires 1000>taille>0;
requires \valid(t+(0..taille-1));
ensures \forall integer i; 0<=i<taille ==> t[i] == (i*2) ;
ensures \forall integer i; 0<=i<taille-1 ==> t[i]<=t[i+1];
*/ | void doubleint(int t[],int taille) { // void double() --> not possible since datatype!
/*@ loop invariant 0<=i<=taille;
loop invariant \forall integer j; 0<=j<i ==> t[j] == (j*2) ;
loop invariant \forall integer j; 0<=j<i-1 ==> t[j]<=t[j+1];
loop assigns t[0..taille-1],i;
... | true | 19 | 19 | void doubleint(int t[],int taille) { // void double() --> not possible since datatype!
/*@ loop invariant 0<=i<=taille;
loop invariant \forall integer j; 0<=j<i ==> t[j] == (j*2) ;
loop invariant \forall integer j; 0<=j<i-1 ==> t[j]<=t[j+1];
loop assigns t[0..taille-1],i;
... | /*@ requires 1000>taille>0;
requires \valid(t+(0..taille-1));
ensures \forall integer i; 0<=i<taille ==> t[i] == (i*2) ;
ensures \forall integer i; 0<=i<taille-1 ==> t[i]<=t[i+1];
*/ | |
frama_c_files_v2/test_frama_c_2629.c | /*@
requires \valid(t+(0..n-1)) && n>0;
// assigns \nothing;
ensures (\forall integer i; 0<=i<n ==> t[i] == t[n-i-1]) ==> \result==1;
ensures (\exists integer i; 0<=i<n && t[i] != t[n-i-1]) ==> \result==0;
*/
int palindrome(int t[], int n){
/*@
loop invariant 0<=i<=n/2;
loop invariant \forall integer j; 0<=j<... |
/*@
requires \valid(t+(0..n-1)) && n>0;
// assigns \nothing;
ensures (\forall integer i; 0<=i<n ==> t[i] == t[n-i-1]) ==> \result==1;
ensures (\exists integer i; 0<=i<n && t[i] != t[n-i-1]) ==> \result==0;
*/ | int palindrome(int t[], int n){
/*@
loop invariant 0<=i<=n/2;
loop invariant \forall integer j; 0<=j<i ==> t[j] == t[n - j - 1];
loop assigns i;
loop variant n/2-i;
*/
for (int i = 0; i < n / 2; i++) {
if (t[i] != t[n - i - 1])
return 0;
}
return 1;
} | true | 17 | 17 | int palindrome(int t[], int n){
/*@
loop invariant 0<=i<=n/2;
loop invariant \forall integer j; 0<=j<i ==> t[j] == t[n - j - 1];
loop assigns i;
loop variant n/2-i;
*/
for (int i = 0; i < n / 2; i++) {
if (t[i] != t[n - i - 1])
return 0;
}
return 1;
} | /*@
requires \valid(t+(0..n-1)) && n>0;
// assigns \nothing;
ensures (\forall integer i; 0<=i<n ==> t[i] == t[n-i-1]) ==> \result==1;
ensures (\exists integer i; 0<=i<n && t[i] != t[n-i-1]) ==> \result==0;
*/ | |
frama_c_files_v2/test_frama_c_662.c | /*
* A simple string matching
* Takuo Watanabe (Tokyo Institute of Technology)
*
* This file can be successfully verified using Frama-C with Jessie plugin.
* Frama-C Carbon-20110201
* Alt-Ergo 0.92.2 / CVC3 2.2
*/
/*@ predicate MatchAt{L}(char *t, char *p, integer k, integer m) =
@ \forall integer l; 0... |
/*@ predicate MatchAt{L}(char *t, char *p, integer k, integer m) =
@ \forall integer l; 0 <= l < m ==> t[k + l] == p[l];
@*/
/*@ predicate Match{L}(char *t, integer n, char *p, integer m) =
@ \exists integer k; 0 <= k <= n - m && MatchAt(t, p, k, m);
@*/
// Needed to prove (in ATP) that the loop varia... | int smatch (char t[], int n, char p[], int m) {
int i = 0, j = 0;
/*@ loop invariant 0 <= i <= n && 0 <= j <= m;
@ loop invariant i >= j;
@ loop invariant MatchAt(t, p, i - j, j);
@ loop invariant \forall integer k; 0 <= k < i - j ==> !MatchAt(t, p, k, m);
@ loop assigns i, j;
@ lo... | true | 31 | 31 | int smatch (char t[], int n, char p[], int m) {
int i = 0, j = 0;
/*@ loop invariant 0 <= i <= n && 0 <= j <= m;
@ loop invariant i >= j;
@ loop invariant MatchAt(t, p, i - j, j);
@ loop invariant \forall integer k; 0 <= k < i - j ==> !MatchAt(t, p, k, m);
@ loop assigns i, j;
@ lo... | /*@ predicate MatchAt{L}(char *t, char *p, integer k, integer m) =
@ \forall integer l; 0 <= l < m ==> t[k + l] == p[l];
@*/
/*@ predicate Match{L}(char *t, integer n, char *p, integer m) =
@ \exists integer k; 0 <= k <= n - m && MatchAt(t, p, k, m);
@*/
// Needed to prove (in ATP) that the loop variant... | |
frama_c_files_v2/test_frama_c_2224.c | /*@
requires 0 <= n <= 1000;
ensures \result == n*(n-1)/2;
*/
int sum(int n){
int sum=0;
/*@
loop invariant 0<=i<=n;
loop invariant sum == i*(i-1)/2;
loop assigns i, sum;
loop variant n-i;
*/
for (int i=0;i<n;i++)
sum += i;
return sum;
} |
/*@
requires 0 <= n <= 1000;
ensures \result == n*(n-1)/2;
*/ | int sum(int n){
int sum=0;
/*@
loop invariant 0<=i<=n;
loop invariant sum == i*(i-1)/2;
loop assigns i, sum;
loop variant n-i;
*/
for (int i=0;i<n;i++)
sum += i;
return sum;
} | true | 13 | 13 | int sum(int n){
int sum=0;
/*@
loop invariant 0<=i<=n;
loop invariant sum == i*(i-1)/2;
loop assigns i, sum;
loop variant n-i;
*/
for (int i=0;i<n;i++)
sum += i;
return sum;
} | /*@
requires 0 <= n <= 1000;
ensures \result == n*(n-1)/2;
*/ |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.