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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.6K Mar 6 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 6 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 6 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 6 13:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Mar 6 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 6 13:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 6 13:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 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 132K 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-10-UpperBounds-00
FORMULA_NAME CO4-PT-10-UpperBounds-01
FORMULA_NAME CO4-PT-10-UpperBounds-02
FORMULA_NAME CO4-PT-10-UpperBounds-03
FORMULA_NAME CO4-PT-10-UpperBounds-04
FORMULA_NAME CO4-PT-10-UpperBounds-05
FORMULA_NAME CO4-PT-10-UpperBounds-06
FORMULA_NAME CO4-PT-10-UpperBounds-07
FORMULA_NAME CO4-PT-10-UpperBounds-08
FORMULA_NAME CO4-PT-10-UpperBounds-09
FORMULA_NAME CO4-PT-10-UpperBounds-10
FORMULA_NAME CO4-PT-10-UpperBounds-11
FORMULA_NAME CO4-PT-10-UpperBounds-12
FORMULA_NAME CO4-PT-10-UpperBounds-13
FORMULA_NAME CO4-PT-10-UpperBounds-14
FORMULA_NAME CO4-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779556900221

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 17:21:41] [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:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:21:41] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2026-05-23 17:21:41] [INFO ] Transformed 544 places.
[2026-05-23 17:21:41] [INFO ] Transformed 615 transitions.
[2026-05-23 17:21:41] [INFO ] Found NUPN structural information;
[2026-05-23 17:21:41] [INFO ] Parsed PT model containing 544 places and 615 transitions and 1338 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 157 places in 8 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-UpperBounds-14 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 438 rows 387 cols
[2026-05-23 17:21:41] [INFO ] Computed 6 invariants in 20 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 (13 resets) in 33 ms. (294 steps per ms)
FORMULA CO4-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80000 steps (129 resets) in 94 ms. (842 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-23 17:21:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:42] [INFO ] [Real]Absence check using 6 positive place invariants in 18 ms returned sat
[2026-05-23 17:21:42] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2026-05-23 17:21:42] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 33 ms.
[2026-05-23 17:21: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-23 17:21:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2026-05-23 17:21:42] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2026-05-23 17:21:43] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 21 ms.
[2026-05-23 17:21:43] [INFO ] Added : 70 causal constraints over 15 iterations in 430 ms. Result :sat
Minimization took 130 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:43] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:43] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2026-05-23 17:21:43] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 22 ms.
[2026-05-23 17:21: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-23 17:21:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2026-05-23 17:21:44] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2026-05-23 17:21:44] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 18 ms.
[2026-05-23 17:21:44] [INFO ] Added : 72 causal constraints over 15 iterations in 406 ms. Result :sat
Minimization took 133 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:44] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2026-05-23 17:21:44] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:45] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 32 ms to minimize.
[2026-05-23 17:21:45] [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:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2026-05-23 17:21:45] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:45] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 25 ms to minimize.
[2026-05-23 17:21:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2026-05-23 17:21:45] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 19 ms.
[2026-05-23 17:21:45] [INFO ] Added : 65 causal constraints over 13 iterations in 361 ms. Result :sat
Minimization took 127 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:46] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2026-05-23 17:21:46] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2026-05-23 17:21:46] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 20 ms.
[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 6 positive place invariants in 12 ms returned sat
[2026-05-23 17:21:46] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2026-05-23 17:21:46] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 23 ms.
[2026-05-23 17:21:46] [INFO ] Added : 70 causal constraints over 14 iterations in 401 ms. Result :sat
Minimization took 131 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:47] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2026-05-23 17:21:47] [INFO ] [Real]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:47] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 41 ms to minimize.
[2026-05-23 17:21:47] [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:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2026-05-23 17:21:47] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:47] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 38 ms to minimize.
[2026-05-23 17:21:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2026-05-23 17:21:47] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 20 ms.
[2026-05-23 17:21:48] [INFO ] Added : 70 causal constraints over 14 iterations in 359 ms. Result :sat
Minimization took 123 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 6 positive place invariants in 10 ms returned sat
[2026-05-23 17:21:48] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:48] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 6 ms to minimize.
[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 6 positive place invariants in 11 ms returned sat
[2026-05-23 17:21:48] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:48] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 6 ms to minimize.
[2026-05-23 17:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2026-05-23 17:21:49] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 17 ms.
[2026-05-23 17:21:49] [INFO ] Added : 72 causal constraints over 15 iterations in 375 ms. Result :sat
Minimization took 129 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 6 positive place invariants in 14 ms returned sat
[2026-05-23 17:21:49] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2026-05-23 17:21:49] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 20 ms.
[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:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2026-05-23 17:21:50] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2026-05-23 17:21:50] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 25 ms.
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 249 places in 161 ms of which 53 ms to minimize.
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 249 places in 164 ms of which 60 ms to minimize.
[2026-05-23 17:21:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 420 ms
[2026-05-23 17:21:50] [INFO ] Added : 77 causal constraints over 16 iterations in 852 ms. Result :sat
Minimization took 129 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 6 positive place invariants in 10 ms returned sat
[2026-05-23 17:21:51] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:51] [INFO ] Deduced a trap composed of 232 places in 131 ms of which 39 ms to minimize.
[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 6 positive place invariants in 10 ms returned sat
[2026-05-23 17:21:51] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:51] [INFO ] Deduced a trap composed of 232 places in 138 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:51] [INFO ] Deduced a trap composed of 291 places in 167 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:52] [INFO ] Deduced a trap composed of 315 places in 96 ms of which 4 ms to minimize.
[2026-05-23 17:21:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 461 ms
[2026-05-23 17:21:52] [INFO ] Computed and/alt/rep : 395/482/395 causal constraints (skipped 42 transitions) in 21 ms.
[2026-05-23 17:21:52] [INFO ] Added : 90 causal constraints over 18 iterations in 461 ms. Result :sat
Minimization took 133 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-10-UpperBounds-01 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 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 438/438 transitions.
Graph (trivial) has 390 edges and 387 vertex of which 3 / 387 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 529 edges and 385 vertex of which 351 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 351 transition count 173
Reduce places removed 225 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 234 rules applied. Total rules applied 479 place count 126 transition count 164
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 10 rules applied. Total rules applied 489 place count 122 transition count 158
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 4 rules applied. Total rules applied 493 place count 120 transition count 156
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 3 rules applied. Total rules applied 496 place count 119 transition count 154
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 500 place count 118 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 502 place count 116 transition count 151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 502 place count 116 transition count 149
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 506 place count 114 transition count 149
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 523 place count 97 transition count 132
Iterating global reduction 7 with 17 rules applied. Total rules applied 540 place count 97 transition count 132
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 540 place count 97 transition count 127
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 550 place count 92 transition count 127
Graph (complete) has 166 edges and 92 vertex of which 90 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 551 place count 90 transition count 126
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 554 place count 90 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 555 place count 89 transition count 123
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 563 place count 81 transition count 115
Iterating global reduction 10 with 8 rules applied. Total rules applied 571 place count 81 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 572 place count 81 transition count 114
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 573 place count 80 transition count 113
Iterating global reduction 11 with 1 rules applied. Total rules applied 574 place count 80 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 575 place count 80 transition count 112
Performed 30 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 12 with 60 rules applied. Total rules applied 635 place count 50 transition count 78
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 637 place count 50 transition count 76
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 639 place count 48 transition count 74
Iterating global reduction 13 with 2 rules applied. Total rules applied 641 place count 48 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 642 place count 48 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 644 place count 47 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 645 place count 47 transition count 71
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 646 place count 46 transition count 70
Iterating global reduction 15 with 1 rules applied. Total rules applied 647 place count 46 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 648 place count 46 transition count 69
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 16 with 26 rules applied. Total rules applied 674 place count 33 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 16 with 19 rules applied. Total rules applied 693 place count 33 transition count 53
Discarding 9 places :
Symmetric choice reduction at 17 with 9 rule applications. Total rules 702 place count 24 transition count 44
Iterating global reduction 17 with 9 rules applied. Total rules applied 711 place count 24 transition count 44
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 719 place count 24 transition count 36
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 720 place count 23 transition count 34
Iterating global reduction 18 with 1 rules applied. Total rules applied 721 place count 23 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 722 place count 23 transition count 33
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 723 place count 22 transition count 32
Iterating global reduction 18 with 1 rules applied. Total rules applied 724 place count 22 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 725 place count 22 transition count 31
Free-agglomeration rule applied 4 times.
Iterating global reduction 19 with 4 rules applied. Total rules applied 729 place count 22 transition count 27
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 44 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 6 rules applied. Total rules applied 735 place count 17 transition count 26
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 736 place count 17 transition count 25
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 737 place count 17 transition count 25
Graph (complete) has 41 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 21 with 1 rules applied. Total rules applied 738 place count 16 transition count 25
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 739 place count 16 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 740 place count 15 transition count 23
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t130.t131.t558 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 742 place count 12 transition count 21
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 10 edges and 11 vertex of which 5 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 2 rules applied. Total rules applied 744 place count 7 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 25 with 9 rules applied. Total rules applied 753 place count 7 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 26 with 3 rules applied. Total rules applied 756 place count 7 transition count 9
Free-agglomeration rule applied 3 times.
Iterating global reduction 26 with 3 rules applied. Total rules applied 759 place count 7 transition count 6
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 26 with 3 rules applied. Total rules applied 762 place count 4 transition count 6
Applied a total of 762 rules in 77 ms. Remains 4 /387 variables (removed 383) and now considering 6/438 (removed 432) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 4/387 places, 6/438 transitions.
// Phase 1: matrix 6 rows 4 cols
[2026-05-23 17:21:52] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA CO4-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 363 ms. (2747 steps per ms)
FORMULA CO4-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 288 ms. (3460 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:21:53] [INFO ] Flatten gal took : 101 ms
[2026-05-23 17:21:53] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:21:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9715150644284440955.gal : 2 ms
[2026-05-23 17:21:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3079918487164485457.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/ReachabilityCardinality9715150644284440955.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3079918487164485457.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 12171 ms.

BK_STOP 1779556913830

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

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