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 732K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 566K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is JoinFreeModules-PT-0100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630900273
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526839522445

info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-0100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-0100 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ JoinFreeModules-PT-0100 @ 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: 1302/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16032
lola: finding significant places
lola: 501 places, 801 transitions, 400 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 901 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-0100-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t33) OR NOT FIREABLE(t323) OR NOT FIREABLE(t429) OR NOT FIREABLE(t728) OR FIREABLE(t331)))) : E (F ((NOT FIREABLE(t531) AND NOT FIREABLE(t31) AND (NOT FIREABLE(t630) OR NOT FIREABLE(t382)) AND FIREABLE(t384)))) : A (G (((NOT FIREABLE(t29) AND NOT FIREABLE(t111) AND (NOT FIREABLE(t286) OR NOT FIREABLE(t129))) OR (FIREABLE(t448) AND NOT FIREABLE(t103))))) : E (F (((FIREABLE(t232) OR FIREABLE(t414) OR FIREABLE(t344) OR FIREABLE(t694)) AND (FIREABLE(t197) OR FIREABLE(t54) OR (FIREABLE(t571) AND FIREABLE(t423)) OR (FIREABLE(t139) AND (FIREABLE(t176) OR FIREABLE(t461))))))) : A (G ((FIREABLE(t338) OR FIREABLE(t739) OR FIREABLE(t304)))) : A (G (((NOT FIREABLE(t445) AND NOT FIREABLE(t233) AND (NOT FIREABLE(t657) OR NOT FIREABLE(t335))) OR NOT FIREABLE(t262)))) : E (F (FIREABLE(t465))) : E (F ((NOT FIREABLE(t116) AND FIREABLE(t719)))) : E (F ((NOT FIREABLE(t217) AND (NOT FIREABLE(t192) OR NOT FIREABLE(t288)) AND (NOT FIREABLE(t544) OR NOT FIREABLE(t33)) AND FIREABLE(t455)))) : A (G (FIREABLE(t404))) : E (F ((FIREABLE(t477) AND FIREABLE(t319) AND NOT FIREABLE(t718) AND (NOT FIREABLE(t284) OR NOT FIREABLE(t291))))) : A (G ((NOT FIREABLE(t673) OR NOT FIREABLE(t282) OR FIREABLE(t329) OR FIREABLE(t426)))) : A (G ((NOT FIREABLE(t105) OR FIREABLE(t175)))) : E (F ((FIREABLE(t773) AND NOT FIREABLE(t632)))) : E (F ((((FIREABLE(t527) OR NOT FIREABLE(t528)) AND NOT FIREABLE(t84)) OR FIREABLE(t310)))) : A (G ((FIREABLE(t146) OR (NOT FIREABLE(t292) AND NOT FIREABLE(t662)) OR FIREABLE(t650))))
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(t465)))
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(t465)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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(t465)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-6 TRUE 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: A (G (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 (FIREABLE(t404)))
lola: processed formula length: 22
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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(t404)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityFireability-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: 100 markings, 100 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-9 FALSE 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 ((NOT FIREABLE(t116) AND FIREABLE(t719))))
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(t116) AND FIREABLE(t719))))
lola: processed formula length: 47
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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(t116) AND FIREABLE(t719))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityFireability-2-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: 105 markings, 105 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-7 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: A (G ((NOT FIREABLE(t105) OR FIREABLE(t175))))
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(t105) OR FIREABLE(t175))))
lola: processed formula length: 47
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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(t105) AND NOT FIREABLE(t175))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-12 FALSE 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(t773) AND NOT FIREABLE(t632))))
lola: ========================================
lola: SUBTASK
state equation: calling and running sara
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(t773) AND NOT FIREABLE(t632))))
lola: processed formula length: 47
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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(t773) AND NOT FIREABLE(t632))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t338) OR FIREABLE(t739) OR FIREABLE(t304))))
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(t338) OR FIREABLE(t739) OR FIREABLE(t304))))
lola: processed formula length: 62
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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: sara: try reading problem file JoinFreeModules-PT-0100-ReachabilityFireability-4-0.sara.
sara: try reading problem file JoinFreeModules-PT-0100-ReachabilityFireability-3-0.sara.
rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t338) AND NOT FIREABLE(t739) AND NOT FIREABLE(t304))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityFireability-5-0.sara
lola: The predicate is not invariant.
lola: lola: state equation: calling and running sara101 markings, 101 edges

lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file JoinFreeModules-PT-0100-ReachabilityFireability-5-0.sara.
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t673) OR NOT FIREABLE(t282) OR FIREABLE(t329) OR FIREABLE(t426))))
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(t673) OR NOT FIREABLE(t282) OR FIREABLE(t329) OR FIREABLE(t426))))
lola: processed formula length: 89
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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(t673) AND FIREABLE(t282) AND NOT FIREABLE(t329) AND NOT FIREABLE(t426))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-0100-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 109 markings, 108 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-11 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(t527) OR NOT FIREABLE(t528)) AND NOT FIREABLE(t84)) OR FIREABLE(t310))))
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(t527) OR NOT FIREABLE(t528)) AND NOT FIREABLE(t84)) OR FIREABLE(t310))))
lola: processed formula length: 92
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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(t527) OR NOT FIREABLE(t528)) AND NOT FIREABLE(t84)) OR FIREABLE(t310))
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-0100-ReachabilityFireability-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 100 markings, 100 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-14 TRUE 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(t146) OR (NOT FIREABLE(t292) AND NOT FIREABLE(t662)) OR FIREABLE(t650))))
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(t146) OR (NOT FIREABLE(t292) AND NOT FIREABLE(t662)) OR FIREABLE(t650))))
lola: processed formula length: 91
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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(t146) AND (FIREABLE(t292) OR FIREABLE(t662)) AND NOT FIREABLE(t650))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-0100-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 201 markings, 201 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t33) OR NOT FIREABLE(t323) OR NOT FIREABLE(t429) OR NOT FIREABLE(t728) OR FIREABLE(t331))))
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(t33) OR NOT FIREABLE(t323) OR NOT FIREABLE(t429) OR NOT FIREABLE(t728) OR FIREABLE(t331))))
lola: processed formula length: 115
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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: 17 markings, 16 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-0 FALSE 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(t445) AND NOT FIREABLE(t233) AND (NOT FIREABLE(t657) OR NOT FIREABLE(t335))) OR NOT FIREABLE(t262))))
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(t445) AND NOT FIREABLE(t233) AND (NOT FIREABLE(t657) OR NOT FIREABLE(t335))) OR NOT FIREABLE(t262))))
lola: processed formula length: 124
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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(t445) OR FIREABLE(t233) OR (FIREABLE(t657) AND FIREABLE(t335))) AND FIREABLE(t262))
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-0100-ReachabilityFireability-10-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: 6 markings, 5 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-5 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: E (F ((FIREABLE(t477) AND FIREABLE(t319) AND NOT FIREABLE(t718) AND (NOT FIREABLE(t284) OR NOT FIREABLE(t291)))))
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(t477) AND FIREABLE(t319) AND NOT FIREABLE(t718) AND (NOT FIREABLE(t284) OR NOT FIREABLE(t291)))))
lola: processed formula length: 114
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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(t477) AND FIREABLE(t319) AND NOT FIREABLE(t718) AND (NOT FIREABLE(t284) OR NOT FIREABLE(t291)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file JoinFreeModules-PT-0100-ReachabilityFireability-11-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: 9 markings, 8 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-10 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: E (F ((NOT FIREABLE(t531) AND NOT FIREABLE(t31) AND (NOT FIREABLE(t630) OR NOT FIREABLE(t382)) AND FIREABLE(t384))))
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(t531) AND NOT FIREABLE(t31) AND (NOT FIREABLE(t630) OR NOT FIREABLE(t382)) AND FIREABLE(t384))))
lola: processed formula length: 117
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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(t531) AND NOT FIREABLE(t31) AND (NOT FIREABLE(t630) OR NOT FIREABLE(t382)) AND FIREABLE(t384))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-0100-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t217) AND (NOT FIREABLE(t192) OR NOT FIREABLE(t288)) AND (NOT FIREABLE(t544) OR NOT FIREABLE(t33)) AND FIREABLE(t455))))
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(t217) AND (NOT FIREABLE(t192) OR NOT FIREABLE(t288)) AND (NOT FIREABLE(t544) OR NOT FIREABLE(t33)) AND FIREABLE(t455))))
lola: processed formula length: 142
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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(t217) AND (NOT FIREABLE(t192) OR NOT FIREABLE(t288)) AND (NOT FIREABLE(t544) OR NOT FIREABLE(t33)) AND FIREABLE(t455))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t29) AND NOT FIREABLE(t111) AND (NOT FIREABLE(t286) OR NOT FIREABLE(t129))) OR (FIREABLE(t448) AND NOT FIREABLE(t103)))))
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) AND NOT FIREABLE(t111) AND (NOT FIREABLE(t286) OR NOT FIREABLE(t129))) OR (FIREABLE(t448) AND NOT FIREABLE(t103)))))
lola: processed formula length: 144
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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) OR FIREABLE(t111) OR (FIREABLE(t286) AND FIREABLE(t129))) AND (NOT FIREABLE(t448) OR FIREABLE(t103)))
lola: state equation: Generated DNF with 14 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t232) OR FIREABLE(t414) OR FIREABLE(t344) OR FIREABLE(t694)) AND (FIREABLE(t197) OR FIREABLE(t54) OR (FIREABLE(t571) AND FIREABLE(t423)) OR (FIREABLE(t139) AND (FIREABLE(t176) OR FIREABLE(t461)))))))
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(t232) OR FIREABLE(t414) OR FIREABLE(t344) OR FIREABLE(t694)) AND (FIREABLE(t197) OR FIREABLE(t54) OR (FIREABLE(t571) AND FIREABLE(t423)) OR (FIREABLE(t139) AND (FIREABLE(t176) OR FIREABLE(t461)))))))
lola: processed formula length: 223
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0100-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: 8 markings, 7 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes no no yes yes yes no yes no no yes yes no
lola:
preliminary result: no yes no yes no no yes yes yes no yes no no yes yes no
lola: memory consumption: 15916 KB
lola: time consumption: 0 seconds



BK_STOP 1526839522889

--------------------
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="JoinFreeModules-PT-0100"
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/JoinFreeModules-PT-0100.tgz
mv JoinFreeModules-PT-0100 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 JoinFreeModules-PT-0100, 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 r100-smll-152658630900273"
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 ;