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 896K
-rw-r--r-- 1 mcc users 3.4K 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.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.0K 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 9.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 729K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DLCshifumi-PT-2b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-smll-152649735300168
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526701306585

info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCshifumi-PT-2b 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 DLCshifumi-PT-2b formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DLCshifumi-PT-2b @ 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: 5666/65536 symbol table entries, 573 collisions
lola: preprocessing...
lola: Size of bit vector: 2483
lola: finding significant places
lola: 2483 places, 3183 transitions, 2404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3873 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-2b-ReachabilityFireability.task
lola: E (F ((FIREABLE(t604) AND FIREABLE(t1811) AND (NOT FIREABLE(t1908) OR NOT FIREABLE(t2883) OR FIREABLE(t30))))) : E (F (FIREABLE(t1181))) : E (F ((FIREABLE(t1463) OR FIREABLE(t1849)))) : E (F ((FIREABLE(t1911) OR FIREABLE(t437) OR (FIREABLE(t2099) AND FIREABLE(t650) AND (FIREABLE(t1288) OR FIREABLE(t1627)) AND (NOT FIREABLE(t2537) OR NOT FIREABLE(t315)))))) : E (F (((FIREABLE(t2209) AND FIREABLE(t2287) AND FIREABLE(t2627) AND (FIREABLE(t1458) OR (FIREABLE(t3168) AND FIREABLE(t1121)))) OR ((FIREABLE(t240) OR FIREABLE(t1386)) AND FIREABLE(t606) AND FIREABLE(t1615))))) : E (F ((FIREABLE(t420) AND (FIREABLE(t2248) OR NOT FIREABLE(t2029)) AND NOT FIREABLE(t2359)))) : A (G ((FIREABLE(t2147) OR NOT FIREABLE(t2308) OR (FIREABLE(t1748) AND FIREABLE(t1662))))) : E (F (FIREABLE(t883))) : E (F ((NOT FIREABLE(t1958) AND FIREABLE(t2006)))) : E (F ((FIREABLE(t1060) AND (FIREABLE(t460) OR FIREABLE(t1457)) AND (FIREABLE(t2880) OR FIREABLE(t2567) OR FIREABLE(t1669)) AND (FIREABLE(t2698) OR FIREABLE(t2255)) AND NOT FIREABLE(t3116) AND FIREABLE(t343) AND FIREABLE(t114) AND NOT FIREABLE(t2310)))) : E (F ((FIREABLE(t451) OR FIREABLE(t310)))) : E (F (((NOT FIREABLE(t42) AND NOT FIREABLE(t288) AND FIREABLE(t1744)) OR FIREABLE(t1755)))) : E (F (((FIREABLE(t117) AND FIREABLE(t1826) AND FIREABLE(t1727) AND FIREABLE(t934) AND FIREABLE(t1146) AND FIREABLE(t2654) AND FIREABLE(t1203) AND FIREABLE(t619)) OR FIREABLE(t2971)))) : A (G (NOT FIREABLE(t3163))) : A (G ((NOT FIREABLE(t2774) OR FIREABLE(t1155) OR NOT FIREABLE(t2111) OR NOT FIREABLE(t1028) OR ((FIREABLE(t1556) OR FIREABLE(t1209)) AND FIREABLE(t2849))))) : E (F (((FIREABLE(t2481) AND FIREABLE(t50)) OR FIREABLE(t1306) OR FIREABLE(t1176) OR (FIREABLE(t2259) AND NOT FIREABLE(t2865) AND (FIREABLE(t2268) OR FIREABLE(t1635)) AND NOT FIREABLE(t2604)))))
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(t1181)))
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(t1181)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-2b-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(t1181)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-2b-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: 41 markings, 40 edges
lola: ========================================

FORMULA DLCshifumi-PT-2b-ReachabilityFireability-1 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: E (F (FIREABLE(t883)))
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(t883)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-2b-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(t883)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-2b-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: 13 markings, 12 edges
lola: ========================================

FORMULA DLCshifumi-PT-2b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t3163)))
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(t3163)))
lola: processed formula length: 27
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-2b-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(t3163)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-2b-ReachabilityFireability-2-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: 31 markings, 30 edges
lola: ========================================

FORMULA DLCshifumi-PT-2b-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1958) AND FIREABLE(t2006))))
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(t1958) AND FIREABLE(t2006))))
lola: processed formula length: 49
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-2b-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(t1958) AND FIREABLE(t2006))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-2b-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-2b-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 111 markings, 110 edges
lola: ========================================

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

FORMULA DLCshifumi-PT-2b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1463) OR FIREABLE(t1849))))
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(t1463) OR FIREABLE(t1849))))
lola: processed formula length: 45
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-2b-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(t1463) OR FIREABLE(t1849))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-2b-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: 40 markings, 39 edges
lola: ========================================

FORMULA DLCshifumi-PT-2b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t420) AND (FIREABLE(t2248) OR NOT FIREABLE(t2029)) AND NOT FIREABLE(t2359))))
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(t420) AND (FIREABLE(t2248) OR NOT FIREABLE(t2029)) AND NOT FIREABLE(t2359))))
lola: processed formula length: 94
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-2b-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(t420) AND (FIREABLE(t2248) OR NOT FIREABLE(t2029)) AND NOT FIREABLE(t2359))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-2b-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-2b-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 162 markings, 169 edges
lola: ========================================

FORMULA DLCshifumi-PT-2b-ReachabilityFireability-5 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: E (F (((NOT FIREABLE(t42) AND NOT FIREABLE(t288) AND FIREABLE(t1744)) OR FIREABLE(t1755))))
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(t42) AND NOT FIREABLE(t288) AND FIREABLE(t1744)) OR FIREABLE(t1755))))
lola: processed formula length: 92
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-2b-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(t42) AND NOT FIREABLE(t288) AND FIREABLE(t1744)) OR FIREABLE(t1755))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-2b-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 24 markings, 23 edges
lola: ========================================

FORMULA DLCshifumi-PT-2b-ReachabilityFireability-11 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(t2147) OR NOT FIREABLE(t2308) OR (FIREABLE(t1748) AND FIREABLE(t1662)))))
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(t2147) OR NOT FIREABLE(t2308) OR (FIREABLE(t1748) AND FIREABLE(t1662)))))
lola: processed formula length: 91
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-2b-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(t2147) AND FIREABLE(t2308) AND (NOT FIREABLE(t1748) OR NOT FIREABLE(t1662)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-2b-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-2b-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 134 markings, 133 edges
lola: ========================================

FORMULA DLCshifumi-PT-2b-ReachabilityFireability-6 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: E (F ((FIREABLE(t604) AND FIREABLE(t1811) AND (NOT FIREABLE(t1908) OR NOT FIREABLE(t2883) OR FIREABLE(t30)))))
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(t604) AND FIREABLE(t1811) AND (NOT FIREABLE(t1908) OR NOT FIREABLE(t2883) OR FIREABLE(t30)))))
lola: processed formula length: 112
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-2b-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(t604) AND FIREABLE(t1811) AND (NOT FIREABLE(t1908) OR NOT FIREABLE(t2883) OR FIREABLE(t30)))
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-2b-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-2b-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 155 markings, 154 edges
lola: ========================================

FORMULA DLCshifumi-PT-2b-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2774) OR FIREABLE(t1155) OR NOT FIREABLE(t2111) OR NOT FIREABLE(t1028) OR ((FIREABLE(t1556) OR FIREABLE(t1209)) AND FIREABLE(t2849)))))
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(t2774) OR FIREABLE(t1155) OR NOT FIREABLE(t2111) OR NOT FIREABLE(t1028) OR ((FIREABLE(t1556) OR FIREABLE(t1209)) AND FIREABLE(t2849)))))
lola: processed formula length: 161
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-2b-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(t2774) AND NOT FIREABLE(t1155) AND FIREABLE(t2111) AND FIREABLE(t1028) AND ((NOT FIREABLE(t1556) AND NOT FIREABLE(t1209)) OR NOT FIREABLE(t2849)))
lola: state equation: Generated DNF with 19 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-2b-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-2b-ReachabilityFireability-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 199 markings, 198 edges
lola: ========================================

FORMULA DLCshifumi-PT-2b-ReachabilityFireability-14 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(t1911) OR FIREABLE(t437) OR (FIREABLE(t2099) AND FIREABLE(t650) AND (FIREABLE(t1288) OR FIREABLE(t1627)) AND (NOT FIREABLE(t2537) OR NOT FIREABLE(t315))))))
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(t1911) OR FIREABLE(t437) OR (FIREABLE(t2099) AND FIREABLE(t650) AND (FIREABLE(t1288) OR FIREABLE(t1627)) AND (NOT FIREABLE(t2537) OR NOT FIREABLE(t315))))))
lola: processed formula length: 176
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-2b-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(t1911) OR FIREABLE(t437) OR (FIREABLE(t2099) AND FIREABLE(t650) AND (FIREABLE(t1288) OR FIREABLE(t1627)) AND (NOT FIREABLE(t2537) OR NOT FIREABLE(t315))))
lola: state equation: Generated DNF with 26 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-2b-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-2b-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 498 markings, 541 edges
lola: ========================================

FORMULA DLCshifumi-PT-2b-ReachabilityFireability-3 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 (((FIREABLE(t117) AND FIREABLE(t1826) AND FIREABLE(t1727) AND FIREABLE(t934) AND FIREABLE(t1146) AND FIREABLE(t2654) AND FIREABLE(t1203) AND FIREABLE(t619)) OR FIREABLE(t2971))))
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(t117) AND FIREABLE(t1826) AND FIREABLE(t1727) AND FIREABLE(t934) AND FIREABLE(t1146) AND FIREABLE(t2654) AND FIREABLE(t1203) AND FIREABLE(t619)) OR FIREABLE(t2971))))
lola: processed formula length: 184
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-2b-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(t117) AND FIREABLE(t1826) AND FIREABLE(t1727) AND FIREABLE(t934) AND FIREABLE(t1146) AND FIREABLE(t2654) AND FIREABLE(t1203) AND FIREABLE(t619)) OR FIREABLE(t2971))
lola: state equation: Generated DNF with 11 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-2b-ReachabilityFireability-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 115 markings, 114 edges
lola: ========================================

FORMULA DLCshifumi-PT-2b-ReachabilityFireability-12 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 (((FIREABLE(t2481) AND FIREABLE(t50)) OR FIREABLE(t1306) OR FIREABLE(t1176) OR (FIREABLE(t2259) AND NOT FIREABLE(t2865) AND (FIREABLE(t2268) OR FIREABLE(t1635)) AND NOT FIREABLE(t2604)))))
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(t2481) AND FIREABLE(t50)) OR FIREABLE(t1306) OR FIREABLE(t1176) OR (FIREABLE(t2259) AND NOT FIREABLE(t2865) AND (FIREABLE(t2268) OR FIREABLE(t1635)) AND NOT FIREABLE(t2604)))))
lola: processed formula length: 197
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-2b-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(t2481) AND FIREABLE(t50)) OR FIREABLE(t1306) OR FIREABLE(t1176) OR (FIREABLE(t2259) AND NOT FIREABLE(t2865) AND (FIREABLE(t2268) OR FIREABLE(t1635)) AND NOT FIREABLE(t2604)))
lola: state equation: Generated DNF with 37 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-2b-ReachabilityFireability-13-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: 16 markings, 15 edges
lola: ========================================

FORMULA DLCshifumi-PT-2b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t2209) AND FIREABLE(t2287) AND FIREABLE(t2627) AND (FIREABLE(t1458) OR (FIREABLE(t3168) AND FIREABLE(t1121)))) OR ((FIREABLE(t240) OR FIREABLE(t1386)) AND FIREABLE(t606) AND FIREABLE(t1615)))))
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(t2209) AND FIREABLE(t2287) AND FIREABLE(t2627) AND (FIREABLE(t1458) OR (FIREABLE(t3168) AND FIREABLE(t1121)))) OR ((FIREABLE(t240) OR FIREABLE(t1386)) AND FIREABLE(t606) AND FIREABLE(t1615)))))
lola: processed formula length: 213
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-2b-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(t2209) AND FIREABLE(t2287) AND FIREABLE(t2627) AND (FIREABLE(t1458) OR (FIREABLE(t3168) AND FIREABLE(t1121)))) OR ((FIREABLE(t240) OR FIREABLE(t1386)) AND FIREABLE(t606) AND FIREABLE(t1615)))
lola: state equation: Generated DNF with 17 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-2b-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-2b-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 658 markings, 702 edges
lola: ========================================

FORMULA DLCshifumi-PT-2b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1060) AND (FIREABLE(t460) OR FIREABLE(t1457)) AND (FIREABLE(t2880) OR FIREABLE(t2567) OR FIREABLE(t1669)) AND (FIREABLE(t2698) OR FIREABLE(t2255)) AND NOT FIREABLE(t3116) AND FIREABLE(t343) AND FIREABLE(t114) AND NOT FIREABLE(t2310))))
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(t1060) AND (FIREABLE(t460) OR FIREABLE(t1457)) AND (FIREABLE(t2880) OR FIREABLE(t2567) OR FIREABLE(t1669)) AND (FIREABLE(t2698) OR FIREABLE(t2255)) AND NOT FIREABLE(t3116) AND FIREABLE(t343) AND FIREABLE(t114) AND NOT FIREABLE(t2310))))
lola: processed formula length: 256
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-2b-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(t1060) AND (FIREABLE(t460) OR FIREABLE(t1457)) AND (FIREABLE(t2880) OR FIREABLE(t2567) OR FIREABLE(t1669)) AND (FIREABLE(t2698) OR FIREABLE(t2255)) AND NOT FIREABLE(t3116) AND FIREABLE(t343) AND FIREABLE(t114) AND NOT FIREABLE(t2310))
lola: state equation: Generated DNF with 220 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-2b-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-2b-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 141 markings, 140 edges
lola: ========================================

FORMULA DLCshifumi-PT-2b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes yes no yes yes yes yes yes yes no no yes
lola:
preliminary result: yes yes yes yes yes yes no yes yes yes yes yes yes no no yes
lola: memory consumption: 18900 KB
lola: time consumption: 1 seconds

BK_STOP 1526701307103

--------------------
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="DLCshifumi-PT-2b"
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/DLCshifumi-PT-2b.tgz
mv DLCshifumi-PT-2b 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 DLCshifumi-PT-2b, 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 r064-smll-152649735300168"
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 ;