Added support for KLEE index-based array optimization

1 files changed, 33 insertions, 0 deletions

diff --git a/test/ArrayOpt/test_var_idx.c b/test/ArrayOpt/test_var_idx.c
new file mode 100644
index 00000000..4fbfe7ce
--- /dev/null
+++ b/test/ArrayOpt/test_var_idx.c
@@ -0,0 +1,33 @@
+// 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: test -f %t.klee-out/test000002.kquery
+// RUN: not FileCheck %s -input-file=%t.klee-out/test000001.kquery -check-prefix=CHECK-CONST_ARR
+// RUN: not FileCheck %s -input-file=%t.klee-out/test000002.kquery -check-prefix=CHECK-CONST_ARR
+
+// CHECK-OPT_I: KLEE: WARNING: OPT_I: successful
+// CHECK-CONST_ARR: const_arr
+
+#include <stdio.h>
+#include "klee/klee.h"
+
+unsigned array[5] = {1,2,3,4,5};
+
+int main() {
+  unsigned idx;
+  klee_make_symbolic(&idx, sizeof(idx), "idx");
+  klee_assume(idx < 5);
+
+  // CHECK: Yes
+  // CHECK-NEXT: No
+  if (array[idx] == 3)
+	  printf("Yes\n");
+  else
+	  printf("No\n");
+
+  // CHECK: KLEE: done: completed paths = 2
+
+  return 0;
+}