forked from diffblue/cbmc
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Add a test on which SMT2 fail with quantifers in nested loop contracts
- Loading branch information
1 parent
b3f1e71
commit 1ed46d5
Showing
2 changed files
with
40 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,27 @@ | ||
#include <assert.h> | ||
#include <stdbool.h> | ||
|
||
#define N 16 | ||
|
||
void main() | ||
{ | ||
int a[N]; | ||
a[10] = 0; | ||
bool flag = true; | ||
for(int j = 0; j < N; ++j) | ||
__CPROVER_loop_invariant(j <= N) | ||
{ | ||
for(int i = 0; i < N; ++i) | ||
// clang-format off | ||
__CPROVER_assigns(i, __CPROVER_object_whole(a)) | ||
__CPROVER_loop_invariant((0 <= i) && (i <= N) && __CPROVER_forall { | ||
int k; | ||
(0 <= k && k <= N) ==> (k<i ==> a[k] == 1) | ||
}) | ||
// clang-format on | ||
{ | ||
a[i] = 1; | ||
} | ||
} | ||
assert(a[10] == 1); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,13 @@ | ||
CORE dfcc-only | ||
main.c | ||
--dfcc main --apply-loop-contracts _ --smt2 | ||
^EXIT=6$ | ||
^SIGNAL=0$ | ||
^SMT2 solver returned error message:$ | ||
^.*\"line \d+ column \d+: unknown constant .*$ | ||
^VERIFICATION ERROR$ | ||
-- | ||
^warning: ignoring | ||
-- | ||
This test case checks the handling of quantifiers in a nested loop's | ||
loop contracts. |