fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r039-tajo-167813692600498
Last Updated
May 14, 2023

About the Execution of LoLa+red for BusinessProcesses-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
864.800 86394.00 93725.00 93.00 FFTTT?T?TFFFTFTT normal

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-167813692600498.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-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692600498
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:42 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.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 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 100K 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-07-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678501996770

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-07
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:33:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:33:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:33:18] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-11 02:33:18] [INFO ] Transformed 386 places.
[2023-03-11 02:33:18] [INFO ] Transformed 360 transitions.
[2023-03-11 02:33:18] [INFO ] Found NUPN structural information;
[2023-03-11 02:33:18] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 107 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 6 ms.
Support contains 95 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 360
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 44 place count 342 transition count 317
Iterating global reduction 1 with 43 rules applied. Total rules applied 87 place count 342 transition count 317
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 102 place count 327 transition count 302
Iterating global reduction 1 with 15 rules applied. Total rules applied 117 place count 327 transition count 302
Applied a total of 117 rules in 59 ms. Remains 327 /386 variables (removed 59) and now considering 302/360 (removed 58) transitions.
// Phase 1: matrix 302 rows 327 cols
[2023-03-11 02:33:18] [INFO ] Computed 61 place invariants in 20 ms
[2023-03-11 02:33:18] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-11 02:33:18] [INFO ] Invariant cache hit.
[2023-03-11 02:33:19] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2023-03-11 02:33:19] [INFO ] Invariant cache hit.
[2023-03-11 02:33:19] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 327/386 places, 302/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 735 ms. Remains : 327/386 places, 302/360 transitions.
Support contains 95 out of 327 places after structural reductions.
[2023-03-11 02:33:19] [INFO ] Flatten gal took : 45 ms
[2023-03-11 02:33:19] [INFO ] Flatten gal took : 19 ms
[2023-03-11 02:33:19] [INFO ] Input system was already deterministic with 302 transitions.
Incomplete random walk after 10000 steps, including 109 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 61) seen :33
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-03-11 02:33:20] [INFO ] Invariant cache hit.
[2023-03-11 02:33:20] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-11 02:33:20] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-11 02:33:20] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-11 02:33:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-11 02:33:20] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-11 02:33:21] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :19
[2023-03-11 02:33:21] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 5 ms to minimize.
[2023-03-11 02:33:21] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2023-03-11 02:33:21] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2023-03-11 02:33:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 212 ms
[2023-03-11 02:33:21] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2023-03-11 02:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-11 02:33:21] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2023-03-11 02:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-11 02:33:21] [INFO ] After 972ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :19
Attempting to minimize the solution found.
Minimization took 213 ms.
[2023-03-11 02:33:21] [INFO ] After 1463ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :19
Fused 28 Parikh solutions to 19 different solutions.
Parikh walk visited 7 properties in 148 ms.
Support contains 29 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (complete) has 747 edges and 327 vertex of which 326 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 326 transition count 276
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 301 transition count 274
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 299 transition count 274
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 55 place count 299 transition count 210
Deduced a syphon composed of 64 places in 3 ms
Ensure Unique test removed 8 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 191 place count 227 transition count 210
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 203 place count 215 transition count 198
Iterating global reduction 3 with 12 rules applied. Total rules applied 215 place count 215 transition count 198
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 125 rules applied. Total rules applied 340 place count 152 transition count 136
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 341 place count 152 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 342 place count 151 transition count 135
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 350 place count 151 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 351 place count 150 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 352 place count 149 transition count 134
Applied a total of 352 rules in 89 ms. Remains 149 /327 variables (removed 178) and now considering 134/302 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 149/327 places, 134/302 transitions.
Incomplete random walk after 10000 steps, including 648 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 150 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 164 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 168 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :5
Running SMT prover for 3 properties.
// Phase 1: matrix 134 rows 149 cols
[2023-03-11 02:33:22] [INFO ] Computed 51 place invariants in 4 ms
[2023-03-11 02:33:23] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2023-03-11 02:33:23] [INFO ] [Real]Absence check using 31 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-11 02:33:23] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 02:33:23] [INFO ] [Nat]Absence check using 31 positive place invariants in 4 ms returned sat
[2023-03-11 02:33:23] [INFO ] [Nat]Absence check using 31 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-11 02:33:23] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 02:33:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 02:33:23] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 02:33:23] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-11 02:33:23] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 10 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 134/134 transitions.
Graph (trivial) has 17 edges and 149 vertex of which 2 / 149 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 148 transition count 127
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 143 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 142 transition count 126
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 142 transition count 124
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 18 place count 139 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 138 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 138 transition count 123
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 40 place count 128 transition count 113
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 128 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 44 place count 126 transition count 111
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 126 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 125 transition count 110
Applied a total of 47 rules in 24 ms. Remains 125 /149 variables (removed 24) and now considering 110/134 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 125/149 places, 110/134 transitions.
Incomplete random walk after 10000 steps, including 728 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 228 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 226 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 222 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1907072 steps, run timeout after 3001 ms. (steps per millisecond=635 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 1907072 steps, saw 479006 distinct states, run finished after 3001 ms. (steps per millisecond=635 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 110 rows 125 cols
[2023-03-11 02:33:26] [INFO ] Computed 50 place invariants in 7 ms
[2023-03-11 02:33:26] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-11 02:33:26] [INFO ] [Real]Absence check using 32 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-11 02:33:26] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 02:33:26] [INFO ] After 54ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-11 02:33:26] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 110/110 transitions.
Graph (trivial) has 8 edges and 125 vertex of which 2 / 125 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 123 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 3 place count 123 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 119 transition count 103
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 114 transition count 100
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 114 transition count 98
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 112 transition count 98
Applied a total of 23 rules in 17 ms. Remains 112 /125 variables (removed 13) and now considering 98/110 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 112/125 places, 98/110 transitions.
Finished random walk after 86 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=86 )
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2023-03-11 02:33:26] [INFO ] Flatten gal took : 23 ms
[2023-03-11 02:33:26] [INFO ] Flatten gal took : 21 ms
[2023-03-11 02:33:26] [INFO ] Input system was already deterministic with 302 transitions.
Support contains 74 out of 327 places (down from 81) after GAL structural reductions.
Computed a total of 202 stabilizing places and 204 stable transitions
Graph (complete) has 747 edges and 327 vertex of which 326 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 13 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-11 02:33:26] [INFO ] Flatten gal took : 19 ms
[2023-03-11 02:33:26] [INFO ] Flatten gal took : 18 ms
[2023-03-11 02:33:26] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 13 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-11 02:33:26] [INFO ] Flatten gal took : 16 ms
[2023-03-11 02:33:26] [INFO ] Flatten gal took : 16 ms
[2023-03-11 02:33:26] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (trivial) has 156 edges and 327 vertex of which 6 / 327 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 741 edges and 322 vertex of which 321 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 320 transition count 256
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 282 transition count 256
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 78 place count 282 transition count 193
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 213 place count 210 transition count 193
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 228 place count 195 transition count 178
Iterating global reduction 2 with 15 rules applied. Total rules applied 243 place count 195 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 243 place count 195 transition count 176
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 247 place count 193 transition count 176
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 392 place count 119 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 118 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 117 transition count 104
Applied a total of 394 rules in 42 ms. Remains 117 /327 variables (removed 210) and now considering 104/302 (removed 198) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 117/327 places, 104/302 transitions.
[2023-03-11 02:33:26] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:33:26] [INFO ] Flatten gal took : 9 ms
[2023-03-11 02:33:26] [INFO ] Input system was already deterministic with 104 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
FORMULA BusinessProcesses-PT-07-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (complete) has 747 edges and 327 vertex of which 326 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 325 transition count 269
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 294 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 292 transition count 267
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 67 place count 292 transition count 198
Deduced a syphon composed of 69 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 147 rules applied. Total rules applied 214 place count 214 transition count 198
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 230 place count 198 transition count 182
Iterating global reduction 3 with 16 rules applied. Total rules applied 246 place count 198 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 246 place count 198 transition count 181
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 248 place count 197 transition count 181
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 383 place count 128 transition count 115
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 389 place count 128 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 390 place count 127 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 391 place count 126 transition count 114
Applied a total of 391 rules in 50 ms. Remains 126 /327 variables (removed 201) and now considering 114/302 (removed 188) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 126/327 places, 114/302 transitions.
[2023-03-11 02:33:26] [INFO ] Flatten gal took : 9 ms
[2023-03-11 02:33:26] [INFO ] Flatten gal took : 9 ms
[2023-03-11 02:33:26] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 13 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 14 ms
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 16 ms
[2023-03-11 02:33:27] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (trivial) has 156 edges and 327 vertex of which 6 / 327 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 741 edges and 322 vertex of which 321 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 320 transition count 256
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 282 transition count 256
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 78 place count 282 transition count 192
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 215 place count 209 transition count 192
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 231 place count 193 transition count 176
Iterating global reduction 2 with 16 rules applied. Total rules applied 247 place count 193 transition count 176
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 247 place count 193 transition count 174
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 251 place count 191 transition count 174
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 392 place count 119 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 118 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 117 transition count 104
Applied a total of 394 rules in 33 ms. Remains 117 /327 variables (removed 210) and now considering 104/302 (removed 198) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 117/327 places, 104/302 transitions.
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:33:27] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 12 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 13 ms
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 12 ms
[2023-03-11 02:33:27] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 316 transition count 291
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 316 transition count 291
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 313 transition count 288
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 313 transition count 288
Applied a total of 28 rules in 11 ms. Remains 313 /327 variables (removed 14) and now considering 288/302 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 313/327 places, 288/302 transitions.
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 11 ms
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 11 ms
[2023-03-11 02:33:27] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 311 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 311 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 306 transition count 281
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 306 transition count 281
Applied a total of 42 rules in 13 ms. Remains 306 /327 variables (removed 21) and now considering 281/302 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 306/327 places, 281/302 transitions.
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 9 ms
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 9 ms
[2023-03-11 02:33:27] [INFO ] Input system was already deterministic with 281 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (trivial) has 155 edges and 327 vertex of which 6 / 327 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 741 edges and 322 vertex of which 321 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 320 transition count 256
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 282 transition count 256
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 78 place count 282 transition count 194
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 210 place count 212 transition count 194
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 226 place count 196 transition count 178
Iterating global reduction 2 with 16 rules applied. Total rules applied 242 place count 196 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 242 place count 196 transition count 176
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 246 place count 194 transition count 176
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 143 rules applied. Total rules applied 389 place count 121 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 390 place count 120 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 391 place count 119 transition count 105
Applied a total of 391 rules in 22 ms. Remains 119 /327 variables (removed 208) and now considering 105/302 (removed 197) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 119/327 places, 105/302 transitions.
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:33:27] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 311 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 311 transition count 286
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 307 transition count 282
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 307 transition count 282
Applied a total of 40 rules in 18 ms. Remains 307 /327 variables (removed 20) and now considering 282/302 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 307/327 places, 282/302 transitions.
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:33:27] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 310 transition count 285
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 310 transition count 285
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 304 transition count 279
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 304 transition count 279
Applied a total of 46 rules in 18 ms. Remains 304 /327 variables (removed 23) and now considering 279/302 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 304/327 places, 279/302 transitions.
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:33:27] [INFO ] Input system was already deterministic with 279 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Graph (trivial) has 153 edges and 327 vertex of which 6 / 327 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 741 edges and 322 vertex of which 321 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 320 transition count 258
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 284 transition count 258
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 74 place count 284 transition count 193
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 213 place count 210 transition count 193
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 227 place count 196 transition count 179
Iterating global reduction 2 with 14 rules applied. Total rules applied 241 place count 196 transition count 179
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 241 place count 196 transition count 177
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 245 place count 194 transition count 177
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 386 place count 122 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 387 place count 121 transition count 107
Applied a total of 387 rules in 25 ms. Remains 121 /327 variables (removed 206) and now considering 107/302 (removed 195) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 121/327 places, 107/302 transitions.
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:33:27] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 18 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:33:27] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 309 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 309 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 303 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 303 transition count 278
Applied a total of 48 rules in 19 ms. Remains 303 /327 variables (removed 24) and now considering 278/302 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 303/327 places, 278/302 transitions.
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:33:27] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 311 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 311 transition count 286
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 305 transition count 280
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 305 transition count 280
Applied a total of 44 rules in 19 ms. Remains 305 /327 variables (removed 22) and now considering 280/302 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 305/327 places, 280/302 transitions.
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:33:27] [INFO ] Input system was already deterministic with 280 transitions.
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:33:27] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:33:27] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-11 02:33:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 327 places, 302 transitions and 993 arcs took 1 ms.
Total runtime 9349 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-07
BK_EXAMINATION: CTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
CTLFireability

FORMULA BusinessProcesses-PT-07-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BusinessProcesses-PT-07-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-07-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-07-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-07-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-07-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-07-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-07-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-07-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-07-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-07-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-07-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678502083164

--------------------
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 CTLFireability -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/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/CTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:547
lola: rewrite Frontend/Parser/formula_rewrite.k:475
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:478
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:451
lola: rewrite Frontend/Parser/formula_rewrite.k:547
lola: rewrite Frontend/Parser/formula_rewrite.k:445
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:472
lola: rewrite Frontend/Parser/formula_rewrite.k:463
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:394
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
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: 0 transitions removed,0 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: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 45 (type EXCL) for 3 BusinessProcesses-PT-07-CTLFireability-01
lola: time limit : 171 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 45 (type EXCL) for BusinessProcesses-PT-07-CTLFireability-01
lola: result : true
lola: markings : 14
lola: fired transitions : 13
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 46 (type EXCL) for 12 BusinessProcesses-PT-07-CTLFireability-05
lola: time limit : 179 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
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:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-07-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-05: EFAG 0 0 1 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-07: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-08: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-09: AGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-13: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-14: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-15: CTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
46 AGEF EXCL 5/257 7/32 BusinessProcesses-PT-07-CTLFireability-05 1594261 m, 318852 m/sec, 5273186 t fired, .

Time elapsed: 6 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-07-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-05: EFAG 0 0 1 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-07: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-08: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-09: AGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-13: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-14: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-15: CTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
46 AGEF EXCL 10/257 13/32 BusinessProcesses-PT-07-CTLFireability-05 3082287 m, 297605 m/sec, 10350435 t fired, .

Time elapsed: 11 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-07-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-05: EFAG 0 0 1 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-07: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-08: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-09: AGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-13: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-14: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-15: CTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
46 AGEF EXCL 15/257 19/32 BusinessProcesses-PT-07-CTLFireability-05 4589567 m, 301456 m/sec, 15533691 t fired, .

Time elapsed: 16 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-07-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-05: EFAG 0 0 1 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-07: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-08: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-09: AGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-13: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-14: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-15: CTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
46 AGEF EXCL 20/257 24/32 BusinessProcesses-PT-07-CTLFireability-05 6071185 m, 296323 m/sec, 20643391 t fired, .

Time elapsed: 21 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-07-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-05: EFAG 0 0 1 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-07: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-08: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-09: AGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-13: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-14: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-15: CTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
46 AGEF EXCL 25/257 30/32 BusinessProcesses-PT-07-CTLFireability-05 7448733 m, 275509 m/sec, 25695324 t fired, .

Time elapsed: 26 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 15
lola: CANCELED task # 46 (type EXCL) for BusinessProcesses-PT-07-CTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-07-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-05: EFAG 0 0 0 0 1 0 1 0
BusinessProcesses-PT-07-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-07: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-08: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-09: AGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-13: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-14: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-07-CTLFireability-15: CTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 31 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 15
lola: LAUNCH task # 43 (type EXCL) for 42 BusinessProcesses-PT-07-CTLFireability-15
lola: time limit : 274 sec
lola: memory limit: 32 pages
lola: FINISHED task # 43 (type EXCL) for BusinessProcesses-PT-07-CTLFireability-15
lola: result : true
lola: markings : 1
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 40 (type EXCL) for 39 BusinessProcesses-PT-07-CTLFireability-14
lola: time limit : 297 sec
lola: memory limit: 32 pages
lola: FINISHED task # 40 (type EXCL) for BusinessProcesses-PT-07-CTLFireability-14
lola: result : true
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 37 (type EXCL) for 36 BusinessProcesses-PT-07-CTLFireability-13
lola: time limit : 324 sec
lola: memory limit: 32 pages
lola: FINISHED task # 37 (type EXCL) for BusinessProcesses-PT-07-CTLFireability-13
lola: result : false
lola: markings : 165
lola: fired transitions : 489
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 31 (type EXCL) for 30 BusinessProcesses-PT-07-CTLFireability-11
lola: time limit : 356 sec
lola: memory limit: 32 pages
lola: FINISHED task # 31 (type EXCL) for BusinessProcesses-PT-07-CTLFireability-11
lola: result : false
lola: markings : 172
lola: fired transitions : 474
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 28 (type EXCL) for 27 BusinessProcesses-PT-07-CTLFireability-10
lola: time limit : 396 sec
lola: memory limit: 32 pages
lola: FINISHED task # 28 (type EXCL) for BusinessProcesses-PT-07-CTLFireability-10
lola: result : false
lola: markings : 7490
lola: fired transitions : 8576
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 22 (type EXCL) for 21 BusinessProcesses-PT-07-CTLFireability-08
lola: time limit : 446 sec
lola: memory limit: 32 pages
lola: FINISHED task # 22 (type EXCL) for BusinessProcesses-PT-07-CTLFireability-08
lola: result : true
lola: markings : 114016
lola: fired transitions : 591919
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 16 (type EXCL) for 15 BusinessProcesses-PT-07-CTLFireability-06
lola: time limit : 509 sec
lola: memory limit: 32 pages
lola: FINISHED task # 16 (type EXCL) for BusinessProcesses-PT-07-CTLFireability-06
lola: result : true
lola: markings : 163
lola: fired transitions : 487
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 BusinessProcesses-PT-07-CTLFireability-04
lola: time limit : 594 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for BusinessProcesses-PT-07-CTLFireability-04
lola: result : true
lola: markings : 165
lola: fired transitions : 472
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-07-CTLFireability-00
lola: time limit : 713 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BusinessProcesses-PT-07-CTLFireability-00
lola: result : false
lola: markings : 4892
lola: fired transitions : 10431
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 25 (type EXCL) for 24 BusinessProcesses-PT-07-CTLFireability-09
lola: time limit : 892 sec
lola: memory limit: 32 pages
lola: FINISHED task # 25 (type EXCL) for BusinessProcesses-PT-07-CTLFireability-09
lola: result : false
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 34 (type EXCL) for 33 BusinessProcesses-PT-07-CTLFireability-12
lola: time limit : 1189 sec
lola: memory limit: 32 pages
lola: FINISHED task # 34 (type EXCL) for BusinessProcesses-PT-07-CTLFireability-12
lola: result : true
lola: markings : 109
lola: fired transitions : 428
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 BusinessProcesses-PT-07-CTLFireability-03
lola: time limit : 1784 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for BusinessProcesses-PT-07-CTLFireability-03
lola: result : true
lola: markings : 658
lola: fired transitions : 1841
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 19 (type EXCL) for 18 BusinessProcesses-PT-07-CTLFireability-07
lola: time limit : 3568 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-00: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF
BusinessProcesses-PT-07-CTLFireability-03: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-04: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-06: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-08: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-09: AGEF false tscc_search
BusinessProcesses-PT-07-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-12: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-13: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-14: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-15: CTL true CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-07-CTLFireability-05: EFAG 0 0 0 0 1 0 1 0
BusinessProcesses-PT-07-CTLFireability-07: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 4/3568 4/32 BusinessProcesses-PT-07-CTLFireability-07 797548 m, 159509 m/sec, 3819139 t fired, .

Time elapsed: 36 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-00: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF
BusinessProcesses-PT-07-CTLFireability-03: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-04: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-06: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-08: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-09: AGEF false tscc_search
BusinessProcesses-PT-07-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-12: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-13: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-14: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-15: CTL true CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-07-CTLFireability-05: EFAG 0 0 0 0 1 0 1 0
BusinessProcesses-PT-07-CTLFireability-07: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 9/3568 9/32 BusinessProcesses-PT-07-CTLFireability-07 1792056 m, 198901 m/sec, 8756046 t fired, .

Time elapsed: 41 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-00: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF
BusinessProcesses-PT-07-CTLFireability-03: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-04: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-06: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-08: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-09: AGEF false tscc_search
BusinessProcesses-PT-07-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-12: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-13: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-14: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-15: CTL true CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-07-CTLFireability-05: EFAG 0 0 0 0 1 0 1 0
BusinessProcesses-PT-07-CTLFireability-07: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 14/3568 13/32 BusinessProcesses-PT-07-CTLFireability-07 2676317 m, 176852 m/sec, 14089620 t fired, .

Time elapsed: 46 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-00: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF
BusinessProcesses-PT-07-CTLFireability-03: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-04: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-06: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-08: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-09: AGEF false tscc_search
BusinessProcesses-PT-07-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-12: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-13: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-14: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-15: CTL true CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-07-CTLFireability-05: EFAG 0 0 0 0 1 0 1 0
BusinessProcesses-PT-07-CTLFireability-07: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 19/3568 17/32 BusinessProcesses-PT-07-CTLFireability-07 3469774 m, 158691 m/sec, 19249741 t fired, .

Time elapsed: 51 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-00: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF
BusinessProcesses-PT-07-CTLFireability-03: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-04: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-06: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-08: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-09: AGEF false tscc_search
BusinessProcesses-PT-07-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-12: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-13: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-14: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-15: CTL true CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-07-CTLFireability-05: EFAG 0 0 0 0 1 0 1 0
BusinessProcesses-PT-07-CTLFireability-07: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 24/3568 21/32 BusinessProcesses-PT-07-CTLFireability-07 4311564 m, 168358 m/sec, 24387898 t fired, .

Time elapsed: 56 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-00: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF
BusinessProcesses-PT-07-CTLFireability-03: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-04: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-06: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-08: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-09: AGEF false tscc_search
BusinessProcesses-PT-07-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-12: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-13: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-14: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-15: CTL true CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-07-CTLFireability-05: EFAG 0 0 0 0 1 0 1 0
BusinessProcesses-PT-07-CTLFireability-07: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 29/3568 25/32 BusinessProcesses-PT-07-CTLFireability-07 5196071 m, 176901 m/sec, 29688535 t fired, .

Time elapsed: 61 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-00: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF
BusinessProcesses-PT-07-CTLFireability-03: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-04: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-06: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-08: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-09: AGEF false tscc_search
BusinessProcesses-PT-07-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-12: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-13: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-14: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-15: CTL true CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-07-CTLFireability-05: EFAG 0 0 0 0 1 0 1 0
BusinessProcesses-PT-07-CTLFireability-07: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 34/3568 29/32 BusinessProcesses-PT-07-CTLFireability-07 6031126 m, 167011 m/sec, 34804986 t fired, .

Time elapsed: 66 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-00: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF
BusinessProcesses-PT-07-CTLFireability-03: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-04: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-06: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-08: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-09: AGEF false tscc_search
BusinessProcesses-PT-07-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-12: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-13: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-14: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-15: CTL true CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-07-CTLFireability-05: EFAG 0 0 0 0 1 0 1 0
BusinessProcesses-PT-07-CTLFireability-07: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 39/3568 32/32 BusinessProcesses-PT-07-CTLFireability-07 6828748 m, 159524 m/sec, 39815230 t fired, .

Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 15
lola: CANCELED task # 19 (type EXCL) for BusinessProcesses-PT-07-CTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-00: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF
BusinessProcesses-PT-07-CTLFireability-03: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-04: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-06: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-08: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-09: AGEF false tscc_search
BusinessProcesses-PT-07-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-12: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-13: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-14: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-15: CTL true CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-07-CTLFireability-05: EFAG 0 0 0 0 1 0 1 0
BusinessProcesses-PT-07-CTLFireability-07: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 76 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 15
lola: Portfolio finished: no open tasks 15

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-CTLFireability-00: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-01: AXAG false state space /EXEF
BusinessProcesses-PT-07-CTLFireability-03: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-04: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-05: EFAG unknown AGGR
BusinessProcesses-PT-07-CTLFireability-06: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-07: CTL unknown AGGR
BusinessProcesses-PT-07-CTLFireability-08: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-09: AGEF false tscc_search
BusinessProcesses-PT-07-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-12: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-13: CTL false CTL model checker
BusinessProcesses-PT-07-CTLFireability-14: CTL true CTL model checker
BusinessProcesses-PT-07-CTLFireability-15: CTL true CTL model checker


Time elapsed: 76 secs. Pages in use: 32

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-07"
export BK_EXAMINATION="CTLFireability"
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-07, examination is CTLFireability"
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-167813692600498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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