mirror of
https://github.com/AdaCore/cvc5.git
synced 2026-02-12 12:32:16 -08:00
690a392656
This PR enables CI for java tests by adding --java-bindings to ci.yml. It also replaces the unreliable finalize method and instead uses AutoCloseable and explicit close method to clean up dynamic memory allocated by java native interface. The PR fixes compile errors for SolverTest.java and runtime errors for Solver.defineFun.
131 lines
4.2 KiB
Java
131 lines
4.2 KiB
Java
/******************************************************************************
|
|
* Top contributors (to current version):
|
|
* Abdalrhman Mohamed, Mudathir Mohamed, Aina Niemetz
|
|
*
|
|
* This file is part of the cvc5 project.
|
|
*
|
|
* Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
|
|
* in the top-level source directory and their institutional affiliations.
|
|
* All rights reserved. See the file COPYING in the top-level source
|
|
* directory for licensing information.
|
|
* ****************************************************************************
|
|
*
|
|
* A simple demonstration of the Sygus API.
|
|
*
|
|
* A simple demonstration of how to use Grammar to add syntax constraints to
|
|
* the Sygus solution for the identity function. Here is the same problem
|
|
* written in Sygus V2 format:
|
|
*
|
|
* (set-logic LIA)
|
|
*
|
|
* (synth-fun id1 ((x Int)) Int
|
|
* ((Start Int)) ((Start Int ((- x) (+ x Start)))))
|
|
*
|
|
* (synth-fun id2 ((x Int)) Int
|
|
* ((Start Int)) ((Start Int ((Variable Int) (- x) (+ x Start)))))
|
|
*
|
|
* (synth-fun id3 ((x Int)) Int
|
|
* ((Start Int)) ((Start Int (0 (- x) (+ x Start)))))
|
|
*
|
|
* (synth-fun id4 ((x Int)) Int
|
|
* ((Start Int)) ((Start Int ((- x) (+ x Start)))))
|
|
*
|
|
* (declare-var x Int)
|
|
*
|
|
* (constraint (= (id1 x) (id2 x) (id3 x) (id4 x) x))
|
|
*
|
|
* (check-synth)
|
|
*
|
|
* The printed output for this example should look like:
|
|
* (
|
|
* (define-fun id1 ((x Int)) Int (+ x (+ x (- x))))
|
|
* (define-fun id2 ((x Int)) Int x)
|
|
* (define-fun id3 ((x Int)) Int (+ x 0))
|
|
* (define-fun id4 ((x Int)) Int (+ x (+ x (- x))))
|
|
* )
|
|
*/
|
|
|
|
import static io.github.cvc5.api.Kind.*;
|
|
|
|
import io.github.cvc5.api.*;
|
|
|
|
public class SygusGrammar
|
|
{
|
|
public static void main(String args[]) throws CVC5ApiException
|
|
{
|
|
try (Solver slv = new Solver())
|
|
{
|
|
// required options
|
|
slv.setOption("lang", "sygus2");
|
|
slv.setOption("incremental", "false");
|
|
|
|
// set the logic
|
|
slv.setLogic("LIA");
|
|
|
|
Sort integer = slv.getIntegerSort();
|
|
Sort bool = slv.getBooleanSort();
|
|
|
|
// declare input variable for the function-to-synthesize
|
|
Term x = slv.mkVar(integer, "x");
|
|
|
|
// declare the grammar non-terminal
|
|
Term start = slv.mkVar(integer, "Start");
|
|
|
|
// define the rules
|
|
Term zero = slv.mkInteger(0);
|
|
Term neg_x = slv.mkTerm(UMINUS, x);
|
|
Term plus = slv.mkTerm(PLUS, x, start);
|
|
|
|
// create the grammar object
|
|
Grammar g1 = slv.mkSygusGrammar(new Term[] {x}, new Term[] {start});
|
|
|
|
// bind each non-terminal to its rules
|
|
g1.addRules(start, new Term[] {neg_x, plus});
|
|
|
|
// copy the first grammar with all of its non-terminals and their rules
|
|
Grammar g2 = new Grammar(g1);
|
|
Grammar g3 = new Grammar(g1);
|
|
|
|
// add parameters as rules for the start symbol. Similar to "(Variable Int)"
|
|
g2.addAnyVariable(start);
|
|
|
|
// declare the functions-to-synthesize
|
|
Term id1 = slv.synthFun("id1", new Term[] {x}, integer, g1);
|
|
Term id2 = slv.synthFun("id2", new Term[] {x}, integer, g2);
|
|
|
|
g3.addRule(start, zero);
|
|
|
|
Term id3 = slv.synthFun("id3", new Term[] {x}, integer, g3);
|
|
|
|
// g1 is reusable as long as it remains unmodified after first use
|
|
Term id4 = slv.synthFun("id4", new Term[] {x}, integer, g1);
|
|
|
|
// declare universal variables.
|
|
Term varX = slv.mkSygusVar(integer, "x");
|
|
|
|
Term id1_x = slv.mkTerm(APPLY_UF, id1, varX);
|
|
Term id2_x = slv.mkTerm(APPLY_UF, id2, varX);
|
|
Term id3_x = slv.mkTerm(APPLY_UF, id3, varX);
|
|
Term id4_x = slv.mkTerm(APPLY_UF, id4, varX);
|
|
|
|
// add semantic constraints
|
|
// (constraint (= (id1 x) (id2 x) (id3 x) (id4 x) x))
|
|
slv.addSygusConstraint(slv.mkTerm(EQUAL, new Term[] {id1_x, id2_x, id3_x, id4_x, varX}));
|
|
|
|
// print solutions if available
|
|
if (slv.checkSynth().isUnsat())
|
|
{
|
|
// Output should be equivalent to:
|
|
// (
|
|
// (define-fun id1 ((x Int)) Int (+ x (+ x (- x))))
|
|
// (define-fun id2 ((x Int)) Int x)
|
|
// (define-fun id3 ((x Int)) Int (+ x 0))
|
|
// (define-fun id4 ((x Int)) Int (+ x (+ x (- x))))
|
|
// )
|
|
Term[] terms = new Term[] {id1, id2, id3, id4};
|
|
Utils.printSynthSolutions(terms, slv.getSynthSolutions(terms));
|
|
}
|
|
}
|
|
}
|
|
}
|