SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_Bitvec (Incremental Track)

Competition results for the QF_Bitvec division in the Incremental Track. Chart

Results were generated on 2026-07-25

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

Logics:

Winners

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

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
Bitwuzla03387612309.1912309.190661050
Yices203384814249.7214249.810661070
cvc503370528861.1128861.110661090
SMTInterpol020843229898.11223566.18066101780
z3-BooledASS ne00
(base +0)		3.955.060661000
z3-BooledASS-base n000.000.000661000
(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
Yices2025796900.17900.1706303100
Bitwuzla0216071385.511385.5106144700
cvc5018577893.25893.25053712410
SMTInterpol091151198.761198.76039127010
z3-BooledASS ne00
(base +0)		3.955.060661000
z3-BooledASS-base n000.000.000661000
(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