// RUN: %llvmgcc %s -emit-llvm -O0 -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: FileCheck %s -input-file=%t.log -check-prefix=CHECK-OPT_I // RUN: test -f %t.klee-out/test000001.kquery // RUN: not FileCheck %s -input-file=%t.klee-out/test000001.kquery -check-prefix=CHECK-CONST_ARR // CHECK-OPT_I: KLEE: WARNING: OPT_I: successful // CHECK-CONST_ARR: const_arr #include #include "klee/klee.h" char array[10] = {1,2,2,4,5,3,1,3,2,2}; int main() { unsigned char k; klee_make_symbolic(&k, sizeof(k), "k"); klee_assume(k < 10); // CHECK: Yes // CHECK-NEXT: No if (array[k] >= 1) printf("Yes\n"); // CHECK: KLEE: done: completed paths = 1 return 0; }