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 480K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 309K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is AutoFlight-PT-48a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-qhx1-152646241300168
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526670204020

info: Time: 3600 - MCC
===========================================================================================
prep: translating AutoFlight-PT-48a 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 AutoFlight-PT-48a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ AutoFlight-PT-48a @ 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: 2240/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1127
lola: finding significant places
lola: 1127 places, 1113 transitions, 869 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1096 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-48a-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t369) OR (NOT FIREABLE(t175) AND NOT FIREABLE(t1052)) OR ((FIREABLE(t911) OR FIREABLE(t729)) AND (FIREABLE(t239) OR FIREABLE(t444)) AND (NOT FIREABLE(t413) OR NOT FIREABLE(t724)))))) : A (G (((FIREABLE(t415) OR NOT FIREABLE(t613) OR FIREABLE(t767)) AND (NOT FIREABLE(t65) OR NOT FIREABLE(t284) OR (FIREABLE(t317) AND FIREABLE(t1054) AND FIREABLE(t334)))))) : A (G (((NOT FIREABLE(t62) OR NOT FIREABLE(t401) OR NOT FIREABLE(t209)) AND NOT FIREABLE(t799)))) : A (G ((((NOT FIREABLE(t495) OR NOT FIREABLE(t421)) AND (NOT FIREABLE(t602) OR NOT FIREABLE(t1028))) OR (NOT FIREABLE(t423) AND FIREABLE(t164))))) : A (G (((NOT FIREABLE(t960) AND NOT FIREABLE(t519)) OR FIREABLE(t1078) OR (FIREABLE(t1013) AND FIREABLE(t990) AND (FIREABLE(t82) OR FIREABLE(t955)) AND FIREABLE(t980))))) : E (F (((FIREABLE(t1010) AND FIREABLE(t903) AND NOT FIREABLE(t881)) OR (FIREABLE(t986) AND FIREABLE(t248) AND FIREABLE(t148)) OR FIREABLE(t403)))) : E (F (FIREABLE(t679))) : A (G (((NOT FIREABLE(t259) OR NOT FIREABLE(t9) OR FIREABLE(t73)) AND (NOT FIREABLE(t473) OR NOT FIREABLE(t1112) OR NOT FIREABLE(t360))))) : E (F ((NOT FIREABLE(t867) AND FIREABLE(t699)))) : A (G ((FIREABLE(t289) OR NOT FIREABLE(t270) OR FIREABLE(t837) OR NOT FIREABLE(t1030) OR NOT FIREABLE(t641) OR (NOT FIREABLE(t743) AND NOT FIREABLE(t441))))) : E (F ((FIREABLE(t34) AND FIREABLE(t608) AND FIREABLE(t647)))) : E (F ((FIREABLE(t801) AND FIREABLE(t386) AND NOT FIREABLE(t788)))) : E (F ((FIREABLE(t584) AND FIREABLE(t992) AND NOT FIREABLE(t737)))) : E (F ((NOT FIREABLE(t453) AND FIREABLE(t354) AND (FIREABLE(t905) OR FIREABLE(t630))))) : E (F ((FIREABLE(t19) AND (FIREABLE(t887) OR FIREABLE(t1075) OR (FIREABLE(t309) AND FIREABLE(t927)) OR NOT FIREABLE(t118))))) : E (F (FIREABLE(t181)))
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(t679)))
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(t679)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-48a-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(t679)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48a-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: 14 markings, 13 edges
lola: ========================================

FORMULA AutoFlight-PT-48a-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t181)))
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(t181)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-48a-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(t181)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48a-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: 7 markings, 6 edges
lola: ========================================

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

FORMULA AutoFlight-PT-48a-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t801) AND FIREABLE(t386) AND NOT FIREABLE(t788))))
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(t801) AND FIREABLE(t386) AND NOT FIREABLE(t788))))
lola: processed formula length: 66
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-48a-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(t801) AND FIREABLE(t386) AND NOT FIREABLE(t788))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
sara: try reading problem file AutoFlight-PT-48a-ReachabilityFireability-2-0.sara.
lola: state equation: write sara problem file to AutoFlight-PT-48a-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48a-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


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

FORMULA AutoFlight-PT-48a-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t584) AND FIREABLE(t992) AND NOT FIREABLE(t737))))
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(t584) AND FIREABLE(t992) AND NOT FIREABLE(t737))))
lola: processed formula length: 66
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-48a-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(t584) AND FIREABLE(t992) AND NOT FIREABLE(t737))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48a-ReachabilityFireability-4-0.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48a-ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA AutoFlight-PT-48a-ReachabilityFireability-12 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(t34) AND FIREABLE(t608) AND FIREABLE(t647))))
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(t34) AND FIREABLE(t608) AND FIREABLE(t647))))
lola: processed formula length: 61
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-48a-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(t34) AND FIREABLE(t608) AND FIREABLE(t647))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48a-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48a-ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA AutoFlight-PT-48a-ReachabilityFireability-10 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: E (F ((NOT FIREABLE(t453) AND FIREABLE(t354) AND (FIREABLE(t905) OR FIREABLE(t630)))))
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(t453) AND FIREABLE(t354) AND (FIREABLE(t905) OR FIREABLE(t630)))))
lola: processed formula length: 87
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-48a-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(t453) AND FIREABLE(t354) AND (FIREABLE(t905) OR FIREABLE(t630)))
lola: state equation: Generated DNF with 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48a-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 45 markings, 44 edges
lola: ========================================

FORMULA AutoFlight-PT-48a-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t62) OR NOT FIREABLE(t401) OR NOT FIREABLE(t209)) AND NOT FIREABLE(t799))))
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(t62) OR NOT FIREABLE(t401) OR NOT FIREABLE(t209)) AND NOT FIREABLE(t799))))
lola: processed formula length: 98
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-48a-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(t62) AND FIREABLE(t401) AND FIREABLE(t209)) OR FIREABLE(t799))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48a-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48a-ReachabilityFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA AutoFlight-PT-48a-ReachabilityFireability-2 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: A (G ((((NOT FIREABLE(t495) OR NOT FIREABLE(t421)) AND (NOT FIREABLE(t602) OR NOT FIREABLE(t1028))) OR (NOT FIREABLE(t423) AND FIREABLE(t164)))))
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(t495) OR NOT FIREABLE(t421)) AND (NOT FIREABLE(t602) OR NOT FIREABLE(t1028))) OR (NOT FIREABLE(t423) AND FIREABLE(t164)))))
lola: processed formula length: 148
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-48a-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(t495) AND FIREABLE(t421)) OR (FIREABLE(t602) AND FIREABLE(t1028))) AND (FIREABLE(t423) OR NOT FIREABLE(t164)))
lola: state equation: Generated DNF with 22 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48a-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48a-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA AutoFlight-PT-48a-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t19) AND (FIREABLE(t887) OR FIREABLE(t1075) OR (FIREABLE(t309) AND FIREABLE(t927)) OR NOT FIREABLE(t118)))))
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(t19) AND (FIREABLE(t887) OR FIREABLE(t1075) OR (FIREABLE(t309) AND FIREABLE(t927)) OR NOT FIREABLE(t118)))))
lola: processed formula length: 127
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-48a-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(t19) AND (FIREABLE(t887) OR FIREABLE(t1075) OR (FIREABLE(t309) AND FIREABLE(t927)) OR NOT FIREABLE(t118)))
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48a-ReachabilityFireability-9-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA AutoFlight-PT-48a-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t259) OR NOT FIREABLE(t9) OR FIREABLE(t73)) AND (NOT FIREABLE(t473) OR NOT FIREABLE(t1112) OR NOT FIREABLE(t360)))))
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(t259) OR NOT FIREABLE(t9) OR FIREABLE(t73)) AND (NOT FIREABLE(t473) OR NOT FIREABLE(t1112) OR NOT FIREABLE(t360)))))
lola: processed formula length: 141
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-48a-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(t259) AND FIREABLE(t9) AND NOT FIREABLE(t73)) OR (FIREABLE(t473) AND FIREABLE(t1112) AND FIREABLE(t360)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48a-ReachabilityFireability-10-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: 16 markings, 15 edges
lola: ========================================

FORMULA AutoFlight-PT-48a-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1010) AND FIREABLE(t903) AND NOT FIREABLE(t881)) OR (FIREABLE(t986) AND FIREABLE(t248) AND FIREABLE(t148)) OR FIREABLE(t403))))
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(t1010) AND FIREABLE(t903) AND NOT FIREABLE(t881)) OR (FIREABLE(t986) AND FIREABLE(t248) AND FIREABLE(t148)) OR FIREABLE(t403))))
lola: processed formula length: 147
lola: 1 rewrites
lola: closed formula file AutoFlight-PT-48a-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(t1010) AND FIREABLE(t903) AND NOT FIREABLE(t881)) OR (FIREABLE(t986) AND FIREABLE(t248) AND FIREABLE(t148)) OR FIREABLE(t403))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to AutoFlight-PT-48a-ReachabilityFireability-11-0.sara
lola: The predicate is reachable.
lola: 6 markings, 5 edges

FORMULA AutoFlight-PT-48a-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t289) OR NOT FIREABLE(t270) OR FIREABLE(t837) OR NOT FIREABLE(t1030) OR NOT FIREABLE(t641) OR (NOT FIREABLE(t743) AND NOT FIREABLE(t441)))))
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(t289) OR NOT FIREABLE(t270) OR FIREABLE(t837) OR NOT FIREABLE(t1030) OR NOT FIREABLE(t641) OR (NOT FIREABLE(t743) AND NOT FIREABLE(t441)))))
lola: processed formula length: 161
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-48a-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 AutoFlight-PT-48a-ReachabilityFireability-11-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t289) AND FIREABLE(t270) AND NOT FIREABLE(t837) AND FIREABLE(t1030) AND FIREABLE(t641) AND (FIREABLE(t743) OR FIREABLE(t441)))
lola: state equation: Generated DNF with 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48a-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48a-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA AutoFlight-PT-48a-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t960) AND NOT FIREABLE(t519)) OR FIREABLE(t1078) OR (FIREABLE(t1013) AND FIREABLE(t990) AND (FIREABLE(t82) OR FIREABLE(t955)) AND FIREABLE(t980)))))
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(t960) AND NOT FIREABLE(t519)) OR FIREABLE(t1078) OR (FIREABLE(t1013) AND FIREABLE(t990) AND (FIREABLE(t82) OR FIREABLE(t955)) AND FIREABLE(t980)))))
lola: processed formula length: 172
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-48a-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(t960) OR FIREABLE(t519)) AND NOT FIREABLE(t1078) AND (NOT FIREABLE(t1013) OR NOT FIREABLE(t990) OR (NOT FIREABLE(t82) AND NOT FIREABLE(t955)) OR NOT FIREABLE(t980)))
lola: state equation: Generated DNF with 74 literals and 20 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48a-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48a-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA AutoFlight-PT-48a-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t415) OR NOT FIREABLE(t613) OR FIREABLE(t767)) AND (NOT FIREABLE(t65) OR NOT FIREABLE(t284) OR (FIREABLE(t317) AND FIREABLE(t1054) AND FIREABLE(t334))))))
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(t415) OR NOT FIREABLE(t613) OR FIREABLE(t767)) AND (NOT FIREABLE(t65) OR NOT FIREABLE(t284) OR (FIREABLE(t317) AND FIREABLE(t1054) AND FIREABLE(t334))))))
lola: processed formula length: 175
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-48a-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(t415) AND FIREABLE(t613) AND NOT FIREABLE(t767)) OR (FIREABLE(t65) AND FIREABLE(t284) AND (NOT FIREABLE(t317) OR NOT FIREABLE(t1054) OR NOT FIREABLE(t334))))
lola: state equation: Generated DNF with 28 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48a-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges

FORMULA AutoFlight-PT-48a-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 15 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t369) OR (NOT FIREABLE(t175) AND NOT FIREABLE(t1052)) OR ((FIREABLE(t911) OR FIREABLE(t729)) AND (FIREABLE(t239) OR FIREABLE(t444)) AND (NOT FIREABLE(t413) OR NOT FIREABLE(t724))))))
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(t369) OR (NOT FIREABLE(t175) AND NOT FIREABLE(t1052)) OR ((FIREABLE(t911) OR FIREABLE(t729)) AND (FIREABLE(t239) OR FIREABLE(t444)) AND (NOT FIREABLE(t413) OR NOT FIREABLE(t724))))))
lola: processed formula length: 207
lola: 2 rewrites
lola: closed formula file AutoFlight-PT-48a-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(t369) AND (FIREABLE(t175) OR FIREABLE(t1052)) AND ((NOT FIREABLE(t911) AND NOT FIREABLE(t729)) OR (NOT FIREABLE(t239) AND NOT FIREABLE(t444)) OR (FIREABLE(t413) AND FIREABLE(t724))))
lola: state equation: Generated DNF with 49 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48a-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48a-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 150 markings, 236 edges
lola: ========================================

FORMULA AutoFlight-PT-48a-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no yes yes no yes yes no no no yes yes yes
lola:
preliminary result: no no no yes no yes yes no yes yes no no no yes yes yes
lola: memory consumption: 18000 KB
lola: time consumption: 9 seconds
sara: place or transition ordering is non-deterministic


BK_STOP 1526670233542

--------------------
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="AutoFlight-PT-48a"
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/AutoFlight-PT-48a.tgz
mv AutoFlight-PT-48a 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 AutoFlight-PT-48a, 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 r016-qhx1-152646241300168"
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 ;