fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r352-smll-178021502300277
Last Updated
Jun 17, 2026

About the Execution of 2025-gold for FileSystem-PT-N03I10B10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
396.995 67400.00 90706.00 932.30 F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r352-smll-178021502300277.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is FileSystem-PT-N03I10B10, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r352-smll-178021502300277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.2K May 27 10:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 27 10:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 27 10:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 49K May 27 10:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 165K May 27 10:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 27 10:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.8K May 27 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 27 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 27 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 27 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K May 27 10:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K May 27 10:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 236K Jun 10 11:57 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1781100427164

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FileSystem-PT-N03I10B10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202505121319
[2026-06-10 14:07:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-06-10 14:07:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 14:07:10] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2026-06-10 14:07:10] [INFO ] Transformed 561 places.
[2026-06-10 14:07:10] [INFO ] Transformed 520 transitions.
[2026-06-10 14:07:10] [INFO ] Parsed PT model containing 561 places and 520 transitions and 1850 arcs in 445 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 561/561 places, 520/520 transitions.
Reduce places removed 110 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 451 transition count 510
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 130 place count 441 transition count 510
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 530 place count 241 transition count 310
Applied a total of 530 rules in 155 ms. Remains 241 /561 variables (removed 320) and now considering 310/520 (removed 210) transitions.
// Phase 1: matrix 310 rows 241 cols
[2026-06-10 14:07:10] [INFO ] Computed 22 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-10 14:07:11] [INFO ] Implicit Places using invariants in 1158 ms returned []
[2026-06-10 14:07:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-06-10 14:07:12] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 14:07:13] [INFO ] Implicit Places using invariants and state equation in 2289 ms returned []
Implicit Place search using SMT with State Equation took 3553 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2026-06-10 14:07:14] [INFO ] Invariant cache hit.
[2026-06-10 14:07:14] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 11/241 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:22] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:23] [INFO ] Deduced a trap composed of 4 places in 496 ms of which 384 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:23] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:23] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:24] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:24] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:24] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:25] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:25] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:25] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:25] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:26] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:27] [INFO ] Deduced a trap composed of 45 places in 257 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:27] [INFO ] Deduced a trap composed of 69 places in 310 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:27] [INFO ] Deduced a trap composed of 68 places in 245 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:28] [INFO ] Deduced a trap composed of 68 places in 277 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:28] [INFO ] Deduced a trap composed of 60 places in 259 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:28] [INFO ] Deduced a trap composed of 68 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:29] [INFO ] Deduced a trap composed of 61 places in 255 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:29] [INFO ] Deduced a trap composed of 60 places in 256 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:33] [INFO ] Deduced a trap composed of 53 places in 248 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:33] [INFO ] Deduced a trap composed of 60 places in 242 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:33] [INFO ] Deduced a trap composed of 68 places in 249 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:34] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:35] [INFO ] Deduced a trap composed of 50 places in 261 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:35] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:35] [INFO ] Deduced a trap composed of 39 places in 241 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:36] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:36] [INFO ] Deduced a trap composed of 60 places in 194 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:39] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:39] [INFO ] Deduced a trap composed of 39 places in 274 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:40] [INFO ] Deduced a trap composed of 43 places in 256 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:40] [INFO ] Deduced a trap composed of 49 places in 263 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 241/551 variables, and 55 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/241 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 11/241 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 33/55 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:50] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:50] [INFO ] Deduced a trap composed of 49 places in 247 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:50] [INFO ] Deduced a trap composed of 50 places in 245 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:50] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-10 14:07:51] [INFO ] Deduced a trap composed of 50 places in 253 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 310/551 variables, 241/301 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 100/401 constraints. Problems are: Problem set: 250 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 50/451 constraints. Problems are: Problem set: 250 solved, 50 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 451 constraints, problems are : Problem set: 250 solved, 50 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 241/241 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 50/300 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60446ms problems are : Problem set: 250 solved, 50 unsolved
Search for dead transitions found 250 dead transitions in 60496ms
Found 250 dead transitions using SMT.
FORMULA QuasiLiveness FALSE TECHNIQUES STRUCTURAL_REDUCTION
Total runtime 64810 ms.

BK_STOP 1781100494564

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FileSystem-PT-N03I10B10"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool gold2025"
echo " Input is FileSystem-PT-N03I10B10, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r352-smll-178021502300277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FileSystem-PT-N03I10B10.tgz
mv FileSystem-PT-N03I10B10 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;