Benchmark
incremental/QF_S/20250411-hornstr/herman-linear_lstar_incre_reach_bad_0.smt2
Benchmarks are extracted by running HornStr https://arg-git.informatik.uni-kl.de/pub/string-chc-lib on all benchmarks
provided in the repository and gathering the string queries sent to the string solvers.
| Benchmark |
|---|
| Size | 1606 |
| Compressed Size | 660 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | — |
| Generated By | Hongjian Jiang, Oliver Markgraf, Daniel Stan, Anthony W. Lin, Philipp Ruemmer |
| Generated On | 2025-04-11 00:00:00 |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 7 |
| Status | unknown |
| Inferred Status | None |
| Size | 1024 |
| Compressed Size | 589 |
| Max. Term Depth | 8 |
| Asserts | 3 |
| Declared Functions | 0 |
| Declared Constants | 1 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 1 |
and | 1 |
let | 2 |
str.to_re | 7 |
re.* | 3 |
re.++ | 2 |
re.union | 2 |
str.in_re | 3 |
| Status | unknown |
| Inferred Status | None |
| Size | 1088 |
| Compressed Size | 602 |
| Max. Term Depth | 8 |
| Asserts | 4 |
| Declared Functions | 0 |
| Declared Constants | 1 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 1 |
and | 1 |
distinct | 1 |
let | 2 |
str.to_re | 7 |
re.* | 3 |
re.++ | 2 |
re.union | 2 |
str.in_re | 3 |
| | | | | |
| Status | unknown |
| Inferred Status | None |
| Size | 1053 |
| Compressed Size | 588 |
| Max. Term Depth | 8 |
| Asserts | 3 |
| Declared Functions | 0 |
| Declared Constants | 1 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 1 |
and | 1 |
let | 2 |
str.to_re | 8 |
re.* | 3 |
re.++ | 2 |
re.union | 3 |
str.in_re | 3 |
| Status | unknown |
| Inferred Status | None |
| Size | 1118 |
| Compressed Size | 605 |
| Max. Term Depth | 8 |
| Asserts | 4 |
| Declared Functions | 0 |
| Declared Constants | 1 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 1 |
and | 1 |
distinct | 1 |
let | 2 |
str.to_re | 8 |
re.* | 3 |
re.++ | 2 |
re.union | 3 |
str.in_re | 3 |
| | | | | |
| Status | unknown |
| Inferred Status | None |
| Size | 1134 |
| Compressed Size | 605 |
| Max. Term Depth | 8 |
| Asserts | 3 |
| Declared Functions | 0 |
| Declared Constants | 1 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 1 |
and | 1 |
let | 2 |
str.to_re | 10 |
re.* | 3 |
re.++ | 3 |
re.union | 4 |
str.in_re | 3 |
| Status | unknown |
| Inferred Status | None |
| Size | 1200 |
| Compressed Size | 620 |
| Max. Term Depth | 8 |
| Asserts | 4 |
| Declared Functions | 0 |
| Declared Constants | 1 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 1 |
and | 1 |
distinct | 1 |
let | 2 |
str.to_re | 10 |
re.* | 3 |
re.++ | 3 |
re.union | 4 |
str.in_re | 3 |
| | | | | |
| Status | unknown |
| Inferred Status | None |
| Size | 988 |
| Compressed Size | 582 |
| Max. Term Depth | 8 |
| Asserts | 2 |
| Declared Functions | 0 |
| Declared Constants | 1 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 1 |
and | 1 |
let | 2 |
str.to_re | 6 |
re.* | 3 |
re.++ | 2 |
re.union | 2 |
str.in_re | 2 |