SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_BVLRA (Incremental Track)

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

Results were generated on 2026-07-25

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

Winners

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

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
Yices2016158385.31385.310504010
SMTInterpol0161473979.543979.540504020
cvc50161103901.413901.410504080
z3-BooledASS ne00
(base +0)		3.053.880504000
z3-BooledASS-base n000.000.000504000
(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
Yices2015948248.19248.190501310
cvc5014698735.34735.3404881660
SMTInterpol0121621884.051884.0504584610
z3-BooledASS ne00
(base +0)		3.053.880504000
z3-BooledASS-base n000.000.000504000
(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