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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.8K Mar 7 05:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 05:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 05:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 05:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Mar 7 05:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Mar 7 05:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:06 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 100K 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-09-UpperBounds-00
FORMULA_NAME FireWire-PT-09-UpperBounds-01
FORMULA_NAME FireWire-PT-09-UpperBounds-02
FORMULA_NAME FireWire-PT-09-UpperBounds-03
FORMULA_NAME FireWire-PT-09-UpperBounds-04
FORMULA_NAME FireWire-PT-09-UpperBounds-05
FORMULA_NAME FireWire-PT-09-UpperBounds-06
FORMULA_NAME FireWire-PT-09-UpperBounds-07
FORMULA_NAME FireWire-PT-09-UpperBounds-08
FORMULA_NAME FireWire-PT-09-UpperBounds-09
FORMULA_NAME FireWire-PT-09-UpperBounds-10
FORMULA_NAME FireWire-PT-09-UpperBounds-11
FORMULA_NAME FireWire-PT-09-UpperBounds-12
FORMULA_NAME FireWire-PT-09-UpperBounds-13
FORMULA_NAME FireWire-PT-09-UpperBounds-14
FORMULA_NAME FireWire-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779625408832

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-24 12:23:31] [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:23:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:23:31] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2026-05-24 12:23:31] [INFO ] Transformed 130 places.
[2026-05-24 12:23:31] [INFO ] Transformed 408 transitions.
[2026-05-24 12:23:31] [INFO ] Found NUPN structural information;
[2026-05-24 12:23:31] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 386 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 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:23:31] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
// Phase 1: matrix 320 rows 130 cols
[2026-05-24 12:23:31] [INFO ] Computed 8 invariants in 29 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 (567 resets) in 101 ms. (98 steps per ms)
FORMULA FireWire-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70005 steps (1029 resets) in 195 ms. (357 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-24 12:23:32] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
[2026-05-24 12:23:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:23:32] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2026-05-24 12:23:32] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2026-05-24 12:23:33] [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:23:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2026-05-24 12:23:33] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2026-05-24 12:23:33] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 12:23:33] [INFO ] [Nat]Added 45 Read/Feed constraints in 38 ms returned sat
[2026-05-24 12:23:33] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 112 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:34] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:34] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 6 ms to minimize.
[2026-05-24 12:23:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2026-05-24 12:23:34] [INFO ] Added : 23 causal constraints over 7 iterations in 1007 ms. Result :sat
Minimization took 268 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:23:34] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-24 12:23:35] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2026-05-24 12:23:35] [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:23:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-24 12:23:35] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2026-05-24 12:23:35] [INFO ] [Nat]Added 45 Read/Feed constraints in 24 ms returned sat
[2026-05-24 12:23:35] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 75 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:36] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:36] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 6 ms to minimize.
[2026-05-24 12:23:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 582 ms
[2026-05-24 12:23:36] [INFO ] Added : 18 causal constraints over 5 iterations in 1574 ms. Result :sat
Minimization took 239 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:23:37] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-24 12:23:37] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2026-05-24 12:23:37] [INFO ] [Real]Added 45 Read/Feed constraints in 20 ms returned sat
[2026-05-24 12:23:37] [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:23:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-24 12:23:37] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2026-05-24 12:23:37] [INFO ] [Nat]Added 45 Read/Feed constraints in 82 ms returned sat
[2026-05-24 12:23:38] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 84 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:38] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:38] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 9 ms to minimize.
[2026-05-24 12:23:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 456 ms
[2026-05-24 12:23:38] [INFO ] Added : 11 causal constraints over 3 iterations in 812 ms. Result :sat
Minimization took 172 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:23:39] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 12:23:39] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2026-05-24 12:23:39] [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:23:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 12:23:39] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2026-05-24 12:23:39] [INFO ] [Nat]Added 45 Read/Feed constraints in 39 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:39] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 14 ms to minimize.
[2026-05-24 12:23:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2026-05-24 12:23:39] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 46 ms.
[2026-05-24 12:23:39] [INFO ] Added : 24 causal constraints over 6 iterations in 250 ms. Result :sat
Minimization took 246 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:23:40] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 12:23:40] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2026-05-24 12:23:40] [INFO ] [Real]Added 45 Read/Feed constraints in 29 ms returned sat
[2026-05-24 12:23:40] [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:23:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 12:23:40] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2026-05-24 12:23:40] [INFO ] [Nat]Added 45 Read/Feed constraints in 35 ms returned sat
[2026-05-24 12:23:40] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 58 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:41] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:41] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:41] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 26 ms to minimize.
[2026-05-24 12:23:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 702 ms
[2026-05-24 12:23:41] [INFO ] Added : 47 causal constraints over 10 iterations in 1261 ms. Result :sat
Minimization took 278 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:23:42] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-24 12:23:42] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2026-05-24 12:23:42] [INFO ] [Real]Added 45 Read/Feed constraints in 39 ms returned sat
[2026-05-24 12:23:42] [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:23:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-24 12:23:42] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2026-05-24 12:23:42] [INFO ] [Nat]Added 45 Read/Feed constraints in 37 ms returned sat
[2026-05-24 12:23:42] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 51 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:43] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 29 ms to minimize.
[2026-05-24 12:23:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2026-05-24 12:23:43] [INFO ] Added : 28 causal constraints over 7 iterations in 651 ms. Result :sat
Minimization took 242 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:23:43] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 12:23:43] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2026-05-24 12:23:43] [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:23:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-24 12:23:44] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2026-05-24 12:23:44] [INFO ] [Nat]Added 45 Read/Feed constraints in 25 ms returned sat
[2026-05-24 12:23:44] [INFO ] Computed and/alt/rep : 126/465/126 causal constraints (skipped 193 transitions) in 36 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:44] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:44] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:44] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 6 ms to minimize.
[2026-05-24 12:23:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 442 ms
[2026-05-24 12:23:45] [INFO ] Added : 35 causal constraints over 9 iterations in 806 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 352/352 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 349
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 126 transition count 341
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 126 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 126 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 125 transition count 335
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 124 transition count 333
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 123 transition count 330
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 123 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 122 transition count 329
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 119 transition count 335
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 34 place count 119 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 43 place count 119 transition count 320
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 119 transition count 322
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 3 with 3 rules applied. Total rules applied 47 place count 118 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 118 transition count 318
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 117 transition count 317
Applied a total of 50 rules in 178 ms. Remains 117 /130 variables (removed 13) and now considering 317/352 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 117/130 places, 317/352 transitions.
[2026-05-24 12:23:45] [INFO ] Flow matrix only has 288 transitions (discarded 29 similar events)
// Phase 1: matrix 288 rows 117 cols
[2026-05-24 12:23:45] [INFO ] Computed 8 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0] Max Struct:[1, 1, 1]
FORMULA FireWire-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (58058 resets) in 1608 ms. (621 steps per ms)
BEST_FIRST walk for 2000001 steps (28164 resets) in 1004 ms. (1990 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-24 12:23:48] [INFO ] Flow matrix only has 288 transitions (discarded 29 similar events)
[2026-05-24 12:23:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:23:48] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-24 12:23:48] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2026-05-24 12:23:48] [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:23:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-24 12:23:48] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2026-05-24 12:23:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 12:23:48] [INFO ] [Nat]Added 43 Read/Feed constraints in 33 ms returned sat
[2026-05-24 12:23:48] [INFO ] Computed and/alt/rep : 129/532/129 causal constraints (skipped 157 transitions) in 29 ms.
[2026-05-24 12:23:49] [INFO ] Added : 47 causal constraints over 10 iterations in 369 ms. Result :sat
Minimization took 224 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:23:49] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 12:23:49] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2026-05-24 12:23:49] [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:23:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 12:23:49] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2026-05-24 12:23:49] [INFO ] [Nat]Added 43 Read/Feed constraints in 35 ms returned sat
[2026-05-24 12:23:49] [INFO ] Computed and/alt/rep : 129/532/129 causal constraints (skipped 157 transitions) in 30 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:50] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:50] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 21 ms to minimize.
[2026-05-24 12:23:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 437 ms
[2026-05-24 12:23:50] [INFO ] Added : 45 causal constraints over 9 iterations in 924 ms. Result :sat
Minimization took 210 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 317/317 transitions.
Applied a total of 0 rules in 26 ms. Remains 117 /117 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 117/117 places, 317/317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 317/317 transitions.
Applied a total of 0 rules in 26 ms. Remains 117 /117 variables (removed 0) and now considering 317/317 (removed 0) transitions.
[2026-05-24 12:23:51] [INFO ] Flow matrix only has 288 transitions (discarded 29 similar events)
[2026-05-24 12:23:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:23:51] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-24 12:23:51] [INFO ] Flow matrix only has 288 transitions (discarded 29 similar events)
[2026-05-24 12:23:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:23:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 12:23:51] [INFO ] Implicit Places using invariants and state equation in 404 ms returned [12, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 567 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 115/117 places, 317/317 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 113 transition count 315
Applied a total of 4 rules in 32 ms. Remains 113 /115 variables (removed 2) and now considering 315/317 (removed 2) transitions.
[2026-05-24 12:23:51] [INFO ] Flow matrix only has 286 transitions (discarded 29 similar events)
// Phase 1: matrix 286 rows 113 cols
[2026-05-24 12:23:51] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:23:51] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-24 12:23:51] [INFO ] Flow matrix only has 286 transitions (discarded 29 similar events)
[2026-05-24 12:23:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:23:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 12:23:52] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 113/117 places, 315/317 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1307 ms. Remains : 113/117 places, 315/317 transitions.
[2026-05-24 12:23:52] [INFO ] Flow matrix only has 286 transitions (discarded 29 similar events)
[2026-05-24 12:23:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (57945 resets) in 1739 ms. (574 steps per ms)
BEST_FIRST walk for 2000001 steps (27976 resets) in 1049 ms. (1904 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-24 12:23:55] [INFO ] Flow matrix only has 286 transitions (discarded 29 similar events)
[2026-05-24 12:23:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:23:55] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2026-05-24 12:23:55] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2026-05-24 12:23:55] [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:23:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2026-05-24 12:23:55] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2026-05-24 12:23:55] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 12:23:55] [INFO ] [Nat]Added 43 Read/Feed constraints in 34 ms returned sat
[2026-05-24 12:23:55] [INFO ] Computed and/alt/rep : 127/526/127 causal constraints (skipped 157 transitions) in 32 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:56] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 5 ms to minimize.
[2026-05-24 12:23:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2026-05-24 12:23:56] [INFO ] Added : 29 causal constraints over 6 iterations in 464 ms. Result :sat
Minimization took 224 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:23:56] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-24 12:23:56] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2026-05-24 12:23:56] [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:23:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2026-05-24 12:23:56] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2026-05-24 12:23:56] [INFO ] [Nat]Added 43 Read/Feed constraints in 39 ms returned sat
[2026-05-24 12:23:56] [INFO ] Computed and/alt/rep : 127/526/127 causal constraints (skipped 157 transitions) in 35 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:23:57] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 4 ms to minimize.
[2026-05-24 12:23:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2026-05-24 12:23:57] [INFO ] Added : 44 causal constraints over 9 iterations in 519 ms. Result :sat
Minimization took 222 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 315/315 transitions.
Applied a total of 0 rules in 15 ms. Remains 113 /113 variables (removed 0) and now considering 315/315 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 113/113 places, 315/315 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 315/315 transitions.
Applied a total of 0 rules in 13 ms. Remains 113 /113 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2026-05-24 12:23:57] [INFO ] Flow matrix only has 286 transitions (discarded 29 similar events)
[2026-05-24 12:23:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:23:57] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-24 12:23:57] [INFO ] Flow matrix only has 286 transitions (discarded 29 similar events)
[2026-05-24 12:23:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:23:58] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 12:23:58] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:23:58] [INFO ] Redundant transitions in 36 ms returned []
Running 313 sub problems to find dead transitions.
[2026-05-24 12:23:58] [INFO ] Flow matrix only has 286 transitions (discarded 29 similar events)
[2026-05-24 12:23:58] [INFO ] Invariant cache hit.
[2026-05-24 12:23:58] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:24:01] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:24:01] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:24:01] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:24:01] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:24:01] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:24:02] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:24:03] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 20 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 286/398 variables, 112/125 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 43/168 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:24:10] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:24:11] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:24:12] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/399 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/399 variables, and 172 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 286/398 variables, 112/128 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 43/171 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 313/484 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:24:38] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:24:41] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:24:54] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/399 variables, and 487 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60541ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60563ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61406 ms. Remains : 113/113 places, 315/315 transitions.
RANDOM walk for 40000 steps (2375 resets) in 1579 ms. (25 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (558 resets) in 258 ms. (154 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (562 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (529 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (526 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
[2026-05-24 12:25:00] [INFO ] Flatten gal took : 187 ms
[2026-05-24 12:25:00] [INFO ] Flatten gal took : 90 ms
[2026-05-24 12:25:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6207051102312035634.gal : 20 ms
[2026-05-24 12:25:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12175466128044316301.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/ReachabilityCardinality6207051102312035634.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12175466128044316301.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 ...329
Loading property file /tmp/ReachabilityCardinality12175466128044316301.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :13 after 21
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :21 after 43
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :43 after 111
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :111 after 268
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :268 after 2844
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2844 after 9554
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :271332 after 406998
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.24561e+06,1.09927,29460,2,1919,16,80937,10,0,773,89679,0
Total reachable state count : 4245610

Verifying 4 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,6578,1.10039,29460,2,447,16,80937,10,0,775,89679,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,6578,1.1012,29716,2,447,16,80937,10,0,775,89679,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,6395,1.1019,29716,2,525,16,80937,10,0,776,89679,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,6395,1.10255,29716,2,525,16,80937,10,0,776,89679,0
Interrupted probabilistic random walk after 603603 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 4
Probabilistic random walk after 603603 steps, saw 130007 distinct states, run finished after 3030 ms. (steps per millisecond=199 ) properties seen :0
FORMULA FireWire-PT-09-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-09-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 91781 ms.

BK_STOP 1779625503172

--------------------
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-09"
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-09, 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-177955812400027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-09.tgz
mv FireWire-PT-09 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 ;