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.r143-smll-177955812400023.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 FireWire-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-smll-177955812400023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.5K Mar 7 05:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 05:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 7 05:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 05:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 05:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 7 05:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 7 05:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Mar 7 05:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 91K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FireWire-PT-05-UpperBounds-00
FORMULA_NAME FireWire-PT-05-UpperBounds-01
FORMULA_NAME FireWire-PT-05-UpperBounds-02
FORMULA_NAME FireWire-PT-05-UpperBounds-03
FORMULA_NAME FireWire-PT-05-UpperBounds-04
FORMULA_NAME FireWire-PT-05-UpperBounds-05
FORMULA_NAME FireWire-PT-05-UpperBounds-06
FORMULA_NAME FireWire-PT-05-UpperBounds-07
FORMULA_NAME FireWire-PT-05-UpperBounds-08
FORMULA_NAME FireWire-PT-05-UpperBounds-09
FORMULA_NAME FireWire-PT-05-UpperBounds-10
FORMULA_NAME FireWire-PT-05-UpperBounds-11
FORMULA_NAME FireWire-PT-05-UpperBounds-12
FORMULA_NAME FireWire-PT-05-UpperBounds-13
FORMULA_NAME FireWire-PT-05-UpperBounds-14
FORMULA_NAME FireWire-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779625206027

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-24 12:20:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 12:20:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:20:08] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2026-05-24 12:20:08] [INFO ] Transformed 114 places.
[2026-05-24 12:20:08] [INFO ] Transformed 373 transitions.
[2026-05-24 12:20:08] [INFO ] Found NUPN structural information;
[2026-05-24 12:20:08] [INFO ] Parsed PT model containing 114 places and 373 transitions and 1389 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Ensure Unique test removed 57 transitions
Reduce redundant transitions removed 57 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-24 12:20:08] [INFO ] Flow matrix only has 284 transitions (discarded 32 similar events)
// Phase 1: matrix 284 rows 114 cols
[2026-05-24 12:20:08] [INFO ] Computed 8 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (581 resets) in 66 ms. (149 steps per ms)
FORMULA FireWire-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (610 resets) in 74 ms. (533 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-24 12:20:08] [INFO ] Flow matrix only has 284 transitions (discarded 32 similar events)
[2026-05-24 12:20:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:20:09] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-24 12:20:09] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2026-05-24 12:20:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-24 12:20:09] [INFO ] [Real]Added 40 Read/Feed constraints in 21 ms returned sat
[2026-05-24 12:20:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:20:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2026-05-24 12:20:09] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2026-05-24 12:20:09] [INFO ] [Nat]Added 40 Read/Feed constraints in 65 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:10] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 31 ms to minimize.
[2026-05-24 12:20:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2026-05-24 12:20:10] [INFO ] Computed and/alt/rep : 110/403/110 causal constraints (skipped 173 transitions) in 86 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:10] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 12 ms to minimize.
[2026-05-24 12:20:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2026-05-24 12:20:11] [INFO ] Added : 20 causal constraints over 7 iterations in 669 ms. Result :sat
Minimization took 70 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:20:11] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 12:20:11] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2026-05-24 12:20:11] [INFO ] [Real]Added 40 Read/Feed constraints in 19 ms returned sat
[2026-05-24 12:20:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:20:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 12:20:11] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2026-05-24 12:20:11] [INFO ] [Nat]Added 40 Read/Feed constraints in 20 ms returned sat
[2026-05-24 12:20:11] [INFO ] Computed and/alt/rep : 110/403/110 causal constraints (skipped 173 transitions) in 44 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:11] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 5 ms to minimize.
[2026-05-24 12:20:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2026-05-24 12:20:12] [INFO ] Added : 23 causal constraints over 6 iterations in 437 ms. Result :sat
Minimization took 93 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:20:12] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 12:20:12] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2026-05-24 12:20:12] [INFO ] [Real]Added 40 Read/Feed constraints in 17 ms returned sat
[2026-05-24 12:20:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:20:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-24 12:20:12] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2026-05-24 12:20:12] [INFO ] [Nat]Added 40 Read/Feed constraints in 23 ms returned sat
[2026-05-24 12:20:12] [INFO ] Computed and/alt/rep : 110/403/110 causal constraints (skipped 173 transitions) in 38 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:13] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:13] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 4 ms to minimize.
[2026-05-24 12:20:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2026-05-24 12:20:13] [INFO ] Added : 17 causal constraints over 7 iterations in 625 ms. Result :sat
Minimization took 87 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:20:13] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-24 12:20:13] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2026-05-24 12:20:13] [INFO ] [Real]Added 40 Read/Feed constraints in 29 ms returned sat
[2026-05-24 12:20:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:20:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-24 12:20:13] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2026-05-24 12:20:13] [INFO ] [Nat]Added 40 Read/Feed constraints in 23 ms returned sat
[2026-05-24 12:20:13] [INFO ] Computed and/alt/rep : 110/403/110 causal constraints (skipped 173 transitions) in 62 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:14] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 6 ms to minimize.
[2026-05-24 12:20:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2026-05-24 12:20:14] [INFO ] Added : 22 causal constraints over 5 iterations in 426 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 316/316 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 114 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 113 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 113 transition count 311
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 112 transition count 311
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 9 place count 110 transition count 307
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 110 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 110 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 107 transition count 311
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 25 place count 107 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 34 place count 107 transition count 296
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 107 transition count 298
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 38 place count 106 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 40 place count 106 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 105 transition count 293
Applied a total of 41 rules in 249 ms. Remains 105 /114 variables (removed 9) and now considering 293/316 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 105/114 places, 293/316 transitions.
[2026-05-24 12:20:15] [INFO ] Flow matrix only has 264 transitions (discarded 29 similar events)
// Phase 1: matrix 264 rows 105 cols
[2026-05-24 12:20:15] [INFO ] Computed 8 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (64084 resets) in 1993 ms. (501 steps per ms)
FORMULA FireWire-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000002 steps (49306 resets) in 2161 ms. (1387 steps per ms)
FORMULA FireWire-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-24 12:20:19] [INFO ] Flow matrix only has 264 transitions (discarded 29 similar events)
[2026-05-24 12:20:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:20:19] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-24 12:20:19] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2026-05-24 12:20:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-24 12:20:19] [INFO ] [Real]Added 40 Read/Feed constraints in 10 ms returned sat
[2026-05-24 12:20:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:20:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-24 12:20:19] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-24 12:20:19] [INFO ] [Nat]Added 40 Read/Feed constraints in 12 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:19] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 14 ms to minimize.
[2026-05-24 12:20:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2026-05-24 12:20:19] [INFO ] Computed and/alt/rep : 105/377/105 causal constraints (skipped 157 transitions) in 54 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:20] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:20] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 5 ms to minimize.
[2026-05-24 12:20:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2026-05-24 12:20:20] [INFO ] Added : 39 causal constraints over 9 iterations in 629 ms. Result :sat
Minimization took 179 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:20:20] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 12:20:20] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2026-05-24 12:20:20] [INFO ] [Real]Added 40 Read/Feed constraints in 23 ms returned sat
[2026-05-24 12:20:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:20:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 12:20:21] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2026-05-24 12:20:21] [INFO ] [Nat]Added 40 Read/Feed constraints in 43 ms returned sat
[2026-05-24 12:20:21] [INFO ] Computed and/alt/rep : 105/377/105 causal constraints (skipped 157 transitions) in 49 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:21] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:21] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 21 ms to minimize.
[2026-05-24 12:20:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 418 ms
[2026-05-24 12:20:21] [INFO ] Added : 14 causal constraints over 4 iterations in 639 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA FireWire-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 105 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p75) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 291/291 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 103 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 103 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 103 transition count 286
Applied a total of 4 rules in 29 ms. Remains 103 /105 variables (removed 2) and now considering 286/291 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 103/105 places, 286/291 transitions.
[2026-05-24 12:20:21] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
// Phase 1: matrix 257 rows 103 cols
[2026-05-24 12:20:21] [INFO ] Computed 8 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (64007 resets) in 1857 ms. (538 steps per ms)
BEST_FIRST walk for 1000000 steps (15961 resets) in 497 ms. (2008 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-24 12:20:24] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2026-05-24 12:20:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:20:24] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 12:20:24] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2026-05-24 12:20:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-24 12:20:24] [INFO ] [Real]Added 40 Read/Feed constraints in 30 ms returned sat
[2026-05-24 12:20:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:20:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 12:20:24] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2026-05-24 12:20:24] [INFO ] [Nat]Added 40 Read/Feed constraints in 33 ms returned sat
[2026-05-24 12:20:24] [INFO ] Computed and/alt/rep : 113/459/113 causal constraints (skipped 142 transitions) in 44 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:25] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:25] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:25] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:25] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 4 ms to minimize.
[2026-05-24 12:20:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 682 ms
[2026-05-24 12:20:25] [INFO ] Added : 41 causal constraints over 9 iterations in 1036 ms. Result :sat
Minimization took 169 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 286/286 transitions.
Applied a total of 0 rules in 14 ms. Remains 103 /103 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 103/103 places, 286/286 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 286/286 transitions.
Applied a total of 0 rules in 9 ms. Remains 103 /103 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2026-05-24 12:20:26] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2026-05-24 12:20:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:20:26] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-24 12:20:26] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2026-05-24 12:20:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:20:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-24 12:20:26] [INFO ] Implicit Places using invariants and state equation in 343 ms returned [12, 36, 61, 64]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 500 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/103 places, 286/286 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 99 transition count 283
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 96 transition count 283
Applied a total of 6 rules in 33 ms. Remains 96 /99 variables (removed 3) and now considering 283/286 (removed 3) transitions.
[2026-05-24 12:20:26] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
// Phase 1: matrix 254 rows 96 cols
[2026-05-24 12:20:26] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:20:26] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-24 12:20:26] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
[2026-05-24 12:20:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:20:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-24 12:20:27] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 96/103 places, 283/286 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1077 ms. Remains : 96/103 places, 283/286 transitions.
[2026-05-24 12:20:27] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
[2026-05-24 12:20:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (63821 resets) in 1897 ms. (526 steps per ms)
BEST_FIRST walk for 1000001 steps (16132 resets) in 487 ms. (2049 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-24 12:20:29] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
[2026-05-24 12:20:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:20:29] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 12:20:29] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2026-05-24 12:20:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-24 12:20:29] [INFO ] [Real]Added 40 Read/Feed constraints in 33 ms returned sat
[2026-05-24 12:20:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:20:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-24 12:20:30] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2026-05-24 12:20:30] [INFO ] [Nat]Added 40 Read/Feed constraints in 14 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:30] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 13 ms to minimize.
[2026-05-24 12:20:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2026-05-24 12:20:30] [INFO ] Computed and/alt/rep : 110/450/110 causal constraints (skipped 142 transitions) in 39 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:30] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 11 ms to minimize.
[2026-05-24 12:20:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2026-05-24 12:20:30] [INFO ] Added : 53 causal constraints over 12 iterations in 614 ms. Result :sat
Minimization took 144 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 283/283 transitions.
Applied a total of 0 rules in 13 ms. Remains 96 /96 variables (removed 0) and now considering 283/283 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 96/96 places, 283/283 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 283/283 transitions.
Applied a total of 0 rules in 12 ms. Remains 96 /96 variables (removed 0) and now considering 283/283 (removed 0) transitions.
[2026-05-24 12:20:31] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
[2026-05-24 12:20:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:20:31] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-24 12:20:31] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
[2026-05-24 12:20:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:20:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-24 12:20:31] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:20:31] [INFO ] Redundant transitions in 18 ms returned []
Running 281 sub problems to find dead transitions.
[2026-05-24 12:20:31] [INFO ] Flow matrix only has 254 transitions (discarded 29 similar events)
[2026-05-24 12:20:31] [INFO ] Invariant cache hit.
[2026-05-24 12:20:31] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:36] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:36] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:36] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:36] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:37] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:38] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 254/349 variables, 95/105 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:20:45] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (OVERLAPS) 1/350 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/350 variables, and 147 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 96/96 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 254/349 variables, 95/106 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 281/427 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:21:10] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:21:13] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:21:22] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/350 variables, and 430 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 95/96 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60492ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 60508ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60991 ms. Remains : 96/96 places, 283/283 transitions.
RANDOM walk for 40000 steps (2572 resets) in 1305 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (649 resets) in 323 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (668 resets) in 316 ms. (126 steps per ms) remains 2/2 properties
[2026-05-24 12:21:32] [INFO ] Flatten gal took : 149 ms
[2026-05-24 12:21:33] [INFO ] Flatten gal took : 73 ms
[2026-05-24 12:21:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1097981422798389924.gal : 27 ms
[2026-05-24 12:21:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2395642699341002719.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1097981422798389924.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2395642699341002719.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2395642699341002719.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :17 after 27
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :27 after 42
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :42 after 92
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :92 after 378
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :378 after 642
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :642 after 6826
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6826 after 17032
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :17032 after 55963
Finished probabilistic random walk after 485997 steps, run visited all 2 properties in 2009 ms. (steps per millisecond=241 )
Probabilistic random walk after 485997 steps, saw 107177 distinct states, run finished after 2014 ms. (steps per millisecond=241 ) properties seen :2
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-05-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 86474 ms.

BK_STOP 1779625294809

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="FireWire-PT-05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 FireWire-PT-05, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r143-smll-177955812400023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-05.tgz
mv FireWire-PT-05 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;