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 272K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K 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.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 110K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DES-PT-60a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r052-smll-152646380200287
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526647420830

info: Time: 3600 - MCC
===========================================================================================
prep: translating DES-PT-60a 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 DES-PT-60a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DES-PT-60a @ 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: 665/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 354
lola: finding significant places
lola: 354 places, 311 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 336 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-60a-ReachabilityFireability.task
lola: E (F ((FIREABLE(t96) AND FIREABLE(t118) AND FIREABLE(t271) AND FIREABLE(t213) AND NOT FIREABLE(t252) AND NOT FIREABLE(t306) AND (NOT FIREABLE(t241) OR FIREABLE(t301))))) : A (G ((FIREABLE(t230) OR NOT FIREABLE(t84)))) : E (F (FIREABLE(t230))) : E (F (((NOT FIREABLE(t36) OR NOT FIREABLE(t2)) AND FIREABLE(t284) AND (NOT FIREABLE(t33) OR NOT FIREABLE(t176) OR (NOT FIREABLE(t216) AND NOT FIREABLE(t65)))))) : E (F (FIREABLE(t69))) : E (F ((FIREABLE(t268) AND NOT FIREABLE(t230) AND FIREABLE(t174)))) : A (G ((NOT FIREABLE(t155) OR NOT FIREABLE(t266) OR FIREABLE(t116) OR FIREABLE(t165)))) : E (F (((FIREABLE(t163) AND FIREABLE(t262)) OR FIREABLE(t66)))) : E (F ((FIREABLE(t76) OR FIREABLE(t214) OR FIREABLE(t162) OR FIREABLE(t16) OR FIREABLE(t73) OR (NOT FIREABLE(t147) AND FIREABLE(t69))))) : E (F ((FIREABLE(t28) OR (FIREABLE(t28) AND FIREABLE(t142) AND NOT FIREABLE(t194)) OR (FIREABLE(t187) AND FIREABLE(t251))))) : A (G (((NOT FIREABLE(t33) AND NOT FIREABLE(t16) AND (NOT FIREABLE(t153) OR NOT FIREABLE(t110))) OR (FIREABLE(t248) AND FIREABLE(t51))))) : E (F (FIREABLE(t66))) : E (F (FIREABLE(t86))) : E (F ((FIREABLE(t281) AND FIREABLE(t114) AND FIREABLE(t4) AND FIREABLE(t136) AND (FIREABLE(t274) OR FIREABLE(t251) OR FIREABLE(t78) OR FIREABLE(t205)) AND (FIREABLE(t162) OR FIREABLE(t76))))) : E (F ((FIREABLE(t267) OR FIREABLE(t213) OR FIREABLE(t142) OR FIREABLE(t80) OR (FIREABLE(t247) AND NOT FIREABLE(t234)) OR FIREABLE(t83)))) : E (F ((FIREABLE(t64) AND FIREABLE(t60) AND (FIREABLE(t76) OR FIREABLE(t225)))))
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(t230)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t230)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DES-PT-60a-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t230)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1464 markings, 1464 edges
lola: ========================================

FORMULA DES-PT-60a-ReachabilityFireability-2 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(t69)))
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(t69)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-60a-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(t69)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-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: 58 markings, 57 edges
lola: ========================================

FORMULA DES-PT-60a-ReachabilityFireability-4 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(t66)))
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(t66)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-60a-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(t66)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-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: 211 markings, 210 edges
lola: ========================================

FORMULA DES-PT-60a-ReachabilityFireability-11 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(t86)))
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(t86)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-60a-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(t86)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 166734 markings, 272765 edges
lola: ========================================

FORMULA DES-PT-60a-ReachabilityFireability-12 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: A (G ((FIREABLE(t230) OR NOT FIREABLE(t84))))
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(t230) OR NOT FIREABLE(t84))))
lola: processed formula length: 46
lola: 2 rewrites
lola: closed formula file DES-PT-60a-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(t230) AND FIREABLE(t84))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-ReachabilityFireability-4-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: 173770 markings, 284830 edges
lola: ========================================

FORMULA DES-PT-60a-ReachabilityFireability-1 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(t268) AND NOT FIREABLE(t230) AND FIREABLE(t174))))
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(t268) AND NOT FIREABLE(t230) AND FIREABLE(t174))))
lola: processed formula length: 66
lola: 1 rewrites
lola: closed formula file DES-PT-60a-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(t268) AND NOT FIREABLE(t230) AND FIREABLE(t174))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-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: 952 markings, 1107 edges
lola: ========================================

FORMULA DES-PT-60a-ReachabilityFireability-5 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(t163) AND FIREABLE(t262)) OR FIREABLE(t66))))
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(t163) AND FIREABLE(t262)) OR FIREABLE(t66))))
lola: processed formula length: 63
lola: 1 rewrites
lola: closed formula file DES-PT-60a-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(t163) AND FIREABLE(t262)) OR FIREABLE(t66))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 226 markings, 225 edges
lola: ========================================

FORMULA DES-PT-60a-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t155) OR NOT FIREABLE(t266) OR FIREABLE(t116) OR FIREABLE(t165))))
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(t155) OR NOT FIREABLE(t266) OR FIREABLE(t116) OR FIREABLE(t165))))
lola: processed formula length: 89
lola: 2 rewrites
lola: closed formula file DES-PT-60a-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(t155) AND FIREABLE(t266) AND NOT FIREABLE(t116) AND NOT FIREABLE(t165))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-ReachabilityFireability-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1648 markings, 1647 edges
lola: ========================================

FORMULA DES-PT-60a-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t64) AND FIREABLE(t60) AND (FIREABLE(t76) OR FIREABLE(t225)))))
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(t64) AND FIREABLE(t60) AND (FIREABLE(t76) OR FIREABLE(t225)))))
lola: processed formula length: 80
lola: 1 rewrites
lola: closed formula file DES-PT-60a-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(t64) AND FIREABLE(t60) AND (FIREABLE(t76) OR FIREABLE(t225)))
lola: state equation: Generated DNF with 16 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-ReachabilityFireability-8-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 DES-PT-60a-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t28) OR (FIREABLE(t28) AND FIREABLE(t142) AND NOT FIREABLE(t194)) OR (FIREABLE(t187) AND FIREABLE(t251)))))
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(t28) OR (FIREABLE(t28) AND FIREABLE(t142) AND NOT FIREABLE(t194)) OR (FIREABLE(t187) AND FIREABLE(t251)))))
lola: processed formula length: 125
lola: 1 rewrites
lola: closed formula file DES-PT-60a-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(t28) OR (FIREABLE(t28) AND FIREABLE(t142) AND NOT FIREABLE(t194)) OR (FIREABLE(t187) AND FIREABLE(t251)))
lola: state equation: Generated DNF with 19 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4009 markings, 6072 edges

FORMULA DES-PT-60a-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t33) AND NOT FIREABLE(t16) AND (NOT FIREABLE(t153) OR NOT FIREABLE(t110))) OR (FIREABLE(t248) AND FIREABLE(t51)))))
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) AND NOT FIREABLE(t16) AND (NOT FIREABLE(t153) OR NOT FIREABLE(t110))) OR (FIREABLE(t248) AND FIREABLE(t51)))))
lola: processed formula length: 138
lola: 2 rewrites
lola: closed formula file DES-PT-60a-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(t33) OR FIREABLE(t16) OR (FIREABLE(t153) AND FIREABLE(t110))) AND (NOT FIREABLE(t248) OR NOT FIREABLE(t51)))
lola: state equation: Generated DNF with 49 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-ReachabilityFireability-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2726 markings, 3661 edges
lola: ========================================

FORMULA DES-PT-60a-ReachabilityFireability-10 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: E (F ((FIREABLE(t76) OR FIREABLE(t214) OR FIREABLE(t162) OR FIREABLE(t16) OR FIREABLE(t73) OR (NOT FIREABLE(t147) AND FIREABLE(t69)))))
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(t76) OR FIREABLE(t214) OR FIREABLE(t162) OR FIREABLE(t16) OR FIREABLE(t73) OR (NOT FIREABLE(t147) AND FIREABLE(t69)))))
lola: processed formula length: 140
lola: 1 rewrites
lola: closed formula file DES-PT-60a-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(t76) OR FIREABLE(t214) OR FIREABLE(t162) OR FIREABLE(t16) OR FIREABLE(t73) OR (NOT FIREABLE(t147) AND FIREABLE(t69)))
lola: state equation: Generated DNF with 19 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 291 markings, 667 edges
lola: ========================================

FORMULA DES-PT-60a-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t267) OR FIREABLE(t213) OR FIREABLE(t142) OR FIREABLE(t80) OR (FIREABLE(t247) AND NOT FIREABLE(t234)) OR FIREABLE(t83))))
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(t267) OR FIREABLE(t213) OR FIREABLE(t142) OR FIREABLE(t80) OR (FIREABLE(t247) AND NOT FIREABLE(t234)) OR FIREABLE(t83))))
lola: processed formula length: 142
lola: 1 rewrites
lola: closed formula file DES-PT-60a-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(t267) OR FIREABLE(t213) OR FIREABLE(t142) OR FIREABLE(t80) OR (FIREABLE(t247) AND NOT FIREABLE(t234)) OR FIREABLE(t83))
lola: state equation: Generated DNF with 13 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-ReachabilityFireability-12-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: 95 markings, 144 edges
lola:
========================================
FORMULA DES-PT-60a-ReachabilityFireability-14 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: E (F (((NOT FIREABLE(t36) OR NOT FIREABLE(t2)) AND FIREABLE(t284) AND (NOT FIREABLE(t33) OR NOT FIREABLE(t176) OR (NOT FIREABLE(t216) AND NOT 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 (((NOT FIREABLE(t36) OR NOT FIREABLE(t2)) AND FIREABLE(t284) AND (NOT FIREABLE(t33) OR NOT FIREABLE(t176) OR (NOT FIREABLE(t216) AND NOT FIREABLE(t65))))))
lola: processed formula length: 163
lola: 1 rewrites
lola: closed formula file DES-PT-60a-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(t36) OR NOT FIREABLE(t2)) AND FIREABLE(t284) AND (NOT FIREABLE(t33) OR NOT FIREABLE(t176) OR (NOT FIREABLE(t216) AND NOT FIREABLE(t65))))
lola: SUBRESULT
lola: result: yes
lola: state equation: Generated DNF with 250 literals and 55 conjunctive subformulas
lola: produced by: state space
lola: state equation: write sara problem file to DES-PT-60a-ReachabilityFireability-13-0.sara
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA DES-PT-60a-ReachabilityFireability-3 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(t96) AND FIREABLE(t118) AND FIREABLE(t271) AND FIREABLE(t213) AND NOT FIREABLE(t252) AND NOT FIREABLE(t306) AND (NOT FIREABLE(t241) OR FIREABLE(t301)))))
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(t96) AND FIREABLE(t118) AND FIREABLE(t271) AND FIREABLE(t213) AND NOT FIREABLE(t252) AND NOT FIREABLE(t306) AND (NOT FIREABLE(t241) OR FIREABLE(t301)))))
lola: processed formula length: 170
lola: 1 rewrites
lola: closed formula file DES-PT-60a-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(t96) AND FIREABLE(t118) AND FIREABLE(t271) AND FIREABLE(t213) AND NOT FIREABLE(t252) AND NOT FIREABLE(t306) AND (NOT FIREABLE(t241) OR FIREABLE(t301)))
lola: state equation: Generated DNF with 138 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-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 DES-PT-60a-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t281) AND FIREABLE(t114) AND FIREABLE(t4) AND FIREABLE(t136) AND (FIREABLE(t274) OR FIREABLE(t251) OR FIREABLE(t78) OR FIREABLE(t205)) AND (FIREABLE(t162) OR FIREABLE(t76)))))
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(t281) AND FIREABLE(t114) AND FIREABLE(t4) AND FIREABLE(t136) AND (FIREABLE(t274) OR FIREABLE(t251) OR FIREABLE(t78) OR FIREABLE(t205)) AND (FIREABLE(t162) OR FIREABLE(t76)))))
lola: processed formula length: 195
lola: 1 rewrites
lola: closed formula file DES-PT-60a-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(t281) AND FIREABLE(t114) AND FIREABLE(t4) AND FIREABLE(t136) AND (FIREABLE(t274) OR FIREABLE(t251) OR FIREABLE(t78) OR FIREABLE(t205)) AND (FIREABLE(t162) OR FIREABLE(t76)))
lola: state equation: Generated DNF with 110 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-ReachabilityFireability-15-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 DES-PT-60a-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes yes no yes yes yes no yes yes no yes no
lola:
preliminary result: no no yes yes yes yes no yes yes yes no yes yes no yes no
lola: memory consumption: 15188 KB
lola: time consumption: 4 seconds

BK_STOP 1526647425331

--------------------
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="DES-PT-60a"
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/DES-PT-60a.tgz
mv DES-PT-60a 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 DES-PT-60a, 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 r052-smll-152646380200287"
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 ;