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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 6.3K Mar 6 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 6 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 6 13:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 6 13:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 08:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 08:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 6 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Mar 6 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 6 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:32 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 248K 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-17-UpperBounds-00
FORMULA_NAME CO4-PT-17-UpperBounds-01
FORMULA_NAME CO4-PT-17-UpperBounds-02
FORMULA_NAME CO4-PT-17-UpperBounds-03
FORMULA_NAME CO4-PT-17-UpperBounds-04
FORMULA_NAME CO4-PT-17-UpperBounds-05
FORMULA_NAME CO4-PT-17-UpperBounds-06
FORMULA_NAME CO4-PT-17-UpperBounds-07
FORMULA_NAME CO4-PT-17-UpperBounds-08
FORMULA_NAME CO4-PT-17-UpperBounds-09
FORMULA_NAME CO4-PT-17-UpperBounds-10
FORMULA_NAME CO4-PT-17-UpperBounds-11
FORMULA_NAME CO4-PT-17-UpperBounds-12
FORMULA_NAME CO4-PT-17-UpperBounds-13
FORMULA_NAME CO4-PT-17-UpperBounds-14
FORMULA_NAME CO4-PT-17-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779556931057

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 17:22:12] [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:22:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:22:12] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2026-05-23 17:22:12] [INFO ] Transformed 967 places.
[2026-05-23 17:22:12] [INFO ] Transformed 1150 transitions.
[2026-05-23 17:22:12] [INFO ] Found NUPN structural information;
[2026-05-23 17:22:12] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 198 places in 11 ms
Reduce places removed 198 places and 238 transitions.
FORMULA CO4-PT-17-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-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, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 912 rows 769 cols
[2026-05-23 17:22:12] [INFO ] Computed 9 invariants in 29 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (26 resets) in 35 ms. (277 steps per ms)
FORMULA CO4-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80001 steps (210 resets) in 131 ms. (606 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:22:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:13] [INFO ] [Real]Absence check using 9 positive place invariants in 25 ms returned sat
[2026-05-23 17:22:13] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2026-05-23 17:22:13] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 63 ms.
[2026-05-23 17:22:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 25 ms returned sat
[2026-05-23 17:22:14] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2026-05-23 17:22:14] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 49 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:15] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 53 ms to minimize.
[2026-05-23 17:22:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2026-05-23 17:22:16] [INFO ] Added : 136 causal constraints over 28 iterations in 1783 ms. Result :sat
Minimization took 401 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:16] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2026-05-23 17:22:16] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:17] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 10 ms to minimize.
[2026-05-23 17:22:17] [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:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 22 ms returned sat
[2026-05-23 17:22:17] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:17] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 4 ms to minimize.
[2026-05-23 17:22:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2026-05-23 17:22:17] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 49 ms.
[2026-05-23 17:22:18] [INFO ] Added : 106 causal constraints over 22 iterations in 1070 ms. Result :sat
Minimization took 326 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:19] [INFO ] [Real]Absence check using 9 positive place invariants in 21 ms returned sat
[2026-05-23 17:22:19] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:19] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 12 ms to minimize.
[2026-05-23 17:22:19] [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:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 21 ms returned sat
[2026-05-23 17:22:20] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:20] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 12 ms to minimize.
[2026-05-23 17:22:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2026-05-23 17:22:20] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 43 ms.
[2026-05-23 17:22:21] [INFO ] Added : 107 causal constraints over 22 iterations in 1047 ms. Result :sat
Minimization took 290 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:21] [INFO ] [Real]Absence check using 9 positive place invariants in 20 ms returned sat
[2026-05-23 17:22:22] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:22] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 10 ms to minimize.
[2026-05-23 17:22:22] [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:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2026-05-23 17:22:22] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:23] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 10 ms to minimize.
[2026-05-23 17:22:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2026-05-23 17:22:23] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 43 ms.
[2026-05-23 17:22:24] [INFO ] Added : 109 causal constraints over 22 iterations in 1122 ms. Result :sat
Minimization took 254 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:24] [INFO ] [Real]Absence check using 9 positive place invariants in 20 ms returned sat
[2026-05-23 17:22:24] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:25] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 10 ms to minimize.
[2026-05-23 17:22:25] [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:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2026-05-23 17:22:25] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:25] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 10 ms to minimize.
[2026-05-23 17:22:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2026-05-23 17:22:25] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 53 ms.
[2026-05-23 17:22:26] [INFO ] Added : 108 causal constraints over 23 iterations in 1196 ms. Result :sat
Minimization took 266 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:27] [INFO ] [Real]Absence check using 9 positive place invariants in 22 ms returned sat
[2026-05-23 17:22:27] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:27] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 10 ms to minimize.
[2026-05-23 17:22:27] [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:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2026-05-23 17:22:28] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:28] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 5 ms to minimize.
[2026-05-23 17:22:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2026-05-23 17:22:28] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 55 ms.
[2026-05-23 17:22:29] [INFO ] Added : 138 causal constraints over 28 iterations in 1387 ms. Result :sat
Minimization took 309 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:30] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2026-05-23 17:22:30] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:30] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 9 ms to minimize.
[2026-05-23 17:22:30] [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:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2026-05-23 17:22:31] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:31] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 10 ms to minimize.
[2026-05-23 17:22:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2026-05-23 17:22:31] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 41 ms.
[2026-05-23 17:22:32] [INFO ] Added : 113 causal constraints over 23 iterations in 1056 ms. Result :sat
Minimization took 274 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:32] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2026-05-23 17:22:32] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:33] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 10 ms to minimize.
[2026-05-23 17:22:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2026-05-23 17:22:33] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:33] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 5 ms to minimize.
[2026-05-23 17:22:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2026-05-23 17:22:33] [INFO ] Computed and/alt/rep : 797/974/797 causal constraints (skipped 114 transitions) in 46 ms.
[2026-05-23 17:22:34] [INFO ] Added : 99 causal constraints over 20 iterations in 974 ms. Result :sat
Minimization took 292 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-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-17-UpperBounds-01 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 769 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p904) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 911/911 transitions.
Graph (trivial) has 795 edges and 769 vertex of which 2 / 769 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1144 edges and 768 vertex of which 712 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.2 ms
Discarding 56 places :
Also discarding 34 output transitions
Drop transitions (Output transitions of discarded places.) removed 34 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 374 transitions
Trivial Post-agglo rules discarded 374 transitions
Performed 374 trivial Post agglomeration. Transition count delta: 374
Iterating post reduction 0 with 399 rules applied. Total rules applied 401 place count 711 transition count 476
Reduce places removed 375 places and 2 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 384 rules applied. Total rules applied 785 place count 336 transition count 465
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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 794 place count 332 transition count 460
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 3 with 3 rules applied. Total rules applied 797 place count 331 transition count 458
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 800 place count 330 transition count 456
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 802 place count 329 transition count 455
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 802 place count 329 transition count 453
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 806 place count 327 transition count 453
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 845 place count 288 transition count 414
Iterating global reduction 6 with 39 rules applied. Total rules applied 884 place count 288 transition count 414
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 884 place count 288 transition count 398
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 916 place count 272 transition count 398
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 944 place count 244 transition count 370
Iterating global reduction 6 with 28 rules applied. Total rules applied 972 place count 244 transition count 370
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 976 place count 244 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 977 place count 243 transition count 366
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 978 place count 242 transition count 364
Iterating global reduction 8 with 1 rules applied. Total rules applied 979 place count 242 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 980 place count 242 transition count 363
Performed 110 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 9 with 220 rules applied. Total rules applied 1200 place count 132 transition count 239
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1203 place count 132 transition count 236
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1204 place count 131 transition count 235
Iterating global reduction 10 with 1 rules applied. Total rules applied 1205 place count 131 transition count 235
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 10 with 86 rules applied. Total rules applied 1291 place count 88 transition count 238
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 10 with 28 rules applied. Total rules applied 1319 place count 88 transition count 210
Discarding 39 places :
Symmetric choice reduction at 11 with 39 rule applications. Total rules 1358 place count 49 transition count 132
Iterating global reduction 11 with 39 rules applied. Total rules applied 1397 place count 49 transition count 132
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 11 with 27 rules applied. Total rules applied 1424 place count 49 transition count 105
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 1434 place count 39 transition count 76
Iterating global reduction 12 with 10 rules applied. Total rules applied 1444 place count 39 transition count 76
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 1451 place count 39 transition count 69
Free-agglomeration rule applied 5 times.
Iterating global reduction 13 with 5 rules applied. Total rules applied 1456 place count 39 transition count 64
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 1464 place count 34 transition count 61
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1466 place count 34 transition count 61
Graph (complete) has 118 edges and 34 vertex of which 33 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 14 with 1 rules applied. Total rules applied 1467 place count 33 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1468 place count 33 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1469 place count 33 transition count 60
Graph (complete) has 115 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 1470 place count 32 transition count 60
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1471 place count 32 transition count 59
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1472 place count 32 transition count 59
Graph (complete) has 112 edges and 32 vertex of which 31 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 18 with 1 rules applied. Total rules applied 1473 place count 31 transition count 59
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1474 place count 31 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 1475 place count 30 transition count 57
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 t83.t948.t11.t12 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.
Graph (trivial) has 26 edges and 26 vertex of which 3 / 26 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 20 with 3 rules applied. Total rules applied 1478 place count 24 transition count 55
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 21 with 5 rules applied. Total rules applied 1483 place count 24 transition count 50
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 1484 place count 23 transition count 48
Iterating global reduction 22 with 1 rules applied. Total rules applied 1485 place count 23 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 1486 place count 23 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 23 with 10 rules applied. Total rules applied 1496 place count 23 transition count 37
Discarding 6 places :
Symmetric choice reduction at 23 with 6 rule applications. Total rules 1502 place count 17 transition count 31
Iterating global reduction 23 with 6 rules applied. Total rules applied 1508 place count 17 transition count 31
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 1514 place count 17 transition count 25
Discarding 3 places :
Symmetric choice reduction at 24 with 3 rule applications. Total rules 1517 place count 14 transition count 22
Iterating global reduction 24 with 3 rules applied. Total rules applied 1520 place count 14 transition count 22
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 24 with 3 rules applied. Total rules applied 1523 place count 14 transition count 19
Free-agglomeration rule applied 3 times.
Iterating global reduction 25 with 3 rules applied. Total rules applied 1526 place count 14 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 25 with 3 rules applied. Total rules applied 1529 place count 11 transition count 16
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 26 with 3 rules applied. Total rules applied 1532 place count 11 transition count 16
Applied a total of 1532 rules in 188 ms. Remains 11 /769 variables (removed 758) and now considering 16/911 (removed 895) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 11/769 places, 16/911 transitions.
[2026-05-23 17:22:35] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 11 cols
[2026-05-23 17:22:35] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 575 ms. (1736 steps per ms)
FORMULA CO4-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 543 ms. (1838 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:36] [INFO ] Flatten gal took : 18 ms
[2026-05-23 17:22:36] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:22:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11542590105460930665.gal : 4 ms
[2026-05-23 17:22:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2977098629748761088.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/ReachabilityCardinality11542590105460930665.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2977098629748761088.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 24428 ms.

BK_STOP 1779556956829

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

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