diff options
| author | Cristian Cadar <cristic@cs.stanford.edu> | 2012-09-12 14:37:39 +0000 |
|---|---|---|
| committer | Cristian Cadar <cristic@cs.stanford.edu> | 2012-09-12 14:37:39 +0000 |
| commit | 9b5e99905e6732d64522d0efc212f3f1ce290ccc (patch) | |
| tree | 58739c4be56a01b436fc1fffae5dadc4fe3b8ea3 /test/Feature/Searchers.c | |
| parent | 1e6f7d11bafab8c8eef907c7bc0a165ce426984b (diff) | |
| download | klee-9b5e99905e6732d64522d0efc212f3f1ce290ccc.tar.gz | |
Restructured the command-line options for setting the search
heuristics in KLEE. The new options are documented at http://klee.llvm.org/klee-options.html. Cleaned a bit the code in UserSearcher.cpp, and fixed some test cases to use the new options. git-svn-id: https://llvm.org/svn/llvm-project/klee/trunk@163711 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'test/Feature/Searchers.c')
| -rw-r--r-- | test/Feature/Searchers.c | 31 |
1 files changed, 17 insertions, 14 deletions
diff --git a/test/Feature/Searchers.c b/test/Feature/Searchers.c index d61037b9..b120d354 100644 --- a/test/Feature/Searchers.c +++ b/test/Feature/Searchers.c @@ -1,27 +1,30 @@ // RUN: %llvmgcc %s -emit-llvm -O0 -c -o %t2.bc // RUN: %klee %t2.bc -// RUN: %klee --use-random-search %t2.bc -// RUN: %klee --use-non-uniform-random-search %t2.bc -// RUN: %klee --use-non-uniform-random-search --weight-type=query-cost %t2.bc +// RUN: %klee --search=random-state %t2.bc +// RUN: %klee --search=nurs:depth %t2.bc +// RUN: %klee --search=nurs:qc %t2.bc // RUN: %klee --use-batching-search %t2.bc -// RUN: %klee --use-batching-search --use-random-search %t2.bc -// RUN: %klee --use-batching-search --use-non-uniform-random-search %t2.bc -// RUN: %klee --use-batching-search --use-non-uniform-random-search --weight-type=query-cost %t2.bc -// RUN: %klee --use-merge --debug-log-merge --debug-log-state-merge %t2.bc -// RUN: %klee --use-merge --use-batching-search %t2.bc -// RUN: %klee --use-merge --use-batching-search --use-random-search %t2.bc -// RUN: %klee --use-merge --use-batching-search --use-non-uniform-random-search %t2.bc -// RUN: %klee --use-merge --use-batching-search --use-non-uniform-random-search --weight-type=query-cost %t2.bc +// RUN: %klee --use-batching-search --search=random-state %t2.bc +// RUN: %klee --use-batching-search --search=nurs:depth %t2.bc +// RUN: %klee --use-batching-search --search=nurs:qc %t2.bc +// RUN: %klee --search=random-path --search=nurs:qc %t2.bc +// RUN: %klee --use-merge --search=dfs --debug-log-merge --debug-log-state-merge %t2.bc +// RUN: %klee --use-merge --use-batching-search --search=dfs %t2.bc +// RUN: %klee --use-merge --use-batching-search --search=random-state %t2.bc +// RUN: %klee --use-merge --use-batching-search --search=nurs:depth %t2.bc +// RUN: %klee --use-merge --use-batching-search --search=nurs:qc %t2.bc // RUN: %klee --use-iterative-deepening-time-search --use-batching-search %t2.bc -// RUN: %klee --use-iterative-deepening-time-search --use-batching-search --use-random-search %t2.bc -// RUN: %klee --use-iterative-deepening-time-search --use-batching-search --use-non-uniform-random-search %t2.bc -// RUN: %klee --use-iterative-deepening-time-search --use-batching-search --use-non-uniform-random-search --weight-type=query-cost %t2.bc +// RUN: %klee --use-iterative-deepening-time-search --use-batching-search --search=random-state %t2.bc +// RUN: %klee --use-iterative-deepening-time-search --use-batching-search --search=nurs:depth %t2.bc +// RUN: %klee --use-iterative-deepening-time-search --use-batching-search --search=nurs:qc %t2.bc /* this test is basically just for coverage and doesn't really do any correctness check (aside from testing that the various combinations don't crash) */ +#include <stdlib.h> + int validate(char *buf, int N) { int i; |