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.r553-tall-171734900900093.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 ltsminxred
Input is CO4-PT-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734900900093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K 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 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 177K 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-12-UpperBounds-00
FORMULA_NAME CO4-PT-12-UpperBounds-01
FORMULA_NAME CO4-PT-12-UpperBounds-02
FORMULA_NAME CO4-PT-12-UpperBounds-03
FORMULA_NAME CO4-PT-12-UpperBounds-04
FORMULA_NAME CO4-PT-12-UpperBounds-05
FORMULA_NAME CO4-PT-12-UpperBounds-06
FORMULA_NAME CO4-PT-12-UpperBounds-07
FORMULA_NAME CO4-PT-12-UpperBounds-08
FORMULA_NAME CO4-PT-12-UpperBounds-09
FORMULA_NAME CO4-PT-12-UpperBounds-10
FORMULA_NAME CO4-PT-12-UpperBounds-11
FORMULA_NAME CO4-PT-12-UpperBounds-12
FORMULA_NAME CO4-PT-12-UpperBounds-13
FORMULA_NAME CO4-PT-12-UpperBounds-14
FORMULA_NAME CO4-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717351661128

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:07:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:07:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:07:42] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-06-02 18:07:42] [INFO ] Transformed 649 places.
[2024-06-02 18:07:42] [INFO ] Transformed 782 transitions.
[2024-06-02 18:07:42] [INFO ] Found NUPN structural information;
[2024-06-02 18:07:42] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 172 places in 16 ms
Reduce places removed 172 places and 219 transitions.
FORMULA CO4-PT-12-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-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 563 rows 477 cols
[2024-06-02 18:07:42] [INFO ] Computed 9 invariants in 30 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 (33 resets) in 29 ms. (333 steps per ms)
FORMULA CO4-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90004 steps (516 resets) in 92 ms. (967 steps per ms)
FORMULA CO4-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 18:07:42] [INFO ] Invariant cache hit.
[2024-06-02 18:07:43] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 18:07:43] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:07:43] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-06-02 18:07:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:07:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-02 18:07:43] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 18:07:43] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-06-02 18:07:43] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 59 ms.
[2024-06-02 18:07:44] [INFO ] Added : 91 causal constraints over 19 iterations in 813 ms. Result :sat
Minimization took 180 ms.
[2024-06-02 18:07:44] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 18:07:44] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:07:44] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-06-02 18:07:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:07:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:07:44] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:07:45] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-06-02 18:07:45] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 37 ms.
[2024-06-02 18:07:45] [INFO ] Added : 102 causal constraints over 21 iterations in 735 ms. Result :sat
Minimization took 172 ms.
[2024-06-02 18:07:46] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:07:46] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:07:46] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-06-02 18:07:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:07:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:07:46] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:07:46] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-06-02 18:07:46] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 47 ms.
[2024-06-02 18:07:47] [INFO ] Added : 99 causal constraints over 20 iterations in 683 ms. Result :sat
Minimization took 158 ms.
[2024-06-02 18:07:47] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 18:07:47] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:07:47] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-06-02 18:07:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:07:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:07:47] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:07:47] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-06-02 18:07:47] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 34 ms.
[2024-06-02 18:07:48] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 24 ms to minimize.
[2024-06-02 18:07:48] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:07:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 272 ms
[2024-06-02 18:07:49] [INFO ] Added : 116 causal constraints over 24 iterations in 1079 ms. Result :sat
Minimization took 188 ms.
[2024-06-02 18:07:49] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 18:07:49] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 18:07:49] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-06-02 18:07:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:07:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:07:49] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:07:49] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2024-06-02 18:07:49] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 32 ms.
[2024-06-02 18:07:50] [INFO ] Added : 122 causal constraints over 25 iterations in 804 ms. Result :sat
Minimization took 165 ms.
[2024-06-02 18:07:50] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 18:07:50] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:07:50] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-06-02 18:07:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:07:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 18:07:51] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:07:51] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-06-02 18:07:51] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 35 ms.
[2024-06-02 18:07:51] [INFO ] Added : 116 causal constraints over 24 iterations in 736 ms. Result :sat
Minimization took 170 ms.
[2024-06-02 18:07:52] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 18:07:52] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:07:52] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-06-02 18:07:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:07:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:07:52] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:07:52] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-06-02 18:07:52] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 39 ms.
[2024-06-02 18:07:53] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 3 ms to minimize.
[2024-06-02 18:07:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2024-06-02 18:07:53] [INFO ] Added : 103 causal constraints over 21 iterations in 903 ms. Result :sat
Minimization took 167 ms.
[2024-06-02 18:07:53] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 18:07:53] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:07:53] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-06-02 18:07:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:07:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 18:07:53] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:07:54] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-06-02 18:07:54] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 31 ms.
[2024-06-02 18:07:54] [INFO ] Added : 108 causal constraints over 22 iterations in 698 ms. Result :sat
Minimization took 165 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 563/563 transitions.
Graph (trivial) has 479 edges and 477 vertex of which 3 / 477 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 770 edges and 475 vertex of which 434 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Discarding 41 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 273 transitions
Trivial Post-agglo rules discarded 273 transitions
Performed 273 trivial Post agglomeration. Transition count delta: 273
Iterating post reduction 0 with 298 rules applied. Total rules applied 300 place count 434 transition count 242
Reduce places removed 273 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 291 rules applied. Total rules applied 591 place count 161 transition count 224
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 20 rules applied. Total rules applied 611 place count 153 transition count 212
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 619 place count 149 transition count 208
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 625 place count 147 transition count 204
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 629 place count 145 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 629 place count 145 transition count 201
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 631 place count 144 transition count 201
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 658 place count 117 transition count 174
Iterating global reduction 6 with 27 rules applied. Total rules applied 685 place count 117 transition count 174
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 685 place count 117 transition count 167
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 699 place count 110 transition count 167
Graph (complete) has 264 edges and 110 vertex of which 108 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 700 place count 108 transition count 166
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 703 place count 108 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 704 place count 107 transition count 163
Discarding 17 places :
Symmetric choice reduction at 9 with 17 rule applications. Total rules 721 place count 90 transition count 128
Iterating global reduction 9 with 17 rules applied. Total rules applied 738 place count 90 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 740 place count 90 transition count 126
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 742 place count 88 transition count 124
Iterating global reduction 10 with 2 rules applied. Total rules applied 744 place count 88 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 746 place count 88 transition count 122
Performed 33 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 11 with 66 rules applied. Total rules applied 812 place count 55 transition count 88
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 819 place count 55 transition count 81
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 822 place count 52 transition count 78
Iterating global reduction 12 with 3 rules applied. Total rules applied 825 place count 52 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 826 place count 52 transition count 77
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 13 with 2 rules applied. Total rules applied 828 place count 51 transition count 76
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 829 place count 51 transition count 75
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 830 place count 50 transition count 74
Iterating global reduction 14 with 1 rules applied. Total rules applied 831 place count 50 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 832 place count 50 transition count 73
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 15 with 20 rules applied. Total rules applied 852 place count 40 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 15 with 17 rules applied. Total rules applied 869 place count 40 transition count 57
Discarding 8 places :
Symmetric choice reduction at 16 with 8 rule applications. Total rules 877 place count 32 transition count 49
Iterating global reduction 16 with 8 rules applied. Total rules applied 885 place count 32 transition count 49
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 893 place count 32 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 895 place count 31 transition count 45
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 896 place count 31 transition count 44
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 897 place count 30 transition count 43
Iterating global reduction 17 with 1 rules applied. Total rules applied 898 place count 30 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 900 place count 30 transition count 41
Free-agglomeration rule applied 7 times.
Iterating global reduction 18 with 7 rules applied. Total rules applied 907 place count 30 transition count 34
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 9 rules applied. Total rules applied 916 place count 23 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 917 place count 23 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 918 place count 22 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 920 place count 20 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 20 with 1 Pre rules applied. Total rules applied 920 place count 20 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 922 place count 19 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 20 with 6 rules applied. Total rules applied 928 place count 16 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 932 place count 16 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 936 place count 14 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 940 place count 14 transition count 20
Applied a total of 940 rules in 103 ms. Remains 14 /477 variables (removed 463) and now considering 20/563 (removed 543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 14/477 places, 20/563 transitions.
// Phase 1: matrix 20 rows 14 cols
[2024-06-02 18:07:55] [INFO ] Computed 5 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 588 ms. (1697 steps per ms)
FORMULA CO4-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 273 ms. (3649 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 14031 ms.
ITS solved all properties within timeout

BK_STOP 1717351676329

--------------------
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-12"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CO4-PT-12, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734900900093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.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 ;