-
Notifications
You must be signed in to change notification settings - Fork 263
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Infer loop assigns for DFCC with functions inlined
- Loading branch information
Showing
8 changed files
with
262 additions
and
29 deletions.
There are no files selected for viewing
9 changes: 4 additions & 5 deletions
9
regression/contracts-dfcc/loop_assigns_inference-01/test.desc
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 |
---|---|---|
@@ -1,18 +1,17 @@ | ||
KNOWNBUG | ||
CORE dfcc-only | ||
main.c | ||
--dfcc main --apply-loop-contracts | ||
--dfcc main --apply-loop-contracts _ --no-standard-checks | ||
^EXIT=0$ | ||
^SIGNAL=0$ | ||
^\[body_1.assigns.\d+\] .* Check that j is assignable: SUCCESS$ | ||
^\[body_2.assigns.\d+\] .* Check that \*i is assignable: SUCCESS$ | ||
^\[body_3.assigns.\d+\] .* Check that \*i is assignable: SUCCESS$ | ||
^\[incr.assigns.\d+\] .* Check that \*i is assignable: SUCCESS$ | ||
^\[main.\d+\] .* Check loop invariant before entry: SUCCESS$ | ||
^\[main.\d+\] .* Check that loop invariant is preserved: SUCCESS$ | ||
^\[main.\d+\] .* Check invariant before entry for loop .*: SUCCESS$ | ||
^\[main.\d+\] .* Check invariant after step for loop .*: SUCCESS$ | ||
^\[main.assertion.\d+\] .* assertion j == 9: SUCCESS$ | ||
^VERIFICATION SUCCESSFUL$ | ||
-- | ||
-- | ||
This test checks loop locals are correctly removed during assigns inference so | ||
that the assign clause is correctly inferred. | ||
This test failed when using dfcc for loop contracts. |
22 changes: 22 additions & 0 deletions
22
regression/contracts-dfcc/loop_assigns_inference-04/main.c
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,22 @@ | ||
struct hole | ||
{ | ||
int pos; | ||
}; | ||
|
||
void set_len(struct hole *h, unsigned long int new_len) | ||
{ | ||
h->pos = new_len; | ||
} | ||
|
||
int main() | ||
{ | ||
int i = 0; | ||
struct hole h; | ||
h.pos = 0; | ||
for(i = 0; i < 5; i++) | ||
// __CPROVER_assigns(h.pos, i) | ||
__CPROVER_loop_invariant(h.pos == i) | ||
{ | ||
set_len(&h, h.pos + 1); | ||
} | ||
} |
14 changes: 14 additions & 0 deletions
14
regression/contracts-dfcc/loop_assigns_inference-04/test.desc
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,14 @@ | ||
CORE dfcc-only | ||
main.c | ||
--dfcc main --apply-loop-contracts | ||
^EXIT=0$ | ||
^SIGNAL=0$ | ||
^\[main.loop_invariant_base.\d+\] line \d+ Check invariant before entry for loop .*: SUCCESS$ | ||
^\[main.loop_invariant_base.\d+\] line \d+ Check invariant before entry for loop .*: SUCCESS$ | ||
^\[main.loop_invariant_step.\d+\] line \d+ Check invariant after step for loop .*: SUCCESS$ | ||
^\[main.loop_step_unwinding.\d+\] line \d+ Check step was unwound for loop .*: SUCCESS$ | ||
^\[set_len.assigns.\d+\] line \d+ Check that h\-\>pos is assignable: SUCCESS | ||
^VERIFICATION SUCCESSFUL$ | ||
-- | ||
-- | ||
This test checks assigns h->pos is inferred correctly. |
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
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
Oops, something went wrong.