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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 152K 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-09-UpperBounds-00
FORMULA_NAME CO4-PT-09-UpperBounds-01
FORMULA_NAME CO4-PT-09-UpperBounds-02
FORMULA_NAME CO4-PT-09-UpperBounds-03
FORMULA_NAME CO4-PT-09-UpperBounds-04
FORMULA_NAME CO4-PT-09-UpperBounds-05
FORMULA_NAME CO4-PT-09-UpperBounds-06
FORMULA_NAME CO4-PT-09-UpperBounds-07
FORMULA_NAME CO4-PT-09-UpperBounds-08
FORMULA_NAME CO4-PT-09-UpperBounds-09
FORMULA_NAME CO4-PT-09-UpperBounds-10
FORMULA_NAME CO4-PT-09-UpperBounds-11
FORMULA_NAME CO4-PT-09-UpperBounds-12
FORMULA_NAME CO4-PT-09-UpperBounds-13
FORMULA_NAME CO4-PT-09-UpperBounds-14
FORMULA_NAME CO4-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748601971987

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:46:13] [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:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:46:13] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2025-05-30 10:46:13] [INFO ] Transformed 467 places.
[2025-05-30 10:46:13] [INFO ] Transformed 634 transitions.
[2025-05-30 10:46:13] [INFO ] Found NUPN structural information;
[2025-05-30 10:46:13] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 108 places in 7 ms
Reduce places removed 108 places and 163 transitions.
FORMULA CO4-PT-09-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-UpperBounds-12 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 471 rows 359 cols
[2025-05-30 10:46:13] [INFO ] Computed 9 invariants in 32 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 (94 resets) in 28 ms. (344 steps per ms)
FORMULA CO4-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50002 steps (225 resets) in 57 ms. (862 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-30 10:46:13] [INFO ] Invariant cache hit.
[2025-05-30 10:46:14] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2025-05-30 10:46:14] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:14] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2025-05-30 10:46:14] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 106 ms.
[2025-05-30 10:46:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-05-30 10:46:14] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:15] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2025-05-30 10:46:15] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 59 ms.
[2025-05-30 10:46:15] [INFO ] Added : 30 causal constraints over 6 iterations in 213 ms. Result :sat
Minimization took 179 ms.
[2025-05-30 10:46:15] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:15] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:15] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2025-05-30 10:46:15] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 31 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 8 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:16] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2025-05-30 10:46:16] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 32 ms.
[2025-05-30 10:46:16] [INFO ] Added : 33 causal constraints over 7 iterations in 272 ms. Result :sat
Minimization took 181 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 106 ms returned sat
[2025-05-30 10:46:16] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 24 ms to minimize.
[2025-05-30 10:46:16] [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 9 ms returned sat
[2025-05-30 10:46:17] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:17] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2025-05-30 10:46:17] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 5 ms to minimize.
[2025-05-30 10:46:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2025-05-30 10:46:17] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 41 ms.
[2025-05-30 10:46:17] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 2 ms to minimize.
[2025-05-30 10:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2025-05-30 10:46:18] [INFO ] Added : 60 causal constraints over 13 iterations in 605 ms. Result :sat
Minimization took 191 ms.
[2025-05-30 10:46:18] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:18] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:18] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2025-05-30 10:46:18] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 4 ms to minimize.
[2025-05-30 10:46:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:18] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:18] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2025-05-30 10:46:18] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2025-05-30 10:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2025-05-30 10:46:18] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 26 ms.
[2025-05-30 10:46:19] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 3 ms to minimize.
[2025-05-30 10:46:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2025-05-30 10:46:19] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2025-05-30 10:46:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2025-05-30 10:46:19] [INFO ] Added : 74 causal constraints over 17 iterations in 811 ms. Result :sat
Minimization took 199 ms.
[2025-05-30 10:46:20] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-30 10:46:20] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:46:20] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-05-30 10:46:20] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 49 ms.
[2025-05-30 10:46:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:20] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:20] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2025-05-30 10:46:20] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 32 ms.
[2025-05-30 10:46:20] [INFO ] Added : 28 causal constraints over 6 iterations in 240 ms. Result :sat
Minimization took 196 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA CO4-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 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, 471/471 transitions.
Graph (trivial) has 363 edges and 359 vertex of which 2 / 359 are part of one of the 1 SCC in 3 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 757 edges and 358 vertex of which 323 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 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 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 185 rules applied. Total rules applied 187 place count 323 transition count 267
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 367 place count 160 transition count 250
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 385 place count 152 transition count 240
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 391 place count 150 transition count 236
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 397 place count 148 transition count 232
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 402 place count 146 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 403 place count 145 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 403 place count 145 transition count 228
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 405 place count 144 transition count 228
Discarding 26 places :
Symmetric choice reduction at 7 with 26 rule applications. Total rules 431 place count 118 transition count 202
Iterating global reduction 7 with 26 rules applied. Total rules applied 457 place count 118 transition count 202
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 457 place count 118 transition count 196
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 469 place count 112 transition count 196
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 485 place count 96 transition count 155
Iterating global reduction 7 with 16 rules applied. Total rules applied 501 place count 96 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 503 place count 96 transition count 153
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 504 place count 95 transition count 152
Iterating global reduction 8 with 1 rules applied. Total rules applied 505 place count 95 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 506 place count 95 transition count 151
Performed 34 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 9 with 68 rules applied. Total rules applied 574 place count 61 transition count 113
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 575 place count 61 transition count 112
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 16 places in 7 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 607 place count 45 transition count 129
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 10 with 24 rules applied. Total rules applied 631 place count 45 transition count 105
Discarding 11 places :
Symmetric choice reduction at 11 with 11 rule applications. Total rules 642 place count 34 transition count 72
Iterating global reduction 11 with 11 rules applied. Total rules applied 653 place count 34 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 661 place count 34 transition count 64
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 664 place count 31 transition count 49
Iterating global reduction 12 with 3 rules applied. Total rules applied 667 place count 31 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 669 place count 31 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 671 place count 30 transition count 54
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 674 place count 30 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 14 with 5 rules applied. Total rules applied 679 place count 30 transition count 46
Free-agglomeration rule applied 8 times.
Iterating global reduction 14 with 8 rules applied. Total rules applied 687 place count 30 transition count 38
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 696 place count 22 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 697 place count 21 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 699 place count 19 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 700 place count 19 transition count 35
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 701 place count 18 transition count 32
Iterating global reduction 16 with 1 rules applied. Total rules applied 702 place count 18 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 703 place count 18 transition count 31
Free-agglomeration rule applied 2 times.
Iterating global reduction 17 with 2 rules applied. Total rules applied 705 place count 18 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 707 place count 16 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 18 with 4 rules applied. Total rules applied 711 place count 16 transition count 25
Applied a total of 711 rules in 104 ms. Remains 16 /359 variables (removed 343) and now considering 25/471 (removed 446) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 16/359 places, 25/471 transitions.
[2025-05-30 10:46:21] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 16 cols
[2025-05-30 10:46:21] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA CO4-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 715 ms. (1396 steps per ms)
FORMULA CO4-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 268 ms. (3717 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:22] [INFO ] Flatten gal took : 21 ms
[2025-05-30 10:46:22] [INFO ] Flatten gal took : 6 ms
[2025-05-30 10:46:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16452286577942454781.gal : 4 ms
[2025-05-30 10:46:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9559980828325459290.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/ReachabilityCardinality16452286577942454781.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9559980828325459290.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 9223 ms.

BK_STOP 1748601982503

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

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