Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r055-tall-174854041300055.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is CO4-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r055-tall-174854041300055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 138K May 29 14:32 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-08-UpperBounds-00
FORMULA_NAME CO4-PT-08-UpperBounds-01
FORMULA_NAME CO4-PT-08-UpperBounds-02
FORMULA_NAME CO4-PT-08-UpperBounds-03
FORMULA_NAME CO4-PT-08-UpperBounds-04
FORMULA_NAME CO4-PT-08-UpperBounds-05
FORMULA_NAME CO4-PT-08-UpperBounds-06
FORMULA_NAME CO4-PT-08-UpperBounds-07
FORMULA_NAME CO4-PT-08-UpperBounds-08
FORMULA_NAME CO4-PT-08-UpperBounds-09
FORMULA_NAME CO4-PT-08-UpperBounds-10
FORMULA_NAME CO4-PT-08-UpperBounds-11
FORMULA_NAME CO4-PT-08-UpperBounds-12
FORMULA_NAME CO4-PT-08-UpperBounds-13
FORMULA_NAME CO4-PT-08-UpperBounds-14
FORMULA_NAME CO4-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748601968148

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:46:09] [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]
[2025-05-30 10:46:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:46:09] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2025-05-30 10:46:09] [INFO ] Transformed 467 places.
[2025-05-30 10:46:09] [INFO ] Transformed 600 transitions.
[2025-05-30 10:46:09] [INFO ] Found NUPN structural information;
[2025-05-30 10:46:09] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 108 places in 6 ms
Reduce places removed 108 places and 155 transitions.
FORMULA CO4-PT-08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 445 rows 359 cols
[2025-05-30 10:46:09] [INFO ] Computed 9 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (6 resets) in 25 ms. (384 steps per ms)
FORMULA CO4-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70001 steps (351 resets) in 76 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-30 10:46:09] [INFO ] Invariant cache hit.
[2025-05-30 10:46:10] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2025-05-30 10:46:10] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 6 ms returned sat
[2025-05-30 10:46:10] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2025-05-30 10:46:10] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 37 ms.
[2025-05-30 10:46:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-05-30 10:46:10] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:10] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2025-05-30 10:46:10] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 27 ms.
[2025-05-30 10:46:11] [INFO ] Added : 73 causal constraints over 15 iterations in 430 ms. Result :sat
Minimization took 227 ms.
[2025-05-30 10:46:11] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-05-30 10:46:11] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:11] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2025-05-30 10:46:11] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 28 ms.
[2025-05-30 10:46:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:11] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:11] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2025-05-30 10:46:11] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 30 ms.
[2025-05-30 10:46:12] [INFO ] Added : 53 causal constraints over 11 iterations in 337 ms. Result :sat
Minimization took 144 ms.
[2025-05-30 10:46:12] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:12] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:12] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-05-30 10:46:12] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 26 ms.
[2025-05-30 10:46:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:12] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:46:12] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2025-05-30 10:46:12] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 28 ms.
[2025-05-30 10:46:13] [INFO ] Added : 81 causal constraints over 17 iterations in 455 ms. Result :sat
Minimization took 149 ms.
[2025-05-30 10:46:13] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:13] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:13] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2025-05-30 10:46:13] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 25 ms.
[2025-05-30 10:46:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-05-30 10:46:13] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:13] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2025-05-30 10:46:13] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 24 ms.
[2025-05-30 10:46:14] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 24 ms to minimize.
[2025-05-30 10:46:14] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 3 ms to minimize.
[2025-05-30 10:46:14] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2025-05-30 10:46:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 383 ms
[2025-05-30 10:46:14] [INFO ] Added : 74 causal constraints over 15 iterations in 806 ms. Result :sat
Minimization took 166 ms.
[2025-05-30 10:46:15] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-05-30 10:46:15] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:15] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2025-05-30 10:46:15] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 39 ms.
[2025-05-30 10:46:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:15] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:15] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2025-05-30 10:46:15] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 24 ms.
[2025-05-30 10:46:15] [INFO ] Added : 62 causal constraints over 14 iterations in 402 ms. Result :sat
Minimization took 165 ms.
[2025-05-30 10:46:16] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:16] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:16] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-05-30 10:46:16] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 23 ms.
[2025-05-30 10:46:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-05-30 10:46:16] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:16] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2025-05-30 10:46:16] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 30 ms.
[2025-05-30 10:46:16] [INFO ] Added : 64 causal constraints over 13 iterations in 373 ms. Result :sat
Minimization took 159 ms.
[2025-05-30 10:46:17] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:17] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:17] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2025-05-30 10:46:17] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2025-05-30 10:46:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:17] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:17] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2025-05-30 10:46:17] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2025-05-30 10:46:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2025-05-30 10:46:17] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 26 ms.
[2025-05-30 10:46:18] [INFO ] Added : 80 causal constraints over 16 iterations in 445 ms. Result :sat
Minimization took 170 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 445/445 transitions.
Graph (trivial) has 360 edges and 359 vertex of which 2 / 359 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 653 edges and 358 vertex of which 323 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.3 ms
Discarding 35 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 184 rules applied. Total rules applied 186 place count 323 transition count 242
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 180 rules applied. Total rules applied 366 place count 161 transition count 224
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 18 rules applied. Total rules applied 384 place count 153 transition count 214
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 390 place count 151 transition count 210
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 396 place count 149 transition count 206
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 402 place count 147 transition count 202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 404 place count 145 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 404 place count 145 transition count 201
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 406 place count 144 transition count 201
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 434 place count 116 transition count 173
Iterating global reduction 7 with 28 rules applied. Total rules applied 462 place count 116 transition count 173
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 462 place count 116 transition count 166
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 476 place count 109 transition count 166
Graph (complete) has 263 edges and 109 vertex of which 107 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 477 place count 107 transition count 165
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 480 place count 107 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 481 place count 106 transition count 162
Discarding 17 places :
Symmetric choice reduction at 10 with 17 rule applications. Total rules 498 place count 89 transition count 127
Iterating global reduction 10 with 17 rules applied. Total rules applied 515 place count 89 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 517 place count 89 transition count 125
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 519 place count 87 transition count 123
Iterating global reduction 11 with 2 rules applied. Total rules applied 521 place count 87 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 523 place count 87 transition count 121
Performed 33 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 66 rules applied. Total rules applied 589 place count 54 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 596 place count 54 transition count 80
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 600 place count 50 transition count 76
Iterating global reduction 13 with 4 rules applied. Total rules applied 604 place count 50 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 605 place count 50 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 611 place count 47 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 614 place count 47 transition count 69
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 617 place count 44 transition count 66
Iterating global reduction 15 with 3 rules applied. Total rules applied 620 place count 44 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 622 place count 44 transition count 64
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 623 place count 43 transition count 63
Iterating global reduction 16 with 1 rules applied. Total rules applied 624 place count 43 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 625 place count 43 transition count 62
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 17 with 16 rules applied. Total rules applied 641 place count 35 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 17 with 14 rules applied. Total rules applied 655 place count 35 transition count 49
Discarding 6 places :
Symmetric choice reduction at 18 with 6 rule applications. Total rules 661 place count 29 transition count 43
Iterating global reduction 18 with 6 rules applied. Total rules applied 667 place count 29 transition count 43
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 673 place count 29 transition count 37
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 19 with 2 rules applied. Total rules applied 675 place count 28 transition count 41
Free-agglomeration rule applied 7 times.
Iterating global reduction 19 with 7 rules applied. Total rules applied 682 place count 28 transition count 34
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 9 rules applied. Total rules applied 691 place count 21 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 692 place count 20 transition count 31
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 20 with 3 rules applied. Total rules applied 695 place count 18 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 696 place count 17 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 22 with 4 rules applied. Total rules applied 700 place count 15 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 704 place count 15 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 706 place count 14 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 710 place count 14 transition count 20
Applied a total of 710 rules in 96 ms. Remains 14 /359 variables (removed 345) and now considering 20/445 (removed 425) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 14/359 places, 20/445 transitions.
// Phase 1: matrix 20 rows 14 cols
[2025-05-30 10:46:18] [INFO ] Computed 5 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 631 ms. (1582 steps per ms)
FORMULA CO4-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 258 ms. (3861 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 )
[2025-05-30 10:46:19] [INFO ] Flatten gal took : 21 ms
[2025-05-30 10:46:19] [INFO ] Flatten gal took : 5 ms
[2025-05-30 10:46:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14200928663312342062.gal : 4 ms
[2025-05-30 10:46:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5774778032436722606.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14200928663312342062.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5774778032436722606.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 10233 ms.

BK_STOP 1748601979688

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is CO4-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 r055-tall-174854041300055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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