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_504.c | /*@
requires 0 <= n <= 1000;
ensures \result == n * n;
assigns \nothing;
*/
int sumOdd(int n){
int res=0;
int i=0;
/*@
loop invariant 0<=i<=n;
loop invariant res == i*i;
loop assigns res,i;
loop variant n-i;
*/
while(i<n){
res+=i*2+1;
i++;
}
return res;
} |
/*@
requires 0 <= n <= 1000;
ensures \result == n * n;
assigns \nothing;
*/ | int sumOdd(int n){
int res=0;
int i=0;
/*@
loop invariant 0<=i<=n;
loop invariant res == i*i;
loop assigns res,i;
loop variant n-i;
*/
while(i<n){
res+=i*2+1;
i++;
}
return res;
} | true | 17 | 17 | int sumOdd(int n){
int res=0;
int i=0;
/*@
loop invariant 0<=i<=n;
loop invariant res == i*i;
loop assigns res,i;
loop variant n-i;
*/
while(i<n){
res+=i*2+1;
i++;
}
return res;
} | /*@
requires 0 <= n <= 1000;
ensures \result == n * n;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1676.c | /*@
requires \valid_read(a+(0..N-1)) && 0 <= x && x < N && 0 <= y && y < N;
ensures \result >= 0;
*/
int lcp(int a[], int N, int x, int y)
{
int l = 0;
/*@ loop invariant 0 <= l <= N;
loop invariant x + l <= N && y + l <= N;
loop assigns l;
loop variant N - l;
*/
for (;;)... |
/*@
requires \valid_read(a+(0..N-1)) && 0 <= x && x < N && 0 <= y && y < N;
ensures \result >= 0;
*/ | int lcp(int a[], int N, int x, int y)
{
int l = 0;
/*@ loop invariant 0 <= l <= N;
loop invariant x + l <= N && y + l <= N;
loop assigns l;
loop variant N - l;
*/
for (;;) {
if (!(x + l < N && y + l < N && a[x+l] == a[y+l])) {
break;
}
l++;
... | true | 21 | 21 | int lcp(int a[], int N, int x, int y)
{
int l = 0;
/*@ loop invariant 0 <= l <= N;
loop invariant x + l <= N && y + l <= N;
loop assigns l;
loop variant N - l;
*/
for (;;) {
if (!(x + l < N && y + l < N && a[x+l] == a[y+l])) {
break;
}
l++;
... | /*@
requires \valid_read(a+(0..N-1)) && 0 <= x && x < N && 0 <= y && y < N;
ensures \result >= 0;
*/ | |
frama_c_files_v2/test_frama_c_2692.c | /*@
requires n > 0;
requires \valid_read(t+(0..n-1));
ensures \result <==> (\forall integer i; 0 <= i < n ==> t[i] == 0);
*/
int arraynull(int t[], int n){
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer j ; 0 <= j < i ==> t[j] == 0;
loop assigns i;
loop variant n-i;
*/
for(int i = 0; i < n ... |
/*@
requires n > 0;
requires \valid_read(t+(0..n-1));
ensures \result <==> (\forall integer i; 0 <= i < n ==> t[i] == 0);
*/ | int arraynull(int t[], int n){
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer j ; 0 <= j < i ==> t[j] == 0;
loop assigns i;
loop variant n-i;
*/
for(int i = 0; i < n ; i++){
if (t[i] != 0) {
return 0;
}
}
return 1;
} | true | 12 | 12 | int arraynull(int t[], int n){
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer j ; 0 <= j < i ==> t[j] == 0;
loop assigns i;
loop variant n-i;
*/
for(int i = 0; i < n ; i++){
if (t[i] != 0) {
return 0;
}
}
return 1;
} | /*@
requires n > 0;
requires \valid_read(t+(0..n-1));
ensures \result <==> (\forall integer i; 0 <= i < n ==> t[i] == 0);
*/ | |
frama_c_files_v2/test_frama_c_2214.c | /*@
ensures \result == x || \result == y;
ensures \result >= x && \result >= y;
*/
int max(int x, int y) {
if (x >= y) {
return x;
}
return y;
} |
/*@
ensures \result == x || \result == y;
ensures \result >= x && \result >= y;
*/ | int max(int x, int y) {
if (x >= y) {
return x;
}
return y;
} | true | 4 | 4 | int max(int x, int y) {
if (x >= y) {
return x;
}
return y;
} | /*@
ensures \result == x || \result == y;
ensures \result >= x && \result >= y;
*/ | |
frama_c_files_v2/test_frama_c_447.c | /*@ requires n>=0 && \valid(t+(0..n-1));
ensures \result != 0 <==> (\forall integer j; 0 <= j < n ==> t[j] == 0);
*/
int all_zeros(int t[], int n) {
int k;
/*@ loop invariant 0 <= k <= n;
loop invariant \forall integer j; 0 <= j < k ==> t[j] == 0;
loop assigns k;
loop variant n-k;
*/
for(... |
/*@ requires n>=0 && \valid(t+(0..n-1));
ensures \result != 0 <==> (\forall integer j; 0 <= j < n ==> t[j] == 0);
*/ | int all_zeros(int t[], int n) {
int k;
/*@ loop invariant 0 <= k <= n;
loop invariant \forall integer j; 0 <= j < k ==> t[j] == 0;
loop assigns k;
loop variant n-k;
*/
for(k = 0; k < n; k++)
if (t[k] != 0)
return 0;
return 1;
} | true | 12 | 12 | int all_zeros(int t[], int n) {
int k;
/*@ loop invariant 0 <= k <= n;
loop invariant \forall integer j; 0 <= j < k ==> t[j] == 0;
loop assigns k;
loop variant n-k;
*/
for(k = 0; k < n; k++)
if (t[k] != 0)
return 0;
return 1;
} | /*@ requires n>=0 && \valid(t+(0..n-1));
ensures \result != 0 <==> (\forall integer j; 0 <= j < n ==> t[j] == 0);
*/ | |
frama_c_files_v2/test_frama_c_25.c | /*@ requires n > 0;
requires \valid_read(a + (0..n-1));
assigns \nothing;
behavior present:
assumes \exists integer k; 0 <= k < n && x == a[k];
ensures \result == 1;
assigns \nothing;
behavior not_present:
assumes \forall integer k; 0 <= k < n ==> x != a[k];
ens... |
/*@ requires n > 0;
requires \valid_read(a + (0..n-1));
assigns \nothing;
behavior present:
assumes \exists integer k; 0 <= k < n && x == a[k];
ensures \result == 1;
assigns \nothing;
behavior not_present:
assumes \forall integer k; 0 <= k < n ==> x != a[k];
e... | int arraysearch(int* a, int x, int n) {
/*@ loop invariant 0 <= p <= n;
loop invariant \forall integer k; 0 <= k < p ==> x != a[k];
loop assigns p;
loop variant n - p;
*/
for (int p = 0; p < n; p++) {
if (x == a[p])
return 1;
}
return 0;
} | true | 24 | 24 | int arraysearch(int* a, int x, int n) {
/*@ loop invariant 0 <= p <= n;
loop invariant \forall integer k; 0 <= k < p ==> x != a[k];
loop assigns p;
loop variant n - p;
*/
for (int p = 0; p < n; p++) {
if (x == a[p])
return 1;
}
return 0;
} | /*@ requires n > 0;
requires \valid_read(a + (0..n-1));
assigns \nothing;
behavior present:
assumes \exists integer k; 0 <= k < n && x == a[k];
ensures \result == 1;
assigns \nothing;
behavior not_present:
assumes \forall integer k; 0 <= k < n ==> x != a[k];
ens... | |
frama_c_files_v2/test_frama_c_1899.c | #include <limits.h>
/*@
assigns \nothing;
*/
void try_initialize_array ( void )
{
int array[5];
// To prove asserts at the end of this function,
// uncomment following loop invariant. It might also be helpful to ensure
// that i has proper bounds (or use -wp-invariants).
/*@ loop invariant I1:
0 <= i <= 5 &&... | #include <limits.h>
/*@
assigns \nothing;
*/ | void try_initialize_array ( void )
{
int array[5];
// To prove asserts at the end of this function,
// uncomment following loop invariant. It might also be helpful to ensure
// that i has proper bounds (or use -wp-invariants).
/*@ loop invariant I1:
0 <= i <= 5 &&
( \forall integer j; 0 <= j < i ==> array[j] ... | true | 16 | 16 | void try_initialize_array ( void )
{
int array[5];
// To prove asserts at the end of this function,
// uncomment following loop invariant. It might also be helpful to ensure
// that i has proper bounds (or use -wp-invariants).
/*@ loop invariant I1:
0 <= i <= 5 &&
( \forall integer j; 0 <= j < i ==> array[j] ... | #include <limits.h>
/*@
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1899.c | #include <limits.h>
/*@
assigns \nothing;
*/
void try_initialize_array ( void )
{
int array[5];
// To prove asserts at the end of this function,
// uncomment following loop invariant. It might also be helpful to ensure
// that i has proper bounds (or use -wp-invariants).
/*@ loop invariant I1:
0 <= i <= 5 &&... | #include <limits.h>
/*@
assigns \nothing;
*/
void try_initialize_array ( void )
{
int array[5];
// To prove asserts at the end of this function,
// uncomment following loop invariant. It might also be helpful to ensure
// that i has proper bounds (or use -wp-invariants).
/*@ loop invariant I1:
0 <= i <= 5 &&... | void try_initialize_given_array ( int *array, int len, int base_value )
{
/*@
loop invariant
// WP somehow knows this
0 <= i <= len &&
(
\forall integer j; 0 <= j < i ==>
array[j] == base_value + j
);
// BTW an error happens when using this syntax:
// loop assigns array + (0 .. len - 1);
... | true | 31 | 31 | void try_initialize_given_array ( int *array, int len, int base_value )
{
/*@
loop invariant
// WP somehow knows this
0 <= i <= len &&
(
\forall integer j; 0 <= j < i ==>
array[j] == base_value + j
);
// BTW an error happens when using this syntax:
// loop assigns array + (0 .. len - 1);
... | #include <limits.h>
/*@
assigns \nothing;
*/
void try_initialize_array ( void )
{
int array[5];
// To prove asserts at the end of this function,
// uncomment following loop invariant. It might also be helpful to ensure
// that i has proper bounds (or use -wp-invariants).
/*@ loop invariant I1:
0 <= i <= 5 &&... | |
frama_c_files_v2/test_frama_c_1931.c | /*@
requires c >= 0;
assigns \nothing;
ensures \true;
*/
void f (int c) {
/*@ loop invariant c >= 0;
loop invariant c <= \at(c, Pre);
loop assigns c;
loop variant c;
*/
while (c != 0) {
c--;
}
return;
} |
/*@
requires c >= 0;
assigns \nothing;
ensures \true;
*/ | void f (int c) {
/*@ loop invariant c >= 0;
loop invariant c <= \at(c, Pre);
loop assigns c;
loop variant c;
*/
while (c != 0) {
c--;
}
return;
} | true | 12 | 12 | void f (int c) {
/*@ loop invariant c >= 0;
loop invariant c <= \at(c, Pre);
loop assigns c;
loop variant c;
*/
while (c != 0) {
c--;
}
return;
} | /*@
requires c >= 0;
assigns \nothing;
ensures \true;
*/ | |
frama_c_files_v2/test_frama_c_1386.c | #ifndef _FIND_H_
#define _FIND_H_
/*@
requires \valid_read(a + (0..n-1));
ensures 0 <= \result <= n;
behavior some:
assumes \exists integer i; 0 <= i < n && a[i] == v;
ensures 0 <= \result < n;
ensures a[\result] == v;
ensures \forall inte... |
/*@
requires \valid_read(a + (0..n-1));
ensures 0 <= \result <= n;
behavior some:
assumes \exists integer i; 0 <= i < n && a[i] == v;
ensures 0 <= \result < n;
ensures a[\result] == v;
ensures \forall integer i; 0 <= i < \result ==> a[i] ... | unsigned int find(const int* a, unsigned int n, int v) {
/*@ loop invariant 0 <= i <= n;
loop invariant \forall integer j; 0 <= j < i ==> a[j] != v;
loop assigns i;
loop variant n-i;
*/
for (unsigned int i = 0; i < n; i++) {
/*@ assert 0 <= i <= n; */
if (a[i] == ... | true | 21 | 21 | unsigned int find(const int* a, unsigned int n, int v) {
/*@ loop invariant 0 <= i <= n;
loop invariant \forall integer j; 0 <= j < i ==> a[j] != v;
loop assigns i;
loop variant n-i;
*/
for (unsigned int i = 0; i < n; i++) {
/*@ assert 0 <= i <= n; */
if (a[i] == ... | /*@
requires \valid_read(a + (0..n-1));
ensures 0 <= \result <= n;
behavior some:
assumes \exists integer i; 0 <= i < n && a[i] == v;
ensures 0 <= \result < n;
ensures a[\result] == v;
ensures \forall integer i; 0 <= i < \result ==> a[i] !=... | |
frama_c_files_v2/test_frama_c_269.c | /*@
requires \valid(t+(0..taille-1)) && taille>0 && 2*(taille-1) < 2147483647;
assigns t[0..taille-1];
ensures \forall integer i; 0<=i<taille ==> t[i] == 2*i;
*/
void doubled(int t[], int taille){
/*@
loop invariant 0 <= i <= taille;
loop invariant \forall integer j; 0 <= j < i ==> t[j] == 2*j;
loop assigns i... |
/*@
requires \valid(t+(0..taille-1)) && taille>0 && 2*(taille-1) < 2147483647;
assigns t[0..taille-1];
ensures \forall integer i; 0<=i<taille ==> t[i] == 2*i;
*/ | void doubled(int t[], int taille){
/*@
loop invariant 0 <= i <= taille;
loop invariant \forall integer j; 0 <= j < i ==> t[j] == 2*j;
loop assigns i, t[0..taille-1];
loop variant taille-i;
*/
for (int i=0; i<taille; i++) {
t[i] = 2*i;
/*@ assert t[i] == 2*i; */
}
} | true | 18 | 18 | void doubled(int t[], int taille){
/*@
loop invariant 0 <= i <= taille;
loop invariant \forall integer j; 0 <= j < i ==> t[j] == 2*j;
loop assigns i, t[0..taille-1];
loop variant taille-i;
*/
for (int i=0; i<taille; i++) {
t[i] = 2*i;
/*@ assert t[i] == 2*i; */
}
} | /*@
requires \valid(t+(0..taille-1)) && taille>0 && 2*(taille-1) < 2147483647;
assigns t[0..taille-1];
ensures \forall integer i; 0<=i<taille ==> t[i] == 2*i;
*/ | |
frama_c_files_v2/test_frama_c_1490.c | /*@
requires \valid(t+(0..taille-1)) && taille>0;
behavior increasing:
assumes \forall integer i; 1 <= i < taille ==> t[i] >= t[i - 1];
ensures \result == 1;
behavior decreasing:
assumes \exists integer i; 1 <= i < taille && t[i] < t[i - 1];
ensures \result == 0;
assigns \nothing;
complete ... |
/*@
requires \valid(t+(0..taille-1)) && taille>0;
behavior increasing:
assumes \forall integer i; 1 <= i < taille ==> t[i] >= t[i - 1];
ensures \result == 1;
behavior decreasing:
assumes \exists integer i; 1 <= i < taille && t[i] < t[i - 1];
ensures \result == 0;
assigns \nothing;
complet... | int monotonic(int t[], int taille) {
int i;
/*@
loop invariant 1 <= i <= taille;
loop invariant \forall integer j; 1 <= j < i ==> t[j] >= t[j - 1];
loop assigns i;
loop variant taille - i;
*/
for (i = 1; i < taille; i++) {
if (t[i] < t[i - 1])
return 0;
... | true | 21 | 21 | int monotonic(int t[], int taille) {
int i;
/*@
loop invariant 1 <= i <= taille;
loop invariant \forall integer j; 1 <= j < i ==> t[j] >= t[j - 1];
loop assigns i;
loop variant taille - i;
*/
for (i = 1; i < taille; i++) {
if (t[i] < t[i - 1])
return 0;
... | /*@
requires \valid(t+(0..taille-1)) && taille>0;
behavior increasing:
assumes \forall integer i; 1 <= i < taille ==> t[i] >= t[i - 1];
ensures \result == 1;
behavior decreasing:
assumes \exists integer i; 1 <= i < taille && t[i] < t[i - 1];
ensures \result == 0;
assigns \nothing;
complete ... | |
frama_c_files_v2/test_frama_c_888.c | /*@ requires n>0;
requires \valid(a+(0..n-1));
assigns \nothing;
behavior success:
assumes \forall integer i; 0<=i<n ==> a[i]==a[n-i-1];
ensures \result==1;
behavior failure:
assumes \exists integer i; 0<=i<n && a[i]!=a[n-i-1];
ensures \result==0;
complete behaviors success... |
/*@ requires n>0;
requires \valid(a+(0..n-1));
assigns \nothing;
behavior success:
assumes \forall integer i; 0<=i<n ==> a[i]==a[n-i-1];
ensures \result==1;
behavior failure:
assumes \exists integer i; 0<=i<n && a[i]!=a[n-i-1];
ensures \result==0;
complete behaviors succe... | int palindrome(int a[],int n) {
/*@ loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> a[j]==a[n-1-j];
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
if(a[i]!=a[n-i-1]) return 0;
}
return 1;
} | true | 22 | 22 | int palindrome(int a[],int n) {
/*@ loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> a[j]==a[n-1-j];
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
if(a[i]!=a[n-i-1]) return 0;
}
return 1;
} | /*@ requires n>0;
requires \valid(a+(0..n-1));
assigns \nothing;
behavior success:
assumes \forall integer i; 0<=i<n ==> a[i]==a[n-i-1];
ensures \result==1;
behavior failure:
assumes \exists integer i; 0<=i<n && a[i]!=a[n-i-1];
ensures \result==0;
complete behaviors success... | |
frama_c_files_v2/test_frama_c_1346.c | /*@ requires \valid(a) && \valid(b);
@ ensures *a == \old(*b);
@ ensures *b == \old(*a);
@*/
void swap(int* a, int* b) {
int temp = *a;
*a = *b;
*b = temp;
} |
/*@ requires \valid(a) && \valid(b);
@ ensures *a == \old(*b);
@ ensures *b == \old(*a);
@*/ | void swap(int* a, int* b) {
int temp = *a;
*a = *b;
*b = temp;
} | true | 8 | 8 | void swap(int* a, int* b) {
int temp = *a;
*a = *b;
*b = temp;
} | /*@ requires \valid(a) && \valid(b);
@ ensures *a == \old(*b);
@ ensures *b == \old(*a);
@*/ | |
frama_c_files_v2/test_frama_c_1480.c | // teste si un tableau est un palindrome
// ESOPE RESTE ELU PAR CETTE CRAPULE ET SE REPOSE
/*@
requires \valid (t+(0..n-1));
requires n > 0;
assigns \nothing;
ensures \result <==> (\forall integer i; 0 <= i < n/2 ==> t[i] == t[n-i-1]);
*/
int is_palindrome(int t[], int n)
{
int mid = n/2;
int i = 0;
/*@
loop... |
/*@
requires \valid (t+(0..n-1));
requires n > 0;
assigns \nothing;
ensures \result <==> (\forall integer i; 0 <= i < n/2 ==> t[i] == t[n-i-1]);
*/ | int is_palindrome(int t[], int n)
{
int mid = n/2;
int i = 0;
/*@
loop invariant 0 <= i <= mid;
loop invariant \forall integer j; 0 <= j < i ==> t[j] == t[n-1-j];
loop assigns i;
loop variant mid - i;
*/
while (i < mid && t[i] == t[n-i-1])
{
i++;
}
return i == mid;
} | true | 18 | 18 | int is_palindrome(int t[], int n)
{
int mid = n/2;
int i = 0;
/*@
loop invariant 0 <= i <= mid;
loop invariant \forall integer j; 0 <= j < i ==> t[j] == t[n-1-j];
loop assigns i;
loop variant mid - i;
*/
while (i < mid && t[i] == t[n-i-1])
{
i++;
}
return i == mid;
} | /*@
requires \valid (t+(0..n-1));
requires n > 0;
assigns \nothing;
ensures \result <==> (\forall integer i; 0 <= i < n/2 ==> t[i] == t[n-i-1]);
*/ | |
frama_c_files_v2/test_frama_c_886.c | /*
* @UBERXMHF_LICENSE_HEADER_START@
*
* uber eXtensible Micro-Hypervisor Framework (Raspberry Pi)
*
* Copyright 2018 Carnegie Mellon University. All Rights Reserved.
*
* NO WARRANTY. THIS CARNEGIE MELLON UNIVERSITY AND SOFTWARE ENGINEERING
* INSTITUTE MATERIAL IS FURNISHED ON AN "AS-IS" BASIS. CARNEGIE MELLON
... | #include <stdint.h>
#include <string.h>
/*@
requires n >= 0;
requires n == 0 || \valid_read((char*)s1+(0..n-1));
requires n == 0 || \valid_read((char*)s2+(0..n-1));
assigns \nothing;
behavior eq:
assumes n >= 0 && \forall integer i; 0 <= i < n ==> ((const unsigned char*)s1)[i] == ((const unsigned char... | int memcmp(const void *s1, const void *s2, size_t n)
{
const char *c1 = s1, *c2 = s2;
int d = 0;
/*@
loop invariant 0 <= n <= \at(n, Pre);
loop invariant (char*)s1 <= c1 <= (char*)s1 + (\at(n, Pre));
loop invariant (char*)s2 <= c2 <= (char*)s2 + (\at(n, Pre));
loop invariant d == 0;
loop ass... | true | 34 | 34 | int memcmp(const void *s1, const void *s2, size_t n)
{
const char *c1 = s1, *c2 = s2;
int d = 0;
/*@
loop invariant 0 <= n <= \at(n, Pre);
loop invariant (char*)s1 <= c1 <= (char*)s1 + (\at(n, Pre));
loop invariant (char*)s2 <= c2 <= (char*)s2 + (\at(n, Pre));
loop invariant d == 0;
loop ass... | #include <stdint.h>
#include <string.h>
/*@
requires n >= 0;
requires n == 0 || \valid_read((char*)s1+(0..n-1));
requires n == 0 || \valid_read((char*)s2+(0..n-1));
assigns \nothing;
behavior eq:
assumes n >= 0 && \forall integer i; 0 <= i < n ==> ((const unsigned char*)s1)[i] == ((const unsigned char... | |
frama_c_files_v2/test_frama_c_320.c | /*@
requires x >= 0 && x <= __INT_MAX__ - 1;
ensures \result == x + 1;
assigns \nothing;
*/
int foo(int x) {
return x+1;
} |
/*@
requires x >= 0 && x <= __INT_MAX__ - 1;
ensures \result == x + 1;
assigns \nothing;
*/ | int foo(int x) {
return x+1;
} | true | 5 | 5 | int foo(int x) {
return x+1;
} | /*@
requires x >= 0 && x <= __INT_MAX__ - 1;
ensures \result == x + 1;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2251.c | /* run.config
OPT: -load-module report -then -report
*/
/* run.config_qualif
OPT: -load-module report -then -report
EXECNOW: LOG stmt.log LOG f.dot LOG f_default_for_stmt_2.dot LOG g.dot LOG g_default_for_stmt_11.dot @frama-c@ -no-autoload-plugins -load-module wp -wp-precond-weakening -wp -wp-model Dump -wp... |
/*@ requires a < 2147483647 && b < 2147483647 && a > -2147483648 && b > -2147483648 && a + b <= 2147483647 && a + b >= -2147483648;
@ ensures a > 0 ==> \result == a + b;
@ ensures a <= 0 ==> \result == -1;
@ assigns \nothing;
*/ | int f(int a, int b) {
if (a > 0)
return a + b;
return -1;
} | true | 8 | 8 | int f(int a, int b) {
if (a > 0)
return a + b;
return -1;
} | /*@ requires a < 2147483647 && b < 2147483647 && a > -2147483648 && b > -2147483648 && a + b <= 2147483647 && a + b >= -2147483648;
@ ensures a > 0 ==> \result == a + b;
@ ensures a <= 0 ==> \result == -1;
@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2251.c | /* run.config
OPT: -load-module report -then -report
*/
/* run.config_qualif
OPT: -load-module report -then -report
EXECNOW: LOG stmt.log LOG f.dot LOG f_default_for_stmt_2.dot LOG g.dot LOG g_default_for_stmt_11.dot @frama-c@ -no-autoload-plugins -load-module wp -wp-precond-weakening -wp -wp-model Dump -wp... |
/*@ requires a < 2147483647 && b < 2147483647 && a > -2147483648 && b > -2147483648 && a + b <= 2147483647 && a + b >= -2147483648;
@ ensures a > 0 ==> \result == a + b;
@ ensures a <= 0 ==> \result == -1;
@ assigns \nothing;
*/
int f(int a, int b) {
if (a > 0)
return a + b;
return -1;
}
/*@ requires a ... | int g(int a, int b) {
return a + b;
} | true | 14 | 14 | int g(int a, int b) {
return a + b;
} | /*@ requires a < 2147483647 && b < 2147483647 && a > -2147483648 && b > -2147483648 && a + b <= 2147483647 && a + b >= -2147483648;
@ ensures a > 0 ==> \result == a + b;
@ ensures a <= 0 ==> \result == -1;
@ assigns \nothing;
*/
int f(int a, int b) {
if (a > 0)
return a + b;
return -1;
}
/*@ requires a < ... | |
frama_c_files_v2/test_frama_c_2251.c | /* run.config
OPT: -load-module report -then -report
*/
/* run.config_qualif
OPT: -load-module report -then -report
EXECNOW: LOG stmt.log LOG f.dot LOG f_default_for_stmt_2.dot LOG g.dot LOG g_default_for_stmt_11.dot @frama-c@ -no-autoload-plugins -load-module wp -wp-precond-weakening -wp -wp-model Dump -wp... |
/*@ requires a < 2147483647 && b < 2147483647 && a > -2147483648 && b > -2147483648 && a + b <= 2147483647 && a + b >= -2147483648;
@ ensures a > 0 ==> \result == a + b;
@ ensures a <= 0 ==> \result == -1;
@ assigns \nothing;
*/
int f(int a, int b) {
if (a > 0)
return a + b;
return -1;
}
/*@ requires a ... | int h(int e,int a,int b) {
if (e) return a; else return b;
} | true | 23 | 23 | int h(int e,int a,int b) {
if (e) return a; else return b;
} | /*@ requires a < 2147483647 && b < 2147483647 && a > -2147483648 && b > -2147483648 && a + b <= 2147483647 && a + b >= -2147483648;
@ ensures a > 0 ==> \result == a + b;
@ ensures a <= 0 ==> \result == -1;
@ assigns \nothing;
*/
int f(int a, int b) {
if (a > 0)
return a + b;
return -1;
}
/*@ requires a < ... | |
frama_c_files_v2/test_frama_c_1833.c | /*@ requires size >= 0 && \valid(t+(0..size-1));
@ assigns t[0..size-1];
@ ensures \forall integer i; 0 <= i < size ==> t[i] == 0;
@*/
void out_ecount(char *t, int size) {
int i;
/*@ loop assigns i, t[0..size-1];
loop invariant 0 <= i <= size;
loop invariant \forall integer k; 0 <= k < i ==> t[k] =... |
/*@ requires size >= 0 && \valid(t+(0..size-1));
@ assigns t[0..size-1];
@ ensures \forall integer i; 0 <= i < size ==> t[i] == 0;
@*/ | void out_ecount(char *t, int size) {
int i;
/*@ loop assigns i, t[0..size-1];
loop invariant 0 <= i <= size;
loop invariant \forall integer k; 0 <= k < i ==> t[k] == 0;
loop invariant \forall integer k; i <= k < size ==> t[k] == \at(t[k], Pre);
loop variant size - i;
*/
for (i = 0; i < ... | true | 19 | 19 | void out_ecount(char *t, int size) {
int i;
/*@ loop assigns i, t[0..size-1];
loop invariant 0 <= i <= size;
loop invariant \forall integer k; 0 <= k < i ==> t[k] == 0;
loop invariant \forall integer k; i <= k < size ==> t[k] == \at(t[k], Pre);
loop variant size - i;
*/
for (i = 0; i < ... | /*@ requires size >= 0 && \valid(t+(0..size-1));
@ assigns t[0..size-1];
@ ensures \forall integer i; 0 <= i < size ==> t[i] == 0;
@*/ | |
frama_c_files_v2/test_frama_c_913.c | /*@
@ requires n > 1;
@ requires \valid(a+(0..n - 1));
@
@ ensures 0 <= \result < n;
@ ensures \exists int i; 0 <= i < n && a[\result] == a[i];
@ ensures \forall int j; 0 <= j < n ==> a[\result] <= a[j];
@ assigns \nothing;
*/
int argmin(int a[], int n) {
int index_min = 0;
/*@
@ loop in... |
/*@
@ requires n > 1;
@ requires \valid(a+(0..n - 1));
@
@ ensures 0 <= \result < n;
@ ensures \exists int i; 0 <= i < n && a[\result] == a[i];
@ ensures \forall int j; 0 <= j < n ==> a[\result] <= a[j];
@ assigns \nothing;
*/ | int argmin(int a[], int n) {
int index_min = 0;
/*@
@ loop invariant 1 <= i <= n;
@ loop invariant 0 <= index_min < i;
@ loop invariant \forall int j; 0 <= j < i ==> a[index_min] <= a[j];
@ loop assigns index_min, i;
@ loop variant n - i;
*/
for (int i = 1; i < n; ++i) {
... | true | 19 | 19 | int argmin(int a[], int n) {
int index_min = 0;
/*@
@ loop invariant 1 <= i <= n;
@ loop invariant 0 <= index_min < i;
@ loop invariant \forall int j; 0 <= j < i ==> a[index_min] <= a[j];
@ loop assigns index_min, i;
@ loop variant n - i;
*/
for (int i = 1; i < n; ++i) {
... | /*@
@ requires n > 1;
@ requires \valid(a+(0..n - 1));
@
@ ensures 0 <= \result < n;
@ ensures \exists int i; 0 <= i < n && a[\result] == a[i];
@ ensures \forall int j; 0 <= j < n ==> a[\result] <= a[j];
@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2643.c | /*@ requires n > 0;
requires \valid(p + (0..n-1));
assigns \nothing;
ensures 0 <= \result < n;
ensures \forall int i; 0 <= i < n ==> p[\result] >= p[i];
*/
int array_max(int *p, int n)
{
int max_idx = 0;
int max = p[max_idx];
/*@ loop invariant 0 <= i <= n;
loop invariant 0 <= max_idx < n;
... |
/*@ requires n > 0;
requires \valid(p + (0..n-1));
assigns \nothing;
ensures 0 <= \result < n;
ensures \forall int i; 0 <= i < n ==> p[\result] >= p[i];
*/ | int array_max(int *p, int n)
{
int max_idx = 0;
int max = p[max_idx];
/*@ loop invariant 0 <= i <= n;
loop invariant 0 <= max_idx < n;
loop invariant max == p[max_idx];
loop invariant \forall integer j; 0 <= j < i ==> p[max_idx] >= p[j];
loop invariant \forall integer j; 0 <= j < i ==> max >= p[... | true | 22 | 22 | int array_max(int *p, int n)
{
int max_idx = 0;
int max = p[max_idx];
/*@ loop invariant 0 <= i <= n;
loop invariant 0 <= max_idx < n;
loop invariant max == p[max_idx];
loop invariant \forall integer j; 0 <= j < i ==> p[max_idx] >= p[j];
loop invariant \forall integer j; 0 <= j < i ==> max >= p[... | /*@ requires n > 0;
requires \valid(p + (0..n-1));
assigns \nothing;
ensures 0 <= \result < n;
ensures \forall int i; 0 <= i < n ==> p[\result] >= p[i];
*/ | |
frama_c_files_v2/test_frama_c_535.c | /*@ requires
@ size > 0 && \valid(t+(0..size-1));
@ assigns \nothing;
@ ensures \result == t[size-1];
*/
char in_ecount(char *t, int size) {
return t[size -1];
}
void in_ecount_test() {
char a[] = "test";
char b = in_ecount(a, 5);
//@ assert b == '\0';
char c = in_ecount(a, 4);
//@ assert c == 't... |
/*@ requires
@ size > 0 && \valid(t+(0..size-1));
@ assigns \nothing;
@ ensures \result == t[size-1];
*/ | char in_ecount(char *t, int size) {
return t[size -1];
} | true | 6 | 6 | char in_ecount(char *t, int size) {
return t[size -1];
} | /*@ requires
@ size > 0 && \valid(t+(0..size-1));
@ assigns \nothing;
@ ensures \result == t[size-1];
*/ | |
frama_c_files_v2/test_frama_c_2036.c | /* Generated by Frama-C */
#include "stdio.h"
#include "stdlib.h"
/*@ requires \valid_read(p);
requires *p == 0;
ensures \result == 0;
assigns \nothing;
*/
int f(int *p)
{
int __retres;
{
int i = 0;
/*@ loop invariant 0 <= i <= 1;
loop assigns i;
loop variant 1 - i;
*/
... | #include "stdio.h"
#include "stdlib.h"
/*@ requires \valid_read(p);
requires *p == 0;
ensures \result == 0;
assigns \nothing;
*/ | int f(int *p)
{
int __retres;
{
int i = 0;
/*@ loop invariant 0 <= i <= 1;
loop assigns i;
loop variant 1 - i;
*/
while (i < 1) {
i ++;
}
}
__retres = 0;
return __retres;
} | true | 11 | 11 | int f(int *p)
{
int __retres;
{
int i = 0;
/*@ loop invariant 0 <= i <= 1;
loop assigns i;
loop variant 1 - i;
*/
while (i < 1) {
i ++;
}
}
__retres = 0;
return __retres;
} | #include "stdio.h"
#include "stdlib.h"
/*@ requires \valid_read(p);
requires *p == 0;
ensures \result == 0;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2036.c | /* Generated by Frama-C */
#include "stdio.h"
#include "stdlib.h"
/*@ requires \valid_read(p);
requires *p == 0;
ensures \result == 0;
assigns \nothing;
*/
int f(int *p)
{
int __retres;
{
int i = 0;
/*@ loop invariant 0 <= i <= 1;
loop assigns i;
loop variant 1 - i;
*/
... | #include "stdio.h"
#include "stdlib.h"
/*@ requires \valid_read(p);
requires *p == 0;
ensures \result == 0;
assigns \nothing;
*/
int f(int *p)
{
int __retres;
{
int i = 0;
/*@ loop invariant 0 <= i <= 1;
loop assigns i;
loop variant 1 - i;
*/
while (i < 1) {
i ++... | int g(int *p)
{
int __retres;
{
int i = 0;
/*@ loop invariant 0 <= i <= 1;
loop assigns i;
loop variant 1 - i;
*/
while (i < 1) i ++;
}
__retres = 0;
return __retres;
} | true | 22 | 22 | int g(int *p)
{
int __retres;
{
int i = 0;
/*@ loop invariant 0 <= i <= 1;
loop assigns i;
loop variant 1 - i;
*/
while (i < 1) i ++;
}
__retres = 0;
return __retres;
} | #include "stdio.h"
#include "stdlib.h"
/*@ requires \valid_read(p);
requires *p == 0;
ensures \result == 0;
assigns \nothing;
*/
int f(int *p)
{
int __retres;
{
int i = 0;
/*@ loop invariant 0 <= i <= 1;
loop assigns i;
loop variant 1 - i;
*/
while (i < 1) {
i ++... | |
frama_c_files_v2/test_frama_c_1061.c | /*@ logic integer abs(integer x) = x >= 0 ? x : -x;
*/
#include<limits.h>
/*@ requires x > INT_MIN;
ensures (x >= 0 ==> \result == x) &&
(x < 0 ==> \result == -x);
assigns \nothing; */
int abs ( int x );
/*@ requires x > INT_MIN;
requires y > INT_MIN;
ensures \result >= x;
ensures \result ... | #include<limits.h>
/*@ logic integer abs(integer x) = x >= 0 ? x : -x;
*/
#include<limits.h>
/*@ requires x > INT_MIN;
ensures (x >= 0 ==> \result == x) &&
(x < 0 ==> \result == -x);
assigns \nothing; */
int abs ( int x );
/*@ requires x > INT_MIN;
requires y > INT_MIN;
ensures \result >= x;
... | int max_abs( int x, int y ) {
return max(abs(x),abs(y));
} | true | 15 | 15 | int max_abs( int x, int y ) {
return max(abs(x),abs(y));
} | #include<limits.h>
/*@ logic integer abs(integer x) = x >= 0 ? x : -x;
*/
#include<limits.h>
/*@ requires x > INT_MIN;
ensures (x >= 0 ==> \result == x) &&
(x < 0 ==> \result == -x);
assigns \nothing; */
int abs ( int x );
/*@ requires x > INT_MIN;
requires y > INT_MIN;
ensures \result >= x;
... | |
frama_c_files_v2/test_frama_c_1030.c | /*@
requires 0 < n;
requires \valid(a+(0..n-1));
assigns a[0..n-1];
ensures \forall integer i; 0 <= i < n ==> a[i] == 0;
*/
void array_zero(int* a, int n){
/*@ loop invariant 0 <= i <= n && (\forall integer k; 0 <= k < i ==> a[k] == 0);
loop assigns a[0..n-1], i;
loop variant n-i;
*/
for(int i = 0;i< ... |
/*@
requires 0 < n;
requires \valid(a+(0..n-1));
assigns a[0..n-1];
ensures \forall integer i; 0 <= i < n ==> a[i] == 0;
*/ | void array_zero(int* a, int n){
/*@ loop invariant 0 <= i <= n && (\forall integer k; 0 <= k < i ==> a[k] == 0);
loop assigns a[0..n-1], i;
loop variant n-i;
*/
for(int i = 0;i< n;i++){
a[i]=0;
}
} | true | 13 | 13 | void array_zero(int* a, int n){
/*@ loop invariant 0 <= i <= n && (\forall integer k; 0 <= k < i ==> a[k] == 0);
loop assigns a[0..n-1], i;
loop variant n-i;
*/
for(int i = 0;i< n;i++){
a[i]=0;
}
} | /*@
requires 0 < n;
requires \valid(a+(0..n-1));
assigns a[0..n-1];
ensures \forall integer i; 0 <= i < n ==> a[i] == 0;
*/ | |
frama_c_files_v2/test_frama_c_628.c | /*@
@ requires n > 0;
@ requires \valid(a+(0..n-1));
@ requires \valid(b+(0..n-1));
@ assigns \nothing;
@ behavior true_:
@ assumes \forall int i; 0 <= i < n ==> a[i] == b[i];
@ ensures \result == n;
@ behavior false_:
@ assumes \exists int i; 0 <= i < n && a[i] != b[i];
@ ensures 0 <= \resu... |
/*@
@ requires n > 0;
@ requires \valid(a+(0..n-1));
@ requires \valid(b+(0..n-1));
@ assigns \nothing;
@ behavior true_:
@ assumes \forall int i; 0 <= i < n ==> a[i] == b[i];
@ ensures \result == n;
@ behavior false_:
@ assumes \exists int i; 0 <= i < n && a[i] != b[i];
@ ensures 0 <= \re... | int compare_arrays(int a[], int b[], int n) {
/*@
@ loop invariant 0 <= i <= n;
@ loop invariant \forall integer j; 0 <= j < i ==> a[j] == b[j];
@ loop assigns i;
@ loop variant n - i;
*/
for (int i = 0; i < n; ++i) {
if (a[i] != b[i]) return i;
}
return n;
} | true | 20 | 20 | int compare_arrays(int a[], int b[], int n) {
/*@
@ loop invariant 0 <= i <= n;
@ loop invariant \forall integer j; 0 <= j < i ==> a[j] == b[j];
@ loop assigns i;
@ loop variant n - i;
*/
for (int i = 0; i < n; ++i) {
if (a[i] != b[i]) return i;
}
return n;
} | /*@
@ requires n > 0;
@ requires \valid(a+(0..n-1));
@ requires \valid(b+(0..n-1));
@ assigns \nothing;
@ behavior true_:
@ assumes \forall int i; 0 <= i < n ==> a[i] == b[i];
@ ensures \result == n;
@ behavior false_:
@ assumes \exists int i; 0 <= i < n && a[i] != b[i];
@ ensures 0 <= \resu... | |
frama_c_files_v2/test_frama_c_2661.c | /*@ requires x > -2147483648;
@ ensures \result >= 0;
@ ensures \result == x || \result == -x;
@ assigns \nothing;
@*/
int abs(int x) {
if (x >= 0) return x;
return -x;
} |
/*@ requires x > -2147483648;
@ ensures \result >= 0;
@ ensures \result == x || \result == -x;
@ assigns \nothing;
@*/ | int abs(int x) {
if (x >= 0) return x;
return -x;
} | true | 7 | 7 | int abs(int x) {
if (x >= 0) return x;
return -x;
} | /*@ requires x > -2147483648;
@ ensures \result >= 0;
@ ensures \result == x || \result == -x;
@ assigns \nothing;
@*/ | |
frama_c_files_v2/test_frama_c_1614.c | #include<limits.h>
/*@
requires x > 0 && x < INT_MAX;
ensures \result == x;
assigns \nothing;
*/
int test(int x) {
int a = x;
int y = 0;
/*@
loop invariant y + a == x;
loop invariant a >= 0 && a <= x;
loop assigns a, y;
loop variant a;
*/
while(a != 0) {
... | #include<limits.h>
/*@
requires x > 0 && x < INT_MAX;
ensures \result == x;
assigns \nothing;
*/ | int test(int x) {
int a = x;
int y = 0;
/*@
loop invariant y + a == x;
loop invariant a >= 0 && a <= x;
loop assigns a, y;
loop variant a;
*/
while(a != 0) {
y = y + 1;
a = a - 1;
}
return y;
} | true | 13 | 13 | int test(int x) {
int a = x;
int y = 0;
/*@
loop invariant y + a == x;
loop invariant a >= 0 && a <= x;
loop assigns a, y;
loop variant a;
*/
while(a != 0) {
y = y + 1;
a = a - 1;
}
return y;
} | #include<limits.h>
/*@
requires x > 0 && x < INT_MAX;
ensures \result == x;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_46.c | /*@
requires 0 < n <= 10;
assigns \nothing;
ensures \result == n * (n + 1) * (2 * n + 1) / 6;
*/
int sq(int n)
{
int s;
int i;
s = 0;
i = 1;
/*@
loop invariant 1 <= i <= n + 1;
loop invariant s == (i - 1) * i * (2 * i - 1) / 6;
loop assigns s, i;
loop vari... |
/*@
requires 0 < n <= 10;
assigns \nothing;
ensures \result == n * (n + 1) * (2 * n + 1) / 6;
*/ | int sq(int n)
{
int s;
int i;
s = 0;
i = 1;
/*@
loop invariant 1 <= i <= n + 1;
loop invariant s == (i - 1) * i * (2 * i - 1) / 6;
loop assigns s, i;
loop variant n - i;
*/
while (i <= n)
{
s = s + i * i;
i += 1;
}
return s;
} | true | 18 | 18 | int sq(int n)
{
int s;
int i;
s = 0;
i = 1;
/*@
loop invariant 1 <= i <= n + 1;
loop invariant s == (i - 1) * i * (2 * i - 1) / 6;
loop assigns s, i;
loop variant n - i;
*/
while (i <= n)
{
s = s + i * i;
i += 1;
}
return s;
} | /*@
requires 0 < n <= 10;
assigns \nothing;
ensures \result == n * (n + 1) * (2 * n + 1) / 6;
*/ | |
frama_c_files_v2/test_frama_c_1783.c | /* run.config
EXECNOW: make tests/aorai/Aorai_test.cmxs
OPT: -aorai-automata tests/aorai/test_recursion5.ya -aorai-test 1 -aorai-acceptance -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
//frama-c t2.c -aorai-automata t2.ya -aorai-dot -aorai-show-op-spec -aorai-output-c-file t2_an... |
/*@ requires \valid(t+(0..max));
@ requires max>=0;
@ requires 0<=i<=max;
@ decreases max-i;
@ ensures i<=\result<=max || \result==-1 ;
@ ensures \result!=-1 ==> t[\result]==val;
@ ensures \result==-1 ==> (\forall integer j; i<=j<=max ==> t[j]!=val);
@ assigns \nothing;
*/ | int isPresentRec(int t[], int i, int max, int val) {
// printf("t : %d | s : %d | v : %d\n",t[0],size,val);
if(t[i]==val) return i;
if(max==i) return -1; // 1 de plus que max
return isPresentRec(t, i+1, max, val);
} | true | 17 | 17 | int isPresentRec(int t[], int i, int max, int val) {
// printf("t : %d | s : %d | v : %d\n",t[0],size,val);
if(t[i]==val) return i;
if(max==i) return -1; // 1 de plus que max
return isPresentRec(t, i+1, max, val);
} | /*@ requires \valid(t+(0..max));
@ requires max>=0;
@ requires 0<=i<=max;
@ decreases max-i;
@ ensures i<=\result<=max || \result==-1 ;
@ ensures \result!=-1 ==> t[\result]==val;
@ ensures \result==-1 ==> (\forall integer j; i<=j<=max ==> t[j]!=val);
@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_619.c | #include<limits.h>
/*@
requires INT_MIN - b <= a <= INT_MAX - b;
ensures \result == a+b;
assigns \nothing;
*/
int add(int a,int b){
return a+b;
} | #include<limits.h>
/*@
requires INT_MIN - b <= a <= INT_MAX - b;
ensures \result == a+b;
assigns \nothing;
*/ | int add(int a,int b){
return a+b;
} | true | 6 | 6 | int add(int a,int b){
return a+b;
} | #include<limits.h>
/*@
requires INT_MIN - b <= a <= INT_MAX - b;
ensures \result == a+b;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1088.c | /*@
requires n > 0;
requires \valid_read(a + (0..n-1));
assigns \nothing;
behavior present:
assumes \exists integer k; 0 <= k < n && x == a[k];
ensures \result == 1;
behavior not_present:
assumes \forall integer k; 0 <= k < n ==> x != a[k];
ensures \result == 0;
complete behaviors present, not_presen... |
/*@
requires n > 0;
requires \valid_read(a + (0..n-1));
assigns \nothing;
behavior present:
assumes \exists integer k; 0 <= k < n && x == a[k];
ensures \result == 1;
behavior not_present:
assumes \forall integer k; 0 <= k < n ==> x != a[k];
ensures \result == 0;
complete behaviors present, not_pres... | int arraySearch(int *a, int x, int n) {
int p = 0;
/*@
loop invariant 0 <= p <= n;
loop invariant \forall integer k; 0 <= k < p ==> x != a[k];
loop assigns p;
loop variant n - p;
*/
while (p < n) {
if (a[p] == x) {
return 1;
}
p++;
... | true | 18 | 18 | int arraySearch(int *a, int x, int n) {
int p = 0;
/*@
loop invariant 0 <= p <= n;
loop invariant \forall integer k; 0 <= k < p ==> x != a[k];
loop assigns p;
loop variant n - p;
*/
while (p < n) {
if (a[p] == x) {
return 1;
}
p++;
... | /*@
requires n > 0;
requires \valid_read(a + (0..n-1));
assigns \nothing;
behavior present:
assumes \exists integer k; 0 <= k < n && x == a[k];
ensures \result == 1;
behavior not_present:
assumes \forall integer k; 0 <= k < n ==> x != a[k];
ensures \result == 0;
complete behaviors present, not_presen... | |
frama_c_files_v2/test_frama_c_142.c | /* run.config
COMMENT: \at on purely logic variables
COMMENT:
*/
/*@ assigns \nothing; */
void f(int *t) {}
/*@ assigns \nothing; */
void g() {
int m;
m = 8;
Q: ;
m = 10;
/*@ assert \exists integer w; 3 <= w < 6 && \at(m + w == 12, Q); */ ;
}
/*@ assigns \nothing; */
int main(void) {
int n;
n = 7;
... |
/*@ assigns \nothing; */ | void f(int *t) {} | true | 3 | 3 | void f(int *t) {} | /*@ assigns \nothing; */ | |
frama_c_files_v2/test_frama_c_142.c | /* run.config
COMMENT: \at on purely logic variables
COMMENT:
*/
/*@ assigns \nothing; */
void f(int *t) {}
/*@ assigns \nothing; */
void g() {
int m;
m = 8;
Q: ;
m = 10;
/*@ assert \exists integer w; 3 <= w < 6 && \at(m + w == 12, Q); */ ;
}
/*@ assigns \nothing; */
int main(void) {
int n;
n = 7;
... |
/*@ assigns \nothing; */
void f(int *t) {}
/*@ assigns \nothing; */ | void g() {
int m;
m = 8;
Q: ;
m = 10;
/*@ assert \exists integer w; 3 <= w < 6 && \at(m + w == 12, Q); */ ;
} | true | 8 | 8 | void g() {
int m;
m = 8;
Q: ;
m = 10;
/*@ assert \exists integer w; 3 <= w < 6 && \at(m + w == 12, Q); */ ;
} | /*@ assigns \nothing; */
void f(int *t) {}
/*@ assigns \nothing; */ | |
frama_c_files_v2/test_frama_c_1331.c | /*@
requires base >= 0 && height >= 0 && base <= 2147483647 / height;
ensures \result == (base * height)/2;
assigns \nothing;
*/
int area(int base, int height){
int res = (base * height)/2;
return res;
}
/*@
assigns \nothing;
*/
int main() {
int a = area(4, 5);
//@ assert a == 10;
} |
/*@
requires base >= 0 && height >= 0 && base <= 2147483647 / height;
ensures \result == (base * height)/2;
assigns \nothing;
*/ | int area(int base, int height){
int res = (base * height)/2;
return res;
} | true | 6 | 6 | int area(int base, int height){
int res = (base * height)/2;
return res;
} | /*@
requires base >= 0 && height >= 0 && base <= 2147483647 / height;
ensures \result == (base * height)/2;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1185.c | /*@
requires \valid(t+(0..n-1)) && n>0;
ensures (\exists integer i; 0<=i<n && t[i] == x) ==> -1<=\result<n;
ensures (\forall integer i; 0<=i<n ==> t[i] != x) ==> \result == -1;
*/
int index(int t[], int n, int x){
/*@
loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> t[j] != x;
loop assigns i... |
/*@
requires \valid(t+(0..n-1)) && n>0;
ensures (\exists integer i; 0<=i<n && t[i] == x) ==> -1<=\result<n;
ensures (\forall integer i; 0<=i<n ==> t[i] != x) ==> \result == -1;
*/ | int index(int t[], int n, int x){
/*@
loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> t[j] != x;
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++){
if(t[i] == x)
return i;
}
return -1;
} | true | 13 | 13 | int index(int t[], int n, int x){
/*@
loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> t[j] != x;
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++){
if(t[i] == x)
return i;
}
return -1;
} | /*@
requires \valid(t+(0..n-1)) && n>0;
ensures (\exists integer i; 0<=i<n && t[i] == x) ==> -1<=\result<n;
ensures (\forall integer i; 0<=i<n ==> t[i] != x) ==> \result == -1;
*/ | |
frama_c_files_v2/test_frama_c_2191.c | /*@ requires n >= 0 && \valid_range(a, 0, n - 1);
@ assigns \nothing;
@ behavior success:
@ assumes \exists integer k; 0 <= k < n && a[k] == v;
@ ensures 0 <= \result < n && a[\result] == v;
@ behavior failure:
@ assumes \forall integer k; 0 <= k < n ==> a[k] != v;
@ ensures \result == -1;
@ com... |
/*@ requires n >= 0 && \valid_range(a, 0, n - 1);
@ assigns \nothing;
@ behavior success:
@ assumes \exists integer k; 0 <= k < n && a[k] == v;
@ ensures 0 <= \result < n && a[\result] == v;
@ behavior failure:
@ assumes \forall integer k; 0 <= k < n ==> a[k] != v;
@ ensures \result == -1;
@ c... | int search (int a[], int n, int v) {
/*@ loop invariant 0 <= i <= n;
@ loop invariant \forall integer k; 0 <= k < i ==> a[k] != v;
@ loop assigns i;
@ loop variant n - i;
@*/
for (int i = 0; i < n; i++)
if (a[i] == v)
return i;
return -1;
} | true | 18 | 18 | int search (int a[], int n, int v) {
/*@ loop invariant 0 <= i <= n;
@ loop invariant \forall integer k; 0 <= k < i ==> a[k] != v;
@ loop assigns i;
@ loop variant n - i;
@*/
for (int i = 0; i < n; i++)
if (a[i] == v)
return i;
return -1;
} | /*@ requires n >= 0 && \valid_range(a, 0, n - 1);
@ assigns \nothing;
@ behavior success:
@ assumes \exists integer k; 0 <= k < n && a[k] == v;
@ ensures 0 <= \result < n && a[\result] == v;
@ behavior failure:
@ assumes \forall integer k; 0 <= k < n ==> a[k] != v;
@ ensures \result == -1;
@ com... | |
frama_c_files_v2/test_frama_c_1903.c | /*@ requires 0<=n<=1000;
ensures \result == n*(n-1)/2;
*/
int sum(int n) {
int sum=0;
/*@ loop invariant 0<=i<=n;
loop invariant sum == i*(i-1)/2;
loop assigns sum, i;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
sum+=i;
}
return sum;
} |
/*@ requires 0<=n<=1000;
ensures \result == n*(n-1)/2;
*/ | int sum(int n) {
int sum=0;
/*@ loop invariant 0<=i<=n;
loop invariant sum == i*(i-1)/2;
loop assigns sum, i;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
sum+=i;
}
return sum;
} | true | 13 | 13 | int sum(int n) {
int sum=0;
/*@ loop invariant 0<=i<=n;
loop invariant sum == i*(i-1)/2;
loop assigns sum, i;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
sum+=i;
}
return sum;
} | /*@ requires 0<=n<=1000;
ensures \result == n*(n-1)/2;
*/ | |
frama_c_files_v2/test_frama_c_2561.c | #include <limits.h>
/*@
requires x+y <= INT_MAX;
requires x+y >= INT_MIN;
requires x >= INT_MIN && y >= INT_MIN;
ensures \result == x+y;
assigns \nothing;
*/
int add(int x, int y) {
return x+y;
}
| #include <limits.h>
/*@
requires x+y <= INT_MAX;
requires x+y >= INT_MIN;
requires x >= INT_MIN && y >= INT_MIN;
ensures \result == x+y;
assigns \nothing;
*/ | int add(int x, int y) {
return x+y;
} | true | 6 | 6 | int add(int x, int y) {
return x+y;
} | #include <limits.h>
/*@
requires x+y <= INT_MAX;
requires x+y >= INT_MIN;
requires x >= INT_MIN && y >= INT_MIN;
ensures \result == x+y;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_685.c | /*@
requires \valid(t+(0..taille-1)) && taille>0;
assigns \nothing;
behavior monotonic_increasing:
assumes \forall integer i; 0 <= i < taille - 1 ==> t[i] <= t[i+1];
ensures \result == 1;
behavior not_monotonic_increasing:
assumes \exists integer i; 0 <= i < taille - 1 && t[i] > t[i+1];
ensures \result == 0;
... |
/*@
requires \valid(t+(0..taille-1)) && taille>0;
assigns \nothing;
behavior monotonic_increasing:
assumes \forall integer i; 0 <= i < taille - 1 ==> t[i] <= t[i+1];
ensures \result == 1;
behavior not_monotonic_increasing:
assumes \exists integer i; 0 <= i < taille - 1 && t[i] > t[i+1];
ensures \result == 0... | int monotonic(int t[], int taille) {
/*@
loop invariant 1 <= i <= taille;
loop invariant \forall integer j; 0 <= j < i-1 ==> t[j] <= t[j+1];
loop assigns i;
loop variant taille - i;
*/
for (int i = 1; i < taille; i++) {
if (t[i] < t[i - 1])
return 0;
}
return 1;
} | true | 20 | 20 | int monotonic(int t[], int taille) {
/*@
loop invariant 1 <= i <= taille;
loop invariant \forall integer j; 0 <= j < i-1 ==> t[j] <= t[j+1];
loop assigns i;
loop variant taille - i;
*/
for (int i = 1; i < taille; i++) {
if (t[i] < t[i - 1])
return 0;
}
return 1;
} | /*@
requires \valid(t+(0..taille-1)) && taille>0;
assigns \nothing;
behavior monotonic_increasing:
assumes \forall integer i; 0 <= i < taille - 1 ==> t[i] <= t[i+1];
ensures \result == 1;
behavior not_monotonic_increasing:
assumes \exists integer i; 0 <= i < taille - 1 && t[i] > t[i+1];
ensures \result == 0;
... | |
frama_c_files_v2/test_frama_c_2048.c | /*@
requires n > 0;
requires \valid_read(arr + (0..n-1));
ensures \forall integer i;
0 <= i < n ==> \result <= arr[i];
*/
int arraymin(int arr[], int n) {
int min = arr[0];
/*@
loop invariant \forall integer i; 0 <= i < n ==> min <= arr[i] || i >= j;
loop invariant 1 <= j <= n;
loop assigns j, min;
... |
/*@
requires n > 0;
requires \valid_read(arr + (0..n-1));
ensures \forall integer i;
0 <= i < n ==> \result <= arr[i];
*/ | int arraymin(int arr[], int n) {
int min = arr[0];
/*@
loop invariant \forall integer i; 0 <= i < n ==> min <= arr[i] || i >= j;
loop invariant 1 <= j <= n;
loop assigns j, min;
loop variant n - j;
*/
for (int j=1; j<n; j++)
{
if (arr[j] < min)
min = arr[j];
}
return min;
} | true | 14 | 14 | int arraymin(int arr[], int n) {
int min = arr[0];
/*@
loop invariant \forall integer i; 0 <= i < n ==> min <= arr[i] || i >= j;
loop invariant 1 <= j <= n;
loop assigns j, min;
loop variant n - j;
*/
for (int j=1; j<n; j++)
{
if (arr[j] < min)
min = arr[j];
}
return min;
} | /*@
requires n > 0;
requires \valid_read(arr + (0..n-1));
ensures \forall integer i;
0 <= i < n ==> \result <= arr[i];
*/ | |
frama_c_files_v2/test_frama_c_1075.c | /* run.config
EXECNOW: make tests/aorai/Aorai_test.cmxs
OPT: -aorai-ltl tests/aorai/test_boucle1.ltl -aorai-test 1 -aorai-acceptance -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
int cpt=3;
//@ global invariant inv_cpt : 0<=cpt<=3;
int status=0;
//@ global invariant inv_status : ... |
/*@ requires \true;
@ ensures 0<=\result<=1;
@ assigns \nothing;
*/ | int commit_trans() {
return 1;
} | true | 4 | 4 | int commit_trans() {
return 1;
} | /*@ requires \true;
@ ensures 0<=\result<=1;
@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1075.c | /* run.config
EXECNOW: make tests/aorai/Aorai_test.cmxs
OPT: -aorai-ltl tests/aorai/test_boucle1.ltl -aorai-test 1 -aorai-acceptance -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
int cpt=3;
//@ global invariant inv_cpt : 0<=cpt<=3;
int status=0;
//@ global invariant inv_status : ... |
/*@ requires \true;
@ ensures 0<=\result<=1;
@ assigns \nothing;
*/
int commit_trans() {
return 1;
}
/*@ requires \true;
@ ensures 0<=\result<=1;
@ assigns \nothing;
*/ | int init_trans() {
return 1;
} | true | 8 | 8 | int init_trans() {
return 1;
} | /*@ requires \true;
@ ensures 0<=\result<=1;
@ assigns \nothing;
*/
int commit_trans() {
return 1;
}
/*@ requires \true;
@ ensures 0<=\result<=1;
@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_304.c | /*@ requires \valid(p + (0..4));
@ ensures \valid(p + (0..4));
@*/
void validPointers(int * p) {
*p = 1;
return;
} |
/*@ requires \valid(p + (0..4));
@ ensures \valid(p + (0..4));
@*/ | void validPointers(int * p) {
*p = 1;
return;
} | true | 4 | 4 | void validPointers(int * p) {
*p = 1;
return;
} | /*@ requires \valid(p + (0..4));
@ ensures \valid(p + (0..4));
@*/ | |
frama_c_files_v2/test_frama_c_2033.c | #include <stdio.h>
/*@
axiomatic Factorial {
logic integer fact(integer n);
axiom case_n:
\forall integer n;
n >= 1 ==> fact(n) == n*fact(n-1);
axiom case_0:
fact(0) == 1;
}
*/
/*@
requires n >= 0 && n < 13;
ensures \result == fact(n);
assigns \nothing;
*/
int factorial(int n) {
... | #include <stdio.h>
/*@
axiomatic Factorial {
logic integer fact(integer n);
axiom case_n:
\forall integer n;
n >= 1 ==> fact(n) == n*fact(n-1);
axiom case_0:
fact(0) == 1;
}
*/
/*@
requires n >= 0 && n < 13;
ensures \result == fact(n);
assigns \nothing;
*/ | int factorial(int n) {
int i = 1;
int f = 1;
/*@
loop invariant f == fact(i-1);
loop invariant 1 <= i;
loop invariant i <= n+1;
loop invariant f >= 0; // Ensure f is non-negative, useful for overflow prevention
loop assigns i, f; // other variables are invariant
loop variant n - i;
... | true | 18 | 18 | int factorial(int n) {
int i = 1;
int f = 1;
/*@
loop invariant f == fact(i-1);
loop invariant 1 <= i;
loop invariant i <= n+1;
loop invariant f >= 0; // Ensure f is non-negative, useful for overflow prevention
loop assigns i, f; // other variables are invariant
loop variant n - i;
... | #include <stdio.h>
/*@
axiomatic Factorial {
logic integer fact(integer n);
axiom case_n:
\forall integer n;
n >= 1 ==> fact(n) == n*fact(n-1);
axiom case_0:
fact(0) == 1;
}
*/
/*@
requires n >= 0 && n < 13;
ensures \result == fact(n);
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2311.c | /*@ requires \valid(p) && *p <= 100 && *p >= -100;
assigns *p;
ensures *p == \old(*p)+ 1 ; */
int incr(int *p)
{
*p = *p + 1;
return *p;
}; |
/*@ requires \valid(p) && *p <= 100 && *p >= -100;
assigns *p;
ensures *p == \old(*p)+ 1 ; */ | int incr(int *p)
{
*p = *p + 1;
return *p;
} | true | 9 | 9 | int incr(int *p)
{
*p = *p + 1;
return *p;
} | /*@ requires \valid(p) && *p <= 100 && *p >= -100;
assigns *p;
ensures *p == \old(*p)+ 1 ; */ | |
frama_c_files_v2/test_frama_c_819.c | #include <stdio.h>
/*@
requires c > 0;
ensures \result == c;
assigns \nothing;
*/
int func(int c) {
int x = c;
int y = 0;
/*@
loop invariant c == x + y && x >= 0;
loop assigns x, y;
loop variant x;
*/
while(x > 0) {
x = x - 1;
y = y + 1;
}
... | #include <stdio.h>
/*@
requires c > 0;
ensures \result == c;
assigns \nothing;
*/ | int func(int c) {
int x = c;
int y = 0;
/*@
loop invariant c == x + y && x >= 0;
loop assigns x, y;
loop variant x;
*/
while(x > 0) {
x = x - 1;
y = y + 1;
}
return y;
} | true | 11 | 11 | int func(int c) {
int x = c;
int y = 0;
/*@
loop invariant c == x + y && x >= 0;
loop assigns x, y;
loop variant x;
*/
while(x > 0) {
x = x - 1;
y = y + 1;
}
return y;
} | #include <stdio.h>
/*@
requires c > 0;
ensures \result == c;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_571.c | /*@ predicate MaxElem{L}(int e, int *a, integer n) =
@ \forall integer i; 0 <= i < n ==> e >= a[i] &&
@ \exists integer i; 0 <= i < n && e == a[i];
@*/
/*@ requires n > 0 && \valid_range(a, 0, n - 1);
@ assigns \nothing;
@ ensures MaxElem(\result, a, n);
@*/
int maxelem (int a[], int n) {
int m = ... |
/*@ predicate MaxElem{L}(int e, int *a, integer n) =
@ \forall integer i; 0 <= i < n ==> e >= a[i] &&
@ \exists integer i; 0 <= i < n && e == a[i];
@*/
/*@ requires n > 0 && \valid_range(a, 0, n - 1);
@ assigns \nothing;
@ ensures MaxElem(\result, a, n);
@*/ | int maxelem (int a[], int n) {
int m = a[0];
/*@ loop invariant 0 < k <= n;
@ loop invariant MaxElem(m, a, k);
@ loop assigns k,m;
@ loop variant n - k;
@*/
for (int k = 1; k < n; k++)
if (a[k] > m)
m = a[k];
return m;
} | true | 15 | 15 | int maxelem (int a[], int n) {
int m = a[0];
/*@ loop invariant 0 < k <= n;
@ loop invariant MaxElem(m, a, k);
@ loop assigns k,m;
@ loop variant n - k;
@*/
for (int k = 1; k < n; k++)
if (a[k] > m)
m = a[k];
return m;
} | /*@ predicate MaxElem{L}(int e, int *a, integer n) =
@ \forall integer i; 0 <= i < n ==> e >= a[i] &&
@ \exists integer i; 0 <= i < n && e == a[i];
@*/
/*@ requires n > 0 && \valid_range(a, 0, n - 1);
@ assigns \nothing;
@ ensures MaxElem(\result, a, n);
@*/ | |
frama_c_files_v2/test_frama_c_1275.c | /*@ requires \valid(a + (0..6));
ensures \valid_read(a + (0..6)) && a[6] == '\0' &&
(a[0] == 'a') && (a[1] == 'b') && (a[2] == 'c') &&
(a[3] == 'a') && (a[4] == 'b') && (a[5] == 'c');
*/
char* strtest(char* a){
a[0] = 'a'; a[1] = 'b'; a[2] = 'c'; a[3] = 'a'; a[4] = 'b'; a[5] = 'c'; ... |
/*@ requires \valid(a + (0..6));
ensures \valid_read(a + (0..6)) && a[6] == '\0' &&
(a[0] == 'a') && (a[1] == 'b') && (a[2] == 'c') &&
(a[3] == 'a') && (a[4] == 'b') && (a[5] == 'c');
*/ | char* strtest(char* a){
a[0] = 'a'; a[1] = 'b'; a[2] = 'c'; a[3] = 'a'; a[4] = 'b'; a[5] = 'c'; a[6] = '\0';
return a;
} | true | 10 | 10 | char* strtest(char* a){
a[0] = 'a'; a[1] = 'b'; a[2] = 'c'; a[3] = 'a'; a[4] = 'b'; a[5] = 'c'; a[6] = '\0';
return a;
} | /*@ requires \valid(a + (0..6));
ensures \valid_read(a + (0..6)) && a[6] == '\0' &&
(a[0] == 'a') && (a[1] == 'b') && (a[2] == 'c') &&
(a[3] == 'a') && (a[4] == 'b') && (a[5] == 'c');
*/ | |
frama_c_files_v2/test_frama_c_104.c | /*@
@ requires \valid(t+(0..n - 1));
@ requires n > 0;
@
@ ensures \forall integer i; 0 <= i < n ==> t[i] == val;
*/
void fill(int t[], int n, int val) {
/*@
@ loop invariant 0 <= i <= n;
@ loop invariant \forall integer j; 0 <= j < i ==> t[j] == val;
@ loop assigns i, t[0..n-1];
@ l... |
/*@
@ requires \valid(t+(0..n - 1));
@ requires n > 0;
@
@ ensures \forall integer i; 0 <= i < n ==> t[i] == val;
*/ | void fill(int t[], int n, int val) {
/*@
@ loop invariant 0 <= i <= n;
@ loop invariant \forall integer j; 0 <= j < i ==> t[j] == val;
@ loop assigns i, t[0..n-1];
@ loop variant n - i;
*/
for (int i = 0; i < n; ++i) {
t[i] = val;
}
} | true | 14 | 14 | void fill(int t[], int n, int val) {
/*@
@ loop invariant 0 <= i <= n;
@ loop invariant \forall integer j; 0 <= j < i ==> t[j] == val;
@ loop assigns i, t[0..n-1];
@ loop variant n - i;
*/
for (int i = 0; i < n; ++i) {
t[i] = val;
}
} | /*@
@ requires \valid(t+(0..n - 1));
@ requires n > 0;
@
@ ensures \forall integer i; 0 <= i < n ==> t[i] == val;
*/ | |
frama_c_files_v2/test_frama_c_1984.c | /*@ requires \valid(t+(0..n-1)) && 0 <= k < n;
@ ensures \forall integer i; k <= i < n ==> \result <= t[i];
@ assigns \nothing;
*/
int getMinSubarray(int t[], int n, int k) {
int res = t[k];
/*@ loop invariant k+1 <= i <= n;
@ loop invariant \forall integer j; k <= j < i ==> res <= t[j];
@ loop as... |
/*@ requires \valid(t+(0..n-1)) && 0 <= k < n;
@ ensures \forall integer i; k <= i < n ==> \result <= t[i];
@ assigns \nothing;
*/ | int getMinSubarray(int t[], int n, int k) {
int res = t[k];
/*@ loop invariant k+1 <= i <= n;
@ loop invariant \forall integer j; k <= j < i ==> res <= t[j];
@ loop assigns i, res;
@ loop variant n - i;
*/
for (int i = k+1; i < n; i++)
if (t[i] < res)
res = t[i];
return res;
... | true | 16 | 16 | int getMinSubarray(int t[], int n, int k) {
int res = t[k];
/*@ loop invariant k+1 <= i <= n;
@ loop invariant \forall integer j; k <= j < i ==> res <= t[j];
@ loop assigns i, res;
@ loop variant n - i;
*/
for (int i = k+1; i < n; i++)
if (t[i] < res)
res = t[i];
return res;
... | /*@ requires \valid(t+(0..n-1)) && 0 <= k < n;
@ ensures \forall integer i; k <= i < n ==> \result <= t[i];
@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2791.c | int t[100];
/*@ requires \valid(t+(0..99)) && (\forall integer k ; 0 <= k < 100 ==> t[k] == 1) ;
assigns t[0..99];
ensures \valid(t+(0..99)) && (\forall integer k ; 0 <= k < 100 ==> t[k] == 2) ;
*/
void f(void)
{
int i;
/*@
loop invariant 0 <= i <= 100 && (\forall integer k ; 0 <= k < i ==> t[k... | int t[100];
/*@ requires \valid(t+(0..99)) && (\forall integer k ; 0 <= k < 100 ==> t[k] == 1) ;
assigns t[0..99];
ensures \valid(t+(0..99)) && (\forall integer k ; 0 <= k < 100 ==> t[k] == 2) ;
*/ | void f(void)
{
int i;
/*@
loop invariant 0 <= i <= 100 && (\forall integer k ; 0 <= k < i ==> t[k] == 2)
&& (\forall integer k ; i <= k < 100 ==> t[k] == 1) ;
loop assigns t[0..99], i;
loop variant 100 - i;
*/
for (i=0; i<100; i++) t[i]++;
} | true | 14 | 14 | void f(void)
{
int i;
/*@
loop invariant 0 <= i <= 100 && (\forall integer k ; 0 <= k < i ==> t[k] == 2)
&& (\forall integer k ; i <= k < 100 ==> t[k] == 1) ;
loop assigns t[0..99], i;
loop variant 100 - i;
*/
for (i=0; i<100; i++) t[i]++;
} | int t[100];
/*@ requires \valid(t+(0..99)) && (\forall integer k ; 0 <= k < 100 ==> t[k] == 1) ;
assigns t[0..99];
ensures \valid(t+(0..99)) && (\forall integer k ; 0 <= k < 100 ==> t[k] == 2) ;
*/ | |
frama_c_files_v2/test_frama_c_674.c | /*@ requires a <= 2147483647 && a >= -2147483648;
requires b <= 2147483647 && b >= -2147483648;
requires c <= 2147483647 && c >= -2147483648;
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 ... |
/*@ requires a <= 2147483647 && a >= -2147483648;
requires b <= 2147483647 && b >= -2147483648;
requires c <= 2147483647 && c >= -2147483648;
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>=... | void doubleint(int t[],int size) { // void double() --> not possible since datatype!
/*@ loop invariant 0<=i<=size;
loop invariant \forall integer j; 0<=j<i ==> t[j] == (j*2) ;
loop invariant \forall integer j; 0<=j<i-1 ==> t[j]<=t[j+1];
loop assigns i, t[0..size-1];
loop variant size-i;
*/
for(... | true | 27 | 27 | void doubleint(int t[],int size) { // void double() --> not possible since datatype!
/*@ loop invariant 0<=i<=size;
loop invariant \forall integer j; 0<=j<i ==> t[j] == (j*2) ;
loop invariant \forall integer j; 0<=j<i-1 ==> t[j]<=t[j+1];
loop assigns i, t[0..size-1];
loop variant size-i;
*/
for(... | /*@ requires a <= 2147483647 && a >= -2147483648;
requires b <= 2147483647 && b >= -2147483648;
requires c <= 2147483647 && c >= -2147483648;
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 ... | |
frama_c_files_v2/test_frama_c_2348.c | /*@ ensures \result >= a && \result >=b && (\result == a || \result == b);
*/
int max(int a, int b) {
return a > b ? a : b;
} |
/*@ ensures \result >= a && \result >=b && (\result == a || \result == b);
*/ | int max(int a, int b) {
return a > b ? a : b;
} | true | 3 | 3 | int max(int a, int b) {
return a > b ? a : b;
} | /*@ ensures \result >= a && \result >=b && (\result == a || \result == b);
*/ | |
frama_c_files_v2/test_frama_c_1277.c | /*@ requires n>0 && \valid(s+(0..n-1)) && \valid(t+(0..n-1));
assigns \nothing;
behavior success:
assumes \forall integer i; 0<=i<n ==> s[i]==t[i];
ensures \result == 1;
behavior failure:
assumes \exists integer i; 0<=i<n && t[i]!=s[i];
ensures \result == 0;
complete behaviors su... |
/*@ requires n>0 && \valid(s+(0..n-1)) && \valid(t+(0..n-1));
assigns \nothing;
behavior success:
assumes \forall integer i; 0<=i<n ==> s[i]==t[i];
ensures \result == 1;
behavior failure:
assumes \exists integer i; 0<=i<n && t[i]!=s[i];
ensures \result == 0;
complete behaviors ... | int compare(int s[], int t[], int n){
/*@ loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> s[j]==t[j];
loop invariant i == n ==> (\forall integer k; 0<=k<n ==> s[k] == t[k]);
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++){
if(s[i]!=t[i]) return 0;
}
r... | true | 21 | 21 | int compare(int s[], int t[], int n){
/*@ loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> s[j]==t[j];
loop invariant i == n ==> (\forall integer k; 0<=k<n ==> s[k] == t[k]);
loop assigns i;
loop variant n-i;
*/
for(int i=0;i<n;i++){
if(s[i]!=t[i]) return 0;
}
r... | /*@ requires n>0 && \valid(s+(0..n-1)) && \valid(t+(0..n-1));
assigns \nothing;
behavior success:
assumes \forall integer i; 0<=i<n ==> s[i]==t[i];
ensures \result == 1;
behavior failure:
assumes \exists integer i; 0<=i<n && t[i]!=s[i];
ensures \result == 0;
complete behaviors su... | |
frama_c_files_v2/test_frama_c_1199.c | /*@
requires \valid(a) && \valid_read(b);
requires \separated(a,b);
requires -10000000<*a<10000000 && -10000000<*b<10000000;
assigns *a;
ensures *b != 0 ==> *a==0;
ensures *b == 0 ==> *a==\old(*a);
*/
void reset_1st_if_2nd_is_true(int* a,int const* b){
if(*b){
*a =0;
//@ assert *a==0;
}
}
int main(){
int a... |
/*@
requires \valid(a) && \valid_read(b);
requires \separated(a,b);
requires -10000000<*a<10000000 && -10000000<*b<10000000;
assigns *a;
ensures *b != 0 ==> *a==0;
ensures *b == 0 ==> *a==\old(*a);
*/ | void reset_1st_if_2nd_is_true(int* a,int const* b){
if(*b){
*a =0;
//@ assert *a==0;
}
} | true | 8 | 8 | void reset_1st_if_2nd_is_true(int* a,int const* b){
if(*b){
*a =0;
//@ assert *a==0;
}
} | /*@
requires \valid(a) && \valid_read(b);
requires \separated(a,b);
requires -10000000<*a<10000000 && -10000000<*b<10000000;
assigns *a;
ensures *b != 0 ==> *a==0;
ensures *b == 0 ==> *a==\old(*a);
*/ | |
frama_c_files_v2/test_frama_c_1791.c | /*@ ghost const int MYOBJECT_MYTAB_SIZE = 5; */
#define MYOBJECT_MYTAB_SIZE 5
typedef struct MyObject{
int id;
int myTab[MYOBJECT_MYTAB_SIZE];
}MyObject;
/*@ requires \valid(self);
requires Inv1 : self->id == 0;
assigns self->id, self->myTab[0..MYOBJECT_MYTAB_SIZE-1];
ensures self->id == 0;
ensur... |
/*@ ghost const int MYOBJECT_MYTAB_SIZE = 5; */
#define MYOBJECT_MYTAB_SIZE 5
typedef struct MyObject{
int id;
int myTab[MYOBJECT_MYTAB_SIZE];
}MyObject;
/*@ requires \valid(self);
requires Inv1 : self->id == 0;
assigns self->id, self->myTab[0..MYOBJECT_MYTAB_SIZE-1];
ensures self->id == 0;
ens... | void test(MyObject* self){
self->id = 0;
/*@ loop invariant 0 <= i <= MYOBJECT_MYTAB_SIZE;
loop invariant \forall integer j; 0 <= j < i ==> self->myTab[j] == 0;
loop assigns i, self->myTab[0..MYOBJECT_MYTAB_SIZE-1];
loop variant MYOBJECT_MYTAB_SIZE - i;
*/
for (int i=0; i<MYOBJECT_MYTAB_SIZE;i++){
... | true | 19 | 19 | void test(MyObject* self){
self->id = 0;
/*@ loop invariant 0 <= i <= MYOBJECT_MYTAB_SIZE;
loop invariant \forall integer j; 0 <= j < i ==> self->myTab[j] == 0;
loop assigns i, self->myTab[0..MYOBJECT_MYTAB_SIZE-1];
loop variant MYOBJECT_MYTAB_SIZE - i;
*/
for (int i=0; i<MYOBJECT_MYTAB_SIZE;i++){
... | /*@ ghost const int MYOBJECT_MYTAB_SIZE = 5; */
#define MYOBJECT_MYTAB_SIZE 5
typedef struct MyObject{
int id;
int myTab[MYOBJECT_MYTAB_SIZE];
}MyObject;
/*@ requires \valid(self);
requires Inv1 : self->id == 0;
assigns self->id, self->myTab[0..MYOBJECT_MYTAB_SIZE-1];
ensures self->id == 0;
ensur... | |
frama_c_files_v2/test_frama_c_959.c | /* UNSAFE because `assigns *q;` and not `assigns **q;`. */
int g = 42;
/*@
requires \valid(p) && \valid(q) && \valid(*q);
assigns *p, **q, g;
*/
void foo(int* p, int** q) {
*p = 42;
**q = 42;
g = 42;
} | int g = 42;
/*@
requires \valid(p) && \valid(q) && \valid(*q);
assigns *p, **q, g;
*/ | void foo(int* p, int** q) {
*p = 42;
**q = 42;
g = 42;
} | true | 8 | 8 | void foo(int* p, int** q) {
*p = 42;
**q = 42;
g = 42;
} | int g = 42;
/*@
requires \valid(p) && \valid(q) && \valid(*q);
assigns *p, **q, g;
*/ | |
frama_c_files_v2/test_frama_c_543.c | #include <stdio.h>
#include <stdlib.h>
/*@
requires n>=0;
requires n <= 0 || \valid_read(a + (0..n-1));
assigns \nothing;
behavior sorted:
assumes n <= 1 || (\forall integer k; 0 <= k < n-1 ==> a[k] <= a[k+1]);
ensures \result == 1;
behavior not_sorted:
assumes n > 1 && (\exists integer k; 0 <= k < n-1 &&... | #include <stdio.h>
#include <stdlib.h>
/*@
requires n>=0;
requires n <= 0 || \valid_read(a + (0..n-1));
assigns \nothing;
behavior sorted:
assumes n <= 1 || (\forall integer k; 0 <= k < n-1 ==> a[k] <= a[k+1]);
ensures \result == 1;
behavior not_sorted:
assumes n > 1 && (\exists integer k; 0 <= k < n-1 &&... | int arraySorted(int a[], int n){
int i = 0;
if (n <= 1) return 1;
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer k; 0 <= k < i ==> a[k] <= a[k+1];
loop assigns i;
loop variant n - i;
*/
while (i < n-1){
/*@ assert i < n; */
if(a[i] > a[i+1]){
return 0;
}
i = i + 1;
}
r... | true | 23 | 23 | int arraySorted(int a[], int n){
int i = 0;
if (n <= 1) return 1;
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer k; 0 <= k < i ==> a[k] <= a[k+1];
loop assigns i;
loop variant n - i;
*/
while (i < n-1){
/*@ assert i < n; */
if(a[i] > a[i+1]){
return 0;
}
i = i + 1;
}
r... | #include <stdio.h>
#include <stdlib.h>
/*@
requires n>=0;
requires n <= 0 || \valid_read(a + (0..n-1));
assigns \nothing;
behavior sorted:
assumes n <= 1 || (\forall integer k; 0 <= k < n-1 ==> a[k] <= a[k+1]);
ensures \result == 1;
behavior not_sorted:
assumes n > 1 && (\exists integer k; 0 <= k < n-1 &&... | |
frama_c_files_v2/test_frama_c_2290.c | /*@ requires a < 2147483647 && a >= -1;
ensures (a >= 0) ==> (\result == a + 1);
ensures (a < 0) ==> (\result == 0);
*/
int plus_one(int a) {
if (a >= 0) {
return a + 1;
} else {
return 0;
}
} |
/*@ requires a < 2147483647 && a >= -1;
ensures (a >= 0) ==> (\result == a + 1);
ensures (a < 0) ==> (\result == 0);
*/ | int plus_one(int a) {
if (a >= 0) {
return a + 1;
} else {
return 0;
}
} | true | 5 | 5 | int plus_one(int a) {
if (a >= 0) {
return a + 1;
} else {
return 0;
}
} | /*@ requires a < 2147483647 && a >= -1;
ensures (a >= 0) ==> (\result == a + 1);
ensures (a < 0) ==> (\result == 0);
*/ | |
frama_c_files_v2/test_frama_c_1418.c | /* Generated by Frama-C */
/*@ ensures \result == 0;
assigns \nothing; */
int f(int x)
{
x = 0;
return x;
}
int Y = 1;
/*@ ensures \result == Y;
assigns \nothing; */
int g(int x)
{
return Y;
}
/*@ ensures \result == 0;
assigns \nothing; */
int h(void)
{
int __retres;
__retres = 0;
return __r... |
/*@ ensures \result == 0;
assigns \nothing; */ | int f(int x)
{
x = 0;
return x;
} | true | 4 | 4 | int f(int x)
{
x = 0;
return x;
} | /*@ ensures \result == 0;
assigns \nothing; */ | |
frama_c_files_v2/test_frama_c_1418.c | /* Generated by Frama-C */
/*@ ensures \result == 0;
assigns \nothing; */
int f(int x)
{
x = 0;
return x;
}
int Y = 1;
/*@ ensures \result == Y;
assigns \nothing; */
int g(int x)
{
return Y;
}
/*@ ensures \result == 0;
assigns \nothing; */
int h(void)
{
int __retres;
__retres = 0;
return __r... |
/*@ ensures \result == 0;
assigns \nothing; */
int f(int x)
{
x = 0;
return x;
}
int Y = 1;
/*@ ensures \result == Y;
assigns \nothing; */
int g(int x)
{
return Y;
}
/*@ ensures \result == 0;
assigns \nothing; */ | int h(void)
{
int __retres;
__retres = 0;
return __retres;
} | true | 12 | 12 | int h(void)
{
int __retres;
__retres = 0;
return __retres;
} | /*@ ensures \result == 0;
assigns \nothing; */
int f(int x)
{
x = 0;
return x;
}
int Y = 1;
/*@ ensures \result == Y;
assigns \nothing; */
int g(int x)
{
return Y;
}
/*@ ensures \result == 0;
assigns \nothing; */ | |
frama_c_files_v2/test_frama_c_1969.c | int x;
//@ predicate p(integer n) = n > 0 ;
//@ predicate p_array(int t[]) = t[0];
/*@ axiomatic Q {
@ predicate q(int t[]);
@
@ axiom q_ax: \forall int t[]; t[0] == 0 ==> q(t);
@ } @*/
/*@ assigns x; */
void f() {
/*@ ghost */ int i = 0;
/*@ loop assigns i;
loop invariant i >= 0;
... | int x;
/*@ axiomatic Q {
@ predicate q(int t[]);
@
@ axiom q_ax: \forall int t[]; t[0] == 0 ==> q(t);
@ } @*/
/*@ assigns x; */ | void f() {
/*@ ghost */ int i = 0;
/*@ loop assigns i;
loop invariant i >= 0;
loop variant 100 - i;
*/
for (;;) {
if(i > 99) break;
i++;
}
/*@ ghost */ i = 0;
/*@ loop assigns x, i;
loop invariant i >= 0;
loop variant 100 - i;
*/
for(;;) {
L2: x = 0;
if(i... | true | 18 | 18 | void f() {
/*@ ghost */ int i = 0;
/*@ loop assigns i;
loop invariant i >= 0;
loop variant 100 - i;
*/
for (;;) {
if(i > 99) break;
i++;
}
/*@ ghost */ i = 0;
/*@ loop assigns x, i;
loop invariant i >= 0;
loop variant 100 - i;
*/
for(;;) {
L2: x = 0;
if(i... | int x;
/*@ axiomatic Q {
@ predicate q(int t[]);
@
@ axiom q_ax: \forall int t[]; t[0] == 0 ==> q(t);
@ } @*/
/*@ assigns x; */ | |
frama_c_files_v2/test_frama_c_2772.c | /*@ axiomatic GCD {
logic integer GCD(integer x, integer y);
axiom gcd_pos:
\forall integer x, y; x > 0 && y > 0 ==> GCD(x, y) > 0;
axiom gcd_recursive:
\forall integer x, y; x > 0 && y > 0 ==> GCD(x, y) == (x == y ? x : (x > y ? GCD(x - y, y) : GCD(x, y - x)));
}*/
/*@ requires x > 0 && y > 0;
@ ensur... |
/*@ axiomatic GCD {
logic integer GCD(integer x, integer y);
axiom gcd_pos:
\forall integer x, y; x > 0 && y > 0 ==> GCD(x, y) > 0;
axiom gcd_recursive:
\forall integer x, y; x > 0 && y > 0 ==> GCD(x, y) == (x == y ? x : (x > y ? GCD(x - y, y) : GCD(x, y - x)));
}*/
/*@ requires x > 0 && y > 0;
@ ens... | int gcd(int x, int y){
int a = x;
int b = y;
/*@ loop assigns a,b;
@ loop invariant a > 0;
@ loop invariant b > 0;
@ loop invariant GCD(a,b) == GCD(x,y);
@ loop variant a*b;
*/
while(a != b){
if(a > b){
a = a - b;
}
else{
b = b - a;
}
}
return a;
} | true | 17 | 17 | int gcd(int x, int y){
int a = x;
int b = y;
/*@ loop assigns a,b;
@ loop invariant a > 0;
@ loop invariant b > 0;
@ loop invariant GCD(a,b) == GCD(x,y);
@ loop variant a*b;
*/
while(a != b){
if(a > b){
a = a - b;
}
else{
b = b - a;
}
}
return a;
} | /*@ axiomatic GCD {
logic integer GCD(integer x, integer y);
axiom gcd_pos:
\forall integer x, y; x > 0 && y > 0 ==> GCD(x, y) > 0;
axiom gcd_recursive:
\forall integer x, y; x > 0 && y > 0 ==> GCD(x, y) == (x == y ? x : (x > y ? GCD(x - y, y) : GCD(x, y - x)));
}*/
/*@ requires x > 0 && y > 0;
@ ensur... | |
frama_c_files_v2/test_frama_c_2747.c | /*@ requires \valid(t+(0..n-1)) && n>0;
ensures 0<=\result<n;
ensures \forall integer i; 0<=i<n ==> t[\result] <= t[i];
*/
int minIndex(int t[], int n){
int index=0;
/*@ loop invariant 0<=i<=n;
loop invariant 0<=index<n;
loop invariant \forall integer j; 0<=j<i ==> t[index] <= t[j];
loop ... |
/*@ requires \valid(t+(0..n-1)) && n>0;
ensures 0<=\result<n;
ensures \forall integer i; 0<=i<n ==> t[\result] <= t[i];
*/ | int minIndex(int t[], int n){
int index=0;
/*@ loop invariant 0<=i<=n;
loop invariant 0<=index<n;
loop invariant \forall integer j; 0<=j<i ==> t[index] <= t[j];
loop assigns index,i;
loop variant n-i;
*/
for(int i=0;i<n;i++){
if(t[i]<t[index]) {
index=i;
}
}
return ind... | true | 16 | 16 | int minIndex(int t[], int n){
int index=0;
/*@ loop invariant 0<=i<=n;
loop invariant 0<=index<n;
loop invariant \forall integer j; 0<=j<i ==> t[index] <= t[j];
loop assigns index,i;
loop variant n-i;
*/
for(int i=0;i<n;i++){
if(t[i]<t[index]) {
index=i;
}
}
return ind... | /*@ requires \valid(t+(0..n-1)) && n>0;
ensures 0<=\result<n;
ensures \forall integer i; 0<=i<n ==> t[\result] <= t[i];
*/ | |
frama_c_files_v2/test_frama_c_1548.c | /*@ lemma mean : \forall integer x, y; x <= y ==> x <= (x+y)/2 <= y; */
/*@ requires n >= 0 && \valid(t+(0..n-1));
@ ensures -1 <= \result <= n-1;
@ assigns \nothing;
@*/
int binary_search4(int* t, int n, int v) {
int l = 0, u = n-1, p = -1;
/*@ loop invariant
@ 0 <= l && u < n && -1 <= p <= n-1;
@ loop invariant \fora... |
/*@ lemma mean : \forall integer x, y; x <= y ==> x <= (x+y)/2 <= y; */
/*@ requires n >= 0 && \valid(t+(0..n-1));
@ ensures -1 <= \result <= n-1;
@ assigns \nothing;
@*/ | int binary_search4(int* t, int n, int v) {
int l = 0, u = n-1, p = -1;
/*@ loop invariant
@ 0 <= l && u < n && -1 <= p <= n-1;
@ loop invariant \forall integer i; l <= i <= u ==> \valid_read(t+i);
@ loop assigns l, u, p;
@ loop invariant l <= u+1;
@ loop variant u - l;
@*/
while (l <= u) {
int m = l + (u - l) / 2;
if (... | true | 24 | 24 | int binary_search4(int* t, int n, int v) {
int l = 0, u = n-1, p = -1;
/*@ loop invariant
@ 0 <= l && u < n && -1 <= p <= n-1;
@ loop invariant \forall integer i; l <= i <= u ==> \valid_read(t+i);
@ loop assigns l, u, p;
@ loop invariant l <= u+1;
@ loop variant u - l;
@*/
while (l <= u) {
int m = l + (u - l) / 2;
if (... | /*@ lemma mean : \forall integer x, y; x <= y ==> x <= (x+y)/2 <= y; */
/*@ requires n >= 0 && \valid(t+(0..n-1));
@ ensures -1 <= \result <= n-1;
@ assigns \nothing;
@*/ | |
frama_c_files_v2/test_frama_c_852.c | /*@
requires -10 <= x <= 0 ;
requires 0 <= y <= 5 ;
ensures -5 <= \result <= 10 ;
assigns \nothing;
*/
int function(int x, int y) {
int res ;
y += 10 ;
x -= 5 ;
res = x + y ;
//@ assert -15 <= res <= 15;
return res ;
} |
/*@
requires -10 <= x <= 0 ;
requires 0 <= y <= 5 ;
ensures -5 <= \result <= 10 ;
assigns \nothing;
*/ | int function(int x, int y) {
int res ;
y += 10 ;
x -= 5 ;
res = x + y ;
//@ assert -15 <= res <= 15;
return res ;
} | true | 11 | 11 | int function(int x, int y) {
int res ;
y += 10 ;
x -= 5 ;
res = x + y ;
//@ assert -15 <= res <= 15;
return res ;
} | /*@
requires -10 <= x <= 0 ;
requires 0 <= y <= 5 ;
ensures -5 <= \result <= 10 ;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1441.c | #include<limits.h>
/*@ requires x >= 0 || x > INT_MIN;
assigns \nothing;
behavior pos:
assumes x >= 0;
ensures \result == x;
behavior neg:
assumes x < 0;
ensures \result == -x;
complete behaviors pos, neg;
//disjoint behaviors pos, neg; // removed because x == 0 makes both po... | #include<limits.h>
/*@ requires x >= 0 || x > INT_MIN;
assigns \nothing;
behavior pos:
assumes x >= 0;
ensures \result == x;
behavior neg:
assumes x < 0;
ensures \result == -x;
complete behaviors pos, neg;
//disjoint behaviors pos, neg; // removed because x == 0 makes both p... | int abs ( int x ) {
if ( x >=0 )
return x ;
return -x ;
} | true | 8 | 8 | int abs ( int x ) {
if ( x >=0 )
return x ;
return -x ;
} | #include<limits.h>
/*@ requires x >= 0 || x > INT_MIN;
assigns \nothing;
behavior pos:
assumes x >= 0;
ensures \result == x;
behavior neg:
assumes x < 0;
ensures \result == -x;
complete behaviors pos, neg;
//disjoint behaviors pos, neg; // removed because x == 0 makes both p... | |
frama_c_files_v2/test_frama_c_194.c | /*@
@ requires \valid(p);
@ requires \valid(q);
@ requires -1000 <= *p <= 10000;
@ requires -1000 <= *q <= 10000;
@ assigns *p, *q;
@ ensures *p == \old(*q);
@ ensures *q == \old(*p);
*/
void swap(int *p, int *q) {
int temp = *p;
*p = *q;
*q = temp;
} |
/*@
@ requires \valid(p);
@ requires \valid(q);
@ requires -1000 <= *p <= 10000;
@ requires -1000 <= *q <= 10000;
@ assigns *p, *q;
@ ensures *p == \old(*q);
@ ensures *q == \old(*p);
*/ | void swap(int *p, int *q) {
int temp = *p;
*p = *q;
*q = temp;
} | true | 10 | 10 | void swap(int *p, int *q) {
int temp = *p;
*p = *q;
*q = temp;
} | /*@
@ requires \valid(p);
@ requires \valid(q);
@ requires -1000 <= *p <= 10000;
@ requires -1000 <= *q <= 10000;
@ assigns *p, *q;
@ ensures *p == \old(*q);
@ ensures *q == \old(*p);
*/ | |
frama_c_files_v2/test_frama_c_2288.c | #include <limits.h>
/*@
requires x != INT_MIN;
assigns \nothing;
ensures x >= 0 ==> \result == x;
ensures x < 0 ==> \result == -x;
*/
int abs(int x) {
if (x >= 0) {
return x;
} else {
return -x;
}
}
| #include <limits.h>
/*@
requires x != INT_MIN;
assigns \nothing;
ensures x >= 0 ==> \result == x;
ensures x < 0 ==> \result == -x;
*/ | int abs(int x) {
if (x >= 0) {
return x;
} else {
return -x;
}
} | true | 7 | 7 | int abs(int x) {
if (x >= 0) {
return x;
} else {
return -x;
}
} | #include <limits.h>
/*@
requires x != INT_MIN;
assigns \nothing;
ensures x >= 0 ==> \result == x;
ensures x < 0 ==> \result == -x;
*/ | |
frama_c_files_v2/test_frama_c_1255.c | /* run.config
OPT: -rpp
*/
/*@ requires \valid(t+(0..n-1));
@ requires n >= 1;
@ requires \forall integer k; 0 <= k < n ==> 0 <= t[k];
@ ensures \forall integer k; 0 <= k < n ==> \result >= t[k];
@ ensures \exists integer k; 0 <= k < n && \result == t[k];
@ assigns \nothing;
*/
int f(int t[], int n){
in... |
/*@ requires \valid(t+(0..n-1));
@ requires n >= 1;
@ requires \forall integer k; 0 <= k < n ==> 0 <= t[k];
@ ensures \forall integer k; 0 <= k < n ==> \result >= t[k];
@ ensures \exists integer k; 0 <= k < n && \result == t[k];
@ assigns \nothing;
*/ | int f(int t[], int n){
int max = t[0];
int i = 0;
/*@ loop assigns i,max;
@ loop invariant 0 <= i <= n;
@ loop invariant \forall integer k; 0 <= k < i ==> max >= t[k];
@ loop invariant \exists integer k; 0 <= k < n && max == t[k];
@ loop variant n-i;
*/
while(i < n){
if(t[i] > max){
... | true | 18 | 18 | int f(int t[], int n){
int max = t[0];
int i = 0;
/*@ loop assigns i,max;
@ loop invariant 0 <= i <= n;
@ loop invariant \forall integer k; 0 <= k < i ==> max >= t[k];
@ loop invariant \exists integer k; 0 <= k < n && max == t[k];
@ loop variant n-i;
*/
while(i < n){
if(t[i] > max){
... | /*@ requires \valid(t+(0..n-1));
@ requires n >= 1;
@ requires \forall integer k; 0 <= k < n ==> 0 <= t[k];
@ ensures \forall integer k; 0 <= k < n ==> \result >= t[k];
@ ensures \exists integer k; 0 <= k < n && \result == t[k];
@ assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2255.c | /*@
requires n>0;
requires \valid_read(a+(0..n-1));
ensures \forall integer k; 0<=k<n ==> \result>=a[k];
*/
int max(int a[], int n){
int m=a[0];
/*@
loop invariant \forall integer j; 0<=j<i ==> m>=a[j];
loop invariant 1<=i<=n;
loop assigns i,m;
loop variant n-i;
*/
for(int i=1;i<n;i++){
... |
/*@
requires n>0;
requires \valid_read(a+(0..n-1));
ensures \forall integer k; 0<=k<n ==> \result>=a[k];
*/ | int max(int a[], int n){
int m=a[0];
/*@
loop invariant \forall integer j; 0<=j<i ==> m>=a[j];
loop invariant 1<=i<=n;
loop assigns i,m;
loop variant n-i;
*/
for(int i=1;i<n;i++){
if(m<a[i]){
m=a[i];
}
}
return m;
} | true | 14 | 14 | int max(int a[], int n){
int m=a[0];
/*@
loop invariant \forall integer j; 0<=j<i ==> m>=a[j];
loop invariant 1<=i<=n;
loop assigns i,m;
loop variant n-i;
*/
for(int i=1;i<n;i++){
if(m<a[i]){
m=a[i];
}
}
return m;
} | /*@
requires n>0;
requires \valid_read(a+(0..n-1));
ensures \forall integer k; 0<=k<n ==> \result>=a[k];
*/ | |
frama_c_files_v2/test_frama_c_2672.c | /*@ requires 0<x<=100 && 0<y<=100;
ensures \result == x*y;
ensures 0<\result<=10000;
assigns \nothing;
*/
int mul(int x, int y){
int mul=0;
/*@
loop invariant 0<=i<=y;
loop invariant mul==x*i;
loop assigns mul,i;
loop variant y-i;
*/
for(int i=0;i<y;i++)
mul+=x;
return mul;
} |
/*@ requires 0<x<=100 && 0<y<=100;
ensures \result == x*y;
ensures 0<\result<=10000;
assigns \nothing;
*/ | int mul(int x, int y){
int mul=0;
/*@
loop invariant 0<=i<=y;
loop invariant mul==x*i;
loop assigns mul,i;
loop variant y-i;
*/
for(int i=0;i<y;i++)
mul+=x;
return mul;
} | true | 15 | 15 | int mul(int x, int y){
int mul=0;
/*@
loop invariant 0<=i<=y;
loop invariant mul==x*i;
loop assigns mul,i;
loop variant y-i;
*/
for(int i=0;i<y;i++)
mul+=x;
return mul;
} | /*@ requires 0<x<=100 && 0<y<=100;
ensures \result == x*y;
ensures 0<\result<=10000;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1265.c | /* 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; */
... |
/*@ behavior bhv:
exits never: \false;
complete behaviors bhv;
disjoint behaviors bhv; */ | int logic(int f1)
{
int V1;
V1 = 0;
if (f1) goto end;
V1 ++;
/*@ assert property: V1 ? 1: 0; */ ;
end: ;
return V1;
} | true | 7 | 7 | int logic(int f1)
{
int V1;
V1 = 0;
if (f1) goto end;
V1 ++;
/*@ assert property: V1 ? 1: 0; */ ;
end: ;
return V1;
} | /*@ behavior bhv:
exits never: \false;
complete behaviors bhv;
disjoint behaviors bhv; */ | |
frama_c_files_v2/test_frama_c_1808.c | /*@
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 && ... |
/*@
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 &&... | int check(int *a, int *b, int n) {
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer k; 0 <= k < i ==> a[k] == b[k];
loop assigns i;
loop variant n - i;
*/
for (int i = 0; i < n; i++) {
if (a[i] != b[i]) {
return 0;
}
}
return ... | true | 19 | 19 | int check(int *a, int *b, int n) {
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer k; 0 <= k < i ==> a[k] == b[k];
loop assigns i;
loop variant n - i;
*/
for (int i = 0; i < n; i++) {
if (a[i] != b[i]) {
return 0;
}
}
return ... | /*@
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 && b... | |
frama_c_files_v2/test_frama_c_467.c | 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... | 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) &&
(\for... | int eq_VC(vc v1, vc v2) {
if (v1.n != v2.n) return 0;
/*@ loop invariant (0 <= i <= v1.n);
loop invariant \forall int j; (0 <= j < i) ==> v1.a[j]==v2.a[j];
loop assigns i;
loop variant (v1.n-i); */
for (int i = 0; i < v1.n; i++) {
if (v1.a[i] != v2.a[i]) return 0;
}
retur... | true | 19 | 19 | int eq_VC(vc v1, vc v2) {
if (v1.n != v2.n) return 0;
/*@ loop invariant (0 <= i <= v1.n);
loop invariant \forall int j; (0 <= j < i) ==> v1.a[j]==v2.a[j];
loop assigns i;
loop variant (v1.n-i); */
for (int i = 0; i < v1.n; i++) {
if (v1.a[i] != v2.a[i]) return 0;
}
retur... | 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) &&
(\for... | |
frama_c_files_v2/test_frama_c_889.c | /*@
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... |
/*@
requires n>0;
requires \valid(a + (0..n-1));
ensures \forall integer i; 0<= i<n ==> a[n-1] >= a[i];
assigns a[0..n-1];
*/ | void selectioninnerloop(int a[], int n)
{
int max_idx = 0;
/*@
loop invariant 0 <= j <= n;
loop invariant 0 <= max_idx < n;
loop invariant \forall integer i; 0 <= i < j ==> a[max_idx] >= a[i];
loop assigns max_idx, j;
loop variant n - j;
*/
for (int j = 0; j < n; j++)
{
if (... | true | 24 | 24 | void selectioninnerloop(int a[], int n)
{
int max_idx = 0;
/*@
loop invariant 0 <= j <= n;
loop invariant 0 <= max_idx < n;
loop invariant \forall integer i; 0 <= i < j ==> a[max_idx] >= a[i];
loop assigns max_idx, j;
loop variant n - j;
*/
for (int j = 0; j < n; j++)
{
if (... | /*@
requires n>0;
requires \valid(a + (0..n-1));
ensures \forall integer i; 0<= i<n ==> a[n-1] >= a[i];
assigns a[0..n-1];
*/ | |
frama_c_files_v2/test_frama_c_1110.c | /*@
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;
... |
/*@
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 ;
} | true | 10 | 10 | int max_ptr(int *a, int *b){
return (*a < *b) ? *b : *a ;
} | /*@
requires \valid_read(a) && \valid_read(b);
requires \separated(a, b);
assigns \nothing;
ensures \result >= *a && \result >= *b;
ensures \result == *a || \result == *b;
*/ | |
frama_c_files_v2/test_frama_c_2012.c | /* 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 {
... | __inline static unsigned int __bswap_32(unsigned int __bsx)
{
unsigned int tmp;
tmp = __builtin_bswap32(__bsx);
return tmp;
} | true | 2 | 2 | __inline static unsigned int __bswap_32(unsigned int __bsx)
{
unsigned int tmp;
tmp = __builtin_bswap32(__bsx);
return tmp;
} | |||
frama_c_files_v2/test_frama_c_116.c | //@ predicate is_pos(int x) = x > 0;
//@ predicate is_nat(int x) = x >= 0;
/*@ requires is_pos(x);
ensures is_nat(\result);
*/
int minus1(int x) {
return x-1;
}
|
/*@ requires x > 0;
ensures \result >= 0;
*/ | int minus1(int x) {
return x-1;
} | true | 4 | 4 | int minus1(int x) {
return x-1;
} | /*@ requires x > 0;
ensures \result >= 0;
*/ | |
frama_c_files_v2/test_frama_c_2722.c | // __in struct pointer
typedef struct s
{
int a;
int b;
} S;
/*@ requires \valid(ps);
@ assigns ps->b;
*/
void f6(S *ps)
{
if (ps)
{
if (ps->a == 0)
{
ps->b = 0;
}
else
{
ps->b = 1;
}
}
}
| typedef struct s
{
int a;
int b;
} S;
/*@ requires \valid(ps);
@ assigns ps->b;
*/ | void f6(S *ps)
{
if (ps)
{
if (ps->a == 0)
{
ps->b = 0;
}
else
{
ps->b = 1;
}
}
} | true | 7 | 7 | void f6(S *ps)
{
if (ps)
{
if (ps->a == 0)
{
ps->b = 0;
}
else
{
ps->b = 1;
}
}
} | typedef struct s
{
int a;
int b;
} S;
/*@ requires \valid(ps);
@ assigns ps->b;
*/ | |
frama_c_files_v2/test_frama_c_1996.c |
/*@ ensures *q == \old(*p) && *p == \old(*q) ;
assigns *p,*q;
*/
void f (int *p,int*q) {
int t = *p;
*p = *q;
*q = t;
return;
}
|
/*@ requires \valid(p) && \valid(q);
ensures *q == \old(*p) && *p == \old(*q) ;
assigns *p,*q;
*/ | void f (int *p,int*q) {
int t = *p;
*p = *q;
*q = t;
return;
} | true | 9 | 9 | void f (int *p,int*q) {
int t = *p;
*p = *q;
*q = t;
return;
} | /*@ requires \valid(p) && \valid(q);
ensures *q == \old(*p) && *p == \old(*q) ;
assigns *p,*q;
*/ | |
frama_c_files_v2/test_frama_c_1796.c |
typedef struct vector
{
int* addr;
unsigned int sz;
unsigned int cap;
} vector;
/*@
predicate invariant{L}(vector* v) =
v->sz <= v->cap &&
\valid(v->addr + (0..v->cap-1)) &&
\separated(v, v->addr + (0..v->cap-1));
predicate full{L}(vector* v) = (v->sz == v->cap);
*/
/*@
... | typedef struct vector
{
int* addr;
unsigned int sz;
unsigned int cap;
} vector;
/*@
predicate invariant{L}(vector* v) =
v->sz <= v->cap &&
\valid(v->addr + (0..v->cap-1)) &&
\separated(v, v->addr + (0..v->cap-1));
predicate full{L}(vector* v) = (v->sz == v->cap);
*/
/*@
... | int push_back(vector* v, int x)
{
if (v->sz < v->cap)
{
v->addr[v->sz] = x;
v->sz++;
return 1;
}
else
{
return 0;
}
} | true | 28 | 28 | int push_back(vector* v, int x)
{
if (v->sz < v->cap)
{
v->addr[v->sz] = x;
v->sz++;
return 1;
}
else
{
return 0;
}
} | typedef struct vector
{
int* addr;
unsigned int sz;
unsigned int cap;
} vector;
/*@
predicate invariant{L}(vector* v) =
v->sz <= v->cap &&
\valid(v->addr + (0..v->cap-1)) &&
\separated(v, v->addr + (0..v->cap-1));
predicate full{L}(vector* v) = (v->sz == v->cap);
*/
/*@
... | |
frama_c_files_v2/test_frama_c_1016.c | /*@
requires 0 <= N <= 1000000000;
assigns \nothing;
ensures \result * \result <= N ;
ensures N < (\result+1) * (\result+1);
*/
int root(int N){
int R = 0;
/*@
loop invariant 0 <= R * R <= N;
loop assigns R;
loop variant N-R;
*/
while(((R+1)*(R+1)) <= N) {
R = R + 1;
}
return R;
} |
/*@
requires 0 <= N <= 1000000000;
assigns \nothing;
ensures \result * \result <= N;
ensures N < (\result+1) * (\result+1);
*/ | int root(int N){
int R = 0;
/*@
loop invariant 0 <= R <= N && R * R <= N;
loop assigns R;
loop variant N - R * R;
*/
while(((R+1) <= 31623) && ((R+1)*(R+1)) <= N) {
R = R + 1;
}
return R;
} | true | 16 | 16 | int root(int N){
int R = 0;
/*@
loop invariant 0 <= R <= N && R * R <= N;
loop assigns R;
loop variant N - R * R;
*/
while(((R+1) <= 31623) && ((R+1)*(R+1)) <= N) {
R = R + 1;
}
return R;
} | /*@
requires 0 <= N <= 1000000000;
assigns \nothing;
ensures \result * \result <= N;
ensures N < (\result+1) * (\result+1);
*/ | |
frama_c_files_v2/test_frama_c_1787.c | typedef struct _singly_list {
int elt;
struct _singly_list* next;
} singly_list_t;
/*@
@ type list<A> = Nul | Cons(A, list<A>);
@
@
*/
/*@
@ inductive wf_singly_list{L}(singly_list_t* lst){
@ case empty: \forall singly_list_t* lst; lst == \null ==> wf_singly_list(lst);
@ case non_empty: \forall ... | typedef struct _singly_list {
int elt;
struct _singly_list* next;
} singly_list_t;
/*@
@ type list<A> = Nul | Cons(A, list<A>);
@
@
*/
/*@
@ inductive wf_singly_list{L}(singly_list_t* lst){
@ case empty: \forall singly_list_t* lst; lst == \null ==> wf_singly_list(lst);
@ case non_empty: \forall ... | int is_circular_singly_list(singly_list_t* lst) {
return 0;
} | true | 5 | 5 | int is_circular_singly_list(singly_list_t* lst) {
return 0;
} | typedef struct _singly_list {
int elt;
struct _singly_list* next;
} singly_list_t;
/*@
@ type list<A> = Nul | Cons(A, list<A>);
@
@
*/
/*@
@ inductive wf_singly_list{L}(singly_list_t* lst){
@ case empty: \forall singly_list_t* lst; lst == \null ==> wf_singly_list(lst);
@ case non_empty: \forall ... | |
frama_c_files_v2/test_frama_c_167.c | /*@ predicate valid_subseq{L}(int *x, integer left, integer right) =
@ left < right ==> \forall integer i, j; left <= i < right && left <= j < right ==> x[i] == x[j];
*/
/*@ requires 1 <= N <= 1000000;
@ requires \valid(x + (0..N-1));
@ ensures 1 <= \result <= N;
@ ensures \exists integer k; 0 <= k < N &&... |
/*@ predicate valid_subseq{L}(int *x, integer left, integer right) =
@ left < right ==> \forall integer i, j; left <= i < right && left <= j < right ==> x[i] == x[j];
*/
/*@ requires 1 <= N <= 1000000;
@ requires \valid(x + (0..N-1));
@ ensures 1 <= \result <= N;
@ ensures \exists integer k; 0 <= k <= N... | int countSameConsecutive(int N, int x[]) {
int best = 0, i = 0;
/*@ loop invariant 0 <= i <= N;
@ loop invariant i == 0 ==> best == 0;
@ loop invariant i > 0 ==> 1 <= best <= i;
@ loop invariant i > 0 ==> \exists integer k; 0 <= k <= i - best && valid_subseq(x, k, k + best);
@ loop assi... | true | 36 | 36 | int countSameConsecutive(int N, int x[]) {
int best = 0, i = 0;
/*@ loop invariant 0 <= i <= N;
@ loop invariant i == 0 ==> best == 0;
@ loop invariant i > 0 ==> 1 <= best <= i;
@ loop invariant i > 0 ==> \exists integer k; 0 <= k <= i - best && valid_subseq(x, k, k + best);
@ loop assi... | /*@ predicate valid_subseq{L}(int *x, integer left, integer right) =
@ left < right ==> \forall integer i, j; left <= i < right && left <= j < right ==> x[i] == x[j];
*/
/*@ requires 1 <= N <= 1000000;
@ requires \valid(x + (0..N-1));
@ ensures 1 <= \result <= N;
@ ensures \exists integer k; 0 <= k <= N -... | |
frama_c_files_v2/test_frama_c_225.c | #pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-variable"
int A, B, C;
#pragma GCC diagnostic pop
/*@ requires A==100 && B==100;
assigns A,B;
ensures C==0 ==> A==100 && B==100;
ensures C!=0 ==> A==C && B==C;*/
void bidon(){
if ( C != 0 ){
A = C;
B = C;
}
}
/*@ requires \va... | int A, B, C;
/*@ requires A==100 && B==100;
assigns A,B;
ensures C==0 ==> A==\old(A) && B==\old(B);
ensures C!=0 ==> A==C && B==C;*/ | void bidon(){
if ( C != 0 ){
A = C;
B = C;
}
} | true | 5 | 5 | void bidon(){
if ( C != 0 ){
A = C;
B = C;
}
} | int A, B, C;
/*@ requires A==100 && B==100;
assigns A,B;
ensures C==0 ==> A==\old(A) && B==\old(B);
ensures C!=0 ==> A==C && B==C;*/ | |
frama_c_files_v2/test_frama_c_225.c | #pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-variable"
int A, B, C;
#pragma GCC diagnostic pop
/*@ requires A==100 && B==100;
assigns A,B;
ensures C==0 ==> A==100 && B==100;
ensures C!=0 ==> A==C && B==C;*/
void bidon(){
if ( C != 0 ){
A = C;
B = C;
}
}
/*@ requires \va... |
/*@ requires \valid ( t +(0.. n -1)) && n >= 0;
@ assigns \nothing;
@ ensures \result == 1 <==> ( \forall integer i ; 0 <= i < n ==> t [ i ] == 0);
@ ensures \result == 0 <==> ( \exists integer i ; 0 <= i < n && t [ i ] != 0);
@*/ | int all_zeros(int t[], int n) {
int k;
/*@ loop invariant 0 <= k <= n;
@ loop invariant \forall integer i ; 0 <= i < k ==> t [ i ] == 0;
@ loop assigns k;
@ loop variant n-k;
*/
for(k = 0; k < n; k++) {
//@ assert 0 <= k < n;
if (t[k] != 0)
return 0;
}
//@ assert k == n;
... | true | 19 | 19 | int all_zeros(int t[], int n) {
int k;
/*@ loop invariant 0 <= k <= n;
@ loop invariant \forall integer i ; 0 <= i < k ==> t [ i ] == 0;
@ loop assigns k;
@ loop variant n-k;
*/
for(k = 0; k < n; k++) {
//@ assert 0 <= k < n;
if (t[k] != 0)
return 0;
}
//@ assert k == n;
... | /*@ requires \valid ( t +(0.. n -1)) && n >= 0;
@ assigns \nothing;
@ ensures \result == 1 <==> ( \forall integer i ; 0 <= i < n ==> t [ i ] == 0);
@ ensures \result == 0 <==> ( \exists integer i ; 0 <= i < n && t [ i ] != 0);
@*/ | |
frama_c_files_v2/test_frama_c_2676.c | /* a.h */
typedef struct s_t { int n; } t;
/*@ type invariant inv_t(t x) = x.n > 0; */
/* @ predicate p(int x) reads x; */
int i = 42;
/*@ predicate p{Here}(int x) = x >= i; */
/*@ axiomatic Bar {
logic integer li;
axiom init: li == 42;
} */
/*@ ensures i == 0;
assigns i; */
void test() { i = 0; }
/*@ axi... | int i = 42;
/*@ ensures i == 0;
assigns i; */ | void test() { i = 0; } | true | 4 | 4 | void test() { i = 0; } | int i = 42;
/*@ ensures i == 0;
assigns i; */ | |
frama_c_files_v2/test_frama_c_1726.c | #include <limits.h>
/* run.config
EXECNOW: make -s tests/aorai/Aorai_test.cmxs
OPT: -aorai-automata tests/aorai/test_acces_params.ya -aorai-test 1 -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
int status=0;
int rr=1;
//@ global invariant inv : 0<=rr<=5000;
/*@ requires rr<5000 &&... | int status=0;
/*@ assigns status, \result;
@ ensures \result == 3;
*/ | int opb () {
status=1;
return status*3;
} | true | 7 | 7 | int opb () {
status=1;
return status*3;
} | int status=0;
/*@ assigns status, \result;
@ ensures \result == 3;
*/ | |
frama_c_files_v2/test_frama_c_1418.c | /* Generated by Frama-C */
/*@ ensures \result == 0;
assigns \nothing; */
int f(int x)
{
x = 0;
return x;
}
int Y = 1;
/*@ ensures \result == Y;
assigns \nothing; */
int g(int x)
{
return Y;
}
/*@ ensures \result == 0;
assigns \nothing; */
int h(void)
{
int __retres;
__retres = 0;
return __r... | int Y = 1;
/*@ ensures \result == Y;
assigns \nothing; */ | int g(int x)
{
return Y;
} | true | 4 | 4 | int g(int x)
{
return Y;
} | int Y = 1;
/*@ ensures \result == Y;
assigns \nothing; */ | |
frama_c_files_v2/test_frama_c_1265.c | /* 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; */
... | #include "stdint.h"
/*@ ensures \result == 1; */ | int builtin_and_stdlib () {
int32_t x = 42;
Frama_C_show_each(x);
/*@ assert \true; */
return 1;
} | true | 4 | 4 | int builtin_and_stdlib () {
int32_t x = 42;
Frama_C_show_each(x);
/*@ assert \true; */
return 1;
} | #include "stdint.h"
/*@ ensures \result == 1; */ | |
frama_c_files_v2/test_frama_c_71.c | #define INT_MIN (-2147483648)
/*@ requires v != INT_MIN;
assigns \nothing;
ensures \result == \abs(v);
*/
int abs(int v)
{
return v >= 0 ? v : -v;
}
| #define INT_MIN (-2147483648)
/*@ requires v != INT_MIN;
assigns \nothing;
ensures \result == (v >= 0 ? v : -v);
*/ | int abs(int v)
{
return v >= 0 ? v : -v;
} | true | 6 | 6 | int abs(int v)
{
return v >= 0 ? v : -v;
} | #define INT_MIN (-2147483648)
/*@ requires v != INT_MIN;
assigns \nothing;
ensures \result == (v >= 0 ? v : -v);
*/ | |
frama_c_files_v2/test_frama_c_2240.c | #define INT_MAX 2147483647
/*@ requires (a * 2) <= INT_MAX;
assigns \nothing;
ensures \result == a * 2;
*/
unsigned lshift(unsigned a)
{
return a << 1;
}
| #define INT_MAX 2147483647
/*@ requires (a <= INT_MAX / 2); // Corrected: avoid potential overflow in the requires clause
assigns \nothing;
ensures \result == a * 2;
*/ | unsigned lshift(unsigned a)
{
return a << 1;
} | true | 4 | 4 | unsigned lshift(unsigned a)
{
return a << 1;
} | #define INT_MAX 2147483647
/*@ requires (a <= INT_MAX / 2); // Corrected: avoid potential overflow in the requires clause
assigns \nothing;
ensures \result == a * 2;
*/ | |
frama_c_files_v2/test_frama_c_2853.c |
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]; };
... | struct S {
int t1[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;
} | true | 4 | 4 | void f(struct T *s) {
s->t[0]->t1[0] = 1;
} | struct S {
int t1[2];
};
struct T {
struct S *t[2];
};
/*@ requires \valid(s) && \valid(s->t[0]);
@*/ | |
frama_c_files_v2/test_frama_c_2236.c | #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... | #include <string.h>
/*@
requires ((strlen(x1647)>=0) &&
\valid(x1647+(0..(strlen(x1647)+1)-1)));
assigns \nothing;
ensures ((0==\result) || ((strlen(\result)>=0) &&
\valid(\result+(0..(strlen(\result)+1)-1))));
*/ | char * p_HTTP(char * x1647) {
char *x1649 = x1647;
int x1654 = 1/*true*/;
char x1655 = '\0';
char *x1656 = 0/*null*/;
char x1650 = x1647[0];
int x1651 = x1650 == '\0';
if (x1651) {
x1656 = x1647;
} else {
int x1652 = x1650 == 'H';
if (x1652) {
x1654 = 0/*false*/;
x1655 = x165... | true | 39 | 39 | char * p_HTTP(char * x1647) {
char *x1649 = x1647;
int x1654 = 1/*true*/;
char x1655 = '\0';
char *x1656 = 0/*null*/;
char x1650 = x1647[0];
int x1651 = x1650 == '\0';
if (x1651) {
x1656 = x1647;
} else {
int x1652 = x1650 == 'H';
if (x1652) {
x1654 = 0/*false*/;
x1655 = x165... | #include <string.h>
/*@
requires ((strlen(x1647)>=0) &&
\valid(x1647+(0..(strlen(x1647)+1)-1)));
assigns \nothing;
ensures ((0==\result) || ((strlen(\result)>=0) &&
\valid(\result+(0..(strlen(\result)+1)-1))));
*/ | |
frama_c_files_v2/test_frama_c_2236.c | #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... | #include <string.h>
/*@
requires ((strlen(x1803)>=0) &&
\valid(x1803+(0..(strlen(x1803)+1)-1)));
assigns \nothing;
ensures ((0==\result) || ((strlen(\result)>=0) &&
\valid(\result+(0..(strlen(\result)+1)-1))));
*/ | char * p_(char * x1803) {
char *x1805 = x1803;
int x1810 = 1/*true*/;
char x1811 = '\0';
char *x1812 = 0/*null*/;
char x1806 = x1803[0];
int x1807 = x1806 == '\0';
if (x1807) {
x1812 = x1803;
} else {
int x1808 = x1806 == '\r';
if (x1808) {
x1810 = 0/*false*/;
x1811 = x1806;
... | true | 18 | 18 | char * p_(char * x1803) {
char *x1805 = x1803;
int x1810 = 1/*true*/;
char x1811 = '\0';
char *x1812 = 0/*null*/;
char x1806 = x1803[0];
int x1807 = x1806 == '\0';
if (x1807) {
x1812 = x1803;
} else {
int x1808 = x1806 == '\r';
if (x1808) {
x1810 = 0/*false*/;
x1811 = x1806;
... | #include <string.h>
/*@
requires ((strlen(x1803)>=0) &&
\valid(x1803+(0..(strlen(x1803)+1)-1)));
assigns \nothing;
ensures ((0==\result) || ((strlen(\result)>=0) &&
\valid(\result+(0..(strlen(\result)+1)-1))));
*/ |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.