Generate code for options with modes. (#3561)

This commit adds support for code generation of options with modes (enums). From now on option enums can be specified in the corresponding *.toml files without the need of extra code. All option enums are now in the options namespace.

1 files changed, 0 insertions, 370 deletions

diff --git a/src/options/quantifiers_modes.h b/src/options/quantifiers_modes.h
deleted file mode 100644
index 1a256b0bc..000000000
--- a/src/options/quantifiers_modes.h
+++ /dev/null
@@ -1,370 +0,0 @@
-/*********************                                                        */
-/*! \file quantifiers_modes.h
- ** \verbatim
- ** Top contributors (to current version):
- **   Andrew Reynolds, Tim King, Morgan Deters
- ** This file is part of the CVC4 project.
- ** Copyright (c) 2009-2019 by the authors listed in the file AUTHORS
- ** in the top-level source directory) and their institutional affiliations.
- ** All rights reserved.  See the file COPYING in the top-level source
- ** directory for licensing information.\endverbatim
- **
- ** \brief [[ Add one-line brief description here ]]
- **
- ** [[ Add lengthier description here ]]
- ** \todo document this file
- **/
-
-#include "cvc4_public.h"
-
-#ifndef CVC4__BASE__QUANTIFIERS_MODES_H
-#define CVC4__BASE__QUANTIFIERS_MODES_H
-
-#include <iostream>
-
-namespace CVC4 {
-namespace theory {
-namespace quantifiers {
-
-enum InstWhenMode {
-  /** Apply instantiation round before full effort (possibly at standard effort) */
-  INST_WHEN_PRE_FULL,
-  /** Apply instantiation round at full effort or above  */
-  INST_WHEN_FULL,
-  /** Apply instantiation round at full effort, after all other theories finish, or above  */
-  INST_WHEN_FULL_DELAY,
-  /** Apply instantiation round at full effort half the time, and last call always */
-  INST_WHEN_FULL_LAST_CALL,
-  /** Apply instantiation round at full effort after all other theories finish half the time, and last call always */
-  INST_WHEN_FULL_DELAY_LAST_CALL,
-  /** Apply instantiation round at last call only */
-  INST_WHEN_LAST_CALL,
-};
-
-enum LiteralMatchMode {
-  /** Do not consider polarity of patterns */
-  LITERAL_MATCH_NONE,
-  /** Conservatively consider polarity of patterns */
-  LITERAL_MATCH_USE,
-  /** Aggressively consider polarity of Boolean predicates */
-  LITERAL_MATCH_AGG_PREDICATE,
-  /** Aggressively consider polarity of all terms */
-  LITERAL_MATCH_AGG,
-};
-
-enum MbqiMode {
-  /** no mbqi */
-  MBQI_NONE,
-  /** default, mbqi from Section 5.4.2 of AJR thesis */
-  MBQI_FMC,
-  /** mbqi trust (produce no instantiations) */
-  MBQI_TRUST,
-};
-
-enum QcfWhenMode {
-  /** default, apply at full effort */
-  QCF_WHEN_MODE_DEFAULT,
-  /** apply at last call */
-  QCF_WHEN_MODE_LAST_CALL,
-  /** apply at standard effort */
-  QCF_WHEN_MODE_STD,
-  /** apply based on heuristics */
-  QCF_WHEN_MODE_STD_H,
-};
-
-enum QcfMode {
-  /** default, use qcf for conflicts only */
-  QCF_CONFLICT_ONLY,
-  /** use qcf for conflicts and propagations */
-  QCF_PROP_EQ,
-  /** use qcf for conflicts, propagations and heuristic instantiations */
-  QCF_PARTIAL,
-};
-
-/** User pattern mode.
-*
-* These modes determine how user provided patterns (triggers) are
-* used during E-matching. The modes vary on when instantiation based on
-* user-provided triggers is combined with instantiation based on
-* automatically selected triggers.
-*/
-enum UserPatMode
-{
-  /** First instantiate based on user-provided triggers. If no instantiations
-  * are produced, use automatically selected triggers.
-  */
-  USER_PAT_MODE_USE,
-  /** Default, if triggers are supplied for a quantifier, use only those. */
-  USER_PAT_MODE_TRUST,
-  /** Resort to user triggers only when no instantiations are
-  * produced by automatically selected triggers
-  */
-  USER_PAT_MODE_RESORT,
-  /** Ignore user patterns. */
-  USER_PAT_MODE_IGNORE,
-  /** Interleave use/resort modes for quantified formulas with user patterns. */
-  USER_PAT_MODE_INTERLEAVE,
-};
-
-/** Trigger selection mode.
-*
-* These modes are used for determining which terms to select
-* as triggers for quantified formulas, when necessary, during E-matching.
-* In the following, note the following terminology. A trigger is a set of terms,
-* where a single trigger is a singleton set and a multi-trigger is a set of more
-* than one term.
-*
-* TRIGGER_SEL_MIN selects single triggers of minimal term size.
-* TRIGGER_SEL_MAX selects single triggers of maximal term size.
-*
-* For example, consider the quantified formula :
-*   forall xy. P( f( g( x, y ) ) ) V Q( f( x ), y )
-*
-* TRIGGER_SEL_MIN will select g( x, y ) and Q( f( x ), y ).
-* TRIGGER_SEL_MAX will select P( f( g( x ) ) ) and Q( f( x ), y ).
-*
-* The remaining three trigger selections make a difference for multi-triggers
-* only. For quantified formulas that require multi-triggers, we build a set of
-* partial triggers that don't contain all variables, call this set S. Then,
-* multi-triggers are built by taking a random subset of S that collectively
-* contains all variables.
-*
-* Consider the quantified formula :
-*   forall xyz. P( h( x ), y ) V Q( y, z )
-*
-* For TRIGGER_SEL_ALL and TRIGGER_SEL_MIN_SINGLE_ALL,
-*   S = { h( x ), P( h( x ), y ), Q( y, z ) }.
-* For TRIGGER_SEL_MIN_SINGLE_MAX,
-*   S = { P( h( x ), y ), Q( y, z ) }.
-*
-* Furthermore, TRIGGER_SEL_MIN_SINGLE_ALL and TRIGGER_SEL_MIN_SINGLE_MAX, when
-* selecting single triggers, only select terms of minimal size.
-*/
-enum TriggerSelMode {
-  /** only consider minimal terms for triggers */
-  TRIGGER_SEL_MIN,
-  /** only consider maximal terms for triggers */
-  TRIGGER_SEL_MAX,
-  /** consider minimal terms for single triggers, maximal for non-single */
-  TRIGGER_SEL_MIN_SINGLE_MAX,
-  /** consider minimal terms for single triggers, all for non-single */
-  TRIGGER_SEL_MIN_SINGLE_ALL,
-  /** consider all terms for triggers */
-  TRIGGER_SEL_ALL,
-};
-
-enum TriggerActiveSelMode {
-  /** always use all triggers */
-  TRIGGER_ACTIVE_SEL_ALL,
-  /** only use triggers with minimal # of ground terms */
-  TRIGGER_ACTIVE_SEL_MIN,
-  /** only use triggers with maximal # of ground terms */
-  TRIGGER_ACTIVE_SEL_MAX,
-};
-
-enum CVC4_PUBLIC PrenexQuantMode {
-  /** do not prenex */
-  PRENEX_QUANT_NONE,
-  /** prenex same sign quantifiers */
-  PRENEX_QUANT_SIMPLE,
-  /** aggressive prenex, disjunctive prenex normal form */
-  PRENEX_QUANT_DISJ_NORMAL,
-  /** prenex normal form */
-  PRENEX_QUANT_NORMAL,
-};
-
-enum TermDbMode {
-  /** consider all terms in master equality engine */
-  TERM_DB_ALL,
-  /** consider only relevant terms */
-  TERM_DB_RELEVANT,
-};
-
-enum IteLiftQuantMode {
-  /** do not lift ITEs in quantified formulas */
-  ITE_LIFT_QUANT_MODE_NONE,
-  /** only lift ITEs in quantified formulas if reduces the term size */
-  ITE_LIFT_QUANT_MODE_SIMPLE,
-  /** lift ITEs  */
-  ITE_LIFT_QUANT_MODE_ALL,
-};
-
-enum CbqiBvIneqMode
-{
-  /** solve for inequalities using slack values in model */
-  CBQI_BV_INEQ_EQ_SLACK,
-  /** solve for inequalities using boundary points */
-  CBQI_BV_INEQ_EQ_BOUNDARY,
-  /** solve for inequalities directly, using side conditions */
-  CBQI_BV_INEQ_KEEP,
-};
-
-enum CegqiSingleInvMode {
-  /** do not use single invocation techniques */
-  CEGQI_SI_MODE_NONE,
-  /** use single invocation techniques */
-  CEGQI_SI_MODE_USE,
-  /** always use single invocation techniques */
-  CEGQI_SI_MODE_ALL,
-};
-
-/** Solution reconstruction modes for single invocation conjectures
- *
- * These modes indicate the policy when CVC4 solves a synthesis conjecture using
- * single invocation techniques for a sygus problem with a user-specified
- * grammar.
- */
-enum CegqiSingleInvRconsMode
-{
-  /**
-   * Do not try to reconstruct solutions to single invocation conjectures. With
-   * this mode, solutions produced by CVC4 may violate grammar restrictions.
-   */
-  CEGQI_SI_RCONS_MODE_NONE,
-  /**
-   * Try to reconstruct solution to single invocation conjectures in an
-   * incomplete (fail fast) way.
-   */
-  CEGQI_SI_RCONS_MODE_TRY,
-  /**
-   * Reconstruct solutions to single invocation conjectures, but fail if we
-   * reach an upper limit on number of iterations in the enumeration
-   */
-  CEGQI_SI_RCONS_MODE_ALL_LIMIT,
-  /**
-   * Reconstruct solutions to single invocation conjectures. This method
-   * relies on an expensive enumeration technique which only terminates when
-   * we succesfully reconstruct the solution, although it may not terminate.
-   */
-  CEGQI_SI_RCONS_MODE_ALL,
-};
-
-enum CegisSampleMode
-{
-  /** do not use samples for CEGIS */
-  CEGIS_SAMPLE_NONE,
-  /** use samples for CEGIS */
-  CEGIS_SAMPLE_USE,
-  /** trust samples for CEGQI */
-  CEGIS_SAMPLE_TRUST,
-};
-
-enum SygusInvTemplMode {
-  /** synthesize I( x ) */
-  SYGUS_INV_TEMPL_MODE_NONE,
-  /** synthesize ( pre( x ) V I( x ) ) */
-  SYGUS_INV_TEMPL_MODE_PRE,
-  /** synthesize ( post( x ) ^ I( x ) ) */
-  SYGUS_INV_TEMPL_MODE_POST,
-};
-
-enum SygusActiveGenMode
-{
-  /** do not use actively-generated enumerators */
-  SYGUS_ACTIVE_GEN_NONE,
-  /** use basic enumeration for actively-generated enumerators */
-  SYGUS_ACTIVE_GEN_ENUM_BASIC,
-  /** use optimized enumeration actively-generated enumerators */
-  SYGUS_ACTIVE_GEN_ENUM,
-  /** use variable-agnostic enumerators */
-  SYGUS_ACTIVE_GEN_VAR_AGNOSTIC,
-  /** internally decide the best policy for each enumerator */
-  SYGUS_ACTIVE_GEN_AUTO,
-};
-
-enum SygusQueryDumpFilesMode
-{
-  /** do not dump query files */
-  SYGUS_QUERY_DUMP_NONE,
-  /** dump all query files */
-  SYGUS_QUERY_DUMP_ALL,
-  /** dump query files that were not solved by the subsolver */
-  SYGUS_QUERY_DUMP_UNSOLVED,
-};
-
-enum SygusFilterSolMode
-{
-  /** do not filter solutions */
-  SYGUS_FILTER_SOL_NONE,
-  /** filter logically stronger solutions */
-  SYGUS_FILTER_SOL_STRONG,
-  /** filter logically weaker solutions */
-  SYGUS_FILTER_SOL_WEAK,
-};
-
-enum SygusGrammarConsMode
-{
-  /**
-   * Use simple default SyGuS grammar construction (no symbolic terms or
-   * constants).
-   */
-  SYGUS_GCONS_SIMPLE,
-  /** Use "any constant" constructors in default SyGuS grammar construction. */
-  SYGUS_GCONS_ANY_CONST,
-  /**
-   * When applicable, use constructors that encode any term using "any constant"
-   * constructors. This construction uses sum-of-monomials for arithmetic
-   * grammars.
-   */
-  SYGUS_GCONS_ANY_TERM,
-  /**
-   * When applicable, use constructors that encode any term using "any constant"
-   * constructors in a way that prefers conciseness over generality. This
-   * construction uses polynomials for arithmetic grammars.
-   */
-  SYGUS_GCONS_ANY_TERM_CONCISE,
-};
-
-enum MacrosQuantMode {
-  /** infer all definitions */
-  MACROS_QUANT_MODE_ALL,
-  /** infer ground definitions */
-  MACROS_QUANT_MODE_GROUND,
-  /** infer ground uf definitions */
-  MACROS_QUANT_MODE_GROUND_UF,
-};
-
-enum QuantDSplitMode {
-  /** never do quantifiers splitting */
-  QUANT_DSPLIT_MODE_NONE,
-  /** default */
-  QUANT_DSPLIT_MODE_DEFAULT,
-  /** do quantifiers splitting aggressively */
-  QUANT_DSPLIT_MODE_AGG,
-};
-
-enum QuantRepMode {
-  /** let equality engine choose representatives */
-  QUANT_REP_MODE_EE,
-  /** default, choose representatives that appear first */
-  QUANT_REP_MODE_FIRST,
-  /** choose representatives that have minimal depth */
-  QUANT_REP_MODE_DEPTH,
-};
-
-/**
- * Modes for piecewise-independent unification for synthesis (see Barbosa et al
- * FMCAD 2019).
- */
-enum SygusUnifPiMode
-{
-  /** do not do piecewise-independent unification for synthesis */
-  SYGUS_UNIF_PI_NONE,
-  /** use (finite-model) complete piecewise-independent unification */
-  SYGUS_UNIF_PI_COMPLETE,
-  /** use approach based on condition enumeration for piecewise-independent
-     unification */
-  SYGUS_UNIF_PI_CENUM,
-  /** use approach based on condition enumeration with information gain
-     heuristics for piecewise-independent unification */
-  SYGUS_UNIF_PI_CENUM_IGAIN,
-};
-
-}/* CVC4::theory::quantifiers namespace */
-}/* CVC4::theory namespace */
-
-std::ostream& operator<<(std::ostream& out, theory::quantifiers::InstWhenMode mode) CVC4_PUBLIC;
-
-}/* CVC4 namespace */
-
-#endif /* CVC4__BASE__QUANTIFIERS_MODES_H */