Files
cvc5/examples/api/cpp/strings.cpp
Aina Niemetz 7a4a17b193 c api: Introduce C/C++ specific handling of public enums. (#9915)
This introduces a general way to use public enums both in the C++ and
the (upcoming) C API. For the C++ case, we now use enum classes rather
than enums for public enums. This also includes definitions for
C API to_string conversions for public enums. C API definitions in
cvc5_types.h are only included from the C API, guarded via a macro
(thus, for now, not included yet when the header is included).
2023-08-22 18:17:16 +00:00

96 lines
2.9 KiB
C++

/******************************************************************************
* Top contributors (to current version):
* Tianyi Liang, Aina Niemetz, Mathias Preiner
*
* This file is part of the cvc5 project.
*
* Copyright (c) 2009-2022 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 reasoning about strings with cvc5 via C++ API.
*/
#include <cvc5/cvc5.h>
#include <iostream>
using namespace cvc5;
int main()
{
Solver slv;
// Set the logic
slv.setLogic("QF_SLIA");
// Produce models
slv.setOption("produce-models", "true");
// The option strings-exp is needed
slv.setOption("strings-exp", "true");
// Set output language to SMTLIB2
slv.setOption("output-language", "smt2");
// String type
Sort string = slv.getStringSort();
// std::string
std::string str_ab("ab");
// String constants
Term ab = slv.mkString(str_ab);
Term abc = slv.mkString("abc");
// String variables
Term x = slv.mkConst(string, "x");
Term y = slv.mkConst(string, "y");
Term z = slv.mkConst(string, "z");
// String concatenation: x.ab.y
Term lhs = slv.mkTerm(Kind::STRING_CONCAT, {x, ab, y});
// String concatenation: abc.z
Term rhs = slv.mkTerm(Kind::STRING_CONCAT, {abc, z});
// x.ab.y = abc.z
Term formula1 = slv.mkTerm(Kind::EQUAL, {lhs, rhs});
// Length of y: |y|
Term leny = slv.mkTerm(Kind::STRING_LENGTH, {y});
// |y| >= 0
Term formula2 = slv.mkTerm(Kind::GEQ, {leny, slv.mkInteger(0)});
// Regular expression: (ab[c-e]*f)|g|h
Term r = slv.mkTerm(
Kind::REGEXP_UNION,
{slv.mkTerm(
Kind::REGEXP_CONCAT,
{slv.mkTerm(Kind::STRING_TO_REGEXP, {slv.mkString("ab")}),
slv.mkTerm(Kind::REGEXP_STAR,
{slv.mkTerm(Kind::REGEXP_RANGE,
{slv.mkString("c"), slv.mkString("e")})}),
slv.mkTerm(Kind::STRING_TO_REGEXP, {slv.mkString("f")})}),
slv.mkTerm(Kind::STRING_TO_REGEXP, {slv.mkString("g")}),
slv.mkTerm(Kind::STRING_TO_REGEXP, {slv.mkString("h")})});
// String variables
Term s1 = slv.mkConst(string, "s1");
Term s2 = slv.mkConst(string, "s2");
// String concatenation: s1.s2
Term s = slv.mkTerm(Kind::STRING_CONCAT, {s1, s2});
// s1.s2 in (ab[c-e]*f)|g|h
Term formula3 = slv.mkTerm(Kind::STRING_IN_REGEXP, {s, r});
// Make a query
Term q = slv.mkTerm(Kind::AND, {formula1, formula2, formula3});
// check sat
Result result = slv.checkSatAssuming(q);
std::cout << "cvc5 reports: " << q << " is " << result << "." << std::endl;
if(result.isSat())
{
std::cout << " x = " << slv.getValue(x) << std::endl;
std::cout << " s1.s2 = " << slv.getValue(s) << std::endl;
}
}