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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 177K 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-12-UpperBounds-00
FORMULA_NAME CO4-PT-12-UpperBounds-01
FORMULA_NAME CO4-PT-12-UpperBounds-02
FORMULA_NAME CO4-PT-12-UpperBounds-03
FORMULA_NAME CO4-PT-12-UpperBounds-04
FORMULA_NAME CO4-PT-12-UpperBounds-05
FORMULA_NAME CO4-PT-12-UpperBounds-06
FORMULA_NAME CO4-PT-12-UpperBounds-07
FORMULA_NAME CO4-PT-12-UpperBounds-08
FORMULA_NAME CO4-PT-12-UpperBounds-09
FORMULA_NAME CO4-PT-12-UpperBounds-10
FORMULA_NAME CO4-PT-12-UpperBounds-11
FORMULA_NAME CO4-PT-12-UpperBounds-12
FORMULA_NAME CO4-PT-12-UpperBounds-13
FORMULA_NAME CO4-PT-12-UpperBounds-14
FORMULA_NAME CO4-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748601984217

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:46:25] [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:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:46:25] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2025-05-30 10:46:25] [INFO ] Transformed 649 places.
[2025-05-30 10:46:25] [INFO ] Transformed 782 transitions.
[2025-05-30 10:46:25] [INFO ] Found NUPN structural information;
[2025-05-30 10:46:25] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 172 places in 15 ms
Reduce places removed 172 places and 219 transitions.
FORMULA CO4-PT-12-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 563 rows 477 cols
[2025-05-30 10:46:25] [INFO ] Computed 9 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 10000 steps (103 resets) in 46 ms. (212 steps per ms)
FORMULA CO4-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90001 steps (452 resets) in 90 ms. (989 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]
[2025-05-30 10:46:25] [INFO ] Invariant cache hit.
[2025-05-30 10:46:26] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-05-30 10:46:26] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 10:46:26] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2025-05-30 10:46:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-30 10:46:26] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 10:46:26] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2025-05-30 10:46:26] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 43 ms.
[2025-05-30 10:46:27] [INFO ] Added : 100 causal constraints over 20 iterations in 752 ms. Result :sat
Minimization took 170 ms.
[2025-05-30 10:46:27] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-30 10:46:27] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:27] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2025-05-30 10:46:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-05-30 10:46:28] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:28] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2025-05-30 10:46:28] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 30 ms.
[2025-05-30 10:46:28] [INFO ] Added : 97 causal constraints over 20 iterations in 693 ms. Result :sat
Minimization took 165 ms.
[2025-05-30 10:46:29] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-30 10:46:29] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 10:46:29] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2025-05-30 10:46:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-05-30 10:46:29] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:29] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2025-05-30 10:46:29] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 29 ms.
[2025-05-30 10:46:30] [INFO ] Added : 113 causal constraints over 23 iterations in 755 ms. Result :sat
Minimization took 176 ms.
[2025-05-30 10:46:30] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-30 10:46:30] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:30] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2025-05-30 10:46:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-30 10:46:30] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:31] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2025-05-30 10:46:31] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 31 ms.
[2025-05-30 10:46:31] [INFO ] Added : 71 causal constraints over 15 iterations in 501 ms. Result :sat
Minimization took 159 ms.
[2025-05-30 10:46:31] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:31] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 10:46:31] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-05-30 10:46:32] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 15 ms to minimize.
[2025-05-30 10:46:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-30 10:46:32] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:32] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2025-05-30 10:46:32] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 2 ms to minimize.
[2025-05-30 10:46:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2025-05-30 10:46:32] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 36 ms.
[2025-05-30 10:46:33] [INFO ] Added : 127 causal constraints over 26 iterations in 875 ms. Result :sat
Minimization took 176 ms.
[2025-05-30 10:46:33] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-30 10:46:33] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 10:46:33] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2025-05-30 10:46:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-05-30 10:46:33] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:33] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2025-05-30 10:46:34] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 34 ms.
[2025-05-30 10:46:34] [INFO ] Added : 97 causal constraints over 20 iterations in 672 ms. Result :sat
Minimization took 176 ms.
[2025-05-30 10:46:34] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-30 10:46:34] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 10:46:35] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2025-05-30 10:46:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-30 10:46:35] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:35] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2025-05-30 10:46:35] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 30 ms.
[2025-05-30 10:46:35] [INFO ] Added : 84 causal constraints over 17 iterations in 580 ms. Result :sat
Minimization took 171 ms.
[2025-05-30 10:46:36] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:36] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:36] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2025-05-30 10:46:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-30 10:46:36] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:36] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-05-30 10:46:36] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 40 ms.
[2025-05-30 10:46:37] [INFO ] Added : 102 causal constraints over 21 iterations in 723 ms. Result :sat
Minimization took 180 ms.
[2025-05-30 10:46:37] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:37] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 4 ms returned sat
[2025-05-30 10:46:37] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2025-05-30 10:46:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-30 10:46:37] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-30 10:46:37] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-05-30 10:46:38] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 29 ms.
[2025-05-30 10:46:38] [INFO ] Added : 103 causal constraints over 21 iterations in 680 ms. Result :sat
Minimization took 153 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-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 563/563 transitions.
Graph (trivial) has 470 edges and 477 vertex of which 3 / 477 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 770 edges and 475 vertex of which 436 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.2 ms
Discarding 39 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 287 rules applied. Total rules applied 289 place count 436 transition count 255
Reduce places removed 263 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 281 rules applied. Total rules applied 570 place count 173 transition count 237
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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 20 rules applied. Total rules applied 590 place count 165 transition count 225
Reduce places removed 4 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 8 rules applied. Total rules applied 598 place count 161 transition count 221
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 604 place count 159 transition count 217
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 5 with 8 rules applied. Total rules applied 612 place count 157 transition count 211
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 616 place count 153 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 616 place count 153 transition count 210
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 618 place count 152 transition count 210
Discarding 26 places :
Symmetric choice reduction at 7 with 26 rule applications. Total rules 644 place count 126 transition count 184
Iterating global reduction 7 with 26 rules applied. Total rules applied 670 place count 126 transition count 184
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 670 place count 126 transition count 177
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 684 place count 119 transition count 177
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 699 place count 104 transition count 144
Iterating global reduction 7 with 15 rules applied. Total rules applied 714 place count 104 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 716 place count 104 transition count 142
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 718 place count 102 transition count 140
Iterating global reduction 8 with 2 rules applied. Total rules applied 720 place count 102 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 722 place count 102 transition count 138
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 9 with 66 rules applied. Total rules applied 788 place count 69 transition count 104
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 793 place count 69 transition count 99
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 796 place count 66 transition count 96
Iterating global reduction 10 with 3 rules applied. Total rules applied 799 place count 66 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 800 place count 66 transition count 95
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 11 with 4 rules applied. Total rules applied 804 place count 64 transition count 93
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 806 place count 64 transition count 91
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 808 place count 62 transition count 89
Iterating global reduction 12 with 2 rules applied. Total rules applied 810 place count 62 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 811 place count 62 transition count 88
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -2
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 835 place count 50 transition count 90
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 13 with 17 rules applied. Total rules applied 852 place count 50 transition count 73
Discarding 7 places :
Symmetric choice reduction at 14 with 7 rule applications. Total rules 859 place count 43 transition count 66
Iterating global reduction 14 with 7 rules applied. Total rules applied 866 place count 43 transition count 66
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 872 place count 43 transition count 60
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 873 place count 42 transition count 58
Iterating global reduction 15 with 1 rules applied. Total rules applied 874 place count 42 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 876 place count 41 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 879 place count 41 transition count 64
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 880 place count 40 transition count 63
Iterating global reduction 15 with 1 rules applied. Total rules applied 881 place count 40 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 883 place count 40 transition count 61
Free-agglomeration rule applied 7 times.
Iterating global reduction 16 with 7 rules applied. Total rules applied 890 place count 40 transition count 54
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 16 with 9 rules applied. Total rules applied 899 place count 33 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 900 place count 32 transition count 51
Reduce places removed 2 places and 0 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 17 with 3 rules applied. Total rules applied 903 place count 30 transition count 50
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 18 with 2 rules applied. Total rules applied 905 place count 29 transition count 49
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 907 place count 28 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 20 with 1 Pre rules applied. Total rules applied 907 place count 28 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 909 place count 27 transition count 47
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 20 with 6 rules applied. Total rules applied 915 place count 24 transition count 44
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 20 with 7 rules applied. Total rules applied 922 place count 24 transition count 37
Applied a total of 922 rules in 94 ms. Remains 24 /477 variables (removed 453) and now considering 37/563 (removed 526) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 24/477 places, 37/563 transitions.
// Phase 1: matrix 37 rows 24 cols
[2025-05-30 10:46:39] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (31442 resets) in 852 ms. (1172 steps per ms)
FORMULA CO4-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (8012 resets) in 311 ms. (3205 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:40] [INFO ] Flatten gal took : 25 ms
[2025-05-30 10:46:40] [INFO ] Flatten gal took : 8 ms
[2025-05-30 10:46:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16933558656042886899.gal : 5 ms
[2025-05-30 10:46:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8140266742369871112.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16933558656042886899.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8140266742369871112.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 15004 ms.

BK_STOP 1748602000545

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

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