/* A Bison parser, made by GNU Bison 3.8.2.  */

/* Bison implementation for Yacc-like parsers in C

   Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2021 Free Software Foundation,
   Inc.

   This program is free software: you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation, either version 3 of the License, or
   (at your option) any later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program.  If not, see <https://www.gnu.org/licenses/>.  */

/* As a special exception, you may create a larger work that contains
   part or all of the Bison parser skeleton and distribute that work
   under terms of your choice, so long as that work isn't itself a
   parser generator using the skeleton or a modified version thereof
   as a parser skeleton.  Alternatively, if you modify or redistribute
   the parser skeleton itself, you may (at your option) remove this
   special exception, which will cause the skeleton and the resulting
   Bison output files to be licensed under the GNU General Public
   License without this special exception.

   This special exception was added by the Free Software Foundation in
   version 2.2 of Bison.  */

/* C LALR(1) parser skeleton written by Richard Stallman, by
   simplifying the original so-called "semantic" parser.  */

/* DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual,
   especially those whose name start with YY_ or yy_.  They are
   private implementation details that can be changed or removed.  */

/* All symbols defined below should begin with yy or YY, to avoid
   infringing on user name space.  This should be done even for local
   variables, as they might otherwise be expanded by user macros.
   There are some unavoidable exceptions within include files to
   define necessary library symbols; they are noted "INFRINGES ON
   USER NAME SPACE" below.  */

/* Identify Bison output, and Bison version.  */
#define YYBISON 30802

/* Bison version string.  */
#define YYBISON_VERSION "3.8.2"

/* Skeleton name.  */
#define YYSKELETON_NAME "yacc.c"

/* Pure parsers.  */
#define YYPURE 0

/* Push parsers.  */
#define YYPUSH 0

/* Pull parsers.  */
#define YYPULL 1

/* Substitute the type names.  */
#define YYSTYPE         SMT2STYPE
/* Substitute the variable and function names.  */
#define yyparse         smt2parse
#define yylex           smt2lex
#define yyerror         smt2error
#define yydebug         smt2debug
#define yynerrs         smt2nerrs
#define yylval          smt2lval
#define yychar          smt2char

/* First part of user prologue.  */
#line 6 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"

  /********************************************************************
   * AUTHORS:  Trevor Hansen
   *
   * BEGIN DATE: May, 2010
   *
   * This file is modified version of the STP's smtlib.y file. Please
   * see CVCL license below
  ********************************************************************/

  /********************************************************************
   * AUTHORS: Vijay Ganesh, Trevor Hansen
   *
   * BEGIN DATE: July, 2006
   *
   * This file is modified version of the CVCL's smtlib.y file. Please
   * see CVCL license below
  ********************************************************************/


  /********************************************************************
   *
   * \file smtlib.y
   *
   * Author: Sergey Berezin, Clark Barrett
   *
   * Created: Apr 30 2005
   *
   * <hr>
   * Copyright (C) 2004 by the Board of Trustees of Leland Stanford
   * Junior University and by New York University.
   *
   * License to use, copy, modify, sell and/or distribute this software
   * and its documentation for any purpose is hereby granted without
   * royalty, subject to the terms and conditions defined in the \ref
   * LICENSE file provided with this distribution.  In particular:
   *
   * - The above copyright notice and this permission notice must appear
   * in all copies of the software and related documentation.
   *
   * - THE SOFTWARE IS PROVIDED "AS-IS", WITHOUT ANY WARRANTIES,
   * EXPRESSED OR IMPLIED.  USE IT AT YOUR OWN RISK.
   *
   * <hr>
  ********************************************************************/

#include "stp/cpp_interface.h"
#include "stp/Parser/LetMgr.h"
#include "stp/Parser/parser.h"
#include "parsesmt2.tab.h"
#include "smt2_flex_header.h"

  using std::cout;
  using std::cerr;
  using std::endl;

  using stp::SYMBOL;       //!< Named expression (or variable), i.e. created via 'vc_varExpr'.
  using stp::BVNOT;        //!< Bitvector bitwise-not
  using stp::BVCONCAT;     //!< Bitvector concatenation
  using stp::BVOR;         //!< Bitvector bitwise-or
  using stp::BVAND;        //!< Bitvector bitwise-and
  using stp::BVXOR;        //!< Bitvector bitwise-xor
  using stp::BVNAND;       //!< Bitvector bitwise not-and; OR nand (TODO: does this still exist?)
  using stp::BVNOR;        //!< Bitvector bitwise not-or; OR nor (TODO: does this still exist?)
  using stp::BVXNOR;       //!< Bitvector bitwise not-xor; OR xnor (TODO: does this still exist?)
  using stp::BVEXTRACT;    //!< Bitvector extraction, i.e. via 'vc_bvExtract'.
  using stp::BVLEFTSHIFT;  //!< Bitvector left-shift
  using stp::BVRIGHTSHIFT; //!< Bitvector right-right
  using stp::BVSRSHIFT;    //!< Bitvector signed right-shift
  using stp::BVPLUS;       //!< Bitvector addition
  using stp::BVSUB;        //!< Bitvector subtraction
  using stp::BVUMINUS;     //!< Bitvector unary minus; OR negate expression
  using stp::BVMULT;       //!< Bitvector multiplication
  using stp::BVDIV;        //!< Bitvector division
  using stp::BVMOD;        //!< Bitvector modulo operation
  using stp::SBVDIV;       //!< Signed bitvector division
  using stp::SBVREM;       //!< Signed bitvector remainder
  using stp::SBVMOD;       //!< Signed bitvector modulo operation
  using stp::BVSX;         //!< Bitvector signed extend
  using stp::BVZX;         //!< Bitvector zero extend
  using stp::ITE;          //!< If-then-else
  using stp::BOOLEXTRACT;  //!< Bitvector boolean extraction
  using stp::BVLT;         //!< Bitvector less-than
  using stp::BVLE;         //!< Bitvector less-equals
  using stp::BVGT;         //!< Bitvector greater-than
  using stp::BVGE;         //!< Bitvector greater-equals
  using stp::BVSLT;        //!< Signed bitvector less-than
  using stp::BVSLE;        //!< Signed bitvector less-equals
  using stp::BVSGT;        //!< Signed bitvector greater-than
  using stp::BVSGE;        //!< Signed bitvector greater-equals
  using stp::EQ;           //!< Equality comparator
  using stp::FALSE;        //!< Constant false boolean expression
  using stp::TRUE;         //!< Constant true boolean expression
  using stp::NOT;          //!< Logical-not boolean expression
  using stp::AND;          //!< Logical-and boolean expression
  using stp::OR;           //!< Logical-or boolean expression
  using stp::NAND;         //!< Logical-not-and boolean expression (TODO: Does this still exist?)
  using stp::NOR;          //!< Logical-not-or boolean expression (TODO: Does this still exist?)
  using stp::XOR;          //!< Logical-xor (either-or) boolean expression
  using stp::IFF;          //!< If-and-only-if boolean expression
  using stp::IMPLIES;      //!< Implication boolean expression
  using stp::PARAMBOOL;    //!< Parameterized boolean expression
  using stp::READ;         //!< Array read expression
  using stp::WRITE;        //!< Array write expression
  using stp::ARRAY;        //!< Array creation expression
  using stp::BITVECTOR;    //!< Bitvector creation expression
  using stp::BOOLEAN;      //!< Boolean creation expression

  using stp::UNDEFINED;    //!< An undefined expression.
  using stp::SYMBOL;       //!< Named expression (or variable), i.e. created via 'vc_varExpr'.
  using stp::BVCONST;      //!< Bitvector constant expression, i.e. created via 'vc_bvConstExprFromInt'.
  using stp::BVNOT;        //!< Bitvector bitwise-not
  using stp::BVCONCAT;     //!< Bitvector concatenation
  using stp::BVOR;         //!< Bitvector bitwise-or
  using stp::BVAND;        //!< Bitvector bitwise-and
  using stp::BVXOR;        //!< Bitvector bitwise-xor
  using stp::BVNAND;       //!< Bitvector bitwise not-and; OR nand (TODO: does this still exist?)
  using stp::BVNOR;        //!< Bitvector bitwise not-or; OR nor (TODO: does this still exist?)
  using stp::BVXNOR;       //!< Bitvector bitwise not-xor; OR xnor (TODO: does this still exist?)
  using stp::BVEXTRACT;    //!< Bitvector extraction, i.e. via 'vc_bvExtract'.
  using stp::BVLEFTSHIFT;  //!< Bitvector left-shift
  using stp::BVRIGHTSHIFT; //!< Bitvector right-right
  using stp::BVSRSHIFT;    //!< Bitvector signed right-shift
  using stp::BVPLUS;       //!< Bitvector addition
  using stp::BVSUB;        //!< Bitvector subtraction
  using stp::BVUMINUS;     //!< Bitvector unary minus; OR negate expression
  using stp::BVMULT;       //!< Bitvector multiplication
  using stp::BVDIV;        //!< Bitvector division
  using stp::BVMOD;        //!< Bitvector modulo operation
  using stp::SBVDIV;       //!< Signed bitvector division
  using stp::SBVREM;       //!< Signed bitvector remainder
  using stp::SBVMOD;       //!< Signed bitvector modulo operation
  using stp::BVSX;         //!< Bitvector signed extend
  using stp::BVZX;         //!< Bitvector zero extend
  using stp::ITE;          //!< If-then-else
  using stp::BOOLEXTRACT;  //!< Bitvector boolean extraction
  using stp::BVLT;         //!< Bitvector less-than
  using stp::BVLE;         //!< Bitvector less-equals
  using stp::BVGT;         //!< Bitvector greater-than
  using stp::BVGE;         //!< Bitvector greater-equals
  using stp::BVSLT;        //!< Signed bitvector less-than
  using stp::BVSLE;        //!< Signed bitvector less-equals
  using stp::BVSGT;        //!< Signed bitvector greater-than
  using stp::BVSGE;        //!< Signed bitvector greater-equals
  using stp::EQ;           //!< Equality comparator
  using stp::FALSE;        //!< Constant false boolean expression
  using stp::TRUE;         //!< Constant true boolean expression
  using stp::NOT;          //!< Logical-not boolean expression
  using stp::AND;          //!< Logical-and boolean expression
  using stp::OR;           //!< Logical-or boolean expression
  using stp::NAND;         //!< Logical-not-and boolean expression (TODO: Does this still exist?)
  using stp::NOR;          //!< Logical-not-or boolean expression (TODO: Does this still exist?)
  using stp::XOR;          //!< Logical-xor (either-or) boolean expression
  using stp::IFF;          //!< If-and-only-if boolean expression
  using stp::IMPLIES;      //!< Implication boolean expression
  using stp::PARAMBOOL;    //!< Parameterized boolean expression
  using stp::READ;         //!< Array read expression
  using stp::WRITE;        //!< Array write expression
  using stp::ARRAY;        //!< Array creation expression
  using stp::BITVECTOR;    //!< Bitvector creation expression
  using stp::BOOLEAN;      //!< Boolean creation expression

  using stp::NOT_DECLARED;
  using stp::TO_BE_SATISFIABLE;
  using stp::TO_BE_UNSATISFIABLE;
  using stp::TO_BE_UNKNOWN;

  using stp::BOOLEAN_TYPE;
  using stp::BITVECTOR_TYPE;
  using stp::ARRAY_TYPE;
  using stp::UNKNOWN_TYPE;

  using stp::SOLVER_INVALID;
  using stp::SOLVER_VALID;
  using stp::SOLVER_UNDECIDED;
  using stp::SOLVER_TIMEOUT;
  using stp::SOLVER_ERROR;
  using stp::SOLVER_UNSATISFIABLE;
  using stp::SOLVER_SATISFIABLE;

  extern char* smt2text;
  extern int smt2lineno;
  extern bool stringOnly;

  int yyerror(const char *s) {
    cout << "(error \"syntax error: line " << smt2lineno << " " << s << "  token: " << smt2text << "\")" << endl;
    return 1;
  }

  int fatal_yyerror(const char *s) 
  {
    yyerror(s);
    stp::FatalError("");
  }

  ASTNode* createNode(Kind k, ASTVec * c)
  {
    if (c->size() < 2)
    {
      yyerror("Must be >=2 operands.");
      exit(1);
    }
   ASTNode * n = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->CreateNode(k, *c));
   delete c;
   return n;
   }

  ASTNode* createNode(Kind k, ASTNode* c0, ASTNode *c1)
  {
    ASTNode * n = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateNode(k, *c0, *c1));
    delete c0;
    delete c1;
    return n;
  }

  ASTNode* createTerm(Kind k, ASTVec * c)
  {
    assert(k != BVEXTRACT);
    assert(k != BVCONCAT); // width must be width of first operand.
        
    if (c->size() < 2)
    {
      yyerror("Must be >=2 operands");
      exit(1);
    }
    const unsigned int width = (*c)[0].GetValueWidth();
    ASTNode * n = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateTerm(k, width,  *c));
    delete c;
    return n;
  }

  ASTNode* createTerm(Kind k, ASTNode* c0, ASTNode *c1)
  {
    const unsigned int width = c0->GetValueWidth();
    ASTNode * n = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateTerm(k, width, *c0, *c1));
    delete c0;
    delete c1;
    return n;
  }

#define YYLTYPE_IS_TRIVIAL 1
#define YYMAXDEPTH 104857600
#define YYERROR_VERBOSE 1
#define YY_EXIT_FAILURE -1


#line 326 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"

# ifndef YY_CAST
#  ifdef __cplusplus
#   define YY_CAST(Type, Val) static_cast<Type> (Val)
#   define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val)
#  else
#   define YY_CAST(Type, Val) ((Type) (Val))
#   define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val))
#  endif
# endif
# ifndef YY_NULLPTR
#  if defined __cplusplus
#   if 201103L <= __cplusplus
#    define YY_NULLPTR nullptr
#   else
#    define YY_NULLPTR 0
#   endif
#  else
#   define YY_NULLPTR ((void*)0)
#  endif
# endif

#include "parsesmt2.tab.h"
/* Symbol kind.  */
enum yysymbol_kind_t
{
  YYSYMBOL_YYEMPTY = -2,
  YYSYMBOL_YYEOF = 0,                      /* "end of file"  */
  YYSYMBOL_YYerror = 1,                    /* error  */
  YYSYMBOL_YYUNDEF = 2,                    /* "invalid token"  */
  YYSYMBOL_NUMERAL_TOK = 3,                /* NUMERAL_TOK  */
  YYSYMBOL_BVCONST_DECIMAL_TOK = 4,        /* BVCONST_DECIMAL_TOK  */
  YYSYMBOL_BVCONST_BINARY_TOK = 5,         /* BVCONST_BINARY_TOK  */
  YYSYMBOL_BVCONST_HEXIDECIMAL_TOK = 6,    /* BVCONST_HEXIDECIMAL_TOK  */
  YYSYMBOL_DECIMAL_TOK = 7,                /* DECIMAL_TOK  */
  YYSYMBOL_FORMID_TOK = 8,                 /* FORMID_TOK  */
  YYSYMBOL_TERMID_TOK = 9,                 /* TERMID_TOK  */
  YYSYMBOL_STRING_TOK = 10,                /* STRING_TOK  */
  YYSYMBOL_BITVECTOR_FUNCTIONID_TOK = 11,  /* BITVECTOR_FUNCTIONID_TOK  */
  YYSYMBOL_BOOLEAN_FUNCTIONID_TOK = 12,    /* BOOLEAN_FUNCTIONID_TOK  */
  YYSYMBOL_SOURCE_TOK = 13,                /* SOURCE_TOK  */
  YYSYMBOL_CATEGORY_TOK = 14,              /* CATEGORY_TOK  */
  YYSYMBOL_DIFFICULTY_TOK = 15,            /* DIFFICULTY_TOK  */
  YYSYMBOL_VERSION_TOK = 16,               /* VERSION_TOK  */
  YYSYMBOL_STATUS_TOK = 17,                /* STATUS_TOK  */
  YYSYMBOL_LICENSE_TOK = 18,               /* LICENSE_TOK  */
  YYSYMBOL_UNDERSCORE_TOK = 19,            /* UNDERSCORE_TOK  */
  YYSYMBOL_LPAREN_TOK = 20,                /* LPAREN_TOK  */
  YYSYMBOL_RPAREN_TOK = 21,                /* RPAREN_TOK  */
  YYSYMBOL_EXCLAIMATION_MARK_TOK = 22,     /* EXCLAIMATION_MARK_TOK  */
  YYSYMBOL_NAMED_ATTRIBUTE_TOK = 23,       /* NAMED_ATTRIBUTE_TOK  */
  YYSYMBOL_BVLEFTSHIFT_1_TOK = 24,         /* BVLEFTSHIFT_1_TOK  */
  YYSYMBOL_BVRIGHTSHIFT_1_TOK = 25,        /* BVRIGHTSHIFT_1_TOK  */
  YYSYMBOL_BVARITHRIGHTSHIFT_TOK = 26,     /* BVARITHRIGHTSHIFT_TOK  */
  YYSYMBOL_BVPLUS_TOK = 27,                /* BVPLUS_TOK  */
  YYSYMBOL_BVSUB_TOK = 28,                 /* BVSUB_TOK  */
  YYSYMBOL_BVNOT_TOK = 29,                 /* BVNOT_TOK  */
  YYSYMBOL_BVMULT_TOK = 30,                /* BVMULT_TOK  */
  YYSYMBOL_BVDIV_TOK = 31,                 /* BVDIV_TOK  */
  YYSYMBOL_SBVDIV_TOK = 32,                /* SBVDIV_TOK  */
  YYSYMBOL_BVMOD_TOK = 33,                 /* BVMOD_TOK  */
  YYSYMBOL_SBVREM_TOK = 34,                /* SBVREM_TOK  */
  YYSYMBOL_SBVMOD_TOK = 35,                /* SBVMOD_TOK  */
  YYSYMBOL_BVNEG_TOK = 36,                 /* BVNEG_TOK  */
  YYSYMBOL_BVAND_TOK = 37,                 /* BVAND_TOK  */
  YYSYMBOL_BVOR_TOK = 38,                  /* BVOR_TOK  */
  YYSYMBOL_BVXOR_TOK = 39,                 /* BVXOR_TOK  */
  YYSYMBOL_BVNAND_TOK = 40,                /* BVNAND_TOK  */
  YYSYMBOL_BVNOR_TOK = 41,                 /* BVNOR_TOK  */
  YYSYMBOL_BVXNOR_TOK = 42,                /* BVXNOR_TOK  */
  YYSYMBOL_BVCONCAT_TOK = 43,              /* BVCONCAT_TOK  */
  YYSYMBOL_BVLT_TOK = 44,                  /* BVLT_TOK  */
  YYSYMBOL_BVGT_TOK = 45,                  /* BVGT_TOK  */
  YYSYMBOL_BVLE_TOK = 46,                  /* BVLE_TOK  */
  YYSYMBOL_BVGE_TOK = 47,                  /* BVGE_TOK  */
  YYSYMBOL_BVSLT_TOK = 48,                 /* BVSLT_TOK  */
  YYSYMBOL_BVSGT_TOK = 49,                 /* BVSGT_TOK  */
  YYSYMBOL_BVSLE_TOK = 50,                 /* BVSLE_TOK  */
  YYSYMBOL_BVSGE_TOK = 51,                 /* BVSGE_TOK  */
  YYSYMBOL_BVSX_TOK = 52,                  /* BVSX_TOK  */
  YYSYMBOL_BVEXTRACT_TOK = 53,             /* BVEXTRACT_TOK  */
  YYSYMBOL_BVZX_TOK = 54,                  /* BVZX_TOK  */
  YYSYMBOL_BVROTATE_RIGHT_TOK = 55,        /* BVROTATE_RIGHT_TOK  */
  YYSYMBOL_BVROTATE_LEFT_TOK = 56,         /* BVROTATE_LEFT_TOK  */
  YYSYMBOL_BVREPEAT_TOK = 57,              /* BVREPEAT_TOK  */
  YYSYMBOL_BVCOMP_TOK = 58,                /* BVCOMP_TOK  */
  YYSYMBOL_BITVEC_TOK = 59,                /* BITVEC_TOK  */
  YYSYMBOL_ARRAY_TOK = 60,                 /* ARRAY_TOK  */
  YYSYMBOL_BOOL_TOK = 61,                  /* BOOL_TOK  */
  YYSYMBOL_TRUE_TOK = 62,                  /* TRUE_TOK  */
  YYSYMBOL_FALSE_TOK = 63,                 /* FALSE_TOK  */
  YYSYMBOL_NOT_TOK = 64,                   /* NOT_TOK  */
  YYSYMBOL_AND_TOK = 65,                   /* AND_TOK  */
  YYSYMBOL_OR_TOK = 66,                    /* OR_TOK  */
  YYSYMBOL_XOR_TOK = 67,                   /* XOR_TOK  */
  YYSYMBOL_ITE_TOK = 68,                   /* ITE_TOK  */
  YYSYMBOL_EQ_TOK = 69,                    /* EQ_TOK  */
  YYSYMBOL_IMPLIES_TOK = 70,               /* IMPLIES_TOK  */
  YYSYMBOL_DISTINCT_TOK = 71,              /* DISTINCT_TOK  */
  YYSYMBOL_LET_TOK = 72,                   /* LET_TOK  */
  YYSYMBOL_COLON_TOK = 73,                 /* COLON_TOK  */
  YYSYMBOL_ASSERT_TOK = 74,                /* ASSERT_TOK  */
  YYSYMBOL_CHECK_SAT_TOK = 75,             /* CHECK_SAT_TOK  */
  YYSYMBOL_CHECK_SAT_ASSUMING_TOK = 76,    /* CHECK_SAT_ASSUMING_TOK  */
  YYSYMBOL_DECLARE_CONST_TOK = 77,         /* DECLARE_CONST_TOK  */
  YYSYMBOL_DECLARE_FUNCTION_TOK = 78,      /* DECLARE_FUNCTION_TOK  */
  YYSYMBOL_DECLARE_SORT_TOK = 79,          /* DECLARE_SORT_TOK  */
  YYSYMBOL_DEFINE_FUNCTION_TOK = 80,       /* DEFINE_FUNCTION_TOK  */
  YYSYMBOL_DECLARE_FUN_REC_TOK = 81,       /* DECLARE_FUN_REC_TOK  */
  YYSYMBOL_DECLARE_FUNS_REC_TOK = 82,      /* DECLARE_FUNS_REC_TOK  */
  YYSYMBOL_DEFINE_SORT_TOK = 83,           /* DEFINE_SORT_TOK  */
  YYSYMBOL_ECHO_TOK = 84,                  /* ECHO_TOK  */
  YYSYMBOL_EXIT_TOK = 85,                  /* EXIT_TOK  */
  YYSYMBOL_GET_ASSERTIONS_TOK = 86,        /* GET_ASSERTIONS_TOK  */
  YYSYMBOL_GET_ASSIGNMENT_TOK = 87,        /* GET_ASSIGNMENT_TOK  */
  YYSYMBOL_GET_INFO_TOK = 88,              /* GET_INFO_TOK  */
  YYSYMBOL_GET_MODEL_TOK = 89,             /* GET_MODEL_TOK  */
  YYSYMBOL_GET_OPTION_TOK = 90,            /* GET_OPTION_TOK  */
  YYSYMBOL_GET_PROOF_TOK = 91,             /* GET_PROOF_TOK  */
  YYSYMBOL_GET_UNSAT_ASSUMPTION_TOK = 92,  /* GET_UNSAT_ASSUMPTION_TOK  */
  YYSYMBOL_GET_UNSAT_CORE_TOK = 93,        /* GET_UNSAT_CORE_TOK  */
  YYSYMBOL_GET_VALUE_TOK = 94,             /* GET_VALUE_TOK  */
  YYSYMBOL_POP_TOK = 95,                   /* POP_TOK  */
  YYSYMBOL_PUSH_TOK = 96,                  /* PUSH_TOK  */
  YYSYMBOL_RESET_TOK = 97,                 /* RESET_TOK  */
  YYSYMBOL_RESET_ASSERTIONS_TOK = 98,      /* RESET_ASSERTIONS_TOK  */
  YYSYMBOL_NOTES_TOK = 99,                 /* NOTES_TOK  */
  YYSYMBOL_LOGIC_TOK = 100,                /* LOGIC_TOK  */
  YYSYMBOL_SET_OPTION_TOK = 101,           /* SET_OPTION_TOK  */
  YYSYMBOL_SELECT_TOK = 102,               /* SELECT_TOK  */
  YYSYMBOL_STORE_TOK = 103,                /* STORE_TOK  */
  YYSYMBOL_YYACCEPT = 104,                 /* $accept  */
  YYSYMBOL_cmd = 105,                      /* cmd  */
  YYSYMBOL_commands = 106,                 /* commands  */
  YYSYMBOL_cmdi = 107,                     /* cmdi  */
  YYSYMBOL_function_param = 108,           /* function_param  */
  YYSYMBOL_function_params = 109,          /* function_params  */
  YYSYMBOL_function_def = 110,             /* function_def  */
  YYSYMBOL_status = 111,                   /* status  */
  YYSYMBOL_attribute = 112,                /* attribute  */
  YYSYMBOL_var_decl = 113,                 /* var_decl  */
  YYSYMBOL_const_decl = 114,               /* const_decl  */
  YYSYMBOL_an_mixed = 115,                 /* an_mixed  */
  YYSYMBOL_an_formulas = 116,              /* an_formulas  */
  YYSYMBOL_an_formula = 117,               /* an_formula  */
  YYSYMBOL_lets = 118,                     /* lets  */
  YYSYMBOL_119_1 = 119,                    /* $@1  */
  YYSYMBOL_120_inside_lets = 120,          /* inside-lets  */
  YYSYMBOL_let = 121,                      /* let  */
  YYSYMBOL_122_2 = 122,                    /* $@2  */
  YYSYMBOL_123_3 = 123,                    /* $@3  */
  YYSYMBOL_an_terms = 124,                 /* an_terms  */
  YYSYMBOL_an_term = 125                   /* an_term  */
};
typedef enum yysymbol_kind_t yysymbol_kind_t;




#ifdef short
# undef short
#endif

/* On compilers that do not define __PTRDIFF_MAX__ etc., make sure
   <limits.h> and (if available) <stdint.h> are included
   so that the code can choose integer types of a good width.  */

#ifndef __PTRDIFF_MAX__
# include <limits.h> /* INFRINGES ON USER NAME SPACE */
# if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
#  include <stdint.h> /* INFRINGES ON USER NAME SPACE */
#  define YY_STDINT_H
# endif
#endif

/* Narrow types that promote to a signed type and that can represent a
   signed or unsigned integer of at least N bits.  In tables they can
   save space and decrease cache pressure.  Promoting to a signed type
   helps avoid bugs in integer arithmetic.  */

#ifdef __INT_LEAST8_MAX__
typedef __INT_LEAST8_TYPE__ yytype_int8;
#elif defined YY_STDINT_H
typedef int_least8_t yytype_int8;
#else
typedef signed char yytype_int8;
#endif

#ifdef __INT_LEAST16_MAX__
typedef __INT_LEAST16_TYPE__ yytype_int16;
#elif defined YY_STDINT_H
typedef int_least16_t yytype_int16;
#else
typedef short yytype_int16;
#endif

/* Work around bug in HP-UX 11.23, which defines these macros
   incorrectly for preprocessor constants.  This workaround can likely
   be removed in 2023, as HPE has promised support for HP-UX 11.23
   (aka HP-UX 11i v2) only through the end of 2022; see Table 2 of
   <https://h20195.www2.hpe.com/V2/getpdf.aspx/4AA4-7673ENW.pdf>.  */
#ifdef __hpux
# undef UINT_LEAST8_MAX
# undef UINT_LEAST16_MAX
# define UINT_LEAST8_MAX 255
# define UINT_LEAST16_MAX 65535
#endif

#if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__
typedef __UINT_LEAST8_TYPE__ yytype_uint8;
#elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \
       && UINT_LEAST8_MAX <= INT_MAX)
typedef uint_least8_t yytype_uint8;
#elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX
typedef unsigned char yytype_uint8;
#else
typedef short yytype_uint8;
#endif

#if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__
typedef __UINT_LEAST16_TYPE__ yytype_uint16;
#elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \
       && UINT_LEAST16_MAX <= INT_MAX)
typedef uint_least16_t yytype_uint16;
#elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX
typedef unsigned short yytype_uint16;
#else
typedef int yytype_uint16;
#endif

#ifndef YYPTRDIFF_T
# if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__
#  define YYPTRDIFF_T __PTRDIFF_TYPE__
#  define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__
# elif defined PTRDIFF_MAX
#  ifndef ptrdiff_t
#   include <stddef.h> /* INFRINGES ON USER NAME SPACE */
#  endif
#  define YYPTRDIFF_T ptrdiff_t
#  define YYPTRDIFF_MAXIMUM PTRDIFF_MAX
# else
#  define YYPTRDIFF_T long
#  define YYPTRDIFF_MAXIMUM LONG_MAX
# endif
#endif

#ifndef YYSIZE_T
# ifdef __SIZE_TYPE__
#  define YYSIZE_T __SIZE_TYPE__
# elif defined size_t
#  define YYSIZE_T size_t
# elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
#  include <stddef.h> /* INFRINGES ON USER NAME SPACE */
#  define YYSIZE_T size_t
# else
#  define YYSIZE_T unsigned
# endif
#endif

#define YYSIZE_MAXIMUM                                  \
  YY_CAST (YYPTRDIFF_T,                                 \
           (YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1)  \
            ? YYPTRDIFF_MAXIMUM                         \
            : YY_CAST (YYSIZE_T, -1)))

#define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X))


/* Stored state numbers (used for stacks). */
typedef yytype_int16 yy_state_t;

/* State numbers in computations.  */
typedef int yy_state_fast_t;

#ifndef YY_
# if defined YYENABLE_NLS && YYENABLE_NLS
#  if ENABLE_NLS
#   include <libintl.h> /* INFRINGES ON USER NAME SPACE */
#   define YY_(Msgid) dgettext ("bison-runtime", Msgid)
#  endif
# endif
# ifndef YY_
#  define YY_(Msgid) Msgid
# endif
#endif


#ifndef YY_ATTRIBUTE_PURE
# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)
#  define YY_ATTRIBUTE_PURE __attribute__ ((__pure__))
# else
#  define YY_ATTRIBUTE_PURE
# endif
#endif

#ifndef YY_ATTRIBUTE_UNUSED
# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)
#  define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__))
# else
#  define YY_ATTRIBUTE_UNUSED
# endif
#endif

/* Suppress unused-variable warnings by "using" E.  */
#if ! defined lint || defined __GNUC__
# define YY_USE(E) ((void) (E))
#else
# define YY_USE(E) /* empty */
#endif

/* Suppress an incorrect diagnostic about yylval being uninitialized.  */
#if defined __GNUC__ && ! defined __ICC && 406 <= __GNUC__ * 100 + __GNUC_MINOR__
# if __GNUC__ * 100 + __GNUC_MINOR__ < 407
#  define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN                           \
    _Pragma ("GCC diagnostic push")                                     \
    _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")
# else
#  define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN                           \
    _Pragma ("GCC diagnostic push")                                     \
    _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")              \
    _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
# endif
# define YY_IGNORE_MAYBE_UNINITIALIZED_END      \
    _Pragma ("GCC diagnostic pop")
#else
# define YY_INITIAL_VALUE(Value) Value
#endif
#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_END
#endif
#ifndef YY_INITIAL_VALUE
# define YY_INITIAL_VALUE(Value) /* Nothing. */
#endif

#if defined __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__
# define YY_IGNORE_USELESS_CAST_BEGIN                          \
    _Pragma ("GCC diagnostic push")                            \
    _Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")
# define YY_IGNORE_USELESS_CAST_END            \
    _Pragma ("GCC diagnostic pop")
#endif
#ifndef YY_IGNORE_USELESS_CAST_BEGIN
# define YY_IGNORE_USELESS_CAST_BEGIN
# define YY_IGNORE_USELESS_CAST_END
#endif


#define YY_ASSERT(E) ((void) (0 && (E)))

#if !defined yyoverflow

/* The parser invokes alloca or malloc; define the necessary symbols.  */

# ifdef YYSTACK_USE_ALLOCA
#  if YYSTACK_USE_ALLOCA
#   ifdef __GNUC__
#    define YYSTACK_ALLOC __builtin_alloca
#   elif defined __BUILTIN_VA_ARG_INCR
#    include <alloca.h> /* INFRINGES ON USER NAME SPACE */
#   elif defined _AIX
#    define YYSTACK_ALLOC __alloca
#   elif defined _MSC_VER
#    include <malloc.h> /* INFRINGES ON USER NAME SPACE */
#    define alloca _alloca
#   else
#    define YYSTACK_ALLOC alloca
#    if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
#     include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
      /* Use EXIT_SUCCESS as a witness for stdlib.h.  */
#     ifndef EXIT_SUCCESS
#      define EXIT_SUCCESS 0
#     endif
#    endif
#   endif
#  endif
# endif

# ifdef YYSTACK_ALLOC
   /* Pacify GCC's 'empty if-body' warning.  */
#  define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
#  ifndef YYSTACK_ALLOC_MAXIMUM
    /* The OS might guarantee only one guard page at the bottom of the stack,
       and a page size can be as small as 4096 bytes.  So we cannot safely
       invoke alloca (N) if N exceeds 4096.  Use a slightly smaller number
       to allow for a few compiler-allocated temporary stack slots.  */
#   define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
#  endif
# else
#  define YYSTACK_ALLOC YYMALLOC
#  define YYSTACK_FREE YYFREE
#  ifndef YYSTACK_ALLOC_MAXIMUM
#   define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
#  endif
#  if (defined __cplusplus && ! defined EXIT_SUCCESS \
       && ! ((defined YYMALLOC || defined malloc) \
             && (defined YYFREE || defined free)))
#   include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
#   ifndef EXIT_SUCCESS
#    define EXIT_SUCCESS 0
#   endif
#  endif
#  ifndef YYMALLOC
#   define YYMALLOC malloc
#   if ! defined malloc && ! defined EXIT_SUCCESS
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
#   endif
#  endif
#  ifndef YYFREE
#   define YYFREE free
#   if ! defined free && ! defined EXIT_SUCCESS
void free (void *); /* INFRINGES ON USER NAME SPACE */
#   endif
#  endif
# endif
#endif /* !defined yyoverflow */

#if (! defined yyoverflow \
     && (! defined __cplusplus \
         || (defined SMT2STYPE_IS_TRIVIAL && SMT2STYPE_IS_TRIVIAL)))

/* A type that is properly aligned for any stack member.  */
union yyalloc
{
  yy_state_t yyss_alloc;
  YYSTYPE yyvs_alloc;
};

/* The size of the maximum gap between one aligned stack and the next.  */
# define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1)

/* The size of an array large to enough to hold all stacks, each with
   N elements.  */
# define YYSTACK_BYTES(N) \
     ((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (YYSTYPE)) \
      + YYSTACK_GAP_MAXIMUM)

# define YYCOPY_NEEDED 1

/* Relocate STACK from its old location to the new one.  The
   local variables YYSIZE and YYSTACKSIZE give the old and new number of
   elements in the stack, and YYPTR gives the new location of the
   stack.  Advance YYPTR to a properly aligned location for the next
   stack.  */
# define YYSTACK_RELOCATE(Stack_alloc, Stack)                           \
    do                                                                  \
      {                                                                 \
        YYPTRDIFF_T yynewbytes;                                         \
        YYCOPY (&yyptr->Stack_alloc, Stack, yysize);                    \
        Stack = &yyptr->Stack_alloc;                                    \
        yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \
        yyptr += yynewbytes / YYSIZEOF (*yyptr);                        \
      }                                                                 \
    while (0)

#endif

#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
/* Copy COUNT objects from SRC to DST.  The source and destination do
   not overlap.  */
# ifndef YYCOPY
#  if defined __GNUC__ && 1 < __GNUC__
#   define YYCOPY(Dst, Src, Count) \
      __builtin_memcpy (Dst, Src, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src)))
#  else
#   define YYCOPY(Dst, Src, Count)              \
      do                                        \
        {                                       \
          YYPTRDIFF_T yyi;                      \
          for (yyi = 0; yyi < (Count); yyi++)   \
            (Dst)[yyi] = (Src)[yyi];            \
        }                                       \
      while (0)
#  endif
# endif
#endif /* !YYCOPY_NEEDED */

/* YYFINAL -- State number of the termination state.  */
#define YYFINAL  21
/* YYLAST -- Last index in YYTABLE.  */
#define YYLAST   1222

/* YYNTOKENS -- Number of terminals.  */
#define YYNTOKENS  104
/* YYNNTS -- Number of nonterminals.  */
#define YYNNTS  22
/* YYNRULES -- Number of rules.  */
#define YYNRULES  126
/* YYNSTATES -- Number of states.  */
#define YYNSTATES  382

/* YYMAXUTOK -- Last valid token kind.  */
#define YYMAXUTOK   358


/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM
   as returned by yylex, with out-of-bounds checking.  */
#define YYTRANSLATE(YYX)                                \
  (0 <= (YYX) && (YYX) <= YYMAXUTOK                     \
   ? YY_CAST (yysymbol_kind_t, yytranslate[YYX])        \
   : YYSYMBOL_YYUNDEF)

/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
   as returned by yylex.  */
static const yytype_int8 yytranslate[] =
{
       0,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     1,     2,     3,     4,
       5,     6,     7,     8,     9,    10,    11,    12,    13,    14,
      15,    16,    17,    18,    19,    20,    21,    22,    23,    24,
      25,    26,    27,    28,    29,    30,    31,    32,    33,    34,
      35,    36,    37,    38,    39,    40,    41,    42,    43,    44,
      45,    46,    47,    48,    49,    50,    51,    52,    53,    54,
      55,    56,    57,    58,    59,    60,    61,    62,    63,    64,
      65,    66,    67,    68,    69,    70,    71,    72,    73,    74,
      75,    76,    77,    78,    79,    80,    81,    82,    83,    84,
      85,    86,    87,    88,    89,    90,    91,    92,    93,    94,
      95,    96,    97,    98,    99,   100,   101,   102,   103
};

#if SMT2DEBUG
/* YYRLINE[YYN] -- Source line where rule number YYN was defined.  */
static const yytype_int16 yyrline[] =
{
       0,   400,   400,   408,   409,   414,   421,   426,   431,   436,
     441,   446,   453,   460,   465,   471,   478,   484,   490,   497,
     504,   510,   521,   527,   532,   540,   551,   557,   566,   586,
     599,   608,   624,   631,   665,   682,   684,   686,   688,   690,
     692,   698,   708,   716,   741,   751,   759,   786,   795,   804,
     813,   825,   834,   845,   851,   857,   862,   886,   913,   937,
     941,   945,   949,   953,   957,   961,   965,   969,   973,   978,
     999,  1006,  1010,  1014,  1018,  1043,  1048,  1054,  1060,  1085,
    1084,  1096,  1097,  1101,  1106,  1100,  1119,  1129,  1140,  1145,
    1149,  1160,  1173,  1189,  1196,  1204,  1212,  1219,  1226,  1233,
    1237,  1241,  1245,  1252,  1262,  1266,  1270,  1274,  1278,  1282,
    1286,  1290,  1294,  1301,  1308,  1312,  1316,  1320,  1343,  1366,
    1382,  1388,  1395,  1402,  1412,  1422,  1440
};
#endif

/** Accessing symbol of state STATE.  */
#define YY_ACCESSING_SYMBOL(State) YY_CAST (yysymbol_kind_t, yystos[State])

#if SMT2DEBUG || 0
/* The user-facing name of the symbol whose (internal) number is
   YYSYMBOL.  No bounds checking.  */
static const char *yysymbol_name (yysymbol_kind_t yysymbol) YY_ATTRIBUTE_UNUSED;

/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
   First, the terminals, then, starting at YYNTOKENS, nonterminals.  */
static const char *const yytname[] =
{
  "\"end of file\"", "error", "\"invalid token\"", "NUMERAL_TOK",
  "BVCONST_DECIMAL_TOK", "BVCONST_BINARY_TOK", "BVCONST_HEXIDECIMAL_TOK",
  "DECIMAL_TOK", "FORMID_TOK", "TERMID_TOK", "STRING_TOK",
  "BITVECTOR_FUNCTIONID_TOK", "BOOLEAN_FUNCTIONID_TOK", "SOURCE_TOK",
  "CATEGORY_TOK", "DIFFICULTY_TOK", "VERSION_TOK", "STATUS_TOK",
  "LICENSE_TOK", "UNDERSCORE_TOK", "LPAREN_TOK", "RPAREN_TOK",
  "EXCLAIMATION_MARK_TOK", "NAMED_ATTRIBUTE_TOK", "BVLEFTSHIFT_1_TOK",
  "BVRIGHTSHIFT_1_TOK", "BVARITHRIGHTSHIFT_TOK", "BVPLUS_TOK", "BVSUB_TOK",
  "BVNOT_TOK", "BVMULT_TOK", "BVDIV_TOK", "SBVDIV_TOK", "BVMOD_TOK",
  "SBVREM_TOK", "SBVMOD_TOK", "BVNEG_TOK", "BVAND_TOK", "BVOR_TOK",
  "BVXOR_TOK", "BVNAND_TOK", "BVNOR_TOK", "BVXNOR_TOK", "BVCONCAT_TOK",
  "BVLT_TOK", "BVGT_TOK", "BVLE_TOK", "BVGE_TOK", "BVSLT_TOK", "BVSGT_TOK",
  "BVSLE_TOK", "BVSGE_TOK", "BVSX_TOK", "BVEXTRACT_TOK", "BVZX_TOK",
  "BVROTATE_RIGHT_TOK", "BVROTATE_LEFT_TOK", "BVREPEAT_TOK", "BVCOMP_TOK",
  "BITVEC_TOK", "ARRAY_TOK", "BOOL_TOK", "TRUE_TOK", "FALSE_TOK",
  "NOT_TOK", "AND_TOK", "OR_TOK", "XOR_TOK", "ITE_TOK", "EQ_TOK",
  "IMPLIES_TOK", "DISTINCT_TOK", "LET_TOK", "COLON_TOK", "ASSERT_TOK",
  "CHECK_SAT_TOK", "CHECK_SAT_ASSUMING_TOK", "DECLARE_CONST_TOK",
  "DECLARE_FUNCTION_TOK", "DECLARE_SORT_TOK", "DEFINE_FUNCTION_TOK",
  "DECLARE_FUN_REC_TOK", "DECLARE_FUNS_REC_TOK", "DEFINE_SORT_TOK",
  "ECHO_TOK", "EXIT_TOK", "GET_ASSERTIONS_TOK", "GET_ASSIGNMENT_TOK",
  "GET_INFO_TOK", "GET_MODEL_TOK", "GET_OPTION_TOK", "GET_PROOF_TOK",
  "GET_UNSAT_ASSUMPTION_TOK", "GET_UNSAT_CORE_TOK", "GET_VALUE_TOK",
  "POP_TOK", "PUSH_TOK", "RESET_TOK", "RESET_ASSERTIONS_TOK", "NOTES_TOK",
  "LOGIC_TOK", "SET_OPTION_TOK", "SELECT_TOK", "STORE_TOK", "$accept",
  "cmd", "commands", "cmdi", "function_param", "function_params",
  "function_def", "status", "attribute", "var_decl", "const_decl",
  "an_mixed", "an_formulas", "an_formula", "lets", "$@1", "inside-lets",
  "let", "$@2", "$@3", "an_terms", "an_term", YY_NULLPTR
};

static const char *
yysymbol_name (yysymbol_kind_t yysymbol)
{
  return yytname[yysymbol];
}
#endif

#define YYPACT_NINF (-143)

#define yypact_value_is_default(Yyn) \
  ((Yyn) == YYPACT_NINF)

#define YYTABLE_NINF (-1)

#define yytable_value_is_error(Yyn) \
  0

/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
   STATE-NUM.  */
static const yytype_int16 yypact[] =
{
     -11,  1121,    11,    12,   222,  -143,    -7,    13,    23,    30,
      33,  -143,  -143,     1,    42,    60,  -143,     2,    58,    -3,
      74,  -143,  -143,  1121,  -143,  -143,  1122,  -143,  -143,  -143,
    1079,   -19,  -143,    77,  -143,    79,  -143,  -143,   731,  -143,
    -143,  -143,  -143,  -143,  -143,    90,  -143,     0,  -143,    91,
    -143,    82,   731,   222,  1079,  1079,  1079,  1079,  1079,  1079,
    1079,  1079,   222,   222,   222,   222,   222,   731,   222,   731,
      88,    92,  -143,  -143,  -143,  -143,   107,   421,  1079,  1079,
    1079,  1079,  1079,  1079,  1079,  1079,  1079,  1079,  1079,  1079,
    1079,  1079,  1079,   222,  1079,  1079,    93,   -16,  -143,    95,
      15,   334,   475,  -143,  -143,  -143,  -143,  -143,  -143,     4,
    -143,   539,    89,  1079,  1079,  1079,  1079,  1079,  1079,  1079,
    1079,    96,    84,  -143,   131,   137,   222,   153,   777,  -143,
     155,   190,   818,  -143,   222,  -143,   119,   731,   192,  1079,
    1079,  1079,  1079,  1079,  1079,  1079,    88,   116,  1079,  1079,
    1079,  1079,  -143,  1079,  1079,  1079,  1079,  1079,  -143,  1079,
    1079,  1079,  1079,  1079,  1079,  1079,  -143,    83,   118,   -15,
     126,    17,  -143,    73,   731,   222,    88,  -143,  -143,  -143,
    -143,  -143,  -143,  -143,   138,   120,   129,   132,   135,   139,
     141,   145,   148,  -143,  -143,  -143,  -143,  -143,   222,  -143,
    -143,  -143,  -143,  -143,  -143,   150,   151,  -143,   603,   156,
     168,   174,   178,   182,   194,   183,   864,   905,   951,   992,
    1038,  1079,  1079,  -143,  -143,  -143,  -143,  -143,  -143,  -143,
    -143,  -143,  -143,  -143,  -143,  -143,  -143,  1079,  -143,  1079,
     198,   186,    19,  -143,   188,    20,   222,    21,  -143,   731,
     731,   191,  -143,  -143,  -143,  -143,  -143,  -143,  -143,  -143,
     193,  -143,   200,   150,  -143,  -143,   201,   220,   204,   210,
     214,   216,   228,  -143,  -143,  -143,  -143,  -143,   219,   229,
    -143,  -143,   230,   184,   195,   221,   236,   197,   237,  -143,
      50,   222,  -143,  -143,   248,  -143,  -143,  1079,   238,  1079,
    1079,  1079,  1079,   239,  -143,  -143,  -143,   258,   259,   244,
     205,   262,   247,   209,   253,  -143,  -143,  -143,  1079,  -143,
    -143,  -143,  -143,  -143,   254,   257,   215,   276,   260,   223,
     277,   264,   731,  -143,   267,  -143,   286,   269,  1079,   288,
     271,   234,   667,   275,   274,   278,  -143,   280,  1079,   293,
    -143,   245,   283,  -143,   285,  -143,   290,   294,   279,   287,
     289,   292,   255,   256,   297,   296,   304,   316,   261,  -143,
     300,   301,   320,   303,   305,   306,  -143,  1079,   307,  -143,
    1079,  -143
};

/* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM.
   Performed when YYTABLE does not specify something else to do.  Zero
   means the default is an error.  */
static const yytype_int8 yydefact[] =
{
       0,     0,     0,     0,     0,     6,     0,     0,     0,     0,
       0,    12,    13,     0,     0,     0,    20,     0,     0,     0,
       0,     1,     2,     0,    55,    77,     0,    53,    54,     5,
       0,     0,     8,     0,     9,     0,    10,    11,     0,    19,
      18,    35,    36,    37,    38,     0,    40,    24,    21,     0,
       4,     0,    77,     0,     0,     0,     0,     0,     0,     0,
       0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
       0,     0,   122,   121,    88,   124,     0,     0,     0,     0,
       0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
       0,     0,     0,     0,     0,     0,     0,     0,    45,     0,
       0,     0,     0,    47,    48,    34,    39,    23,    22,     0,
       3,     0,     0,     0,     0,     0,     0,     0,     0,     0,
       0,     0,     0,    51,     0,     0,     0,     0,     0,    86,
       0,     0,     0,    79,     0,    67,     0,   124,     0,     0,
       0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
       0,     0,    97,     0,     0,     0,     0,     0,    98,     0,
       0,     0,     0,     0,     0,     0,     7,     0,     0,     0,
       0,     0,    26,     0,     0,     0,     0,    14,    49,    50,
      15,    17,    16,    76,     0,     0,     0,     0,     0,     0,
       0,     0,     0,    68,    71,    52,    72,    73,     0,    74,
      56,    87,    69,    58,    57,     0,     0,   120,     0,     0,
       0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
       0,     0,     0,    89,   114,   115,   116,   104,   107,   109,
     108,   110,   111,   112,   113,    96,   103,     0,    90,     0,
       0,     0,     0,    42,     0,     0,     0,     0,    27,     0,
       0,     0,    63,    65,    64,    66,    59,    61,    60,    62,
       0,    83,     0,    82,    75,   123,     0,     0,     0,     0,
       0,     0,     0,   105,   106,    99,   100,   101,     0,     0,
      95,    91,     0,     0,     0,     0,     0,     0,     0,    30,
       0,     0,    78,    70,     0,    80,    81,     0,     0,     0,
       0,     0,     0,     0,   102,   126,    44,     0,     0,     0,
       0,     0,     0,     0,     0,    29,    84,    94,     0,    93,
     118,   117,   119,   125,     0,     0,     0,     0,     0,     0,
       0,     0,     0,    92,     0,    41,     0,     0,     0,     0,
       0,     0,     0,     0,     0,     0,    31,     0,     0,     0,
      85,     0,     0,    25,     0,    28,     0,     0,     0,     0,
       0,     0,     0,     0,     0,     0,     0,     0,     0,    46,
       0,     0,     0,     0,     0,     0,    43,     0,     0,    33,
       0,    32
};

/* YYPGOTO[NTERM-NUM].  */
static const yytype_int16 yypgoto[] =
{
    -143,  -143,  -143,   302,   157,  -143,  -143,  -143,  -143,  -143,
    -143,   -46,   115,   102,  -142,  -143,    66,  -143,  -143,  -143,
     -67,   -30
};

/* YYDEFGOTO[NTERM-NUM].  */
static const yytype_int16 yydefgoto[] =
{
       0,     2,     3,    20,   172,   173,    36,   106,    47,    34,
      32,   102,   122,   123,   134,   205,   262,   263,   294,   332,
     128,   129
};

/* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM.  If
   positive, shift that token.  If negative, reduce the rule whose
   number is the opposite.  If YYTABLE_NINF, syntax error.  */
static const yytype_int16 yytable[] =
{
      96,    97,   132,   167,   222,   242,   111,   107,   104,     1,
     108,    21,    22,    30,   180,    41,    42,    43,    44,    45,
      46,    38,   104,    31,   113,   114,   115,   116,   117,   118,
     119,   120,    23,    33,   250,   170,   171,   245,   284,   287,
      35,   290,    98,    37,   168,    39,   243,   147,   148,   149,
     150,   151,   152,   153,   154,   155,   156,   157,   158,   159,
     160,   161,   162,    40,   164,   165,   181,   182,    48,   313,
      49,   147,   179,   216,   217,   218,   219,   220,   246,   285,
     288,   179,   291,   185,   186,   187,   188,   189,   190,   191,
     192,   208,    24,   170,   247,    50,    25,    99,   201,   100,
     105,   109,   201,   110,    26,   194,    29,   104,   133,   215,
     314,   136,   184,   135,   166,   221,   169,   193,   224,   225,
     226,   227,   207,   228,   229,   230,   231,   232,    71,   233,
     234,   235,   236,   237,   238,   239,   244,   223,   241,    24,
     103,   252,   240,    25,   215,    24,    27,    28,   251,    25,
     253,    26,   196,   254,   103,   112,   255,    26,   197,   266,
     256,    24,   257,    24,   121,    25,   258,    25,   126,   259,
     261,   267,   264,    26,   199,    26,   202,   268,   179,   124,
     125,   269,   127,   130,   131,   270,   201,   201,   201,   201,
     201,   278,   279,    27,    28,   163,   136,   271,    24,    27,
      28,   282,    25,    71,   178,   283,   272,   280,   286,   281,
      26,   203,   292,   178,   293,    27,    28,    27,    28,   237,
     279,   295,   297,   298,   195,   299,   195,   195,   198,   195,
      24,   300,   195,   195,    25,   301,   206,   302,   303,   103,
     304,   309,    26,   307,   209,   210,   211,   212,   213,   214,
     305,   306,    27,    28,   308,   310,   311,   312,   316,   318,
     323,   324,   325,   326,   327,   328,   329,   317,   330,   319,
     320,   321,   322,   331,   336,   334,   112,   249,   335,   337,
     340,   338,   339,   341,    27,    28,   342,   343,   333,   344,
     345,   347,   348,   349,   351,   352,   356,   361,   362,   353,
     260,   354,   104,   358,   357,   359,   363,   370,   346,   364,
     178,   360,   179,   365,   366,   367,   368,   369,   355,   371,
     372,   373,   374,   375,   376,    51,   377,   378,   380,   296,
     248,     0,     0,     0,     0,     0,     0,     0,     0,    72,
      73,     0,    24,    74,     0,   137,    52,   379,   289,     0,
     381,   198,   206,   138,   101,     0,   174,     0,    78,    79,
      80,   140,    81,    82,   141,    83,    84,    85,    86,    87,
      88,   142,   143,   144,    89,    90,   145,    91,    54,    55,
      56,    57,    58,    59,    60,    61,     0,     0,     0,     0,
       0,     0,    92,   315,     0,     0,    27,    28,    62,    63,
      64,    65,   175,    67,    68,    69,   176,     0,     0,     0,
       0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
       0,     0,     0,     0,     0,     0,    72,    73,     0,     0,
      74,     0,   137,     0,   103,     0,    94,    95,     0,     0,
     138,    77,     0,   139,   178,    78,    79,    80,   140,    81,
      82,   141,    83,    84,    85,    86,    87,    88,   142,   143,
     144,    89,    90,   145,    91,     0,     0,     0,     0,     0,
       0,     0,     0,     0,     0,     0,     0,     0,     0,    92,
      72,    73,     0,    24,    74,     0,    75,    25,     0,    93,
       0,     0,     0,   146,    76,   101,   177,     0,     0,    78,
      79,    80,     0,    81,    82,     0,    83,    84,    85,    86,
      87,    88,     0,     0,     0,    89,    90,     0,    91,     0,
       0,     0,     0,    94,    95,     0,     0,     0,     0,     0,
       0,     0,     0,    92,     0,     0,     0,    27,    28,     0,
       0,     0,     0,    93,    72,    73,     0,    24,    74,     0,
      75,    25,     0,     0,     0,     0,     0,     0,    76,   101,
     183,     0,     0,    78,    79,    80,     0,    81,    82,     0,
      83,    84,    85,    86,    87,    88,     0,    94,    95,    89,
      90,     0,    91,     0,     0,     0,     0,     0,     0,     0,
       0,     0,     0,     0,     0,     0,     0,    92,     0,     0,
       0,    27,    28,     0,     0,     0,     0,    93,    72,    73,
       0,    24,    74,     0,    75,    25,     0,     0,     0,     0,
       0,     0,    76,   101,   265,     0,     0,    78,    79,    80,
       0,    81,    82,     0,    83,    84,    85,    86,    87,    88,
       0,    94,    95,    89,    90,     0,    91,     0,     0,     0,
       0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
       0,    92,     0,     0,     0,    27,    28,     0,     0,     0,
       0,    93,    72,    73,     0,    24,    74,     0,    75,    25,
       0,     0,     0,     0,     0,     0,    76,   101,   350,     0,
       0,    78,    79,    80,     0,    81,    82,     0,    83,    84,
      85,    86,    87,    88,     0,    94,    95,    89,    90,     0,
      91,     0,     0,     0,     0,     0,     0,     0,     0,     0,
       0,     0,     0,     0,     0,    92,     0,     0,     0,    27,
      28,     0,     0,     0,     0,    93,    72,    73,     0,    24,
      74,     0,    75,    25,     0,     0,     0,     0,     0,     0,
      76,   101,     0,     0,     0,    78,    79,    80,     0,    81,
      82,     0,    83,    84,    85,    86,    87,    88,     0,    94,
      95,    89,    90,     0,    91,     0,     0,     0,     0,     0,
       0,     0,    72,    73,     0,     0,    74,     0,    75,    92,
       0,     0,     0,    27,    28,     0,    76,    77,   200,    93,
       0,    78,    79,    80,     0,    81,    82,     0,    83,    84,
      85,    86,    87,    88,     0,     0,     0,    89,    90,     0,
      91,     0,     0,    72,    73,     0,     0,    74,     0,    75,
       0,     0,     0,    94,    95,    92,     0,    76,    77,   204,
       0,     0,    78,    79,    80,    93,    81,    82,     0,    83,
      84,    85,    86,    87,    88,     0,     0,     0,    89,    90,
       0,    91,     0,     0,     0,     0,     0,     0,     0,    72,
      73,     0,     0,    74,     0,    75,    92,     0,     0,    94,
      95,     0,     0,    76,    77,   273,    93,     0,    78,    79,
      80,     0,    81,    82,     0,    83,    84,    85,    86,    87,
      88,     0,     0,     0,    89,    90,     0,    91,     0,     0,
      72,    73,     0,     0,    74,     0,    75,     0,     0,     0,
      94,    95,    92,     0,    76,    77,   274,     0,     0,    78,
      79,    80,    93,    81,    82,     0,    83,    84,    85,    86,
      87,    88,     0,     0,     0,    89,    90,     0,    91,     0,
       0,     0,     0,     0,     0,     0,    72,    73,     0,     0,
      74,     0,    75,    92,     0,     0,    94,    95,     0,     0,
      76,    77,   275,    93,     0,    78,    79,    80,     0,    81,
      82,     0,    83,    84,    85,    86,    87,    88,     0,     0,
       0,    89,    90,     0,    91,     0,     0,    72,    73,     0,
       0,    74,     0,    75,     0,     0,     0,    94,    95,    92,
       0,    76,    77,   276,     0,     0,    78,    79,    80,    93,
      81,    82,     0,    83,    84,    85,    86,    87,    88,     0,
       0,     0,    89,    90,     0,    91,     0,     0,     0,     0,
       0,     0,     0,    72,    73,     0,     0,    74,     0,    75,
      92,     0,     0,    94,    95,     0,     0,    76,    77,   277,
      93,     0,    78,    79,    80,     0,    81,    82,     0,    83,
      84,    85,    86,    87,    88,     0,     0,     0,    89,    90,
       0,    91,     0,     0,    72,    73,     0,     0,    74,     0,
      75,     0,     0,     0,    94,    95,    92,     0,    76,    77,
       0,     0,     0,    78,    79,    80,    93,    81,    82,     0,
      83,    84,    85,    86,    87,    88,     0,     0,     0,    89,
      90,     0,    91,     0,     0,     0,     0,     0,     0,     0,
      24,     0,     0,     0,    52,     0,     0,    92,     0,     0,
      94,    95,    26,     0,    53,     0,     0,    93,     0,     0,
       0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
       0,     0,     0,     0,     0,     0,    54,    55,    56,    57,
      58,    59,    60,    61,     0,     0,     0,     0,     0,     0,
       0,    94,    95,     0,    27,    28,    62,    63,    64,    65,
      66,    67,    68,    69,    70,     4,     5,     6,     7,     8,
       0,     9,     0,     0,     0,    10,    11,     0,     0,     0,
      12,     0,     0,     0,     0,    13,    14,    15,    16,     0,
      17,    18,    19
};

static const yytype_int16 yycheck[] =
{
      30,    20,    69,    19,   146,    20,    52,     7,    38,    20,
      10,     0,     0,    20,    10,    13,    14,    15,    16,    17,
      18,    20,    52,    10,    54,    55,    56,    57,    58,    59,
      60,    61,    20,    10,   176,    20,    21,    20,    19,    19,
      10,    20,    61,    10,    60,     3,    61,    77,    78,    79,
      80,    81,    82,    83,    84,    85,    86,    87,    88,    89,
      90,    91,    92,     3,    94,    95,    62,    63,    10,    19,
      73,   101,   102,   140,   141,   142,   143,   144,    61,    60,
      60,   111,    61,   113,   114,   115,   116,   117,   118,   119,
     120,   137,     8,    20,    21,    21,    12,    20,   128,    20,
      10,    10,   132,    21,    20,    21,     4,   137,    20,   139,
      60,     4,    23,    21,    21,   145,    21,    21,   148,   149,
     150,   151,     3,   153,   154,   155,   156,   157,    26,   159,
     160,   161,   162,   163,   164,   165,    10,    21,    20,     8,
      38,    21,    59,    12,   174,     8,    62,    63,    10,    12,
      21,    20,    21,    21,    52,    53,    21,    20,    21,     3,
      21,     8,    21,     8,    62,    12,    21,    12,    66,    21,
      20,     3,    21,    20,    21,    20,    21,     3,   208,    64,
      65,     3,    67,    68,    69,     3,   216,   217,   218,   219,
     220,   221,   222,    62,    63,    93,     4,     3,     8,    62,
      63,     3,    12,   101,   102,    19,    23,   237,    20,   239,
      20,    21,    21,   111,    21,    62,    63,    62,    63,   249,
     250,    21,    21,     3,   122,    21,   124,   125,   126,   127,
       8,    21,   130,   131,    12,    21,   134,    21,    10,   137,
      21,    20,    20,    59,    52,    53,    54,    55,    56,    57,
      21,    21,    62,    63,    59,    19,    59,    20,    10,    21,
      21,     3,     3,    19,    59,     3,    19,   297,    59,   299,
     300,   301,   302,    20,    59,    21,   174,   175,    21,     3,
       3,    21,    59,    19,    62,    63,   332,    20,   318,     3,
      21,     3,    21,    59,    19,    21,     3,     3,    19,    21,
     198,    21,   332,    20,    59,    20,    19,     3,   338,    20,
     208,    21,   342,    21,    59,    59,    19,    21,   348,     3,
      59,    21,    21,     3,    21,    23,    21,    21,    21,   263,
     173,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,     5,
       6,    -1,     8,     9,    -1,    11,    12,   377,   246,    -1,
     380,   249,   250,    19,    20,    -1,    22,    -1,    24,    25,
      26,    27,    28,    29,    30,    31,    32,    33,    34,    35,
      36,    37,    38,    39,    40,    41,    42,    43,    44,    45,
      46,    47,    48,    49,    50,    51,    -1,    -1,    -1,    -1,
      -1,    -1,    58,   291,    -1,    -1,    62,    63,    64,    65,
      66,    67,    68,    69,    70,    71,    72,    -1,    -1,    -1,
      -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
      -1,    -1,    -1,    -1,    -1,    -1,     5,     6,    -1,    -1,
       9,    -1,    11,    -1,   332,    -1,   102,   103,    -1,    -1,
      19,    20,    -1,    22,   342,    24,    25,    26,    27,    28,
      29,    30,    31,    32,    33,    34,    35,    36,    37,    38,
      39,    40,    41,    42,    43,    -1,    -1,    -1,    -1,    -1,
      -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    58,
       5,     6,    -1,     8,     9,    -1,    11,    12,    -1,    68,
      -1,    -1,    -1,    72,    19,    20,    21,    -1,    -1,    24,
      25,    26,    -1,    28,    29,    -1,    31,    32,    33,    34,
      35,    36,    -1,    -1,    -1,    40,    41,    -1,    43,    -1,
      -1,    -1,    -1,   102,   103,    -1,    -1,    -1,    -1,    -1,
      -1,    -1,    -1,    58,    -1,    -1,    -1,    62,    63,    -1,
      -1,    -1,    -1,    68,     5,     6,    -1,     8,     9,    -1,
      11,    12,    -1,    -1,    -1,    -1,    -1,    -1,    19,    20,
      21,    -1,    -1,    24,    25,    26,    -1,    28,    29,    -1,
      31,    32,    33,    34,    35,    36,    -1,   102,   103,    40,
      41,    -1,    43,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
      -1,    -1,    -1,    -1,    -1,    -1,    -1,    58,    -1,    -1,
      -1,    62,    63,    -1,    -1,    -1,    -1,    68,     5,     6,
      -1,     8,     9,    -1,    11,    12,    -1,    -1,    -1,    -1,
      -1,    -1,    19,    20,    21,    -1,    -1,    24,    25,    26,
      -1,    28,    29,    -1,    31,    32,    33,    34,    35,    36,
      -1,   102,   103,    40,    41,    -1,    43,    -1,    -1,    -1,
      -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
      -1,    58,    -1,    -1,    -1,    62,    63,    -1,    -1,    -1,
      -1,    68,     5,     6,    -1,     8,     9,    -1,    11,    12,
      -1,    -1,    -1,    -1,    -1,    -1,    19,    20,    21,    -1,
      -1,    24,    25,    26,    -1,    28,    29,    -1,    31,    32,
      33,    34,    35,    36,    -1,   102,   103,    40,    41,    -1,
      43,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
      -1,    -1,    -1,    -1,    -1,    58,    -1,    -1,    -1,    62,
      63,    -1,    -1,    -1,    -1,    68,     5,     6,    -1,     8,
       9,    -1,    11,    12,    -1,    -1,    -1,    -1,    -1,    -1,
      19,    20,    -1,    -1,    -1,    24,    25,    26,    -1,    28,
      29,    -1,    31,    32,    33,    34,    35,    36,    -1,   102,
     103,    40,    41,    -1,    43,    -1,    -1,    -1,    -1,    -1,
      -1,    -1,     5,     6,    -1,    -1,     9,    -1,    11,    58,
      -1,    -1,    -1,    62,    63,    -1,    19,    20,    21,    68,
      -1,    24,    25,    26,    -1,    28,    29,    -1,    31,    32,
      33,    34,    35,    36,    -1,    -1,    -1,    40,    41,    -1,
      43,    -1,    -1,     5,     6,    -1,    -1,     9,    -1,    11,
      -1,    -1,    -1,   102,   103,    58,    -1,    19,    20,    21,
      -1,    -1,    24,    25,    26,    68,    28,    29,    -1,    31,
      32,    33,    34,    35,    36,    -1,    -1,    -1,    40,    41,
      -1,    43,    -1,    -1,    -1,    -1,    -1,    -1,    -1,     5,
       6,    -1,    -1,     9,    -1,    11,    58,    -1,    -1,   102,
     103,    -1,    -1,    19,    20,    21,    68,    -1,    24,    25,
      26,    -1,    28,    29,    -1,    31,    32,    33,    34,    35,
      36,    -1,    -1,    -1,    40,    41,    -1,    43,    -1,    -1,
       5,     6,    -1,    -1,     9,    -1,    11,    -1,    -1,    -1,
     102,   103,    58,    -1,    19,    20,    21,    -1,    -1,    24,
      25,    26,    68,    28,    29,    -1,    31,    32,    33,    34,
      35,    36,    -1,    -1,    -1,    40,    41,    -1,    43,    -1,
      -1,    -1,    -1,    -1,    -1,    -1,     5,     6,    -1,    -1,
       9,    -1,    11,    58,    -1,    -1,   102,   103,    -1,    -1,
      19,    20,    21,    68,    -1,    24,    25,    26,    -1,    28,
      29,    -1,    31,    32,    33,    34,    35,    36,    -1,    -1,
      -1,    40,    41,    -1,    43,    -1,    -1,     5,     6,    -1,
      -1,     9,    -1,    11,    -1,    -1,    -1,   102,   103,    58,
      -1,    19,    20,    21,    -1,    -1,    24,    25,    26,    68,
      28,    29,    -1,    31,    32,    33,    34,    35,    36,    -1,
      -1,    -1,    40,    41,    -1,    43,    -1,    -1,    -1,    -1,
      -1,    -1,    -1,     5,     6,    -1,    -1,     9,    -1,    11,
      58,    -1,    -1,   102,   103,    -1,    -1,    19,    20,    21,
      68,    -1,    24,    25,    26,    -1,    28,    29,    -1,    31,
      32,    33,    34,    35,    36,    -1,    -1,    -1,    40,    41,
      -1,    43,    -1,    -1,     5,     6,    -1,    -1,     9,    -1,
      11,    -1,    -1,    -1,   102,   103,    58,    -1,    19,    20,
      -1,    -1,    -1,    24,    25,    26,    68,    28,    29,    -1,
      31,    32,    33,    34,    35,    36,    -1,    -1,    -1,    40,
      41,    -1,    43,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
       8,    -1,    -1,    -1,    12,    -1,    -1,    58,    -1,    -1,
     102,   103,    20,    -1,    22,    -1,    -1,    68,    -1,    -1,
      -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
      -1,    -1,    -1,    -1,    -1,    -1,    44,    45,    46,    47,
      48,    49,    50,    51,    -1,    -1,    -1,    -1,    -1,    -1,
      -1,   102,   103,    -1,    62,    63,    64,    65,    66,    67,
      68,    69,    70,    71,    72,    74,    75,    76,    77,    78,
      -1,    80,    -1,    -1,    -1,    84,    85,    -1,    -1,    -1,
      89,    -1,    -1,    -1,    -1,    94,    95,    96,    97,    -1,
      99,   100,   101
};

/* YYSTOS[STATE-NUM] -- The symbol kind of the accessing symbol of
   state STATE-NUM.  */
static const yytype_int8 yystos[] =
{
       0,    20,   105,   106,    74,    75,    76,    77,    78,    80,
      84,    85,    89,    94,    95,    96,    97,    99,   100,   101,
     107,     0,     0,    20,     8,    12,    20,    62,    63,   117,
      20,    10,   114,    10,   113,    10,   110,    10,    20,     3,
       3,    13,    14,    15,    16,    17,    18,   112,    10,    73,
      21,   107,    12,    22,    44,    45,    46,    47,    48,    49,
      50,    51,    64,    65,    66,    67,    68,    69,    70,    71,
      72,   117,     5,     6,     9,    11,    19,    20,    24,    25,
      26,    28,    29,    31,    32,    33,    34,    35,    36,    40,
      41,    43,    58,    68,   102,   103,   125,    20,    61,    20,
      20,    20,   115,   117,   125,    10,   111,     7,    10,    10,
      21,   115,   117,   125,   125,   125,   125,   125,   125,   125,
     125,   117,   116,   117,   116,   116,   117,   116,   124,   125,
     116,   116,   124,    20,   118,    21,     4,    11,    19,    22,
      27,    30,    37,    38,    39,    42,    72,   125,   125,   125,
     125,   125,   125,   125,   125,   125,   125,   125,   125,   125,
     125,   125,   125,   117,   125,   125,    21,    19,    60,    21,
      20,    21,   108,   109,    22,    68,    72,    21,   117,   125,
      10,    62,    63,    21,    23,   125,   125,   125,   125,   125,
     125,   125,   125,    21,    21,   117,    21,    21,   117,    21,
      21,   125,    21,    21,    21,   119,   117,     3,   115,    52,
      53,    54,    55,    56,    57,   125,   124,   124,   124,   124,
     124,   125,   118,    21,   125,   125,   125,   125,   125,   125,
     125,   125,   125,   125,   125,   125,   125,   125,   125,   125,
      59,    20,    20,    61,    10,    20,    61,    21,   108,   117,
     118,    10,    21,    21,    21,    21,    21,    21,    21,    21,
     117,    20,   120,   121,    21,    21,     3,     3,     3,     3,
       3,     3,    23,    21,    21,    21,    21,    21,   125,   125,
     125,   125,     3,    19,    19,    60,    20,    19,    60,   117,
      20,    61,    21,    21,   122,    21,   120,    21,     3,    21,
      21,    21,    21,    10,    21,    21,    21,    59,    59,    20,
      19,    59,    20,    19,    60,   117,    10,   125,    21,   125,
     125,   125,   125,    21,     3,     3,    19,    59,     3,    19,
      59,    20,   123,   125,    21,    21,    59,     3,    21,    59,
       3,    19,   115,    20,     3,    21,   125,     3,    21,    59,
      21,    19,    21,    21,    21,   125,     3,    59,    20,    20,
      21,     3,    19,    19,    20,    21,    59,    59,    19,    21,
       3,     3,    59,    21,    21,     3,    21,    21,    21,   125,
      21,   125
};

/* YYR1[RULE-NUM] -- Symbol kind of the left-hand side of rule RULE-NUM.  */
static const yytype_int8 yyr1[] =
{
       0,   104,   105,   106,   106,   107,   107,   107,   107,   107,
     107,   107,   107,   107,   107,   107,   107,   107,   107,   107,
     107,   107,   107,   107,   107,   108,   109,   109,   110,   110,
     110,   110,   110,   110,   111,   112,   112,   112,   112,   112,
     112,   113,   113,   113,   114,   114,   114,   115,   115,   115,
     115,   116,   116,   117,   117,   117,   117,   117,   117,   117,
     117,   117,   117,   117,   117,   117,   117,   117,   117,   117,
     117,   117,   117,   117,   117,   117,   117,   117,   117,   119,
     118,   120,   120,   122,   123,   121,   124,   124,   125,   125,
     125,   125,   125,   125,   125,   125,   125,   125,   125,   125,
     125,   125,   125,   125,   125,   125,   125,   125,   125,   125,
     125,   125,   125,   125,   125,   125,   125,   125,   125,   125,
     125,   125,   125,   125,   125,   125,   125
};

/* YYR2[RULE-NUM] -- Number of symbols on the right-hand side of rule RULE-NUM.  */
static const yytype_int8 yyr2[] =
{
       0,     2,     2,     4,     3,     2,     1,     4,     2,     2,
       2,     2,     1,     1,     4,     4,     4,     4,     2,     2,
       1,     2,     3,     3,     2,     8,     1,     2,    10,     6,
       5,     9,    18,    17,     1,     1,     1,     1,     1,     2,
       1,     8,     4,    16,     6,     2,    14,     1,     1,     2,
       2,     1,     2,     1,     1,     1,     4,     4,     4,     5,
       5,     5,     5,     5,     5,     5,     5,     3,     4,     4,
       6,     4,     4,     4,     4,     5,     4,     1,     6,     0,
       4,     2,     1,     0,     0,     6,     1,     2,     1,     3,
       3,     4,     7,     6,     6,     4,     3,     2,     2,     4,
       4,     4,     5,     3,     3,     4,     4,     3,     3,     3,
       3,     3,     3,     3,     3,     3,     3,     6,     6,     6,
       3,     1,     1,     4,     1,     6,     5
};


enum { YYENOMEM = -2 };

#define yyerrok         (yyerrstatus = 0)
#define yyclearin       (yychar = SMT2EMPTY)

#define YYACCEPT        goto yyacceptlab
#define YYABORT         goto yyabortlab
#define YYERROR         goto yyerrorlab
#define YYNOMEM         goto yyexhaustedlab


#define YYRECOVERING()  (!!yyerrstatus)

#define YYBACKUP(Token, Value)                                    \
  do                                                              \
    if (yychar == SMT2EMPTY)                                        \
      {                                                           \
        yychar = (Token);                                         \
        yylval = (Value);                                         \
        YYPOPSTACK (yylen);                                       \
        yystate = *yyssp;                                         \
        goto yybackup;                                            \
      }                                                           \
    else                                                          \
      {                                                           \
        yyerror (YY_("syntax error: cannot back up")); \
        YYERROR;                                                  \
      }                                                           \
  while (0)

/* Backward compatibility with an undocumented macro.
   Use SMT2error or SMT2UNDEF. */
#define YYERRCODE SMT2UNDEF


/* Enable debugging if requested.  */
#if SMT2DEBUG

# ifndef YYFPRINTF
#  include <stdio.h> /* INFRINGES ON USER NAME SPACE */
#  define YYFPRINTF fprintf
# endif

# define YYDPRINTF(Args)                        \
do {                                            \
  if (yydebug)                                  \
    YYFPRINTF Args;                             \
} while (0)




# define YY_SYMBOL_PRINT(Title, Kind, Value, Location)                    \
do {                                                                      \
  if (yydebug)                                                            \
    {                                                                     \
      YYFPRINTF (stderr, "%s ", Title);                                   \
      yy_symbol_print (stderr,                                            \
                  Kind, Value); \
      YYFPRINTF (stderr, "\n");                                           \
    }                                                                     \
} while (0)


/*-----------------------------------.
| Print this symbol's value on YYO.  |
`-----------------------------------*/

static void
yy_symbol_value_print (FILE *yyo,
                       yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
{
  FILE *yyoutput = yyo;
  YY_USE (yyoutput);
  if (!yyvaluep)
    return;
  YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
  YY_USE (yykind);
  YY_IGNORE_MAYBE_UNINITIALIZED_END
}


/*---------------------------.
| Print this symbol on YYO.  |
`---------------------------*/

static void
yy_symbol_print (FILE *yyo,
                 yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
{
  YYFPRINTF (yyo, "%s %s (",
             yykind < YYNTOKENS ? "token" : "nterm", yysymbol_name (yykind));

  yy_symbol_value_print (yyo, yykind, yyvaluep);
  YYFPRINTF (yyo, ")");
}

/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included).                                                   |
`------------------------------------------------------------------*/

static void
yy_stack_print (yy_state_t *yybottom, yy_state_t *yytop)
{
  YYFPRINTF (stderr, "Stack now");
  for (; yybottom <= yytop; yybottom++)
    {
      int yybot = *yybottom;
      YYFPRINTF (stderr, " %d", yybot);
    }
  YYFPRINTF (stderr, "\n");
}

# define YY_STACK_PRINT(Bottom, Top)                            \
do {                                                            \
  if (yydebug)                                                  \
    yy_stack_print ((Bottom), (Top));                           \
} while (0)


/*------------------------------------------------.
| Report that the YYRULE is going to be reduced.  |
`------------------------------------------------*/

static void
yy_reduce_print (yy_state_t *yyssp, YYSTYPE *yyvsp,
                 int yyrule)
{
  int yylno = yyrline[yyrule];
  int yynrhs = yyr2[yyrule];
  int yyi;
  YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n",
             yyrule - 1, yylno);
  /* The symbols being reduced.  */
  for (yyi = 0; yyi < yynrhs; yyi++)
    {
      YYFPRINTF (stderr, "   $%d = ", yyi + 1);
      yy_symbol_print (stderr,
                       YY_ACCESSING_SYMBOL (+yyssp[yyi + 1 - yynrhs]),
                       &yyvsp[(yyi + 1) - (yynrhs)]);
      YYFPRINTF (stderr, "\n");
    }
}

# define YY_REDUCE_PRINT(Rule)          \
do {                                    \
  if (yydebug)                          \
    yy_reduce_print (yyssp, yyvsp, Rule); \
} while (0)

/* Nonzero means print parse trace.  It is left uninitialized so that
   multiple parsers can coexist.  */
int yydebug;
#else /* !SMT2DEBUG */
# define YYDPRINTF(Args) ((void) 0)
# define YY_SYMBOL_PRINT(Title, Kind, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif /* !SMT2DEBUG */


/* YYINITDEPTH -- initial size of the parser's stacks.  */
#ifndef YYINITDEPTH
# define YYINITDEPTH 200
#endif

/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
   if the built-in stack extension method is used).

   Do not make this value too large; the results are undefined if
   YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
   evaluated with infinite-precision integer arithmetic.  */

#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif






/*-----------------------------------------------.
| Release the memory associated to this symbol.  |
`-----------------------------------------------*/

static void
yydestruct (const char *yymsg,
            yysymbol_kind_t yykind, YYSTYPE *yyvaluep)
{
  YY_USE (yyvaluep);
  if (!yymsg)
    yymsg = "Deleting";
  YY_SYMBOL_PRINT (yymsg, yykind, yyvaluep, yylocationp);

  YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
  YY_USE (yykind);
  YY_IGNORE_MAYBE_UNINITIALIZED_END
}


/* Lookahead token kind.  */
int yychar;

/* The semantic value of the lookahead symbol.  */
YYSTYPE yylval;
/* Number of syntax errors so far.  */
int yynerrs;




/*----------.
| yyparse.  |
`----------*/

int
yyparse (void)
{
    yy_state_fast_t yystate = 0;
    /* Number of tokens to shift before error messages enabled.  */
    int yyerrstatus = 0;

    /* Refer to the stacks through separate pointers, to allow yyoverflow
       to reallocate them elsewhere.  */

    /* Their size.  */
    YYPTRDIFF_T yystacksize = YYINITDEPTH;

    /* The state stack: array, bottom, top.  */
    yy_state_t yyssa[YYINITDEPTH];
    yy_state_t *yyss = yyssa;
    yy_state_t *yyssp = yyss;

    /* The semantic value stack: array, bottom, top.  */
    YYSTYPE yyvsa[YYINITDEPTH];
    YYSTYPE *yyvs = yyvsa;
    YYSTYPE *yyvsp = yyvs;

  int yyn;
  /* The return value of yyparse.  */
  int yyresult;
  /* Lookahead symbol kind.  */
  yysymbol_kind_t yytoken = YYSYMBOL_YYEMPTY;
  /* The variables used to return semantic value and location from the
     action routines.  */
  YYSTYPE yyval;



#define YYPOPSTACK(N)   (yyvsp -= (N), yyssp -= (N))

  /* The number of symbols on the RHS of the reduced rule.
     Keep to zero when no symbol should be popped.  */
  int yylen = 0;

  YYDPRINTF ((stderr, "Starting parse\n"));

  yychar = SMT2EMPTY; /* Cause a token to be read.  */

  goto yysetstate;


/*------------------------------------------------------------.
| yynewstate -- push a new state, which is found in yystate.  |
`------------------------------------------------------------*/
yynewstate:
  /* In all cases, when you get here, the value and location stacks
     have just been pushed.  So pushing a state here evens the stacks.  */
  yyssp++;


/*--------------------------------------------------------------------.
| yysetstate -- set current state (the top of the stack) to yystate.  |
`--------------------------------------------------------------------*/
yysetstate:
  YYDPRINTF ((stderr, "Entering state %d\n", yystate));
  YY_ASSERT (0 <= yystate && yystate < YYNSTATES);
  YY_IGNORE_USELESS_CAST_BEGIN
  *yyssp = YY_CAST (yy_state_t, yystate);
  YY_IGNORE_USELESS_CAST_END
  YY_STACK_PRINT (yyss, yyssp);

  if (yyss + yystacksize - 1 <= yyssp)
#if !defined yyoverflow && !defined YYSTACK_RELOCATE
    YYNOMEM;
#else
    {
      /* Get the current used size of the three stacks, in elements.  */
      YYPTRDIFF_T yysize = yyssp - yyss + 1;

# if defined yyoverflow
      {
        /* Give user a chance to reallocate the stack.  Use copies of
           these so that the &'s don't force the real ones into
           memory.  */
        yy_state_t *yyss1 = yyss;
        YYSTYPE *yyvs1 = yyvs;

        /* Each stack pointer address is followed by the size of the
           data in use in that stack, in bytes.  This used to be a
           conditional around just the two extra args, but that might
           be undefined if yyoverflow is a macro.  */
        yyoverflow (YY_("memory exhausted"),
                    &yyss1, yysize * YYSIZEOF (*yyssp),
                    &yyvs1, yysize * YYSIZEOF (*yyvsp),
                    &yystacksize);
        yyss = yyss1;
        yyvs = yyvs1;
      }
# else /* defined YYSTACK_RELOCATE */
      /* Extend the stack our own way.  */
      if (YYMAXDEPTH <= yystacksize)
        YYNOMEM;
      yystacksize *= 2;
      if (YYMAXDEPTH < yystacksize)
        yystacksize = YYMAXDEPTH;

      {
        yy_state_t *yyss1 = yyss;
        union yyalloc *yyptr =
          YY_CAST (union yyalloc *,
                   YYSTACK_ALLOC (YY_CAST (YYSIZE_T, YYSTACK_BYTES (yystacksize))));
        if (! yyptr)
          YYNOMEM;
        YYSTACK_RELOCATE (yyss_alloc, yyss);
        YYSTACK_RELOCATE (yyvs_alloc, yyvs);
#  undef YYSTACK_RELOCATE
        if (yyss1 != yyssa)
          YYSTACK_FREE (yyss1);
      }
# endif

      yyssp = yyss + yysize - 1;
      yyvsp = yyvs + yysize - 1;

      YY_IGNORE_USELESS_CAST_BEGIN
      YYDPRINTF ((stderr, "Stack size increased to %ld\n",
                  YY_CAST (long, yystacksize)));
      YY_IGNORE_USELESS_CAST_END

      if (yyss + yystacksize - 1 <= yyssp)
        YYABORT;
    }
#endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */


  if (yystate == YYFINAL)
    YYACCEPT;

  goto yybackup;


/*-----------.
| yybackup.  |
`-----------*/
yybackup:
  /* Do appropriate processing given the current state.  Read a
     lookahead token if we need one and don't already have one.  */

  /* First try to decide what to do without reference to lookahead token.  */
  yyn = yypact[yystate];
  if (yypact_value_is_default (yyn))
    goto yydefault;

  /* Not known => get a lookahead token if don't already have one.  */

  /* YYCHAR is either empty, or end-of-input, or a valid lookahead.  */
  if (yychar == SMT2EMPTY)
    {
      YYDPRINTF ((stderr, "Reading a token\n"));
      yychar = yylex ();
    }

  if (yychar <= END)
    {
      yychar = END;
      yytoken = YYSYMBOL_YYEOF;
      YYDPRINTF ((stderr, "Now at end of input.\n"));
    }
  else if (yychar == SMT2error)
    {
      /* The scanner already issued an error message, process directly
         to error recovery.  But do not keep the error token as
         lookahead, it is too special and may lead us to an endless
         loop in error recovery. */
      yychar = SMT2UNDEF;
      yytoken = YYSYMBOL_YYerror;
      goto yyerrlab1;
    }
  else
    {
      yytoken = YYTRANSLATE (yychar);
      YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
    }

  /* If the proper action on seeing token YYTOKEN is to reduce or to
     detect an error, take that action.  */
  yyn += yytoken;
  if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
    goto yydefault;
  yyn = yytable[yyn];
  if (yyn <= 0)
    {
      if (yytable_value_is_error (yyn))
        goto yyerrlab;
      yyn = -yyn;
      goto yyreduce;
    }

  /* Count tokens shifted since error; after three, turn off error
     status.  */
  if (yyerrstatus)
    yyerrstatus--;

  /* Shift the lookahead token.  */
  YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
  yystate = yyn;
  YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
  *++yyvsp = yylval;
  YY_IGNORE_MAYBE_UNINITIALIZED_END

  /* Discard the shifted token.  */
  yychar = SMT2EMPTY;
  goto yynewstate;


/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state.  |
`-----------------------------------------------------------*/
yydefault:
  yyn = yydefact[yystate];
  if (yyn == 0)
    goto yyerrlab;
  goto yyreduce;


/*-----------------------------.
| yyreduce -- do a reduction.  |
`-----------------------------*/
yyreduce:
  /* yyn is the number of a rule to reduce with.  */
  yylen = yyr2[yyn];

  /* If YYLEN is nonzero, implement the default value of the action:
     '$$ = $1'.

     Otherwise, the following line sets YYVAL to garbage.
     This behavior is undocumented and Bison
     users should not rely upon it.  Assigning to YYVAL
     unconditionally makes the parser a bit smaller, and it avoids a
     GCC warning that YYVAL may be used uninitialized.  */
  yyval = yyvsp[1-yylen];


  YY_REDUCE_PRINT (yyn);
  switch (yyn)
    {
  case 2: /* cmd: commands "end of file"  */
#line 401 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
       stp::GlobalParserInterface->cleanUp();
       YYACCEPT;
}
#line 1862 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 4: /* commands: LPAREN_TOK cmdi RPAREN_TOK  */
#line 410 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{}
#line 1868 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 5: /* cmdi: ASSERT_TOK an_formula  */
#line 415 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
      stp::GlobalParserInterface->AddAssert(*(yyvsp[0].node));
      stp::GlobalParserInterface->deleteNode((yyvsp[0].node));
      stp::GlobalParserInterface->success();
    }
#line 1878 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 6: /* cmdi: CHECK_SAT_TOK  */
#line 422 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
      stp::GlobalParserInterface->checkSat(stp::GlobalParserInterface->getAssertVector());
    }
#line 1886 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 7: /* cmdi: CHECK_SAT_ASSUMING_TOK LPAREN_TOK an_term RPAREN_TOK  */
#line 427 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
      stp::GlobalParserInterface->unsupported();
    }
#line 1894 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 8: /* cmdi: DECLARE_CONST_TOK const_decl  */
#line 432 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
      stp::GlobalParserInterface->success();
    }
#line 1902 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 9: /* cmdi: DECLARE_FUNCTION_TOK var_decl  */
#line 437 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
      stp::GlobalParserInterface->success();
    }
#line 1910 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 10: /* cmdi: DEFINE_FUNCTION_TOK function_def  */
#line 442 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
      stp::GlobalParserInterface->success();
    }
#line 1918 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 11: /* cmdi: ECHO_TOK STRING_TOK  */
#line 447 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
      std::cout << "\"" << *(yyvsp[0].str)  << "\"" << endl;
      delete (yyvsp[0].str);
      stp::GlobalParserInterface->success();
    }
#line 1928 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 12: /* cmdi: EXIT_TOK  */
#line 454 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
       stp::GlobalParserInterface->cleanUp();
       stp::GlobalParserInterface->success();
       YYACCEPT;
    }
#line 1938 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 13: /* cmdi: GET_MODEL_TOK  */
#line 461 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
       stp::GlobalParserInterface->getModel();
    }
#line 1946 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 14: /* cmdi: GET_VALUE_TOK LPAREN_TOK an_mixed RPAREN_TOK  */
#line 466 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
      stp::GlobalParserInterface->getValue(*(yyvsp[-1].vec));
      delete (yyvsp[-1].vec);
    }
#line 1955 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 15: /* cmdi: SET_OPTION_TOK COLON_TOK STRING_TOK STRING_TOK  */
#line 472 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
       stp::GlobalParserInterface->setOption(*(yyvsp[-1].str),*(yyvsp[0].str));
       delete (yyvsp[-1].str);
       delete (yyvsp[0].str);
    }
#line 1965 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 16: /* cmdi: SET_OPTION_TOK COLON_TOK STRING_TOK FALSE_TOK  */
#line 479 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
       stp::GlobalParserInterface->setOption(*(yyvsp[-1].str),"false");
       delete (yyvsp[-1].str);
    }
#line 1974 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 17: /* cmdi: SET_OPTION_TOK COLON_TOK STRING_TOK TRUE_TOK  */
#line 485 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
       stp::GlobalParserInterface->setOption(*(yyvsp[-1].str),"true");
       delete (yyvsp[-1].str);
    }
#line 1983 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 18: /* cmdi: PUSH_TOK NUMERAL_TOK  */
#line 491 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
        for (unsigned i=0; i < (yyvsp[0].uintval);i++)
            stp::GlobalParserInterface->push();
        stp::GlobalParserInterface->success();
    }
#line 1993 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 19: /* cmdi: POP_TOK NUMERAL_TOK  */
#line 498 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
        for (unsigned i=0; i < (yyvsp[0].uintval);i++)
            stp::GlobalParserInterface->pop();
        stp::GlobalParserInterface->success();
    }
#line 2003 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 20: /* cmdi: RESET_TOK  */
#line 505 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
       stp::GlobalParserInterface->reset();
       stp::GlobalParserInterface->success();
    }
#line 2012 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 21: /* cmdi: LOGIC_TOK STRING_TOK  */
#line 511 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
      if (!(0 == strcmp((yyvsp[0].str)->c_str(),"QF_BV") ||
            0 == strcmp((yyvsp[0].str)->c_str(),"QF_ABV") ||
            0 == strcmp((yyvsp[0].str)->c_str(),"QF_AUFBV"))) {
        yyerror("Wrong input logic");
      }
      stp::GlobalParserInterface->success();
      delete (yyvsp[0].str);
    }
#line 2026 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 22: /* cmdi: NOTES_TOK attribute STRING_TOK  */
#line 522 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
      delete (yyvsp[0].str);
      stp::GlobalParserInterface->success();
    }
#line 2035 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 23: /* cmdi: NOTES_TOK attribute DECIMAL_TOK  */
#line 528 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
      stp::GlobalParserInterface->success();
    }
#line 2043 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 24: /* cmdi: NOTES_TOK attribute  */
#line 533 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
    {
      stp::GlobalParserInterface->success();
    }
#line 2051 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 25: /* function_param: LPAREN_TOK STRING_TOK LPAREN_TOK UNDERSCORE_TOK BITVEC_TOK NUMERAL_TOK RPAREN_TOK RPAREN_TOK  */
#line 541 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = new ASTNode(stp::GlobalParserInterface->LookupOrCreateSymbol((yyvsp[-6].str)->c_str()));
  stp::GlobalParserInterface->addSymbol(*(yyval.node));
  (yyval.node)->SetIndexWidth(0);
  (yyval.node)->SetValueWidth((yyvsp[-2].uintval));
  delete (yyvsp[-6].str);
}
#line 2063 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 26: /* function_params: function_param  */
#line 552 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.vec) = new ASTVec;
  (yyval.vec)->push_back(*(yyvsp[0].node));
  delete (yyvsp[0].node);
}
#line 2073 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 27: /* function_params: function_params function_param  */
#line 558 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.vec) = (yyvsp[-1].vec);
  (yyval.vec)->push_back(*(yyvsp[0].node));
  delete (yyvsp[0].node);
}
#line 2083 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 28: /* function_def: STRING_TOK LPAREN_TOK function_params RPAREN_TOK LPAREN_TOK UNDERSCORE_TOK BITVEC_TOK NUMERAL_TOK RPAREN_TOK an_term  */
#line 567 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  if ((yyvsp[0].node)->GetValueWidth() != (yyvsp[-2].uintval))
  {
    char msg [100];
    sprintf(msg, "Different bit-widths specified: %d %d", (yyvsp[0].node)->GetValueWidth(), (yyvsp[-2].uintval));
    yyerror(msg);
  }

  stp::GlobalParserInterface->storeFunction(*(yyvsp[-9].str), *(yyvsp[-7].vec), *(yyvsp[0].node));

  // Next time the variable is used, we want it to be fresh.
  for (size_t i = 0; i < (yyvsp[-7].vec)->size(); i++)
    stp::GlobalParserInterface->removeSymbol((*(yyvsp[-7].vec))[i]);

  delete (yyvsp[-9].str);
  delete (yyvsp[-7].vec);
  delete (yyvsp[0].node);
}
#line 2106 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 29: /* function_def: STRING_TOK LPAREN_TOK function_params RPAREN_TOK BOOL_TOK an_formula  */
#line 587 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  stp::GlobalParserInterface->storeFunction(*(yyvsp[-5].str), *(yyvsp[-3].vec), *(yyvsp[0].node));

  // Next time the variable is used, we want it to be fresh.
  for (size_t i = 0; i < (yyvsp[-3].vec)->size(); i++)
   stp::GlobalParserInterface->removeSymbol((*(yyvsp[-3].vec))[i]);

  delete (yyvsp[-5].str);
  delete (yyvsp[-3].vec);
  delete (yyvsp[0].node);
}
#line 2122 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 30: /* function_def: STRING_TOK LPAREN_TOK RPAREN_TOK BOOL_TOK an_formula  */
#line 600 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  ASTVec empty;
  stp::GlobalParserInterface->storeFunction(*(yyvsp[-4].str), empty, *(yyvsp[0].node));

  delete (yyvsp[-4].str);
  delete (yyvsp[0].node);
}
#line 2134 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 31: /* function_def: STRING_TOK LPAREN_TOK RPAREN_TOK LPAREN_TOK UNDERSCORE_TOK BITVEC_TOK NUMERAL_TOK RPAREN_TOK an_term  */
#line 609 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  if ((yyvsp[0].node)->GetValueWidth() != (yyvsp[-2].uintval))
  {
    char msg [100];
    sprintf(msg, "Different bit-widths specified: %d %d", (yyvsp[0].node)->GetValueWidth(), (yyvsp[-2].uintval));
    yyerror(msg);
  }

  ASTVec empty;
  stp::GlobalParserInterface->storeFunction(*(yyvsp[-8].str),empty, *(yyvsp[0].node));

  delete (yyvsp[-8].str);
  delete (yyvsp[0].node);
}
#line 2153 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 32: /* function_def: STRING_TOK LPAREN_TOK function_params RPAREN_TOK LPAREN_TOK ARRAY_TOK LPAREN_TOK UNDERSCORE_TOK BITVEC_TOK NUMERAL_TOK RPAREN_TOK LPAREN_TOK UNDERSCORE_TOK BITVEC_TOK NUMERAL_TOK RPAREN_TOK RPAREN_TOK an_term  */
#line 625 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  stp::GlobalParserInterface->unsupported();
  delete (yyvsp[-17].str);
  delete (yyvsp[0].node);
}
#line 2163 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 33: /* function_def: STRING_TOK LPAREN_TOK RPAREN_TOK LPAREN_TOK ARRAY_TOK LPAREN_TOK UNDERSCORE_TOK BITVEC_TOK NUMERAL_TOK RPAREN_TOK LPAREN_TOK UNDERSCORE_TOK BITVEC_TOK NUMERAL_TOK RPAREN_TOK RPAREN_TOK an_term  */
#line 632 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  stp::GlobalParserInterface->unsupported();
  delete (yyvsp[-16].str);
  delete (yyvsp[0].node);

#if 0
  ASTNode s = stp::GlobalParserInterface->LookupOrCreateSymbol((yyvsp[-16].str)->c_str());
  stp::GlobalParserInterface->addSymbol(s);
  unsigned int index_len = (yyvsp[-8].uintval);
  unsigned int value_len = (yyvsp[-3].uintval);
  if(index_len > 0) {
    s.SetIndexWidth((yyvsp[-8].uintval));
  }
  else {
    fatal_yyerror("Fatal Error: parsing: BITVECTORS must be of positive length: \n");
  }

  if(value_len > 0) {
    s.SetValueWidth((yyvsp[-3].uintval));
  }
  else {
    fatal_yyerror("Fatal Error: parsing: BITVECTORS must be of positive length: \n");
  }

  ASTVec empty;
  stp::GlobalParserInterface->storeFunction(*(yyvsp[-16].str),empty, *(yyvsp[0].node));
#endif

}
#line 2197 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 34: /* status: STRING_TOK  */
#line 665 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
           {

  std::transform((yyvsp[0].str)->begin(), (yyvsp[0].str)->end(), (yyvsp[0].str)->begin(), ::tolower);
  if (0 == strcmp((yyvsp[0].str)->c_str(), "sat"))
      stp::input_status = TO_BE_SATISFIABLE;
  else if (0 == strcmp((yyvsp[0].str)->c_str(), "unsat"))
    stp::input_status = TO_BE_UNSATISFIABLE;
  else if (0 == strcmp((yyvsp[0].str)->c_str(), "unknown"))
      stp::input_status = TO_BE_UNKNOWN;
  else
      yyerror((yyvsp[0].str)->c_str());
  delete (yyvsp[0].str);
  (yyval.node) = NULL;
}
#line 2216 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 35: /* attribute: SOURCE_TOK  */
#line 683 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{}
#line 2222 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 36: /* attribute: CATEGORY_TOK  */
#line 685 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{}
#line 2228 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 37: /* attribute: DIFFICULTY_TOK  */
#line 687 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{}
#line 2234 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 38: /* attribute: VERSION_TOK  */
#line 689 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{}
#line 2240 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 39: /* attribute: STATUS_TOK status  */
#line 691 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{}
#line 2246 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 41: /* var_decl: STRING_TOK LPAREN_TOK RPAREN_TOK LPAREN_TOK UNDERSCORE_TOK BITVEC_TOK NUMERAL_TOK RPAREN_TOK  */
#line 699 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  ASTNode s = stp::GlobalParserInterface->LookupOrCreateSymbol((yyvsp[-7].str)->c_str());
  stp::GlobalParserInterface->addSymbol(s);
  //Sort_symbs has the indexwidth/valuewidth. Set those fields in
  //var
  s.SetIndexWidth(0);
  s.SetValueWidth((yyvsp[-1].uintval));
  delete (yyvsp[-7].str);
}
#line 2260 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 42: /* var_decl: STRING_TOK LPAREN_TOK RPAREN_TOK BOOL_TOK  */
#line 709 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  ASTNode s = stp::GlobalParserInterface->LookupOrCreateSymbol((yyvsp[-3].str)->c_str());
  s.SetIndexWidth(0);
  s.SetValueWidth(0);
  stp::GlobalParserInterface->addSymbol(s);
  delete (yyvsp[-3].str);
}
#line 2272 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 43: /* var_decl: STRING_TOK LPAREN_TOK RPAREN_TOK LPAREN_TOK ARRAY_TOK LPAREN_TOK UNDERSCORE_TOK BITVEC_TOK NUMERAL_TOK RPAREN_TOK LPAREN_TOK UNDERSCORE_TOK BITVEC_TOK NUMERAL_TOK RPAREN_TOK RPAREN_TOK  */
#line 717 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  ASTNode s = stp::GlobalParserInterface->LookupOrCreateSymbol((yyvsp[-15].str)->c_str());
  stp::GlobalParserInterface->addSymbol(s);
  unsigned int index_len = (yyvsp[-7].uintval);
  unsigned int value_len = (yyvsp[-2].uintval);
  if(index_len > 0) {
    s.SetIndexWidth((yyvsp[-7].uintval));
  }
  else {
    fatal_yyerror("Fatal Error: parsing: BITVECTORS must be of positive length: \n");
  }

  if(value_len > 0) {
    s.SetValueWidth((yyvsp[-2].uintval));
  }
  else {
    fatal_yyerror("Fatal Error: parsing: BITVECTORS must be of positive length: \n");
  }
  delete (yyvsp[-15].str);
}
#line 2297 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 44: /* const_decl: STRING_TOK LPAREN_TOK UNDERSCORE_TOK BITVEC_TOK NUMERAL_TOK RPAREN_TOK  */
#line 742 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  ASTNode s = stp::GlobalParserInterface->LookupOrCreateSymbol((yyvsp[-5].str)->c_str());
  stp::GlobalParserInterface->addSymbol(s);
  //Sort_symbs has the indexwidth/valuewidth. Set those fields in
  //var
  s.SetIndexWidth(0);
  s.SetValueWidth((yyvsp[-1].uintval));
  delete (yyvsp[-5].str);
}
#line 2311 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 45: /* const_decl: STRING_TOK BOOL_TOK  */
#line 752 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  ASTNode s = stp::GlobalParserInterface->LookupOrCreateSymbol((yyvsp[-1].str)->c_str());
  s.SetIndexWidth(0);
  s.SetValueWidth(0);
  stp::GlobalParserInterface->addSymbol(s);
  delete (yyvsp[-1].str);
}
#line 2323 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 46: /* const_decl: STRING_TOK LPAREN_TOK ARRAY_TOK LPAREN_TOK UNDERSCORE_TOK BITVEC_TOK NUMERAL_TOK RPAREN_TOK LPAREN_TOK UNDERSCORE_TOK BITVEC_TOK NUMERAL_TOK RPAREN_TOK RPAREN_TOK  */
#line 760 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  ASTNode s = stp::GlobalParserInterface->LookupOrCreateSymbol((yyvsp[-13].str)->c_str());
  stp::GlobalParserInterface->addSymbol(s);
  unsigned int index_len = (yyvsp[-7].uintval);
  unsigned int value_len = (yyvsp[-2].uintval);
  if(index_len > 0) {
    s.SetIndexWidth((yyvsp[-7].uintval));
  }
  else {
    fatal_yyerror("Fatal Error: parsing: BITVECTORS must be of positive length: \n");
  }

  if(value_len > 0) {
    s.SetValueWidth((yyvsp[-2].uintval));
  }
  else {
    fatal_yyerror("Fatal Error: parsing: BITVECTORS must be of positive length: \n");
  }
  delete (yyvsp[-13].str);
}
#line 2348 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 47: /* an_mixed: an_formula  */
#line 787 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.vec) = new ASTVec;
  if ((yyvsp[0].node) != NULL) {
    (yyval.vec)->push_back(*(yyvsp[0].node));
    stp::GlobalParserInterface->deleteNode((yyvsp[0].node));
  }
}
#line 2360 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 48: /* an_mixed: an_term  */
#line 796 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.vec) = new ASTVec;
  if ((yyvsp[0].node) != NULL) {
    (yyval.vec)->push_back(*(yyvsp[0].node));
    stp::GlobalParserInterface->deleteNode((yyvsp[0].node));
  }
}
#line 2372 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 49: /* an_mixed: an_mixed an_formula  */
#line 805 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  if ((yyvsp[-1].vec) != NULL && (yyvsp[0].node) != NULL) {
    (yyvsp[-1].vec)->push_back(*(yyvsp[0].node));
    (yyval.vec) = (yyvsp[-1].vec);
    stp::GlobalParserInterface->deleteNode((yyvsp[0].node));
  }
}
#line 2384 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 50: /* an_mixed: an_mixed an_term  */
#line 814 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  if ((yyvsp[-1].vec) != NULL && (yyvsp[0].node) != NULL) {
    (yyvsp[-1].vec)->push_back(*(yyvsp[0].node));
    (yyval.vec) = (yyvsp[-1].vec);
    stp::GlobalParserInterface->deleteNode((yyvsp[0].node));
  }
}
#line 2396 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 51: /* an_formulas: an_formula  */
#line 826 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.vec) = new ASTVec;
  if ((yyvsp[0].node) != NULL) {
    (yyval.vec)->push_back(*(yyvsp[0].node));
    stp::GlobalParserInterface->deleteNode((yyvsp[0].node));
  }
}
#line 2408 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 52: /* an_formulas: an_formulas an_formula  */
#line 835 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  if ((yyvsp[-1].vec) != NULL && (yyvsp[0].node) != NULL) {
    (yyvsp[-1].vec)->push_back(*(yyvsp[0].node));
    (yyval.vec) = (yyvsp[-1].vec);
    stp::GlobalParserInterface->deleteNode((yyvsp[0].node));
  }
}
#line 2420 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 53: /* an_formula: TRUE_TOK  */
#line 846 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->CreateNode(TRUE));
  assert(0 == (yyval.node)->GetIndexWidth());
  assert(0 == (yyval.node)->GetValueWidth());
}
#line 2430 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 54: /* an_formula: FALSE_TOK  */
#line 852 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->CreateNode(FALSE));
  assert(0 == (yyval.node)->GetIndexWidth());
  assert(0 == (yyval.node)->GetValueWidth());
}
#line 2440 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 55: /* an_formula: FORMID_TOK  */
#line 858 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = stp::GlobalParserInterface->newNode(*(yyvsp[0].node)); //todo creating then deleting same?
  stp::GlobalParserInterface->deleteNode((yyvsp[0].node));
}
#line 2449 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 56: /* an_formula: LPAREN_TOK EQ_TOK an_terms RPAREN_TOK  */
#line 863 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  const ASTVec& terms = *(yyvsp[-1].vec);

  if (terms.size() ==2)
  {
    (yyval.node) = createNode(EQ, (yyvsp[-1].vec));
  }
  else  if (terms.size() >2) 
  {
    ASTVec result;
    result.reserve(terms.size()-1);
    for (unsigned i =1; i < terms.size();i++)
    {
        result.push_back(stp::GlobalParserInterface->CreateNode(EQ, terms[i], terms[i-1]));
    }
    (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->CreateNode(AND, result));
    delete (yyvsp[-1].vec);
  }
  else
  {
    fatal_yyerror("too few arguments to eq."); 
  }
}
#line 2477 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 57: /* an_formula: LPAREN_TOK DISTINCT_TOK an_terms RPAREN_TOK  */
#line 887 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  using namespace stp;

  ASTVec terms = *(yyvsp[-1].vec);
  ASTVec forms;

  for(ASTVec::const_iterator it=terms.begin(),itend=terms.end();
      it!=itend; it++)
  {
    for(ASTVec::const_iterator it2=it+1; it2!=itend; it2++) {
      ASTNode n =
        stp::GlobalParserInterface->nf->CreateNode(NOT, stp::GlobalParserInterface->CreateNode(EQ, *it, *it2));

      forms.push_back(n);
    }
  }

  if(forms.size() == 0)
    fatal_yyerror("empty distinct");

  (yyval.node) = (forms.size() == 1) ?
    stp::GlobalParserInterface->newNode(forms[0]) :
    stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->CreateNode(AND, forms));

  delete (yyvsp[-1].vec);
}
#line 2508 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 58: /* an_formula: LPAREN_TOK DISTINCT_TOK an_formulas RPAREN_TOK  */
#line 914 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  using namespace stp;

  ASTVec terms = *(yyvsp[-1].vec);
  ASTVec forms;

  for(ASTVec::const_iterator it=terms.begin(),itend=terms.end();
      it!=itend; it++) {
    for(ASTVec::const_iterator it2=it+1; it2!=itend; it2++) {
      ASTNode n = (stp::GlobalParserInterface->nf->CreateNode(NOT, stp::GlobalParserInterface->CreateNode(IFF, *it, *it2)));
      forms.push_back(n);
    }
  }

  if(forms.size() == 0)
    fatal_yyerror("empty distinct");

  (yyval.node) = (forms.size() == 1) ?
    stp::GlobalParserInterface->newNode(forms[0]) :
    stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->CreateNode(AND, forms));

  delete (yyvsp[-1].vec);
}
#line 2536 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 59: /* an_formula: LPAREN_TOK BVSLT_TOK an_term an_term RPAREN_TOK  */
#line 938 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createNode(BVSLT, (yyvsp[-2].node), (yyvsp[-1].node));
}
#line 2544 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 60: /* an_formula: LPAREN_TOK BVSLE_TOK an_term an_term RPAREN_TOK  */
#line 942 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createNode(BVSLE, (yyvsp[-2].node), (yyvsp[-1].node));
}
#line 2552 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 61: /* an_formula: LPAREN_TOK BVSGT_TOK an_term an_term RPAREN_TOK  */
#line 946 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createNode(BVSGT, (yyvsp[-2].node), (yyvsp[-1].node));
}
#line 2560 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 62: /* an_formula: LPAREN_TOK BVSGE_TOK an_term an_term RPAREN_TOK  */
#line 950 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createNode(BVSGE, (yyvsp[-2].node), (yyvsp[-1].node));
}
#line 2568 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 63: /* an_formula: LPAREN_TOK BVLT_TOK an_term an_term RPAREN_TOK  */
#line 954 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createNode(BVLT, (yyvsp[-2].node), (yyvsp[-1].node));
}
#line 2576 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 64: /* an_formula: LPAREN_TOK BVLE_TOK an_term an_term RPAREN_TOK  */
#line 958 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createNode(BVLE, (yyvsp[-2].node), (yyvsp[-1].node));
}
#line 2584 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 65: /* an_formula: LPAREN_TOK BVGT_TOK an_term an_term RPAREN_TOK  */
#line 962 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createNode(BVGT, (yyvsp[-2].node), (yyvsp[-1].node));
}
#line 2592 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 66: /* an_formula: LPAREN_TOK BVGE_TOK an_term an_term RPAREN_TOK  */
#line 966 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createNode(BVGE, (yyvsp[-2].node), (yyvsp[-1].node));
}
#line 2600 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 67: /* an_formula: LPAREN_TOK an_formula RPAREN_TOK  */
#line 970 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = (yyvsp[-1].node);
}
#line 2608 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 68: /* an_formula: LPAREN_TOK NOT_TOK an_formula RPAREN_TOK  */
#line 974 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateNode(NOT, *(yyvsp[-1].node)));
  stp::GlobalParserInterface->deleteNode( (yyvsp[-1].node));
}
#line 2617 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 69: /* an_formula: LPAREN_TOK IMPLIES_TOK an_formulas RPAREN_TOK  */
#line 979 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  ASTVec forms = *(yyvsp[-1].vec);

  if(forms.size() < 2)
    fatal_yyerror("implies should have 2 or more operands");

  while(forms.size() >=2 )
  {
     ASTNode n1 = forms.back();
     forms.pop_back();
     ASTNode n0 = forms.back();
     forms.pop_back();

     ASTNode n = stp::GlobalParserInterface->nf->CreateNode(IMPLIES, n0, n1);
     forms.push_back(n);
  }

  (yyval.node) = stp::GlobalParserInterface->newNode(forms[0]);
  delete (yyvsp[-1].vec);
}
#line 2642 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 70: /* an_formula: LPAREN_TOK ITE_TOK an_formula an_formula an_formula RPAREN_TOK  */
#line 1000 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateNode(ITE, *(yyvsp[-3].node), *(yyvsp[-2].node), *(yyvsp[-1].node)));
  stp::GlobalParserInterface->deleteNode( (yyvsp[-3].node));
  stp::GlobalParserInterface->deleteNode( (yyvsp[-2].node));
  stp::GlobalParserInterface->deleteNode( (yyvsp[-1].node));
}
#line 2653 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 71: /* an_formula: LPAREN_TOK AND_TOK an_formulas RPAREN_TOK  */
#line 1007 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
 (yyval.node) = createNode(AND, (yyvsp[-1].vec));
}
#line 2661 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 72: /* an_formula: LPAREN_TOK OR_TOK an_formulas RPAREN_TOK  */
#line 1011 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createNode(OR, (yyvsp[-1].vec));
}
#line 2669 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 73: /* an_formula: LPAREN_TOK XOR_TOK an_formulas RPAREN_TOK  */
#line 1015 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createNode(XOR, (yyvsp[-1].vec));
}
#line 2677 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 74: /* an_formula: LPAREN_TOK EQ_TOK an_formulas RPAREN_TOK  */
#line 1019 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  const ASTVec& forms = *(yyvsp[-1].vec);

  if (forms.size() ==2)
  {
    (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->CreateNode(IFF, forms));
    delete (yyvsp[-1].vec);
  }
  else  if (forms.size() >2) 
  {
    ASTVec result;
    result.reserve(forms.size()-1);
    for (unsigned i =1; i < forms.size();i++)
    {
        result.push_back(stp::GlobalParserInterface->CreateNode(IFF, forms[i], forms[i-1]));
    }
    (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->CreateNode(AND, result));
    delete (yyvsp[-1].vec);
  }
  else
  {
    fatal_yyerror("too few arguments to formula eq."); 
  }
}
#line 2706 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 75: /* an_formula: LPAREN_TOK LET_TOK lets an_formula RPAREN_TOK  */
#line 1044 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
  {
    (yyval.node) = (yyvsp[-1].node);
    stp::GlobalParserInterface->letMgr->pop();
  }
#line 2715 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 76: /* an_formula: LPAREN_TOK BOOLEAN_FUNCTIONID_TOK an_mixed RPAREN_TOK  */
#line 1049 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->applyFunction(*(yyvsp[-2].str),*(yyvsp[-1].vec)));
  delete (yyvsp[-2].str);
  delete (yyvsp[-1].vec);
}
#line 2725 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 77: /* an_formula: BOOLEAN_FUNCTIONID_TOK  */
#line 1055 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  ASTVec empty;
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->applyFunction(*(yyvsp[0].str),empty));
  delete (yyvsp[0].str);
}
#line 2735 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 78: /* an_formula: LPAREN_TOK EXCLAIMATION_MARK_TOK an_formula NAMED_ATTRIBUTE_TOK STRING_TOK RPAREN_TOK  */
#line 1061 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  /*
    This implements (! <an_formula> :named foo)
    "foo" is created as a symbol that can be refered to by later commands.
  */

  // TODO, will fail if name is already defined?
  ASTNode s(stp::GlobalParserInterface->LookupOrCreateSymbol((yyvsp[-1].str)->c_str()));
  s.SetIndexWidth((yyvsp[-3].node)->GetIndexWidth());
  s.SetValueWidth((yyvsp[-3].node)->GetValueWidth());

  stp::GlobalParserInterface->addSymbol(s);

  ASTNode n = stp::GlobalParserInterface->CreateNode(IFF,s, *(yyvsp[-3].node));

  stp::GlobalParserInterface->AddAssert(n);

  delete (yyvsp[-1].str);

  (yyval.node) = (yyvsp[-3].node);
}
#line 2761 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 79: /* $@1: %empty  */
#line 1085 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
    stp::GlobalParserInterface->letMgr->push();
}
#line 2769 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 80: /* lets: LPAREN_TOK $@1 inside-lets RPAREN_TOK  */
#line 1090 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  // We don't want any of the lets we've just created to intefere with each other, so keep them out of resolution until now.

  stp::GlobalParserInterface->letMgr->commit();
}
#line 2779 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 82: /* inside-lets: let  */
#line 1098 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{}
#line 2785 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 83: /* $@2: %empty  */
#line 1101 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  // Set lexer to only return symbols.
  stringOnly = true;
}
#line 2794 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 84: /* $@3: %empty  */
#line 1106 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  // Set it back to normal.
  stringOnly = false;
}
#line 2803 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 85: /* let: LPAREN_TOK $@2 STRING_TOK $@3 an_mixed RPAREN_TOK  */
#line 1111 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  stp::GlobalParserInterface->letMgr->LetExprMgr(*(yyvsp[-3].str),((yyvsp[-1].vec)->back()));
  delete (yyvsp[-3].str);
  delete (yyvsp[-1].vec);
}
#line 2813 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 86: /* an_terms: an_term  */
#line 1120 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.vec) = new ASTVec;
  if ((yyvsp[0].node) != NULL) {
    (yyval.vec)->push_back(*(yyvsp[0].node));
    stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));

  }
}
#line 2826 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 87: /* an_terms: an_terms an_term  */
#line 1130 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  if ((yyvsp[-1].vec) != NULL && (yyvsp[0].node) != NULL) {
    (yyvsp[-1].vec)->push_back(*(yyvsp[0].node));
    (yyval.vec) = (yyvsp[-1].vec);
    stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
  }
}
#line 2838 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 88: /* an_term: TERMID_TOK  */
#line 1141 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = stp::GlobalParserInterface->newNode((*(yyvsp[0].node)));
  stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
}
#line 2847 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 89: /* an_term: LPAREN_TOK an_term RPAREN_TOK  */
#line 1146 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = (yyvsp[-1].node);
}
#line 2855 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 90: /* an_term: SELECT_TOK an_term an_term  */
#line 1150 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  //ARRAY READ
  // valuewidth is same as array, indexwidth is 0.
  ASTNode array = *(yyvsp[-1].node);
  ASTNode index = *(yyvsp[0].node);
  unsigned int width = array.GetValueWidth();
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateTerm(READ, width, array, index));
  stp::GlobalParserInterface->deleteNode( (yyvsp[-1].node));
  stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
}
#line 2870 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 91: /* an_term: STORE_TOK an_term an_term an_term  */
#line 1161 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  //ARRAY WRITE
  unsigned int width = (yyvsp[0].node)->GetValueWidth();
  ASTNode array = *(yyvsp[-2].node);
  ASTNode index = *(yyvsp[-1].node);
  ASTNode writeval = *(yyvsp[0].node);
  ASTNode write_term = stp::GlobalParserInterface->nf->CreateArrayTerm(WRITE,(yyvsp[-2].node)->GetIndexWidth(),width,array,index,writeval);
  (yyval.node) = stp::GlobalParserInterface->newNode(write_term);
  stp::GlobalParserInterface->deleteNode( (yyvsp[-2].node));
  stp::GlobalParserInterface->deleteNode( (yyvsp[-1].node));
  stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
}
#line 2887 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 92: /* an_term: LPAREN_TOK UNDERSCORE_TOK BVEXTRACT_TOK NUMERAL_TOK NUMERAL_TOK RPAREN_TOK an_term  */
#line 1174 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  int width = (yyvsp[-3].uintval) - (yyvsp[-2].uintval) + 1;
  if (width < 0)
    yyerror("Negative width in extract");

  if((unsigned)(yyvsp[-3].uintval) >= (yyvsp[0].node)->GetValueWidth())
    yyerror("Parsing: Wrong width in BVEXTRACT\n");

  ASTNode hi  =  stp::GlobalParserInterface->CreateBVConst(32, (yyvsp[-3].uintval));
  ASTNode low =  stp::GlobalParserInterface->CreateBVConst(32, (yyvsp[-2].uintval));
  ASTNode output = stp::GlobalParserInterface->nf->CreateTerm(BVEXTRACT, width, *(yyvsp[0].node),hi,low);
  ASTNode * n = stp::GlobalParserInterface->newNode(output);
  (yyval.node) = n;
    stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
}
#line 2907 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 93: /* an_term: LPAREN_TOK UNDERSCORE_TOK BVZX_TOK NUMERAL_TOK RPAREN_TOK an_term  */
#line 1190 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  unsigned w = (yyvsp[0].node)->GetValueWidth() + (yyvsp[-2].uintval);
  ASTNode width = stp::GlobalParserInterface->CreateBVConst(32,w);
  (yyval.node) =  stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateTerm(BVZX,w,*(yyvsp[0].node),width));
  stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
}
#line 2918 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 94: /* an_term: LPAREN_TOK UNDERSCORE_TOK BVSX_TOK NUMERAL_TOK RPAREN_TOK an_term  */
#line 1197 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  unsigned w = (yyvsp[0].node)->GetValueWidth() + (yyvsp[-2].uintval);
  ASTNode width = stp::GlobalParserInterface->CreateBVConst(32,w);
  (yyval.node) =  stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateTerm(BVSX,w,*(yyvsp[0].node),width));
  stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
}
#line 2929 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 95: /* an_term: ITE_TOK an_formula an_term an_term  */
#line 1205 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  const unsigned int width = (yyvsp[-1].node)->GetValueWidth();
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateArrayTerm(ITE,(yyvsp[0].node)->GetIndexWidth(), width,*(yyvsp[-2].node), *(yyvsp[-1].node), *(yyvsp[0].node)));
  stp::GlobalParserInterface->deleteNode( (yyvsp[-2].node));
  stp::GlobalParserInterface->deleteNode( (yyvsp[-1].node));
  stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
}
#line 2941 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 96: /* an_term: BVCONCAT_TOK an_term an_term  */
#line 1213 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  const unsigned int width = (yyvsp[-1].node)->GetValueWidth() + (yyvsp[0].node)->GetValueWidth();
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateTerm(BVCONCAT, width, *(yyvsp[-1].node), *(yyvsp[0].node)));
  stp::GlobalParserInterface->deleteNode( (yyvsp[-1].node));
  stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
}
#line 2952 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 97: /* an_term: BVNOT_TOK an_term  */
#line 1220 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  //this is the BVNEG (term) in the CVCL language
  unsigned int width = (yyvsp[0].node)->GetValueWidth();
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateTerm(BVNOT, width, *(yyvsp[0].node)));
  stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
}
#line 2963 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 98: /* an_term: BVNEG_TOK an_term  */
#line 1227 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  //this is the BVUMINUS term in CVCL langauge
  unsigned width = (yyvsp[0].node)->GetValueWidth();
  (yyval.node) =  stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateTerm(BVUMINUS,width,*(yyvsp[0].node)));
  stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
}
#line 2974 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 99: /* an_term: LPAREN_TOK BVAND_TOK an_terms RPAREN_TOK  */
#line 1234 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
 (yyval.node) = createTerm(BVAND, (yyvsp[-1].vec));
}
#line 2982 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 100: /* an_term: LPAREN_TOK BVOR_TOK an_terms RPAREN_TOK  */
#line 1238 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createTerm(BVOR, (yyvsp[-1].vec));
}
#line 2990 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 101: /* an_term: LPAREN_TOK BVXOR_TOK an_terms RPAREN_TOK  */
#line 1242 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createTerm(BVXOR, (yyvsp[-1].vec));
}
#line 2998 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 102: /* an_term: LPAREN_TOK BVXNOR_TOK an_term an_term RPAREN_TOK  */
#line 1246 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  ASTNode *temp = createTerm(BVXOR, (yyvsp[-2].node), (yyvsp[-1].node));
  const unsigned int width = temp->GetValueWidth();
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateTerm(BVNOT, width, *temp));
  stp::GlobalParserInterface->deleteNode( temp);
}
#line 3009 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 103: /* an_term: BVCOMP_TOK an_term an_term  */
#line 1253 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateTerm(ITE, 1,
  stp::GlobalParserInterface->nf->CreateNode(EQ, *(yyvsp[-1].node), *(yyvsp[0].node)),
  stp::GlobalParserInterface->CreateOneConst(1),
  stp::GlobalParserInterface->CreateZeroConst(1)));

  stp::GlobalParserInterface->deleteNode( (yyvsp[-1].node));
  stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
}
#line 3023 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 104: /* an_term: BVSUB_TOK an_term an_term  */
#line 1263 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createTerm(BVSUB, (yyvsp[-1].node), (yyvsp[0].node));
}
#line 3031 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 105: /* an_term: LPAREN_TOK BVPLUS_TOK an_terms RPAREN_TOK  */
#line 1267 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createTerm(BVPLUS, (yyvsp[-1].vec));
}
#line 3039 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 106: /* an_term: LPAREN_TOK BVMULT_TOK an_terms RPAREN_TOK  */
#line 1271 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createTerm(BVMULT, (yyvsp[-1].vec));
}
#line 3047 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 107: /* an_term: BVDIV_TOK an_term an_term  */
#line 1275 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createTerm(BVDIV, (yyvsp[-1].node), (yyvsp[0].node));
}
#line 3055 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 108: /* an_term: BVMOD_TOK an_term an_term  */
#line 1279 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createTerm(BVMOD, (yyvsp[-1].node), (yyvsp[0].node));
}
#line 3063 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 109: /* an_term: SBVDIV_TOK an_term an_term  */
#line 1283 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createTerm(SBVDIV, (yyvsp[-1].node), (yyvsp[0].node));
}
#line 3071 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 110: /* an_term: SBVREM_TOK an_term an_term  */
#line 1287 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createTerm(SBVREM, (yyvsp[-1].node), (yyvsp[0].node));
}
#line 3079 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 111: /* an_term: SBVMOD_TOK an_term an_term  */
#line 1291 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = createTerm(SBVMOD, (yyvsp[-1].node), (yyvsp[0].node));
}
#line 3087 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 112: /* an_term: BVNAND_TOK an_term an_term  */
#line 1295 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  unsigned int width = (yyvsp[-1].node)->GetValueWidth();
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateTerm(BVNOT, width, stp::GlobalParserInterface->nf->CreateTerm(BVAND, width, *(yyvsp[-1].node), *(yyvsp[0].node))));
  stp::GlobalParserInterface->deleteNode( (yyvsp[-1].node));
  stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
}
#line 3098 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 113: /* an_term: BVNOR_TOK an_term an_term  */
#line 1302 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  unsigned int width = (yyvsp[-1].node)->GetValueWidth();
  (yyval.node)= stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateTerm(BVNOT, width, stp::GlobalParserInterface->nf->CreateTerm(BVOR, width, *(yyvsp[-1].node), *(yyvsp[0].node))));
  stp::GlobalParserInterface->deleteNode( (yyvsp[-1].node));
  stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
}
#line 3109 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 114: /* an_term: BVLEFTSHIFT_1_TOK an_term an_term  */
#line 1309 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
   (yyval.node) = createTerm(BVLEFTSHIFT, (yyvsp[-1].node), (yyvsp[0].node));
}
#line 3117 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 115: /* an_term: BVRIGHTSHIFT_1_TOK an_term an_term  */
#line 1313 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
   (yyval.node) = createTerm(BVRIGHTSHIFT, (yyvsp[-1].node), (yyvsp[0].node));
}
#line 3125 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 116: /* an_term: BVARITHRIGHTSHIFT_TOK an_term an_term  */
#line 1317 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
   (yyval.node) = createTerm(BVSRSHIFT, (yyvsp[-1].node), (yyvsp[0].node));
}
#line 3133 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 117: /* an_term: LPAREN_TOK UNDERSCORE_TOK BVROTATE_LEFT_TOK NUMERAL_TOK RPAREN_TOK an_term  */
#line 1321 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  ASTNode *n;
  unsigned width = (yyvsp[0].node)->GetValueWidth();
  unsigned rotate = (yyvsp[-2].uintval) % width;
  if (0 == rotate)
  {
      n = (yyvsp[0].node);
  }
  else
  {
    ASTNode high = stp::GlobalParserInterface->CreateBVConst(32,width-1);
    ASTNode zero = stp::GlobalParserInterface->CreateBVConst(32,0);
    ASTNode cut = stp::GlobalParserInterface->CreateBVConst(32,width-rotate);
    ASTNode cutMinusOne = stp::GlobalParserInterface->CreateBVConst(32,width-rotate-1);

    ASTNode top =  stp::GlobalParserInterface->nf->CreateTerm(BVEXTRACT,rotate,*(yyvsp[0].node),high, cut);
    ASTNode bottom =  stp::GlobalParserInterface->nf->CreateTerm(BVEXTRACT,width-rotate,*(yyvsp[0].node),cutMinusOne,zero);
    n =  stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateTerm(BVCONCAT,width,bottom,top));
    stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
  }
  (yyval.node) = n;
}
#line 3160 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 118: /* an_term: LPAREN_TOK UNDERSCORE_TOK BVROTATE_RIGHT_TOK NUMERAL_TOK RPAREN_TOK an_term  */
#line 1344 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  ASTNode *n;
  unsigned width = (yyvsp[0].node)->GetValueWidth();
  unsigned rotate = (yyvsp[-2].uintval) % width;
  if (0 == rotate)
  {
      n = (yyvsp[0].node);
  }
  else
  {
    ASTNode high = stp::GlobalParserInterface->CreateBVConst(32,width-1);
    ASTNode zero = stp::GlobalParserInterface->CreateBVConst(32,0);
    ASTNode cut = stp::GlobalParserInterface->CreateBVConst(32,rotate);
    ASTNode cutMinusOne = stp::GlobalParserInterface->CreateBVConst(32,rotate-1);

    ASTNode bottom =  stp::GlobalParserInterface->nf->CreateTerm(BVEXTRACT,rotate,*(yyvsp[0].node),cutMinusOne, zero);
    ASTNode top =  stp::GlobalParserInterface->nf->CreateTerm(BVEXTRACT,width-rotate,*(yyvsp[0].node),high,cut);
    n =  stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->nf->CreateTerm(BVCONCAT,width,bottom,top));
    stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
  }
  (yyval.node) = n;
}
#line 3187 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 119: /* an_term: LPAREN_TOK UNDERSCORE_TOK BVREPEAT_TOK NUMERAL_TOK RPAREN_TOK an_term  */
#line 1367 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  unsigned count = (yyvsp[-2].uintval);
  if (count < 1)
      fatal_yyerror("One or more repeats please");

  unsigned w = (yyvsp[0].node)->GetValueWidth();
  ASTNode n =  *(yyvsp[0].node);

  for (unsigned i =1; i < count; i++)
  {
        n = stp::GlobalParserInterface->nf->CreateTerm(BVCONCAT,w*(i+1),n,*(yyvsp[0].node));
  }
  (yyval.node) = stp::GlobalParserInterface->newNode(n);
  stp::GlobalParserInterface->deleteNode( (yyvsp[0].node));
}
#line 3207 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 120: /* an_term: UNDERSCORE_TOK BVCONST_DECIMAL_TOK NUMERAL_TOK  */
#line 1383 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->CreateBVConst(*(yyvsp[-1].str), 10, (yyvsp[0].uintval)));
  (yyval.node)->SetValueWidth((yyvsp[0].uintval));
  delete (yyvsp[-1].str);
}
#line 3217 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 121: /* an_term: BVCONST_HEXIDECIMAL_TOK  */
#line 1389 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  unsigned width = (yyvsp[0].str)->length()*4;
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->CreateBVConst(*(yyvsp[0].str), 16, width));
  (yyval.node)->SetValueWidth(width);
  delete (yyvsp[0].str);
}
#line 3228 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 122: /* an_term: BVCONST_BINARY_TOK  */
#line 1396 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  unsigned width = (yyvsp[0].str)->length();
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->CreateBVConst(*(yyvsp[0].str), 2, width));
  (yyval.node)->SetValueWidth(width);
  delete (yyvsp[0].str);
}
#line 3239 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 123: /* an_term: LPAREN_TOK BITVECTOR_FUNCTIONID_TOK an_mixed RPAREN_TOK  */
#line 1403 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->applyFunction(*(yyvsp[-2].str),*(yyvsp[-1].vec)));

  if ((yyval.node)->GetType() != BITVECTOR_TYPE)
      yyerror("Must be bitvector type");

  delete (yyvsp[-2].str);
  delete (yyvsp[-1].vec);
}
#line 3253 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 124: /* an_term: BITVECTOR_FUNCTIONID_TOK  */
#line 1413 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  ASTVec empty;
  (yyval.node) = stp::GlobalParserInterface->newNode(stp::GlobalParserInterface->applyFunction(*(yyvsp[0].str),empty));

  if ((yyval.node)->GetType() != BITVECTOR_TYPE)
    yyerror("Must be bitvector type");

  delete (yyvsp[0].str);
}
#line 3267 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 125: /* an_term: LPAREN_TOK EXCLAIMATION_MARK_TOK an_term NAMED_ATTRIBUTE_TOK STRING_TOK RPAREN_TOK  */
#line 1423 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
{
  /* This implements (! <an_term> :named foo) */

  ASTNode s(stp::GlobalParserInterface->LookupOrCreateSymbol((yyvsp[-1].str)->c_str()));
  delete (yyvsp[-1].str);

  s.SetIndexWidth((yyvsp[-3].node)->GetIndexWidth());
  s.SetValueWidth((yyvsp[-3].node)->GetValueWidth());

  stp::GlobalParserInterface->addSymbol(s);

  ASTNode n = stp::GlobalParserInterface->CreateNode(EQ,s, *(yyvsp[-3].node));

  stp::GlobalParserInterface->AddAssert(n);

  (yyval.node) = (yyvsp[-3].node);
}
#line 3289 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;

  case 126: /* an_term: LPAREN_TOK LET_TOK lets an_term RPAREN_TOK  */
#line 1441 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"
  {
    (yyval.node) = (yyvsp[-1].node);
    stp::GlobalParserInterface->letMgr->pop();
  }
#line 3298 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"
    break;


#line 3302 "/build/stp/src/build/lib/Parser/parsesmt2.tab.c"

      default: break;
    }
  /* User semantic actions sometimes alter yychar, and that requires
     that yytoken be updated with the new translation.  We take the
     approach of translating immediately before every use of yytoken.
     One alternative is translating here after every semantic action,
     but that translation would be missed if the semantic action invokes
     YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
     if it invokes YYBACKUP.  In the case of YYABORT or YYACCEPT, an
     incorrect destructor might then be invoked immediately.  In the
     case of YYERROR or YYBACKUP, subsequent parser actions might lead
     to an incorrect destructor call or verbose syntax error message
     before the lookahead is translated.  */
  YY_SYMBOL_PRINT ("-> $$ =", YY_CAST (yysymbol_kind_t, yyr1[yyn]), &yyval, &yyloc);

  YYPOPSTACK (yylen);
  yylen = 0;

  *++yyvsp = yyval;

  /* Now 'shift' the result of the reduction.  Determine what state
     that goes to, based on the state we popped back to and the rule
     number reduced by.  */
  {
    const int yylhs = yyr1[yyn] - YYNTOKENS;
    const int yyi = yypgoto[yylhs] + *yyssp;
    yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyssp
               ? yytable[yyi]
               : yydefgoto[yylhs]);
  }

  goto yynewstate;


/*--------------------------------------.
| yyerrlab -- here on detecting error.  |
`--------------------------------------*/
yyerrlab:
  /* Make sure we have latest lookahead translation.  See comments at
     user semantic actions for why this is necessary.  */
  yytoken = yychar == SMT2EMPTY ? YYSYMBOL_YYEMPTY : YYTRANSLATE (yychar);
  /* If not already recovering from an error, report this error.  */
  if (!yyerrstatus)
    {
      ++yynerrs;
      yyerror (YY_("syntax error"));
    }

  if (yyerrstatus == 3)
    {
      /* If just tried and failed to reuse lookahead token after an
         error, discard it.  */

      if (yychar <= END)
        {
          /* Return failure if at end of input.  */
          if (yychar == END)
            YYABORT;
        }
      else
        {
          yydestruct ("Error: discarding",
                      yytoken, &yylval);
          yychar = SMT2EMPTY;
        }
    }

  /* Else will try to reuse lookahead token after shifting the error
     token.  */
  goto yyerrlab1;


/*---------------------------------------------------.
| yyerrorlab -- error raised explicitly by YYERROR.  |
`---------------------------------------------------*/
yyerrorlab:
  /* Pacify compilers when the user code never invokes YYERROR and the
     label yyerrorlab therefore never appears in user code.  */
  if (0)
    YYERROR;
  ++yynerrs;

  /* Do not reclaim the symbols of the rule whose action triggered
     this YYERROR.  */
  YYPOPSTACK (yylen);
  yylen = 0;
  YY_STACK_PRINT (yyss, yyssp);
  yystate = *yyssp;
  goto yyerrlab1;


/*-------------------------------------------------------------.
| yyerrlab1 -- common code for both syntax error and YYERROR.  |
`-------------------------------------------------------------*/
yyerrlab1:
  yyerrstatus = 3;      /* Each real token shifted decrements this.  */

  /* Pop stack until we find a state that shifts the error token.  */
  for (;;)
    {
      yyn = yypact[yystate];
      if (!yypact_value_is_default (yyn))
        {
          yyn += YYSYMBOL_YYerror;
          if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYSYMBOL_YYerror)
            {
              yyn = yytable[yyn];
              if (0 < yyn)
                break;
            }
        }

      /* Pop the current state because it cannot handle the error token.  */
      if (yyssp == yyss)
        YYABORT;


      yydestruct ("Error: popping",
                  YY_ACCESSING_SYMBOL (yystate), yyvsp);
      YYPOPSTACK (1);
      yystate = *yyssp;
      YY_STACK_PRINT (yyss, yyssp);
    }

  YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
  *++yyvsp = yylval;
  YY_IGNORE_MAYBE_UNINITIALIZED_END


  /* Shift the error token.  */
  YY_SYMBOL_PRINT ("Shifting", YY_ACCESSING_SYMBOL (yyn), yyvsp, yylsp);

  yystate = yyn;
  goto yynewstate;


/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here.  |
`-------------------------------------*/
yyacceptlab:
  yyresult = 0;
  goto yyreturnlab;


/*-----------------------------------.
| yyabortlab -- YYABORT comes here.  |
`-----------------------------------*/
yyabortlab:
  yyresult = 1;
  goto yyreturnlab;


/*-----------------------------------------------------------.
| yyexhaustedlab -- YYNOMEM (memory exhaustion) comes here.  |
`-----------------------------------------------------------*/
yyexhaustedlab:
  yyerror (YY_("memory exhausted"));
  yyresult = 2;
  goto yyreturnlab;


/*----------------------------------------------------------.
| yyreturnlab -- parsing is finished, clean up and return.  |
`----------------------------------------------------------*/
yyreturnlab:
  if (yychar != SMT2EMPTY)
    {
      /* Make sure we have latest lookahead translation.  See comments at
         user semantic actions for why this is necessary.  */
      yytoken = YYTRANSLATE (yychar);
      yydestruct ("Cleanup: discarding lookahead",
                  yytoken, &yylval);
    }
  /* Do not reclaim the symbols of the rule whose action triggered
     this YYABORT or YYACCEPT.  */
  YYPOPSTACK (yylen);
  YY_STACK_PRINT (yyss, yyssp);
  while (yyssp != yyss)
    {
      yydestruct ("Cleanup: popping",
                  YY_ACCESSING_SYMBOL (+*yyssp), yyvsp);
      YYPOPSTACK (1);
    }
#ifndef yyoverflow
  if (yyss != yyssa)
    YYSTACK_FREE (yyss);
#endif

  return yyresult;
}

#line 1447 "/build/stp/src/stp-2.3.4/lib/Parser/smt2.y"


namespace stp {
  int SMT2Parse() {
    GlobalParserInterface->letMgr->frameMode = true;
    return smt2parse();
  }
}
