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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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 27K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 97K 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-06-UpperBounds-00
FORMULA_NAME CO4-PT-06-UpperBounds-01
FORMULA_NAME CO4-PT-06-UpperBounds-02
FORMULA_NAME CO4-PT-06-UpperBounds-03
FORMULA_NAME CO4-PT-06-UpperBounds-04
FORMULA_NAME CO4-PT-06-UpperBounds-05
FORMULA_NAME CO4-PT-06-UpperBounds-06
FORMULA_NAME CO4-PT-06-UpperBounds-07
FORMULA_NAME CO4-PT-06-UpperBounds-08
FORMULA_NAME CO4-PT-06-UpperBounds-09
FORMULA_NAME CO4-PT-06-UpperBounds-10
FORMULA_NAME CO4-PT-06-UpperBounds-11
FORMULA_NAME CO4-PT-06-UpperBounds-12
FORMULA_NAME CO4-PT-06-UpperBounds-13
FORMULA_NAME CO4-PT-06-UpperBounds-14
FORMULA_NAME CO4-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748601963189

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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:46:04] [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:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:46:04] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2025-05-30 10:46:04] [INFO ] Transformed 383 places.
[2025-05-30 10:46:04] [INFO ] Transformed 454 transitions.
[2025-05-30 10:46:04] [INFO ] Found NUPN structural information;
[2025-05-30 10:46:04] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-UpperBounds-10 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 334 rows 283 cols
[2025-05-30 10:46:04] [INFO ] Computed 6 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (16 resets) in 23 ms. (416 steps per ms)
FORMULA CO4-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100000 steps (134 resets) in 125 ms. (793 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 10:46:04] [INFO ] Invariant cache hit.
[2025-05-30 10:46:05] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:05] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-05-30 10:46:05] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 29 ms.
[2025-05-30 10:46:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:05] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-05-30 10:46:05] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 27 ms.
[2025-05-30 10:46:05] [INFO ] Added : 48 causal constraints over 10 iterations in 297 ms. Result :sat
Minimization took 81 ms.
[2025-05-30 10:46:05] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:06] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2025-05-30 10:46:06] [INFO ] Deduced a trap composed of 197 places in 120 ms of which 20 ms to minimize.
[2025-05-30 10:46:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:06] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-05-30 10:46:06] [INFO ] Deduced a trap composed of 197 places in 90 ms of which 2 ms to minimize.
[2025-05-30 10:46:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2025-05-30 10:46:06] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 24 ms.
[2025-05-30 10:46:06] [INFO ] Deduced a trap composed of 195 places in 94 ms of which 2 ms to minimize.
[2025-05-30 10:46:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2025-05-30 10:46:06] [INFO ] Added : 56 causal constraints over 12 iterations in 402 ms. Result :sat
Minimization took 76 ms.
[2025-05-30 10:46:07] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-30 10:46:07] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2025-05-30 10:46:07] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 24 ms.
[2025-05-30 10:46:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-30 10:46:07] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-05-30 10:46:07] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 21 ms.
[2025-05-30 10:46:07] [INFO ] Added : 43 causal constraints over 9 iterations in 201 ms. Result :sat
Minimization took 72 ms.
[2025-05-30 10:46:07] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:07] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2025-05-30 10:46:07] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 17 ms.
[2025-05-30 10:46:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:08] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2025-05-30 10:46:08] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 16 ms.
[2025-05-30 10:46:08] [INFO ] Added : 48 causal constraints over 10 iterations in 210 ms. Result :sat
Minimization took 78 ms.
[2025-05-30 10:46:08] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:08] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-05-30 10:46:08] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 23 ms.
[2025-05-30 10:46:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:08] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2025-05-30 10:46:08] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 22 ms.
[2025-05-30 10:46:09] [INFO ] Added : 57 causal constraints over 12 iterations in 255 ms. Result :sat
Minimization took 75 ms.
[2025-05-30 10:46:09] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-30 10:46:09] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-05-30 10:46:09] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 19 ms.
[2025-05-30 10:46:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-30 10:46:09] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-05-30 10:46:09] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 56 ms.
[2025-05-30 10:46:09] [INFO ] Added : 55 causal constraints over 11 iterations in 296 ms. Result :sat
Minimization took 75 ms.
[2025-05-30 10:46:09] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-30 10:46:10] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-05-30 10:46:10] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 41 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 6 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:10] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-05-30 10:46:10] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 18 ms.
[2025-05-30 10:46:10] [INFO ] Added : 51 causal constraints over 11 iterations in 228 ms. Result :sat
Minimization took 111 ms.
[2025-05-30 10:46:10] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:10] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-05-30 10:46:10] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 20 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 6 positive place invariants in 5 ms returned sat
[2025-05-30 10:46:11] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-05-30 10:46:11] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 25 ms.
[2025-05-30 10:46:11] [INFO ] Added : 46 causal constraints over 10 iterations in 203 ms. Result :sat
Minimization took 79 ms.
[2025-05-30 10:46:11] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-30 10:46:11] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-05-30 10:46:11] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 20 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 6 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:11] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-05-30 10:46:11] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 16 ms.
[2025-05-30 10:46:11] [INFO ] Added : 49 causal constraints over 10 iterations in 196 ms. Result :sat
Minimization took 80 ms.
[2025-05-30 10:46:12] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-30 10:46:12] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-05-30 10:46:12] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 16 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 6 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:12] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-05-30 10:46:12] [INFO ] Computed and/alt/rep : 291/376/291 causal constraints (skipped 42 transitions) in 18 ms.
[2025-05-30 10:46:12] [INFO ] Added : 54 causal constraints over 11 iterations in 212 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 334/334 transitions.
Graph (trivial) has 281 edges and 283 vertex of which 2 / 283 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 426 edges and 282 vertex of which 252 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 141 rules applied. Total rules applied 143 place count 252 transition count 174
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 132 rules applied. Total rules applied 275 place count 127 transition count 167
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 282 place count 124 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 283 place count 123 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 283 place count 123 transition count 161
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 287 place count 121 transition count 161
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 304 place count 104 transition count 144
Iterating global reduction 4 with 17 rules applied. Total rules applied 321 place count 104 transition count 144
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 321 place count 104 transition count 139
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 331 place count 99 transition count 139
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 340 place count 90 transition count 130
Iterating global reduction 4 with 9 rules applied. Total rules applied 349 place count 90 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 350 place count 90 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 351 place count 89 transition count 128
Iterating global reduction 5 with 1 rules applied. Total rules applied 352 place count 89 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 353 place count 89 transition count 127
Performed 35 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 423 place count 54 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 424 place count 54 transition count 85
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 448 place count 42 transition count 86
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 456 place count 42 transition count 78
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 465 place count 33 transition count 60
Iterating global reduction 8 with 9 rules applied. Total rules applied 474 place count 33 transition count 60
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 480 place count 33 transition count 54
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 482 place count 31 transition count 48
Iterating global reduction 9 with 2 rules applied. Total rules applied 484 place count 31 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 485 place count 31 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 487 place count 30 transition count 58
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 490 place count 30 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 501 place count 30 transition count 44
Free-agglomeration rule applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 506 place count 30 transition count 39
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 69 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 7 rules applied. Total rules applied 513 place count 24 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 514 place count 24 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 515 place count 24 transition count 37
Graph (complete) has 66 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 516 place count 23 transition count 37
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 517 place count 23 transition count 36
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 518 place count 23 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 519 place count 22 transition count 35
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t86.t400.t14.t15 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 521 place count 19 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 16 with 5 rules applied. Total rules applied 526 place count 19 transition count 28
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 528 place count 17 transition count 26
Iterating global reduction 16 with 2 rules applied. Total rules applied 530 place count 17 transition count 26
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 532 place count 17 transition count 24
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 533 place count 16 transition count 23
Iterating global reduction 17 with 1 rules applied. Total rules applied 534 place count 16 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 535 place count 16 transition count 22
Free-agglomeration rule applied 3 times.
Iterating global reduction 18 with 3 rules applied. Total rules applied 538 place count 16 transition count 19
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 541 place count 13 transition count 19
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 542 place count 13 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 543 place count 13 transition count 18
Applied a total of 543 rules in 86 ms. Remains 13 /283 variables (removed 270) and now considering 18/334 (removed 316) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 13/283 places, 18/334 transitions.
// Phase 1: matrix 18 rows 13 cols
[2025-05-30 10:46:12] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA CO4-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 408 ms. (2444 steps per ms)
FORMULA CO4-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 205 ms. (4854 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:13] [INFO ] Flatten gal took : 17 ms
[2025-05-30 10:46:13] [INFO ] Flatten gal took : 3 ms
[2025-05-30 10:46:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1649749807547586471.gal : 3 ms
[2025-05-30 10:46:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7223811874601586348.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/ReachabilityCardinality1649749807547586471.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7223811874601586348.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 9358 ms.

BK_STOP 1748601973770

--------------------
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-06"
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-06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r055-tall-174854041300053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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