ExtArray

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

object ReducerFactory extends ReducerPluginFactory

val _const: Predicate

val _select: Predicate

val _store: Predicate

val _store2: Predicate

val _valueAlmostEverywhere: Predicate

val allAxioms: IFormula

val arity: Int

val arrayConstant: Predicate

final def asInstanceOf[T0]: T0

val axiom1: IFormula

val axiom2: IFormula

val axiom3: IFormula

val axiom4: IFormula

val axiom5: IFormula

val axiom6: IFormula

val axiom7: IFormula

val axiom8: IFormula

val axioms: Formula

Axioms defining the theory; such axioms are simply added as formulae to the problem to be proven, and thus handled using the standard reasoning techniques (including e-matching).

def clone(): AnyRef

val const: IFunction

Function for constant arrays.

val constArray: IFunction

Java-friendly copy of the const function.

val dependencies: Seq[Theory]

Optionally, other theories that this theory depends on.

val distinctArrays: Predicate

def distinctArraysAxiom(c: Term, d: Term)(implicit order: TermOrder): Conjunction

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def evalFun(f: IFunApp): Option[ITerm]

Direct evaluation of some ground terms.

def evalPred(p: IAtom): Option[Boolean]

Optionally, a function evaluating theory predicates applied to concrete arguments, represented as constructor terms.

def evaluatingSimplifier(t: IExpression): IExpression

A simplification function that applies the methods evalFun and evalPred to some given expression (but not recursively).

def expandExtensionality(goal: Goal, additionalFuns: Seq[(Predicate, Seq[Int])] = List()): Seq[Action]

The extensionality axiom is implemented by rewriting negated equations about arrays.

def extend(order: TermOrder): TermOrder

Add the symbols defined by this theory to the order

val funPredMap: Map[IFunction, Predicate]

val functionPredicateMapping: List[(IFunction, Predicate)]

Mapping of interpreted functions to interpreted predicates, used translating input ASTs to internal ASTs (the latter only containing predicates).

val functionalPredicates: Set[Predicate]

Information which of the predicates satisfy the functionality axiom; at some internal points, such predicates can be handled more efficiently

val functions: List[IFunction]

Interpreted functions of the theory

def generateDecoderData(model: Conjunction): Option[TheoryDecoderData]

If this theory defines any Theory.Decoder, which can translate model data into some theory-specific representation, this function can be overridden to pre-compute required data from a model.

final def getClass(): Class[_]

def hashCode(): Int

def iPostprocess(f: IFormula, signature: Signature): IFormula

Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination.

def iPreprocess(f: IFormula, signature: Signature): (IFormula, Signature)

Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.

val indexSorts: Seq[Sort]

final def isInstanceOf[T0]: Boolean

def isSoundForSat(theories: Seq[Theory], config: Theory.SatSoundnessConfig.Value): Boolean

Check whether we can tell that the given combination of theories is sound for checking satisfiability of a problem, i.e., if proof construction ends up in a dead end, can it be concluded that a problem is satisfiable.

val modelGenPredicates: Set[Predicate]

Optionally, a set of predicates used by the theory to tell the PresburgerModelFinder about terms that will be handled exclusively by this theory.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val objSort: Sort

val plugin: Some[Plugin]

Optionally, a plug-in implementing reasoning in this theory

val postSimplifiers: Seq[(IExpression) ⇒ IExpression]

Optionally, simplifiers that are applied to formulas output by the prover, for instance to interpolants or the result of quantifier.

def postprocess(f: Conjunction, order: TermOrder): Conjunction

Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination.

val predicateMatchConfig: PredicateMatchConfig

Information how interpreted predicates should be handled for e-matching.

val predicates: Seq[Predicate]

Interpreted predicates of the theory

def preprocess(f: Conjunction, order: TermOrder): Conjunction

Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.

val reducerPlugin: ReducerFactory.type

Optionally, a plugin for the reducer applied to formulas both before and during proving.

val select: IFunction

Function for reading an element of the array.

val singleInstantiationPredicates: Set[Predicate]

When instantiating existentially quantifier formulas, EX phi, at most one instantiation is necessary provided that all predicates in phi are contained in this set.

val sort: ArraySort

val store: IFunction

Function for updating an array at given indexes.

val store2: IFunction

def store2store2Lazy(goal: Goal, checkedPreds: Seq[Predicate] = List(_store, _store2, _const)): Seq[Action]

When the "store" literals form a graph that is not tree-shaped, start replacing "store" with "store2" to initiate bidirectional propagation

def storeConversionActions(a: Atom, goal: Goal): Seq[Action]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

val totalityAxioms: Conjunction

Additional axioms that are included if the option +genTotalityAxioms is given to Princess.

lazy val transitiveDependencies: Iterable[Theory]

Dependencies closed under transitivity, i.e., also including the dependencies of dependencies.

val triggerRelevantFunctions: Set[IFunction]

A list of functions that should be considered in automatic trigger generation

val valueAlmostEverywhere: IFunction

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit