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.r351-smll-178021502100029.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 ErlangenMainframeV2-PT-bP03C03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-smll-178021502100029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.5K May 27 09:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 27 09:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 27 09:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 27 09:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 27 10:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.8K May 27 09:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 27 09:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 27 09:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 27 09:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 105K May 26 18:17 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 ErlangenMainframeV2-PT-bP03C03-UpperBounds-00
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-UpperBounds-01
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-UpperBounds-02
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-UpperBounds-03
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-UpperBounds-04
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-UpperBounds-05
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-UpperBounds-06
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-UpperBounds-07
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-UpperBounds-08
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-UpperBounds-09
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-UpperBounds-10
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-UpperBounds-11
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-UpperBounds-12
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-UpperBounds-13
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-UpperBounds-14
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1780320738612

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP03C03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-01 13:32:21] [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-06-01 13:32:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 13:32:21] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2026-06-01 13:32:21] [INFO ] Transformed 219 places.
[2026-06-01 13:32:21] [INFO ] Transformed 331 transitions.
[2026-06-01 13:32:21] [INFO ] Found NUPN structural information;
[2026-06-01 13:32:21] [INFO ] Parsed PT model containing 219 places and 331 transitions and 1585 arcs in 472 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
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, 0] Max Struct:[1, 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 331 rows 219 cols
[2026-06-01 13:32:21] [INFO ] Computed 14 invariants in 35 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 130 ms. (76 steps per ms)
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 299 ms. (133 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-06-01 13:32:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:22] [INFO ] [Real]Absence check using 10 positive place invariants in 24 ms returned sat
[2026-06-01 13:32:22] [INFO ] [Real]Absence check using 10 positive and 4 generalized place invariants in 4 ms returned sat
[2026-06-01 13:32:23] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:23] [INFO ] Deduced a trap composed of 30 places in 392 ms of which 47 ms to minimize.
[2026-06-01 13:32:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2026-06-01 13:32:23] [INFO ] [Nat]Absence check using 10 positive and 4 generalized place invariants in 4 ms returned sat
[2026-06-01 13:32:24] [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-06-01 13:32:24] [INFO ] Deduced a trap composed of 30 places in 283 ms of which 30 ms to minimize.
[2026-06-01 13:32:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2026-06-01 13:32:24] [INFO ] Computed and/alt/rep : 238/652/238 causal constraints (skipped 92 transitions) in 74 ms.
[2026-06-01 13:32:26] [INFO ] Added : 190 causal constraints over 38 iterations in 2002 ms. Result :sat
Minimization took 382 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:27] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2026-06-01 13:32:27] [INFO ] [Real]Absence check using 10 positive and 4 generalized place invariants in 5 ms returned sat
[2026-06-01 13:32:27] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:27] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 22 ms to minimize.
[2026-06-01 13:32:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2026-06-01 13:32:27] [INFO ] [Nat]Absence check using 10 positive and 4 generalized place invariants in 3 ms returned sat
[2026-06-01 13:32:27] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:28] [INFO ] Deduced a trap composed of 23 places in 308 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:28] [INFO ] Deduced a trap composed of 30 places in 324 ms of which 38 ms to minimize.
[2026-06-01 13:32:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 712 ms
[2026-06-01 13:32:28] [INFO ] Computed and/alt/rep : 238/652/238 causal constraints (skipped 92 transitions) in 66 ms.
[2026-06-01 13:32:30] [INFO ] Added : 189 causal constraints over 38 iterations in 1907 ms. Result :sat
Minimization took 352 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:31] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2026-06-01 13:32:31] [INFO ] [Real]Absence check using 10 positive and 4 generalized place invariants in 3 ms returned sat
[2026-06-01 13:32:31] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:31] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 30 ms to minimize.
[2026-06-01 13:32:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2026-06-01 13:32:31] [INFO ] [Nat]Absence check using 10 positive and 4 generalized place invariants in 3 ms returned sat
[2026-06-01 13:32:31] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:32] [INFO ] Deduced a trap composed of 20 places in 314 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:32] [INFO ] Deduced a trap composed of 30 places in 317 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:32] [INFO ] Deduced a trap composed of 35 places in 296 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:33] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 18 ms to minimize.
[2026-06-01 13:32:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1238 ms
[2026-06-01 13:32:33] [INFO ] Computed and/alt/rep : 238/652/238 causal constraints (skipped 92 transitions) in 62 ms.
[2026-06-01 13:32:35] [INFO ] Added : 190 causal constraints over 38 iterations in 1962 ms. Result :sat
Minimization took 422 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:35] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2026-06-01 13:32:35] [INFO ] [Real]Absence check using 10 positive and 4 generalized place invariants in 4 ms returned sat
[2026-06-01 13:32:35] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2026-06-01 13:32:36] [INFO ] Computed and/alt/rep : 238/652/238 causal constraints (skipped 92 transitions) in 52 ms.
[2026-06-01 13:32:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2026-06-01 13:32:36] [INFO ] [Nat]Absence check using 10 positive and 4 generalized place invariants in 3 ms returned sat
[2026-06-01 13:32:36] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2026-06-01 13:32:36] [INFO ] Computed and/alt/rep : 238/652/238 causal constraints (skipped 92 transitions) in 46 ms.
[2026-06-01 13:32:38] [INFO ] Added : 219 causal constraints over 44 iterations in 2112 ms. Result :sat
Minimization took 247 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
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 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 331/331 transitions.
Graph (trivial) has 196 edges and 219 vertex of which 12 / 219 are part of one of the 5 SCC in 5 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 212 transition count 229
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 101 rules applied. Total rules applied 191 place count 123 transition count 217
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 194 place count 120 transition count 217
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 194 place count 120 transition count 213
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 203 place count 115 transition count 213
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 226 place count 92 transition count 190
Iterating global reduction 3 with 23 rules applied. Total rules applied 249 place count 92 transition count 190
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 249 place count 92 transition count 185
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 259 place count 87 transition count 185
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 267 place count 79 transition count 144
Iterating global reduction 3 with 8 rules applied. Total rules applied 275 place count 79 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 277 place count 77 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 279 place count 77 transition count 114
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 329 place count 52 transition count 89
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 341 place count 46 transition count 105
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 351 place count 46 transition count 95
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 353 place count 44 transition count 90
Iterating global reduction 4 with 2 rules applied. Total rules applied 355 place count 44 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 359 place count 44 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 361 place count 43 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 371 place count 43 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 373 place count 42 transition count 84
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 379 place count 42 transition count 78
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 392 place count 36 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 394 place count 36 transition count 69
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 395 place count 36 transition count 75
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 398 place count 35 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 404 place count 35 transition count 67
Applied a total of 404 rules in 226 ms. Remains 35 /219 variables (removed 184) and now considering 67/331 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 35/219 places, 67/331 transitions.
[2026-06-01 13:32:39] [INFO ] Flow matrix only has 65 transitions (discarded 2 similar events)
// Phase 1: matrix 65 rows 35 cols
[2026-06-01 13:32:39] [INFO ] Computed 13 invariants in 3 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 2782 ms. (359 steps per ms)
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP03C03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 725 ms. (1377 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-06-01 13:32:43] [INFO ] Flatten gal took : 61 ms
[2026-06-01 13:32:43] [INFO ] Flatten gal took : 21 ms
[2026-06-01 13:32:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11937732947281544097.gal : 14 ms
[2026-06-01 13:32:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7296088436390831469.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/ReachabilityCardinality11937732947281544097.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7296088436390831469.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 22619 ms.

BK_STOP 1780320763781

--------------------
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="ErlangenMainframeV2-PT-bP03C03"
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 ErlangenMainframeV2-PT-bP03C03, 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 r351-smll-178021502100029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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