SoftwareInterpolationFramework

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def dumpInterpolationProblem(transitionParts: Map[PartName, Conjunction], sig: Signature): Unit

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

val frameworkVocabulary: FrameworkVocabulary

def genInterpolants(formulas: Seq[Conjunction], commonFormula: Conjunction, order: TermOrder): Either[Conjunction, Iterator[Conjunction]]

final def getClass(): Class[_]

def hashCode(): Int

var interpolationProblemBasename: String

var interpolationProblemNum: Int

lazy val interpolationProver: IncProver

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def parseAndSimplify(input: Reader): (Map[PartName, Conjunction], Signature)

Read a given problem, split it into the different parts, try to simplify bitvector expressions as far as possible, and convert it to internal presentation.

def parseProblem(reader: Reader): (IFormula, Signature)

val preludeSignature: Signature

def simplifyBitvectorFor(f: IFormula, typeAssumptions: IFormula): IFormula

def sortNamesLex[A](transitionParts: Map[PartName, A]): Seq[PartName]

Sort the transition relations lexicographically according to their name; NO_NAME is ignored and removed

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

def toInputAbsyAndSimplify(c: Conjunction): IFormula

def toInternal(f: IFormula, sig: Signature): (Conjunction, TermOrder)

def toNamedParts(f: IFormula, sig: Signature): (Map[PartName, Conjunction], Signature)

def toString(): String

lazy val validityCheckProver: IncProver

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit