About the Execution of LoLA for BusinessProcesses-PT-12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3619.340 | 162355.00 | 325750.00 | 359.70 | TFTFFFTTFTFFFTTF | 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 312K
-rw-r--r-- 1 mcc users 4.0K May 29 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 28 11:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 28 11:18 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.4K May 28 09:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 28 09:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 28 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.8K 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.7K May 27 05:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 27 05:09 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.7K May 26 06:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 26 06:36 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 146K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BusinessProcesses-PT-12, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145500288
=====================================================================
--------------------
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-12-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1528017780002
info: Time: 3600 - MCC
===========================================================================================
prep: translating BusinessProcesses-PT-12 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-12 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ BusinessProcesses-PT-12 @ 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: 1111/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 586
lola: finding significant places
lola: 586 places, 525 transitions, 488 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 646 transition conflict sets
lola: TASK
lola: reading formula from BusinessProcesses-PT-12-ReachabilityFireability.task
lola: E (F (((NOT FIREABLE(t333) OR NOT FIREABLE(t292) OR NOT FIREABLE(t146)) AND FIREABLE(t360)))) : A (G (NOT FIREABLE(t7))) : E (F ((FIREABLE(t230) AND FIREABLE(t385)))) : A (G ((FIREABLE(t212) OR ((NOT FIREABLE(t409) OR NOT FIREABLE(t47)) AND NOT FIREABLE(t337))))) : A (G ((NOT FIREABLE(t327) AND (NOT FIREABLE(t135) OR NOT FIREABLE(t313) OR FIREABLE(t35))))) : A (G (((FIREABLE(t289) OR NOT FIREABLE(t383)) AND NOT FIREABLE(t375)))) : E (F ((((NOT FIREABLE(t164) AND NOT FIREABLE(t256)) OR FIREABLE(t84)) AND (FIREABLE(t363) OR (FIREABLE(t208) AND FIREABLE(t180)) OR FIREABLE(t271) OR FIREABLE(t232) OR FIREABLE(t517) OR FIREABLE(t320))))) : E (F (FIREABLE(t428))) : A (G (((FIREABLE(t255) AND FIREABLE(t47)) OR (FIREABLE(t261) AND FIREABLE(t87)) OR ((FIREABLE(t313) OR FIREABLE(t377) OR NOT FIREABLE(t251)) AND (NOT FIREABLE(t219) OR NOT FIREABLE(t20)))))) : E (F (FIREABLE(t520))) : E (F ((((FIREABLE(t424) AND FIREABLE(t28)) OR (FIREABLE(t205) AND FIREABLE(t140)) OR FIREABLE(t524) OR (FIREABLE(t471) AND FIREABLE(t58))) AND (FIREABLE(t352) OR FIREABLE(t324))))) : A (G ((((NOT FIREABLE(t170) AND FIREABLE(t227)) OR (NOT FIREABLE(t198) AND NOT FIREABLE(t42))) AND (NOT FIREABLE(t408) OR NOT FIREABLE(t402) OR NOT FIREABLE(t488))))) : A (G ((((FIREABLE(t489) OR FIREABLE(t305)) AND NOT FIREABLE(t322)) OR FIREABLE(t483) OR (NOT FIREABLE(t340) AND NOT FIREABLE(t215)) OR FIREABLE(t112)))) : E (F (FIREABLE(t92))) : E (F (FIREABLE(t344))) : E (F (FIREABLE(t491)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t7)))
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 (NOT FIREABLE(t7)))
lola: processed formula length: 24
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: FIREABLE(t7)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-12-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-12-ReachabilityFireability-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: 9579 markings, 12301 edges
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t428)))
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 (FIREABLE(t428)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: FIREABLE(t428)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-12-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 71 markings, 70 edges
lola: ========================================
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t520)))
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 (FIREABLE(t520)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: FIREABLE(t520)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-12-ReachabilityFireability-2-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 67 markings, 66 edges
lola: ========================================
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-9 TRUE 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: E (F (FIREABLE(t92)))
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 (FIREABLE(t92)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: FIREABLE(t92)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-12-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-12-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9580 markings, 12302 edges
lola: ========================================
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-13 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 (FIREABLE(t344)))
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 (FIREABLE(t344)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: FIREABLE(t344)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-12-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-12-ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9569 markings, 12291 edges
lola: ========================================
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-14 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 (FIREABLE(t491)))
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 (FIREABLE(t491)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: FIREABLE(t491)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-12-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-12-ReachabilityFireability-5-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-12-ReachabilityFireability-15 FALSE 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: E (F ((FIREABLE(t230) AND FIREABLE(t385))))
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 ((FIREABLE(t230) AND FIREABLE(t385))))
lola: processed formula length: 43
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: (FIREABLE(t230) AND FIREABLE(t385))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-12-ReachabilityFireability-6-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: 56 markings, 55 edges
lola: ========================================
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2 TRUE 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: A (G (((FIREABLE(t289) OR NOT FIREABLE(t383)) AND NOT FIREABLE(t375))))
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 (((FIREABLE(t289) OR NOT FIREABLE(t383)) AND NOT FIREABLE(t375))))
lola: processed formula length: 72
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: ((NOT FIREABLE(t289) AND FIREABLE(t383)) OR FIREABLE(t375))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-12-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 34 markings, 33 edges
lola: ========================================
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t333) OR NOT FIREABLE(t292) OR NOT FIREABLE(t146)) AND FIREABLE(t360))))
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 (((NOT FIREABLE(t333) OR NOT FIREABLE(t292) OR NOT FIREABLE(t146)) AND FIREABLE(t360))))
lola: processed formula length: 95
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: ((NOT FIREABLE(t333) OR NOT FIREABLE(t292) OR NOT FIREABLE(t146)) AND FIREABLE(t360))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-12-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-12-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9576 markings, 12298 edges
lola: ========================================
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t212) OR ((NOT FIREABLE(t409) OR NOT FIREABLE(t47)) AND NOT FIREABLE(t337)))))
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 ((FIREABLE(t212) OR ((NOT FIREABLE(t409) OR NOT FIREABLE(t47)) AND NOT FIREABLE(t337)))))
lola: processed formula length: 96
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: (NOT FIREABLE(t212) AND ((FIREABLE(t409) AND FIREABLE(t47)) OR FIREABLE(t337)))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-12-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-12-ReachabilityFireability-9-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: 9479 markings, 12193 edges
lola: ========================================
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t327) AND (NOT FIREABLE(t135) OR NOT FIREABLE(t313) OR FIREABLE(t35)))))
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 ((NOT FIREABLE(t327) AND (NOT FIREABLE(t135) OR NOT FIREABLE(t313) OR FIREABLE(t35)))))
lola: processed formula length: 94
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: (FIREABLE(t327) OR (FIREABLE(t135) AND FIREABLE(t313) AND NOT FIREABLE(t35)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-12-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-12-ReachabilityFireability-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 406 markings, 697 edges
lola: ========================================
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t489) OR FIREABLE(t305)) AND NOT FIREABLE(t322)) OR FIREABLE(t483) OR (NOT FIREABLE(t340) AND NOT FIREABLE(t215)) OR FIREABLE(t112))))
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 ((((FIREABLE(t489) OR FIREABLE(t305)) AND NOT FIREABLE(t322)) OR FIREABLE(t483) OR (NOT FIREABLE(t340) AND NOT FIREABLE(t215)) OR FIREABLE(t112))))
lola: processed formula length: 156
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: (((NOT FIREABLE(t489) AND NOT FIREABLE(t305)) OR FIREABLE(t322)) AND NOT FIREABLE(t483) AND (FIREABLE(t340) OR FIREABLE(t215)) AND NOT FIREABLE(t112))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 33 edges
lola: ========================================
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t170) AND FIREABLE(t227)) OR (NOT FIREABLE(t198) AND NOT FIREABLE(t42))) AND (NOT FIREABLE(t408) OR NOT FIREABLE(t402) OR NOT FIREABLE(t488)))))
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 ((((NOT FIREABLE(t170) AND FIREABLE(t227)) OR (NOT FIREABLE(t198) AND NOT FIREABLE(t42))) AND (NOT FIREABLE(t408) OR NOT FIREABLE(t402) OR NOT FIREABLE(t488)))))
lola: processed formula length: 169
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: (((FIREABLE(t170) OR NOT FIREABLE(t227)) AND (FIREABLE(t198) OR FIREABLE(t42))) OR (FIREABLE(t408) AND FIREABLE(t402) AND FIREABLE(t488)))
lola: state equation: Generated DNF with 13 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 28 edges
lola: state equation: write sara problem file to BusinessProcesses-PT-12-ReachabilityFireability-12-0.sara
lola: ========================================
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t424) AND FIREABLE(t28)) OR (FIREABLE(t205) AND FIREABLE(t140)) OR FIREABLE(t524) OR (FIREABLE(t471) AND FIREABLE(t58))) AND (FIREABLE(t352) OR FIREABLE(t324)))))
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 ((((FIREABLE(t424) AND FIREABLE(t28)) OR (FIREABLE(t205) AND FIREABLE(t140)) OR FIREABLE(t524) OR (FIREABLE(t471) AND FIREABLE(t58))) AND (FIREABLE(t352) OR FIREABLE(t324)))))
lola: processed formula length: 184
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: (((FIREABLE(t424) AND FIREABLE(t28)) OR (FIREABLE(t205) AND FIREABLE(t140)) OR FIREABLE(t524) OR (FIREABLE(t471) AND FIREABLE(t58))) AND (FIREABLE(t352) OR FIREABLE(t324)))
lola: state equation: Generated DNF with 34 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-12-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-12-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 383254 markings, 524296 edges, 76651 markings/sec, 0 secs
lola: sara is running 5 secs || 746237 markings, 1023652 edges, 72597 markings/sec, 5 secs
lola: sara is running 10 secs || 1136715 markings, 1569303 edges, 78096 markings/sec, 10 secs
lola: sara is running 15 secs || 1537492 markings, 2094294 edges, 80155 markings/sec, 15 secs
lola: sara is running 20 secs || 1932267 markings, 2626673 edges, 78955 markings/sec, 20 secs
lola: sara is running 25 secs || 2321339 markings, 3161897 edges, 77814 markings/sec, 25 secs
lola: sara is running 30 secs || 2708758 markings, 3703559 edges, 77484 markings/sec, 30 secs
lola: sara is running 35 secs || 3105776 markings, 4225161 edges, 79404 markings/sec, 35 secs
lola: sara is running 40 secs || 3499020 markings, 4754745 edges, 78649 markings/sec, 40 secs
lola: sara is running 45 secs || 3888032 markings, 5287823 edges, 77802 markings/sec, 45 secs
lola: sara is running 50 secs || 4273167 markings, 5828108 edges, 77027 markings/sec, 50 secs
lola: sara is running 55 secs || 4667482 markings, 6347750 edges, 78863 markings/sec, 55 secs
lola: sara is running 60 secs || 5064008 markings, 6881808 edges, 79305 markings/sec, 60 secs
lola: sara is running 65 secs || 5457711 markings, 7417353 edges, 78741 markings/sec, 65 secs
lola: sara is running 70 secs || 5837815 markings, 7953402 edges, 76021 markings/sec, 70 secs
lola: sara is running 75 secs || 6204924 markings, 8440583 edges, 73422 markings/sec, 75 secs
lola: sara is running 80 secs || 6601949 markings, 8969257 edges, 79405 markings/sec, 80 secs
lola: sara is running 85 secs || 6993252 markings, 9499200 edges, 78261 markings/sec, 85 secs
lola: sara is running 90 secs || 7377869 markings, 10041185 edges, 76923 markings/sec, 90 secs
lola: sara is running 95 secs || 7770373 markings, 10567597 edges, 78501 markings/sec, 95 secs
lola: sara is running 100 secs || 8144168 markings, 11062717 edges, 74759 markings/sec, 100 secs
lola: sara is running 105 secs || 8535299 markings, 11591513 edges, 78226 markings/sec, 105 secs
lola: sara is running 110 secs || 8919213 markings, 12134838 edges, 76783 markings/sec, 110 secs
lola: sara is running 115 secs || 9310479 markings, 12663008 edges, 78253 markings/sec, 115 secs
lola: sara is running 120 secs || 9708206 markings, 13192167 edges, 79545 markings/sec, 120 secs
lola: sara is running 125 secs || 10089164 markings, 13721488 edges, 76192 markings/sec, 125 secs
lola: sara is running 130 secs || 10449795 markings, 14218487 edges, 72126 markings/sec, 130 secs
lola: sara is running 135 secs || 10835140 markings, 14757857 edges, 77069 markings/sec, 135 secs
lola: sara is running 140 secs || 11225785 markings, 15296167 edges, 78129 markings/sec, 140 secs
lola: sara is running 145 secs || 11612968 markings, 15834172 edges, 77437 markings/sec, 145 secs
lola: sara is running 150 secs || 11985169 markings, 16347443 edges, 74440 markings/sec, 150 secs
lola: sara is running 155 secs || 12352510 markings, 16916055 edges, 73468 markings/sec, 155 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 12397827 markings, 17008181 edges
lola: ========================================
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t255) AND FIREABLE(t47)) OR (FIREABLE(t261) AND FIREABLE(t87)) OR ((FIREABLE(t313) OR FIREABLE(t377) OR NOT FIREABLE(t251)) AND (NOT FIREABLE(t219) OR NOT FIREABLE(t20))))))
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 (((FIREABLE(t255) AND FIREABLE(t47)) OR (FIREABLE(t261) AND FIREABLE(t87)) OR ((FIREABLE(t313) OR FIREABLE(t377) OR NOT FIREABLE(t251)) AND (NOT FIREABLE(t219) OR NOT FIREABLE(t20))))))
lola: processed formula length: 195
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: ((NOT FIREABLE(t255) OR NOT FIREABLE(t47)) AND (NOT FIREABLE(t261) OR NOT FIREABLE(t87)) AND ((NOT FIREABLE(t313) AND NOT FIREABLE(t377) AND FIREABLE(t251)) OR (FIREABLE(t219) AND FIREABLE(t20))))
lola: state equation: Generated DNF with 36 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-12-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-12-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 53 markings, 52 edges
lola: ========================================
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(t164) AND NOT FIREABLE(t256)) OR FIREABLE(t84)) AND (FIREABLE(t363) OR (FIREABLE(t208) AND FIREABLE(t180)) OR FIREABLE(t271) OR FIREABLE(t232) OR FIREABLE(t517) OR FIREABLE(t320)))))
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 ((((NOT FIREABLE(t164) AND NOT FIREABLE(t256)) OR FIREABLE(t84)) AND (FIREABLE(t363) OR (FIREABLE(t208) AND FIREABLE(t180)) OR FIREABLE(t271) OR FIREABLE(t232) OR FIREABLE(t517) OR FIREABLE(t320)))))
lola: processed formula length: 210
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-12-ReachabilityFireability.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: (((NOT FIREABLE(t164) AND NOT FIREABLE(t256)) OR FIREABLE(t84)) AND (FIREABLE(t363) OR (FIREABLE(t208) AND FIREABLE(t180)) OR FIREABLE(t271) OR FIREABLE(t232) OR FIREABLE(t517) OR FIREABLE(t320)))
lola: state equation: Generated DNF with 36 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-12-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 103 markings, 104 edges
lola: ========================================
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no yes yes no yes no no no yes yes no
lola:
preliminary result: yes no yes no no no yes yes no yes no no no yes yes no
lola: memory consumption: 15492 KB
lola: time consumption: 162 seconds
BK_STOP 1528017942357
--------------------
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-12"
export BK_EXAMINATION="ReachabilityFireability"
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-12.tgz
mv BusinessProcesses-PT-12 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-12, examination is ReachabilityFireability"
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-152749145500288"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 ;