About the Execution of LoLA for DLCshifumi-PT-6b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 729.800 | 248621.00 | 494334.00 | 590.80 | TFFFTFFTTTFFTTTF | normal |
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 17M
-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.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K 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.5K 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 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 17M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DLCshifumi-PT-6b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-smll-152649735400224
=====================================================================
--------------------
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-6b-ReachabilityFireability-00
FORMULA_NAME DLCshifumi-PT-6b-ReachabilityFireability-01
FORMULA_NAME DLCshifumi-PT-6b-ReachabilityFireability-02
FORMULA_NAME DLCshifumi-PT-6b-ReachabilityFireability-03
FORMULA_NAME DLCshifumi-PT-6b-ReachabilityFireability-04
FORMULA_NAME DLCshifumi-PT-6b-ReachabilityFireability-05
FORMULA_NAME DLCshifumi-PT-6b-ReachabilityFireability-06
FORMULA_NAME DLCshifumi-PT-6b-ReachabilityFireability-07
FORMULA_NAME DLCshifumi-PT-6b-ReachabilityFireability-08
FORMULA_NAME DLCshifumi-PT-6b-ReachabilityFireability-09
FORMULA_NAME DLCshifumi-PT-6b-ReachabilityFireability-10
FORMULA_NAME DLCshifumi-PT-6b-ReachabilityFireability-11
FORMULA_NAME DLCshifumi-PT-6b-ReachabilityFireability-12
FORMULA_NAME DLCshifumi-PT-6b-ReachabilityFireability-13
FORMULA_NAME DLCshifumi-PT-6b-ReachabilityFireability-14
FORMULA_NAME DLCshifumi-PT-6b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1526745719359
info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCshifumi-PT-6b 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-6b formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DLCshifumi-PT-6b @ 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: 110854/65536 symbol table entries, 76305 collisions
lola: preprocessing...
lola: Size of bit vector: 44243
lola: finding significant places
lola: 44243 places, 66611 transitions, 41828 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 93553 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-6b-ReachabilityFireability.task
lola: E (F (((FIREABLE(t38710) OR FIREABLE(t27195) OR FIREABLE(t14362) OR FIREABLE(t2761)) AND (FIREABLE(t49172) OR FIREABLE(t18468) OR (FIREABLE(t51512) AND FIREABLE(t46744)) OR FIREABLE(t18564))))) : A (G ((((FIREABLE(t48333) OR FIREABLE(t56091)) AND NOT FIREABLE(t42224)) OR NOT FIREABLE(t40754) OR FIREABLE(t34928)))) : A (G ((FIREABLE(t2904) OR FIREABLE(t34326) OR NOT FIREABLE(t23019) OR (FIREABLE(t4135) AND FIREABLE(t29660) AND NOT FIREABLE(t15063)) OR (FIREABLE(t61471) AND FIREABLE(t52017) AND (FIREABLE(t4359) OR FIREABLE(t46379)) AND (NOT FIREABLE(t24584) OR NOT FIREABLE(t6762)))))) : A (G ((FIREABLE(t17283) OR NOT FIREABLE(t59844)))) : E (F (FIREABLE(t55475))) : A (G ((((NOT FIREABLE(t39621) OR NOT FIREABLE(t39186)) AND FIREABLE(t59818)) OR (NOT FIREABLE(t3503) AND NOT FIREABLE(t64113))))) : A (G ((NOT FIREABLE(t65119) AND (NOT FIREABLE(t41369) OR NOT FIREABLE(t14951) OR NOT FIREABLE(t47779))))) : E (F ((FIREABLE(t17822) OR (FIREABLE(t65200) AND FIREABLE(t56657))))) : E (F ((FIREABLE(t40943) AND FIREABLE(t30053) AND (NOT FIREABLE(t62879) OR NOT FIREABLE(t52887)) AND NOT FIREABLE(t30913)))) : E (F (((FIREABLE(t2538) OR FIREABLE(t39169)) AND FIREABLE(t62390) AND FIREABLE(t62742) AND FIREABLE(t34553)))) : A (G (NOT FIREABLE(t12506))) : A (G ((NOT FIREABLE(t53241) AND NOT FIREABLE(t31714)))) : E (F (FIREABLE(t4514))) : E (F (FIREABLE(t46921))) : E (F (FIREABLE(t18661))) : A (G ((NOT FIREABLE(t53471) OR FIREABLE(t59238))))
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(t55475)))
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(t55475)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t55475)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1910 markings, 1909 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-4 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: A (G (NOT FIREABLE(t12506)))
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(t12506)))
lola: processed formula length: 28
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t12506)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1353 markings, 1352 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-10 FALSE 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(t4514)))
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(t4514)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t4514)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 456 markings, 455 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-12 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(t46921)))
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(t46921)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t46921)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 669 markings, 668 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-13 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(t18661)))
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(t18661)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t18661)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1868 markings, 1867 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-14 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: A (G ((NOT FIREABLE(t53241) AND NOT FIREABLE(t31714))))
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(t53241) AND NOT FIREABLE(t31714))))
lola: processed formula length: 55
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t53241) OR FIREABLE(t31714))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 130 markings, 129 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-11 FALSE 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: A (G ((FIREABLE(t17283) OR NOT FIREABLE(t59844))))
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(t17283) OR NOT FIREABLE(t59844))))
lola: processed formula length: 51
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t17283) AND FIREABLE(t59844))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1871 markings, 1870 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t53471) OR FIREABLE(t59238))))
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(t53471) OR FIREABLE(t59238))))
lola: processed formula length: 51
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t53471) AND NOT FIREABLE(t59238))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1833 markings, 1832 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-15 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(t17822) OR (FIREABLE(t65200) AND FIREABLE(t56657)))))
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(t17822) OR (FIREABLE(t65200) AND FIREABLE(t56657)))))
lola: processed formula length: 70
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t17822) OR (FIREABLE(t65200) AND FIREABLE(t56657)))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1981 markings, 1980 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t65119) AND (NOT FIREABLE(t41369) OR NOT FIREABLE(t14951) OR NOT FIREABLE(t47779)))))
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(t65119) AND (NOT FIREABLE(t41369) OR NOT FIREABLE(t14951) OR NOT FIREABLE(t47779)))))
lola: processed formula length: 107
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t65119) OR (FIREABLE(t41369) AND FIREABLE(t14951) AND FIREABLE(t47779)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 402 markings, 401 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t40943) AND FIREABLE(t30053) AND (NOT FIREABLE(t62879) OR NOT FIREABLE(t52887)) AND NOT FIREABLE(t30913))))
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(t40943) AND FIREABLE(t30053) AND (NOT FIREABLE(t62879) OR NOT FIREABLE(t52887)) AND NOT FIREABLE(t30913))))
lola: processed formula length: 124
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t40943) AND FIREABLE(t30053) AND (NOT FIREABLE(t62879) OR NOT FIREABLE(t52887)) AND NOT FIREABLE(t30913))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 197 markings, 196 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t2538) OR FIREABLE(t39169)) AND FIREABLE(t62390) AND FIREABLE(t62742) AND FIREABLE(t34553))))
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(t2538) OR FIREABLE(t39169)) AND FIREABLE(t62390) AND FIREABLE(t62742) AND FIREABLE(t34553))))
lola: processed formula length: 111
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t2538) OR FIREABLE(t39169)) AND FIREABLE(t62390) AND FIREABLE(t62742) AND FIREABLE(t34553))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-11-0.sara.
lola: sara is running 0 secs || 1482 markings, 1620 edges, 296 markings/sec, 0 secs
lola: sara is running 5 secs || 2761 markings, 3031 edges, 256 markings/sec, 5 secs
lola: sara is running 10 secs || 3953 markings, 4357 edges, 238 markings/sec, 10 secs
lola: sara is running 15 secs || 5074 markings, 5599 edges, 224 markings/sec, 15 secs
lola: sara is running 20 secs || 6074 markings, 6707 edges, 200 markings/sec, 20 secs
lola: sara is running 25 secs || 7019 markings, 7754 edges, 189 markings/sec, 25 secs
lola: sara is running 30 secs || 7936 markings, 8773 edges, 183 markings/sec, 30 secs
lola: sara is running 35 secs || 8847 markings, 9784 edges, 182 markings/sec, 35 secs
lola: sara is running 40 secs || 9754 markings, 10790 edges, 181 markings/sec, 40 secs
lola: sara is running 45 secs || 10692 markings, 11831 edges, 188 markings/sec, 45 secs
lola: sara is running 50 secs || 11605 markings, 12843 edges, 183 markings/sec, 50 secs
lola: sara is running 55 secs || 12517 markings, 13855 edges, 182 markings/sec, 55 secs
lola: sara is running 60 secs || 13456 markings, 14896 edges, 188 markings/sec, 60 secs
lola: sara is running 65 secs || 14367 markings, 15907 edges, 182 markings/sec, 65 secs
lola: sara is running 70 secs || 15275 markings, 16915 edges, 182 markings/sec, 70 secs
lola: sara is running 75 secs || 16181 markings, 17921 edges, 181 markings/sec, 75 secs
lola: sara is running 80 secs || 17087 markings, 18926 edges, 181 markings/sec, 80 secs
lola: sara is running 85 secs || 18020 markings, 19971 edges, 187 markings/sec, 85 secs
lola: sara is running 90 secs || 18934 markings, 20984 edges, 183 markings/sec, 90 secs
lola: sara is running 95 secs || 19840 markings, 21989 edges, 181 markings/sec, 95 secs
lola: sara is running 100 secs || 20746 markings, 22995 edges, 181 markings/sec, 100 secs
lola: sara is running 105 secs || 21652 markings, 24000 edges, 181 markings/sec, 105 secs
lola: sara is running 110 secs || 22569 markings, 25017 edges, 183 markings/sec, 110 secs
lola: sara is running 115 secs || 23499 markings, 26048 edges, 186 markings/sec, 115 secs
lola: sara is running 120 secs || 24533 markings, 27196 edges, 207 markings/sec, 120 secs
lola: sara is running 125 secs || 25552 markings, 28324 edges, 204 markings/sec, 125 secs
lola: sara is running 130 secs || 26515 markings, 29393 edges, 193 markings/sec, 130 secs
lola: sara is running 135 secs || 27516 markings, 30502 edges, 200 markings/sec, 135 secs
lola: sara is running 140 secs || 28316 markings, 31375 edges, 160 markings/sec, 140 secs
lola: sara is running 145 secs || 29268 markings, 32439 edges, 190 markings/sec, 145 secs
lola: sara is running 150 secs || 30231 markings, 33508 edges, 193 markings/sec, 150 secs
lola: sara is running 155 secs || 31019 markings, 34371 edges, 158 markings/sec, 155 secs
lola: sara is running 160 secs || 33168 markings, 36641 edges, 430 markings/sec, 160 secs
lola: sara is running 165 secs || 35660 markings, 39282 edges, 498 markings/sec, 165 secs
lola: sara is running 170 secs || 38170 markings, 41941 edges, 502 markings/sec, 170 secs
lola: sara is running 175 secs || 40682 markings, 44602 edges, 502 markings/sec, 175 secs
lola: sara is running 180 secs || 43206 markings, 47276 edges, 505 markings/sec, 180 secs
lola: sara is running 185 secs || 46077 markings, 50472 edges, 574 markings/sec, 185 secs
lola: sara is running 190 secs || 49833 markings, 54700 edges, 751 markings/sec, 190 secs
lola: sara is running 195 secs || 53549 markings, 58947 edges, 743 markings/sec, 195 secs
lola: sara is running 200 secs || 57447 markings, 63426 edges, 780 markings/sec, 200 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 59158 markings, 65378 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 838 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t48333) OR FIREABLE(t56091)) AND NOT FIREABLE(t42224)) OR NOT FIREABLE(t40754) OR FIREABLE(t34928))))
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(t48333) OR FIREABLE(t56091)) AND NOT FIREABLE(t42224)) OR NOT FIREABLE(t40754) OR FIREABLE(t34928))))
lola: processed formula length: 122
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t48333) AND NOT FIREABLE(t56091)) OR FIREABLE(t42224)) AND FIREABLE(t40754) AND NOT FIREABLE(t34928))
lola: state equation: Generated DNF with 19 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-12-0.sara.
lola: sara is running 0 secs || 2140 markings, 2400 edges, 428 markings/sec, 0 secs
lola: sara is running 5 secs || 4020 markings, 4546 edges, 376 markings/sec, 5 secs
lola: sara is running 10 secs || 5793 markings, 6568 edges, 355 markings/sec, 10 secs
lola: sara is running 15 secs || 7496 markings, 8512 edges, 341 markings/sec, 15 secs
lola: sara is running 20 secs || 9158 markings, 10410 edges, 332 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9508 markings, 10802 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1109 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t39621) OR NOT FIREABLE(t39186)) AND FIREABLE(t59818)) OR (NOT FIREABLE(t3503) AND NOT FIREABLE(t64113)))))
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(t39621) OR NOT FIREABLE(t39186)) AND FIREABLE(t59818)) OR (NOT FIREABLE(t3503) AND NOT FIREABLE(t64113)))))
lola: processed formula length: 131
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t39621) AND FIREABLE(t39186)) OR NOT FIREABLE(t59818)) AND (FIREABLE(t3503) OR FIREABLE(t64113)))
lola: state equation: Generated DNF with 17 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2327 markings, 2507 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t38710) OR FIREABLE(t27195) OR FIREABLE(t14362) OR FIREABLE(t2761)) AND (FIREABLE(t49172) OR FIREABLE(t18468) OR (FIREABLE(t51512) AND FIREABLE(t46744)) OR FIREABLE(t18564)))))
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(t38710) OR FIREABLE(t27195) OR FIREABLE(t14362) OR FIREABLE(t2761)) AND (FIREABLE(t49172) OR FIREABLE(t18468) OR (FIREABLE(t51512) AND FIREABLE(t46744)) OR FIREABLE(t18564)))))
lola: processed formula length: 199
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t38710) OR FIREABLE(t27195) OR FIREABLE(t14362) OR FIREABLE(t2761)) AND (FIREABLE(t49172) OR FIREABLE(t18468) OR (FIREABLE(t51512) AND FIREABLE(t46744)) OR FIREABLE(t18564)))
lola: state equation: Generated DNF with 48 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1264 markings, 1263 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t2904) OR FIREABLE(t34326) OR NOT FIREABLE(t23019) OR (FIREABLE(t4135) AND FIREABLE(t29660) AND NOT FIREABLE(t15063)) OR (FIREABLE(t61471) AND FIREABLE(t52017) AND (FIREABLE(t4359) OR FIREABLE(t46379)) AND (NOT FIREABLE(t24584) OR NOT FIREABLE(t6762))))))
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(t2904) OR FIREABLE(t34326) OR NOT FIREABLE(t23019) OR (FIREABLE(t4135) AND FIREABLE(t29660) AND NOT FIREABLE(t15063)) OR (FIREABLE(t61471) AND FIREABLE(t52017) AND (FIREABLE(t4359) OR FIREABLE(t46379)) AND (NOT FIREABLE(t24584) OR NOT FIREABLE(t6762))))))
lola: processed formula length: 277
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-6b-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(t2904) AND NOT FIREABLE(t34326) AND FIREABLE(t23019) AND (NOT FIREABLE(t4135) OR NOT FIREABLE(t29660) OR FIREABLE(t15063)) AND (NOT FIREABLE(t61471) OR NOT FIREABLE(t52017) OR (NOT FIREABLE(t4359) AND NOT FIREABLE(t46379)) OR (FIREABLE(t24584) AND FIREABLE(t6762))))
lola: state equation: Generated DNF with 114 literals and 21 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6b-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6b-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 369 markings, 368 edges
lola: ========================================
FORMULA DLCshifumi-PT-6b-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no yes no no yes yes yes no no yes yes yes no
lola:
preliminary result: yes no no no yes no no yes yes yes no no yes yes yes no
lola: memory consumption: 111720 KB
lola: time consumption: 247 seconds
BK_STOP 1526745967980
--------------------
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-6b"
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-6b.tgz
mv DLCshifumi-PT-6b 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-6b, 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-152649735400224"
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 '
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 ;