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 236K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 64K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is FlexibleBarrier-PT-08a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998100133
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526643928528

info: Time: 3600 - MCC
===========================================================================================
prep: translating FlexibleBarrier-PT-08a 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 FlexibleBarrier-PT-08a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ FlexibleBarrier-PT-08a @ 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: 335/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 99
lola: finding significant places
lola: 99 places, 236 transitions, 89 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 204 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-08a-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(t124) AND NOT FIREABLE(t17) AND FIREABLE(t59) AND FIREABLE(t200)))) : E (F (((FIREABLE(t14) AND NOT FIREABLE(t173)) OR (FIREABLE(t88) AND FIREABLE(t95) AND FIREABLE(t57) AND (FIREABLE(t207) OR FIREABLE(t50)))))) : E (F (((FIREABLE(t130) OR FIREABLE(t220)) AND FIREABLE(t106)))) : A (G ((NOT FIREABLE(t27) OR (FIREABLE(t2) AND FIREABLE(t128) AND (FIREABLE(t87) OR FIREABLE(t122))) OR FIREABLE(t225)))) : E (F (((FIREABLE(t35) OR (FIREABLE(t133) AND FIREABLE(t203))) AND FIREABLE(t145)))) : E (F ((FIREABLE(t184) AND FIREABLE(t94) AND FIREABLE(t206) AND FIREABLE(t79) AND (NOT FIREABLE(t60) OR NOT FIREABLE(t6)) AND NOT FIREABLE(t156) AND NOT FIREABLE(t25) AND NOT FIREABLE(t16) AND NOT FIREABLE(t150)))) : E (F ((NOT FIREABLE(t224) AND NOT FIREABLE(t137) AND NOT FIREABLE(t203) AND NOT FIREABLE(t167) AND FIREABLE(t221)))) : E (F ((FIREABLE(t119) AND FIREABLE(t179) AND (FIREABLE(t78) OR (FIREABLE(t171) AND FIREABLE(t73)) OR NOT FIREABLE(t130))))) : E (F ((FIREABLE(t12) AND FIREABLE(t86) AND (FIREABLE(t155) OR FIREABLE(t95)) AND FIREABLE(t226) AND (NOT FIREABLE(t27) OR NOT FIREABLE(t144) OR FIREABLE(t13))))) : E (F ((FIREABLE(t172) AND FIREABLE(t235) AND FIREABLE(t61) AND FIREABLE(t53) AND FIREABLE(t26) AND (NOT FIREABLE(t165) OR NOT FIREABLE(t86)) AND ((FIREABLE(t19) AND FIREABLE(t37)) OR FIREABLE(t185))))) : E (F ((FIREABLE(t46) AND FIREABLE(t230) AND NOT FIREABLE(t135)))) : E (F (FIREABLE(t51))) : E (F ((FIREABLE(t85) AND (FIREABLE(t207) OR FIREABLE(t184) OR FIREABLE(t47)) AND ((NOT FIREABLE(t203) AND NOT FIREABLE(t197)) OR (NOT FIREABLE(t229) AND NOT FIREABLE(t102)))))) : E (F (((NOT FIREABLE(t106) OR NOT FIREABLE(t120) OR ((FIREABLE(t82) OR FIREABLE(t94)) AND (FIREABLE(t25) OR FIREABLE(t163)))) AND FIREABLE(t223)))) : E (F ((FIREABLE(t95) AND NOT FIREABLE(t178) AND ((FIREABLE(t230) AND FIREABLE(t51) AND NOT FIREABLE(t113)) OR FIREABLE(t169))))) : E (F (((NOT FIREABLE(t50) OR NOT FIREABLE(t3)) AND FIREABLE(t193) AND FIREABLE(t95))))
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(t51)))
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(t51)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-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(t51)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-08a-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-08a-ReachabilityFireability-11 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(t46) AND FIREABLE(t230) AND NOT FIREABLE(t135))))
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(t46) AND FIREABLE(t230) AND NOT FIREABLE(t135))))
lola: processed formula length: 65
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-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(t46) AND FIREABLE(t230) AND NOT FIREABLE(t135))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-08a-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-08a-ReachabilityFireability-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 FlexibleBarrier-PT-08a-ReachabilityFireability-10 FALSE 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 (((FIREABLE(t130) OR FIREABLE(t220)) AND FIREABLE(t106))))
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(t130) OR FIREABLE(t220)) AND FIREABLE(t106))))
lola: processed formula length: 64
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-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(t130) OR FIREABLE(t220)) AND FIREABLE(t106))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-08a-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-08a-ReachabilityFireability-2-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 FlexibleBarrier-PT-08a-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t124) AND NOT FIREABLE(t17) AND FIREABLE(t59) AND FIREABLE(t200))))
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(t124) AND NOT FIREABLE(t17) AND FIREABLE(t59) AND FIREABLE(t200))))
lola: processed formula length: 87
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-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(t124) AND NOT FIREABLE(t17) AND FIREABLE(t59) AND FIREABLE(t200))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola:
FORMULA FlexibleBarrier-PT-08a-ReachabilityFireability-0 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(t35) OR (FIREABLE(t133) AND FIREABLE(t203))) AND FIREABLE(t145))))
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(t35) OR (FIREABLE(t133) AND FIREABLE(t203))) AND FIREABLE(t145))))
lola: processed formula length: 84
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-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(t35) OR (FIREABLE(t133) AND FIREABLE(t203))) AND FIREABLE(t145))
lola: state equation: Generated DNF with 13 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-08a-ReachabilityFireability-4-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: 50 markings, 78 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-08a-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t50) OR NOT FIREABLE(t3)) AND FIREABLE(t193) AND FIREABLE(t95))))
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(t50) OR NOT FIREABLE(t3)) AND FIREABLE(t193) AND FIREABLE(t95))))
lola: processed formula length: 87
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-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(t50) OR NOT FIREABLE(t3)) AND FIREABLE(t193) AND FIREABLE(t95))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-08a-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-08a-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.

FORMULA FlexibleBarrier-PT-08a-ReachabilityFireability-15 FALSE 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 ((NOT FIREABLE(t224) AND NOT FIREABLE(t137) AND NOT FIREABLE(t203) AND NOT FIREABLE(t167) AND FIREABLE(t221))))
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(t224) AND NOT FIREABLE(t137) AND NOT FIREABLE(t203) AND NOT FIREABLE(t167) AND FIREABLE(t221))))
lola: processed formula length: 116
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola:
FORMULA FlexibleBarrier-PT-08a-ReachabilityFireability-6 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(t119) AND FIREABLE(t179) AND (FIREABLE(t78) OR (FIREABLE(t171) AND FIREABLE(t73)) OR NOT FIREABLE(t130)))))
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(t119) AND FIREABLE(t179) AND (FIREABLE(t78) OR (FIREABLE(t171) AND FIREABLE(t73)) OR NOT FIREABLE(t130)))))
lola: processed formula length: 125
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-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(t119) AND FIREABLE(t179) AND (FIREABLE(t78) OR (FIREABLE(t171) AND FIREABLE(t73)) OR NOT FIREABLE(t130)))
lola: state equation: Generated DNF with 23 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-08a-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file FlexibleBarrier-PT-08a-ReachabilityFireability-7-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 FlexibleBarrier-PT-08a-ReachabilityFireability-7 FALSE 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(t95) AND NOT FIREABLE(t178) AND ((FIREABLE(t230) AND FIREABLE(t51) AND NOT FIREABLE(t113)) OR FIREABLE(t169)))))
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(t95) AND NOT FIREABLE(t178) AND ((FIREABLE(t230) AND FIREABLE(t51) AND NOT FIREABLE(t113)) OR FIREABLE(t169)))))
lola: processed formula length: 129
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-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(t95) AND NOT FIREABLE(t178) AND ((FIREABLE(t230) AND FIREABLE(t51) AND NOT FIREABLE(t113)) OR FIREABLE(t169)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: state equation: Generated DNF with 48 literals and 8 conjunctive subformulas
lola: ========================================

FORMULA FlexibleBarrier-PT-08a-ReachabilityFireability-14 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: A (G ((NOT FIREABLE(t27) OR (FIREABLE(t2) AND FIREABLE(t128) AND (FIREABLE(t87) OR FIREABLE(t122))) OR FIREABLE(t225))))
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(t27) OR (FIREABLE(t2) AND FIREABLE(t128) AND (FIREABLE(t87) OR FIREABLE(t122))) OR FIREABLE(t225))))
lola: processed formula length: 123
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-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(t27) AND (NOT FIREABLE(t2) OR NOT FIREABLE(t128) OR (NOT FIREABLE(t87) AND NOT FIREABLE(t122))) AND NOT FIREABLE(t225))
lola: state equation: Generated DNF with 36 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-08a-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-08a-ReachabilityFireability-3 FALSE 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: E (F (((FIREABLE(t14) AND NOT FIREABLE(t173)) OR (FIREABLE(t88) AND FIREABLE(t95) AND FIREABLE(t57) AND (FIREABLE(t207) OR FIREABLE(t50))))))
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(t14) AND NOT FIREABLE(t173)) OR (FIREABLE(t88) AND FIREABLE(t95) AND FIREABLE(t57) AND (FIREABLE(t207) OR FIREABLE(t50))))))
lola: processed formula length: 143
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-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(t14) AND NOT FIREABLE(t173)) OR (FIREABLE(t88) AND FIREABLE(t95) AND FIREABLE(t57) AND (FIREABLE(t207) OR FIREABLE(t50))))
lola: state equation: Generated DNF with 20 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-08a-ReachabilityFireability-1 TRUE 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 (((NOT FIREABLE(t106) OR NOT FIREABLE(t120) OR ((FIREABLE(t82) OR FIREABLE(t94)) AND (FIREABLE(t25) OR FIREABLE(t163)))) AND FIREABLE(t223))))
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(t106) OR NOT FIREABLE(t120) OR ((FIREABLE(t82) OR FIREABLE(t94)) AND (FIREABLE(t25) OR FIREABLE(t163)))) AND FIREABLE(t223))))
lola: processed formula length: 151
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-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(t106) OR NOT FIREABLE(t120) OR ((FIREABLE(t82) OR FIREABLE(t94)) AND (FIREABLE(t25) OR FIREABLE(t163)))) AND FIREABLE(t223))
lola: state equation: Generated DNF with 28 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-08a-ReachabilityFireability-11-0.sara
lola: lola: state equation: calling and running sara
SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-08a-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file FlexibleBarrier-PT-08a-ReachabilityFireability-11-0.sara.
lola: ...considering subproblem: E (F ((FIREABLE(t85) AND (FIREABLE(t207) OR FIREABLE(t184) OR FIREABLE(t47)) AND ((NOT FIREABLE(t203) AND NOT FIREABLE(t197)) OR (NOT FIREABLE(t229) AND NOT FIREABLE(t102))))))
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(t85) AND (FIREABLE(t207) OR FIREABLE(t184) OR FIREABLE(t47)) AND ((NOT FIREABLE(t203) AND NOT FIREABLE(t197)) OR (NOT FIREABLE(t229) AND NOT FIREABLE(t102))))))
lola: processed formula length: 179
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-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(t85) AND (FIREABLE(t207) OR FIREABLE(t184) OR FIREABLE(t47)) AND ((NOT FIREABLE(t203) AND NOT FIREABLE(t197)) OR (NOT FIREABLE(t229) AND NOT FIREABLE(t102))))
lola: state equation: Generated DNF with 85 literals and 15 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-08a-ReachabilityFireability-12-0.sara
lola: SUBRESULT
lola: state equation: calling and running sara
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-08a-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t12) AND FIREABLE(t86) AND (FIREABLE(t155) OR FIREABLE(t95)) AND FIREABLE(t226) AND (NOT FIREABLE(t27) OR NOT FIREABLE(t144) OR FIREABLE(t13)))))
lola: ========================================
lola: SUBTASK
sara: try reading problem file FlexibleBarrier-PT-08a-ReachabilityFireability-12-0.sara.
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(t12) AND FIREABLE(t86) AND (FIREABLE(t155) OR FIREABLE(t95)) AND FIREABLE(t226) AND (NOT FIREABLE(t27) OR NOT FIREABLE(t144) OR FIREABLE(t13)))))
lola: processed formula length: 164
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
sara: place or transition ordering is non-deterministic
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(t12) AND FIREABLE(t86) AND (FIREABLE(t155) OR FIREABLE(t95)) AND FIREABLE(t226) AND (NOT FIREABLE(t27) OR NOT FIREABLE(t144) OR FIREABLE(t13)))
lola: state equation: Generated DNF with 67 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-08a-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-08a-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t184) AND FIREABLE(t94) AND FIREABLE(t206) AND FIREABLE(t79) AND (NOT FIREABLE(t60) OR NOT FIREABLE(t6)) AND NOT FIREABLE(t156) AND NOT FIREABLE(t25) AND NOT FIREABLE(t16) AND NOT FIREABLE(t150))))
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(t184) AND FIREABLE(t94) AND FIREABLE(t206) AND FIREABLE(t79) AND (NOT FIREABLE(t60) OR NOT FIREABLE(t6)) AND NOT FIREABLE(t156) AND NOT FIREABLE(t25) AND NOT FIREABLE(t16) AND NOT FIREABLE(t150))))
lola: processed formula length: 214
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-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(t184) AND FIREABLE(t94) AND FIREABLE(t206) AND FIREABLE(t79) AND (NOT FIREABLE(t60) OR NOT FIREABLE(t6)) AND NOT FIREABLE(t156) AND NOT FIREABLE(t25) AND NOT FIREABLE(t16) AND NOT FIREABLE(t150))
lola: state equation: Generated DNF with 120 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-08a-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file FlexibleBarrier-PT-08a-ReachabilityFireability-14-0.sara.

sara: place or transition ordering is non-deterministic


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

FORMULA FlexibleBarrier-PT-08a-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t172) AND FIREABLE(t235) AND FIREABLE(t61) AND FIREABLE(t53) AND FIREABLE(t26) AND (NOT FIREABLE(t165) OR NOT FIREABLE(t86)) AND ((FIREABLE(t19) AND FIREABLE(t37)) OR FIREABLE(t185)))))
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(t172) AND FIREABLE(t235) AND FIREABLE(t61) AND FIREABLE(t53) AND FIREABLE(t26) AND (NOT FIREABLE(t165) OR NOT FIREABLE(t86)) AND ((FIREABLE(t19) AND FIREABLE(t37)) OR FIREABLE(t185)))))
lola: processed formula length: 203
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-08a-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(t172) AND FIREABLE(t235) AND FIREABLE(t61) AND FIREABLE(t53) AND FIREABLE(t26) AND (NOT FIREABLE(t165) OR NOT FIREABLE(t86)) AND ((FIREABLE(t19) AND FIREABLE(t37)) OR FIREABLE(t185)))
lola: state equation: Generated DNF with 84 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-08a-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-08a-ReachabilityFireability-15-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA FlexibleBarrier-PT-08a-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no yes no yes no yes no no yes yes yes yes no
lola:
preliminary result: yes yes no no yes no yes no yes no no yes yes yes yes no
lola: memory consumption: 14880 KB
lola: time consumption: 1 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="FlexibleBarrier-PT-08a"
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/FlexibleBarrier-PT-08a.tgz
mv FlexibleBarrier-PT-08a 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 FlexibleBarrier-PT-08a, 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 r088-blw7-152649998100133"
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 ;