blob: f567293d8f4e422482c351303cd7d1be4b6767ff (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
|
// RUN: %llvmgcc %s -emit-llvm %O0opt -c -o %t.bc
// RUN: rm -rf %t.klee-out
// RUN: %klee --write-kqueries --output-dir=%t.klee-out --optimize-array=index %t.bc > %t.log 2>&1
// RUN: not FileCheck %s -input-file=%t.log -check-prefix=CHECK-OPT_I
// RUN: rm -rf %t.klee-out
// RUN: %klee --write-kqueries --output-dir=%t.klee-out --optimize-array=value %t.bc > %t.log 2>&1
// RUN: not FileCheck %s -input-file=%t.log -check-prefix=CHECK-OPT_V
// RUN: rm -rf %t.klee-out
// RUN: %klee --write-kqueries --output-dir=%t.klee-out --optimize-array=all %t.bc > %t.log 2>&1
// RUN: not FileCheck %s -input-file=%t.log -check-prefix=CHECK-OPT_I
// CHECK-OPT_I: KLEE: WARNING: OPT_I: successful
// CHECK-OPT_V: KLEE: WARNING: OPT_V: successful
// CHECK-CONST_ARR: const_arr
#include <stdio.h>
#include "klee/klee.h"
unsigned array[5] = {1,2,3,4,5};
int arr[3] = {0,1,2};
int main() {
int x = 2;
unsigned k = arr[x];
// CHECK: Yes
if (array[k] == 3)
printf("Yes\n");
// CHECK: KLEE: done: completed paths = 1
return 0;
}
|
