Result sort of the allocation function.

Result sort of the range allocation function.

Sort of objects stored on the heap. This sort is one of the elements of userHeapSorts.

Sort of address ranges in this heap theory.

A list of (other) theories that are implicitly declared as a side-effect of declaring this theory. We assume that theories can implicitly define some of their dependencies, but not vice versa.

A function to enumerate the addresses that can be used on this heap. addr(1) is the address returned by the first call to alloc, addr(2) the second address, etc. Applying the function to zero or to negative values should be treated as a synonym for nullAddr.

See the Heap trait for functions and predicates of the theory writeADT : Obj x Obj --> Heap * Updates the ADT's field (described by a read to 0) using value (1) *************************************************************************** Private functions and predicates *************************************************************************** heapSize : Heap --> Nat

* Below two functions are shorthand functions to get rid of HeapAddrPair. * They return a single value instead of the pair <Heap x Addr>. * This also removes some quantifiers related to the ADT in the generated * interpolants. allocHeap : Heap x Obj --> Heap allocAddr : Heap x Obj --> Address

* Below two functions are shorthand functions to get rid of HeapRangePair. * They return a single value instead of the pair <Heap x Range>. * This also removes some quantifiers related to the ADT in the generated * interpolants. batchAllocHeap : Heap x Obj x Nat --> Heap batchAllocRange : Heap x Obj x Nat --> Range * ***************************************************************************

Function to allocate a sequence of objects on the heap.

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).

The object stored on the heap at not yet allocated locations.

Optionally, other theories that this theory depends on.

Constant representing empty heaps.

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

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

A simplification function that applies the methods evalFun and evalPred to some given expression (but not recursively). This is used in the Theory.postSimplifiers methods.

Add the symbols defined by this theory to the order

Translate a function belonging to this theory to an SMT-LIB identifier.

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

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

Interpreted functions of the theory

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.

Tester for the user-declared heap constructors. The ids expected by the tester coincide with the positions in the sequence userHeapCtors.

Function to obtain the new heap after allocation.

Function to obtain the new address after allocation.

Function to obtain the new heap after range allocation.

Function to obtain the new address range after range allocation.

Method to query all functions and predicates of the theory, including API, internal symbols, and symbols of the constituent theories.

Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination. This method will be applied to the formula after calling Internal2Inputabsy.

Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover. This method will be applied very early in the translation process.

Predicate to test whether an address is valid (allocated and non-null) in a given heap. Synonym for valid.

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.

Optionally, a set of predicates used by the theory to tell the PresburgerModelFinder about terms that will be handled exclusively by this theory. If a proof goal in model generation mode contains an atom p(x), for p in this set, then the PresburgerModelFinder will ignore x when assigning concrete values to symbols.

A function to enumerate the next addresses that will be returned by the alloc function. The next address that can be allocated is nextAddr(h, 0), then nextAddr(h, 1), etc. Applying the function to negative integers returns the last addresses that have been allocated: nextAddr(h, -1) is the last address that has been allocated on h, nextAddr(h, -2) the address before that, etc. Since a heap only has finitely many allocated addresses, for two small n, the result of nextAddr(h, n) is nullAddr.

addr(k) is a synonym for nextAddr(emptyHeap, k - 1).

Constant representing the null address.

The index of the ObjectSort among the userHeapSorts.

Optionally, a plug-in implementing reasoning in this theory

Optionally, simplifiers that are applied to formulas output by the prover, for instance to interpolants or the result of quantifier. Such simplifiers are invoked by ap.parser.Simplifier. By default, this list will only include the evaluatingSimplifier.

Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination. This method will be applied to the raw formulas, before calling Internal2Inputabsy.

Translate a predicate belonging to this theory to an SMT-LIB identifier.

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

Interpreted predicates of the theory

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

Overrides to make Heap SMT-linearisable

A function to enumerate range of the addresses that can be used on this heap. range(1, n) is a range of addresses starting at the address addr(1) of size n. Applying the function to a start address that is not positive or size that is not non-negative should be interpreted as an empty address range.

Function to obtain the n'th address in an address range. Accessing addresses outside of the range will return nullAddr.

Function to obtain the number of addresses in an address range.

Predicate to test whether an address belongs to an address range.

Function to read from the heap.

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

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

Translate a sort belonging to this theory to an SMT type.

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

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

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

Constructors declared as part of the heap ADT.

User-specified constructor declarations.

Selectors declared as part of the heap ADT.

Sorts declared as part of the heap ADT.

Updators declared as part of the heap ADT.

Predicate to test whether an address is valid (allocated and non-null) in a given heap.

Function to write to the heap.

Helper function to write to ADT fields.

Function to overwrite objects within an address range.

Sort of addresses in this heap theory.

Sort of heaps in this heap theory.