Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r097-smll-174860111800036.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is FireWire-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 90K May 29 14:32 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-06-UpperBounds-00
FORMULA_NAME FireWire-PT-06-UpperBounds-01
FORMULA_NAME FireWire-PT-06-UpperBounds-02
FORMULA_NAME FireWire-PT-06-UpperBounds-03
FORMULA_NAME FireWire-PT-06-UpperBounds-04
FORMULA_NAME FireWire-PT-06-UpperBounds-05
FORMULA_NAME FireWire-PT-06-UpperBounds-06
FORMULA_NAME FireWire-PT-06-UpperBounds-07
FORMULA_NAME FireWire-PT-06-UpperBounds-08
FORMULA_NAME FireWire-PT-06-UpperBounds-09
FORMULA_NAME FireWire-PT-06-UpperBounds-10
FORMULA_NAME FireWire-PT-06-UpperBounds-11
FORMULA_NAME FireWire-PT-06-UpperBounds-12
FORMULA_NAME FireWire-PT-06-UpperBounds-13
FORMULA_NAME FireWire-PT-06-UpperBounds-14
FORMULA_NAME FireWire-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748675774228

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 07:16:16] [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]
[2025-05-31 07:16:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:16:17] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2025-05-31 07:16:17] [INFO ] Transformed 116 places.
[2025-05-31 07:16:17] [INFO ] Transformed 368 transitions.
[2025-05-31 07:16:17] [INFO ] Found NUPN structural information;
[2025-05-31 07:16:17] [INFO ] Parsed PT model containing 116 places and 368 transitions and 1362 arcs in 405 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 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]
[2025-05-31 07:16:17] [INFO ] Flow matrix only has 280 transitions (discarded 32 similar events)
// Phase 1: matrix 280 rows 116 cols
[2025-05-31 07:16:17] [INFO ] Computed 9 invariants in 31 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 (495 resets) in 91 ms. (108 steps per ms)
FORMULA FireWire-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (650 resets) in 99 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-31 07:16:17] [INFO ] Flow matrix only has 280 transitions (discarded 32 similar events)
[2025-05-31 07:16:17] [INFO ] Invariant cache hit.
[2025-05-31 07:16:17] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned sat
[2025-05-31 07:16:18] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2025-05-31 07:16:18] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-31 07:16:18] [INFO ] [Real]Added 41 Read/Feed constraints in 20 ms returned sat
[2025-05-31 07:16:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:16:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2025-05-31 07:16:18] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-05-31 07:16:18] [INFO ] [Nat]Added 41 Read/Feed constraints in 33 ms returned sat
[2025-05-31 07:16:18] [INFO ] Computed and/alt/rep : 121/476/121 causal constraints (skipped 158 transitions) in 77 ms.
[2025-05-31 07:16:18] [INFO ] Added : 9 causal constraints over 4 iterations in 240 ms. Result :sat
Minimization took 148 ms.
[2025-05-31 07:16:19] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2025-05-31 07:16:19] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2025-05-31 07:16:19] [INFO ] [Real]Added 41 Read/Feed constraints in 15 ms returned sat
[2025-05-31 07:16:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:16:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2025-05-31 07:16:19] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2025-05-31 07:16:19] [INFO ] [Nat]Added 41 Read/Feed constraints in 35 ms returned sat
[2025-05-31 07:16:19] [INFO ] Computed and/alt/rep : 121/476/121 causal constraints (skipped 158 transitions) in 73 ms.
[2025-05-31 07:16:20] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 20 ms to minimize.
[2025-05-31 07:16:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2025-05-31 07:16:20] [INFO ] Added : 28 causal constraints over 7 iterations in 506 ms. Result :sat
Minimization took 186 ms.
[2025-05-31 07:16:20] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2025-05-31 07:16:20] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-05-31 07:16:20] [INFO ] [Real]Added 41 Read/Feed constraints in 22 ms returned sat
[2025-05-31 07:16:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:16:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2025-05-31 07:16:20] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2025-05-31 07:16:20] [INFO ] [Nat]Added 41 Read/Feed constraints in 36 ms returned sat
[2025-05-31 07:16:21] [INFO ] Computed and/alt/rep : 121/476/121 causal constraints (skipped 158 transitions) in 51 ms.
[2025-05-31 07:16:21] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 5 ms to minimize.
[2025-05-31 07:16:21] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2025-05-31 07:16:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2025-05-31 07:16:21] [INFO ] Added : 41 causal constraints over 10 iterations in 688 ms. Result :sat
Minimization took 171 ms.
[2025-05-31 07:16:21] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2025-05-31 07:16:22] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2025-05-31 07:16:22] [INFO ] [Real]Added 41 Read/Feed constraints in 13 ms returned sat
[2025-05-31 07:16:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:16:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2025-05-31 07:16:22] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2025-05-31 07:16:22] [INFO ] [Nat]Added 41 Read/Feed constraints in 27 ms returned sat
[2025-05-31 07:16:22] [INFO ] Computed and/alt/rep : 121/476/121 causal constraints (skipped 158 transitions) in 57 ms.
[2025-05-31 07:16:22] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2025-05-31 07:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2025-05-31 07:16:22] [INFO ] Added : 41 causal constraints over 10 iterations in 493 ms. Result :sat
Minimization took 199 ms.
[2025-05-31 07:16:23] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2025-05-31 07:16:23] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2025-05-31 07:16:23] [INFO ] [Real]Added 41 Read/Feed constraints in 39 ms returned sat
[2025-05-31 07:16:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:16:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2025-05-31 07:16:23] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2025-05-31 07:16:23] [INFO ] [Nat]Added 41 Read/Feed constraints in 25 ms returned sat
[2025-05-31 07:16:23] [INFO ] Computed and/alt/rep : 121/476/121 causal constraints (skipped 158 transitions) in 62 ms.
[2025-05-31 07:16:24] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 3 ms to minimize.
[2025-05-31 07:16:24] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 3 ms to minimize.
[2025-05-31 07:16:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 386 ms
[2025-05-31 07:16:24] [INFO ] Added : 31 causal constraints over 9 iterations in 721 ms. Result :sat
Minimization took 192 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA FireWire-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-06-UpperBounds-13 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 116 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p106) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 311/311 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 116 transition count 308
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 116 transition count 307
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 114 transition count 305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 112 transition count 303
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 109 transition count 310
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 109 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 34 place count 109 transition count 293
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 109 transition count 295
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 2 with 3 rules applied. Total rules applied 38 place count 108 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 108 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 107 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 106 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 42 place count 106 transition count 289
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 105 transition count 289
Applied a total of 44 rules in 220 ms. Remains 105 /116 variables (removed 11) and now considering 289/311 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 105/116 places, 289/311 transitions.
[2025-05-31 07:16:25] [INFO ] Flow matrix only has 261 transitions (discarded 28 similar events)
// Phase 1: matrix 261 rows 105 cols
[2025-05-31 07:16:25] [INFO ] Computed 8 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (60872 resets) in 1423 ms. (702 steps per ms)
BEST_FIRST walk for 1000001 steps (14914 resets) in 518 ms. (1926 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:16:27] [INFO ] Flow matrix only has 261 transitions (discarded 28 similar events)
[2025-05-31 07:16:27] [INFO ] Invariant cache hit.
[2025-05-31 07:16:27] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:16:27] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-05-31 07:16:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 07:16:27] [INFO ] [Real]Added 39 Read/Feed constraints in 9 ms returned sat
[2025-05-31 07:16:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:16:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:16:27] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2025-05-31 07:16:27] [INFO ] [Nat]Added 39 Read/Feed constraints in 13 ms returned sat
[2025-05-31 07:16:27] [INFO ] Computed and/alt/rep : 114/459/114 causal constraints (skipped 145 transitions) in 31 ms.
[2025-05-31 07:16:28] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 3 ms to minimize.
[2025-05-31 07:16:28] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 4 ms to minimize.
[2025-05-31 07:16:28] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 2 ms to minimize.
[2025-05-31 07:16:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 361 ms
[2025-05-31 07:16:28] [INFO ] Added : 52 causal constraints over 13 iterations in 743 ms. Result :sat
Minimization took 135 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 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 289/289 transitions.
Applied a total of 0 rules in 11 ms. Remains 105 /105 variables (removed 0) and now considering 289/289 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 105/105 places, 289/289 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 289/289 transitions.
Applied a total of 0 rules in 11 ms. Remains 105 /105 variables (removed 0) and now considering 289/289 (removed 0) transitions.
[2025-05-31 07:16:28] [INFO ] Flow matrix only has 261 transitions (discarded 28 similar events)
[2025-05-31 07:16:28] [INFO ] Invariant cache hit.
[2025-05-31 07:16:28] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-05-31 07:16:28] [INFO ] Flow matrix only has 261 transitions (discarded 28 similar events)
[2025-05-31 07:16:28] [INFO ] Invariant cache hit.
[2025-05-31 07:16:28] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 07:16:29] [INFO ] Implicit Places using invariants and state equation in 375 ms returned [34, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 514 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 103/105 places, 289/289 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 103 transition count 287
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 287
Applied a total of 4 rules in 25 ms. Remains 101 /103 variables (removed 2) and now considering 287/289 (removed 2) transitions.
[2025-05-31 07:16:29] [INFO ] Flow matrix only has 259 transitions (discarded 28 similar events)
// Phase 1: matrix 259 rows 101 cols
[2025-05-31 07:16:29] [INFO ] Computed 6 invariants in 2 ms
[2025-05-31 07:16:29] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-05-31 07:16:29] [INFO ] Flow matrix only has 259 transitions (discarded 28 similar events)
[2025-05-31 07:16:29] [INFO ] Invariant cache hit.
[2025-05-31 07:16:29] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 07:16:29] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 101/105 places, 287/289 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 965 ms. Remains : 101/105 places, 287/289 transitions.
[2025-05-31 07:16:29] [INFO ] Flow matrix only has 259 transitions (discarded 28 similar events)
[2025-05-31 07:16:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (61087 resets) in 1396 ms. (715 steps per ms)
BEST_FIRST walk for 1000001 steps (14964 resets) in 480 ms. (2079 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:16:31] [INFO ] Flow matrix only has 259 transitions (discarded 28 similar events)
[2025-05-31 07:16:31] [INFO ] Invariant cache hit.
[2025-05-31 07:16:31] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-31 07:16:31] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2025-05-31 07:16:31] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 07:16:31] [INFO ] [Real]Added 39 Read/Feed constraints in 10 ms returned sat
[2025-05-31 07:16:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:16:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-31 07:16:31] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-05-31 07:16:31] [INFO ] [Nat]Added 39 Read/Feed constraints in 21 ms returned sat
[2025-05-31 07:16:31] [INFO ] Computed and/alt/rep : 112/453/112 causal constraints (skipped 145 transitions) in 30 ms.
[2025-05-31 07:16:31] [INFO ] Added : 29 causal constraints over 6 iterations in 185 ms. Result :sat
Minimization took 118 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 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 287/287 transitions.
Applied a total of 0 rules in 11 ms. Remains 101 /101 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 101/101 places, 287/287 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 287/287 transitions.
Applied a total of 0 rules in 10 ms. Remains 101 /101 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2025-05-31 07:16:32] [INFO ] Flow matrix only has 259 transitions (discarded 28 similar events)
[2025-05-31 07:16:32] [INFO ] Invariant cache hit.
[2025-05-31 07:16:32] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-05-31 07:16:32] [INFO ] Flow matrix only has 259 transitions (discarded 28 similar events)
[2025-05-31 07:16:32] [INFO ] Invariant cache hit.
[2025-05-31 07:16:32] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 07:16:32] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2025-05-31 07:16:32] [INFO ] Redundant transitions in 18 ms returned []
Running 285 sub problems to find dead transitions.
[2025-05-31 07:16:32] [INFO ] Flow matrix only has 259 transitions (discarded 28 similar events)
[2025-05-31 07:16:32] [INFO ] Invariant cache hit.
[2025-05-31 07:16:32] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2025-05-31 07:16:34] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2025-05-31 07:16:34] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2025-05-31 07:16:35] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2025-05-31 07:16:35] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2025-05-31 07:16:39] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 259/360 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 39/151 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2025-05-31 07:16:44] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 10 (OVERLAPS) 0/360 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 152 constraints, problems are : Problem set: 0 solved, 285 unsolved in 22203 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2025-05-31 07:16:57] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 259/360 variables, 101/114 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 285/438 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2025-05-31 07:17:05] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2025-05-31 07:17:12] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/360 variables, and 440 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 9/9 constraints]
After SMT, in 52768ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 52796ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53414 ms. Remains : 101/101 places, 287/287 transitions.
RANDOM walk for 40000 steps (2369 resets) in 1214 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (557 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (594 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
[2025-05-31 07:17:26] [INFO ] Flatten gal took : 229 ms
[2025-05-31 07:17:26] [INFO ] Flatten gal took : 65 ms
[2025-05-31 07:17:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1243575738829246265.gal : 26 ms
[2025-05-31 07:17:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18290214090167368451.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1243575738829246265.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18290214090167368451.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality18290214090167368451.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 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 37
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :37 after 55
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :55 after 377
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :377 after 1100
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1100 after 4344
Finished probabilistic random walk after 114852 steps, run visited all 2 properties in 917 ms. (steps per millisecond=125 )
Probabilistic random walk after 114852 steps, saw 26636 distinct states, run finished after 926 ms. (steps per millisecond=124 ) properties seen :2
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-06-UpperBounds-09 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 70357 ms.

BK_STOP 1748675847074

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is FireWire-PT-06, 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 r097-smll-174860111800036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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