fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r076-blw3-152649937200427
Last Updated
June 26, 2018

About the Execution of LoLA for Echo-PT-d02r09

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3190.850 175270.00 357454.00 110.10 TFTTTTFTTFTTFTTT 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 432K
-rw-r--r-- 1 mcc users 3.6K 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.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 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 17K 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.6K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 266K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Echo-PT-d02r09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649937200427
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526742856346

info: Time: 3600 - MCC
===========================================================================================
prep: translating Echo-PT-d02r09 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Echo-PT-d02r09 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Echo-PT-d02r09 @ 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: 1305/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 735
lola: finding significant places
lola: 735 places, 570 transitions, 366 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1128 transition conflict sets
lola: TASK
lola: reading formula from Echo-PT-d02r09-ReachabilityFireability.task
lola: E (F ((FIREABLE(t421) AND FIREABLE(t519) AND NOT FIREABLE(t107) AND (FIREABLE(t371) OR FIREABLE(t102)) AND (((FIREABLE(t241) OR FIREABLE(t370)) AND (FIREABLE(t167) OR FIREABLE(t101))) OR FIREABLE(t142))))) : A (G (((NOT FIREABLE(t386) AND NOT FIREABLE(t396)) OR (NOT FIREABLE(t139) AND NOT FIREABLE(t208)) OR FIREABLE(t360) OR NOT FIREABLE(t124) OR FIREABLE(t156) OR FIREABLE(t396) OR NOT FIREABLE(t76)))) : E (F ((FIREABLE(t19) AND FIREABLE(t26) AND NOT FIREABLE(t227)))) : E (F ((NOT FIREABLE(t527) AND NOT FIREABLE(t87) AND (NOT FIREABLE(t282) OR NOT FIREABLE(t459)) AND ((FIREABLE(t157) AND FIREABLE(t464) AND (FIREABLE(t418) OR FIREABLE(t225))) OR (FIREABLE(t301) AND (FIREABLE(t286) OR FIREABLE(t424))))))) : E (F ((NOT FIREABLE(t97) AND FIREABLE(t70)))) : E (F (FIREABLE(t306))) : A (G ((NOT FIREABLE(t465) OR NOT FIREABLE(t273) OR (NOT FIREABLE(t530) AND NOT FIREABLE(t64)) OR FIREABLE(t348)))) : E (F (FIREABLE(t438))) : E (F (((FIREABLE(t277) AND FIREABLE(t169) AND (FIREABLE(t364) OR FIREABLE(t335)) AND NOT FIREABLE(t375)) OR (FIREABLE(t27) AND FIREABLE(t157) AND FIREABLE(t239) AND (NOT FIREABLE(t353) OR NOT FIREABLE(t97)))))) : A (G ((FIREABLE(t260) OR (NOT FIREABLE(t90) AND NOT FIREABLE(t339)) OR NOT FIREABLE(t197)))) : E (F ((NOT FIREABLE(t327) AND NOT FIREABLE(t189) AND NOT FIREABLE(t510) AND NOT FIREABLE(t481) AND NOT FIREABLE(t517) AND FIREABLE(t380)))) : E (F ((FIREABLE(t467) AND FIREABLE(t34)))) : E (F ((FIREABLE(t337) AND (FIREABLE(t437) OR FIREABLE(t24)) AND FIREABLE(t331) AND FIREABLE(t214) AND NOT FIREABLE(t88) AND FIREABLE(t50) AND FIREABLE(t35) AND (FIREABLE(t554) OR FIREABLE(t55))))) : E (F (FIREABLE(t566))) : E (F ((FIREABLE(t428) AND NOT FIREABLE(t57) AND FIREABLE(t147) AND NOT FIREABLE(t88)))) : E (F (FIREABLE(t193)))
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(t306)))
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(t306)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file Echo-PT-d02r09-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(t306)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================

FORMULA Echo-PT-d02r09-ReachabilityFireability-5 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(t438)))
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(t438)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file Echo-PT-d02r09-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(t438)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-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: 11 markings, 10 edges
lola: ========================================

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

FORMULA Echo-PT-d02r09-ReachabilityFireability-13 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(t193)))
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(t193)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file Echo-PT-d02r09-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(t193)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA Echo-PT-d02r09-ReachabilityFireability-15 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 ((NOT FIREABLE(t97) AND FIREABLE(t70))))
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(t97) AND FIREABLE(t70))))
lola: processed formula length: 45
lola: 1 rewrites
lola: closed formula file Echo-PT-d02r09-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(t97) AND FIREABLE(t70))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
lola: ========================================

FORMULA Echo-PT-d02r09-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 ((FIREABLE(t467) AND FIREABLE(t34))))
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(t467) AND FIREABLE(t34))))
lola: processed formula length: 42
lola: 1 rewrites
lola: closed formula file Echo-PT-d02r09-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: sara: try reading problem file Echo-PT-d02r09-ReachabilityFireability-4-0.sara.
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(t467) AND FIREABLE(t34))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================

FORMULA Echo-PT-d02r09-ReachabilityFireability-11 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(t19) AND FIREABLE(t26) AND NOT FIREABLE(t227))))
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(t26) AND NOT FIREABLE(t227))))
lola: processed formula length: 64
lola: 1 rewrites
lola: closed formula file Echo-PT-d02r09-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(t26) AND NOT FIREABLE(t227))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r09-ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 1110819 markings, 1152633 edges, 222164 markings/sec, 0 secs
lola: sara is running 5 secs || 2260287 markings, 2358391 edges, 229894 markings/sec, 5 secs
lola: sara is running 10 secs || 3389133 markings, 3563783 edges, 225769 markings/sec, 10 secs
lola: sara is running 15 secs || 4486884 markings, 4780375 edges, 219550 markings/sec, 15 secs
lola: sara is running 20 secs || 5642820 markings, 6031977 edges, 231187 markings/sec, 20 secs
lola: sara is running 25 secs || 6879706 markings, 7286562 edges, 247377 markings/sec, 25 secs
lola: sara is running 30 secs || 8103269 markings, 8528629 edges, 244713 markings/sec, 30 secs
lola: sara is running 35 secs || 9313372 markings, 9757906 edges, 242021 markings/sec, 35 secs
lola: sara is running 40 secs || 10520561 markings, 10983073 edges, 241438 markings/sec, 40 secs
lola: sara is running 45 secs || 11717916 markings, 12199197 edges, 239471 markings/sec, 45 secs
lola: sara is running 50 secs || 12935403 markings, 13437306 edges, 243497 markings/sec, 50 secs
lola: sara is running 55 secs || 14116668 markings, 14668638 edges, 236253 markings/sec, 55 secs
lola: sara is running 60 secs || 15313305 markings, 15898812 edges, 239327 markings/sec, 60 secs
lola: sara is running 65 secs || 16480929 markings, 17120030 edges, 233525 markings/sec, 65 secs
lola: sara is running 70 secs || 17632400 markings, 18306022 edges, 230294 markings/sec, 70 secs
lola: sara is running 75 secs || 18739507 markings, 19459871 edges, 221421 markings/sec, 75 secs
lola: sara is running 80 secs || 19832977 markings, 20605007 edges, 218694 markings/sec, 80 secs
lola: sara is running 85 secs || 20892013 markings, 21734499 edges, 211807 markings/sec, 85 secs
lola: sara is running 90 secs || 21913298 markings, 22868124 edges, 204257 markings/sec, 90 secs
lola: sara is running 95 secs || 22982195 markings, 24040311 edges, 213779 markings/sec, 95 secs
lola: sara is running 100 secs || 24113240 markings, 25186774 edges, 226209 markings/sec, 100 secs
lola: sara is running 105 secs || 25248745 markings, 26339258 edges, 227101 markings/sec, 105 secs
lola: sara is running 110 secs || 26382319 markings, 27492456 edges, 226715 markings/sec, 110 secs
lola: sara is running 115 secs || 27507522 markings, 28632892 edges, 225041 markings/sec, 115 secs
lola: sara is running 120 secs || 28661878 markings, 29804533 edges, 230871 markings/sec, 120 secs
lola: sara is running 125 secs || 29792346 markings, 30955335 edges, 226094 markings/sec, 125 secs
lola: sara is running 130 secs || 30935771 markings, 32132697 edges, 228685 markings/sec, 130 secs
lola: sara is running 135 secs || 32109610 markings, 33347869 edges, 234768 markings/sec, 135 secs
lola: sara is running 140 secs || 33259944 markings, 34543229 edges, 230067 markings/sec, 140 secs
lola: sara is running 145 secs || 34414747 markings, 35738000 edges, 230961 markings/sec, 145 secs
lola: sara is running 150 secs || 35566059 markings, 36922061 edges, 230262 markings/sec, 150 secs
lola: sara is running 155 secs || 36659942 markings, 38075340 edges, 218777 markings/sec, 155 secs
lola: sara is running 160 secs || 37742548 markings, 39211804 edges, 216521 markings/sec, 160 secs
lola: sara is running 165 secs || 38764584 markings, 40312156 edges, 204407 markings/sec, 165 secs

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.

FORMULA Echo-PT-d02r09-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t428) AND NOT FIREABLE(t57) AND FIREABLE(t147) AND NOT FIREABLE(t88))))
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(t428) AND NOT FIREABLE(t57) AND FIREABLE(t147) AND NOT FIREABLE(t88))))
lola: processed formula length: 87
lola: 1 rewrites
lola: closed formula file Echo-PT-d02r09-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(t428) AND NOT FIREABLE(t57) AND FIREABLE(t147) AND NOT FIREABLE(t88))
lola: state equation: Generated DNF with 32 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: lola: state equation: calling and running sara
produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
sara: try reading problem file Echo-PT-d02r09-ReachabilityFireability-7-0.sara.

FORMULA Echo-PT-d02r09-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 424 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t260) OR (NOT FIREABLE(t90) AND NOT FIREABLE(t339)) OR NOT FIREABLE(t197))))
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(t260) OR (NOT FIREABLE(t90) AND NOT FIREABLE(t339)) OR NOT FIREABLE(t197))))
lola: processed formula length: 94
lola: 2 rewrites
lola: closed formula file Echo-PT-d02r09-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA Echo-PT-d02r09-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t465) OR NOT FIREABLE(t273) OR (NOT FIREABLE(t530) AND NOT FIREABLE(t64)) OR FIREABLE(t348))))
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(t465) OR NOT FIREABLE(t273) OR (NOT FIREABLE(t530) AND NOT FIREABLE(t64)) OR FIREABLE(t348))))
lola: processed formula length: 117
lola: 2 rewrites
lola: closed formula file Echo-PT-d02r09-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(t465) AND FIREABLE(t273) AND (FIREABLE(t530) OR FIREABLE(t64)) AND NOT FIREABLE(t348))
lola: state equation: Generated DNF with 60 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r09-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================

FORMULA Echo-PT-d02r09-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t327) AND NOT FIREABLE(t189) AND NOT FIREABLE(t510) AND NOT FIREABLE(t481) AND NOT FIREABLE(t517) AND FIREABLE(t380))))
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(t327) AND NOT FIREABLE(t189) AND NOT FIREABLE(t510) AND NOT FIREABLE(t481) AND NOT FIREABLE(t517) AND FIREABLE(t380))))
lola: processed formula length: 139
lola: 1 rewrites
lola: closed formula file Echo-PT-d02r09-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(t327) AND NOT FIREABLE(t189) AND NOT FIREABLE(t510) AND NOT FIREABLE(t481) AND NOT FIREABLE(t517) AND FIREABLE(t380))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================

FORMULA Echo-PT-d02r09-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 679 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t386) AND NOT FIREABLE(t396)) OR (NOT FIREABLE(t139) AND NOT FIREABLE(t208)) OR FIREABLE(t360) OR NOT FIREABLE(t124) OR FIREABLE(t156) OR FIREABLE(t396) OR NOT FIREABLE(t76))))
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(t386) AND NOT FIREABLE(t396)) OR (NOT FIREABLE(t139) AND NOT FIREABLE(t208)) OR FIREABLE(t360) OR NOT FIREABLE(t124) OR FIREABLE(t156) OR FIREABLE(t396) OR NOT FIREABLE(t76))))
lola: processed formula length: 203
lola: 2 rewrites
lola: closed formula file Echo-PT-d02r09-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: place or transition ordering is non-deterministic
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(t386) OR FIREABLE(t396)) AND (FIREABLE(t139) OR FIREABLE(t208)) AND NOT FIREABLE(t360) AND FIREABLE(t124) AND NOT FIREABLE(t156) AND NOT FIREABLE(t396) AND FIREABLE(t76))
lola: state equation: Generated DNF with 832 literals and 64 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA Echo-PT-d02r09-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 849 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t277) AND FIREABLE(t169) AND (FIREABLE(t364) OR FIREABLE(t335)) AND NOT FIREABLE(t375)) OR (FIREABLE(t27) AND FIREABLE(t157) AND FIREABLE(t239) AND (NOT FIREABLE(t353) OR NOT FIREABLE(t97))))))
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(t277) AND FIREABLE(t169) AND (FIREABLE(t364) OR FIREABLE(t335)) AND NOT FIREABLE(t375)) OR (FIREABLE(t27) AND FIREABLE(t157) AND FIREABLE(t239) AND (NOT FIREABLE(t353) OR NOT FIREABLE(t97))))))
lola: processed formula length: 213
lola: 1 rewrites
lola: closed formula file Echo-PT-d02r09-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(t277) AND FIREABLE(t169) AND (FIREABLE(t364) OR FIREABLE(t335)) AND NOT FIREABLE(t375)) OR (FIREABLE(t27) AND FIREABLE(t157) AND FIREABLE(t239) AND (NOT FIREABLE(t353) OR NOT FIREABLE(t97))))
lola: state equation: Generated DNF with 114 literals and 14 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola:
FORMULA Echo-PT-d02r09-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 13 will run for 1132 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t421) AND FIREABLE(t519) AND NOT FIREABLE(t107) AND (FIREABLE(t371) OR FIREABLE(t102)) AND (((FIREABLE(t241) OR FIREABLE(t370)) AND (FIREABLE(t167) OR FIREABLE(t101))) OR FIREABLE(t142)))))
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(t421) AND FIREABLE(t519) AND NOT FIREABLE(t107) AND (FIREABLE(t371) OR FIREABLE(t102)) AND (((FIREABLE(t241) OR FIREABLE(t370)) AND (FIREABLE(t167) OR FIREABLE(t101))) OR FIREABLE(t142)))))
lola: processed formula length: 209
lola: 1 rewrites
lola: closed formula file Echo-PT-d02r09-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(t421) AND FIREABLE(t519) AND NOT FIREABLE(t107) AND (FIREABLE(t371) OR FIREABLE(t102)) AND (((FIREABLE(t241) OR FIREABLE(t370)) AND (FIREABLE(t167) OR FIREABLE(t101))) OR FIREABLE(t142)))
lola: state equation: Generated DNF with 328 literals and 20 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r09-ReachabilityFireability-13-0.sara.

sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA Echo-PT-d02r09-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1698 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t337) AND (FIREABLE(t437) OR FIREABLE(t24)) AND FIREABLE(t331) AND FIREABLE(t214) AND NOT FIREABLE(t88) AND FIREABLE(t50) AND FIREABLE(t35) AND (FIREABLE(t554) OR FIREABLE(t55)))))
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(t337) AND (FIREABLE(t437) OR FIREABLE(t24)) AND FIREABLE(t331) AND FIREABLE(t214) AND NOT FIREABLE(t88) AND FIREABLE(t50) AND FIREABLE(t35) AND (FIREABLE(t554) OR FIREABLE(t55)))))
lola: processed formula length: 198
lola: 1 rewrites
lola: closed formula file Echo-PT-d02r09-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(t337) AND (FIREABLE(t437) OR FIREABLE(t24)) AND FIREABLE(t331) AND FIREABLE(t214) AND NOT FIREABLE(t88) AND FIREABLE(t50) AND FIREABLE(t35) AND (FIREABLE(t554) OR FIREABLE(t55)))
lola: state equation: Generated DNF with 164 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r09-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 Echo-PT-d02r09-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t527) AND NOT FIREABLE(t87) AND (NOT FIREABLE(t282) OR NOT FIREABLE(t459)) AND ((FIREABLE(t157) AND FIREABLE(t464) AND (FIREABLE(t418) OR FIREABLE(t225))) OR (FIREABLE(t301) AND (FIREABLE(t286) OR FIREABLE(t424)))))))
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(t527) AND NOT FIREABLE(t87) AND (NOT FIREABLE(t282) OR NOT FIREABLE(t459)) AND ((FIREABLE(t157) AND FIREABLE(t464) AND (FIREABLE(t418) OR FIREABLE(t225))) OR (FIREABLE(t301) AND (FIREABLE(t286) OR FIREABLE(t424)))))))
lola: processed formula length: 241
lola: 1 rewrites
lola: closed formula file Echo-PT-d02r09-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(t527) AND NOT FIREABLE(t87) AND (NOT FIREABLE(t282) OR NOT FIREABLE(t459)) AND ((FIREABLE(t157) AND FIREABLE(t464) AND (FIREABLE(t418) OR FIREABLE(t225))) OR (FIREABLE(t301) AND (FIREABLE(t286) OR FIREABLE(t424)))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges

FORMULA Echo-PT-d02r09-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes yes yes no yes yes no yes yes no yes yes yes
lola:
preliminary result: yes no yes yes yes yes no yes yes no yes yes no yes yes yes
lola: state equation: Generated DNF with 2016 literals and 192 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-15-0.sara
lola: ========================================
lola: memory consumption: 15608 KB
lola: time consumption: 175 seconds

BK_STOP 1526743031616

--------------------
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="Echo-PT-d02r09"
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/Echo-PT-d02r09.tgz
mv Echo-PT-d02r09 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 Echo-PT-d02r09, 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 r076-blw3-152649937200427"
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 ;