fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r268-smll-152749145700405
Last Updated
June 26, 2018

About the Execution of LoLA for DLCflexbar-PT-4a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
289.550 7168.00 19540.00 17.40 FTTF?TTTTTTTTTFT 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 1.9M
-rw-r--r-- 1 mcc users 3.1K May 29 18:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 29 18:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 28 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 28 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 28 09:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K May 28 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 4.3K May 27 06:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K May 27 06:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 26 07:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 26 07:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 3 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 1.7M May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DLCflexbar-PT-4a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145700405

=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528103021549

info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCflexbar-PT-4a 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 DLCflexbar-PT-4a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DLCflexbar-PT-4a @ 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: 7542/65536 symbol table entries, 1989 collisions
lola: preprocessing...
lola: Size of bit vector: 927
lola: finding significant places
lola: 927 places, 6615 transitions, 319 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5746 transition conflict sets
lola: TASK
lola: reading formula from DLCflexbar-PT-4a-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t5006) OR NOT FIREABLE(t188)))) : E (F ((FIREABLE(t3773) AND FIREABLE(t983) AND (NOT FIREABLE(t6162) OR NOT FIREABLE(t6394))))) : E (F (FIREABLE(t780))) : A (G (((FIREABLE(t6356) AND FIREABLE(t6417)) OR NOT FIREABLE(t442) OR (NOT FIREABLE(t2098) AND (FIREABLE(t19) OR FIREABLE(t831))) OR (FIREABLE(t1958) AND FIREABLE(t4181))))) : A (G (((FIREABLE(t5676) AND (NOT FIREABLE(t6301) OR NOT FIREABLE(t605))) OR NOT FIREABLE(t777)))) : E (F (FIREABLE(t862))) : E (F ((FIREABLE(t5360) AND FIREABLE(t4084)))) : E (F (FIREABLE(t2285))) : E (F (((NOT FIREABLE(t1077) OR NOT FIREABLE(t3596)) AND (NOT FIREABLE(t56) OR NOT FIREABLE(t3631)) AND FIREABLE(t5812) AND FIREABLE(t1499) AND NOT FIREABLE(t275) AND FIREABLE(t4750) AND FIREABLE(t6120) AND FIREABLE(t1227)))) : E (F ((FIREABLE(t2613) AND FIREABLE(t112) AND NOT FIREABLE(t1927)))) : E (F ((FIREABLE(t3057) AND FIREABLE(t4090) AND NOT FIREABLE(t2182)))) : E (F ((FIREABLE(t1406) AND FIREABLE(t3772) AND (NOT FIREABLE(t2522) OR NOT FIREABLE(t5886) OR (NOT FIREABLE(t6252) AND NOT FIREABLE(t5057)))))) : E (F (((FIREABLE(t1224) OR FIREABLE(t528) OR (FIREABLE(t5234) AND FIREABLE(t2025))) AND (NOT FIREABLE(t3377) OR NOT FIREABLE(t4748)) AND FIREABLE(t5360)))) : E (F (FIREABLE(t285))) : E (F ((NOT FIREABLE(t5490) AND NOT FIREABLE(t1249) AND FIREABLE(t5331) AND NOT FIREABLE(t5135)))) : E (F ((FIREABLE(t3178) AND FIREABLE(t45) AND NOT FIREABLE(t1011) AND FIREABLE(t2864) AND FIREABLE(t4088))))
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(t780)))
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(t780)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4a-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(t780)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA DLCflexbar-PT-4a-ReachabilityFireability-2 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(t862)))
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(t862)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4a-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)
sara: try reading problem file DLCflexbar-PT-4a-ReachabilityFireability-0.sara.
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(t862)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-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: 4 markings, 3 edges

FORMULA DLCflexbar-PT-4a-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t2285)))
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(t2285)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4a-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(t2285)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-ReachabilityFireability-2-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA DLCflexbar-PT-4a-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t285)))
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(t285)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4a-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(t285)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA DLCflexbar-PT-4a-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: A (G ((NOT FIREABLE(t5006) OR NOT FIREABLE(t188))))
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(t5006) OR NOT FIREABLE(t188))))
lola: processed formula length: 52
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-4a-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(t5006) AND FIREABLE(t188))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-ReachabilityFireability-4-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: 6 markings, 5 edges
lola: ========================================

FORMULA DLCflexbar-PT-4a-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t5360) AND FIREABLE(t4084))))
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(t5360) AND FIREABLE(t4084))))
lola: processed formula length: 45
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4a-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(t5360) AND FIREABLE(t4084))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4a-ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA DLCflexbar-PT-4a-ReachabilityFireability-6 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(t3057) AND FIREABLE(t4090) AND NOT FIREABLE(t2182))))
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(t3057) AND FIREABLE(t4090) AND NOT FIREABLE(t2182))))
lola: processed formula length: 69
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4a-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(t3057) AND FIREABLE(t4090) AND NOT FIREABLE(t2182))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA DLCflexbar-PT-4a-ReachabilityFireability-10 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 ((FIREABLE(t2613) AND FIREABLE(t112) AND NOT FIREABLE(t1927))))
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(t2613) AND FIREABLE(t112) AND NOT FIREABLE(t1927))))
lola: processed formula length: 68
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4a-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(t2613) AND FIREABLE(t112) AND NOT FIREABLE(t1927))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4a-ReachabilityFireability-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges

lola: ========================================
FORMULA DLCflexbar-PT-4a-ReachabilityFireability-9 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: E (F ((FIREABLE(t3773) AND FIREABLE(t983) AND (NOT FIREABLE(t6162) OR NOT FIREABLE(t6394)))))
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(t3773) AND FIREABLE(t983) AND (NOT FIREABLE(t6162) OR NOT FIREABLE(t6394)))))
lola: processed formula length: 94
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4a-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(t3773) AND FIREABLE(t983) AND (NOT FIREABLE(t6162) OR NOT FIREABLE(t6394)))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4a-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA DLCflexbar-PT-4a-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t5676) AND (NOT FIREABLE(t6301) OR NOT FIREABLE(t605))) OR NOT FIREABLE(t777))))
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(t5676) AND (NOT FIREABLE(t6301) OR NOT FIREABLE(t605))) OR NOT FIREABLE(t777))))
lola: processed formula length: 99
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-4a-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(t5676) OR (FIREABLE(t6301) AND FIREABLE(t605))) AND FIREABLE(t777))
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4a-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges

lola: FORMULA DLCflexbar-PT-4a-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t5490) AND NOT FIREABLE(t1249) AND FIREABLE(t5331) AND NOT FIREABLE(t5135))))
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(t5490) AND NOT FIREABLE(t1249) AND FIREABLE(t5331) AND NOT FIREABLE(t5135))))
lola: processed formula length: 97
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4a-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(t5490) AND NOT FIREABLE(t1249) AND FIREABLE(t5331) AND NOT FIREABLE(t5135))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4a-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 6142 markings, 159580 edges, 1228 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA DLCflexbar-PT-4a-ReachabilityFireability-14 FALSE 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(t3178) AND FIREABLE(t45) AND NOT FIREABLE(t1011) AND FIREABLE(t2864) AND FIREABLE(t4088))))
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(t3178) AND FIREABLE(t45) AND NOT FIREABLE(t1011) AND FIREABLE(t2864) AND FIREABLE(t4088))))
lola: processed formula length: 107
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4a-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(t3178) AND FIREABLE(t45) AND NOT FIREABLE(t1011) AND FIREABLE(t2864) AND FIREABLE(t4088))
lola: state equation: Generated DNF with 16 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA DLCflexbar-PT-4a-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1406) AND FIREABLE(t3772) AND (NOT FIREABLE(t2522) OR NOT FIREABLE(t5886) OR (NOT FIREABLE(t6252) AND NOT FIREABLE(t5057))))))
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(t1406) AND FIREABLE(t3772) AND (NOT FIREABLE(t2522) OR NOT FIREABLE(t5886) OR (NOT FIREABLE(t6252) AND NOT FIREABLE(t5057))))))
lola: processed formula length: 145
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4a-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(t1406) AND FIREABLE(t3772) AND (NOT FIREABLE(t2522) OR NOT FIREABLE(t5886) OR (NOT FIREABLE(t6252) AND NOT FIREABLE(t5057))))
lola: state equation: Generated DNF with 32 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4a-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA DLCflexbar-PT-4a-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1224) OR FIREABLE(t528) OR (FIREABLE(t5234) AND FIREABLE(t2025))) AND (NOT FIREABLE(t3377) OR NOT FIREABLE(t4748)) AND FIREABLE(t5360))))
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(t1224) OR FIREABLE(t528) OR (FIREABLE(t5234) AND FIREABLE(t2025))) AND (NOT FIREABLE(t3377) OR NOT FIREABLE(t4748)) AND FIREABLE(t5360))))
lola: processed formula length: 158
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4a-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(t1224) OR FIREABLE(t528) OR (FIREABLE(t5234) AND FIREABLE(t2025))) AND (NOT FIREABLE(t3377) OR NOT FIREABLE(t4748)) AND FIREABLE(t5360))
lola: state equation: Generated DNF with 68 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-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: 4 markings, 3 edges
lola: ========================================

FORMULA DLCflexbar-PT-4a-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t6356) AND FIREABLE(t6417)) OR NOT FIREABLE(t442) OR (NOT FIREABLE(t2098) AND (FIREABLE(t19) OR FIREABLE(t831))) OR (FIREABLE(t1958) AND FIREABLE(t4181)))))
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(t6356) AND FIREABLE(t6417)) OR NOT FIREABLE(t442) OR (NOT FIREABLE(t2098) AND (FIREABLE(t19) OR FIREABLE(t831))) OR (FIREABLE(t1958) AND FIREABLE(t4181)))))
lola: processed formula length: 177
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-4a-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(t6356) OR NOT FIREABLE(t6417)) AND FIREABLE(t442) AND (FIREABLE(t2098) OR (NOT FIREABLE(t19) AND NOT FIREABLE(t831))) AND (NOT FIREABLE(t1958) OR NOT FIREABLE(t4181)))
lola: state equation: Generated DNF with 240 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-ReachabilityFireability-14-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: 4 markings, 3 edges
lola: ========================================

FORMULA DLCflexbar-PT-4a-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t1077) OR NOT FIREABLE(t3596)) AND (NOT FIREABLE(t56) OR NOT FIREABLE(t3631)) AND FIREABLE(t5812) AND FIREABLE(t1499) AND NOT FIREABLE(t275) AND FIREABLE(t4750) AND FIREABLE(t6120) AND FIREABLE(t1227))))
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(t1077) OR NOT FIREABLE(t3596)) AND (NOT FIREABLE(t56) OR NOT FIREABLE(t3631)) AND FIREABLE(t5812) AND FIREABLE(t1499) AND NOT FIREABLE(t275) AND FIREABLE(t4750) AND FIREABLE(t6120) AND FIREABLE(t1227))))
lola: processed formula length: 226
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4a-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(t1077) OR NOT FIREABLE(t3596)) AND (NOT FIREABLE(t56) OR NOT FIREABLE(t3631)) AND FIREABLE(t5812) AND FIREABLE(t1499) AND NOT FIREABLE(t275) AND FIREABLE(t4750) AND FIREABLE(t6120) AND FIREABLE(t1227))
lola: state equation: Generated DNF with 156 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4a-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4a-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA DLCflexbar-PT-4a-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no yes yes yes yes yes yes yes yes yes no yes
lola:
preliminary result: no yes yes no no yes yes yes yes yes yes yes yes yes no yes
lola: memory consumption: 52464 KB
lola: time consumption: 7 seconds

BK_STOP 1528103028717

--------------------
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="DLCflexbar-PT-4a"
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/DLCflexbar-PT-4a.tgz
mv DLCflexbar-PT-4a 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 DLCflexbar-PT-4a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-152749145700405"
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 ;