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 216K
-rw-r--r-- 1 mcc users 3.7K May 29 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 29 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 28 11:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 28 11:16 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.6K May 28 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 28 07:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.8K 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.5K May 26 06:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 26 06:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 47K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BusinessProcesses-PT-01, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145400189
=====================================================================

--------------------
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-01-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1527958327397

info: Time: 3600 - MCC
===========================================================================================
prep: translating BusinessProcesses-PT-01 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-01 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ BusinessProcesses-PT-01 @ 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: 378/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 200
lola: finding significant places
lola: 200 places, 178 transitions, 170 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 218 transition conflict sets
lola: TASK
lola: reading formula from BusinessProcesses-PT-01-ReachabilityFireability.task
lola: E (F (FIREABLE(t151))) : A (G ((NOT FIREABLE(t29) OR FIREABLE(t44)))) : A (G ((FIREABLE(t50) OR NOT FIREABLE(t0)))) : E (F (())) : E (F ((FIREABLE(t75) OR (FIREABLE(t25) AND FIREABLE(t102) AND (FIREABLE(t41) OR FIREABLE(t85)) AND FIREABLE(t146) AND FIREABLE(t106) AND FIREABLE(t65))))) : E (F ((FIREABLE(t131) AND FIREABLE(t136)))) : E (F ((FIREABLE(t29) OR FIREABLE(t6)))) : E (F (((NOT FIREABLE(t90) OR NOT FIREABLE(t141)) AND FIREABLE(t1) AND (FIREABLE(t133) OR FIREABLE(t78))))) : A (G ((NOT FIREABLE(t86) OR FIREABLE(t78) OR NOT FIREABLE(t143)))) : A (G (NOT FIREABLE(t30))) : E (F (FIREABLE(t131))) : E (F (FIREABLE(t156))) : A (G (NOT FIREABLE(t122))) : A (G ((NOT FIREABLE(t6) OR NOT FIREABLE(t136) OR (NOT FIREABLE(t78) AND NOT FIREABLE(t46)) OR (NOT FIREABLE(t109) AND NOT FIREABLE(t113)) OR (NOT FIREABLE(t135) AND NOT FIREABLE(t41))))) : A (G ((((NOT FIREABLE(t37) OR NOT FIREABLE(t81)) AND (NOT FIREABLE(t171) OR NOT FIREABLE(t39))) OR NOT FIREABLE(t55)))) : A (G ((NOT FIREABLE(t156) OR FIREABLE(t64) OR FIREABLE(t136) OR FIREABLE(t118))))
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 3 rewrites
lola: closed formula file BusinessProcesses-PT-01-ReachabilityFireability.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-01-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t151)))
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(t151)))
lola: processed formula length: 22
lola: 4 rewrites
lola: closed formula file BusinessProcesses-PT-01-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(t151)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================

FORMULA BusinessProcesses-PT-01-ReachabilityFireability-0 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: A (G (NOT FIREABLE(t30)))
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(t30)))
lola: processed formula length: 25
lola: 5 rewrites
lola: closed formula file BusinessProcesses-PT-01-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 70 markings, 69 edges
lola: ========================================

FORMULA BusinessProcesses-PT-01-ReachabilityFireability-9 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: E (F (FIREABLE(t131)))
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(t131)))
lola: processed formula length: 22
lola: 4 rewrites
lola: closed formula file BusinessProcesses-PT-01-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(t131)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-01-ReachabilityFireability-3-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: 15 markings, 14 edges
lola: ========================================

FORMULA BusinessProcesses-PT-01-ReachabilityFireability-10 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(t156)))
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(t156)))
lola: processed formula length: 22
lola: 4 rewrites
lola: closed formula file BusinessProcesses-PT-01-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(t156)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-01-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-01-ReachabilityFireability-4-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.

FORMULA BusinessProcesses-PT-01-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t122)))
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(t122)))
lola: processed formula length: 26
lola: 5 rewrites
lola: closed formula file BusinessProcesses-PT-01-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(t122)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-01-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges

FORMULA BusinessProcesses-PT-01-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t50) OR NOT FIREABLE(t0))))
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(t50) OR NOT FIREABLE(t0))))
lola: processed formula length: 44
lola: 5 rewrites
lola: closed formula file BusinessProcesses-PT-01-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(t50) AND FIREABLE(t0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 41 markings, 40 edges
lola: state equation: write sara problem file to BusinessProcesses-PT-01-ReachabilityFireability-6-0.sara
lola: ========================================

FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2 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: A (G ((NOT FIREABLE(t29) OR FIREABLE(t44))))
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(t29) OR FIREABLE(t44))))
lola: processed formula length: 45
lola: 5 rewrites
lola: closed formula file BusinessProcesses-PT-01-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(t29) AND NOT FIREABLE(t44))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 69 markings, 68 edges
lola:
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to BusinessProcesses-PT-01-ReachabilityFireability-7-0.sara
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t131) AND FIREABLE(t136))))
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(t131) AND FIREABLE(t136))))
lola: processed formula length: 43
lola: 4 rewrites
lola: closed formula file BusinessProcesses-PT-01-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(t131) AND FIREABLE(t136))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-01-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 81 markings, 80 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA BusinessProcesses-PT-01-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t29) OR FIREABLE(t6))))
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(t29) OR FIREABLE(t6))))
lola: processed formula length: 40
try reading problem file BusinessProcesses-PT-01-ReachabilityFireability-8-0.sara.
lola: 4 rewrites
lola: closed formula file BusinessProcesses-PT-01-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(t29) OR FIREABLE(t6))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-01-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA BusinessProcesses-PT-01-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t86) OR FIREABLE(t78) OR NOT FIREABLE(t143))))
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(t86) OR FIREABLE(t78) OR NOT FIREABLE(t143))))
lola: processed formula length: 68
lola: 5 rewrites
lola: closed formula file BusinessProcesses-PT-01-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 25 edges
lola: ========================================

FORMULA BusinessProcesses-PT-01-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t156) OR FIREABLE(t64) OR FIREABLE(t136) OR FIREABLE(t118))))sara: try reading problem file BusinessProcesses-PT-01-ReachabilityFireability-9-0.sara.

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(t156) OR FIREABLE(t64) OR FIREABLE(t136) OR FIREABLE(t118))))
lola: processed formula length: 84
lola: 5 rewrites
lola: closed formula file BusinessProcesses-PT-01-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(t156) AND NOT FIREABLE(t64) AND NOT FIREABLE(t136) AND NOT FIREABLE(t118))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-01-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-01-ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
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-01-ReachabilityFireability-15 TRUE 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(t37) OR NOT FIREABLE(t81)) AND (NOT FIREABLE(t171) OR NOT FIREABLE(t39))) OR NOT FIREABLE(t55))))
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(t37) OR NOT FIREABLE(t81)) AND (NOT FIREABLE(t171) OR NOT FIREABLE(t39))) OR NOT FIREABLE(t55))))
lola: processed formula length: 122
lola: 5 rewrites
lola: closed formula file BusinessProcesses-PT-01-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(t37) AND FIREABLE(t81)) OR (FIREABLE(t171) AND FIREABLE(t39))) AND FIREABLE(t55))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-01-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-01-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 761461 markings, 1350629 edges, 152292 markings/sec, 0 secs
lola: sara is running 5 secs || 1418386 markings, 3011030 edges, 131385 markings/sec, 5 secs

lola: sara is running 10 secs || 2083843 markings, 4636805 edges, 133091 markings/sec, 10 secs
lola: sara is running 15 secs || 2721356 markings, 6275088 edges, 127503 markings/sec, 15 secs

lola: sara is running 20 secs || 3403071 markings, 7884052 edges, 136343 markings/sec, 20 secs
lola: sara is running 25 secs || 4046064 markings, 9532107 edges, 128599 markings/sec, 25 secs
lola: sara is running 30 secs || 4711621 markings, 11154488 edges, 133111 markings/sec, 30 secs
lola: sara is running 35 secs || 5329214 markings, 12794734 edges, 123519 markings/sec, 35 secs
lola: sara is running 40 secs || 6011443 markings, 14393439 edges, 136446 markings/sec, 40 secs
lola: sara is running 45 secs || 6566782 markings, 15800462 edges, 111068 markings/sec, 45 secs
lola: sara is running 50 secs || 7203151 markings, 17397870 edges, 127274 markings/sec, 50 secs
lola: sara is running 55 secs || 7842328 markings, 18984831 edges, 127835 markings/sec, 55 secs
lola: sara is running 60 secs || 8477820 markings, 20590356 edges, 127098 markings/sec, 60 secs
lola: sara is running 65 secs || 9132566 markings, 22189033 edges, 130949 markings/sec, 65 secs
lola: sara is running 70 secs || 9752652 markings, 23783897 edges, 124017 markings/sec, 70 secs
lola: sara is running 75 secs || 10393140 markings, 25379216 edges, 128098 markings/sec, 75 secs
lola: sara is running 80 secs || 11046294 markings, 26962860 edges, 130631 markings/sec, 80 secs
lola: sara is running 85 secs || 11731199 markings, 28552524 edges, 136981 markings/sec, 85 secs
lola: sara is running 90 secs || 12418836 markings, 30143115 edges, 137527 markings/sec, 90 secs
lola: sara is running 95 secs || 13108476 markings, 31730592 edges, 137928 markings/sec, 95 secs
lola: sara is running 100 secs || 13744990 markings, 33407345 edges, 127303 markings/sec, 100 secs
lola: sara is running 105 secs || 14355898 markings, 35039017 edges, 122182 markings/sec, 105 secs
lola: sara is running 110 secs || 14965481 markings, 36693717 edges, 121917 markings/sec, 110 secs
lola: sara is running 115 secs || 15578226 markings, 38321876 edges, 122549 markings/sec, 115 secs
lola: sara is running 120 secs || 16184547 markings, 39937271 edges, 121264 markings/sec, 120 secs
lola: sara is running 125 secs || 16869608 markings, 41531210 edges, 137012 markings/sec, 125 secs
lola: sara is running 130 secs || 17600035 markings, 43094779 edges, 146085 markings/sec, 130 secs
lola: sara is running 135 secs || 18334928 markings, 44623729 edges, 146979 markings/sec, 135 secs
sara: warning, failure of lp_solve (at job 2112)
lola: sara is running 140 secs || 18958794 markings, 46323038 edges, 124773 markings/sec, 140 secs
lola: sara is running 145 secs || 19589718 markings, 47961716 edges, 126185 markings/sec, 145 secs
lola: sara is running 150 secs || 20184965 markings, 49688601 edges, 119049 markings/sec, 150 secs
lola: sara is running 155 secs || 20852557 markings, 51351652 edges, 133518 markings/sec, 155 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 21026364 markings, 51837779 edges
lola: ========================================

FORMULA BusinessProcesses-PT-01-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1136 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t90) OR NOT FIREABLE(t141)) AND FIREABLE(t1) AND (FIREABLE(t133) OR FIREABLE(t78)))))
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(t90) OR NOT FIREABLE(t141)) AND FIREABLE(t1) AND (FIREABLE(t133) OR FIREABLE(t78)))))
lola: processed formula length: 108
lola: 4 rewrites
lola: closed formula file BusinessProcesses-PT-01-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 298 markings, 387 edges
lola: ========================================

FORMULA BusinessProcesses-PT-01-ReachabilityFireability-7 TRUE 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: E (F ((FIREABLE(t75) OR (FIREABLE(t25) AND FIREABLE(t102) AND (FIREABLE(t41) OR FIREABLE(t85)) AND FIREABLE(t146) AND FIREABLE(t106) AND FIREABLE(t65)))))
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(t75) OR (FIREABLE(t25) AND FIREABLE(t102) AND (FIREABLE(t41) OR FIREABLE(t85)) AND FIREABLE(t146) AND FIREABLE(t106) AND FIREABLE(t65)))))
lola: processed formula length: 156
lola: 4 rewrites
lola: closed formula file BusinessProcesses-PT-01-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 65 markings, 64 edges
lola: ========================================

FORMULA BusinessProcesses-PT-01-ReachabilityFireability-4 TRUE 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: A (G ((NOT FIREABLE(t6) OR NOT FIREABLE(t136) OR (NOT FIREABLE(t78) AND NOT FIREABLE(t46)) OR (NOT FIREABLE(t109) AND NOT FIREABLE(t113)) OR (NOT FIREABLE(t135) AND NOT FIREABLE(t41)))))
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(t6) OR NOT FIREABLE(t136) OR (NOT FIREABLE(t78) AND NOT FIREABLE(t46)) OR (NOT FIREABLE(t109) AND NOT FIREABLE(t113)) OR (NOT FIREABLE(t135) AND NOT FIREABLE(t41)))))
lola: processed formula length: 190
lola: 5 rewrites
lola: closed formula file BusinessProcesses-PT-01-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(t6) AND FIREABLE(t136) AND (FIREABLE(t78) OR FIREABLE(t46)) AND (FIREABLE(t109) OR FIREABLE(t113)) AND (FIREABLE(t135) OR FIREABLE(t41)))
lola: state equation: Generated DNF with 40 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-01-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-01-ReachabilityFireability-15-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-01-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no yes yes yes yes no no yes no no yes yes yes
lola:
preliminary result: yes no no no yes yes yes yes no no yes no no yes yes yes
lola: memory consumption: 14992 KB
lola: time consumption: 162 seconds

BK_STOP 1527958489352

--------------------
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-01"
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-01.tgz
mv BusinessProcesses-PT-01 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-01, 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-152749145400189"
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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;