Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r549-tall-171734897800109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is CO4-PT-14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734897800109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 174K Jun 2 16:33 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

here is the order used to build the result vector(from text file)
FORMULA_NAME CO4-PT-14-UpperBounds-00
FORMULA_NAME CO4-PT-14-UpperBounds-01
FORMULA_NAME CO4-PT-14-UpperBounds-02
FORMULA_NAME CO4-PT-14-UpperBounds-03
FORMULA_NAME CO4-PT-14-UpperBounds-04
FORMULA_NAME CO4-PT-14-UpperBounds-05
FORMULA_NAME CO4-PT-14-UpperBounds-06
FORMULA_NAME CO4-PT-14-UpperBounds-07
FORMULA_NAME CO4-PT-14-UpperBounds-08
FORMULA_NAME CO4-PT-14-UpperBounds-09
FORMULA_NAME CO4-PT-14-UpperBounds-10
FORMULA_NAME CO4-PT-14-UpperBounds-11
FORMULA_NAME CO4-PT-14-UpperBounds-12
FORMULA_NAME CO4-PT-14-UpperBounds-13
FORMULA_NAME CO4-PT-14-UpperBounds-14
FORMULA_NAME CO4-PT-14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717356664107

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 19:31:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 19:31:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:31:05] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-02 19:31:05] [INFO ] Transformed 680 places.
[2024-06-02 19:31:05] [INFO ] Transformed 812 transitions.
[2024-06-02 19:31:05] [INFO ] Found NUPN structural information;
[2024-06-02 19:31:05] [INFO ] Parsed PT model containing 680 places and 812 transitions and 1822 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 100 places in 13 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-14-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 692 rows 580 cols
[2024-06-02 19:31:05] [INFO ] Computed 8 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (39 resets) in 31 ms. (312 steps per ms)
FORMULA CO4-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-14-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-14-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90000 steps (340 resets) in 105 ms. (849 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]
[2024-06-02 19:31:05] [INFO ] Invariant cache hit.
[2024-06-02 19:31:06] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-06-02 19:31:06] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2024-06-02 19:31:06] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 56 ms.
[2024-06-02 19:31:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-02 19:31:06] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2024-06-02 19:31:07] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 45 ms.
[2024-06-02 19:31:08] [INFO ] Added : 145 causal constraints over 29 iterations in 1206 ms. Result :sat
Minimization took 441 ms.
[2024-06-02 19:31:08] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 19:31:08] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-06-02 19:31:09] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 36 ms.
[2024-06-02 19:31:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 19:31:09] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-06-02 19:31:09] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 56 ms.
[2024-06-02 19:31:10] [INFO ] Added : 97 causal constraints over 20 iterations in 821 ms. Result :sat
Minimization took 447 ms.
[2024-06-02 19:31:10] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 19:31:10] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-06-02 19:31:11] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 42 ms.
[2024-06-02 19:31:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-02 19:31:11] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-06-02 19:31:11] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 35 ms.
[2024-06-02 19:31:12] [INFO ] Added : 97 causal constraints over 20 iterations in 785 ms. Result :sat
Minimization took 441 ms.
[2024-06-02 19:31:12] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 19:31:13] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-06-02 19:31:13] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 48 ms.
[2024-06-02 19:31:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-02 19:31:13] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-06-02 19:31:13] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 38 ms.
[2024-06-02 19:31:14] [INFO ] Added : 117 causal constraints over 24 iterations in 945 ms. Result :sat
Minimization took 501 ms.
[2024-06-02 19:31:15] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2024-06-02 19:31:15] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-06-02 19:31:15] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 35 ms.
[2024-06-02 19:31:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-02 19:31:15] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-06-02 19:31:15] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 36 ms.
[2024-06-02 19:31:16] [INFO ] Added : 139 causal constraints over 28 iterations in 1054 ms. Result :sat
Minimization took 484 ms.
[2024-06-02 19:31:17] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 19:31:17] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-06-02 19:31:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 19:31:17] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-06-02 19:31:17] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 34 ms.
[2024-06-02 19:31:18] [INFO ] Added : 79 causal constraints over 16 iterations in 615 ms. Result :sat
Minimization took 472 ms.
[2024-06-02 19:31:19] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-02 19:31:19] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2024-06-02 19:31:19] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 37 ms.
[2024-06-02 19:31:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2024-06-02 19:31:19] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-06-02 19:31:19] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 36 ms.
[2024-06-02 19:31:20] [INFO ] Added : 99 causal constraints over 20 iterations in 760 ms. Result :sat
Minimization took 476 ms.
[2024-06-02 19:31:21] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-02 19:31:21] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-06-02 19:31:21] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 36 ms.
[2024-06-02 19:31:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-02 19:31:21] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-06-02 19:31:21] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 35 ms.
[2024-06-02 19:31:22] [INFO ] Added : 108 causal constraints over 22 iterations in 856 ms. Result :sat
Minimization took 467 ms.
[2024-06-02 19:31:23] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 19:31:23] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-06-02 19:31:23] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 42 ms.
[2024-06-02 19:31:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:31:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 19:31:23] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-06-02 19:31:24] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 36 ms.
[2024-06-02 19:31:24] [INFO ] Added : 72 causal constraints over 15 iterations in 585 ms. Result :sat
Minimization took 472 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-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 692/692 transitions.
Graph (trivial) has 598 edges and 580 vertex of which 2 / 580 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 877 edges and 579 vertex of which 544 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 302 rules applied. Total rules applied 304 place count 544 transition count 369
Reduce places removed 282 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 293 rules applied. Total rules applied 597 place count 262 transition count 358
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 2 with 11 rules applied. Total rules applied 608 place count 257 transition count 352
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 3 rules applied. Total rules applied 611 place count 256 transition count 350
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 3 rules applied. Total rules applied 614 place count 255 transition count 348
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 616 place count 254 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 616 place count 254 transition count 346
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 618 place count 253 transition count 346
Discarding 36 places :
Symmetric choice reduction at 6 with 36 rule applications. Total rules 654 place count 217 transition count 310
Iterating global reduction 6 with 36 rules applied. Total rules applied 690 place count 217 transition count 310
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 690 place count 217 transition count 297
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 716 place count 204 transition count 297
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 739 place count 181 transition count 274
Iterating global reduction 6 with 23 rules applied. Total rules applied 762 place count 181 transition count 274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 6 with 5 rules applied. Total rules applied 767 place count 181 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 768 place count 180 transition count 269
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 770 place count 178 transition count 266
Iterating global reduction 8 with 2 rules applied. Total rules applied 772 place count 178 transition count 266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 774 place count 178 transition count 264
Performed 77 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 9 with 154 rules applied. Total rules applied 928 place count 101 transition count 177
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 935 place count 101 transition count 170
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 939 place count 97 transition count 166
Iterating global reduction 10 with 4 rules applied. Total rules applied 943 place count 97 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 944 place count 97 transition count 165
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 11 with 6 rules applied. Total rules applied 950 place count 94 transition count 162
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 953 place count 94 transition count 159
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 955 place count 92 transition count 157
Iterating global reduction 12 with 2 rules applied. Total rules applied 957 place count 92 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 958 place count 92 transition count 156
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 959 place count 91 transition count 155
Iterating global reduction 13 with 1 rules applied. Total rules applied 960 place count 91 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 961 place count 91 transition count 154
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 14 with 56 rules applied. Total rules applied 1017 place count 63 transition count 156
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 14 with 36 rules applied. Total rules applied 1053 place count 63 transition count 120
Discarding 23 places :
Symmetric choice reduction at 15 with 23 rule applications. Total rules 1076 place count 40 transition count 88
Iterating global reduction 15 with 23 rules applied. Total rules applied 1099 place count 40 transition count 88
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 15 with 20 rules applied. Total rules applied 1119 place count 40 transition count 68
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 1121 place count 38 transition count 63
Iterating global reduction 16 with 2 rules applied. Total rules applied 1123 place count 38 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 1125 place count 38 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1126 place count 38 transition count 60
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1127 place count 37 transition count 59
Iterating global reduction 17 with 1 rules applied. Total rules applied 1128 place count 37 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1129 place count 37 transition count 58
Free-agglomeration rule applied 5 times.
Iterating global reduction 18 with 5 rules applied. Total rules applied 1134 place count 37 transition count 53
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 1141 place count 32 transition count 51
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 1143 place count 32 transition count 51
Graph (complete) has 93 edges and 32 vertex of which 31 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 19 with 1 rules applied. Total rules applied 1144 place count 31 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 1145 place count 31 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 1146 place count 31 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 1148 place count 30 transition count 48
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 79 edges and 30 vertex of which 29 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 21 with 6 rules applied. Total rules applied 1154 place count 29 transition count 43
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 1155 place count 28 transition count 42
Iterating global reduction 22 with 1 rules applied. Total rules applied 1156 place count 28 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 1157 place count 28 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 1158 place count 28 transition count 40
Discarding 1 places :
Symmetric choice reduction at 23 with 1 rule applications. Total rules 1159 place count 27 transition count 39
Iterating global reduction 23 with 1 rules applied. Total rules applied 1160 place count 27 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 1161 place count 27 transition count 38
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 1162 place count 27 transition count 38
Graph (complete) has 68 edges and 27 vertex of which 26 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 24 with 1 rules applied. Total rules applied 1163 place count 26 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 1164 place count 26 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 1165 place count 26 transition count 37
Graph (complete) has 65 edges and 26 vertex of which 25 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 26 with 1 rules applied. Total rules applied 1166 place count 25 transition count 37
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 1167 place count 25 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 28 with 1 rules applied. Total rules applied 1168 place count 24 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 t87.t679 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 13 edges and 20 vertex of which 3 / 20 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 28 with 4 rules applied. Total rules applied 1172 place count 18 transition count 32
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 t15.t16.t661.t188.t185.t773.t198.t199 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
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 29 with 9 rules applied. Total rules applied 1181 place count 14 transition count 24
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 5 rules applied. Total rules applied 1186 place count 13 transition count 20
Free-agglomeration rule applied 4 times.
Iterating global reduction 31 with 4 rules applied. Total rules applied 1190 place count 13 transition count 16
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 31 with 5 rules applied. Total rules applied 1195 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 32 with 1 rules applied. Total rules applied 1196 place count 9 transition count 14
Free-agglomeration rule applied 1 times.
Iterating global reduction 32 with 1 rules applied. Total rules applied 1197 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 1199 place count 8 transition count 12
Applied a total of 1199 rules in 161 ms. Remains 8 /580 variables (removed 572) and now considering 12/692 (removed 680) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 8/580 places, 12/692 transitions.
// Phase 1: matrix 12 rows 8 cols
[2024-06-02 19:31:25] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA CO4-PT-14-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 427 ms. (2336 steps per ms)
FORMULA CO4-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 265 ms. (3759 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 20714 ms.
ITS solved all properties within timeout

BK_STOP 1717356686157

--------------------
content from stderr:

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-14"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is CO4-PT-14, 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 r549-tall-171734897800109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-14.tgz
mv CO4-PT-14 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;