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 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.7K May 28 11:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 11K May 28 09:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K 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.6K May 27 05:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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.9K May 26 06:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 141K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BusinessProcesses-PT-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145500279
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528010410975

info: Time: 3600 - MCC
===========================================================================================
prep: translating BusinessProcesses-PT-11 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-11 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ BusinessProcesses-PT-11 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1075/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 567
lola: finding significant places
lola: 567 places, 508 transitions, 472 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 625 transition conflict sets
lola: TASK
lola: reading formula from BusinessProcesses-PT-11-ReachabilityFireability.task
lola: E (F (FIREABLE(t27))) : E (F (FIREABLE(t63))) : E (F (((FIREABLE(t172) AND (FIREABLE(t300) OR FIREABLE(t150) OR FIREABLE(t329))) OR (FIREABLE(t193) AND FIREABLE(t453) AND (FIREABLE(t417) OR FIREABLE(t182)) AND ((FIREABLE(t59) AND FIREABLE(t154)) OR (FIREABLE(t319) AND FIREABLE(t288))))))) : E (F (((FIREABLE(t95) OR FIREABLE(t413)) AND FIREABLE(t393)))) : A (G ((NOT FIREABLE(t322) OR NOT FIREABLE(t496) OR (NOT FIREABLE(t289) AND NOT FIREABLE(t102)) OR (NOT FIREABLE(t462) AND NOT FIREABLE(t280) AND NOT FIREABLE(t398) AND NOT FIREABLE(t200))))) : A (G ((NOT FIREABLE(t375) AND NOT FIREABLE(t424) AND (NOT FIREABLE(t439) OR FIREABLE(t130)) AND NOT FIREABLE(t435) AND (NOT FIREABLE(t311) OR NOT FIREABLE(t239))))) : A (G (((FIREABLE(t86) AND FIREABLE(t350) AND FIREABLE(t351) AND FIREABLE(t357)) OR FIREABLE(t228) OR NOT FIREABLE(t314) OR NOT FIREABLE(t87) OR NOT FIREABLE(t293)))) : A (G (((NOT FIREABLE(t375) OR NOT FIREABLE(t114)) AND NOT FIREABLE(t376) AND (NOT FIREABLE(t387) OR (FIREABLE(t389) AND FIREABLE(t254)) OR FIREABLE(t28))))) : E (F ((FIREABLE(t99) AND FIREABLE(t7) AND FIREABLE(t57)))) : E (F (FIREABLE(t256))) : E (F ((FIREABLE(t382) OR FIREABLE(t372)))) : A (G ((FIREABLE(t265) OR (NOT FIREABLE(t308) AND NOT FIREABLE(t342)) OR NOT FIREABLE(t445) OR NOT FIREABLE(t51) OR (NOT FIREABLE(t230) AND NOT FIREABLE(t364))))) : A (G (((NOT FIREABLE(t283) OR FIREABLE(t176) OR FIREABLE(t269) OR FIREABLE(t421) OR NOT FIREABLE(t306)) AND (NOT FIREABLE(t48) OR NOT FIREABLE(t322) OR NOT FIREABLE(t404))))) : E (F (FIREABLE(t210))) : E (F (((FIREABLE(t491) OR (FIREABLE(t224) AND FIREABLE(t143))) AND FIREABLE(t120) AND (FIREABLE(t136) OR FIREABLE(t424)) AND (FIREABLE(t354) OR FIREABLE(t351)) AND NOT FIREABLE(t123) AND NOT FIREABLE(t236)))) : A (G (NOT FIREABLE(t286)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t27)))
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(t27)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-11-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: 48 markings, 47 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t27)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================

FORMULA BusinessProcesses-PT-11-ReachabilityFireability-0 TRUE 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: E (F (FIREABLE(t63)))
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(t63)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-11-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(t63)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-11-ReachabilityFireability-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: 1415 markings, 2056 edges
lola: ========================================

FORMULA BusinessProcesses-PT-11-ReachabilityFireability-1 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: E (F (FIREABLE(t256)))
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(t256)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-11-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(t256)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-11-ReachabilityFireability-2-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
lola: ========================================

FORMULA BusinessProcesses-PT-11-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(t210)))
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(t210)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-11-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(t210)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-11-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-11-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1101 markings, 1354 edges

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

FORMULA BusinessProcesses-PT-11-ReachabilityFireability-15 FALSE 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(t382) OR FIREABLE(t372))))
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(t382) OR FIREABLE(t372))))
lola: processed formula length: 43
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-11-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(t382) OR FIREABLE(t372))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-11-ReachabilityFireability-5-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: 81 markings, 81 edges
lola: ========================================

FORMULA BusinessProcesses-PT-11-ReachabilityFireability-10 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: E (F (((FIREABLE(t95) OR FIREABLE(t413)) AND FIREABLE(t393))))
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(t95) OR FIREABLE(t413)) AND FIREABLE(t393))))
lola: processed formula length: 63
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-11-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(t95) OR FIREABLE(t413)) AND FIREABLE(t393))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-11-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-11-ReachabilityFireability-6-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-11-ReachabilityFireability-3 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 ((FIREABLE(t99) AND FIREABLE(t7) AND FIREABLE(t57))))
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(t99) AND FIREABLE(t7) AND FIREABLE(t57))))
lola: processed formula length: 58
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-11-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(t99) AND FIREABLE(t7) AND FIREABLE(t57))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-11-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-11-ReachabilityFireability-7-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-11-ReachabilityFireability-8 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: A (G ((FIREABLE(t265) OR (NOT FIREABLE(t308) AND NOT FIREABLE(t342)) OR NOT FIREABLE(t445) OR NOT FIREABLE(t51) OR (NOT FIREABLE(t230) AND NOT FIREABLE(t364)))))
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(t265) OR (NOT FIREABLE(t308) AND NOT FIREABLE(t342)) OR NOT FIREABLE(t445) OR NOT FIREABLE(t51) OR (NOT FIREABLE(t230) AND NOT FIREABLE(t364)))))
lola: processed formula length: 165
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-11-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(t265) AND (FIREABLE(t308) OR FIREABLE(t342)) AND FIREABLE(t445) AND FIREABLE(t51) AND (FIREABLE(t230) OR FIREABLE(t364)))
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-11-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-11-ReachabilityFireability-8-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-11-ReachabilityFireability-11 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 (((NOT FIREABLE(t375) OR NOT FIREABLE(t114)) AND NOT FIREABLE(t376) AND (NOT FIREABLE(t387) OR (FIREABLE(t389) AND FIREABLE(t254)) OR FIREABLE(t28)))))
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(t375) OR NOT FIREABLE(t114)) AND NOT FIREABLE(t376) AND (NOT FIREABLE(t387) OR (FIREABLE(t389) AND FIREABLE(t254)) OR FIREABLE(t28)))))
lola: processed formula length: 159
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-11-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(t375) AND FIREABLE(t114)) OR FIREABLE(t376) OR (FIREABLE(t387) AND (NOT FIREABLE(t389) OR NOT FIREABLE(t254)) AND NOT FIREABLE(t28)))
lola: state equation: Generated DNF with 9 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-11-ReachabilityFireability-9-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-11-ReachabilityFireability-7 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(t375) AND NOT FIREABLE(t424) AND (NOT FIREABLE(t439) OR FIREABLE(t130)) AND NOT FIREABLE(t435) AND (NOT FIREABLE(t311) OR NOT FIREABLE(t239)))))
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(t375) AND NOT FIREABLE(t424) AND (NOT FIREABLE(t439) OR FIREABLE(t130)) AND NOT FIREABLE(t435) AND (NOT FIREABLE(t311) OR NOT FIREABLE(t239)))))
lola: processed formula length: 166
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-11-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(t375) OR FIREABLE(t424) OR (FIREABLE(t439) AND NOT FIREABLE(t130)) OR FIREABLE(t435) OR (FIREABLE(t311) AND FIREABLE(t239)))
lola: state equation: Generated DNF with 13 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-11-ReachabilityFireability-10-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: 41 markings, 42 edges
lola: ========================================

FORMULA BusinessProcesses-PT-11-ReachabilityFireability-5 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 (((NOT FIREABLE(t283) OR FIREABLE(t176) OR FIREABLE(t269) OR FIREABLE(t421) OR NOT FIREABLE(t306)) AND (NOT FIREABLE(t48) OR NOT FIREABLE(t322) OR NOT FIREABLE(t404)))))
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(t283) OR FIREABLE(t176) OR FIREABLE(t269) OR FIREABLE(t421) OR NOT FIREABLE(t306)) AND (NOT FIREABLE(t48) OR NOT FIREABLE(t322) OR NOT FIREABLE(t404)))))
lola: processed formula length: 180
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-11-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(t283) AND NOT FIREABLE(t176) AND NOT FIREABLE(t269) AND NOT FIREABLE(t421) AND FIREABLE(t306)) OR (FIREABLE(t48) AND FIREABLE(t322) AND FIREABLE(t404)))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-11-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-11-ReachabilityFireability-11-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-11-ReachabilityFireability-12 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 (((FIREABLE(t86) AND FIREABLE(t350) AND FIREABLE(t351) AND FIREABLE(t357)) OR FIREABLE(t228) OR NOT FIREABLE(t314) OR NOT FIREABLE(t87) OR NOT FIREABLE(t293))))
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(t86) AND FIREABLE(t350) AND FIREABLE(t351) AND FIREABLE(t357)) OR FIREABLE(t228) OR NOT FIREABLE(t314) OR NOT FIREABLE(t87) OR NOT FIREABLE(t293))))
lola: processed formula length: 169
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-11-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(t86) OR NOT FIREABLE(t350) OR NOT FIREABLE(t351) OR NOT FIREABLE(t357)) AND NOT FIREABLE(t228) AND FIREABLE(t314) AND FIREABLE(t87) AND FIREABLE(t293))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-11-ReachabilityFireability-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA BusinessProcesses-PT-11-ReachabilityFireability-6 TRUE 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: A (G ((NOT FIREABLE(t322) OR NOT FIREABLE(t496) OR (NOT FIREABLE(t289) AND NOT FIREABLE(t102)) OR (NOT FIREABLE(t462) AND NOT FIREABLE(t280) AND NOT FIREABLE(t398) AND NOT FIREABLE(t200)))))
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(t322) OR NOT FIREABLE(t496) OR (NOT FIREABLE(t289) AND NOT FIREABLE(t102)) OR (NOT FIREABLE(t462) AND NOT FIREABLE(t280) AND NOT FIREABLE(t398) AND NOT FIREABLE(t200)))))
lola: processed formula length: 193
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-11-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(t322) AND FIREABLE(t496) AND (FIREABLE(t289) OR FIREABLE(t102)) AND (FIREABLE(t462) OR FIREABLE(t280) OR FIREABLE(t398) OR FIREABLE(t200)))
lola: state equation: Generated DNF with 52 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-11-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-11-ReachabilityFireability-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-11-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t491) OR (FIREABLE(t224) AND FIREABLE(t143))) AND FIREABLE(t120) AND (FIREABLE(t136) OR FIREABLE(t424)) AND (FIREABLE(t354) OR FIREABLE(t351)) AND NOT FIREABLE(t123) AND NOT FIREABLE(t236))))
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) OR (FIREABLE(t224) AND FIREABLE(t143))) AND FIREABLE(t120) AND (FIREABLE(t136) OR FIREABLE(t424)) AND (FIREABLE(t354) OR FIREABLE(t351)) AND NOT FIREABLE(t123) AND NOT FIREABLE(t236))))
lola: processed formula length: 211
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-11-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) OR (FIREABLE(t224) AND FIREABLE(t143))) AND FIREABLE(t120) AND (FIREABLE(t136) OR FIREABLE(t424)) AND (FIREABLE(t354) OR FIREABLE(t351)) AND NOT FIREABLE(t123) AND NOT FIREABLE(t236))
lola: state equation: Generated DNF with 68 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-11-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-11-ReachabilityFireability-14-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-11-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t172) AND (FIREABLE(t300) OR FIREABLE(t150) OR FIREABLE(t329))) OR (FIREABLE(t193) AND FIREABLE(t453) AND (FIREABLE(t417) OR FIREABLE(t182)) AND ((FIREABLE(t59) AND FIREABLE(t154)) OR (FIREABLE(t319) AND FIREABLE(t288)))))))
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(t172) AND (FIREABLE(t300) OR FIREABLE(t150) OR FIREABLE(t329))) OR (FIREABLE(t193) AND FIREABLE(t453) AND (FIREABLE(t417) OR FIREABLE(t182)) AND ((FIREABLE(t59) AND FIREABLE(t154)) OR (FIREABLE(t319) AND FIREABLE(t288)))))))
lola: processed formula length: 246
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-11-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(t172) AND (FIREABLE(t300) OR FIREABLE(t150) OR FIREABLE(t329))) OR (FIREABLE(t193) AND FIREABLE(t453) AND (FIREABLE(t417) OR FIREABLE(t182)) AND ((FIREABLE(t59) AND FIREABLE(t154)) OR (FIREABLE(t319) AND FIREABLE(t288)))))
lola: state equation: Generated DNF with 38 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-11-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-11-ReachabilityFireability-15-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: 6944 markings, 13465 edges
lola: ========================================

FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no yes no yes no no yes yes yes yes yes no no
lola:
preliminary result: yes yes yes no yes no yes no no yes yes yes yes yes no no
lola: memory consumption: 15456 KB
lola: time consumption: 3 seconds

BK_STOP 1528010414013

--------------------
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-11"
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-11.tgz
mv BusinessProcesses-PT-11 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-11, 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-152749145500279"
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 ;