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 372K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 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 5.7K 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.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 205K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is UtahNoC-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708743400420
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527404521253

info: Time: 3600 - MCC
===========================================================================================
prep: translating UtahNoC-PT-none 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 UtahNoC-PT-none formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ UtahNoC-PT-none @ 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: 1193/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 216
lola: finding significant places
lola: 216 places, 977 transitions, 208 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 979 transition conflict sets
lola: TASK
lola: reading formula from UtahNoC-PT-none-ReachabilityFireability.task
lola: A (G ((((NOT FIREABLE(t752) OR NOT FIREABLE(t351)) AND (NOT FIREABLE(t742) OR NOT FIREABLE(t890))) OR (FIREABLE(t962) AND (NOT FIREABLE(t522) OR NOT FIREABLE(t523)))))) : E (F ((FIREABLE(t195) AND FIREABLE(t263) AND (FIREABLE(t231) OR FIREABLE(t946))))) : E (F ((FIREABLE(t760) OR (FIREABLE(t974) AND FIREABLE(t692) AND (FIREABLE(t16) OR FIREABLE(t735)) AND NOT FIREABLE(t153) AND (FIREABLE(t127) OR FIREABLE(t271)))))) : E (F ((FIREABLE(t935) AND (FIREABLE(t248) OR FIREABLE(t709) OR (FIREABLE(t513) AND FIREABLE(t75))) AND ((NOT FIREABLE(t42) AND NOT FIREABLE(t293)) OR (NOT FIREABLE(t504) AND NOT FIREABLE(t802)))))) : E (F (((FIREABLE(t596) AND FIREABLE(t913)) OR FIREABLE(t737)))) : E (F ((FIREABLE(t436) AND FIREABLE(t904) AND FIREABLE(t466) AND FIREABLE(t767) AND (FIREABLE(t263) OR FIREABLE(t208)) AND FIREABLE(t311) AND FIREABLE(t713) AND (FIREABLE(t445) OR FIREABLE(t188))))) : E (F (FIREABLE(t32))) : E (F (((FIREABLE(t600) AND FIREABLE(t954)) OR (FIREABLE(t520) AND FIREABLE(t624))))) : E (F ((FIREABLE(t86) AND NOT FIREABLE(t509)))) : E (F ((NOT FIREABLE(t52) AND NOT FIREABLE(t908) AND FIREABLE(t30) AND FIREABLE(t123)))) : E (F (FIREABLE(t283))) : E (F (((NOT FIREABLE(t806) OR NOT FIREABLE(t973)) AND FIREABLE(t408) AND FIREABLE(t304)))) : E (F (FIREABLE(t938))) : E (F (((FIREABLE(t185) AND FIREABLE(t931) AND (FIREABLE(t383) OR FIREABLE(t424)) AND FIREABLE(t675) AND NOT FIREABLE(t882)) OR ((FIREABLE(t622) OR FIREABLE(t365)) AND (FIREABLE(t244) OR FIREABLE(t972)) AND FIREABLE(t324))))) : E (F (FIREABLE(t639))) : E (F ((FIREABLE(t295) AND FIREABLE(t790) AND (NOT FIREABLE(t742) OR FIREABLE(t810)))))
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(t32)))
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(t32)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file UtahNoC-PT-none-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(t32)
lola: state equation: Generated DNF with 1 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 UtahNoC-PT-none-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(t283)))
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(t283)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file UtahNoC-PT-none-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(t283)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to UtahNoC-PT-none-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 32 markings, 41 edges
lola: ========================================

FORMULA UtahNoC-PT-none-ReachabilityFireability-10 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(t938)))
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(t938)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file UtahNoC-PT-none-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(t938)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges

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

FORMULA UtahNoC-PT-none-ReachabilityFireability-14 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(t86) AND NOT FIREABLE(t509))))
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(t86) AND NOT FIREABLE(t509))))
lola: processed formula length: 46
lola: 1 rewrites
lola: closed formula file UtahNoC-PT-none-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(t86) AND NOT FIREABLE(t509))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to UtahNoC-PT-none-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file UtahNoC-PT-none-ReachabilityFireability-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 137 markings, 226 edges
lola: ========================================

FORMULA UtahNoC-PT-none-ReachabilityFireability-8 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(t596) AND FIREABLE(t913)) OR 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(t596) AND FIREABLE(t913)) OR FIREABLE(t737))))
lola: processed formula length: 64
lola: 1 rewrites
lola: closed formula file UtahNoC-PT-none-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(t596) AND FIREABLE(t913)) OR FIREABLE(t737))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to UtahNoC-PT-none-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file UtahNoC-PT-none-ReachabilityFireability-5-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 UtahNoC-PT-none-ReachabilityFireability-4 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(t600) AND FIREABLE(t954)) OR (FIREABLE(t520) AND FIREABLE(t624)))))
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(t600) AND FIREABLE(t954)) OR (FIREABLE(t520) AND FIREABLE(t624)))))
lola: processed formula length: 85
lola: 1 rewrites
lola: closed formula file UtahNoC-PT-none-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(t600) AND FIREABLE(t954)) OR (FIREABLE(t520) AND FIREABLE(t624)))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to UtahNoC-PT-none-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: 35 markings, 46 edges
lola: ========================================

FORMULA UtahNoC-PT-none-ReachabilityFireability-7 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 (((NOT FIREABLE(t806) OR NOT FIREABLE(t973)) AND FIREABLE(t408) AND FIREABLE(t304))))
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(t806) OR NOT FIREABLE(t973)) AND FIREABLE(t408) AND FIREABLE(t304))))
lola: processed formula length: 91
lola: 1 rewrites
lola: closed formula file UtahNoC-PT-none-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(t806) OR NOT FIREABLE(t973)) AND FIREABLE(t408) AND FIREABLE(t304))
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to UtahNoC-PT-none-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 24 markings, 28 edges
lola: ========================================

FORMULA UtahNoC-PT-none-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t195) AND FIREABLE(t263) AND (FIREABLE(t231) OR FIREABLE(t946)))))
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(t195) AND FIREABLE(t263) AND (FIREABLE(t231) OR FIREABLE(t946)))))
lola: processed formula length: 83
lola: 1 rewrites
lola: closed formula file UtahNoC-PT-none-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(t195) AND FIREABLE(t263) AND (FIREABLE(t231) OR FIREABLE(t946)))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to UtahNoC-PT-none-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file UtahNoC-PT-none-ReachabilityFireability-8-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 UtahNoC-PT-none-ReachabilityFireability-1 FALSE 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 ((NOT FIREABLE(t52) AND NOT FIREABLE(t908) AND FIREABLE(t30) AND FIREABLE(t123))))
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(t52) AND NOT FIREABLE(t908) AND FIREABLE(t30) AND FIREABLE(t123))))
lola: processed formula length: 87
lola: 1 rewrites
lola: closed formula file UtahNoC-PT-none-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(t52) AND NOT FIREABLE(t908) AND FIREABLE(t30) AND FIREABLE(t123))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: state equation: write sara problem file to UtahNoC-PT-none-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
lola: ========================================

FORMULA UtahNoC-PT-none-ReachabilityFireability-9 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: E (F ((FIREABLE(t295) AND FIREABLE(t790) AND (NOT FIREABLE(t742) OR FIREABLE(t810)))))
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(t295) AND FIREABLE(t790) AND (NOT FIREABLE(t742) OR FIREABLE(t810)))))
lola: processed formula length: 87
lola: 1 rewrites
lola: closed formula file UtahNoC-PT-none-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(t295) AND FIREABLE(t790) AND (NOT FIREABLE(t742) OR FIREABLE(t810)))
lola: state equation: Generated DNF with 13 literals and 3 conjunctive subformulas
sara: lola: try reading problem file UtahNoC-PT-none-ReachabilityFireability-9-0.sara.
state equation: write sara problem file to UtahNoC-PT-none-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file UtahNoC-PT-none-ReachabilityFireability-10-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.
lola: ========================================

FORMULA UtahNoC-PT-none-ReachabilityFireability-15 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: A (G ((((NOT FIREABLE(t752) OR NOT FIREABLE(t351)) AND (NOT FIREABLE(t742) OR NOT FIREABLE(t890))) OR (FIREABLE(t962) AND (NOT FIREABLE(t522) OR NOT FIREABLE(t523))))))
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(t752) OR NOT FIREABLE(t351)) AND (NOT FIREABLE(t742) OR NOT FIREABLE(t890))) OR (FIREABLE(t962) AND (NOT FIREABLE(t522) OR NOT FIREABLE(t523))))))
lola: processed formula length: 172
lola: 2 rewrites
lola: closed formula file UtahNoC-PT-none-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(t752) AND FIREABLE(t351)) OR (FIREABLE(t742) AND FIREABLE(t890))) AND (NOT FIREABLE(t962) OR (FIREABLE(t522) AND FIREABLE(t523))))
lola: state equation: Generated DNF with 24 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to UtahNoC-PT-none-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file UtahNoC-PT-none-ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 176754 markings, 462111 edges, 35351 markings/sec, 0 secs
lola: sara is running 5 secs || 351812 markings, 955740 edges, 35012 markings/sec, 5 secs
lola: sara is running 10 secs || 528841 markings, 1448544 edges, 35406 markings/sec, 10 secs
sara: warning, failure of lp_solve (at job 6830)
lola: sara is running 15 secs || 702855 markings, 1939897 edges, 34803 markings/sec, 15 secs
lola: sara is running 20 secs || 872833 markings, 2441712 edges, 33996 markings/sec, 20 secs
lola: sara is running 25 secs || 1041125 markings, 2948963 edges, 33658 markings/sec, 25 secs
lola: sara is running 30 secs || 1215969 markings, 3427803 edges, 34969 markings/sec, 30 secs
lola: sara is running 35 secs || 1385964 markings, 3932994 edges, 33999 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1531178 markings, 4339651 edges
lola: ========================================

FORMULA UtahNoC-PT-none-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 881 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t760) OR (FIREABLE(t974) AND FIREABLE(t692) AND (FIREABLE(t16) OR FIREABLE(t735)) AND NOT FIREABLE(t153) AND (FIREABLE(t127) OR FIREABLE(t271))))))
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(t760) OR (FIREABLE(t974) AND FIREABLE(t692) AND (FIREABLE(t16) OR FIREABLE(t735)) AND NOT FIREABLE(t153) AND (FIREABLE(t127) OR FIREABLE(t271))))))
lola: processed formula length: 166
lola: 1 rewrites
lola: closed formula file UtahNoC-PT-none-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(t760) OR (FIREABLE(t974) AND FIREABLE(t692) AND (FIREABLE(t16) OR FIREABLE(t735)) AND NOT FIREABLE(t153) AND (FIREABLE(t127) OR FIREABLE(t271))))
lola: state equation: Generated DNF with 34 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to UtahNoC-PT-none-ReachabilityFireability-12-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 UtahNoC-PT-none-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1175 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t935) AND (FIREABLE(t248) OR FIREABLE(t709) OR (FIREABLE(t513) AND FIREABLE(t75))) AND ((NOT FIREABLE(t42) AND NOT FIREABLE(t293)) OR (NOT FIREABLE(t504) AND NOT FIREABLE(t802))))))
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(t935) AND (FIREABLE(t248) OR FIREABLE(t709) OR (FIREABLE(t513) AND FIREABLE(t75))) AND ((NOT FIREABLE(t42) AND NOT FIREABLE(t293)) OR (NOT FIREABLE(t504) AND NOT FIREABLE(t802))))))
lola: processed formula length: 200
lola: 1 rewrites
lola: closed formula file UtahNoC-PT-none-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 UtahNoC-PT-none-ReachabilityFireability-12-0.sara.
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: 171 markings, 267 edges
lola: ========================================

FORMULA UtahNoC-PT-none-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t436) AND FIREABLE(t904) AND FIREABLE(t466) AND FIREABLE(t767) AND (FIREABLE(t263) OR FIREABLE(t208)) AND FIREABLE(t311) AND FIREABLE(t713) AND (FIREABLE(t445) OR FIREABLE(t188)))))
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(t436) AND FIREABLE(t904) AND FIREABLE(t466) AND FIREABLE(t767) AND (FIREABLE(t263) OR FIREABLE(t208)) AND FIREABLE(t311) AND FIREABLE(t713) AND (FIREABLE(t445) OR FIREABLE(t188)))))
lola: processed formula length: 199
lola: 1 rewrites
lola: closed formula file UtahNoC-PT-none-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(t436) AND FIREABLE(t904) AND FIREABLE(t466) AND FIREABLE(t767) AND (FIREABLE(t263) OR FIREABLE(t208)) AND FIREABLE(t311) AND FIREABLE(t713) AND (FIREABLE(t445) OR FIREABLE(t188)))
lola: state equation: Generated DNF with 54 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to UtahNoC-PT-none-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file UtahNoC-PT-none-ReachabilityFireability-14-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.
lola: ========================================

FORMULA UtahNoC-PT-none-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3525 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t185) AND FIREABLE(t931) AND (FIREABLE(t383) OR FIREABLE(t424)) AND FIREABLE(t675) AND NOT FIREABLE(t882)) OR ((FIREABLE(t622) OR FIREABLE(t365)) AND (FIREABLE(t244) OR FIREABLE(t972)) AND FIREABLE(t324)))))
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(t185) AND FIREABLE(t931) AND (FIREABLE(t383) OR FIREABLE(t424)) AND FIREABLE(t675) AND NOT FIREABLE(t882)) OR ((FIREABLE(t622) OR FIREABLE(t365)) AND (FIREABLE(t244) OR FIREABLE(t972)) AND FIREABLE(t324)))))
lola: processed formula length: 228
lola: 1 rewrites
lola: closed formula file UtahNoC-PT-none-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(t185) AND FIREABLE(t931) AND (FIREABLE(t383) OR FIREABLE(t424)) AND FIREABLE(t675) AND NOT FIREABLE(t882)) OR ((FIREABLE(t622) OR FIREABLE(t365)) AND (FIREABLE(t244) OR FIREABLE(t972)) AND FIREABLE(t324)))
lola: state equation: Generated DNF with 34 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to UtahNoC-PT-none-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file UtahNoC-PT-none-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 271 markings, 405 edges
lola: ========================================

FORMULA UtahNoC-PT-none-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes no yes yes yes yes yes yes yes yes yes no
lola:
preliminary result: no no yes yes yes no yes yes yes yes yes yes yes yes yes no
lola: memory consumption: 15796 KB
lola: time consumption: 45 seconds

BK_STOP 1527404566698

--------------------
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="UtahNoC-PT-none"
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/UtahNoC-PT-none.tgz
mv UtahNoC-PT-none 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 UtahNoC-PT-none, 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 r172-smll-152708743400420"
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 ;