fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r079-tall-177946972200041
Last Updated
Jun 17, 2026

About the Execution of 2025-gold for CO4-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
478.651 10525.00 17690.00 161.60 1 1 0 0 1 1 1 1 0 0 1 1 1 1 0 1 normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.7K Mar 6 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 6 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 6 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 6 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 6 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 6 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 6 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:29 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 97K 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-06-UpperBounds-00
FORMULA_NAME CO4-PT-06-UpperBounds-01
FORMULA_NAME CO4-PT-06-UpperBounds-02
FORMULA_NAME CO4-PT-06-UpperBounds-03
FORMULA_NAME CO4-PT-06-UpperBounds-04
FORMULA_NAME CO4-PT-06-UpperBounds-05
FORMULA_NAME CO4-PT-06-UpperBounds-06
FORMULA_NAME CO4-PT-06-UpperBounds-07
FORMULA_NAME CO4-PT-06-UpperBounds-08
FORMULA_NAME CO4-PT-06-UpperBounds-09
FORMULA_NAME CO4-PT-06-UpperBounds-10
FORMULA_NAME CO4-PT-06-UpperBounds-11
FORMULA_NAME CO4-PT-06-UpperBounds-12
FORMULA_NAME CO4-PT-06-UpperBounds-13
FORMULA_NAME CO4-PT-06-UpperBounds-14
FORMULA_NAME CO4-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779556881145

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 17:21:22] [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:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:21:22] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2026-05-23 17:21:22] [INFO ] Transformed 383 places.
[2026-05-23 17:21:22] [INFO ] Transformed 454 transitions.
[2026-05-23 17:21:22] [INFO ] Found NUPN structural information;
[2026-05-23 17:21:22] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-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] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 334 rows 283 cols
[2026-05-23 17:21:22] [INFO ] Computed 6 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (8 resets) in 27 ms. (357 steps per ms)
FORMULA CO4-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90000 steps (145 resets) in 121 ms. (737 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:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:23] [INFO ] [Real]Absence check using 6 positive place invariants in 16 ms returned sat
[2026-05-23 17:21:23] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2026-05-23 17:21:23] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 25 ms.
[2026-05-23 17:21:23] [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:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:23] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-23 17:21:23] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 20 ms.
[2026-05-23 17:21:23] [INFO ] Added : 41 causal constraints over 9 iterations in 255 ms. Result :sat
Minimization took 84 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:24] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 17:21:24] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2026-05-23 17:21:24] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 20 ms.
[2026-05-23 17:21:24] [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:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 17:21:24] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:24] [INFO ] Deduced a trap composed of 195 places in 118 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:24] [INFO ] Deduced a trap composed of 197 places in 93 ms of which 8 ms to minimize.
[2026-05-23 17:21:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2026-05-23 17:21:24] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 14 ms.
[2026-05-23 17:21:24] [INFO ] Added : 50 causal constraints over 10 iterations in 268 ms. Result :sat
Minimization took 84 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:25] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2026-05-23 17:21:25] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-23 17:21:25] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 17 ms.
[2026-05-23 17:21: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:21:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2026-05-23 17:21:25] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:25] [INFO ] Deduced a trap composed of 195 places in 113 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:25] [INFO ] Deduced a trap composed of 197 places in 88 ms of which 4 ms to minimize.
[2026-05-23 17:21:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2026-05-23 17:21:25] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 18 ms.
[2026-05-23 17:21:25] [INFO ] Added : 48 causal constraints over 10 iterations in 255 ms. Result :sat
Minimization took 82 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:25] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 17:21:26] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:26] [INFO ] Deduced a trap composed of 195 places in 120 ms of which 24 ms to minimize.
[2026-05-23 17:21:26] [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:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2026-05-23 17:21:26] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2026-05-23 17:21:26] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 20 ms.
[2026-05-23 17:21:26] [INFO ] Added : 51 causal constraints over 11 iterations in 262 ms. Result :sat
Minimization took 82 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:26] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 17:21:26] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-23 17:21:26] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 18 ms.
[2026-05-23 17:21:26] [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:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2026-05-23 17:21:27] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-23 17:21:27] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 15 ms.
[2026-05-23 17:21:27] [INFO ] Added : 61 causal constraints over 13 iterations in 295 ms. Result :sat
Minimization took 78 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:27] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2026-05-23 17:21:27] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:27] [INFO ] Deduced a trap composed of 195 places in 94 ms of which 23 ms to minimize.
[2026-05-23 17:21: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:21:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 17:21:27] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-23 17:21:27] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 17 ms.
[2026-05-23 17:21:28] [INFO ] Added : 49 causal constraints over 10 iterations in 255 ms. Result :sat
Minimization took 100 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:28] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 17:21:28] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2026-05-23 17:21:28] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 20 ms.
[2026-05-23 17:21:28] [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:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2026-05-23 17:21:28] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-23 17:21:28] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 17 ms.
[2026-05-23 17:21:28] [INFO ] Added : 41 causal constraints over 9 iterations in 212 ms. Result :sat
Minimization took 87 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:29] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2026-05-23 17:21:29] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2026-05-23 17:21:29] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 18 ms.
[2026-05-23 17:21:29] [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:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2026-05-23 17:21:29] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-23 17:21:29] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 17 ms.
[2026-05-23 17:21:29] [INFO ] Added : 46 causal constraints over 10 iterations in 210 ms. Result :sat
Minimization took 79 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:29] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-23 17:21:29] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-23 17:21:29] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 21 ms.
[2026-05-23 17:21:29] [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:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:30] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2026-05-23 17:21:30] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 23 ms.
[2026-05-23 17:21:30] [INFO ] Added : 45 causal constraints over 9 iterations in 198 ms. Result :sat
Minimization took 80 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-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 334/334 transitions.
Graph (trivial) has 282 edges and 283 vertex of which 2 / 283 are part of one of the 1 SCC in 2 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 426 edges and 282 vertex of which 252 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 142 rules applied. Total rules applied 144 place count 252 transition count 173
Reduce places removed 126 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 135 rules applied. Total rules applied 279 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 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 288 place count 122 transition count 159
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 291 place count 121 transition count 157
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 294 place count 120 transition count 155
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 296 place count 119 transition count 154
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 296 place count 119 transition count 152
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 300 place count 117 transition count 152
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 317 place count 100 transition count 135
Iterating global reduction 6 with 17 rules applied. Total rules applied 334 place count 100 transition count 135
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 334 place count 100 transition count 130
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 344 place count 95 transition count 130
Graph (complete) has 169 edges and 95 vertex of which 93 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 6 with 1 rules applied. Total rules applied 345 place count 93 transition count 129
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 7 with 3 rules applied. Total rules applied 348 place count 93 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 349 place count 92 transition count 126
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 358 place count 83 transition count 117
Iterating global reduction 9 with 9 rules applied. Total rules applied 367 place count 83 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 368 place count 83 transition count 116
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 369 place count 82 transition count 115
Iterating global reduction 10 with 1 rules applied. Total rules applied 370 place count 82 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 371 place count 82 transition count 114
Performed 31 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 11 with 62 rules applied. Total rules applied 433 place count 51 transition count 79
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 435 place count 51 transition count 77
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 436 place count 50 transition count 76
Iterating global reduction 12 with 1 rules applied. Total rules applied 437 place count 50 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 438 place count 50 transition count 75
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 13 with 24 rules applied. Total rules applied 462 place count 38 transition count 76
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 482 place count 38 transition count 56
Discarding 11 places :
Symmetric choice reduction at 14 with 11 rule applications. Total rules 493 place count 27 transition count 45
Iterating global reduction 14 with 11 rules applied. Total rules applied 504 place count 27 transition count 45
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 512 place count 27 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 513 place count 27 transition count 36
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 514 place count 26 transition count 35
Iterating global reduction 15 with 1 rules applied. Total rules applied 515 place count 26 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 516 place count 26 transition count 34
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 520 place count 26 transition count 30
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 48 edges and 22 vertex of which 21 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 16 with 6 rules applied. Total rules applied 526 place count 21 transition count 29
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 527 place count 21 transition count 28
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 18 with 3 rules applied. Total rules applied 530 place count 21 transition count 28
Graph (complete) has 43 edges and 21 vertex of which 20 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 531 place count 20 transition count 28
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 532 place count 20 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 534 place count 20 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 535 place count 20 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 536 place count 19 transition count 24
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 t86.t400 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 20 with 2 rules applied. Total rules applied 538 place count 16 transition count 22
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 13 edges and 15 vertex of which 6 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
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 21 with 4 rules applied. Total rules applied 542 place count 10 transition count 20
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 22 with 12 rules applied. Total rules applied 554 place count 8 transition count 10
Free-agglomeration rule applied 2 times.
Iterating global reduction 23 with 2 rules applied. Total rules applied 556 place count 8 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 558 place count 6 transition count 8
Applied a total of 558 rules in 78 ms. Remains 6 /283 variables (removed 277) and now considering 8/334 (removed 326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 6/283 places, 8/334 transitions.
// Phase 1: matrix 8 rows 6 cols
[2026-05-23 17:21:30] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 534 ms. (1869 steps per ms)
FORMULA CO4-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 255 ms. (3906 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:31] [INFO ] Flatten gal took : 112 ms
[2026-05-23 17:21:31] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:21:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3795887941482848548.gal : 3 ms
[2026-05-23 17:21:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4867367199283372496.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3795887941482848548.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4867367199283372496.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 9130 ms.

BK_STOP 1779556891670

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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-06"
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-06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r079-tall-177946972200041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-06.tgz
mv CO4-PT-06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;