mirror of
https://github.com/AdaCore/cvc5.git
synced 2026-02-12 12:32:16 -08:00
98 lines
3.6 KiB
Java
98 lines
3.6 KiB
Java
/********************* */
|
|
/*! \file BitVectorsAndArrays.java
|
|
** \verbatim
|
|
** Original author: Morgan Deters
|
|
** Major contributors: none
|
|
** Minor contributors (to current version): none
|
|
** This file is part of the CVC4 project.
|
|
** Copyright (c) 2009-2014 New York University and The University of Iowa
|
|
** See the file COPYING in the top-level source directory for licensing
|
|
** information.\endverbatim
|
|
**
|
|
** \brief A simple demonstration of the solving capabilities of the CVC4
|
|
** bit-vector and array solvers.
|
|
**
|
|
**/
|
|
|
|
import edu.nyu.acsys.CVC4.*;
|
|
import java.util.*;
|
|
|
|
public class BitVectorsAndArrays {
|
|
private static int log2(int n) {
|
|
return (int) Math.round(Math.log(n) / Math.log(2));
|
|
}
|
|
|
|
public static void main(String[] args) {
|
|
System.loadLibrary("cvc4jni");
|
|
|
|
ExprManager em = new ExprManager();
|
|
SmtEngine smt = new SmtEngine(em);
|
|
smt.setOption("produce-models", new SExpr(true)); // Produce Models
|
|
smt.setOption("output-language", new SExpr("smtlib")); // output-language
|
|
smt.setLogic("QF_AUFBV"); // Set the logic
|
|
|
|
// Consider the following code (where size is some previously defined constant):
|
|
//
|
|
//
|
|
// Assert (current_array[0] > 0);
|
|
// for (unsigned i = 1; i < k; ++i) {
|
|
// current_array[i] = 2 * current_array[i - 1];
|
|
// Assert (current_array[i-1] < current_array[i]);
|
|
// }
|
|
//
|
|
// We want to check whether the assertion in the body of the for loop holds
|
|
// throughout the loop.
|
|
|
|
// Setting up the problem parameters
|
|
int k = 4; // number of unrollings (should be a power of 2)
|
|
int index_size = log2(k); // size of the index
|
|
|
|
|
|
// Types
|
|
Type elementType = em.mkBitVectorType(32);
|
|
Type indexType = em.mkBitVectorType(index_size);
|
|
Type arrayType = em.mkArrayType(indexType, elementType);
|
|
|
|
// Variables
|
|
Expr current_array = em.mkVar("current_array", arrayType);
|
|
|
|
// Making a bit-vector constant
|
|
Expr zero = em.mkConst(new BitVector(index_size, 0));
|
|
|
|
// Asserting that current_array[0] > 0
|
|
Expr current_array0 = em.mkExpr(Kind.SELECT, current_array, zero);
|
|
Expr current_array0_gt_0 = em.mkExpr(Kind.BITVECTOR_SGT, current_array0, em.mkConst(new BitVector(32, 0)));
|
|
smt.assertFormula(current_array0_gt_0);
|
|
|
|
// Building the assertions in the loop unrolling
|
|
Expr index = em.mkConst(new BitVector(index_size, 0));
|
|
Expr old_current = em.mkExpr(Kind.SELECT, current_array, index);
|
|
Expr two = em.mkConst(new BitVector(32, 2));
|
|
|
|
vectorExpr assertions = new vectorExpr();
|
|
for (int i = 1; i < k; ++i) {
|
|
index = em.mkConst(new BitVector(index_size, new edu.nyu.acsys.CVC4.Integer(i)));
|
|
Expr new_current = em.mkExpr(Kind.BITVECTOR_MULT, two, old_current);
|
|
// current[i] = 2 * current[i-1]
|
|
current_array = em.mkExpr(Kind.STORE, current_array, index, new_current);
|
|
// current[i-1] < current [i]
|
|
Expr current_slt_new_current = em.mkExpr(Kind.BITVECTOR_SLT, old_current, new_current);
|
|
assertions.add(current_slt_new_current);
|
|
|
|
old_current = em.mkExpr(Kind.SELECT, current_array, index);
|
|
}
|
|
|
|
Expr query = em.mkExpr(Kind.NOT, em.mkExpr(Kind.AND, assertions));
|
|
|
|
System.out.println("Asserting " + query + " to CVC4 ");
|
|
smt.assertFormula(query);
|
|
System.out.println("Expect sat. ");
|
|
System.out.println("CVC4: " + smt.checkSat(em.mkConst(true)));
|
|
|
|
// Getting the model
|
|
System.out.println("The satisfying model is: ");
|
|
System.out.println(" current_array = " + smt.getValue(current_array));
|
|
System.out.println(" current_array[0] = " + smt.getValue(current_array0));
|
|
}
|
|
}
|