About the Execution of LoLA for BusinessProcesses-PT-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13071.180 | 3600000.00 | 5540812.00 | 7138.70 | TFTFTFFTTTFTFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
...................
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 3.1K May 29 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 29 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 28 11:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 28 11:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 09:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 09:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K May 28 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.9K May 27 05:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 27 05:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 26 06:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 26 06:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 3 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 157K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BusinessProcesses-PT-15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145600313
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1528032676050
info: Time: 3600 - MCC
===========================================================================================
prep: translating BusinessProcesses-PT-15 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating BusinessProcesses-PT-15 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ BusinessProcesses-PT-15 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1196/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 630
lola: finding significant places
lola: 630 places, 566 transitions, 528 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 697 transition conflict sets
lola: TASK
lola: reading formula from BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p568)
lola: LP says that atomic proposition is always false: (3 <= p447)
lola: LP says that atomic proposition is always false: (2 <= p308)
lola: LP says that atomic proposition is always false: (2 <= p449)
lola: LP says that atomic proposition is always false: (2 <= p13)
lola: LP says that atomic proposition is always false: (3 <= p155)
lola: LP says that atomic proposition is always false: (2 <= p239)
lola: LP says that atomic proposition is always true: (p249 <= p146)
lola: LP says that atomic proposition is always false: (3 <= p481)
lola: LP says that atomic proposition is always false: (3 <= p331)
lola: LP says that atomic proposition is always false: (2 <= p187)
lola: LP says that atomic proposition is always false: (3 <= p540)
lola: LP says that atomic proposition is always false: (2 <= p177)
lola: LP says that atomic proposition is always false: (2 <= p22)
lola: LP says that atomic proposition is always false: (2 <= p333)
lola: LP says that atomic proposition is always false: (3 <= p543)
lola: A (G (((p531 <= p68) OR (p67 <= p75)))) : E (F (())) : E (F (((p597 <= p77) AND (p538 + 1 <= p185)))) : A (G ((((1 <= p392) OR (p171 <= p579) OR (1 <= p276))))) : E (F ((p31 + 1 <= p195))) : E (F (((p380 + 1 <= p531) AND (p79 + 1 <= p376)))) : A (G ((((p136 <= p151) AND (p348 <= p338) AND (p24 <= p386) AND (p176 <= p90))))) : E (F (((1 <= p203)))) : A (G (((p548 <= p575) OR (p345 <= p602) OR (p494 <= 0) OR (p372 + 1 <= p33)))) : A (G (())) : A (G ((p117 <= p120))) : E (F ((((1 <= p457))))) : E (F (())) : A (G ((((p17 <= p145) AND (p299 <= p207) AND ((p229 <= p558) OR (p170 <= p94)))))) : A (G ((((p261 <= 0) AND (p531 + 1 <= p284)) OR (p77 <= p202)))) : A (G (()))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p203))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((1 <= p203))))
lola: processed formula length: 21
lola: 13 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((1 <= p203))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p457)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((1 <= p457)))))
lola: processed formula length: 23
lola: 13 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((1 <= p457)))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-15-ReachabilityCardinality-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 67 markings, 66 edges
lola: ========================================
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p117 <= p120)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p117 <= p120)))
lola: processed formula length: 22
lola: 14 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p120 + 1 <= p117)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-15-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-15-ReachabilityCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14423 markings, 16097 edges
lola: ========================================
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p31 + 1 <= p195)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((p31 + 1 <= p195)))
lola: processed formula length: 25
lola: 13 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (p31 + 1 <= p195)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-15-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 397 markings, 417 edges
lola: ========================================
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p531 <= p68) OR (p67 <= p75))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((p531 <= p68) OR (p67 <= p75))))
lola: processed formula length: 40
lola: 14 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p68 + 1 <= p531) AND (p75 + 1 <= p67))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-15-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-15-ReachabilityCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 365081 markings, 435860 edges, 73016 markings/sec, 0 secs
lola: sara is running 5 secs || 731575 markings, 905697 edges, 73299 markings/sec, 5 secs
lola: sara is running 10 secs || 1104371 markings, 1369662 edges, 74559 markings/sec, 10 secs
lola: sara is running 15 secs || 1473259 markings, 1831982 edges, 73778 markings/sec, 15 secs
lola: sara is running 20 secs || 1842106 markings, 2297024 edges, 73769 markings/sec, 20 secs
lola: sara is running 25 secs || 2217891 markings, 2758240 edges, 75157 markings/sec, 25 secs
lola: sara is running 30 secs || 2582643 markings, 3230088 edges, 72950 markings/sec, 30 secs
lola: sara is running 35 secs || 2960066 markings, 3686799 edges, 75485 markings/sec, 35 secs
lola: sara is running 40 secs || 3328087 markings, 4146702 edges, 73604 markings/sec, 40 secs
lola: sara is running 45 secs || 3692918 markings, 4607536 edges, 72966 markings/sec, 45 secs
lola: sara is running 50 secs || 4065855 markings, 5061235 edges, 74587 markings/sec, 50 secs
lola: sara is running 55 secs || 4427037 markings, 5528979 edges, 72236 markings/sec, 55 secs
lola: sara is running 60 secs || 4799637 markings, 5983330 edges, 74520 markings/sec, 60 secs
lola: sara is running 65 secs || 5166169 markings, 6445848 edges, 73306 markings/sec, 65 secs
lola: sara is running 70 secs || 5536302 markings, 6909906 edges, 74027 markings/sec, 70 secs
lola: sara is running 75 secs || 5910193 markings, 7361605 edges, 74778 markings/sec, 75 secs
lola: sara is running 80 secs || 6272368 markings, 7828062 edges, 72435 markings/sec, 80 secs
lola: sara is running 85 secs || 6640307 markings, 8282614 edges, 73588 markings/sec, 85 secs
lola: sara is running 90 secs || 7003559 markings, 8737476 edges, 72650 markings/sec, 90 secs
lola: sara is running 95 secs || 7368111 markings, 9196527 edges, 72910 markings/sec, 95 secs
lola: sara is running 100 secs || 7737191 markings, 9652109 edges, 73816 markings/sec, 100 secs
lola: sara is running 105 secs || 8097463 markings, 10116739 edges, 72054 markings/sec, 105 secs
lola: sara is running 110 secs || 8477212 markings, 10576378 edges, 75950 markings/sec, 110 secs
lola: sara is running 115 secs || 8848522 markings, 11040197 edges, 74262 markings/sec, 115 secs
lola: sara is running 120 secs || 9217653 markings, 11505478 edges, 73826 markings/sec, 120 secs
lola: sara is running 125 secs || 9592559 markings, 11964083 edges, 74981 markings/sec, 125 secs
lola: sara is running 130 secs || 9954553 markings, 12434187 edges, 72399 markings/sec, 130 secs
lola: sara is running 135 secs || 10330404 markings, 12887423 edges, 75170 markings/sec, 135 secs
lola: sara is running 140 secs || 10697233 markings, 13353685 edges, 73366 markings/sec, 140 secs
lola: sara is running 145 secs || 11068595 markings, 13817089 edges, 74272 markings/sec, 145 secs
lola: sara is running 150 secs || 11439882 markings, 14268772 edges, 74257 markings/sec, 150 secs
lola: sara is running 155 secs || 11800031 markings, 14733219 edges, 72030 markings/sec, 155 secs
lola: sara is running 160 secs || 12168879 markings, 15184492 edges, 73770 markings/sec, 160 secs
lola: sara is running 165 secs || 12531541 markings, 15640055 edges, 72532 markings/sec, 165 secs
lola: sara is running 170 secs || 12896023 markings, 16099125 edges, 72896 markings/sec, 170 secs
lola: sara is running 175 secs || 13263530 markings, 16555512 edges, 73501 markings/sec, 175 secs
lola: sara is running 180 secs || 13623325 markings, 17017096 edges, 71959 markings/sec, 180 secs
lola: sara is running 185 secs || 13998960 markings, 17471864 edges, 75127 markings/sec, 185 secs
lola: sara is running 190 secs || 14364007 markings, 17927225 edges, 73009 markings/sec, 190 secs
lola: sara is running 195 secs || 14727665 markings, 18385863 edges, 72732 markings/sec, 195 secs
lola: sara is running 200 secs || 15097080 markings, 18837995 edges, 73883 markings/sec, 200 secs
lola: sara is running 205 secs || 15455135 markings, 19302695 edges, 71611 markings/sec, 205 secs
lola: sara is running 210 secs || 15825365 markings, 19750398 edges, 74046 markings/sec, 210 secs
lola: sara is running 215 secs || 16140932 markings, 20150402 edges, 63113 markings/sec, 215 secs
lola: sara is running 220 secs || 16499617 markings, 20605262 edges, 71737 markings/sec, 220 secs
lola: sara is running 225 secs || 16869726 markings, 21064877 edges, 74022 markings/sec, 225 secs
lola: sara is running 230 secs || 17230821 markings, 21533980 edges, 72219 markings/sec, 230 secs
lola: sara is running 235 secs || 17590109 markings, 22000432 edges, 71858 markings/sec, 235 secs
lola: sara is running 240 secs || 17958407 markings, 22461460 edges, 73660 markings/sec, 240 secs
lola: sara is running 245 secs || 18317876 markings, 22930678 edges, 71894 markings/sec, 245 secs
lola: sara is running 250 secs || 18678673 markings, 23396926 edges, 72159 markings/sec, 250 secs
lola: sara is running 255 secs || 19045245 markings, 23860985 edges, 73314 markings/sec, 255 secs
lola: sara is running 260 secs || 19404391 markings, 24330599 edges, 71829 markings/sec, 260 secs
lola: sara is running 265 secs || 19768220 markings, 24795208 edges, 72766 markings/sec, 265 secs
lola: sara is running 270 secs || 20133793 markings, 25251119 edges, 73115 markings/sec, 270 secs
lola: sara is running 275 secs || 20491421 markings, 25716472 edges, 71526 markings/sec, 275 secs
lola: sara is running 280 secs || 20847572 markings, 26178659 edges, 71230 markings/sec, 280 secs
lola: sara is running 285 secs || 21212130 markings, 26636628 edges, 72912 markings/sec, 285 secs
lola: sara is running 290 secs || 21569171 markings, 27102644 edges, 71408 markings/sec, 290 secs
lola: sara is running 295 secs || 21926668 markings, 27563908 edges, 71499 markings/sec, 295 secs
lola: sara is running 300 secs || 22289306 markings, 28024305 edges, 72528 markings/sec, 300 secs
lola: sara is running 305 secs || 22645538 markings, 28489356 edges, 71246 markings/sec, 305 secs
lola: sara is running 310 secs || 23006433 markings, 28950013 edges, 72179 markings/sec, 310 secs
lola: sara is running 315 secs || 23375733 markings, 29410935 edges, 73860 markings/sec, 315 secs
lola: sara is running 320 secs || 23736531 markings, 29880604 edges, 72160 markings/sec, 320 secs
lola: sara is running 325 secs || 24096847 markings, 30347433 edges, 72063 markings/sec, 325 secs
lola: sara is running 330 secs || 24464544 markings, 30810069 edges, 73539 markings/sec, 330 secs
lola: sara is running 335 secs || 24825090 markings, 31280731 edges, 72109 markings/sec, 335 secs
lola: sara is running 340 secs || 25186892 markings, 31747379 edges, 72360 markings/sec, 340 secs
lola: sara is running 345 secs || 25546512 markings, 32204116 edges, 71924 markings/sec, 345 secs
lola: sara is running 350 secs || 25902258 markings, 32669207 edges, 71149 markings/sec, 350 secs
lola: sara is running 355 secs || 26266335 markings, 33131622 edges, 72815 markings/sec, 355 secs
lola: sara is running 360 secs || 26636672 markings, 33595641 edges, 74067 markings/sec, 360 secs
lola: sara is running 365 secs || 26999077 markings, 34067494 edges, 72481 markings/sec, 365 secs
lola: sara is running 370 secs || 27361046 markings, 34534383 edges, 72394 markings/sec, 370 secs
lola: sara is running 375 secs || 27728989 markings, 34999359 edges, 73589 markings/sec, 375 secs
lola: sara is running 380 secs || 28088744 markings, 35470277 edges, 71951 markings/sec, 380 secs
lola: sara is running 385 secs || 28451906 markings, 35935925 edges, 72632 markings/sec, 385 secs
lola: sara is running 390 secs || 28817608 markings, 36403695 edges, 73140 markings/sec, 390 secs
lola: sara is running 395 secs || 29177027 markings, 36874368 edges, 71884 markings/sec, 395 secs
lola: sara is running 400 secs || 29545904 markings, 37337526 edges, 73775 markings/sec, 400 secs
lola: sara is running 405 secs || 29910279 markings, 37796005 edges, 72875 markings/sec, 405 secs
lola: sara is running 410 secs || 30267894 markings, 38261817 edges, 71523 markings/sec, 410 secs
lola: sara is running 415 secs || 30626604 markings, 38723637 edges, 71742 markings/sec, 415 secs
lola: sara is running 420 secs || 30988746 markings, 39183793 edges, 72428 markings/sec, 420 secs
lola: sara is running 425 secs || 31345429 markings, 39649429 edges, 71337 markings/sec, 425 secs
lola: sara is running 430 secs || 31705177 markings, 40110062 edges, 71950 markings/sec, 430 secs
lola: sara is running 435 secs || 32066233 markings, 40572704 edges, 72211 markings/sec, 435 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown yes unknown unknown yes unknown yes no yes no unknown unknown yes
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown no unknown unknown yes unknown unknown yes unknown yes no yes no unknown unknown yes
lola: memory consumption: 1959628 KB
lola: time consumption: 448 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p380 + 1 <= p531) AND (p79 + 1 <= p376))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p380 + 1 <= p531) AND (p79 + 1 <= p376))))
lola: processed formula length: 50
lola: 13 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p380 + 1 <= p531) AND (p79 + 1 <= p376))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-15-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-15-ReachabilityCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p597 <= p77) AND (p538 + 1 <= p185))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p597 <= p77) AND (p538 + 1 <= p185))))
lola: processed formula length: 46
lola: 13 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p597 <= p77) AND (p538 + 1 <= p185))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-15-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-15-ReachabilityCardinality-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 581 markings, 616 edges
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p392) OR (p171 <= p579) OR (1 <= p276)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((1 <= p392) OR (p171 <= p579) OR (1 <= p276)))))
lola: processed formula length: 58
lola: 14 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((p392 <= 0) AND (p579 + 1 <= p171) AND (p276 <= 0)))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-15-ReachabilityCardinality-11-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 166 markings, 165 edges
lola: ========================================
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p261 <= 0) AND (p531 + 1 <= p284)) OR (p77 <= p202))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((p261 <= 0) AND (p531 + 1 <= p284)) OR (p77 <= p202))))
lola: processed formula length: 64
lola: 14 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: ========================================
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1040 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p548 <= p575) OR (p345 <= p602) OR (p494 <= 0) OR (p372 + 1 <= p33))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((p548 <= p575) OR (p345 <= p602) OR (p494 <= 0) OR (p372 + 1 <= p33))))
lola: processed formula length: 81
lola: 14 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p575 + 1 <= p548) AND (p602 + 1 <= p345) AND (1 <= p494) AND (p33 <= p372))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-15-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-15-ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p136 <= p151) AND (p348 <= p338) AND (p24 <= p386) AND (p176 <= p90)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((p136 <= p151) AND (p348 <= p338) AND (p24 <= p386) AND (p176 <= p90)))))
lola: processed formula length: 81
lola: 14 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((p151 + 1 <= p136) OR (p338 + 1 <= p348) OR (p386 + 1 <= p24) OR (p90 + 1 <= p176)))
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-15-ReachabilityCardinality-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 35 markings, 36 edges
lola:
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 3121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p17 <= p145) AND (p299 <= p207) AND ((p229 <= p558) OR (p170 <= p94))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((p17 <= p145) AND (p299 <= p207) AND ((p229 <= p558) OR (p170 <= p94))))))
lola: processed formula length: 83
lola: 14 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((p145 + 1 <= p17) OR (p207 + 1 <= p299) OR ((p558 + 1 <= p229) AND (p94 + 1 <= p170))))
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-15-ReachabilityCardinality-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 27 edges
lola: state equation: calling and running sara
lola: ========================================
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G (((p531 <= p68) OR (p67 <= p75))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: sara: try reading problem file BusinessProcesses-PT-15-ReachabilityCardinality-15-0.sara.
processed formula: A (G (((p531 <= p68) OR (p67 <= p75))))
lola: processed formula length: 40
lola: 14 rewrites
lola: closed formula file BusinessProcesses-PT-15-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p68 + 1 <= p531) AND (p75 + 1 <= p67))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-15-ReachabilityCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-15-ReachabilityCardinality-16-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 363278 markings, 433635 edges, 72656 markings/sec, 0 secs
lola: sara is running 5 secs || 728866 markings, 902066 edges, 73118 markings/sec, 5 secs
lola: sara is running 10 secs || 1045994 markings, 1297143 edges, 63426 markings/sec, 10 secs
lola: sara is running 15 secs || 1415763 markings, 1759893 edges, 73954 markings/sec, 15 secs
lola: sara is running 20 secs || 1779909 markings, 2223972 edges, 72829 markings/sec, 20 secs
lola: sara is running 25 secs || 2157343 markings, 2679220 edges, 75487 markings/sec, 25 secs
lola: sara is running 30 secs || 2521043 markings, 3149569 edges, 72740 markings/sec, 30 secs
lola: sara is running 35 secs || 2894517 markings, 3605564 edges, 74695 markings/sec, 35 secs
lola: sara is running 40 secs || 3261582 markings, 4061829 edges, 73413 markings/sec, 40 secs
lola: sara is running 45 secs || 3622471 markings, 4523182 edges, 72178 markings/sec, 45 secs
lola: sara is running 50 secs || 3993418 markings, 4968458 edges, 74189 markings/sec, 50 secs
lola: sara is running 55 secs || 4354314 markings, 5431893 edges, 72179 markings/sec, 55 secs
lola: sara is running 60 secs || 4718944 markings, 5886405 edges, 72926 markings/sec, 60 secs
lola: sara is running 65 secs || 5081803 markings, 6341340 edges, 72572 markings/sec, 65 secs
lola: sara is running 70 secs || 5443174 markings, 6799237 edges, 72274 markings/sec, 70 secs
lola: sara is running 75 secs || 5815548 markings, 7245689 edges, 74475 markings/sec, 75 secs
lola: sara is running 80 secs || 6175597 markings, 7701635 edges, 72010 markings/sec, 80 secs
lola: sara is running 85 secs || 6537576 markings, 8155446 edges, 72396 markings/sec, 85 secs
lola: sara is running 90 secs || 6900686 markings, 8607832 edges, 72622 markings/sec, 90 secs
lola: sara is running 95 secs || 7257756 markings, 9064646 edges, 71414 markings/sec, 95 secs
lola: sara is running 100 secs || 7630242 markings, 9512849 edges, 74497 markings/sec, 100 secs
lola: sara is running 105 secs || 7991859 markings, 9978246 edges, 72323 markings/sec, 105 secs
lola: sara is running 110 secs || 8364515 markings, 10437925 edges, 74531 markings/sec, 110 secs
lola: sara is running 115 secs || 8738187 markings, 10898281 edges, 74734 markings/sec, 115 secs
lola: sara is running 120 secs || 9103544 markings, 11367809 edges, 73071 markings/sec, 120 secs
lola: sara is running 125 secs || 9479934 markings, 11821192 edges, 75278 markings/sec, 125 secs
lola: sara is running 130 secs || 9845384 markings, 12288467 edges, 73090 markings/sec, 130 secs
lola: sara is running 135 secs || 10215685 markings, 12750587 edges, 74060 markings/sec, 135 secs
lola: sara is running 140 secs || 10584075 markings, 13212441 edges, 73678 markings/sec, 140 secs
lola: sara is running 145 secs || 10949889 markings, 13675634 edges, 73163 markings/sec, 145 secs
lola: sara is running 150 secs || 11324715 markings, 14125007 edges, 74965 markings/sec, 150 secs
lola: sara is running 155 secs || 11687104 markings, 14584187 edges, 72478 markings/sec, 155 secs
lola: sara is running 160 secs || 12050466 markings, 15039489 edges, 72672 markings/sec, 160 secs
lola: sara is running 165 secs || 12413970 markings, 15493696 edges, 72701 markings/sec, 165 secs
lola: sara is running 170 secs || 12772249 markings, 15950837 edges, 71656 markings/sec, 170 secs
lola: sara is running 175 secs || 13142697 markings, 16397059 edges, 74090 markings/sec, 175 secs
lola: sara is running 180 secs || 13501863 markings, 16859566 edges, 71833 markings/sec, 180 secs
lola: sara is running 185 secs || 13870613 markings, 17313735 edges, 73750 markings/sec, 185 secs
lola: sara is running 190 secs || 14236955 markings, 17764447 edges, 73268 markings/sec, 190 secs
lola: sara is running 195 secs || 14594904 markings, 18225689 edges, 71590 markings/sec, 195 secs
lola: sara is running 200 secs || 14962739 markings, 18669741 edges, 73567 markings/sec, 200 secs
lola: sara is running 205 secs || 15323155 markings, 19127283 edges, 72083 markings/sec, 205 secs
lola: sara is running 210 secs || 15685691 markings, 19581661 edges, 72507 markings/sec, 210 secs
lola: sara is running 215 secs || 16048084 markings, 20035875 edges, 72479 markings/sec, 215 secs
lola: sara is running 220 secs || 16405396 markings, 20490748 edges, 71462 markings/sec, 220 secs
lola: sara is running 225 secs || 16776455 markings, 20952696 edges, 74212 markings/sec, 225 secs
lola: sara is running 230 secs || 17135549 markings, 21416168 edges, 71819 markings/sec, 230 secs
lola: sara is running 235 secs || 17490839 markings, 21878104 edges, 71058 markings/sec, 235 secs
lola: sara is running 240 secs || 17853701 markings, 22333668 edges, 72572 markings/sec, 240 secs
lola: sara is running 245 secs || 18210540 markings, 22795564 edges, 71368 markings/sec, 245 secs
lola: sara is running 250 secs || 18563844 markings, 23255806 edges, 70661 markings/sec, 250 secs
lola: sara is running 255 secs || 18928577 markings, 23711972 edges, 72947 markings/sec, 255 secs
lola: sara is running 260 secs || 19285220 markings, 24175792 edges, 71329 markings/sec, 260 secs
lola: sara is running 265 secs || 19639276 markings, 24636072 edges, 70811 markings/sec, 265 secs
lola: sara is running 270 secs || 20007012 markings, 25097724 edges, 73547 markings/sec, 270 secs
lola: sara is running 275 secs || 20362257 markings, 25555986 edges, 71049 markings/sec, 275 secs
lola: sara is running 280 secs || 20714217 markings, 26014285 edges, 70392 markings/sec, 280 secs
lola: sara is running 285 secs || 21072304 markings, 26465073 edges, 71617 markings/sec, 285 secs
lola: sara is running 290 secs || 21426053 markings, 26922271 edges, 70750 markings/sec, 290 secs
lola: sara is running 295 secs || 21776687 markings, 27379049 edges, 70127 markings/sec, 295 secs
lola: sara is running 300 secs || 22135757 markings, 27829855 edges, 71814 markings/sec, 300 secs
lola: sara is running 305 secs || 22490040 markings, 28289094 edges, 70857 markings/sec, 305 secs
lola: sara is running 310 secs || 22841541 markings, 28746888 edges, 70300 markings/sec, 310 secs
lola: sara is running 315 secs || 23207831 markings, 29204390 edges, 73258 markings/sec, 315 secs
lola: sara is running 320 secs || 23562369 markings, 29659172 edges, 70908 markings/sec, 320 secs
lola: sara is running 325 secs || 23913417 markings, 30116082 edges, 70210 markings/sec, 325 secs
lola: sara is running 330 secs || 24269520 markings, 30566846 edges, 71221 markings/sec, 330 secs
lola: sara is running 335 secs || 24622794 markings, 31022843 edges, 70655 markings/sec, 335 secs
lola: sara is running 340 secs || 24972634 markings, 31480420 edges, 69968 markings/sec, 340 secs
lola: sara is running 345 secs || 25329351 markings, 31930851 edges, 71343 markings/sec, 345 secs
lola: sara is running 350 secs || 25682404 markings, 32387250 edges, 70611 markings/sec, 350 secs
lola: sara is running 355 secs || 26032518 markings, 32843363 edges, 70023 markings/sec, 355 secs
lola: sara is running 360 secs || 26401336 markings, 33301186 edges, 73764 markings/sec, 360 secs
lola: sara is running 365 secs || 26763629 markings, 33763503 edges, 72459 markings/sec, 365 secs
lola: sara is running 370 secs || 27119668 markings, 34227586 edges, 71208 markings/sec, 370 secs
lola: sara is running 375 secs || 27480540 markings, 34686618 edges, 72174 markings/sec, 375 secs
lola: sara is running 380 secs || 27840536 markings, 35150256 edges, 71999 markings/sec, 380 secs
lola: sara is running 385 secs || 28193511 markings, 35612125 edges, 70595 markings/sec, 385 secs
lola: sara is running 390 secs || 28556124 markings, 36070843 edges, 72523 markings/sec, 390 secs
lola: sara is running 395 secs || 28915320 markings, 36535842 edges, 71839 markings/sec, 395 secs
lola: sara is running 400 secs || 29270516 markings, 36998102 edges, 71039 markings/sec, 400 secs
lola: sara is running 405 secs || 29638140 markings, 37454377 edges, 73525 markings/sec, 405 secs
lola: sara is running 410 secs || 29995993 markings, 37910791 edges, 71571 markings/sec, 410 secs
lola: sara is running 415 secs || 30349269 markings, 38370736 edges, 70655 markings/sec, 415 secs
lola: sara is running 420 secs || 30705792 markings, 38824558 edges, 71305 markings/sec, 420 secs
lola: sara is running 425 secs || 31061105 markings, 39281165 edges, 71063 markings/sec, 425 secs
lola: sara is running 430 secs || 31412496 markings, 39740936 edges, 70278 markings/sec, 430 secs
lola: sara is running 435 secs || 31769912 markings, 40194158 edges, 71483 markings/sec, 435 secs
lola: sara is running 440 secs || 32125414 markings, 40653605 edges, 71100 markings/sec, 440 secs
lola: sara is running 445 secs || 32476527 markings, 41113289 edges, 70223 markings/sec, 445 secs
lola: sara is running 450 secs || 32842465 markings, 41566021 edges, 73188 markings/sec, 450 secs
lola: sara is running 455 secs || 33200927 markings, 42021062 edges, 71692 markings/sec, 455 secs
lola: sara is running 460 secs || 33554820 markings, 42481655 edges, 70779 markings/sec, 460 secs
lola: sara is running 465 secs || 33910296 markings, 42936177 edges, 71095 markings/sec, 465 secs
lola: sara is running 470 secs || 34267103 markings, 43392083 edges, 71361 markings/sec, 470 secs
lola: sara is running 475 secs || 34619717 markings, 43853365 edges, 70523 markings/sec, 475 secs
lola: sara is running 480 secs || 34975988 markings, 44307624 edges, 71254 markings/sec, 480 secs
lola: sara is running 485 secs || 35331973 markings, 44765625 edges, 71197 markings/sec, 485 secs
lola: sara is running 490 secs || 35684385 markings, 45226708 edges, 70482 markings/sec, 490 secs
lola: sara is running 495 secs || 36052634 markings, 45681559 edges, 73650 markings/sec, 495 secs
lola: sara is running 500 secs || 36424345 markings, 46128105 edges, 74342 markings/sec, 500 secs
lola: sara is running 505 secs || 36795285 markings, 46574956 edges, 74188 markings/sec, 505 secs
lola: sara is running 510 secs || 37168020 markings, 47022815 edges, 74547 markings/sec, 510 secs
lola: sara is running 515 secs || 37536234 markings, 47466128 edges, 73643 markings/sec, 515 secs
lola: sara is running 520 secs || 37903928 markings, 47909955 edges, 73539 markings/sec, 520 secs
lola: sara is running 525 secs || 38272548 markings, 48354378 edges, 73724 markings/sec, 525 secs
lola: sara is running 530 secs || 38642119 markings, 48799098 edges, 73914 markings/sec, 530 secs
lola: sara is running 535 secs || 39009573 markings, 49242059 edges, 73491 markings/sec, 535 secs
lola: sara is running 540 secs || 39376474 markings, 49684787 edges, 73380 markings/sec, 540 secs
lola: sara is running 545 secs || 39749682 markings, 50131028 edges, 74642 markings/sec, 545 secs
lola: sara is running 550 secs || 40121133 markings, 50577550 edges, 74290 markings/sec, 550 secs
lola: sara is running 555 secs || 40492665 markings, 51025138 edges, 74306 markings/sec, 555 secs
lola: sara is running 560 secs || 40865567 markings, 51470182 edges, 74580 markings/sec, 560 secs
lola: sara is running 565 secs || 41232300 markings, 51911541 edges, 73347 markings/sec, 565 secs
lola: sara is running 570 secs || 41598703 markings, 52353020 edges, 73281 markings/sec, 570 secs
lola: sara is running 575 secs || 41967337 markings, 52794864 edges, 73727 markings/sec, 575 secs
lola: sara is running 580 secs || 42334488 markings, 53236680 edges, 73430 markings/sec, 580 secs
lola: sara is running 585 secs || 42700495 markings, 53677812 edges, 73201 markings/sec, 585 secs
lola: sara is running 590 secs || 43067657 markings, 54120738 edges, 73432 markings/sec, 590 secs
lola: sara is running 595 secs || 43432614 markings, 54589027 edges, 72991 markings/sec, 595 secs
lola: sara is running 600 secs || 43795859 markings, 55048982 edges, 72649 markings/sec, 600 secs
lola: sara is running 605 secs || 44154018 markings, 55508541 edges, 71632 markings/sec, 605 secs
lola: sara is running 610 secs || 44513067 markings, 55979373 edges, 71810 markings/sec, 610 secs
lola: sara is running 615 secs || 44879256 markings, 56436838 edges, 73238 markings/sec, 615 secs
lola: sara is running 620 secs || 45236035 markings, 56893339 edges, 71356 markings/sec, 620 secs
lola: sara is running 625 secs || 45590792 markings, 57357930 edges, 70951 markings/sec, 625 secs
lola: sara is running 630 secs || 45949955 markings, 57815846 edges, 71833 markings/sec, 630 secs
lola: sara is running 635 secs || 46311362 markings, 58271119 edges, 72281 markings/sec, 635 secs
lola: sara is running 640 secs || 46664277 markings, 58731575 edges, 70583 markings/sec, 640 secs
lola: sara is running 645 secs || 47021089 markings, 59187140 edges, 71362 markings/sec, 645 secs
lola: sara is running 650 secs || 47377717 markings, 59640804 edges, 71326 markings/sec, 650 secs
lola: sara is running 655 secs || 47731146 markings, 60095987 edges, 70686 markings/sec, 655 secs
lola: sara is running 660 secs || 48096219 markings, 60565015 edges, 73015 markings/sec, 660 secs
lola: sara is running 665 secs || 48458917 markings, 61025198 edges, 72540 markings/sec, 665 secs
lola: sara is running 670 secs || 48817368 markings, 61485088 edges, 71690 markings/sec, 670 secs
lola: sara is running 675 secs || 49175900 markings, 61956988 edges, 71706 markings/sec, 675 secs
lola: sara is running 680 secs || 49542167 markings, 62412531 edges, 73253 markings/sec, 680 secs
lola: sara is running 685 secs || 49897471 markings, 62867575 edges, 71061 markings/sec, 685 secs
lola: sara is running 690 secs || 50250797 markings, 63332074 edges, 70665 markings/sec, 690 secs
lola: sara is running 695 secs || 50609404 markings, 63785673 edges, 71721 markings/sec, 695 secs
lola: sara is running 700 secs || 50969904 markings, 64241383 edges, 72100 markings/sec, 700 secs
lola: sara is running 705 secs || 51325029 markings, 64706207 edges, 71025 markings/sec, 705 secs
lola: sara is running 710 secs || 51684055 markings, 65161662 edges, 71805 markings/sec, 710 secs
lola: sara is running 715 secs || 52042056 markings, 65617326 edges, 71600 markings/sec, 715 secs
lola: sara is running 720 secs || 52396967 markings, 66076201 edges, 70982 markings/sec, 720 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 52465410 markings, 66160709 edges
lola: ========================================
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no yes no no yes yes yes no yes no no no yes
lola:
preliminary result: yes no yes no yes no no yes yes yes no yes no no no yes
lola: memory consumption: 25328 KB
lola: time consumption: 1175 seconds
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-15"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is BusinessProcesses-PT-15, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-152749145600313"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
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 ;