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.r047-tall-177946846500064.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 BusinessProcesses-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tall-177946846500064
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.0K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 5 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Mar 5 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 5 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:45 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 91K 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 BusinessProcesses-PT-08-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779484894864

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-22 21:21:36] [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-22 21:21:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:21:36] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2026-05-22 21:21:36] [INFO ] Transformed 393 places.
[2026-05-22 21:21:36] [INFO ] Transformed 344 transitions.
[2026-05-22 21:21:36] [INFO ] Found NUPN structural information;
[2026-05-22 21:21:36] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-UpperBounds-03 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 331 rows 380 cols
[2026-05-22 21:21:36] [INFO ] Computed 58 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (82 resets) in 48 ms. (204 steps per ms)
FORMULA BusinessProcesses-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (46 resets) in 40 ms. (731 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-22 21:21:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:21:36] [INFO ] [Real]Absence check using 44 positive place invariants in 33 ms returned sat
[2026-05-22 21:21:36] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-22 21:21:37] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:37] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 15 ms to minimize.
[2026-05-22 21:21:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:21:37] [INFO ] [Nat]Absence check using 44 positive place invariants in 18 ms returned sat
[2026-05-22 21:21:37] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-22 21:21:37] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:37] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:37] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:37] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:38] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:38] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:38] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:38] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:38] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:38] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:38] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:38] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:39] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:39] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:39] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:39] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:39] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 13 ms to minimize.
[2026-05-22 21:21:39] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1937 ms
[2026-05-22 21:21:39] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 15 ms.
[2026-05-22 21:21:40] [INFO ] Added : 211 causal constraints over 43 iterations in 1319 ms. Result :sat
Minimization took 167 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:21:41] [INFO ] [Real]Absence check using 44 positive place invariants in 15 ms returned sat
[2026-05-22 21:21:41] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 8 ms returned sat
[2026-05-22 21:21:41] [INFO ] [Real]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-22 21:21:41] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 5 ms to minimize.
[2026-05-22 21:21:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:21:41] [INFO ] [Nat]Absence check using 44 positive place invariants in 16 ms returned sat
[2026-05-22 21:21:41] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2026-05-22 21:21:41] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:41] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:41] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:41] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:41] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:41] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:41] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:42] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 13 ms to minimize.
[2026-05-22 21:21:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 637 ms
[2026-05-22 21:21:42] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 17 ms.
[2026-05-22 21:21:43] [INFO ] Added : 185 causal constraints over 37 iterations in 960 ms. Result :sat
Minimization took 161 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:21:43] [INFO ] [Real]Absence check using 44 positive place invariants in 19 ms returned sat
[2026-05-22 21:21:43] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 21 ms returned sat
[2026-05-22 21:21:43] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:43] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 8 ms to minimize.
[2026-05-22 21: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-22 21:21:43] [INFO ] [Nat]Absence check using 44 positive place invariants in 25 ms returned sat
[2026-05-22 21:21:43] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-22 21:21:43] [INFO ] [Nat]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-22 21:21:43] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:44] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:44] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:44] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:44] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:44] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:44] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:44] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:44] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:45] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:45] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 15 ms to minimize.
[2026-05-22 21:21:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1335 ms
[2026-05-22 21:21:45] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:46] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 14 ms to minimize.
[2026-05-22 21:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2026-05-22 21:21:46] [INFO ] Added : 190 causal constraints over 40 iterations in 1127 ms. Result :sat
Minimization took 153 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA BusinessProcesses-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 380 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p335) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 330/330 transitions.
Graph (trivial) has 242 edges and 380 vertex of which 8 / 380 are part of one of the 1 SCC in 2 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 723 edges and 373 vertex of which 364 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 363 transition count 220
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 198 place count 266 transition count 220
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 198 place count 266 transition count 173
Deduced a syphon composed of 47 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 105 rules applied. Total rules applied 303 place count 208 transition count 173
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 369 place count 142 transition count 107
Iterating global reduction 2 with 66 rules applied. Total rules applied 435 place count 142 transition count 107
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 435 place count 142 transition count 100
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 451 place count 133 transition count 100
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 559 place count 79 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 560 place count 78 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 561 place count 77 transition count 45
Applied a total of 561 rules in 73 ms. Remains 77 /380 variables (removed 303) and now considering 45/330 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 77/380 places, 45/330 transitions.
// Phase 1: matrix 45 rows 77 cols
[2026-05-22 21:21:46] [INFO ] Computed 37 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA BusinessProcesses-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (52917 resets) in 1537 ms. (650 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 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-22 21:21:48] [INFO ] Flatten gal took : 31 ms
[2026-05-22 21:21:48] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:21:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12079741248322123451.gal : 7 ms
[2026-05-22 21:21:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2193694803097113080.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/ReachabilityCardinality12079741248322123451.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2193694803097113080.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 12401 ms.

BK_STOP 1779484908612

--------------------
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="BusinessProcesses-PT-08"
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 BusinessProcesses-PT-08, 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 r047-tall-177946846500064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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