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.r079-tall-177946972200047.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 CO4-PT-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r079-tall-177946972200047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.6K Mar 6 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 6 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 6 13:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Mar 6 13:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 6 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 6 13:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:31 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 177K 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 CO4-PT-12-UpperBounds-00
FORMULA_NAME CO4-PT-12-UpperBounds-01
FORMULA_NAME CO4-PT-12-UpperBounds-02
FORMULA_NAME CO4-PT-12-UpperBounds-03
FORMULA_NAME CO4-PT-12-UpperBounds-04
FORMULA_NAME CO4-PT-12-UpperBounds-05
FORMULA_NAME CO4-PT-12-UpperBounds-06
FORMULA_NAME CO4-PT-12-UpperBounds-07
FORMULA_NAME CO4-PT-12-UpperBounds-08
FORMULA_NAME CO4-PT-12-UpperBounds-09
FORMULA_NAME CO4-PT-12-UpperBounds-10
FORMULA_NAME CO4-PT-12-UpperBounds-11
FORMULA_NAME CO4-PT-12-UpperBounds-12
FORMULA_NAME CO4-PT-12-UpperBounds-13
FORMULA_NAME CO4-PT-12-UpperBounds-14
FORMULA_NAME CO4-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779556904179

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 17:21:45] [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-23 17:21:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:21:45] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2026-05-23 17:21:45] [INFO ] Transformed 649 places.
[2026-05-23 17:21:45] [INFO ] Transformed 782 transitions.
[2026-05-23 17:21:45] [INFO ] Found NUPN structural information;
[2026-05-23 17:21:45] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 172 places in 9 ms
Reduce places removed 172 places and 219 transitions.
FORMULA CO4-PT-12-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 563 rows 477 cols
[2026-05-23 17:21:45] [INFO ] Computed 9 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 10000 steps (68 resets) in 42 ms. (232 steps per ms)
FORMULA CO4-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90002 steps (405 resets) in 108 ms. (825 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-23 17:21:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:46] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2026-05-23 17:21:46] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:46] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:46] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 14 ms to minimize.
[2026-05-23 17:21:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2026-05-23 17:21:46] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:46] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:46] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 4 ms to minimize.
[2026-05-23 17:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2026-05-23 17:21:47] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 38 ms.
[2026-05-23 17:21:47] [INFO ] Added : 94 causal constraints over 19 iterations in 824 ms. Result :sat
Minimization took 165 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:48] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 17:21:48] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:48] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2026-05-23 17:21:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 17:21:48] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:48] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2026-05-23 17:21:48] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 29 ms.
[2026-05-23 17:21:49] [INFO ] Added : 100 causal constraints over 20 iterations in 723 ms. Result :sat
Minimization took 303 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:49] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-23 17:21:49] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-23 17:21:49] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:49] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 3 ms to minimize.
[2026-05-23 17:21:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 17:21:50] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:50] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:50] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 3 ms to minimize.
[2026-05-23 17:21:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2026-05-23 17:21:50] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 32 ms.
[2026-05-23 17:21:50] [INFO ] Added : 94 causal constraints over 19 iterations in 679 ms. Result :sat
Minimization took 218 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:51] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-23 17:21:51] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-23 17:21:51] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2026-05-23 17:21:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2026-05-23 17:21:51] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:51] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2026-05-23 17:21:51] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 27 ms.
[2026-05-23 17:21:52] [INFO ] Added : 145 causal constraints over 29 iterations in 1059 ms. Result :sat
Minimization took 217 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:53] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 17:21:53] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:53] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-23 17:21:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 17:21:53] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-23 17:21:53] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2026-05-23 17:21:53] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 27 ms.
[2026-05-23 17:21:54] [INFO ] Added : 120 causal constraints over 24 iterations in 880 ms. Result :sat
Minimization took 290 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:54] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-23 17:21:54] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:54] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2026-05-23 17:21:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 17:21:54] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-23 17:21:55] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:55] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 16 ms to minimize.
[2026-05-23 17:21:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2026-05-23 17:21:55] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 27 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:55] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 10 ms to minimize.
[2026-05-23 17:21:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2026-05-23 17:21:56] [INFO ] Added : 99 causal constraints over 20 iterations in 851 ms. Result :sat
Minimization took 240 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:56] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-23 17:21:56] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-23 17:21:56] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2026-05-23 17:21:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2026-05-23 17:21:56] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:56] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2026-05-23 17:21:56] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 26 ms.
[2026-05-23 17:21:57] [INFO ] Added : 110 causal constraints over 22 iterations in 762 ms. Result :sat
Minimization took 263 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:57] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-23 17:21:57] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-23 17:21:58] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2026-05-23 17:21:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2026-05-23 17:21:58] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-23 17:21:58] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2026-05-23 17:21:58] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 28 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:59] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 17 ms to minimize.
[2026-05-23 17:21:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2026-05-23 17:21:59] [INFO ] Added : 113 causal constraints over 23 iterations in 1058 ms. Result :sat
Minimization took 286 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:59] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-23 17:21:59] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:59] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2026-05-23 17:21:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2026-05-23 17:22:00] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:00] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2026-05-23 17:22:00] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 25 ms.
[2026-05-23 17:22:00] [INFO ] Added : 100 causal constraints over 20 iterations in 691 ms. Result :sat
Minimization took 210 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 563/563 transitions.
Graph (trivial) has 479 edges and 477 vertex of which 3 / 477 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 770 edges and 475 vertex of which 434 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Discarding 41 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 296 rules applied. Total rules applied 298 place count 434 transition count 244
Reduce places removed 271 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 287 rules applied. Total rules applied 585 place count 163 transition count 228
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 18 rules applied. Total rules applied 603 place count 156 transition count 217
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 611 place count 152 transition count 213
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 617 place count 150 transition count 209
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 622 place count 148 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 623 place count 147 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 623 place count 147 transition count 205
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 625 place count 146 transition count 205
Discarding 25 places :
Symmetric choice reduction at 7 with 25 rule applications. Total rules 650 place count 121 transition count 180
Iterating global reduction 7 with 25 rules applied. Total rules applied 675 place count 121 transition count 180
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 675 place count 121 transition count 175
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 685 place count 116 transition count 175
Graph (complete) has 276 edges and 116 vertex of which 114 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 686 place count 114 transition count 174
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 689 place count 114 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 690 place count 113 transition count 171
Discarding 16 places :
Symmetric choice reduction at 10 with 16 rule applications. Total rules 706 place count 97 transition count 137
Iterating global reduction 10 with 16 rules applied. Total rules applied 722 place count 97 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 724 place count 97 transition count 135
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 726 place count 95 transition count 133
Iterating global reduction 11 with 2 rules applied. Total rules applied 728 place count 95 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 730 place count 95 transition count 131
Performed 37 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 12 with 74 rules applied. Total rules applied 804 place count 58 transition count 92
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 810 place count 58 transition count 86
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 813 place count 55 transition count 83
Iterating global reduction 13 with 3 rules applied. Total rules applied 816 place count 55 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 817 place count 55 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 821 place count 53 transition count 80
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 823 place count 53 transition count 78
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 825 place count 51 transition count 76
Iterating global reduction 15 with 2 rules applied. Total rules applied 827 place count 51 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 828 place count 51 transition count 75
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 829 place count 50 transition count 74
Iterating global reduction 16 with 1 rules applied. Total rules applied 830 place count 50 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 831 place count 50 transition count 73
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 17 with 22 rules applied. Total rules applied 853 place count 39 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 17 with 18 rules applied. Total rules applied 871 place count 39 transition count 57
Discarding 8 places :
Symmetric choice reduction at 18 with 8 rule applications. Total rules 879 place count 31 transition count 49
Iterating global reduction 18 with 8 rules applied. Total rules applied 887 place count 31 transition count 49
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 894 place count 31 transition count 42
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 895 place count 30 transition count 40
Iterating global reduction 19 with 1 rules applied. Total rules applied 896 place count 30 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 898 place count 29 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 899 place count 29 transition count 43
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 900 place count 28 transition count 42
Iterating global reduction 19 with 1 rules applied. Total rules applied 901 place count 28 transition count 42
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 903 place count 28 transition count 40
Free-agglomeration rule applied 7 times.
Iterating global reduction 20 with 7 rules applied. Total rules applied 910 place count 28 transition count 33
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 9 rules applied. Total rules applied 919 place count 21 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 920 place count 20 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 922 place count 18 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 22 with 4 rules applied. Total rules applied 926 place count 16 transition count 28
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 932 place count 16 transition count 22
Applied a total of 932 rules in 90 ms. Remains 16 /477 variables (removed 461) and now considering 22/563 (removed 541) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 16/477 places, 22/563 transitions.
// Phase 1: matrix 22 rows 16 cols
[2026-05-23 17:22:01] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA CO4-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 679 ms. (1470 steps per ms)
FORMULA CO4-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 244 ms. (4081 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-23 17:22:02] [INFO ] Flatten gal took : 20 ms
[2026-05-23 17:22:02] [INFO ] Flatten gal took : 5 ms
[2026-05-23 17:22:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4037487189584459286.gal : 4 ms
[2026-05-23 17:22:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2118152347356170024.prop : 0 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/ReachabilityCardinality4037487189584459286.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2118152347356170024.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 17041 ms.

BK_STOP 1779556922593

--------------------
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="CO4-PT-12"
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 CO4-PT-12, 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 r079-tall-177946972200047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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