void handleQuery(VC handle, Expr queryExpr)
{
// Print the assertions
printf("Assertions:\n");
vc_printAsserts(handle, 0);
int result = vc_query(handle, queryExpr);
printf("Query:\n");
vc_printQuery(handle);
switch(result)
{
case 0: printf("Query is INVALID\n");
// print counter example
printf("Counter example:\n");
vc_printCounterExample(handle);
break;
case 1: printf("Query is VALID\n");break;
case 2: printf("Could not answer query\n");break;
case 3: printf("Timeout.\n"); break;
default: printf("Unhandled error\n");
}
printf("\n\n");
}
TEST(push_pop, two)
{
VC vc = vc_createValidityChecker();
//vc_setFlags(vc, 'n');
vc_setFlags(vc, 'd');
//vc_setFlags(vc, 'p');
//vc_setFlags(vc, 'v');
//vc_setFlags(vc, 's');
vc_setFlags(vc, 'c');
vc_push(vc);
Type bv8 = vc_bvType(vc, 8);
Expr a = vc_varExpr(vc, "a", bv8);
Expr ct_0 = vc_bvConstExprFromInt(vc, 8, 0);
Expr a_eq_0 = vc_eqExpr(vc, a, ct_0);
vc_assertFormula(vc, a_eq_0);
vc_printAsserts(vc);
vc_push(vc);
Expr queryexp = vc_eqExpr(vc, a, vc_bvConstExprFromInt(vc, 8, 0));
//vc_printExpr(vc, queryexp);
int query;
query = vc_query(vc, queryexp);
vc_printCounterExample(vc);
vc_pop(vc);
vc_pop(vc);
ASSERT_TRUE(query);
}
TEST(push_pop, two)
{
VC vc = vc_createValidityChecker();
vc_setFlags(vc, 'n');
vc_setFlags(vc, 'd');
vc_setFlags(vc, 'p');
vc_setFlags(vc, 'v');
vc_setFlags(vc, 's');
vc_setFlags(vc, 'c');
vc_push(vc);
Type bv8 = vc_bvType(vc, 8);
Expr a = vc_varExpr(vc, "a", bv8);
Expr ct_0 = vc_bvConstExprFromInt(vc, 8, 0);
Expr a_eq_0 = vc_eqExpr(vc, a, ct_0);
int query;
// query = vc_query(vc, a_eq_0);
// printf("query = %d\n", query);
Expr a_neq_0 = vc_notExpr(vc, a_eq_0);
vc_assertFormula(vc, a_eq_0);
vc_printAsserts(vc);
vc_push(vc);
Expr queryexp = vc_eqExpr(vc, a, vc_bvConstExprFromInt(vc, 8, 0));
vc_printExpr(vc, queryexp);
query = vc_query(vc, queryexp);
vc_printCounterExample(vc);
vc_pop(vc);
vc_pop(vc);
printf("query = %d\n", query);
// FIXME: Actually test something
// ASSERT_TRUE(false && "FIXME: Actually test something");
}
TEST(reported_issue_120, one)
{
VC vc = vc_createValidityChecker();
// Numbers will be non-negatives integers bounded at 2^32
Type bv32 = vc_bvType(vc, 32);
// Determine whether the following equations are satisfiable:
// v + 4 = n
// 4 = n
// Construct variable n
Expr n = vc_varExpr(vc, "n", bv32);
// Construct v + 4
Expr v = vc_varExpr(vc, "v", bv32);
Expr ct_4 = vc_bvConstExprFromInt(vc, 32, 4);
Expr add_v_4 = vc_bvPlusExpr(vc, 32, v, ct_4);
// Because numbers are represented as bit vectors,
// addition can roll over. So construct a constraint
// expresses that v+4 does not overflow the bounds:
// v + 4 >= v
//
Expr ge = vc_bvGeExpr(vc, add_v_4, v);
// Push a new context
printf("Push\n");
vc_push(vc);
// Assert v + 4 = n
printf("Assert v + 4 = n\n");
Expr f_add = vc_eqExpr(vc, add_v_4, n);
vc_assertFormula(vc, f_add);
vc_printExpr(vc, f_add);
printf("\n------\n");
// Assert the bounds constraint
printf("Assert v + 4 >= v\n");
vc_assertFormula(vc, ge);
vc_printExpr(vc, ge);
printf("\n------\n");
// Assert 4 = n
printf("Assert 4 = n\n");
Expr f_numeq = vc_eqExpr(vc, ct_4, n);
vc_assertFormula(vc, f_numeq);
vc_printExpr(vc, f_numeq);
printf("\n------\n");
// Check for satisfiability
printf("Check\n");
vc_printAsserts(vc);
printf("\n------\n");
int query = vc_query(vc, vc_falseExpr(vc));
ASSERT_EQ(query, 0);
// Pop context
printf("Pop\n");
vc_pop(vc);
printf("query = %d\n", query);
}
