SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

BVFPLRA (Incremental Track)

Competition results for the BVFPLRA logic in the Incremental Track. Chart

Results were generated on 2026-07-25

Benchmarks: 9
Time Limit: 1200 seconds
Memory Limit: 30720 GB

Winners

Parallel PerformanceSAT Performance (parallel)UNSAT Performance (parallel)24 seconds Performance (parallel)
Bitwuzla--cvc5

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
Bitwuzla04782694.29694.2909020
Bitwuzla-fixed n04782695.99695.9909020
cvc50296423.1323.1309060
UltimateEliminator+MathSAT0215783.8483.8409000
z3-BooledASS ne00
(base +0)		0.050.0709000
z3-BooledASS-base n000.000.0009000
(base +/- n): for derived solvers: increment over base solver
ne: not eligible for winning as it does not substantially improve over the base solver (at least 10 % improvement in PAR2 score) n: non-competing solver

24 seconds Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
cvc50296423.1323.1309060
Bitwuzla-fixed n0156544.8344.8307210
Bitwuzla0156545.1945.1907210
UltimateEliminator+MathSAT072159.7359.7308100
z3-BooledASS ne00
(base +0)		0.050.0709000
z3-BooledASS-base n000.000.0009000
(base +/- n): for derived solvers: increment over base solver
ne: not eligible for winning as it does not substantially improve over the base solver (at least 10 % improvement in PAR2 score) n: non-competing solver