Dataset Viewer
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_2054.c | /*@ assigns \nothing;
ensures \result == \min(\max(min, v), max);
*/
int clamp(int v, int min, int max)
{
int low = v > min ? v : min;
return low < max ? low : max;
}
|
/*@ assigns \nothing;
ensures \result == \min(\max(min, v), max);
*/ | int clamp(int v, int min, int max)
{
int low = v > min ? v : min;
return low < max ? low : max;
} | true | 7 | 7 | int clamp(int v, int min, int max)
{
int low = v > min ? v : min;
return low < max ? low : max;
} | /*@ assigns \nothing;
ensures \result == \min(\max(min, v), max);
*/ |
|
frama_c_files_v2/test_frama_c_717.c | /*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/
int pick_index(int n) { return 0; }
/*@ requires n > 0 && \valid(p+ (0..n-1));
assigns \nothing;
*/
int pick_element(int* p, int n) {
int i = pick_index(n);
//@ assert (0 <= i && i < n);
return p[i];
}
/*@
requires \valid(p);
assigns \nothing;
ensures \result == p[0];
*/
int pick_first(int* p) {
return p[0];
}
|
/*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/ | int pick_index(int n) { return 0; } | true | 4 | 4 | int pick_index(int n) { return 0; } | /*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/ |
|
frama_c_files_v2/test_frama_c_717.c | /*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/
int pick_index(int n) { return 0; }
/*@ requires n > 0 && \valid(p+ (0..n-1));
assigns \nothing;
*/
int pick_element(int* p, int n) {
int i = pick_index(n);
//@ assert (0 <= i && i < n);
return p[i];
}
/*@
requires \valid(p);
assigns \nothing;
ensures \result == p[0];
*/
int pick_first(int* p) {
return p[0];
}
|
/*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/
int pick_index(int n) { return 0; }
/*@ requires n > 0 && \valid(p+ (0..n-1));
assigns \nothing;
*/
int pick_element(int* p, int n) {
int i = pick_index(n);
//@ assert (0 <= i && i < n);
return p[i];
}
/*@
requires \valid(p);
assigns \nothing;
ensures \result == p[0];
*/ | int pick_first(int* p) {
return p[0];
} | true | 18 | 18 | int pick_first(int* p) {
return p[0];
} | /*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/
int pick_index(int n) { return 0; }
/*@ requires n > 0 && \valid(p+ (0..n-1));
assigns \nothing;
*/
int pick_element(int* p, int n) {
int i = pick_index(n);
//@ assert (0 <= i && i < n);
return p[i];
}
/*@
requires \valid(p);
assigns \nothing;
ensures \result == p[0];
*/ |
|
frama_c_files_v2/test_frama_c_2473.c | #include <limits.h>
#include <string.h>
/*@ predicate matcher_ab(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
\false))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((((x0+1)[0]=='\0')) ? (\false) : ((((x0+1)[0]=='b') &&
(((x0+1)+1)[0]=='\0'))))))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..(strlen(x0)+1)-1)));
assigns \nothing;
ensures \result <==> matcher_ab(x0);
*/
int matcher_ab(char * x0) {
char x2 = x0[0];
int x3 = x2 == '\0';
int x7;
if (x3) {
x7 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x6;
if (x4) {
x6 = 0/*false*/;
} else {
x6 = 0/*false*/;
}
x7 = x6;
}
int x17;
if (x3) {
x17 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x16;
if (x4) {
char *x5 = x0+1;
char x8 = x5[0];
int x9 = x8 == '\0';
int x15;
if (x9) {
x15 = 0/*false*/;
} else {
int x10 = x8 == 'b';
int x14;
if (x10) {
char *x11 = x5+1;
char x12 = x11[0];
int x13 = x12 == '\0';
x14 = x13;
} else {
x14 = 0/*false*/;
}
x15 = x14;
}
x16 = x15;
} else {
x16 = 0/*false*/;
}
x17 = x16;
}
int x18 = x7 || x17;
return x18;
}
| #include <limits.h>
#include <string.h>
/*@ predicate matcher_ab(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
\false))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((((x0+1)[0]=='\0')) ? (\false) : ((((x0+1)[0]=='b') &&
(((x0+1)+1)[0]=='\0'))))))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..(strlen(x0)+1)-1)));
assigns \nothing;
ensures \result <==> matcher_ab(x0);
*/ | int matcher_ab(char * x0) {
char x2 = x0[0];
int x3 = x2 == '\0';
int x7;
if (x3) {
x7 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x6;
if (x4) {
x6 = 0/*false*/;
} else {
x6 = 0/*false*/;
}
x7 = x6;
}
int x17;
if (x3) {
x17 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x16;
if (x4) {
char *x5 = x0+1;
char x8 = x5[0];
int x9 = x8 == '\0';
int x15;
if (x9) {
x15 = 0/*false*/;
} else {
int x10 = x8 == 'b';
int x14;
if (x10) {
char *x11 = x5+1;
char x12 = x11[0];
int x13 = x12 == '\0';
x14 = x13;
} else {
x14 = 0/*false*/;
}
x15 = x14;
}
x16 = x15;
} else {
x16 = 0/*false*/;
}
x17 = x16;
}
int x18 = x7 || x17;
return x18;
} | true | 21 | 21 | int matcher_ab(char * x0) {
char x2 = x0[0];
int x3 = x2 == '\0';
int x7;
if (x3) {
x7 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x6;
if (x4) {
x6 = 0/*false*/;
} else {
x6 = 0/*false*/;
}
x7 = x6;
}
int x17;
if (x3) {
x17 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x16;
if (x4) {
char *x5 = x0+1;
char x8 = x5[0];
int x9 = x8 == '\0';
int x15;
if (x9) {
x15 = 0/*false*/;
} else {
int x10 = x8 == 'b';
int x14;
if (x10) {
char *x11 = x5+1;
char x12 = x11[0];
int x13 = x12 == '\0';
x14 = x13;
} else {
x14 = 0/*false*/;
}
x15 = x14;
}
x16 = x15;
} else {
x16 = 0/*false*/;
}
x17 = x16;
}
int x18 = x7 || x17;
return x18;
} | #include <limits.h>
#include <string.h>
/*@ predicate matcher_ab(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
\false))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((((x0+1)[0]=='\0')) ? (\false) : ((((x0+1)[0]=='b') &&
(((x0+1)+1)[0]=='\0'))))))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..(strlen(x0)+1)-1)));
assigns \nothing;
ensures \result <==> matcher_ab(x0);
*/ |
|
frama_c_files_v2/test_frama_c_2371.c | /*@
requires n>0;
requires 0<=k<n;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<=k ==>a[k]>=a[i];
*/
void q2(int a[],int n,int k)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=k;
loop assigns j,a[0..j+1];
loop variant k-j;
*/
for (int j=0;j<k;j++)
{
if(a[j]>a[j+1])
{
int t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
} |
/*@
requires n>0;
requires 0<=k<n;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<=k ==>a[k]>=a[i];
*/ | void q2(int a[],int n,int k)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=k;
loop assigns j,a[0..j+1];
loop variant k-j;
*/
for (int j=0;j<k;j++)
{
if(a[j]>a[j+1])
{
int t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
} | true | 23 | 23 | void q2(int a[],int n,int k)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=k;
loop assigns j,a[0..j+1];
loop variant k-j;
*/
for (int j=0;j<k;j++)
{
if(a[j]>a[j+1])
{
int t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
} | /*@
requires n>0;
requires 0<=k<n;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<=k ==>a[k]>=a[i];
*/ |
|
frama_c_files_v2/test_frama_c_1505.c | /*@
requires n>0;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<n-1 ==>a[n-1]>=a[i];
*/
void bubbleinnerloop(int a[], int n)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=n-1;
loop assigns j,a[0..j+1];
loop variant n-1-j;
*/
for (int j = 0; j < n - 1; j++)
{
if (a[j] > a[j + 1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
|
/*@
requires n>0;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<n-1 ==>a[n-1]>=a[i];
*/ | void bubbleinnerloop(int a[], int n)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=n-1;
loop assigns j,a[0..j+1];
loop variant n-1-j;
*/
for (int j = 0; j < n - 1; j++)
{
if (a[j] > a[j + 1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
} | true | 24 | 24 | void bubbleinnerloop(int a[], int n)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=n-1;
loop assigns j,a[0..j+1];
loop variant n-1-j;
*/
for (int j = 0; j < n - 1; j++)
{
if (a[j] > a[j + 1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
} | /*@
requires n>0;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<n-1 ==>a[n-1]>=a[i];
*/ |
|
frama_c_files_v2/test_frama_c_1653.c | #include <limits.h>
/*@
requires (\valid(x0+x1) &&
\valid(x0+x2));
ensures ((x0[x1]==\old(x0[x2])) &&
(x0[x2]==\old(x0[x1])));
assigns x0[x1], x0[x2];
*/
void inswap(int * x0, int x1, int x2) {
int x4 = x0[x1];
int x5 = x0[x2];
x0[x1] = x5;
x0[x2] = x4;
}
/*@
requires ((x26>0) &&
\valid(x25+(0..x26-1)));
ensures (\forall int x203; (((0<=x203) &&
(x203<(x26-1))) ==> (x25[x203]<=x25[(x203+1)])));
assigns x25[(0..x26-1)];
*/
void insort(int * x25, int x26) {
int x29 = x26;
/*@
loop invariant ((((0<=x29) &&
(x29<=x26)) &&
(\forall int x152; (((x29<=x152) &&
(x152<(x26-1))) ==> (x25[x152]<=x25[(x152+1)])))) &&
(\forall int x168; ((((0<=x168) &&
(x168<x29)) &&
(x29<=(x26-1))) ==> (x25[x168]<=x25[x29]))));
loop assigns x29, x25[(0..x26-1)];
loop variant x29;
*/
for (;;) {
int x30 = x29;
int x31 = x30 > 1;
if (!x31) break;
int x33 = 0;
int x34 = x29;
/*@
loop invariant ((((((((0<=x29) &&
(x29<=x26)) &&
(0<=x36)) &&
(x36<=x29)) &&
(0<=x33)) &&
(x33<=(x29-1))) &&
((x29-1)<x26)) &&
(\forall int x74; (((0<=x74) &&
(x74<x36)) ==> (x25[x74]<=x25[x33]))));
loop assigns x36, x33;
loop variant (x29-x36);
*/
for(int x36=0; x36 < x34; x36++) {
int x37 = x25[x36];
int x38 = x33;
int x39 = x25[x38];
int x40 = x37 >= x39;
if (x40) {
x33 = x36;
} else {
}
}
int x96 = x33;
int x95 = x34 - 1;
inswap(x25,x95,x96);
/*@assert (\forall int x98; ((((x29-1)<x98) &&
(x98<(x26-1))) ==> (x25[x98]<=x25[(x98+1)])));*/
/*@assert ((x29<=(x26-1)) ==> (x25[(x29-1)]<=x25[x29]));*/
/*@assert (\forall int x127; (((0<=x127) &&
(x127<x29)) ==> (x25[x127]<=x25[(x29-1)])));*/
x29 = x95;
}
}
| #include <limits.h>
/*@
requires (\valid(x0+x1) &&
\valid(x0+x2));
ensures ((x0[x1]==\old(x0[x2])) &&
(x0[x2]==\old(x0[x1])));
assigns x0[x1], x0[x2];
*/ | void inswap(int * x0, int x1, int x2) {
int x4 = x0[x1];
int x5 = x0[x2];
x0[x1] = x5;
x0[x2] = x4;
} | true | 9 | 9 | void inswap(int * x0, int x1, int x2) {
int x4 = x0[x1];
int x5 = x0[x2];
x0[x1] = x5;
x0[x2] = x4;
} | #include <limits.h>
/*@
requires (\valid(x0+x1) &&
\valid(x0+x2));
ensures ((x0[x1]==\old(x0[x2])) &&
(x0[x2]==\old(x0[x1])));
assigns x0[x1], x0[x2];
*/ |
|
frama_c_files_v2/test_frama_c_1345.c | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
enum type2 {right,acute,obtuse};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && b!=c && c!=a;
ensures \result==scalene;
complete behaviors;
disjoint behaviors;
*/
enum type1 func1(int a,int b,int c){
if(a==b && b==c) return equilateral;
else if(a==b || b==c || c==a) return isoscele;
else return scalene;
}
/*@
requires a>=b>0 && a>=c>0 && a*a<=10000000 && c*c<=10000000 && b*b<=10000000;
behavior ri:
assumes a*a==b*b+c*c;
ensures \result==right;
behavior ac:
assumes a*a<b*b+c*c;
ensures \result==acute;
behavior ob:
assumes a*a>b*b+c*c;
ensures \result==obtuse;
complete behaviors;
disjoint behaviors;
*/
enum type2 func2(int a,int b,int c){
//since a is assumed as hypotenuse
if(a*a==b*b+c*c) return right;
else if (a*a<b*b+c*c) return acute;
else return obtuse;
}
| #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && b!=c && c!=a;
ensures \result==scalene;
complete behaviors;
disjoint behaviors;
*/ | enum type1 func1(int a,int b,int c){
if(a==b && b==c) return equilateral;
else if(a==b || b==c || c==a) return isoscele;
else return scalene;
} | true | 7 | 7 | enum type1 func1(int a,int b,int c){
if(a==b && b==c) return equilateral;
else if(a==b || b==c || c==a) return isoscele;
else return scalene;
} | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && b!=c && c!=a;
ensures \result==scalene;
complete behaviors;
disjoint behaviors;
*/ |
|
frama_c_files_v2/test_frama_c_1345.c | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
enum type2 {right,acute,obtuse};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && b!=c && c!=a;
ensures \result==scalene;
complete behaviors;
disjoint behaviors;
*/
enum type1 func1(int a,int b,int c){
if(a==b && b==c) return equilateral;
else if(a==b || b==c || c==a) return isoscele;
else return scalene;
}
/*@
requires a>=b>0 && a>=c>0 && a*a<=10000000 && c*c<=10000000 && b*b<=10000000;
behavior ri:
assumes a*a==b*b+c*c;
ensures \result==right;
behavior ac:
assumes a*a<b*b+c*c;
ensures \result==acute;
behavior ob:
assumes a*a>b*b+c*c;
ensures \result==obtuse;
complete behaviors;
disjoint behaviors;
*/
enum type2 func2(int a,int b,int c){
//since a is assumed as hypotenuse
if(a*a==b*b+c*c) return right;
else if (a*a<b*b+c*c) return acute;
else return obtuse;
}
| #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
enum type2 {right,acute,obtuse};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && b!=c && c!=a;
ensures \result==scalene;
complete behaviors;
disjoint behaviors;
*/
enum type1 func1(int a,int b,int c){
if(a==b && b==c) return equilateral;
else if(a==b || b==c || c==a) return isoscele;
else return scalene;
}
/*@
requires a>=b>0 && a>=c>0 && a*a<=10000000 && c*c<=10000000 && b*b<=10000000;
behavior ri:
assumes a*a==b*b+c*c;
ensures \result==right;
behavior ac:
assumes a*a<b*b+c*c;
ensures \result==acute;
behavior ob:
assumes a*a>b*b+c*c;
ensures \result==obtuse;
complete behaviors;
disjoint behaviors;
*/ | enum type2 func2(int a,int b,int c){
//since a is assumed as hypotenuse
if(a*a==b*b+c*c) return right;
else if (a*a<b*b+c*c) return acute;
else return obtuse;
} | true | 30 | 30 | enum type2 func2(int a,int b,int c){
//since a is assumed as hypotenuse
if(a*a==b*b+c*c) return right;
else if (a*a<b*b+c*c) return acute;
else return obtuse;
} | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
enum type2 {right,acute,obtuse};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && b!=c && c!=a;
ensures \result==scalene;
complete behaviors;
disjoint behaviors;
*/
enum type1 func1(int a,int b,int c){
if(a==b && b==c) return equilateral;
else if(a==b || b==c || c==a) return isoscele;
else return scalene;
}
/*@
requires a>=b>0 && a>=c>0 && a*a<=10000000 && c*c<=10000000 && b*b<=10000000;
behavior ri:
assumes a*a==b*b+c*c;
ensures \result==right;
behavior ac:
assumes a*a<b*b+c*c;
ensures \result==acute;
behavior ob:
assumes a*a>b*b+c*c;
ensures \result==obtuse;
complete behaviors;
disjoint behaviors;
*/ |
|
frama_c_files_v2/test_frama_c_2823.c | #define LENGTH 100
int vec[LENGTH];
int max;
/*@ requires \valid(u+(0..size-1)) && 0 < size;
@ ensures 0 <= \result < size &&
@ (\forall integer a; 0 <= a < size ==> u[a] <= u[\result]);
@ assigns max;
@*/
int maxarray(int u[], int size) {
int i = 1;
max = 0;
/*@ loop invariant
@ 0 <= max < i <= size &&
@ (\forall integer a;
@ 0 <= a < i ==> u[a] <= u[max]);
@ loop assigns i, max;
@ loop variant size-i;
@*/
while (i < size) {
if (u[i] > u[max]) { max = i; }
i++;
}
return max;
}
void main() {
max = maxarray(vec, LENGTH);
/*@ assert 0 <= max < LENGTH &&
@ (\forall integer a;
@ 0 <= a < LENGTH ==> vec[a] <= vec[max]);
@*/
}
| int max;
/*@ requires \valid(u+(0..size-1)) && 0 < size;
@ ensures 0 <= \result < size &&
@ (\forall integer a; 0 <= a < size ==> u[a] <= u[\result]);
@ assigns max;
@*/ | int maxarray(int u[], int size) {
int i = 1;
max = 0;
/*@ loop invariant
@ 0 <= max < i <= size &&
@ (\forall integer a;
@ 0 <= a < i ==> u[a] <= u[max]);
@ loop assigns i, max;
@ loop variant size-i;
@*/
while (i < size) {
if (u[i] > u[max]) { max = i; }
i++;
}
return max;
} | true | 13 | 13 | int maxarray(int u[], int size) {
int i = 1;
max = 0;
/*@ loop invariant
@ 0 <= max < i <= size &&
@ (\forall integer a;
@ 0 <= a < i ==> u[a] <= u[max]);
@ loop assigns i, max;
@ loop variant size-i;
@*/
while (i < size) {
if (u[i] > u[max]) { max = i; }
i++;
}
return max;
} | int max;
/*@ requires \valid(u+(0..size-1)) && 0 < size;
@ ensures 0 <= \result < size &&
@ (\forall integer a; 0 <= a < size ==> u[a] <= u[\result]);
@ assigns max;
@*/ |
|
frama_c_files_v2/test_frama_c_1665.c | /*@
requires n > 0;
requires \valid(t+(0..(n-1)));
ensures 0 <= \result < n;
ensures \forall integer k; 0 <= k < n ==> t[k] >= t[\result];
ensures \forall integer k; 0 <= k < \result ==> t[k] > t[\result];
*/
int min(int * t, int n) {
int minInd = 0, i =0;
/*@
loop assigns i, minInd;
loop invariant 0 <= i < n;
loop invariant 0 <= minInd < n;
loop invariant 0 <= minInd <= i;
loop invariant \forall integer k; 0 <= k <= i ==> t[minInd] <= t[k];
loop invariant \forall integer k; 0 <= k < minInd ==> t[k] > t[minInd];
loop variant n-1-i;
*/
while(i<n-1)
if (t[++i] < t[minInd])
minInd = i;
//@ assert i == n-1;
return minInd;
}
|
/*@
requires n > 0;
requires \valid(t+(0..(n-1)));
ensures 0 <= \result < n;
ensures \forall integer k; 0 <= k < n ==> t[k] >= t[\result];
ensures \forall integer k; 0 <= k < \result ==> t[k] > t[\result];
*/ | int min(int * t, int n) {
int minInd = 0, i =0;
/*@
loop assigns i, minInd;
loop invariant 0 <= i < n;
loop invariant 0 <= minInd < n;
loop invariant 0 <= minInd <= i;
loop invariant \forall integer k; 0 <= k <= i ==> t[minInd] <= t[k];
loop invariant \forall integer k; 0 <= k < minInd ==> t[k] > t[minInd];
loop variant n-1-i;
*/
while(i<n-1)
if (t[++i] < t[minInd])
minInd = i;
//@ assert i == n-1;
return minInd;
} | true | 23 | 23 | int min(int * t, int n) {
int minInd = 0, i =0;
/*@
loop assigns i, minInd;
loop invariant 0 <= i < n;
loop invariant 0 <= minInd < n;
loop invariant 0 <= minInd <= i;
loop invariant \forall integer k; 0 <= k <= i ==> t[minInd] <= t[k];
loop invariant \forall integer k; 0 <= k < minInd ==> t[k] > t[minInd];
loop variant n-1-i;
*/
while(i<n-1)
if (t[++i] < t[minInd])
minInd = i;
//@ assert i == n-1;
return minInd;
} | /*@
requires n > 0;
requires \valid(t+(0..(n-1)));
ensures 0 <= \result < n;
ensures \forall integer k; 0 <= k < n ==> t[k] >= t[\result];
ensures \forall integer k; 0 <= k < \result ==> t[k] > t[\result];
*/ |
|
frama_c_files_v2/test_frama_c_2303.c | /*@ requires 0 <= from <= to;
@ requires \valid(s+(0..to-1));
@ ensures -1 == \result || from <= \result < to;
@ ensures \result == -1 ==>
@ (\forall int i; from <= i < to ==> s[i] != c);
@ ensures from <= \result < to ==>
@ s[\result] == c &&
@ (\forall int i; from <= i < \result ==> s[i] != c);
@ assigns \nothing;
@*/
static int indexOf(char* s, char c, int from, int to) {
/*@ loop invariant from <= k <= to;
@ loop invariant \forall int i; from <= i < k ==> s[i] != c;
@ loop assigns k;
@ loop variant to - k;
@*/
for(int k = from; k < to; k++) {
if(s[k] == c) {
return k;
}
}
return -1;
}
/*@ predicate replace_space_by_new_line{L1,L2}(char* s, int n) =
@ \forall int i; 0 <= i < n && \at(s[i], L1) != \at(s[i],L2) ==>
@ \at(s[i], L1) == ' ' && \at(s[i],L2) == '\n';
*/
/*@ predicate at_least_lineLength(char* s, int lineLength, int n) =
@ \forall int i,j; 0 <= i < j < n && s[i] == '\n' && s[j] == '\n' ==> j-i >= lineLength;
*/
/*@ requires lineLength > 0;
@ requires 0 < n;
@ requires \valid(s+(0..n-1));
@ requires \forall int i; 0 <= i < n ==> s[i] != '\n';
@ ensures replace_space_by_new_line{Pre,Post}(s,n);
@ ensures at_least_lineLength(s,lineLength,n);
@ assigns s[0 .. n -1];
@*/
void wrapLines_simpl(char* s, int lineLength, int n) {
int lastBreak = -1;
int lastSpace = indexOf(s, ' ', 0, n);
/*@ loop invariant -1 <= lastSpace < n;
@ loop invariant -1 <= lastBreak < n;
@ loop invariant lastSpace == -1 || (lastBreak < lastSpace < n && s[lastSpace] == ' ');
@ loop invariant \forall int i; lastBreak < i < n ==> \at(s[i], LoopEntry) == s[i];
@ loop invariant replace_space_by_new_line{LoopEntry,Here}(s,n);
@ loop invariant at_least_lineLength(s,lineLength,n);
@ loop assigns s[0..n-1],lastBreak,lastSpace;
@ loop variant lastSpace == -1 ? 0 : n + 1 - lastSpace;
@*/
while(lastSpace != -1) {
if(lastSpace - lastBreak > lineLength) {
s[lastSpace] = '\n';
lastBreak = lastSpace;
}
lastSpace = indexOf(s, ' ', lastSpace+1, n);
}
return;
}
/*@ predicate impossible_to_break(char* s, int length, int n) =
@ \forall int i; 0 <= i < n - length ==>
@ (\forall int j; i <= j <= i + length ==> s[j] != '\n') ==>
@ (\forall int j; i <= j <= i + length ==> s[j] != ' ');
*/
/*@ predicate break_largest{L1,L2}(char* s, int length, int n) =
@ \forall int a, b, c; 0 <= a < b < c < n &&
@ (a == -1 || \at(s[a],L2) == '\n') &&
@ \at(s[b],L2) == '\n' && \at(s[b],L1) == ' ' &&
@ (\at(s[c],L2) == ' ' || \at(s[c],L2) == '\n') ==>
@ c - a > length;
*/
/*@ requires 0 < length;
@ requires 0 < n < 2147483646; // the length of array is limited to MAX_INT -1 because of an overflow
@ requires \valid(s+(0..n-1));
@ ensures replace_space_by_new_line{Pre,Post}(s,n);
@ ensures impossible_to_break(s,length,n);
@ ensures break_largest{Pre,Post}(s, length, n);
@ assigns s[0 .. n-1];
@*/
void wrapLines(char* s, int length, int n) {
int lastChange = -1;
int lastSpace = -1;
/*@ loop invariant -1 <= lastSpace < n;
@ loop invariant -1 <= lastChange <= lastSpace;
@ loop invariant lastSpace <= lastChange + length + 1;
@ loop invariant lastChange == -1 || s[lastChange] == '\n';
@ loop invariant 0 <= lastSpace ==> \at(s[\at(lastSpace,Here)],LoopEntry) == ' ' || \at(s[\at(lastSpace,Here)],LoopEntry) == '\n';
@ loop invariant \forall int x; lastChange < x < n ==> s[x] == \at(s[x],LoopEntry);
@ loop invariant \forall int x; lastChange < x <= lastSpace ==> s[x] != '\n';
@ loop invariant replace_space_by_new_line{LoopEntry,Here}(s,n);
@ loop invariant impossible_to_break(s, length, lastSpace);
@ loop invariant \forall int a, b, c; 0 <= a < b < c < n &&
b <= lastChange && (a == -1 || s[a] == '\n') &&
s[b] == '\n' && \at(s[b],LoopEntry) == ' ' &&
(s[c] == ' ' || s[c] == '\n') ==> c - a > length;
@ loop assigns s[0 .. n-1],lastChange, lastSpace;
@ loop variant 2*n - lastSpace - lastChange;
@*/
while(1) {
int nextSpace = indexOf(s, ' ', lastSpace + 1,n);
int nextNewLine = indexOf(s, '\n', lastSpace + 1,n);
if(nextSpace == -1) {
/*n - lastChange can overflow if the array contain no space and is of size MAX_INT*/
if(n - lastChange > length &&
(nextNewLine - lastChange > length || nextNewLine == -1) &&
lastSpace >= 0) {
s[lastSpace] = '\n';
}
return;
}
if(0 <= nextNewLine && nextNewLine < nextSpace) {
if(nextNewLine - lastChange > length && lastSpace >= 0) {
s[lastSpace] = '\n';
}
lastChange = lastSpace = nextNewLine;
} else {
if(nextSpace - lastChange > length) {
if(lastChange == lastSpace) {
s[nextSpace] = '\n';
lastChange = lastSpace = nextSpace;
} else {
s[lastSpace] = '\n';
lastChange = lastSpace;
}
} else {
lastSpace = nextSpace;
}
}
}
return;
}
|
/*@ requires 0 <= from <= to;
@ requires \valid(s+(0..to-1));
@ ensures -1 == \result || from <= \result < to;
@ ensures \result == -1 ==>
@ (\forall int i; from <= i < to ==> s[i] != c);
@ ensures from <= \result < to ==>
@ s[\result] == c &&
@ (\forall int i; from <= i < \result ==> s[i] != c);
@ assigns \nothing;
@*/ | static int indexOf(char* s, char c, int from, int to) {
/*@ loop invariant from <= k <= to;
@ loop invariant \forall int i; from <= i < k ==> s[i] != c;
@ loop assigns k;
@ loop variant to - k;
@*/
for(int k = from; k < to; k++) {
if(s[k] == c) {
return k;
}
}
return -1;
} | true | 17 | 17 | static int indexOf(char* s, char c, int from, int to) {
/*@ loop invariant from <= k <= to;
@ loop invariant \forall int i; from <= i < k ==> s[i] != c;
@ loop assigns k;
@ loop variant to - k;
@*/
for(int k = from; k < to; k++) {
if(s[k] == c) {
return k;
}
}
return -1;
} | /*@ requires 0 <= from <= to;
@ requires \valid(s+(0..to-1));
@ ensures -1 == \result || from <= \result < to;
@ ensures \result == -1 ==>
@ (\forall int i; from <= i < to ==> s[i] != c);
@ ensures from <= \result < to ==>
@ s[\result] == c &&
@ (\forall int i; from <= i < \result ==> s[i] != c);
@ assigns \nothing;
@*/ |
|
frama_c_files_v2/test_frama_c_412.c | #include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/
int matcher(char * x0) {
int x2 = strlen(x0);
int x3 = 0 < x2;
int x6;
if (x3) {
char x4 = x0[0];
int x5 = 'a' == x4;
x6 = x5;
} else {
x6 = 0/*false*/;
}
int x7;
if (x6) {
x7 = 1/*true*/;
} else {
x7 = 0/*false*/;
}
return x7;
}
| #include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/ | int matcher(char * x0) {
int x2 = strlen(x0);
int x3 = 0 < x2;
int x6;
if (x3) {
char x4 = x0[0];
int x5 = 'a' == x4;
x6 = x5;
} else {
x6 = 0/*false*/;
}
int x7;
if (x6) {
x7 = 1/*true*/;
} else {
x7 = 0/*false*/;
}
return x7;
} | true | 4 | 4 | int matcher(char * x0) {
int x2 = strlen(x0);
int x3 = 0 < x2;
int x6;
if (x3) {
char x4 = x0[0];
int x5 = 'a' == x4;
x6 = x5;
} else {
x6 = 0/*false*/;
}
int x7;
if (x6) {
x7 = 1/*true*/;
} else {
x7 = 0/*false*/;
}
return x7;
} | #include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/ |
|
frama_c_files_v2/test_frama_c_646.c | /*@ requires \valid(i) && \valid(j);
@ requires r == \null || \valid(r);
@ assigns *r;
@ behavior zero:
@ assumes r == \null;
@ assigns \nothing;
@ ensures \result == -1;
@ behavior normal:
@ assumes \valid(r);
@ assigns *r;
@ ensures *r == ((*i < *j) ? *j : *i);
@ ensures \result == 0;
@*/
int max2(int *r, int* i, int* j) {
if (!r) return -1;
*r = (*i < *j) ? *j : *i;
return 0;
}
|
/*@ requires \valid(i) && \valid(j);
@ requires r == \null || \valid(r);
@ assigns *r;
@ behavior zero:
@ assumes r == \null;
@ assigns \nothing;
@ ensures \result == -1;
@ behavior normal:
@ assumes \valid(r);
@ assigns *r;
@ ensures *r == ((*i < *j) ? *j : *i);
@ ensures \result == 0;
@*/ | int max2(int *r, int* i, int* j) {
if (!r) return -1;
*r = (*i < *j) ? *j : *i;
return 0;
} | true | 23 | 23 | int max2(int *r, int* i, int* j) {
if (!r) return -1;
*r = (*i < *j) ? *j : *i;
return 0;
} | /*@ requires \valid(i) && \valid(j);
@ requires r == \null || \valid(r);
@ assigns *r;
@ behavior zero:
@ assumes r == \null;
@ assigns \nothing;
@ ensures \result == -1;
@ behavior normal:
@ assumes \valid(r);
@ assigns *r;
@ ensures *r == ((*i < *j) ? *j : *i);
@ ensures \result == 0;
@*/ |
|
frama_c_files_v2/test_frama_c_2330.c | /* run.config
EXECNOW: make tests/aorai/Aorai_test.cmxs
OPT: -aorai-ltl tests/aorai/test_switch2.ltl -aorai-test 1 -aorai-acceptance -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
int status=0;
int rr=1;
//@ global invariant inv : 0<=rr<=50;
/*@ requires rr<50;
@ behavior j :
@ ensures rr<51;
*/
void opa() {
rr++;
}
void opb () {
status=1;
}
void opc() {
rr=9000;
}
int main(){
switch (rr) {
case 1 :
opa();
break;
case 3 :
opa();
default :
opc();
}
opb();
return 1;
}
| int rr=1;
/*@ requires rr<50;
@ behavior j :
@ ensures rr<51;
*/ | void opa() {
rr++;
} | true | 4 | 4 | void opa() {
rr++;
} | int rr=1;
/*@ requires rr<50;
@ behavior j :
@ ensures rr<51;
*/ |
|
frama_c_files_v2/test_frama_c_838.c | /*@
requires n>0;
requires \valid_read(a + (0..n-1));
behavior sorted:
assumes \forall integer i;
1<=i<n ==> a[i]>=a[i-1];
ensures \result ==1;
behavior unsorted:
assumes \exists integer i;
1<=i<n && a[i]< a[i-1];
ensures \result ==0;
complete behaviors;
disjoint behaviors;
*/
int is_sorted(int a[],int n){
/*@
loop invariant \forall integer j;
1<=j<i ==> a[j]>=a[j-1];
loop invariant 1<= i <= n;
loop assigns i;
loop variant n-i;
*/
for (int i=1;i<n;i++){
if (a[i-1]>a[i]){
return 0;
}
}
return 1;
}
|
/*@
requires n>0;
requires \valid_read(a + (0..n-1));
behavior sorted:
assumes \forall integer i;
1<=i<n ==> a[i]>=a[i-1];
ensures \result ==1;
behavior unsorted:
assumes \exists integer i;
1<=i<n && a[i]< a[i-1];
ensures \result ==0;
complete behaviors;
disjoint behaviors;
*/ | int is_sorted(int a[],int n){
/*@
loop invariant \forall integer j;
1<=j<i ==> a[j]>=a[j-1];
loop invariant 1<= i <= n;
loop assigns i;
loop variant n-i;
*/
for (int i=1;i<n;i++){
if (a[i-1]>a[i]){
return 0;
}
}
return 1;
} | true | 17 | 17 | int is_sorted(int a[],int n){
/*@
loop invariant \forall integer j;
1<=j<i ==> a[j]>=a[j-1];
loop invariant 1<= i <= n;
loop assigns i;
loop variant n-i;
*/
for (int i=1;i<n;i++){
if (a[i-1]>a[i]){
return 0;
}
}
return 1;
} | /*@
requires n>0;
requires \valid_read(a + (0..n-1));
behavior sorted:
assumes \forall integer i;
1<=i<n ==> a[i]>=a[i-1];
ensures \result ==1;
behavior unsorted:
assumes \exists integer i;
1<=i<n && a[i]< a[i-1];
ensures \result ==0;
complete behaviors;
disjoint behaviors;
*/ |
|
frama_c_files_v2/test_frama_c_2524.c | /*@
behavior a_less:
assumes a<b;
ensures \result == a;
behavior b_less:
assumes a>=b;
ensures \result == b;
*/
int min(int a, int b){
if(a<b)
return a;
else
return b;
} |
/*@
behavior a_less:
assumes a<b;
ensures \result == a;
behavior b_less:
assumes a>=b;
ensures \result == b;
*/ | int min(int a, int b){
if(a<b)
return a;
else
return b;
} | true | 4 | 4 | int min(int a, int b){
if(a<b)
return a;
else
return b;
} | /*@
behavior a_less:
assumes a<b;
ensures \result == a;
behavior b_less:
assumes a>=b;
ensures \result == b;
*/ |
|
frama_c_files_v2/test_frama_c_1112.c | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/
int is_nat(int x3) {
int x5 = x3 >= 0;
return x5;
}
/*@
requires is_pos(x6);
assigns \nothing;
ensures is_nat(\result);
*/
int minus1(int x6) {
int x8 = x6 - 1;
return x8;
}
| #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/ | int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
} | true | 4 | 4 | int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
} | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/ |
|
frama_c_files_v2/test_frama_c_1112.c | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/
int is_nat(int x3) {
int x5 = x3 >= 0;
return x5;
}
/*@
requires is_pos(x6);
assigns \nothing;
ensures is_nat(\result);
*/
int minus1(int x6) {
int x8 = x6 - 1;
return x8;
}
| #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/ | int is_nat(int x3) {
int x5 = x3 >= 0;
return x5;
} | true | 8 | 8 | int is_nat(int x3) {
int x5 = x3 >= 0;
return x5;
} | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/ |
|
frama_c_files_v2/test_frama_c_1112.c | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/
int is_nat(int x3) {
int x5 = x3 >= 0;
return x5;
}
/*@
requires is_pos(x6);
assigns \nothing;
ensures is_nat(\result);
*/
int minus1(int x6) {
int x8 = x6 - 1;
return x8;
}
| #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/
int is_nat(int x3) {
int x5 = x3 >= 0;
return x5;
}
/*@
requires is_pos(x6);
assigns \nothing;
ensures is_nat(\result);
*/ | int minus1(int x6) {
int x8 = x6 - 1;
return x8;
} | true | 13 | 13 | int minus1(int x6) {
int x8 = x6 - 1;
return x8;
} | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/
int is_nat(int x3) {
int x5 = x3 >= 0;
return x5;
}
/*@
requires is_pos(x6);
assigns \nothing;
ensures is_nat(\result);
*/ |
|
frama_c_files_v2/test_frama_c_1103.c | /*@
requires \valid(a) && \valid(b);
ensures *a == \old(*b) && *b == \old(*a);
*/
void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
}
int main()
{
int a=13,b=14;
swap(&a,&b);
}
|
/*@
requires \valid(a) && \valid(b);
ensures *a == \old(*b) && *b == \old(*a);
*/ | void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
} | true | 7 | 7 | void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
} | /*@
requires \valid(a) && \valid(b);
ensures *a == \old(*b) && *b == \old(*a);
*/ |
|
frama_c_files_v2/test_frama_c_1714.c | /*@
ensures (('a'<=c && c<='z') || ('A'<=c && c<='Z')) ==> \result==1;
ensures !(('a'<=c && c<='z') || ('A'<=c && c<='Z'))==> \result==0;
*/
int alphabet_letter(char c){
if( ('a'<= c && c <='z') || ('A' <= c && c <='Z') ) return 1;
else return 0;
}
int main(){
int ch ;
ch = alphabet_letter('x') ;
//@ assert ch==1 ;
ch = alphabet_letter('H') ;
//@ assert ch==1 ;
ch = alphabet_letter(' ') ;
//@ assert !ch ;
}
|
/*@
ensures (('a'<=c && c<='z') || ('A'<=c && c<='Z')) ==> \result==1;
ensures !(('a'<=c && c<='z') || ('A'<=c && c<='Z'))==> \result==0;
*/ | int alphabet_letter(char c){
if( ('a'<= c && c <='z') || ('A' <= c && c <='Z') ) return 1;
else return 0;
} | true | 4 | 4 | int alphabet_letter(char c){
if( ('a'<= c && c <='z') || ('A' <= c && c <='Z') ) return 1;
else return 0;
} | /*@
ensures (('a'<=c && c<='z') || ('A'<=c && c<='Z')) ==> \result==1;
ensures !(('a'<=c && c<='z') || ('A'<=c && c<='Z'))==> \result==0;
*/ |
|
frama_c_files_v2/test_frama_c_1412.c | #include<assert.h>
/*@
@ ensures \result == 1;
@
*/
int gimmeOne() {
return 1;
}
int main() {
int x = gimmeOne();
assert(x == 1);
}
| #include<assert.h>
/*@
@ ensures \result == 1;
@
*/ | int gimmeOne() {
return 1;
} | true | 3 | 3 | int gimmeOne() {
return 1;
} | #include<assert.h>
/*@
@ ensures \result == 1;
@
*/ |
|
frama_c_files_v2/test_frama_c_84.c | #include <limits.h>
#include <string.h>
/*@ predicate matcher_a_or_b(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((x0+1)[0]=='\0')))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='b') &&
((x0+1)[0]=='\0')))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..(strlen(x0)+1)-1)));
assigns \nothing;
ensures \result <==> matcher_a_or_b(x0);
*/
int matcher_a_or_b(char * x0) {
char x2 = x0[0];
int x3 = x2 == '\0';
int x9;
if (x3) {
x9 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x8;
if (x4) {
char *x5 = x0+1;
char x6 = x5[0];
int x7 = x6 == '\0';
x8 = x7;
} else {
x8 = 0/*false*/;
}
x9 = x8;
}
int x12;
if (x3) {
x12 = 0/*false*/;
} else {
int x10 = x2 == 'b';
int x11;
if (x10) {
char *x5 = x0+1;
char x6 = x5[0];
int x7 = x6 == '\0';
x11 = x7;
} else {
x11 = 0/*false*/;
}
x12 = x11;
}
int x13 = x9 || x12;
return x13;
}
| #include <limits.h>
#include <string.h>
/*@ predicate matcher_a_or_b(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((x0+1)[0]=='\0')))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='b') &&
((x0+1)[0]=='\0')))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..(strlen(x0)+1)-1)));
assigns \nothing;
ensures \result <==> matcher_a_or_b(x0);
*/ | int matcher_a_or_b(char * x0) {
char x2 = x0[0];
int x3 = x2 == '\0';
int x9;
if (x3) {
x9 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x8;
if (x4) {
char *x5 = x0+1;
char x6 = x5[0];
int x7 = x6 == '\0';
x8 = x7;
} else {
x8 = 0/*false*/;
}
x9 = x8;
}
int x12;
if (x3) {
x12 = 0/*false*/;
} else {
int x10 = x2 == 'b';
int x11;
if (x10) {
char *x5 = x0+1;
char x6 = x5[0];
int x7 = x6 == '\0';
x11 = x7;
} else {
x11 = 0/*false*/;
}
x12 = x11;
}
int x13 = x9 || x12;
return x13;
} | true | 17 | 17 | int matcher_a_or_b(char * x0) {
char x2 = x0[0];
int x3 = x2 == '\0';
int x9;
if (x3) {
x9 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x8;
if (x4) {
char *x5 = x0+1;
char x6 = x5[0];
int x7 = x6 == '\0';
x8 = x7;
} else {
x8 = 0/*false*/;
}
x9 = x8;
}
int x12;
if (x3) {
x12 = 0/*false*/;
} else {
int x10 = x2 == 'b';
int x11;
if (x10) {
char *x5 = x0+1;
char x6 = x5[0];
int x7 = x6 == '\0';
x11 = x7;
} else {
x11 = 0/*false*/;
}
x12 = x11;
}
int x13 = x9 || x12;
return x13;
} | #include <limits.h>
#include <string.h>
/*@ predicate matcher_a_or_b(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((x0+1)[0]=='\0')))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='b') &&
((x0+1)[0]=='\0')))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..(strlen(x0)+1)-1)));
assigns \nothing;
ensures \result <==> matcher_a_or_b(x0);
*/ |
|
frama_c_files_v2/test_frama_c_187.c |
/*@ requires \valid(p) && \valid(q);
ensures *p <= *q;
behavior p_minimum:
assumes *p < *q;
ensures *p == \old(*p) && *q == \old(*q);
behavior q_minimum:
assumes *p >= *q;
ensures *p == \old(*q) && *q == \old(*p);
complete behaviors p_minimum, q_minimum;
disjoint behaviors p_minimum, q_minimum;
*/
void max_ptr(int*p, int*q) {
if (*p > *q) {
int tmp = *p;
*p = *q;
*q = tmp;
}
} |
/*@ requires \valid(p) && \valid(q);
ensures *p <= *q;
behavior p_minimum:
assumes *p < *q;
ensures *p == \old(*p) && *q == \old(*q);
behavior q_minimum:
assumes *p >= *q;
ensures *p == \old(*q) && *q == \old(*p);
complete behaviors p_minimum, q_minimum;
disjoint behaviors p_minimum, q_minimum;
*/ | void max_ptr(int*p, int*q) {
if (*p > *q) {
int tmp = *p;
*p = *q;
*q = tmp;
}
} | true | 13 | 13 | void max_ptr(int*p, int*q) {
if (*p > *q) {
int tmp = *p;
*p = *q;
*q = tmp;
}
} | /*@ requires \valid(p) && \valid(q);
ensures *p <= *q;
behavior p_minimum:
assumes *p < *q;
ensures *p == \old(*p) && *q == \old(*q);
behavior q_minimum:
assumes *p >= *q;
ensures *p == \old(*q) && *q == \old(*p);
complete behaviors p_minimum, q_minimum;
disjoint behaviors p_minimum, q_minimum;
*/ |
|
frama_c_files_v2/test_frama_c_679.c | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/
int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invariant ((x5[0]=='\0') ==> (strlen(x0)==x4));
loop invariant ((!(x5[0]=='\0')) ==> (strlen(x0)!=x4));
loop invariant ((x3==2) || ((x3==1) || (x3==0)));
loop assigns x5, x4, x3, x2;
loop variant strlen(x5);
*/
for (;;) {
char *x7 = x5;
char x8 = x7[0];
int x9 = x8 == '\0';
int x13;
if (x9) {
x13 = 0/*false*/;
} else {
int x11 = x2;
x13 = x11;
}
if (!x13) break;
char *x37 = x5;
char *x38 = x37+1;
x5 = x38;
/*@ghost x4 = (x4+1);*/
}
char *x84 = x5;
char x85 = x84[0];
int x86 = x85 == '\0';
int x89;
if (x86) {
int x87 = x2;
x89 = x87;
} else {
x89 = 0/*false*/;
}
int x93;
if (x89) {
int x90 = x3;
int x91 = x90 == 2;
x93 = x91;
} else {
x93 = 0/*false*/;
}
/*@assert ((x5[0]=='\0') || (!x2));*/
return x93;
}
| #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/ | int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invariant ((x5[0]=='\0') ==> (strlen(x0)==x4));
loop invariant ((!(x5[0]=='\0')) ==> (strlen(x0)!=x4));
loop invariant ((x3==2) || ((x3==1) || (x3==0)));
loop assigns x5, x4, x3, x2;
loop variant strlen(x5);
*/
for (;;) {
char *x7 = x5;
char x8 = x7[0];
int x9 = x8 == '\0';
int x13;
if (x9) {
x13 = 0/*false*/;
} else {
int x11 = x2;
x13 = x11;
}
if (!x13) break;
char *x37 = x5;
char *x38 = x37+1;
x5 = x38;
/*@ghost x4 = (x4+1);*/
}
char *x84 = x5;
char x85 = x84[0];
int x86 = x85 == '\0';
int x89;
if (x86) {
int x87 = x2;
x89 = x87;
} else {
x89 = 0/*false*/;
}
int x93;
if (x89) {
int x90 = x3;
int x91 = x90 == 2;
x93 = x91;
} else {
x93 = 0/*false*/;
}
/*@assert ((x5[0]=='\0') || (!x2));*/
return x93;
} | true | 26 | 26 | int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invariant ((x5[0]=='\0') ==> (strlen(x0)==x4));
loop invariant ((!(x5[0]=='\0')) ==> (strlen(x0)!=x4));
loop invariant ((x3==2) || ((x3==1) || (x3==0)));
loop assigns x5, x4, x3, x2;
loop variant strlen(x5);
*/
for (;;) {
char *x7 = x5;
char x8 = x7[0];
int x9 = x8 == '\0';
int x13;
if (x9) {
x13 = 0/*false*/;
} else {
int x11 = x2;
x13 = x11;
}
if (!x13) break;
char *x37 = x5;
char *x38 = x37+1;
x5 = x38;
/*@ghost x4 = (x4+1);*/
}
char *x84 = x5;
char x85 = x84[0];
int x86 = x85 == '\0';
int x89;
if (x86) {
int x87 = x2;
x89 = x87;
} else {
x89 = 0/*false*/;
}
int x93;
if (x89) {
int x90 = x3;
int x91 = x90 == 2;
x93 = x91;
} else {
x93 = 0/*false*/;
}
/*@assert ((x5[0]=='\0') || (!x2));*/
return x93;
} | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/ |
|
frama_c_files_v2/test_frama_c_2301.c | /*@ requires 0 <= p <= r && \valid(A+(p..r));
@*/
int partition (int A[], int p, int r)
{
int x = A[r];
int tmp, j, i = p-1;
/*@ loop invariant p <= j <= r && p-1 <= i < j;
@ loop assigns tmp, i, j, A[p..r];
@ loop variant r-j;
@*/
for(j=p; j<r; j++)
if (A[j] <= x) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
tmp = A[i+1];
A[i+1] = A[r];
A[r] = tmp;
return i+1;
}
|
/*@ requires 0 <= p <= r && \valid(A+(p..r));
@*/ | int partition (int A[], int p, int r)
{
int x = A[r];
int tmp, j, i = p-1;
/*@ loop invariant p <= j <= r && p-1 <= i < j;
@ loop assigns tmp, i, j, A[p..r];
@ loop variant r-j;
@*/
for(j=p; j<r; j++)
if (A[j] <= x) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
tmp = A[i+1];
A[i+1] = A[r];
A[r] = tmp;
return i+1;
} | true | 26 | 26 | int partition (int A[], int p, int r)
{
int x = A[r];
int tmp, j, i = p-1;
/*@ loop invariant p <= j <= r && p-1 <= i < j;
@ loop assigns tmp, i, j, A[p..r];
@ loop variant r-j;
@*/
for(j=p; j<r; j++)
if (A[j] <= x) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
tmp = A[i+1];
A[i+1] = A[r];
A[r] = tmp;
return i+1;
} | /*@ requires 0 <= p <= r && \valid(A+(p..r));
@*/ |
|
frama_c_files_v2/test_frama_c_1775.c | // TODO : mettre les bonnes annotations...
/*@
requires n >= 0;
requires \valid_read(src+(0..n-1));
requires \valid(dst+(0..n-1));
assigns dst[0..n-1];
ensures dst[0..n-1] == \old(src[0..n-1]);
*/
void array_copy(int *src, int *dst, int n) {
if (src < dst) {
// recopier de droite à gauche
/*@
loop invariant -1 <= i <= n-1;
loop invariant
\forall int k; i < k <= n-1 ==> dst[k] == \at(src[k], Pre);
loop invariant
\forall int k; 0 <= k <= i ==> src[k] == \at(src[k], Pre);
loop assigns i, dst[0..n-1];
loop variant i+1;
*/
for (int i = n-1; -1 < i; i--) {
dst[i] = src[i];
}
} else {
// recopier de gauche à droite
/*@
loop invariant 0 <= i <= n;
loop invariant
\forall int k; 0 <= k < i ==> dst[k] == \at(src[k], Pre);
loop invariant
\forall int k; i <= k < n ==> src[k] == \at(src[k], Pre);
loop assigns i, dst[0..n-1];
loop variant n-i;
*/
for (int i = 0; i < n; i++) {
dst[i] = src[i];
}
}
}
|
/*@
requires n >= 0;
requires \valid_read(src+(0..n-1));
requires \valid(dst+(0..n-1));
assigns dst[0..n-1];
ensures dst[0..n-1] == \old(src[0..n-1]);
*/ | void array_copy(int *src, int *dst, int n) {
if (src < dst) {
// recopier de droite à gauche
/*@
loop invariant -1 <= i <= n-1;
loop invariant
\forall int k; i < k <= n-1 ==> dst[k] == \at(src[k], Pre);
loop invariant
\forall int k; 0 <= k <= i ==> src[k] == \at(src[k], Pre);
loop assigns i, dst[0..n-1];
loop variant i+1;
*/
for (int i = n-1; -1 < i; i--) {
dst[i] = src[i];
}
} else {
// recopier de gauche à droite
/*@
loop invariant 0 <= i <= n;
loop invariant
\forall int k; 0 <= k < i ==> dst[k] == \at(src[k], Pre);
loop invariant
\forall int k; i <= k < n ==> src[k] == \at(src[k], Pre);
loop assigns i, dst[0..n-1];
loop variant n-i;
*/
for (int i = 0; i < n; i++) {
dst[i] = src[i];
}
}
} | true | 33 | 33 | void array_copy(int *src, int *dst, int n) {
if (src < dst) {
// recopier de droite à gauche
/*@
loop invariant -1 <= i <= n-1;
loop invariant
\forall int k; i < k <= n-1 ==> dst[k] == \at(src[k], Pre);
loop invariant
\forall int k; 0 <= k <= i ==> src[k] == \at(src[k], Pre);
loop assigns i, dst[0..n-1];
loop variant i+1;
*/
for (int i = n-1; -1 < i; i--) {
dst[i] = src[i];
}
} else {
// recopier de gauche à droite
/*@
loop invariant 0 <= i <= n;
loop invariant
\forall int k; 0 <= k < i ==> dst[k] == \at(src[k], Pre);
loop invariant
\forall int k; i <= k < n ==> src[k] == \at(src[k], Pre);
loop assigns i, dst[0..n-1];
loop variant n-i;
*/
for (int i = 0; i < n; i++) {
dst[i] = src[i];
}
}
} | /*@
requires n >= 0;
requires \valid_read(src+(0..n-1));
requires \valid(dst+(0..n-1));
assigns dst[0..n-1];
ensures dst[0..n-1] == \old(src[0..n-1]);
*/ |
|
frama_c_files_v2/test_frama_c_919.c | // __out o, __in i
/*@ requires \valid(i) && \valid(o);
@ assigns *o;
@ ensures *o == *i;
*/
void OutAndIn(int *i, int *o) {
*o = *i;
}
void OutAndIn_test()
{
int a = 5;
int b = 0;
OutAndIn(&a, &b);
//@ assert a == b;
}
|
/*@ requires \valid(i) && \valid(o);
@ assigns *o;
@ ensures *o == *i;
*/ | void OutAndIn(int *i, int *o) {
*o = *i;
} | true | 6 | 6 | void OutAndIn(int *i, int *o) {
*o = *i;
} | /*@ requires \valid(i) && \valid(o);
@ assigns *o;
@ ensures *o == *i;
*/ |
|
frama_c_files_v2/test_frama_c_2746.c | /* ****************************************************************************
MAXIMUM D'UN TABLEAU
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 :
https://en.wikipedia.org/wiki/Literate_programming
************************************************************************* */
/* ---------------------------------------------------------------------------
Cet exercice est une variation de l'exercice "Maximum d'un tableau" du TD
6. Cet exercice n'a pas été corrigé en cours, mais si vous avez pris le temps
de le faire par vous-même comme je l'avais demandé, cela devrait vous
permettre de gagner un peu de temps pour ce TP noté...
------------------------------------------------------------------------- */
/* ---------------------------------------------------------------------------
La fonction [max_idx] est une fonction auxiliaire de la fonction principale
[max_seq], définie juste après. Nous ne donnons ici que sa déclaration. Sa
définition est fournie en fin de fichier.
------------------------------------------------------------------------- */
#include <limits.h>
int max_idx(unsigned int *t, int len);
/* ---------------------------------------------------------------------------
La fonction [max_seq] retourne la valeur maximale contenue dans
le tableau [t] de longueur [len]. Elle retourne -1 si le tableau est vide.
Question 1 : spécifier cette fonction en utilisant des comportements ACSL.
Question 2 : prouver cette fonction, y compris sa terminaison et l'absence
d'erreurs à l'exécution. On prendra garde à ne spécifier que les
préconditions strictement nécessaires pour garantir l'absence d'erreurs à
l'exécution.
Indice : il est autorisé d'inclure un fichier de la bibliothèque standard du
C (déjà utilisé en TD dans des cas similaires).
------------------------------------------------------------------------- */
/*@ requires \valid(t+(0..len-1));
@ requires len >= 0;
@ requires \forall integer n; 0 <= n < len ==> t[n] <= INT_MAX;
@ assigns \nothing;
@ behavior t_vide:
@ assumes len == 0;
@ ensures \result == -1;
@ behavior t_max:
@ assumes len > 0;
@ ensures \forall integer n; 0 <= n < len ==> \result >= t[n];
@ ensures \exists int e; 0 <= e < len && \result == t[e];
@ ensures \result >= 0;
@ complete behaviors;
@ disjoint behaviors;
@ */
int max_seq(unsigned int *t, int len) {
if (len <= 0) return -1;
return t[max_idx(t, len)];
}
/* ---------------------------------------------------------------------------
Ci-après, la définition de la fonction [max_idx].
------------------------------------------------------------------------- */
/*@ requires \valid(t+(0..len-1));
@ requires len > 0;
@ assigns \nothing;
@ ensures len == 0 ==> \result == 0;
@ ensures \forall integer n; 0 <= n < len ==> t[\result] >= t[n];
@ ensures 0 <= \result < len;
@ */
int max_idx(unsigned int *t, int len) {
int max = 0;
/*@loop invariant 1 <= i <= len;
@loop invariant \forall integer n; 0 <= n < i ==> t[max] >= t[n];
@loop invariant 0 <= max < len;
@loop assigns i, max;
@loop variant len - i;
@ */
for(int i = 1; i < len; i++)
if (t[max] < t[i])
max = i;
return max;
}
| #include <limits.h>
/*@ requires \valid(t+(0..len-1));
@ requires len >= 0;
@ requires \forall integer n; 0 <= n < len ==> t[n] <= INT_MAX;
@ assigns \nothing;
@ behavior t_vide:
@ assumes len == 0;
@ ensures \result == -1;
@ behavior t_max:
@ assumes len > 0;
@ ensures \forall integer n; 0 <= n < len ==> \result >= t[n];
@ ensures \exists int e; 0 <= e < len && \result == t[e];
@ ensures \result >= 0;
@ complete behaviors;
@ disjoint behaviors;
@ */
int max_seq(unsigned int *t, int len) {
if (len <= 0) return -1;
return t[max_idx(t, len)];
}
/* ---------------------------------------------------------------------------
Ci-après, la définition de la fonction [max_idx].
------------------------------------------------------------------------- */
/*@ requires \valid(t+(0..len-1));
@ requires len > 0;
@ assigns \nothing;
@ ensures len == 0 ==> \result == 0;
@ ensures \forall integer n; 0 <= n < len ==> t[\result] >= t[n];
@ ensures 0 <= \result < len;
@ */ | int max_idx(unsigned int *t, int len) {
int max = 0;
/*@loop invariant 1 <= i <= len;
@loop invariant \forall integer n; 0 <= n < i ==> t[max] >= t[n];
@loop invariant 0 <= max < len;
@loop assigns i, max;
@loop variant len - i;
@ */
for(int i = 1; i < len; i++)
if (t[max] < t[i])
max = i;
return max;
} | true | 34 | 34 | int max_idx(unsigned int *t, int len) {
int max = 0;
/*@loop invariant 1 <= i <= len;
@loop invariant \forall integer n; 0 <= n < i ==> t[max] >= t[n];
@loop invariant 0 <= max < len;
@loop assigns i, max;
@loop variant len - i;
@ */
for(int i = 1; i < len; i++)
if (t[max] < t[i])
max = i;
return max;
} | #include <limits.h>
/*@ requires \valid(t+(0..len-1));
@ requires len >= 0;
@ requires \forall integer n; 0 <= n < len ==> t[n] <= INT_MAX;
@ assigns \nothing;
@ behavior t_vide:
@ assumes len == 0;
@ ensures \result == -1;
@ behavior t_max:
@ assumes len > 0;
@ ensures \forall integer n; 0 <= n < len ==> \result >= t[n];
@ ensures \exists int e; 0 <= e < len && \result == t[e];
@ ensures \result >= 0;
@ complete behaviors;
@ disjoint behaviors;
@ */
int max_seq(unsigned int *t, int len) {
if (len <= 0) return -1;
return t[max_idx(t, len)];
}
/* ---------------------------------------------------------------------------
Ci-après, la définition de la fonction [max_idx].
------------------------------------------------------------------------- */
/*@ requires \valid(t+(0..len-1));
@ requires len > 0;
@ assigns \nothing;
@ ensures len == 0 ==> \result == 0;
@ ensures \forall integer n; 0 <= n < len ==> t[\result] >= t[n];
@ ensures 0 <= \result < len;
@ */ |
|
frama_c_files_v2/test_frama_c_1795.c | #include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/
int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
}
/*@ predicate inv_matrix_Boolean(int * x26, integer x27, integer x28) = (((((x27<100) &&
(x28<100)) &&
(0<x27)) &&
(0<x28)) &&
(((x27*x28)>0) &&
\valid(x26+(0..(x27*x28)-1))));*/
/*@
requires (((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71)) &&
((((x64==x67) &&
(x64==x70)) &&
(x65==x68)) &&
(x65==x71)));
ensures ((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71));
*/
void add(int * x63, int x64, int x65, int * x66, int x67, int x68, int * x69, int x70, int x71) {
/*@
loop invariant 0<=x76<=x70;
loop assigns x76, x69[(0..(x70*x71)-1)];
loop variant x70-x76;
*/
for(int x76=0; x76 < x70; x76++) {
/*@
loop invariant 0<=x78<=x71;
loop assigns x78, x69[(0..(x70*x71)-1)];
loop variant x71-x78;
*/
for(int x78=0; x78 < x71; x78++) {
int x79 = index(x64,x65,x76,x78);
int x80 = x63[x79];
int x81 = index(x67,x68,x76,x78);
int x82 = x66[x81];
int x83 = x80 || x82;
int x84 = index(x70,x71,x76,x78);
x69[x84] = x83;
}
}
}
/*@
requires ((inv_matrix_Boolean(x111,x112,x113) &&
inv_matrix_Boolean(x114,x115,x116)) &&
((x112==x115) &&
(x113==x116)));
ensures (inv_matrix_Boolean(x111,x112,x113) &&
inv_matrix_Boolean(x114,x115,x116));
*/
void scalar_mult(int x110, int * x111, int x112, int x113, int * x114, int x115, int x116) {
/*@
loop invariant 0<=x121<=x115;
loop assigns x121, x114[(0..(x115*x116)-1)];
loop variant x115-x121;
*/
for(int x121=0; x121 < x115; x121++) {
/*@
loop invariant 0<=x123<=x116;
loop assigns x123, x114[(0..(x115*x116)-1)];
loop variant x116-x123;
*/
for(int x123=0; x123 < x116; x123++) {
int x126;
if (x110) {
int x124 = index(x112,x113,x121,x123);
int x125 = x111[x124];
x126 = x125;
} else {
x126 = 0/*false*/;
}
int x127 = index(x115,x116,x121,x123);
x114[x127] = x126;
}
}
}
| #include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/ | int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
} | true | 8 | 8 | int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
} | #include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/ |
|
frama_c_files_v2/test_frama_c_669.c | /*@
requires -1000000000<a<1000000000;
requires -1000000000<b<1000000000;
ensures b==\result+a && b>a || b==a-\result && a>=b;
*/
int distance(int a,int b){
if(a < b)
return b - a ;
else
return a - b ;
}
|
/*@
requires -1000000000<a<1000000000;
requires -1000000000<b<1000000000;
ensures b==\result+a && b>a || b==a-\result && a>=b;
*/ | int distance(int a,int b){
if(a < b)
return b - a ;
else
return a - b ;
} | true | 7 | 7 | int distance(int a,int b){
if(a < b)
return b - a ;
else
return a - b ;
} | /*@
requires -1000000000<a<1000000000;
requires -1000000000<b<1000000000;
ensures b==\result+a && b>a || b==a-\result && a>=b;
*/ |
|
frama_c_files_v2/test_frama_c_2344.c | /*@ requires size >= 0;
requires \valid(a+(0..size-1));
requires \valid(res+(0..size-1));
assigns res[0..size-1];
ensures \forall integer i; 0 <= i < size ==> res[i] == a[size - i - 1];
*/
void reverse(int a[], int res[], int size)
{
int i;
/*@ loop invariant -1 <= i < size;
loop invariant \forall integer j; i < j < size ==> res[j] == a[size - j - 1];
loop assigns i, res[0..size-1];
loop variant i;
*/
for(i = size - 1; i >= 0; --i) {
res[i] = a[size - i - 1];
}
}
|
/*@ requires size >= 0;
requires \valid(a+(0..size-1));
requires \valid(res+(0..size-1));
assigns res[0..size-1];
ensures \forall integer i; 0 <= i < size ==> res[i] == a[size - i - 1];
*/ | void reverse(int a[], int res[], int size)
{
int i;
/*@ loop invariant -1 <= i < size;
loop invariant \forall integer j; i < j < size ==> res[j] == a[size - j - 1];
loop assigns i, res[0..size-1];
loop variant i;
*/
for(i = size - 1; i >= 0; --i) {
res[i] = a[size - i - 1];
}
} | true | 20 | 20 | void reverse(int a[], int res[], int size)
{
int i;
/*@ loop invariant -1 <= i < size;
loop invariant \forall integer j; i < j < size ==> res[j] == a[size - j - 1];
loop assigns i, res[0..size-1];
loop variant i;
*/
for(i = size - 1; i >= 0; --i) {
res[i] = a[size - i - 1];
}
} | /*@ requires size >= 0;
requires \valid(a+(0..size-1));
requires \valid(res+(0..size-1));
assigns res[0..size-1];
ensures \forall integer i; 0 <= i < size ==> res[i] == a[size - i - 1];
*/ |
|
frama_c_files_v2/test_frama_c_366.c | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='A' && s[3]=='B' && s[4]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1_1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='X' && s[3]=='\0';
ensures !matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab0(char* r, char* s) {}
| #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/ | void dfa_spec_aab1(char* r, char* s) {} | true | 4 | 4 | void dfa_spec_aab1(char* r, char* s) {} | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/ |
|
frama_c_files_v2/test_frama_c_366.c | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='A' && s[3]=='B' && s[4]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1_1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='X' && s[3]=='\0';
ensures !matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab0(char* r, char* s) {}
| #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='A' && s[3]=='B' && s[4]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/ | void dfa_spec_aab1_1(char* r, char* s) {} | true | 8 | 8 | void dfa_spec_aab1_1(char* r, char* s) {} | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='A' && s[3]=='B' && s[4]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/ |
|
frama_c_files_v2/test_frama_c_366.c | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='A' && s[3]=='B' && s[4]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1_1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='X' && s[3]=='\0';
ensures !matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab0(char* r, char* s) {}
| #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='A' && s[3]=='B' && s[4]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1_1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='X' && s[3]=='\0';
ensures !matchhere(r, s);
assigns \nothing;
*/ | void dfa_spec_aab0(char* r, char* s) {} | true | 12 | 12 | void dfa_spec_aab0(char* r, char* s) {} | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='A' && s[3]=='B' && s[4]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1_1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='X' && s[3]=='\0';
ensures !matchhere(r, s);
assigns \nothing;
*/ |
|
frama_c_files_v2/test_frama_c_1432.c | /*@ ensures \result==0 || \result==1;
assigns \nothing;
*/
int predicate(int v) {
return v % 2 == 0;
}
/*@ requires n > 0;
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
ensures 0 <= \result <= n;
ensures \forall int i; 0 <= i < \result ==> 0 <= o[i] < n;
ensures \forall int i; 0 < i < \result ==> o[i-1] < o[i];
assigns o[0..n-1];
*/
int index_where(int* v, int n, int* o) {
int r = 0;
/*@
loop invariant 0 <= i <= n;
loop invariant 0 <= r <= i;
loop invariant \forall int j; 0 <= j < r ==> 0 <= o[j] < i;
loop invariant \forall int j; 0 < j < r ==> o[j-1] < o[j];
loop assigns i, r, o[0..n-1];
loop variant n-i;
*/
for (int i = 0; i < n; i++) {
if (predicate(v[i])) {
o[r++] = i;
}
}
return r;
}
|
/*@ ensures \result==0 || \result==1;
assigns \nothing;
*/ | int predicate(int v) {
return v % 2 == 0;
} | true | 4 | 4 | int predicate(int v) {
return v % 2 == 0;
} | /*@ ensures \result==0 || \result==1;
assigns \nothing;
*/ |
|
frama_c_files_v2/test_frama_c_1527.c | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/
int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invariant ((x5[0]=='\0') ==> (strlen(x0)==x4));
loop invariant ((!(x5[0]=='\0')) ==> (strlen(x0)!=x4));
loop invariant ((x3==3) || ((x3==2) || ((x3==1) || (x3==0))));
loop assigns x5, x4, x3, x2;
loop variant strlen(x5);
*/
for (;;) {
char *x7 = x5;
char x8 = x7[0];
int x9 = x8 == '\0';
int x13;
if (x9) {
x13 = 0/*false*/;
} else {
int x11 = x2;
x13 = x11;
}
if (!x13) break;
char *x39 = x5;
char *x40 = x39+1;
x5 = x40;
/*@ghost x4 = (x4+1);*/
}
char *x86 = x5;
char x87 = x86[0];
int x88 = x87 == '\0';
int x91;
if (x88) {
int x89 = x2;
x91 = x89;
} else {
x91 = 0/*false*/;
}
int x95;
if (x91) {
int x92 = x3;
int x93 = x92 == 3;
x95 = x93;
} else {
x95 = 0/*false*/;
}
/*@assert ((x5[0]=='\0') || (!x2));*/
return x95;
}
| #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/ | int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invariant ((x5[0]=='\0') ==> (strlen(x0)==x4));
loop invariant ((!(x5[0]=='\0')) ==> (strlen(x0)!=x4));
loop invariant ((x3==3) || ((x3==2) || ((x3==1) || (x3==0))));
loop assigns x5, x4, x3, x2;
loop variant strlen(x5);
*/
for (;;) {
char *x7 = x5;
char x8 = x7[0];
int x9 = x8 == '\0';
int x13;
if (x9) {
x13 = 0/*false*/;
} else {
int x11 = x2;
x13 = x11;
}
if (!x13) break;
char *x39 = x5;
char *x40 = x39+1;
x5 = x40;
/*@ghost x4 = (x4+1);*/
}
char *x86 = x5;
char x87 = x86[0];
int x88 = x87 == '\0';
int x91;
if (x88) {
int x89 = x2;
x91 = x89;
} else {
x91 = 0/*false*/;
}
int x95;
if (x91) {
int x92 = x3;
int x93 = x92 == 3;
x95 = x93;
} else {
x95 = 0/*false*/;
}
/*@assert ((x5[0]=='\0') || (!x2));*/
return x95;
} | true | 26 | 26 | int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invariant ((x5[0]=='\0') ==> (strlen(x0)==x4));
loop invariant ((!(x5[0]=='\0')) ==> (strlen(x0)!=x4));
loop invariant ((x3==3) || ((x3==2) || ((x3==1) || (x3==0))));
loop assigns x5, x4, x3, x2;
loop variant strlen(x5);
*/
for (;;) {
char *x7 = x5;
char x8 = x7[0];
int x9 = x8 == '\0';
int x13;
if (x9) {
x13 = 0/*false*/;
} else {
int x11 = x2;
x13 = x11;
}
if (!x13) break;
char *x39 = x5;
char *x40 = x39+1;
x5 = x40;
/*@ghost x4 = (x4+1);*/
}
char *x86 = x5;
char x87 = x86[0];
int x88 = x87 == '\0';
int x91;
if (x88) {
int x89 = x2;
x91 = x89;
} else {
x91 = 0/*false*/;
}
int x95;
if (x91) {
int x92 = x3;
int x93 = x92 == 3;
x95 = x93;
} else {
x95 = 0/*false*/;
}
/*@assert ((x5[0]=='\0') || (!x2));*/
return x95;
} | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/ |
|
frama_c_files_v2/test_frama_c_2890.c | /*@
requires \valid(a) && \valid(b);
requires -10000000<*a<10000000 && -10000000<*b<10000000;
ensures \result==*a && \result>=*b || \result==*b && \result>=*a;
*/
int max_ptr(int* a,int* b){
return(*a > *b) ? *a: *b ;
}
extern int h ;
int main(){
h =42;
int a =24,b =42;
int x= max_ptr(&a,&b);
}
|
/*@
requires \valid(a) && \valid(b);
requires -10000000<*a<10000000 && -10000000<*b<10000000;
ensures \result==*a && \result>=*b || \result==*b && \result>=*a;
*/ | int max_ptr(int* a,int* b){
return(*a > *b) ? *a: *b ;
} | true | 7 | 7 | int max_ptr(int* a,int* b){
return(*a > *b) ? *a: *b ;
} | /*@
requires \valid(a) && \valid(b);
requires -10000000<*a<10000000 && -10000000<*b<10000000;
ensures \result==*a && \result>=*b || \result==*b && \result>=*a;
*/ |
|
frama_c_files_v2/test_frama_c_1708.c | /*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
*/
void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
}
int main(){
int a = 42;
int b = 37;
swap(&a, &b);
//@ assert a == 37 && b == 42;
return 0;
}
|
/*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
*/ | void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
} | true | 10 | 10 | void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
} | /*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
*/ |
|
frama_c_files_v2/test_frama_c_537.c | /*@ predicate allequ{L}(integer i, int *x, integer res) =
@ \forall integer j; (i <= j <= res+i-1) ==> (\at(x[i], L)==\at(x[j], L));
@*/
//Examines equality between between all elemnts in [i,i+res-1]
/*@ predicate ismax{L}(integer i, int *x, integer res,integer N) =
@ \forall integer j; (0 < j <= N-1 && j!=i) ==> (\forall integer rp; (1 < rp < N && allequ(j,x,rp)) ==> (rp <= res));
@*/
//Examines that res is the max res the you can get in length N
//For every r that satisfies allequ this r must be smaller-equal from res
/*@ predicate cond{L}(integer N, int *x, integer res) =
@ \exists integer i; (0 <= i < N-res) ==> (allequ(i,x,res) && ismax(i,x,res,N));
@*/
//For something to satisfy the given condition there must exist an integer such that for i to
// i+res-1 positions we will have equality and this will be the max length
/*@ requires N > 0;
@ requires \valid(x + (0..N-1));
@ ensures cond(N, x,\result);
@*/
int countSameConsecutive(int N, int x[]) {
int best = 0, i = 0;
// we try to maintain an essence of current best in order to reach total (best)
// for that we replace N <- i+1 (to look until i array positions)
/*@ loop invariant 0 <= i <= N;
@ loop invariant 0 <= best <= N;
@ loop invariant 0 < i <==> 0 < best;
@ loop invariant (0 < best <==> allequ(i,x,best)) || (best == 0 <==> i==0) ;
@ loop invariant (0 < best <==> ismax(i,x,best,i+1)) || (best == 0 <==> i==0);
@ loop invariant ((0 < i < N && 0 < best) <==> cond(i+1,x,best)) || (best == 0 <==> i==0);
@ loop assigns i, best;
@ loop variant N-i;
@*/
while (i < N) {
int j = i+1;
// while we are inside the second loop everything allequ for j-i
// (starting from i) matrix positions is maintained
/*@ loop invariant i+1 <= j <= N;
@ loop invariant (x[j] == x[i]) ==> allequ(i,x,j-i);
@ loop assigns j;
@ loop variant N-j;
@*/
while (j < N && x[j] == x[i]) ++j;
if (j-i > best) best = j-i;
i = j;
}
return best;
}
|
/*@ predicate allequ{L}(integer i, int *x, integer res) =
@ \forall integer j; (i <= j <= res+i-1) ==> (\at(x[i], L)==\at(x[j], L));
@*/
//Examines equality between between all elemnts in [i,i+res-1]
/*@ predicate ismax{L}(integer i, int *x, integer res,integer N) =
@ \forall integer j; (0 < j <= N-1 && j!=i) ==> (\forall integer rp; (1 < rp < N && allequ(j,x,rp)) ==> (rp <= res));
@*/
//Examines that res is the max res the you can get in length N
//For every r that satisfies allequ this r must be smaller-equal from res
/*@ predicate cond{L}(integer N, int *x, integer res) =
@ \exists integer i; (0 <= i < N-res) ==> (allequ(i,x,res) && ismax(i,x,res,N));
@*/
//For something to satisfy the given condition there must exist an integer such that for i to
// i+res-1 positions we will have equality and this will be the max length
/*@ requires N > 0;
@ requires \valid(x + (0..N-1));
@ ensures cond(N, x,\result);
@*/ | int countSameConsecutive(int N, int x[]) {
int best = 0, i = 0;
// we try to maintain an essence of current best in order to reach total (best)
// for that we replace N <- i+1 (to look until i array positions)
/*@ loop invariant 0 <= i <= N;
@ loop invariant 0 <= best <= N;
@ loop invariant 0 < i <==> 0 < best;
@ loop invariant (0 < best <==> allequ(i,x,best)) || (best == 0 <==> i==0) ;
@ loop invariant (0 < best <==> ismax(i,x,best,i+1)) || (best == 0 <==> i==0);
@ loop invariant ((0 < i < N && 0 < best) <==> cond(i+1,x,best)) || (best == 0 <==> i==0);
@ loop assigns i, best;
@ loop variant N-i;
@*/
while (i < N) {
int j = i+1;
// while we are inside the second loop everything allequ for j-i
// (starting from i) matrix positions is maintained
/*@ loop invariant i+1 <= j <= N;
@ loop invariant (x[j] == x[i]) ==> allequ(i,x,j-i);
@ loop assigns j;
@ loop variant N-j;
@*/
while (j < N && x[j] == x[i]) ++j;
if (j-i > best) best = j-i;
i = j;
}
return best;
} | true | 34 | 34 | int countSameConsecutive(int N, int x[]) {
int best = 0, i = 0;
// we try to maintain an essence of current best in order to reach total (best)
// for that we replace N <- i+1 (to look until i array positions)
/*@ loop invariant 0 <= i <= N;
@ loop invariant 0 <= best <= N;
@ loop invariant 0 < i <==> 0 < best;
@ loop invariant (0 < best <==> allequ(i,x,best)) || (best == 0 <==> i==0) ;
@ loop invariant (0 < best <==> ismax(i,x,best,i+1)) || (best == 0 <==> i==0);
@ loop invariant ((0 < i < N && 0 < best) <==> cond(i+1,x,best)) || (best == 0 <==> i==0);
@ loop assigns i, best;
@ loop variant N-i;
@*/
while (i < N) {
int j = i+1;
// while we are inside the second loop everything allequ for j-i
// (starting from i) matrix positions is maintained
/*@ loop invariant i+1 <= j <= N;
@ loop invariant (x[j] == x[i]) ==> allequ(i,x,j-i);
@ loop assigns j;
@ loop variant N-j;
@*/
while (j < N && x[j] == x[i]) ++j;
if (j-i > best) best = j-i;
i = j;
}
return best;
} | /*@ predicate allequ{L}(integer i, int *x, integer res) =
@ \forall integer j; (i <= j <= res+i-1) ==> (\at(x[i], L)==\at(x[j], L));
@*/
//Examines equality between between all elemnts in [i,i+res-1]
/*@ predicate ismax{L}(integer i, int *x, integer res,integer N) =
@ \forall integer j; (0 < j <= N-1 && j!=i) ==> (\forall integer rp; (1 < rp < N && allequ(j,x,rp)) ==> (rp <= res));
@*/
//Examines that res is the max res the you can get in length N
//For every r that satisfies allequ this r must be smaller-equal from res
/*@ predicate cond{L}(integer N, int *x, integer res) =
@ \exists integer i; (0 <= i < N-res) ==> (allequ(i,x,res) && ismax(i,x,res,N));
@*/
//For something to satisfy the given condition there must exist an integer such that for i to
// i+res-1 positions we will have equality and this will be the max length
/*@ requires N > 0;
@ requires \valid(x + (0..N-1));
@ ensures cond(N, x,\result);
@*/ |
|
frama_c_files_v2/test_frama_c_1127.c | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/
int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
}
/*@
assigns \nothing;
ensures '0'<=\result<='9' || \result==' ';
ensures e(i)==\result;
*/
char e(int i) {
return (0 <= i && i <= 9) ? i + '0' : ' ';
}
/*@
assigns \nothing;
ensures '0'<=c<='9' ==> \result==c;
ensures c!=\result ==> \result==' ';
ensures e(d(c))==\result;
*/
char ed(char c) {
return e(d(c));
}
/*@
assigns \nothing;
ensures 0<=i<=9 ==> \result==i;
ensures i!=\result ==> \result==-1;
ensures d(e(i))==\result;
*/
int de(int i) {
return d(e(i));
}
/*@
assigns \nothing;
ensures d(e(d(c)))==d(c);
*/
int ded(char c) {
return d(e(d(c)));
}
/*@
assigns \nothing;
ensures e(d(e(i)))==e(i);
*/
char ede(int i) {
return e(d(e(i)));
}
| #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/ | int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
} | true | 8 | 8 | int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
} | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/ |
|
frama_c_files_v2/test_frama_c_1127.c | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/
int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
}
/*@
assigns \nothing;
ensures '0'<=\result<='9' || \result==' ';
ensures e(i)==\result;
*/
char e(int i) {
return (0 <= i && i <= 9) ? i + '0' : ' ';
}
/*@
assigns \nothing;
ensures '0'<=c<='9' ==> \result==c;
ensures c!=\result ==> \result==' ';
ensures e(d(c))==\result;
*/
char ed(char c) {
return e(d(c));
}
/*@
assigns \nothing;
ensures 0<=i<=9 ==> \result==i;
ensures i!=\result ==> \result==-1;
ensures d(e(i))==\result;
*/
int de(int i) {
return d(e(i));
}
/*@
assigns \nothing;
ensures d(e(d(c)))==d(c);
*/
int ded(char c) {
return d(e(d(c)));
}
/*@
assigns \nothing;
ensures e(d(e(i)))==e(i);
*/
char ede(int i) {
return e(d(e(i)));
}
| #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/
int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
}
/*@
assigns \nothing;
ensures '0'<=\result<='9' || \result==' ';
ensures e(i)==\result;
*/ | char e(int i) {
return (0 <= i && i <= 9) ? i + '0' : ' ';
} | true | 17 | 17 | char e(int i) {
return (0 <= i && i <= 9) ? i + '0' : ' ';
} | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/
int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
}
/*@
assigns \nothing;
ensures '0'<=\result<='9' || \result==' ';
ensures e(i)==\result;
*/ |
|
frama_c_files_v2/test_frama_c_2724.c | /*@
// Invariant and equality spec for Vector[Char]
predicate spec_Inv_VC(char *a1, int n) =
n==0 || (n>0 && \valid(a1+(0..n-1)));
predicate spec_Eq_VC(char *a1, char *a2, int n1, int n2) =
(n1==n2) &&
(\forall int j; (0<=j<n1) ==> a1[j] == a2[j]);
// Invariant and equality spec for Vector[Vector[Char]]
predicate spec_Inv_VVC(char **a1, int *an1, int n) =
n==0 || (n>0 && \valid(a1+(0..n-1)) && \valid(an1+(0..n-1))) &&
(\forall int j; (0<=j<n) ==> spec_Inv_VC(a1[j],an1[j]));
predicate spec_Eq_VVC(char **a1, char **a2, int *an1, int *an2, int n1, int n2) =
(n1==n2) &&
(\forall int j; (0<=j<n1) ==> spec_Eq_VC(a1[j],a2[j],an1[j],an2[j]));
*/
// Contract and implementation for Vector[Char] equality
/*@ requires spec_Inv_VC(a1,n1) && spec_Inv_VC(a2,n2);
ensures (\result == 1) || (\result == 0);
ensures (\result == 1) <==> spec_Eq_VC(a1,a2,n1,n2);
ensures (\result == 0) <==> !spec_Eq_VC(a1,a2,n1,n2);
assigns \nothing; */
int eq_VC(char *a1, char *a2, int n1, int n2) {
if (n1 != n2) return 0;
/*@ loop invariant (0 <= i <= n1);
loop invariant \forall int j; (0 <= j < i) ==> a1[j]==a2[j];
loop assigns i;
loop variant (n1-i); */
for (int i = 0; i < n1; i++) {
if (a1[i] != a2[i]) return 0;
}
return 1;
}
// Contract and implementation for Vector[Vector[Char]] equality
/*@ requires spec_Inv_VVC(a1,an1,n1) && spec_Inv_VVC(a2,an2,n2);
ensures (\result == 1) || (\result == 0);
ensures (\result == 1) <==> spec_Eq_VVC(a1,a2,an1,an2,n1,n2);
ensures (\result == 0) <==> !spec_Eq_VVC(a1,a2,an1,an2,n1,n2);
assigns \nothing; */
int eq_VVC(char **a1, char **a2, int *an1, int *an2, int n1, int n2) {
if (n1 != n2) return 0;
/*@ loop invariant (0 <= i <= n1);
loop invariant \forall int j; (0 <= j < i) ==> spec_Eq_VC(a1[j],a2[j],an1[j],an2[j]);
loop assigns i;
loop variant (n1-i); */
for (int i = 0; i < n1; i++) {
if (eq_VC(a1[i],a2[i],an1[i],an2[i]) != 1) return 0;
}
return 1;
}
|
/*@
// Invariant and equality spec for Vector[Char]
predicate spec_Inv_VC(char *a1, int n) =
n==0 || (n>0 && \valid(a1+(0..n-1)));
predicate spec_Eq_VC(char *a1, char *a2, int n1, int n2) =
(n1==n2) &&
(\forall int j; (0<=j<n1) ==> a1[j] == a2[j]);
// Invariant and equality spec for Vector[Vector[Char]]
predicate spec_Inv_VVC(char **a1, int *an1, int n) =
n==0 || (n>0 && \valid(a1+(0..n-1)) && \valid(an1+(0..n-1))) &&
(\forall int j; (0<=j<n) ==> spec_Inv_VC(a1[j],an1[j]));
predicate spec_Eq_VVC(char **a1, char **a2, int *an1, int *an2, int n1, int n2) =
(n1==n2) &&
(\forall int j; (0<=j<n1) ==> spec_Eq_VC(a1[j],a2[j],an1[j],an2[j]));
*/
// Contract and implementation for Vector[Char] equality
/*@ requires spec_Inv_VC(a1,n1) && spec_Inv_VC(a2,n2);
ensures (\result == 1) || (\result == 0);
ensures (\result == 1) <==> spec_Eq_VC(a1,a2,n1,n2);
ensures (\result == 0) <==> !spec_Eq_VC(a1,a2,n1,n2);
assigns \nothing; */ | int eq_VC(char *a1, char *a2, int n1, int n2) {
if (n1 != n2) return 0;
/*@ loop invariant (0 <= i <= n1);
loop invariant \forall int j; (0 <= j < i) ==> a1[j]==a2[j];
loop assigns i;
loop variant (n1-i); */
for (int i = 0; i < n1; i++) {
if (a1[i] != a2[i]) return 0;
}
return 1;
} | true | 19 | 19 | int eq_VC(char *a1, char *a2, int n1, int n2) {
if (n1 != n2) return 0;
/*@ loop invariant (0 <= i <= n1);
loop invariant \forall int j; (0 <= j < i) ==> a1[j]==a2[j];
loop assigns i;
loop variant (n1-i); */
for (int i = 0; i < n1; i++) {
if (a1[i] != a2[i]) return 0;
}
return 1;
} | /*@
// Invariant and equality spec for Vector[Char]
predicate spec_Inv_VC(char *a1, int n) =
n==0 || (n>0 && \valid(a1+(0..n-1)));
predicate spec_Eq_VC(char *a1, char *a2, int n1, int n2) =
(n1==n2) &&
(\forall int j; (0<=j<n1) ==> a1[j] == a2[j]);
// Invariant and equality spec for Vector[Vector[Char]]
predicate spec_Inv_VVC(char **a1, int *an1, int n) =
n==0 || (n>0 && \valid(a1+(0..n-1)) && \valid(an1+(0..n-1))) &&
(\forall int j; (0<=j<n) ==> spec_Inv_VC(a1[j],an1[j]));
predicate spec_Eq_VVC(char **a1, char **a2, int *an1, int *an2, int n1, int n2) =
(n1==n2) &&
(\forall int j; (0<=j<n1) ==> spec_Eq_VC(a1[j],a2[j],an1[j],an2[j]));
*/
// Contract and implementation for Vector[Char] equality
/*@ requires spec_Inv_VC(a1,n1) && spec_Inv_VC(a2,n2);
ensures (\result == 1) || (\result == 0);
ensures (\result == 1) <==> spec_Eq_VC(a1,a2,n1,n2);
ensures (\result == 0) <==> !spec_Eq_VC(a1,a2,n1,n2);
assigns \nothing; */ |
|
frama_c_files_v2/test_frama_c_478.c | #include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate eq_vec_Int(int * x16, int x17, int * x18, int x19) = ((x17==x19) &&
(\forall int x23; (0<=x23<x17) ==> (x16[x23]==x18[x23])));*/
/*@
requires (inv_vec_Int(x16,x17) &&
inv_vec_Int(x18,x19));
assigns \nothing;
ensures (inv_vec_Int(x16,x17) &&
inv_vec_Int(x18,x19));
ensures \result <==> eq_vec_Int(x16, x17, x18, x19);
*/
int eq_vec_Int(int * x16, int x17, int * x18, int x19) {
int x21 = x17 == x19;
int x33;
if (x21) {
int x32 = 1;
/*@ loop invariant (0 <= x24 <= x17);
loop invariant \forall int x23; (0 <= x23 < x24) ==> (x16[x23]==x18[x23]);
loop assigns x24;
loop variant (x17-x24); */
for (int x24 = 0; x24 < x17; x24++) {
int x29 = x16[x24];
int x30 = x18[x24];
int x31 = x29 == x30;
if (!x31) { x32 = 0; break; }
}
x33 = x32;
} else {
x33 = 0/*false*/;
}
return x33;
}
/*@ predicate inv_vec_vec_Int(int * * x37, int * x38, int x39) = (((x39==0) || ((x39>0) &&
(\valid(x37+(0..x39-1)) &&
\valid(x38+(0..x39-1))))) &&
(\forall int x49; (0<=x49<x39) ==> inv_vec_Int(x37[x49],x38[x49])));*/
/*@ predicate eq_vec_vec_Int(int * * x61, int * x62, int x63, int * * x64, int * x65, int x66) = ((x63==x66) &&
(\forall int x70; (0<=x70<x63) ==> eq_vec_Int(x61[x70],x62[x70],x64[x70],x65[x70])));*/
/*@
requires (inv_vec_vec_Int(x61,x62,x63) &&
inv_vec_vec_Int(x64,x65,x66));
assigns \nothing;
ensures (inv_vec_vec_Int(x61,x62,x63) &&
inv_vec_vec_Int(x64,x65,x66));
ensures \result <==> eq_vec_vec_Int(x61, x62, x63, x64, x65, x66);
*/
int eq_vec_vec_Int(int * * x61, int * x62, int x63, int * * x64, int * x65, int x66) {
int x68 = x63 == x66;
int x84;
if (x68) {
int x83 = 1;
/*@ loop invariant (0 <= x71 <= x63);
loop invariant \forall int x70; (0 <= x70 < x71) ==> eq_vec_Int(x61[x70],x62[x70],x64[x70],x65[x70]);
loop assigns x71;
loop variant (x63-x71); */
for (int x71 = 0; x71 < x63; x71++) {
int *x78 = x61[x71];
int x79 = x62[x71];
int *x80 = x64[x71];
int x81 = x65[x71];
int x82 = eq_vec_Int(x78,x79,x80,x81);
if (!x82) { x83 = 0; break; }
}
x84 = x83;
} else {
x84 = 0/*false*/;
}
return x84;
}
| #include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate eq_vec_Int(int * x16, int x17, int * x18, int x19) = ((x17==x19) &&
(\forall int x23; (0<=x23<x17) ==> (x16[x23]==x18[x23])));*/
/*@
requires (inv_vec_Int(x16,x17) &&
inv_vec_Int(x18,x19));
assigns \nothing;
ensures (inv_vec_Int(x16,x17) &&
inv_vec_Int(x18,x19));
ensures \result <==> eq_vec_Int(x16, x17, x18, x19);
*/ | int eq_vec_Int(int * x16, int x17, int * x18, int x19) {
int x21 = x17 == x19;
int x33;
if (x21) {
int x32 = 1;
/*@ loop invariant (0 <= x24 <= x17);
loop invariant \forall int x23; (0 <= x23 < x24) ==> (x16[x23]==x18[x23]);
loop assigns x24;
loop variant (x17-x24); */
for (int x24 = 0; x24 < x17; x24++) {
int x29 = x16[x24];
int x30 = x18[x24];
int x31 = x29 == x30;
if (!x31) { x32 = 0; break; }
}
x33 = x32;
} else {
x33 = 0/*false*/;
}
return x33;
} | true | 18 | 18 | int eq_vec_Int(int * x16, int x17, int * x18, int x19) {
int x21 = x17 == x19;
int x33;
if (x21) {
int x32 = 1;
/*@ loop invariant (0 <= x24 <= x17);
loop invariant \forall int x23; (0 <= x23 < x24) ==> (x16[x23]==x18[x23]);
loop assigns x24;
loop variant (x17-x24); */
for (int x24 = 0; x24 < x17; x24++) {
int x29 = x16[x24];
int x30 = x18[x24];
int x31 = x29 == x30;
if (!x31) { x32 = 0; break; }
}
x33 = x32;
} else {
x33 = 0/*false*/;
}
return x33;
} | #include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate eq_vec_Int(int * x16, int x17, int * x18, int x19) = ((x17==x19) &&
(\forall int x23; (0<=x23<x17) ==> (x16[x23]==x18[x23])));*/
/*@
requires (inv_vec_Int(x16,x17) &&
inv_vec_Int(x18,x19));
assigns \nothing;
ensures (inv_vec_Int(x16,x17) &&
inv_vec_Int(x18,x19));
ensures \result <==> eq_vec_Int(x16, x17, x18, x19);
*/ |
|
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
void lemma_star_A_not(char* s, int i, int m, int j) {
int x = m;
/*@
loop invariant 0<=i<=x<=m<j;
loop invariant !star_A(s, x, j);
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/
void lemma12(char* s, int i, int j) {
//@assert bwd1(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j);
//@assert s[j]=='B';
//@assert bwd2(s, i, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd2(s, i, j);
ensures s[j]=='\0' ==> match_aapb(s, i, j);
assigns \nothing;
*/
void lemma2f(char* s, int i, int j) {
//@assert bwd2(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j-1);
//@assert s[j-1]=='B';
//@assert s[j]=='\0' ==> match_aapb(s, i, j);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
ensures match_aapb(s, 0, strlen(s)) ==> \result==1;
ensures \result==1 ==> match_aapb(s, 0, strlen(s));
assigns \nothing;
*/
int m_aapb(char* s) {
char* cur = s;
int id = 0;
int m = 1;
//@ghost int i = 0;
/*@
loop invariant strlen(s)>=0 && \valid(s+(0..strlen(s)));
loop invariant strlen(cur)>=0 && \valid(cur+(0..strlen(cur)));
loop invariant 0<=i<=strlen(s);
loop invariant (id == 0) && m ==> bwd0(s, 0, i);
loop invariant (id == 1) && m ==> bwd1(s, 0, i);
loop invariant (id == 2) && m ==> bwd2(s, 0, i);
loop invariant (m == 0) ==> !bwd0(s, 0, i) && !bwd1(s, 0, i) && !bwd2(s, 0, i);
loop invariant (id == 0) && !m ==> s[0]!='A';
loop invariant (id == 1) && !m ==> s[i-1]!='A' && s[i-1]!='B';
loop invariant (id == 2) && !m ==> s[i-2]=='B';
loop invariant (id == 0) && !m ==> bwd0(s, 0, i-1);
loop invariant (id == 1) && !m ==> bwd1(s, 0, i-1);
loop invariant (id == 2) && !m ==> bwd2(s, 0, i-1);
loop invariant (id == 2) && cur[0]=='\0' && m ==> match_aapb(s, 0, i);
loop invariant (id != 2) || cur[0]!='\0' || !m ==> !match_aapb(s, 0, i);
loop invariant (id == 0) || (id == 1) || (id == 2);
loop invariant cur==s+i;
loop invariant cur[0]==s[i];
loop assigns cur, id, i, m;
loop variant strlen(cur);
*/
while (cur[0]!='\0' && m) {
m = 0;
if (id == 0) {
//@assert (id == 0) ==> bwd0(s, 0, i);
//@assert bwd0(s, 0, i);
//@assert i==0;
if (cur[0] == 'A') {
id = 1;
//@ghost lemma01(s, 0, i);
//@assert bwd1(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1) && !bwd1(s, 0, i+1) && !bwd2(s, 0, i+1);
}
} else if (id == 1) {
//@assert (id == 1) ==> bwd1(s, 0, i);
//@assert bwd1(s, 0, i);
if (cur[0] == 'A') {
//@ghost lemma11(s, 0, i);
id = 1;
//@assert bwd1(s, 0, i+1);
m = 1;
} else if (cur[0] == 'B') {
//@ghost lemma12(s, 0, i);
id = 2;
//@assert bwd2(s, 0, i+1);
//@ghost lemma2f(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1);
//@assert s[i]!='A';
//@ghost lemma_star_A_not(s, 1, i, i+1);
//@assert !bwd1(s, 0, i+1);
//@assert !bwd2(s, 0, i+1);
}
} else if (id == 2) {
//@assert (id == 2) ==> bwd2(s, 0, i);
//@assert bwd2(s, 0, i);
//@assert !bwd0(s, 0, i+1);
//@assert s[i-1]!='A';
//@ghost lemma_star_A_not(s, 1, i-1, i+1);
//@assert !star_A(s, 1, i+1);
//@assert !bwd1(s, 0, i+1);
//@ghost lemma_star_A_not(s, 1, i-1, i);
//@assert !star_A(s, 1, i);
//@assert !bwd2(s, 0, i+1);
} else {
//@assert \false;
}
cur++;
//@ghost i++;
}
int res = id==2 && cur[0]=='\0' && m;
/*@ghost
if (!res) {
if (!m) {
//@assert i>=1;
//@assert !match_aapb(s, 0, i);
//@assert !bwd2(s, 0, i);
int x = i;
int j = strlen(s);
if (id==0) {
//@assert s[0]!='A';
//@assert !bwd2(s, 0, j);
} else if (id==1) {
//@assert s[i-1]!='A' && s[i-1]!='B';
//@assert s[i-1]!='A';
if (i-1<j-1) {
//@ghost lemma_star_A_not(s, 1, i-1, j-1);
} else {
//@assert i==j;
}
//@assert !bwd2(s, 0, j);
} else if (id==2) {
//@assert s[i-2]=='B';
//@assert s[i-2]!='A';
//@ghost lemma_star_A_not(s, 1, i-2, j-1);
//@assert !bwd2(s, 0, j);
}
//@assert !bwd2(s, 0, strlen(s));
//@assert !match_aapb(s, 0, strlen(s));
}
}
*/
return res;
}
| #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/ | void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
} | true | 14 | 14 | void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/ |
|
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
void lemma_star_A_not(char* s, int i, int m, int j) {
int x = m;
/*@
loop invariant 0<=i<=x<=m<j;
loop invariant !star_A(s, x, j);
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/
void lemma12(char* s, int i, int j) {
//@assert bwd1(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j);
//@assert s[j]=='B';
//@assert bwd2(s, i, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd2(s, i, j);
ensures s[j]=='\0' ==> match_aapb(s, i, j);
assigns \nothing;
*/
void lemma2f(char* s, int i, int j) {
//@assert bwd2(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j-1);
//@assert s[j-1]=='B';
//@assert s[j]=='\0' ==> match_aapb(s, i, j);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
ensures match_aapb(s, 0, strlen(s)) ==> \result==1;
ensures \result==1 ==> match_aapb(s, 0, strlen(s));
assigns \nothing;
*/
int m_aapb(char* s) {
char* cur = s;
int id = 0;
int m = 1;
//@ghost int i = 0;
/*@
loop invariant strlen(s)>=0 && \valid(s+(0..strlen(s)));
loop invariant strlen(cur)>=0 && \valid(cur+(0..strlen(cur)));
loop invariant 0<=i<=strlen(s);
loop invariant (id == 0) && m ==> bwd0(s, 0, i);
loop invariant (id == 1) && m ==> bwd1(s, 0, i);
loop invariant (id == 2) && m ==> bwd2(s, 0, i);
loop invariant (m == 0) ==> !bwd0(s, 0, i) && !bwd1(s, 0, i) && !bwd2(s, 0, i);
loop invariant (id == 0) && !m ==> s[0]!='A';
loop invariant (id == 1) && !m ==> s[i-1]!='A' && s[i-1]!='B';
loop invariant (id == 2) && !m ==> s[i-2]=='B';
loop invariant (id == 0) && !m ==> bwd0(s, 0, i-1);
loop invariant (id == 1) && !m ==> bwd1(s, 0, i-1);
loop invariant (id == 2) && !m ==> bwd2(s, 0, i-1);
loop invariant (id == 2) && cur[0]=='\0' && m ==> match_aapb(s, 0, i);
loop invariant (id != 2) || cur[0]!='\0' || !m ==> !match_aapb(s, 0, i);
loop invariant (id == 0) || (id == 1) || (id == 2);
loop invariant cur==s+i;
loop invariant cur[0]==s[i];
loop assigns cur, id, i, m;
loop variant strlen(cur);
*/
while (cur[0]!='\0' && m) {
m = 0;
if (id == 0) {
//@assert (id == 0) ==> bwd0(s, 0, i);
//@assert bwd0(s, 0, i);
//@assert i==0;
if (cur[0] == 'A') {
id = 1;
//@ghost lemma01(s, 0, i);
//@assert bwd1(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1) && !bwd1(s, 0, i+1) && !bwd2(s, 0, i+1);
}
} else if (id == 1) {
//@assert (id == 1) ==> bwd1(s, 0, i);
//@assert bwd1(s, 0, i);
if (cur[0] == 'A') {
//@ghost lemma11(s, 0, i);
id = 1;
//@assert bwd1(s, 0, i+1);
m = 1;
} else if (cur[0] == 'B') {
//@ghost lemma12(s, 0, i);
id = 2;
//@assert bwd2(s, 0, i+1);
//@ghost lemma2f(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1);
//@assert s[i]!='A';
//@ghost lemma_star_A_not(s, 1, i, i+1);
//@assert !bwd1(s, 0, i+1);
//@assert !bwd2(s, 0, i+1);
}
} else if (id == 2) {
//@assert (id == 2) ==> bwd2(s, 0, i);
//@assert bwd2(s, 0, i);
//@assert !bwd0(s, 0, i+1);
//@assert s[i-1]!='A';
//@ghost lemma_star_A_not(s, 1, i-1, i+1);
//@assert !star_A(s, 1, i+1);
//@assert !bwd1(s, 0, i+1);
//@ghost lemma_star_A_not(s, 1, i-1, i);
//@assert !star_A(s, 1, i);
//@assert !bwd2(s, 0, i+1);
} else {
//@assert \false;
}
cur++;
//@ghost i++;
}
int res = id==2 && cur[0]=='\0' && m;
/*@ghost
if (!res) {
if (!m) {
//@assert i>=1;
//@assert !match_aapb(s, 0, i);
//@assert !bwd2(s, 0, i);
int x = i;
int j = strlen(s);
if (id==0) {
//@assert s[0]!='A';
//@assert !bwd2(s, 0, j);
} else if (id==1) {
//@assert s[i-1]!='A' && s[i-1]!='B';
//@assert s[i-1]!='A';
if (i-1<j-1) {
//@ghost lemma_star_A_not(s, 1, i-1, j-1);
} else {
//@assert i==j;
}
//@assert !bwd2(s, 0, j);
} else if (id==2) {
//@assert s[i-2]=='B';
//@assert s[i-2]!='A';
//@ghost lemma_star_A_not(s, 1, i-2, j-1);
//@assert !bwd2(s, 0, j);
}
//@assert !bwd2(s, 0, strlen(s));
//@assert !match_aapb(s, 0, strlen(s));
}
}
*/
return res;
}
| #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/ | void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
} | true | 28 | 28 | void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/ |
|
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
void lemma_star_A_not(char* s, int i, int m, int j) {
int x = m;
/*@
loop invariant 0<=i<=x<=m<j;
loop invariant !star_A(s, x, j);
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/
void lemma12(char* s, int i, int j) {
//@assert bwd1(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j);
//@assert s[j]=='B';
//@assert bwd2(s, i, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd2(s, i, j);
ensures s[j]=='\0' ==> match_aapb(s, i, j);
assigns \nothing;
*/
void lemma2f(char* s, int i, int j) {
//@assert bwd2(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j-1);
//@assert s[j-1]=='B';
//@assert s[j]=='\0' ==> match_aapb(s, i, j);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
ensures match_aapb(s, 0, strlen(s)) ==> \result==1;
ensures \result==1 ==> match_aapb(s, 0, strlen(s));
assigns \nothing;
*/
int m_aapb(char* s) {
char* cur = s;
int id = 0;
int m = 1;
//@ghost int i = 0;
/*@
loop invariant strlen(s)>=0 && \valid(s+(0..strlen(s)));
loop invariant strlen(cur)>=0 && \valid(cur+(0..strlen(cur)));
loop invariant 0<=i<=strlen(s);
loop invariant (id == 0) && m ==> bwd0(s, 0, i);
loop invariant (id == 1) && m ==> bwd1(s, 0, i);
loop invariant (id == 2) && m ==> bwd2(s, 0, i);
loop invariant (m == 0) ==> !bwd0(s, 0, i) && !bwd1(s, 0, i) && !bwd2(s, 0, i);
loop invariant (id == 0) && !m ==> s[0]!='A';
loop invariant (id == 1) && !m ==> s[i-1]!='A' && s[i-1]!='B';
loop invariant (id == 2) && !m ==> s[i-2]=='B';
loop invariant (id == 0) && !m ==> bwd0(s, 0, i-1);
loop invariant (id == 1) && !m ==> bwd1(s, 0, i-1);
loop invariant (id == 2) && !m ==> bwd2(s, 0, i-1);
loop invariant (id == 2) && cur[0]=='\0' && m ==> match_aapb(s, 0, i);
loop invariant (id != 2) || cur[0]!='\0' || !m ==> !match_aapb(s, 0, i);
loop invariant (id == 0) || (id == 1) || (id == 2);
loop invariant cur==s+i;
loop invariant cur[0]==s[i];
loop assigns cur, id, i, m;
loop variant strlen(cur);
*/
while (cur[0]!='\0' && m) {
m = 0;
if (id == 0) {
//@assert (id == 0) ==> bwd0(s, 0, i);
//@assert bwd0(s, 0, i);
//@assert i==0;
if (cur[0] == 'A') {
id = 1;
//@ghost lemma01(s, 0, i);
//@assert bwd1(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1) && !bwd1(s, 0, i+1) && !bwd2(s, 0, i+1);
}
} else if (id == 1) {
//@assert (id == 1) ==> bwd1(s, 0, i);
//@assert bwd1(s, 0, i);
if (cur[0] == 'A') {
//@ghost lemma11(s, 0, i);
id = 1;
//@assert bwd1(s, 0, i+1);
m = 1;
} else if (cur[0] == 'B') {
//@ghost lemma12(s, 0, i);
id = 2;
//@assert bwd2(s, 0, i+1);
//@ghost lemma2f(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1);
//@assert s[i]!='A';
//@ghost lemma_star_A_not(s, 1, i, i+1);
//@assert !bwd1(s, 0, i+1);
//@assert !bwd2(s, 0, i+1);
}
} else if (id == 2) {
//@assert (id == 2) ==> bwd2(s, 0, i);
//@assert bwd2(s, 0, i);
//@assert !bwd0(s, 0, i+1);
//@assert s[i-1]!='A';
//@ghost lemma_star_A_not(s, 1, i-1, i+1);
//@assert !star_A(s, 1, i+1);
//@assert !bwd1(s, 0, i+1);
//@ghost lemma_star_A_not(s, 1, i-1, i);
//@assert !star_A(s, 1, i);
//@assert !bwd2(s, 0, i+1);
} else {
//@assert \false;
}
cur++;
//@ghost i++;
}
int res = id==2 && cur[0]=='\0' && m;
/*@ghost
if (!res) {
if (!m) {
//@assert i>=1;
//@assert !match_aapb(s, 0, i);
//@assert !bwd2(s, 0, i);
int x = i;
int j = strlen(s);
if (id==0) {
//@assert s[0]!='A';
//@assert !bwd2(s, 0, j);
} else if (id==1) {
//@assert s[i-1]!='A' && s[i-1]!='B';
//@assert s[i-1]!='A';
if (i-1<j-1) {
//@ghost lemma_star_A_not(s, 1, i-1, j-1);
} else {
//@assert i==j;
}
//@assert !bwd2(s, 0, j);
} else if (id==2) {
//@assert s[i-2]=='B';
//@assert s[i-2]!='A';
//@ghost lemma_star_A_not(s, 1, i-2, j-1);
//@assert !bwd2(s, 0, j);
}
//@assert !bwd2(s, 0, strlen(s));
//@assert !match_aapb(s, 0, strlen(s));
}
}
*/
return res;
}
| #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/ | void lemma_star_A_not(char* s, int i, int m, int j) {
int x = m;
/*@
loop invariant 0<=i<=x<=m<j;
loop invariant !star_A(s, x, j);
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
} | true | 40 | 40 | void lemma_star_A_not(char* s, int i, int m, int j) {
int x = m;
/*@
loop invariant 0<=i<=x<=m<j;
loop invariant !star_A(s, x, j);
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/ |
|
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
void lemma_star_A_not(char* s, int i, int m, int j) {
int x = m;
/*@
loop invariant 0<=i<=x<=m<j;
loop invariant !star_A(s, x, j);
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/
void lemma12(char* s, int i, int j) {
//@assert bwd1(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j);
//@assert s[j]=='B';
//@assert bwd2(s, i, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd2(s, i, j);
ensures s[j]=='\0' ==> match_aapb(s, i, j);
assigns \nothing;
*/
void lemma2f(char* s, int i, int j) {
//@assert bwd2(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j-1);
//@assert s[j-1]=='B';
//@assert s[j]=='\0' ==> match_aapb(s, i, j);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
ensures match_aapb(s, 0, strlen(s)) ==> \result==1;
ensures \result==1 ==> match_aapb(s, 0, strlen(s));
assigns \nothing;
*/
int m_aapb(char* s) {
char* cur = s;
int id = 0;
int m = 1;
//@ghost int i = 0;
/*@
loop invariant strlen(s)>=0 && \valid(s+(0..strlen(s)));
loop invariant strlen(cur)>=0 && \valid(cur+(0..strlen(cur)));
loop invariant 0<=i<=strlen(s);
loop invariant (id == 0) && m ==> bwd0(s, 0, i);
loop invariant (id == 1) && m ==> bwd1(s, 0, i);
loop invariant (id == 2) && m ==> bwd2(s, 0, i);
loop invariant (m == 0) ==> !bwd0(s, 0, i) && !bwd1(s, 0, i) && !bwd2(s, 0, i);
loop invariant (id == 0) && !m ==> s[0]!='A';
loop invariant (id == 1) && !m ==> s[i-1]!='A' && s[i-1]!='B';
loop invariant (id == 2) && !m ==> s[i-2]=='B';
loop invariant (id == 0) && !m ==> bwd0(s, 0, i-1);
loop invariant (id == 1) && !m ==> bwd1(s, 0, i-1);
loop invariant (id == 2) && !m ==> bwd2(s, 0, i-1);
loop invariant (id == 2) && cur[0]=='\0' && m ==> match_aapb(s, 0, i);
loop invariant (id != 2) || cur[0]!='\0' || !m ==> !match_aapb(s, 0, i);
loop invariant (id == 0) || (id == 1) || (id == 2);
loop invariant cur==s+i;
loop invariant cur[0]==s[i];
loop assigns cur, id, i, m;
loop variant strlen(cur);
*/
while (cur[0]!='\0' && m) {
m = 0;
if (id == 0) {
//@assert (id == 0) ==> bwd0(s, 0, i);
//@assert bwd0(s, 0, i);
//@assert i==0;
if (cur[0] == 'A') {
id = 1;
//@ghost lemma01(s, 0, i);
//@assert bwd1(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1) && !bwd1(s, 0, i+1) && !bwd2(s, 0, i+1);
}
} else if (id == 1) {
//@assert (id == 1) ==> bwd1(s, 0, i);
//@assert bwd1(s, 0, i);
if (cur[0] == 'A') {
//@ghost lemma11(s, 0, i);
id = 1;
//@assert bwd1(s, 0, i+1);
m = 1;
} else if (cur[0] == 'B') {
//@ghost lemma12(s, 0, i);
id = 2;
//@assert bwd2(s, 0, i+1);
//@ghost lemma2f(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1);
//@assert s[i]!='A';
//@ghost lemma_star_A_not(s, 1, i, i+1);
//@assert !bwd1(s, 0, i+1);
//@assert !bwd2(s, 0, i+1);
}
} else if (id == 2) {
//@assert (id == 2) ==> bwd2(s, 0, i);
//@assert bwd2(s, 0, i);
//@assert !bwd0(s, 0, i+1);
//@assert s[i-1]!='A';
//@ghost lemma_star_A_not(s, 1, i-1, i+1);
//@assert !star_A(s, 1, i+1);
//@assert !bwd1(s, 0, i+1);
//@ghost lemma_star_A_not(s, 1, i-1, i);
//@assert !star_A(s, 1, i);
//@assert !bwd2(s, 0, i+1);
} else {
//@assert \false;
}
cur++;
//@ghost i++;
}
int res = id==2 && cur[0]=='\0' && m;
/*@ghost
if (!res) {
if (!m) {
//@assert i>=1;
//@assert !match_aapb(s, 0, i);
//@assert !bwd2(s, 0, i);
int x = i;
int j = strlen(s);
if (id==0) {
//@assert s[0]!='A';
//@assert !bwd2(s, 0, j);
} else if (id==1) {
//@assert s[i-1]!='A' && s[i-1]!='B';
//@assert s[i-1]!='A';
if (i-1<j-1) {
//@ghost lemma_star_A_not(s, 1, i-1, j-1);
} else {
//@assert i==j;
}
//@assert !bwd2(s, 0, j);
} else if (id==2) {
//@assert s[i-2]=='B';
//@assert s[i-2]!='A';
//@ghost lemma_star_A_not(s, 1, i-2, j-1);
//@assert !bwd2(s, 0, j);
}
//@assert !bwd2(s, 0, strlen(s));
//@assert !match_aapb(s, 0, strlen(s));
}
}
*/
return res;
}
| #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
void lemma_star_A_not(char* s, int i, int m, int j) {
int x = m;
/*@
loop invariant 0<=i<=x<=m<j;
loop invariant !star_A(s, x, j);
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/ | void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
} | true | 90 | 90 | void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
void lemma_star_A_not(char* s, int i, int m, int j) {
int x = m;
/*@
loop invariant 0<=i<=x<=m<j;
loop invariant !star_A(s, x, j);
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/ |
|
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
void lemma_star_A_not(char* s, int i, int m, int j) {
int x = m;
/*@
loop invariant 0<=i<=x<=m<j;
loop invariant !star_A(s, x, j);
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/
void lemma12(char* s, int i, int j) {
//@assert bwd1(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j);
//@assert s[j]=='B';
//@assert bwd2(s, i, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd2(s, i, j);
ensures s[j]=='\0' ==> match_aapb(s, i, j);
assigns \nothing;
*/
void lemma2f(char* s, int i, int j) {
//@assert bwd2(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j-1);
//@assert s[j-1]=='B';
//@assert s[j]=='\0' ==> match_aapb(s, i, j);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
ensures match_aapb(s, 0, strlen(s)) ==> \result==1;
ensures \result==1 ==> match_aapb(s, 0, strlen(s));
assigns \nothing;
*/
int m_aapb(char* s) {
char* cur = s;
int id = 0;
int m = 1;
//@ghost int i = 0;
/*@
loop invariant strlen(s)>=0 && \valid(s+(0..strlen(s)));
loop invariant strlen(cur)>=0 && \valid(cur+(0..strlen(cur)));
loop invariant 0<=i<=strlen(s);
loop invariant (id == 0) && m ==> bwd0(s, 0, i);
loop invariant (id == 1) && m ==> bwd1(s, 0, i);
loop invariant (id == 2) && m ==> bwd2(s, 0, i);
loop invariant (m == 0) ==> !bwd0(s, 0, i) && !bwd1(s, 0, i) && !bwd2(s, 0, i);
loop invariant (id == 0) && !m ==> s[0]!='A';
loop invariant (id == 1) && !m ==> s[i-1]!='A' && s[i-1]!='B';
loop invariant (id == 2) && !m ==> s[i-2]=='B';
loop invariant (id == 0) && !m ==> bwd0(s, 0, i-1);
loop invariant (id == 1) && !m ==> bwd1(s, 0, i-1);
loop invariant (id == 2) && !m ==> bwd2(s, 0, i-1);
loop invariant (id == 2) && cur[0]=='\0' && m ==> match_aapb(s, 0, i);
loop invariant (id != 2) || cur[0]!='\0' || !m ==> !match_aapb(s, 0, i);
loop invariant (id == 0) || (id == 1) || (id == 2);
loop invariant cur==s+i;
loop invariant cur[0]==s[i];
loop assigns cur, id, i, m;
loop variant strlen(cur);
*/
while (cur[0]!='\0' && m) {
m = 0;
if (id == 0) {
//@assert (id == 0) ==> bwd0(s, 0, i);
//@assert bwd0(s, 0, i);
//@assert i==0;
if (cur[0] == 'A') {
id = 1;
//@ghost lemma01(s, 0, i);
//@assert bwd1(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1) && !bwd1(s, 0, i+1) && !bwd2(s, 0, i+1);
}
} else if (id == 1) {
//@assert (id == 1) ==> bwd1(s, 0, i);
//@assert bwd1(s, 0, i);
if (cur[0] == 'A') {
//@ghost lemma11(s, 0, i);
id = 1;
//@assert bwd1(s, 0, i+1);
m = 1;
} else if (cur[0] == 'B') {
//@ghost lemma12(s, 0, i);
id = 2;
//@assert bwd2(s, 0, i+1);
//@ghost lemma2f(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1);
//@assert s[i]!='A';
//@ghost lemma_star_A_not(s, 1, i, i+1);
//@assert !bwd1(s, 0, i+1);
//@assert !bwd2(s, 0, i+1);
}
} else if (id == 2) {
//@assert (id == 2) ==> bwd2(s, 0, i);
//@assert bwd2(s, 0, i);
//@assert !bwd0(s, 0, i+1);
//@assert s[i-1]!='A';
//@ghost lemma_star_A_not(s, 1, i-1, i+1);
//@assert !star_A(s, 1, i+1);
//@assert !bwd1(s, 0, i+1);
//@ghost lemma_star_A_not(s, 1, i-1, i);
//@assert !star_A(s, 1, i);
//@assert !bwd2(s, 0, i+1);
} else {
//@assert \false;
}
cur++;
//@ghost i++;
}
int res = id==2 && cur[0]=='\0' && m;
/*@ghost
if (!res) {
if (!m) {
//@assert i>=1;
//@assert !match_aapb(s, 0, i);
//@assert !bwd2(s, 0, i);
int x = i;
int j = strlen(s);
if (id==0) {
//@assert s[0]!='A';
//@assert !bwd2(s, 0, j);
} else if (id==1) {
//@assert s[i-1]!='A' && s[i-1]!='B';
//@assert s[i-1]!='A';
if (i-1<j-1) {
//@ghost lemma_star_A_not(s, 1, i-1, j-1);
} else {
//@assert i==j;
}
//@assert !bwd2(s, 0, j);
} else if (id==2) {
//@assert s[i-2]=='B';
//@assert s[i-2]!='A';
//@ghost lemma_star_A_not(s, 1, i-2, j-1);
//@assert !bwd2(s, 0, j);
}
//@assert !bwd2(s, 0, strlen(s));
//@assert !match_aapb(s, 0, strlen(s));
}
}
*/
return res;
}
| #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
void lemma_star_A_not(char* s, int i, int m, int j) {
int x = m;
/*@
loop invariant 0<=i<=x<=m<j;
loop invariant !star_A(s, x, j);
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/ | void lemma12(char* s, int i, int j) {
//@assert bwd1(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j);
//@assert s[j]=='B';
//@assert bwd2(s, i, j+1);
} | true | 115 | 115 | void lemma12(char* s, int i, int j) {
//@assert bwd1(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j);
//@assert s[j]=='B';
//@assert bwd2(s, i, j+1);
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
void lemma_star_A_not(char* s, int i, int m, int j) {
int x = m;
/*@
loop invariant 0<=i<=x<=m<j;
loop invariant !star_A(s, x, j);
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/ |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5