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.r575-smll-171734919500077.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 MedleyA-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919500077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 107K 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 MedleyA-PT-10-UpperBounds-00
FORMULA_NAME MedleyA-PT-10-UpperBounds-01
FORMULA_NAME MedleyA-PT-10-UpperBounds-02
FORMULA_NAME MedleyA-PT-10-UpperBounds-03
FORMULA_NAME MedleyA-PT-10-UpperBounds-04
FORMULA_NAME MedleyA-PT-10-UpperBounds-05
FORMULA_NAME MedleyA-PT-10-UpperBounds-06
FORMULA_NAME MedleyA-PT-10-UpperBounds-07
FORMULA_NAME MedleyA-PT-10-UpperBounds-08
FORMULA_NAME MedleyA-PT-10-UpperBounds-09
FORMULA_NAME MedleyA-PT-10-UpperBounds-10
FORMULA_NAME MedleyA-PT-10-UpperBounds-11
FORMULA_NAME MedleyA-PT-10-UpperBounds-12
FORMULA_NAME MedleyA-PT-10-UpperBounds-13
FORMULA_NAME MedleyA-PT-10-UpperBounds-14
FORMULA_NAME MedleyA-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717358714018

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 20:05:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 20:05:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:05:17] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2024-06-02 20:05:17] [INFO ] Transformed 149 places.
[2024-06-02 20:05:17] [INFO ] Transformed 340 transitions.
[2024-06-02 20:05:17] [INFO ] Found NUPN structural information;
[2024-06-02 20:05:17] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 488 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
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, 0, 0, 0] Max Struct:[1, 1, 1, 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, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 340 rows 149 cols
[2024-06-02 20:05:17] [INFO ] Computed 12 invariants in 47 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 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, 1, 1, 1]
RANDOM walk for 10000 steps (428 resets) in 126 ms. (78 steps per ms)
FORMULA MedleyA-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60003 steps (645 resets) in 112 ms. (531 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-02 20:05:17] [INFO ] Invariant cache hit.
[2024-06-02 20:05:17] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 20:05:17] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:05:18] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-06-02 20:05:18] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 15 ms to minimize.
[2024-06-02 20:05:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:05:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 20:05:18] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:05:18] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-06-02 20:05:18] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-06-02 20:05:18] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 3 ms to minimize.
[2024-06-02 20:05:19] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 2 ms to minimize.
[2024-06-02 20:05:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 642 ms
[2024-06-02 20:05:19] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 108 ms.
[2024-06-02 20:05:20] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 3 ms to minimize.
[2024-06-02 20:05:20] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 2 ms to minimize.
[2024-06-02 20:05:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 476 ms
[2024-06-02 20:05:20] [INFO ] Added : 54 causal constraints over 12 iterations in 1139 ms. Result :sat
Minimization took 196 ms.
[2024-06-02 20:05:20] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 20:05:20] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:05:21] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2024-06-02 20:05:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:05:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 20:05:21] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:05:21] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-06-02 20:05:21] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 70 ms.
[2024-06-02 20:05:21] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 2 ms to minimize.
[2024-06-02 20:05:21] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-06-02 20:05:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 344 ms
[2024-06-02 20:05:22] [INFO ] Added : 59 causal constraints over 13 iterations in 826 ms. Result :sat
Minimization took 212 ms.
[2024-06-02 20:05:22] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 20:05:22] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:05:22] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2024-06-02 20:05:22] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:05:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:05:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 20:05:22] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:05:22] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2024-06-02 20:05:22] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-06-02 20:05:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-06-02 20:05:22] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 37 ms.
[2024-06-02 20:05:23] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 4 ms to minimize.
[2024-06-02 20:05:23] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-06-02 20:05:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2024-06-02 20:05:23] [INFO ] Added : 55 causal constraints over 12 iterations in 720 ms. Result :sat
Minimization took 200 ms.
[2024-06-02 20:05:23] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 20:05:23] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 20:05:24] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-06-02 20:05:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:05:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 20:05:24] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:05:24] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-06-02 20:05:24] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 58 ms.
[2024-06-02 20:05:25] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 3 ms to minimize.
[2024-06-02 20:05:25] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:05:25] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-06-02 20:05:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 565 ms
[2024-06-02 20:05:25] [INFO ] Added : 58 causal constraints over 13 iterations in 1119 ms. Result :sat
Minimization took 188 ms.
[2024-06-02 20:05:25] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 20:05:25] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:05:26] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-06-02 20:05:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:05:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 20:05:26] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:05:26] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-06-02 20:05:26] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 38 ms.
[2024-06-02 20:05:26] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 3 ms to minimize.
[2024-06-02 20:05:27] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 3 ms to minimize.
[2024-06-02 20:05:27] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 3 ms to minimize.
[2024-06-02 20:05:27] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 2 ms to minimize.
[2024-06-02 20:05:27] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 2 ms to minimize.
[2024-06-02 20:05:27] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:05:28] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-06-02 20:05:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1391 ms
[2024-06-02 20:05:28] [INFO ] Added : 56 causal constraints over 12 iterations in 1890 ms. Result :sat
Minimization took 168 ms.
[2024-06-02 20:05:28] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 20:05:28] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:05:28] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-06-02 20:05:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:05:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 20:05:28] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:05:28] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-06-02 20:05:28] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:05:28] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-06-02 20:05:29] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2024-06-02 20:05:29] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-06-02 20:05:29] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 1 ms to minimize.
[2024-06-02 20:05:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 635 ms
[2024-06-02 20:05:29] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 24 ms.
[2024-06-02 20:05:29] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2024-06-02 20:05:29] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-06-02 20:05:30] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-06-02 20:05:30] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-06-02 20:05:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 519 ms
[2024-06-02 20:05:30] [INFO ] Added : 66 causal constraints over 14 iterations in 860 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 149 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p56) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 338/338 transitions.
Graph (complete) has 541 edges and 149 vertex of which 144 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 144 transition count 311
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 56 place count 120 transition count 305
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 56 place count 120 transition count 302
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 117 transition count 302
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 92 place count 87 transition count 265
Iterating global reduction 2 with 30 rules applied. Total rules applied 122 place count 87 transition count 265
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 122 place count 87 transition count 263
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 126 place count 85 transition count 263
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 135 place count 76 transition count 244
Iterating global reduction 2 with 9 rules applied. Total rules applied 144 place count 76 transition count 244
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 147 place count 73 transition count 236
Iterating global reduction 2 with 3 rules applied. Total rules applied 150 place count 73 transition count 236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 72 transition count 233
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 72 transition count 233
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 184 place count 56 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 186 place count 56 transition count 215
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 188 place count 54 transition count 213
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 54 transition count 213
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 198 place count 50 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 208 place count 50 transition count 215
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 212 place count 48 transition count 238
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 219 place count 48 transition count 231
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 226 place count 41 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 230 place count 41 transition count 227
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 41 transition count 225
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 234 place count 39 transition count 225
Applied a total of 234 rules in 221 ms. Remains 39 /149 variables (removed 110) and now considering 225/338 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 39/149 places, 225/338 transitions.
[2024-06-02 20:05:31] [INFO ] Flow matrix only has 179 transitions (discarded 46 similar events)
// Phase 1: matrix 179 rows 39 cols
[2024-06-02 20:05:31] [INFO ] Computed 11 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (225808 resets) in 5241 ms. (190 steps per ms)
FORMULA MedleyA-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (41607 resets) in 1489 ms. (671 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 21498 ms.
ITS solved all properties within timeout

BK_STOP 1717358738156

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="MedleyA-PT-10"
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 MedleyA-PT-10, 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 r575-smll-171734919500077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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