SAT-based Termination Analysis for Java Bytecode with AProVE

SAT solvers are nowadays the standard solving engines for the search problems in automated termination analysis. Consequently, the performance of current termination tools heavily relies on the speed of modern SAT solvers on the corresponding SAT encodings. If a model for the SAT instance at hand is found, it can be used to instantiate the parameters for the current proof step to advance the termination proof. This SAT benchmark submission has been created using the automated termination prover AProVE [6]. All instances originate from termination analysis of Java Bytecode programs. This whole benchmark suite only consists of satisfiable instances, and any speed-up for SAT solvers on these instances will directly lead to performance improvements also for automated termination provers.