file_content stringlengths 65 76k | goals int64 1 283 |
|---|---|
/*@ 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;
}
| 7 |
/*@ 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 \vali... | 18 |
/*@ requires n>0 && \valid(s+(0..n-1)) && \valid(t+(0..n-1));
assigns s[0..n-1];
ensures \forall integer i; 0<=i<n ==> s[i]==t[i];
*/
void copy1(int s[], int t[], int n) {
/*@ loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> s[j]==t[j];
loop variant n-i;
*/
for(int i=0;i<n;... | 18 |
#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+... | 21 |
/*@
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... | 23 |
/*@
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++)
... | 24 |
#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)));
ens... | 37 |
#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... | 30 |
#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... | 17 |
/*@
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 invar... | 23 |
#include <limits.h>
/*@
assigns \nothing;
ensures (\result==(x0*x0));
*/
int square(int x0) {
int x2 = x0 * x0;
return x2;
}
/*@
assigns \nothing;
ensures (\result==(((x6*x6)*x6)*x6));
*/
int pow4(int x6) {
int x8 = square(x6);
int x9 = square(x8);
return x9;
}
/*@
assigns \nothing;
ensures (\result==(((x15... | 23 |
/*@ 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... | 114 |
#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 = ... | 4 |
/*@ 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... | 23 |
/* 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 :
... | 14 |
/*@
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 ... | 17 |
/*@
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;
} | 4 |
/* run.config
OPT: -obfuscate
*/
int my_var = 0;
/*@ global invariant I: my_var >= 0; */
enum my_enum {
first, second, third = 4
};
/*@ requires my_var > 0;
ensures my_var > \old(my_var);
ensures \forall integer x; x == x; */
int my_func () {
enum my_enum x = first;
/*@ assert my_var >= first; */
... | 4 |
/*@
requires n > 0;
requires \valid_read (a + (0..n-1));
requires \valid_read (b + (0..n-1));
assigns \nothing;
behavior equal:
assumes \forall integer k; 0 <= k < n ==> b[k] == a[k];
ensures \result == 1;
behavior not_equal:
assumes \exists integer k; 0 <= k < n && ... | 4 |
#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;
... | 13 |
/*@
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);
}
| 10 |
/* run.config
OPT: -wp-no-print -wp-rte
*/
/* run.config_qualif
OPT: -then -wp-rte -wp
*/
/* ************/
/* Solution de TP donné par Julien à L'IFIPS */
/* ************/
#define BOUND 100
/* La fonction [pair(a, len)] prend en entrée un tableau [a] de longueur
[len] ne contenant que des valeurs entre 0 e... | 37 |
#define INT_MIN (-2147483648)
/*@ requires v != INT_MIN;
assigns \nothing;
ensures \result == \abs(v);
*/
int abs(int v)
{
return v >= 0 ? v : -v;
}
| 6 |
#include <stdlib.h>
#include <ctype.h>
#include <stdio.h>
#include <stdbool.h>
#define boxArea(box) (box >= 1 && box <= 9 ? TRUE : FALSE)
#define validCoord(x, y) ((x < 0 || x > N-1 || y < 0 || y > N-1) ? FALSE : TRUE)
#define emptyBox(box) (box == ' ' ? TRUE : FALSE)
#define OTHER(player) (player == playerX ? playerO... | 6 |
/*@
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==... | 9 |
typedef struct _vc {
int n;
char* a;
} vc;
typedef struct _vvc {
int n;
struct _vc* a;
} vvc;
/*@
// Invariant and equality spec for Vector[Char]
predicate spec_Inv_VC(vc v) =
v.n==0 || (v.n>0 && \valid(v.a+(0..v.n-1)));
predicate spec_Eq_VC(vc v1, vc v2) =
(v1.n==v2.n) &&
(\fora... | 44 |
#include<assert.h>
/*@
@ ensures \result == 1;
@
*/
int gimmeOne() {
return 1;
}
int main() {
int x = gimmeOne();
assert(x == 1);
}
| 6 |
#include <string.h>
/*@
requires strlen(input)>=0 && \valid(input+(0..strlen(input)));
assigns \nothing;
ensures \result==0 || \result==1;
*/
int dfa_aabany(char* input) {
if (*input == '\0') return 0/*false*/;
int id = 0;
char c;
/*@
loop invariant strlen(input)>0 && \valid(input+(0..strlen(input)));
loop ... | 58 |
#define value_type unsigned int
/////////////// Base definition
/*@
@ logic integer occurence{L}( value_type* a, integer l, integer h, value_type e ) =
@ l >= h ? 0 : ( a[l] == e ? 1 : 0 ) + occurence( a, l+1, h, e );
@
*/
/////// Axioms with functions as proof
// range
/*@ requires l <= h;
@... | 58 |
#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;
ensur... | 17 |
/*@ 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 b... | 13 |
#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(x... | 26 |
/*@ 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++;
t... | 26 |
/*@ ensures \result >= a && \result >= b ;
ensures \result == a || \result == b ; */
int max(int a, int b);
extern int v ;
int main(){
v = 3;
int r = max(4,2);
//@ assert v == 3 ;
}
| 3 |
// 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 à gauc... | 33 |
// __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;
}
| 10 |
/* ****************************************************************************
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 :
... | 34 |
#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_... | 66 |
#include <stdbool.h>
/*@ predicate is_equal(int *a, int n, int *b) =
\forall integer i; 0 <= i < n ==> a[i] == b[i];
*/
/*@ requires n >= 0;
requires \valid(a + (0 .. n-1));
requires \valid(b + (0 .. n-1));
assigns \nothing;
ensures is_equal(a, n, b) ? \result : !\result;
*/
bool equal(int *... | 66 |
/*@
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 ;
}
| 7 |
/*@ 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... | 20 |
#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]... | 12 |
/*@ 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 ... | 31 |
int m = 0;
int t[10];
int *q = &m;
/*@ requires *p <= 100 && *p >= -100 && \valid(p);
ensures \result == \old(*p)+ 1 ; */
int incr(int *p)
{
q = p;
*p = *p + 1;
return *p;
};
| 7 |
#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(x... | 26 |
#define INT_MAX 2147483647
/*@ requires (a * 2) <= INT_MAX;
assigns \nothing;
ensures \result == a * 2;
*/
unsigned lshift(unsigned a)
{
return a << 1;
}
| 4 |
struct S {
int t1[2];
int t2[2];
};
struct T {
struct S *t[2];
};
/*@ requires \valid(s) && \valid(s->t[0]);
@*/
void f(struct T *s) {
s->t[0]->t1[0] = 1;
}
int main(struct T s, struct S a) {
s.t[0] = &a;
f(&s);
return 0;
}
/* on veut :
zones globales :
Zone 0: {s.t[0]; };
Zone 1: {a.t1[0]; };
... | 7 |
/*@ requires n>0 && \valid(t+(0..n-1));
ensures \forall integer i; 0<=i<n ==> t[i] == val;
*/
void fill(int t[],int val,int n) {
/*@ loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> t[j] == val;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
t[i]=val;
}
} | 21 |
/*@
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);
}
| 11 |
/*@
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;
}
| 14 |
// adding the assertions help prove preservation of the loop invariant. assert itself only proved by z3.
/*@ axiomatic Predicate_remove_copy {
logic integer predicate_remove_copy{La,Lb}(int* a, int* b, integer i_a, integer i_b, int value);
axiom predicate_remove_copy_empty{La,Lb}:
\fo... | 14 |
#include <limits.h>
#include <string.h>
char * p_HTTP(char * x1096);
char * p_(char * x1098);
char * p_ContentLength(char * x1100);
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
assigns \nothing;
*/
int p(char * x0) {
int x2 = -1;
char *x3 = p_HTTP(x0);
int x5 = 1/*true*/;
int x6 = 0;
... | 14 |
/*@ 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) ... | 34 |
#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;
ensur... | 57 |
/*@
// 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 Ve... | 46 |
#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,x1... | 44 |
#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* ... | 283 |
#include <limits.h>
#include <string.h>
char * p_chunked(char * x1637);
char * p_(char * x1639);
char * p_TransferEncoding(char * x1641);
char * p_ContentLength(char * x1643);
char * p_HTTP(char * x1645);
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..(strlen(x0)+1)-1)));
assigns \nothing;
*/
int p(char * x0... | 283 |
/*@
requires \valid(m+(0..3));
requires \valid(v+(0..1));
requires \valid(o+(0..1));
requires \forall int i; \forall int j;
0 <= i < 4 && 0 <= j < 2 ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < 2 && 0 <= j < 2 ==> \separated(v+i,o+j);
assigns o[0..1];
ensures o[0] == (m[0] && v[0]) || ... | 112 |
/*@ ensures \result<=a && \result<=b && (\result==a || \result==b);
*/
int min(int a, int b) {
return (a<b)?a:b;
} | 3 |
/*@
ensures \result==a || \result==b;
*/
int max(int a,int b)
{
if(a==b) return a;
return a>b?a:b;
}
| 3 |
/*@ requires b != 0;
requires b != -1;
assigns \nothing;
ensures \result == a;
*/
int divmult(int a, int b)
{
return (a / b) * b + (a % b);
}
| 12 |
/*@ predicate sorted{L}(int* a, int length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ requires \valid(a+(0..length-1));
requires sorted(a,length);
requires length >=0;
assigns \nothing;
behavior exists:
assumes \exists integer i; 0<=i<length && a[i] == key;
ensures ... | 29 |
struct Point
{
int x;
int y;
int z;
};
typedef struct Point Point;
/*@
requires \valid(p);
assigns p->x;
assigns p->y;
assigns p->z;
ensures p->x == 0;
ensures p->y == 0;
ensures p->z == 0;
*/
void init(Point* p)
{
p->x = 0;
p->y = 0;
p->z = 0;
}
/*@
... | 22 |
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer n) =
n==0 || (n>0 && (s[i+n-1]=='A' && star_A(s, i, n-1)));
predicate match_aapb(char* s) =
strlen(s)>=2 && s[0]=='A' && star_A(s,1,strlen(s)-2) && s[strlen(s)-1]=='B';
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires 0 <= i;
r... | 77 |
#include <limits.h>
#include <string.h>
/*@ predicate match_w(char * x0) = ((x0[0]=='a') &&
(x0[1]=='a'));*/
/*@
assigns \nothing;
ensures \result <==> match_w(x0);
*/
int match_w(char * x0) {
char x2 = x0[0];
int x3 = x2 == 'a';
int x7;
if (x3) {
char x4 = x0[1];
int x5 = x4 == 'a';
int x6;
i... | 77 |
/* This example contains errors:
* For "add" function, x is suppose to be a valid pointer.
*
* For "incr" function, y should be freed before return.
*/
#include <stdlib.h>
/*@
@ requires val >= 0;
@ ensures \result == val + 1;
@
*/
int add(int * x, int val)
{
*x = val + 1;
return *x;
}
/*@ requires *... | 77 |
/*@
requires n>0;
requires \valid(a + (0..n-1));
ensures \forall integer i;
0<= i<n ==>a[n-1]>= a[i];
*/
void selectioninnerloop(int a[], int n)
{
int max_idx = 0;
/*@
loop invariant \forall integer i;0<=i<j ==>a[max_idx]>= a[i];
loop invariant 0<=j<=n;
loop assigns m... | 77 |
/*@ requires \valid(arr + (0..size-1));
requires \forall integer i; 0 <= i < size ==> 0 <= arr[i] < size;
requires 0 <= addr < size;
assigns arr[0..size-1];
ensures arr[\at(arr[addr],Pre)] == 0;
*/
void indaddr(unsigned size, int arr[size], unsigned addr)
{
arr[arr[addr]] = 0;
}
| 6 |
/*@ requires n >= 0 && 0 <= n1 < n && 0 <= n2 < n;
requires \valid(a+(0..n-1));
ensures (a[n1] == \old(a[n2]) && a[n2] == \old(a[n1]));
*/
void array_swap(int n, int a[], int n1, int n2)
{
int tmp;
tmp = a[n1]; a[n1] = a[n2]; a[n2] = tmp;
}
| 7 |
#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_... | 52 |
/*@ requires n>0 && \valid(p+(0..n-1));
ensures \result==-1 ==> !(\exists int i; 0<=i<n && p[i]==v);
ensures \result!=-1 ==> 0 <= \result < n && p[\result]==v;
assigns \nothing;
*/
int member(int* p, int n, int v) {
/*@
loop invariant (0 <= i <= n);
loop invariant !(\exists int j; 0 <= j < i && p[... | 32 |
/*@
behavior first_case:
behavior first1_case:
assumes num1>num2;
assumes num1>num3;
ensures \result == num1;
behavior first2_case:
assumes num1>num2;
assumes num1<=num3;
ensures \result == num3;
behavior second_case:
behavior second1_case:
assumes num1<=num2;
assumes num2>num3;
... | 6 |
/* run.config_ci
COMMENT: test option -e-acsl-instrument; cannot run Eva on this example
LOG: gen_@PTEST_NAME@.c
STDOPT:#"-e-acsl-instrument='@@all,-uninstrument1,-uninstrument2'"
*/
#include <stdarg.h>
int uninstrument1(int *p) {
*p = 0;
return 0;
}
/*@ requires \valid(p); */
int uninstrument2(int *p) ... | 6 |
/*@ ensures (\result >= x && \result >=y) ; */
int maxint (int x, int y) {
return (x > y) ? x : y;
}
| 3 |
#include <string.h>
/*@
predicate match_aab(char* s) =
s[0]=='a' && s[1]=='a' && s[2]=='b';
predicate match_anyaab(char* s) =
\exists int i; 0 <= i < strlen(s) && match_aab(s+i);
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)*2+3 <= INT_MAX;
assigns \nothing;
ensures \result==0 || \re... | 36 |
/*@ ensures \result >= a && \result >= b;
ensures \result == a || \result == b ;
*/
int max ( int a, int b ) {
if ( a >= b )
return a ;
return b ;
}
| 4 |
#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_... | 54 |
#include <limits.h>
#include <string.h>
/*@ logic integer cypher(int x0) = (((x0==26)) ? (0) : ((x0+1)));*/
/*@
requires ((0<=x0) &&
(x0<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == cypher(x0);
*/
int cypher(int x0) {
int x2 = x0 == 26;
int x4;
if (x2) {
x4 = 0;
} e... | 77 |
//check if every element is equal to index
/*@
requires n>0;
requires \valid_read(arr+(0..n-1));
behavior one:
assumes \forall integer j;
0<=j<n ==> arr[j]==j;
ensures \result == 1;
behavior two:
assumes \exists integer j;
0<=j<n && arr[j]!=j;
ensures \res... | 15 |
/*@ terminates \true;
@ assigns \nothing;
@ ensures \false;
@ exits \exit_status == status;
@*/
void exit(int status);
int status;
/*@ terminates \true;
@ assigns status;
@ exits !cond && \exit_status == 1 && status == val;
@ ensures cond && status == \old(status);
@*/
void may_exit(int cond, int... | 5 |
/*@ axiomatic Factorial {
logic integer factorial(integer i);
axiom nil:
factorial(0) == 1;
axiom step:
\forall integer i; i >= 0 ==>
factorial(i) == factorial(i - 1) * i;
lemma non_negative:
\forall integer i; i >= 0 ==>
factorial(i) > 0;
}
*/
#define SPE... | 11 |
/*@ assigns \nothing;
ensures \result == 0 || \result == 1 || \result == -1;
behavior positive:
assumes x > 0;
ensures \result == 1;
behavior zero:
assumes x == 0;
ensures \result == 0;
behavior negative:
assumes x < 0;
ensures \result == -1;
complete behav... | 11 |
/*@requires\valid(a) &&\valid(b);
ensures *a ==\old(*b) && *b ==\old(*a);*/
int swap(int *a, int *b)
{
int temp = *a;
*a = *b;
*b = temp;
return 0;
} | 7 |
#include<stdbool.h>
#define round(X) (double) (X)
/*@
axiomatic fp_funs {
logic double Dadd(double X, double Y) = round(X+Y);
logic double Dsub(double X, double Y) = round(X-Y);
logic double Dmul(double X, double Y) = round(X*Y);
logic double Dneg(double X) = round(0-X);
logic double Dabs(double X) = ... | 36 |
/**
*
* Frama-C Version: Frama-C Silicon-20161101
* Alt-Ergo Version: 1.30
*
* Run the following:
* frama-c -wp -wp-rte -wp-prover alt-ergo -wp-timeout 10 countSameConsecutiveFinal.c -then -report
*
**/
/*@ predicate all_equal_in_range{L}(int *x, integer minidx, integer maxidx) =
@ \forall integer k; mi... | 35 |
/*@
ensures \result>=a && \result>=b && \result>=c;
ensures \result==a || \result==b || \result==c;
ensures a>=b && a>=c ==> \result==a;
ensures b>=a && b>=c ==> \result==b;
ensures c>=a && c>=b ==> \result==c;
*/
int max3(int a,int b,int c) {
int max;
if((a >= b) && (a >= c)) {
... | 7 |
#include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int pick_index(int x0) {
return 0;
}
/*@
requires ((x10>0) &&
\valid(x9+(0..x10-1)));
assigns \nothing;
*/
int pick_element(int * x9, int x10) {
int x12 = pick_index(x10);
int x13 = x9[x12];
return x13;
}
/*... | 16 |
#include <stdio.h>
#include <stdlib.h>
int n, at, x;
int t[1000];
//@ predicate ord{L}(int direc_var) = \forall integer i; 0 <= i <= n-2 ==> (direc_var ? t[i] < t[i+1] : t[i] > t[i+1]);
//@ predicate noin{L} = \forall integer i; 0 <= i < n ==> t[i] != x;
/*@
axiomatic zalozenia_zadania {
axiom n_in_range{L}: 2... | 61 |
/*@
logic boolean row_col_bool(integer c, int r, int n, int* m, int* v) =
(0 < c <= n) ? ((row_col_bool(c-1, r, n, m, v)) || (m[n*r+(c-1)] && v[(c-1)])) : 0;
*/
/*@
requires n>0;
requires n<3;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \separated(m+(0..n*n-1),... | 95 |
/*@
requires \valid(q) && \valid(r);
requires \separated(q, r);
requires y != 0;
assigns *q, *r;
ensures x == *q * y + *r;
ensures *r < y;
*/
void div_rem(unsigned x, unsigned y, unsigned* q, unsigned* r) {
*q = x / y;
*r = x % y;
} | 10 |
/*@
requires n>0;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<n-1 ==>a[n-1]>=a[i];
*/
void q1(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])
{... | 24 |
/*@ logic integer max(integer a, integer b) =
a > b ? a : b;
*/
/*@ assigns \nothing;
ensures \result >= a;
ensures \result >= b;
ensures \result == a || \result == b;
ensures \result == max(a, b);
*/
int max(int a, int b)
{
return a > b ? a : b;
}
| 8 |
#include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int pick_index(int x0) {
return 0;
}
/*@
requires ((x7>0) &&
\valid(x6+(0..x7-1)));
assigns \nothing;
*/
int pick_element(int * x6, int x7) {
int x9 = pick_index(x7);
int x10 = x6[x9];
return x10;
}
/*@
requ... | 16 |
/* Tested with:
* * Frama-C Aluminium
* * Alt-Ergo 1.01
* * Why3 platform, version 0.87.3
* */
#include <stdbool.h>
#define MAXV 1000000
/*@ requires 1 <= N <= 1000000;
@ requires \valid(a + (0..N-1));
@ requires \forall integer j; 0 <= j < 1000000 ==> 1 <= a[j] <= N;
@ ensures
@ \forall integer i... | 34 |
/*@
requires \valid_read(a) && \valid_read(b);
requires \separated(a, b);
assigns \nothing;
ensures \result >= *a && \result >= *b;
ensures \result == *a && \result == *b;
*/
int max_ptr(int *a, int *b){
return (*a < *b) ? *b : *a ;
}
extern int h;
int main() {
h = 42;
int a = 24;
... | 34 |
struct list {
int hd;
struct list *next;
};
/*@ inductive reachable{L}(struct list *root, struct list *to) {
@ case empty: \forall struct list *l; reachable(l,l);
@ case non_empty: \forall struct list *l1, *l2; \valid(l1) && reachable(l1->next, l2) ==> reachable(l1, l2);
@ }
*/
/*@ requires r... | 34 |
struct counter
{int seconds,minutes,hours;};
struct counter c;
/*@
requires 0<=c.seconds<60 && 0<=c.minutes<60 && 0<=c.hours<24;
behavior one:
assumes c.seconds < 59 && c.minutes < 59;
ensures c.seconds == \old(c.seconds)+1;
behavior two:
assumes c.seconds == 59 && c.minutes < 59;
ensures c.secon... | 19 |
/*@ assigns \nothing;
ensures \result == (a + b) / 2;
*/
int avr(int a, int b)
{
int avr;
if (a >= 0 && b >= 0) {
if (b > a) {
avr = a + (b - a) / 2;
} else {
avr = b + (a - b) / 2;
}
} else if (a < 0 && b < 0) {
if (b > a) {
avr = b + (a - b) / 2;
} else {
avr = a + (b - a) / 2;
}
} e... | 26 |
/* Generated by Frama-C */
typedef unsigned long size_t;
struct __e_acsl_mpz_struct {
int _mp_alloc ;
int _mp_size ;
unsigned long *_mp_d ;
};
typedef struct __e_acsl_mpz_struct __e_acsl_mpz_struct;
typedef __e_acsl_mpz_struct ( __attribute__((__FC_BUILTIN__)) __e_acsl_mpz_t)[1];
struct __e_acsl_mpq_struct {
... | 13 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.