Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692700566.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is BusinessProcesses-PT-15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692700566
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 157K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678503411691

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:56:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:56:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:56:53] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-11 02:56:53] [INFO ] Transformed 630 places.
[2023-03-11 02:56:53] [INFO ] Transformed 566 transitions.
[2023-03-11 02:56:53] [INFO ] Found NUPN structural information;
[2023-03-11 02:56:53] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 66 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 12) seen :3
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 562 rows 626 cols
[2023-03-11 02:56:54] [INFO ] Computed 102 place invariants in 43 ms
[2023-03-11 02:56:55] [INFO ] [Real]Absence check using 61 positive place invariants in 20 ms returned sat
[2023-03-11 02:56:55] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2023-03-11 02:56:55] [INFO ] After 434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 02:56:55] [INFO ] [Nat]Absence check using 61 positive place invariants in 16 ms returned sat
[2023-03-11 02:56:55] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2023-03-11 02:56:56] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2023-03-11 02:56:56] [INFO ] Deduced a trap composed of 141 places in 241 ms of which 7 ms to minimize.
[2023-03-11 02:56:56] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 1 ms to minimize.
[2023-03-11 02:56:56] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 1 ms to minimize.
[2023-03-11 02:56:57] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 2 ms to minimize.
[2023-03-11 02:56:57] [INFO ] Deduced a trap composed of 139 places in 196 ms of which 1 ms to minimize.
[2023-03-11 02:56:57] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 1 ms to minimize.
[2023-03-11 02:56:57] [INFO ] Deduced a trap composed of 138 places in 197 ms of which 1 ms to minimize.
[2023-03-11 02:56:57] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 0 ms to minimize.
[2023-03-11 02:56:58] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 1 ms to minimize.
[2023-03-11 02:56:58] [INFO ] Deduced a trap composed of 148 places in 179 ms of which 1 ms to minimize.
[2023-03-11 02:56:58] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 0 ms to minimize.
[2023-03-11 02:56:58] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 0 ms to minimize.
[2023-03-11 02:56:58] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 1 ms to minimize.
[2023-03-11 02:56:59] [INFO ] Deduced a trap composed of 129 places in 212 ms of which 0 ms to minimize.
[2023-03-11 02:56:59] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 1 ms to minimize.
[2023-03-11 02:56:59] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 1 ms to minimize.
[2023-03-11 02:56:59] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 1 ms to minimize.
[2023-03-11 02:57:00] [INFO ] Deduced a trap composed of 140 places in 211 ms of which 1 ms to minimize.
[2023-03-11 02:57:00] [INFO ] Deduced a trap composed of 136 places in 205 ms of which 1 ms to minimize.
[2023-03-11 02:57:00] [INFO ] Deduced a trap composed of 142 places in 226 ms of which 0 ms to minimize.
[2023-03-11 02:57:00] [INFO ] Deduced a trap composed of 121 places in 190 ms of which 1 ms to minimize.
[2023-03-11 02:57:01] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 0 ms to minimize.
[2023-03-11 02:57:01] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 1 ms to minimize.
[2023-03-11 02:57:01] [INFO ] Deduced a trap composed of 139 places in 182 ms of which 1 ms to minimize.
[2023-03-11 02:57:01] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 1 ms to minimize.
[2023-03-11 02:57:01] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 1 ms to minimize.
[2023-03-11 02:57:02] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 0 ms to minimize.
[2023-03-11 02:57:02] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 0 ms to minimize.
[2023-03-11 02:57:02] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 1 ms to minimize.
[2023-03-11 02:57:02] [INFO ] Deduced a trap composed of 141 places in 155 ms of which 0 ms to minimize.
[2023-03-11 02:57:02] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 0 ms to minimize.
[2023-03-11 02:57:03] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 1 ms to minimize.
[2023-03-11 02:57:03] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 0 ms to minimize.
[2023-03-11 02:57:03] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 0 ms to minimize.
[2023-03-11 02:57:03] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 1 ms to minimize.
[2023-03-11 02:57:03] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2023-03-11 02:57:03] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 0 ms to minimize.
[2023-03-11 02:57:04] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 1 ms to minimize.
[2023-03-11 02:57:04] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 0 ms to minimize.
[2023-03-11 02:57:04] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 2 ms to minimize.
[2023-03-11 02:57:04] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 1 ms to minimize.
[2023-03-11 02:57:04] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 1 ms to minimize.
[2023-03-11 02:57:04] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 0 ms to minimize.
[2023-03-11 02:57:05] [INFO ] Deduced a trap composed of 134 places in 142 ms of which 1 ms to minimize.
[2023-03-11 02:57:05] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 0 ms to minimize.
[2023-03-11 02:57:05] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 1 ms to minimize.
[2023-03-11 02:57:05] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 0 ms to minimize.
[2023-03-11 02:57:05] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 2 ms to minimize.
[2023-03-11 02:57:05] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 1 ms to minimize.
[2023-03-11 02:57:06] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 0 ms to minimize.
[2023-03-11 02:57:06] [INFO ] Deduced a trap composed of 134 places in 150 ms of which 1 ms to minimize.
[2023-03-11 02:57:06] [INFO ] Deduced a trap composed of 136 places in 132 ms of which 0 ms to minimize.
[2023-03-11 02:57:06] [INFO ] Deduced a trap composed of 132 places in 127 ms of which 2 ms to minimize.
[2023-03-11 02:57:06] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 0 ms to minimize.
[2023-03-11 02:57:07] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 1 ms to minimize.
[2023-03-11 02:57:07] [INFO ] Deduced a trap composed of 133 places in 154 ms of which 0 ms to minimize.
[2023-03-11 02:57:07] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 3 ms to minimize.
[2023-03-11 02:57:07] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 1 ms to minimize.
[2023-03-11 02:57:07] [INFO ] Deduced a trap composed of 130 places in 158 ms of which 1 ms to minimize.
[2023-03-11 02:57:07] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 1 ms to minimize.
[2023-03-11 02:57:08] [INFO ] Deduced a trap composed of 130 places in 163 ms of which 1 ms to minimize.
[2023-03-11 02:57:08] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 1 ms to minimize.
[2023-03-11 02:57:08] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 1 ms to minimize.
[2023-03-11 02:57:08] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 1 ms to minimize.
[2023-03-11 02:57:08] [INFO ] Deduced a trap composed of 132 places in 157 ms of which 1 ms to minimize.
[2023-03-11 02:57:09] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 1 ms to minimize.
[2023-03-11 02:57:09] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 0 ms to minimize.
[2023-03-11 02:57:09] [INFO ] Deduced a trap composed of 59 places in 157 ms of which 0 ms to minimize.
[2023-03-11 02:57:09] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 0 ms to minimize.
[2023-03-11 02:57:09] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 0 ms to minimize.
[2023-03-11 02:57:09] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 0 ms to minimize.
[2023-03-11 02:57:10] [INFO ] Deduced a trap composed of 129 places in 139 ms of which 1 ms to minimize.
[2023-03-11 02:57:10] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 0 ms to minimize.
[2023-03-11 02:57:10] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2023-03-11 02:57:10] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2023-03-11 02:57:10] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2023-03-11 02:57:10] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 0 ms to minimize.
[2023-03-11 02:57:10] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 14760 ms
[2023-03-11 02:57:11] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 1 ms to minimize.
[2023-03-11 02:57:11] [INFO ] Deduced a trap composed of 135 places in 170 ms of which 1 ms to minimize.
[2023-03-11 02:57:11] [INFO ] Deduced a trap composed of 145 places in 183 ms of which 0 ms to minimize.
[2023-03-11 02:57:11] [INFO ] Deduced a trap composed of 135 places in 165 ms of which 0 ms to minimize.
[2023-03-11 02:57:12] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 1 ms to minimize.
[2023-03-11 02:57:12] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 0 ms to minimize.
[2023-03-11 02:57:12] [INFO ] Deduced a trap composed of 134 places in 173 ms of which 1 ms to minimize.
[2023-03-11 02:57:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1638 ms
[2023-03-11 02:57:12] [INFO ] After 17421ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 359 ms.
[2023-03-11 02:57:13] [INFO ] After 18087ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 110 ms.
Support contains 46 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 562/562 transitions.
Graph (trivial) has 318 edges and 626 vertex of which 7 / 626 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1267 edges and 620 vertex of which 616 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 616 transition count 436
Reduce places removed 117 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 124 rules applied. Total rules applied 243 place count 499 transition count 429
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 250 place count 492 transition count 429
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 250 place count 492 transition count 343
Deduced a syphon composed of 86 places in 2 ms
Ensure Unique test removed 14 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 436 place count 392 transition count 343
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 505 place count 323 transition count 274
Iterating global reduction 3 with 69 rules applied. Total rules applied 574 place count 323 transition count 274
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 574 place count 323 transition count 268
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 587 place count 316 transition count 268
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 743 place count 237 transition count 191
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 3 with 2 rules applied. Total rules applied 745 place count 236 transition count 195
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 747 place count 236 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 749 place count 234 transition count 193
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 753 place count 234 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 754 place count 233 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 755 place count 232 transition count 192
Applied a total of 755 rules in 184 ms. Remains 232 /626 variables (removed 394) and now considering 192/562 (removed 370) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 232/626 places, 192/562 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :5
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 459 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=229 )
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 20296 ms.
starting LoLA
BK_INPUT BusinessProcesses-PT-15
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
ReachabilityCardinality

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678503435404

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 4 transitions removed,4 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 56 (type EXCL) for 3 BusinessProcesses-PT-15-ReachabilityCardinality-01
lola: time limit : 224 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 58 (type FNDP) for 15 BusinessProcesses-PT-15-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 59 (type EQUN) for 15 BusinessProcesses-PT-15-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 61 (type SRCH) for 15 BusinessProcesses-PT-15-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 56 (type EXCL) for BusinessProcesses-PT-15-ReachabilityCardinality-01
lola: result : true
lola: markings : 20
lola: fired transitions : 19
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 68 (type EXCL) for 0 BusinessProcesses-PT-15-ReachabilityCardinality-00
lola: time limit : 299 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 61 (type SRCH) for BusinessProcesses-PT-15-ReachabilityCardinality-05
lola: result : false
lola: markings : 3498
lola: fired transitions : 5701
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 58 (type FNDP) for BusinessProcesses-PT-15-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 59 (type EQUN) for BusinessProcesses-PT-15-ReachabilityCardinality-05 (obsolete)
lola: LAUNCH task # 78 (type FNDP) for 12 BusinessProcesses-PT-15-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 79 (type EQUN) for 12 BusinessProcesses-PT-15-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 81 (type SRCH) for 12 BusinessProcesses-PT-15-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: FINISHED task # 58 (type FNDP) for BusinessProcesses-PT-15-ReachabilityCardinality-05
lola: result : unknown
lola: fired transitions : 3097
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: tried executions : 668
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 68 (type EXCL) for BusinessProcesses-PT-15-ReachabilityCardinality-00
lola: result : true
lola: markings : 40
lola: fired transitions : 39
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 59 (type EQUN) for BusinessProcesses-PT-15-ReachabilityCardinality-05
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 108 (type EXCL) for 36 BusinessProcesses-PT-15-ReachabilityCardinality-12
lola: time limit : 327 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 108 (type EXCL) for BusinessProcesses-PT-15-ReachabilityCardinality-12
lola: result : true
lola: markings : 38
lola: fired transitions : 37
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 119 (type EXCL) for 21 BusinessProcesses-PT-15-ReachabilityCardinality-07
lola: time limit : 299 sec
lola: memory limit: 32 pages
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-79.sara.
lola: FINISHED task # 119 (type EXCL) for BusinessProcesses-PT-15-ReachabilityCardinality-07
lola: result : false
lola: markings : 2576
lola: fired transitions : 3039
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 90 (type EXCL) for 30 BusinessProcesses-PT-15-ReachabilityCardinality-10
lola: time limit : 327 sec
lola: memory limit: 32 pages
lola: FINISHED task # 90 (type EXCL) for BusinessProcesses-PT-15-ReachabilityCardinality-10
lola: result : true
lola: markings : 38
lola: fired transitions : 37
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 152 (type EXCL) for 27 BusinessProcesses-PT-15-ReachabilityCardinality-09
lola: time limit : 359 sec
lola: memory limit: 32 pages
lola: FINISHED task # 152 (type EXCL) for BusinessProcesses-PT-15-ReachabilityCardinality-09
lola: result : true
lola: markings : 199
lola: fired transitions : 205
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 75 (type EXCL) for 24 BusinessProcesses-PT-15-ReachabilityCardinality-08
lola: time limit : 399 sec
lola: memory limit: 32 pages
lola: FINISHED task # 75 (type EXCL) for BusinessProcesses-PT-15-ReachabilityCardinality-08
lola: result : true
lola: markings : 321
lola: fired transitions : 331
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 146 (type EXCL) for 18 BusinessProcesses-PT-15-ReachabilityCardinality-06
lola: time limit : 449 sec
lola: memory limit: 32 pages
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 146 (type EXCL) for BusinessProcesses-PT-15-ReachabilityCardinality-06
lola: result : false
lola: markings : 3084
lola: fired transitions : 3547
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 98 (type EXCL) for 6 BusinessProcesses-PT-15-ReachabilityCardinality-02
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: FINISHED task # 98 (type EXCL) for BusinessProcesses-PT-15-ReachabilityCardinality-02
lola: result : false
lola: markings : 7663
lola: fired transitions : 9672
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 102 (type EXCL) for 9 BusinessProcesses-PT-15-ReachabilityCardinality-03
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 102 (type EXCL) for BusinessProcesses-PT-15-ReachabilityCardinality-03
lola: result : true
lola: markings : 6
lola: fired transitions : 5
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 140 (type EXCL) for 45 BusinessProcesses-PT-15-ReachabilityCardinality-15
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: FINISHED task # 140 (type EXCL) for BusinessProcesses-PT-15-ReachabilityCardinality-15
lola: result : true
lola: markings : 107
lola: fired transitions : 107
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 133 (type EXCL) for 39 BusinessProcesses-PT-15-ReachabilityCardinality-13
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: FINISHED task # 81 (type SRCH) for BusinessProcesses-PT-15-ReachabilityCardinality-04
lola: result : false
lola: markings : 46995
lola: fired transitions : 91936
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 78 (type FNDP) for BusinessProcesses-PT-15-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 79 (type EQUN) for BusinessProcesses-PT-15-ReachabilityCardinality-04 (obsolete)
lola: LAUNCH task # 110 (type FNDP) for 42 BusinessProcesses-PT-15-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 111 (type EQUN) for 42 BusinessProcesses-PT-15-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 113 (type SRCH) for 42 BusinessProcesses-PT-15-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 78 (type FNDP) for BusinessProcesses-PT-15-ReachabilityCardinality-04
lola: result : unknown
lola: fired transitions : 65341
lola: tried executions : 5548
lola: time used : 1.000000
lola: memory pages used : 0
lola: FINISHED task # 79 (type EQUN) for BusinessProcesses-PT-15-ReachabilityCardinality-04
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 133 (type EXCL) for BusinessProcesses-PT-15-ReachabilityCardinality-13
lola: result : false
lola: markings : 5733
lola: fired transitions : 6992
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 131 (type EXCL) for 33 BusinessProcesses-PT-15-ReachabilityCardinality-11
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 131 (type EXCL) for BusinessProcesses-PT-15-ReachabilityCardinality-11
lola: result : true
lola: markings : 414
lola: fired transitions : 420
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 114 (type EXCL) for 42 BusinessProcesses-PT-15-ReachabilityCardinality-14
lola: time limit : 3598 sec
lola: memory limit: 32 pages
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-111.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 114 (type EXCL) for BusinessProcesses-PT-15-ReachabilityCardinality-14
lola: result : false
lola: markings : 42570
lola: fired transitions : 50298
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 110 (type FNDP) for BusinessProcesses-PT-15-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 111 (type EQUN) for BusinessProcesses-PT-15-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 113 (type SRCH) for BusinessProcesses-PT-15-ReachabilityCardinality-14 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-15-ReachabilityCardinality-00: EF true tandem / relaxed
BusinessProcesses-PT-15-ReachabilityCardinality-01: EF true tandem / relaxed
BusinessProcesses-PT-15-ReachabilityCardinality-02: AG true tandem / relaxed
BusinessProcesses-PT-15-ReachabilityCardinality-03: AG false tandem / relaxed
BusinessProcesses-PT-15-ReachabilityCardinality-04: EF false tandem / insertion
BusinessProcesses-PT-15-ReachabilityCardinality-05: AG true tandem / insertion
BusinessProcesses-PT-15-ReachabilityCardinality-06: AG true tandem / relaxed
BusinessProcesses-PT-15-ReachabilityCardinality-07: AG true tandem / relaxed
BusinessProcesses-PT-15-ReachabilityCardinality-08: EF true tandem / relaxed
BusinessProcesses-PT-15-ReachabilityCardinality-09: AG false tandem / relaxed
BusinessProcesses-PT-15-ReachabilityCardinality-10: AG false tandem / relaxed
BusinessProcesses-PT-15-ReachabilityCardinality-11: AG false tandem / relaxed
BusinessProcesses-PT-15-ReachabilityCardinality-12: AG false tandem / relaxed
BusinessProcesses-PT-15-ReachabilityCardinality-13: EF false tandem / relaxed
BusinessProcesses-PT-15-ReachabilityCardinality-14: AG true tandem / relaxed
BusinessProcesses-PT-15-ReachabilityCardinality-15: EF true tandem / relaxed


Time elapsed: 2 secs. Pages in use: 2

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="BusinessProcesses-PT-15"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is BusinessProcesses-PT-15, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692700566"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;