Branch data     Line data    Source code

       1                 :            : /******************************************************************************
       2                 :            :  * This file is part of the cvc5 project.
       3                 :            :  *
       4                 :            :  * Copyright (c) 2009-2026 by the authors listed in the file AUTHORS
       5                 :            :  * in the top-level source directory and their institutional affiliations.
       6                 :            :  * All rights reserved.  See the file COPYING in the top-level source
       7                 :            :  * directory for licensing information.
       8                 :            :  * ****************************************************************************
       9                 :            :  *
      10                 :            :  * Test for project issue #666
      11                 :            :  *
      12                 :            :  */
      13                 :            : #include <cvc5/cvc5.h>
      14                 :            : 
      15                 :            : using namespace cvc5;
      16                 :          1 : int main(void)
      17                 :            : {
      18                 :          1 :   TermManager tm;
      19                 :          1 :   Solver solver(tm);
      20                 :          1 :   solver.setOption("incremental", "false");
      21                 :          1 :   solver.setOption("produce-models", "true");
      22                 :          1 :   solver.setOption("incremental", "true");
      23                 :          1 :   Sort s0 = tm.getBooleanSort();
      24                 :          1 :   Sort s1 = tm.mkSequenceSort(s0);
      25                 :          1 :   Sort s2 = tm.getRealSort();
      26                 :          1 :   Term t3 = tm.mkConst(s2, "_x35");
      27                 :          1 :   Term t4 = tm.mkVar(s1, "_x37");
      28                 :          1 :   Term t5 = tm.mkConst(s1, "_x38");
      29                 :          1 :   Term t6 = tm.mkReal(5899572550, 9187);
      30                 :          4 :   Term t7 = tm.mkTerm(Kind::DISTINCT, {t3, t6});
      31                 :          4 :   Term t8 = tm.mkTerm(Kind::SEQ_SUFFIX, {t4, t5});
      32                 :          4 :   Term t9 = tm.mkTerm(Kind::SEQ_PREFIX, {t4, t5});
      33                 :          1 :   Op o10 = tm.mkOp(Kind::SEQ_REV);
      34                 :          3 :   Term t11 = tm.mkTerm(o10, {t5});
      35                 :          4 :   Term t12 = tm.mkTerm(Kind::EQUAL, {t9, t8});
      36                 :          3 :   Term t13 = tm.mkTerm(Kind::SET_SINGLETON, {t5});
      37                 :          1 :   Sort s14 = t13.getSort();
      38                 :          1 :   Term t15 = t12.xorTerm(t7);
      39                 :          3 :   Term t16 = tm.mkTerm(Kind::VARIABLE_LIST, {t4});
      40                 :          1 :   Sort s17 = t16.getSort();
      41                 :          4 :   Term t18 = tm.mkTerm(Kind::EXISTS, {t16, t15});
      42 [ +  + ][ -  - ]:          5 :   solver.checkSatAssuming({t18, t18, t7, t7});
      43 [ +  + ][ -  - ]:          3 :   solver.blockModelValues({t11, t13});
      44 [ +  + ][ -  - ]:          6 :   solver.checkSatAssuming({t18, t7, t18, t18, t7});
      45                 :            : 
      46                 :          1 :   return 0;
      47                 :          1 : }