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 196K
-rw-r--r-- 1 mcc users 4.5K 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 3.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K 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 127 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 365 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K 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 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 8.2K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SmallOperatingSystem-PT-MT0128DC0032, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512400042
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527201473018

info: Time: 3600 - MCC
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0128DC0032 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0128DC0032 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ SmallOperatingSystem-PT-MT0128DC0032 @ 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: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability.task
lola: A (G ((FIREABLE(suspend) OR FIREABLE(endLoading) OR FIREABLE(startFirst) OR (NOT FIREABLE(startUnload) AND NOT FIREABLE(suspend)) OR (FIREABLE(startNext) AND (FIREABLE(suspend) OR FIREABLE(startNext)))))) : E (F ((NOT FIREABLE(startLoading) AND FIREABLE(startNext) AND (FIREABLE(freeMemory) OR (FIREABLE(startFirst) AND NOT FIREABLE(startLoading)))))) : E (F ((NOT FIREABLE(suspend) AND NOT FIREABLE(startLoading) AND FIREABLE(startFirst)))) : A (G (((FIREABLE(endUnload) AND FIREABLE(startFirst)) OR NOT FIREABLE(endUnload) OR FIREABLE(startFirst) OR (FIREABLE(endUnload) AND ((FIREABLE(startNext) AND FIREABLE(startFirst)) OR (FIREABLE(startLoading))))))) : A (G (((NOT FIREABLE(startNext) AND FIREABLE(endUnload)) OR FIREABLE(startLoading)))) : A (G (((FIREABLE(startFirst) OR (FIREABLE(startFirst) AND FIREABLE(endUnload)) OR FIREABLE(startLoading)) AND (FIREABLE(freeMemory) OR FIREABLE(suspend) OR NOT FIREABLE(startUnload) OR FIREABLE(startNext))))) : A (G (FIREABLE(startLoading))) : A (G (FIREABLE(startLoading))) : E (F ((FIREABLE(freeMemory) AND FIREABLE(endUnload) AND NOT FIREABLE(startFirst) AND (FIREABLE(startUnload) OR FIREABLE(startNext) OR (FIREABLE(endUnload) AND FIREABLE(startUnload))) AND FIREABLE(startNext)))) : A (G (FIREABLE(startLoading))) : E (F ((FIREABLE(freeMemory) AND NOT FIREABLE(startLoading)))) : A (G (FIREABLE(startLoading))) : A (G (((FIREABLE(startLoading) AND FIREABLE(startFirst)) OR (FIREABLE(startLoading))))) : A (G ((NOT FIREABLE(startNext) OR NOT FIREABLE(endUnload) OR FIREABLE(startUnload)))) : E (F (NOT FIREABLE(startLoading))) : A (G (()))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-15 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: A (G (FIREABLE(startLoading)))
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(startLoading)))
lola: processed formula length: 30
lola: 5 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(startLoading)
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges

FORMULA SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(startLoading)))
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(startLoading)))
lola: processed formula length: 30
lola: 5 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(startLoading)
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges

FORMULA SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-9 FALSE 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: A (G (FIREABLE(startLoading)))
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(startLoading)))
lola: processed formula length: 30
lola: 5 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(startLoading)
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: ========================================

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

FORMULA SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(startLoading)))
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(startLoading)))
lola: processed formula length: 30
lola: 5 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(startLoading)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-6 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 ((FIREABLE(freeMemory) AND NOT FIREABLE(startLoading))))
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(freeMemory) AND NOT FIREABLE(startLoading))))
lola: processed formula length: 61
lola: 4 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)sara:
try reading problem file SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-4-0.sara.
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(freeMemory) AND NOT FIREABLE(startLoading))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-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, 34 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(startLoading) AND FIREABLE(startFirst)) OR (FIREABLE(startLoading)))))
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(startLoading) AND FIREABLE(startFirst)) OR (FIREABLE(startLoading)))))
lola: processed formula length: 88
lola: 5 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((NOT FIREABLE(startLoading) OR NOT FIREABLE(startFirst)) AND (NOT FIREABLE(startLoading)))
lola: state equation: Generated DNF with 30 literals and 15 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-12 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: A (G ((NOT FIREABLE(startNext) OR NOT FIREABLE(endUnload) OR FIREABLE(startUnload))))
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(startNext) OR NOT FIREABLE(endUnload) OR FIREABLE(startUnload))))
lola: processed formula length: 87
lola: 5 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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(startNext) AND FIREABLE(endUnload) AND NOT FIREABLE(startUnload))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2016 markings, 3040 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(suspend) AND NOT FIREABLE(startLoading) AND FIREABLE(startFirst))))
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(suspend) AND NOT FIREABLE(startLoading) AND FIREABLE(startFirst))))
lola: processed formula length: 87
lola: 4 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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(suspend) AND NOT FIREABLE(startLoading) AND FIREABLE(startFirst))
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-9-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, 34 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(startNext) AND FIREABLE(endUnload)) OR FIREABLE(startLoading))))
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(startNext) AND FIREABLE(endUnload)) OR FIREABLE(startLoading))))
lola: processed formula length: 86
lola: 5 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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(startNext) OR NOT FIREABLE(endUnload)) AND NOT FIREABLE(startLoading))
lola: state equation: Generated DNF with 15 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-10-0.sara
lola: 33 markings, 32 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(startLoading) AND FIREABLE(startNext) AND (FIREABLE(freeMemory) OR (FIREABLE(startFirst) AND NOT FIREABLE(startLoading))))))
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(startLoading) AND FIREABLE(startNext) AND (FIREABLE(freeMemory) OR (FIREABLE(startFirst) AND NOT FIREABLE(startLoading))))))
lola: processed formula length: 145
lola: 4 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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(startLoading) AND FIREABLE(startNext) AND (FIREABLE(freeMemory) OR (FIREABLE(startFirst) AND NOT FIREABLE(startLoading))))
lola: state equation: Generated DNF with 66 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 165 markings, 198 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(endUnload) AND FIREABLE(startFirst)) OR NOT FIREABLE(endUnload) OR FIREABLE(startFirst) OR (FIREABLE(endUnload) AND ((FIREABLE(startNext) AND FIREABLE(startFirst)) OR (FIREABLE(startLoading)))))))
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(endUnload) AND FIREABLE(startFirst)) OR NOT FIREABLE(endUnload) OR FIREABLE(startFirst) OR (FIREABLE(endUnload) AND ((FIREABLE(startNext) AND FIREABLE(startFirst)) OR (FIREABLE(startLoading)))))))
lola: processed formula length: 217
lola: 5 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((NOT FIREABLE(endUnload) OR NOT FIREABLE(startFirst)) AND FIREABLE(endUnload) AND NOT FIREABLE(startFirst) AND (NOT FIREABLE(endUnload) OR ((NOT FIREABLE(startNext) OR NOT FIREABLE(startFirst)) AND (NOT FIREABLE(startLoading)))))
lola: state equation: Generated DNF with 240 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-12-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 142 markings, 202 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-11-0.sara.
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(freeMemory) AND FIREABLE(endUnload) AND NOT FIREABLE(startFirst) AND (FIREABLE(startUnload) OR FIREABLE(startNext) OR (FIREABLE(endUnload) AND FIREABLE(startUnload))) AND FIREABLE(startNext))))
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(freeMemory) AND FIREABLE(endUnload) AND NOT FIREABLE(startFirst) AND (FIREABLE(startUnload) OR FIREABLE(startNext) OR (FIREABLE(endUnload) AND FIREABLE(startUnload))) AND FIREABLE(startNext))))
lola: processed formula length: 211
lola: 4 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(freeMemory) AND FIREABLE(endUnload) AND NOT FIREABLE(startFirst) AND (FIREABLE(startUnload) OR FIREABLE(startNext) OR (FIREABLE(endUnload) AND FIREABLE(startUnload))) AND FIREABLE(startNext))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(suspend) OR FIREABLE(endLoading) OR FIREABLE(startFirst) OR (NOT FIREABLE(startUnload) AND NOT FIREABLE(suspend)) OR (FIREABLE(startNext) AND (FIREABLE(suspend) OR FIREABLE(startNext))))))
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(suspend) OR FIREABLE(endLoading) OR FIREABLE(startFirst) OR (NOT FIREABLE(startUnload) AND NOT FIREABLE(suspend)) OR (FIREABLE(startNext) AND (FIREABLE(suspend) OR FIREABLE(startNext))))))
lola: processed formula length: 209
lola: 5 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(suspend) AND NOT FIREABLE(endLoading) AND NOT FIREABLE(startFirst) AND (FIREABLE(startUnload) OR FIREABLE(suspend)) AND (NOT FIREABLE(startNext) OR (NOT FIREABLE(suspend) AND NOT FIREABLE(startNext))))
lola: state equation: Generated DNF with 30 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-14-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(startFirst) OR (FIREABLE(startFirst) AND FIREABLE(endUnload)) OR FIREABLE(startLoading)) AND (FIREABLE(freeMemory) OR FIREABLE(suspend) OR NOT FIREABLE(startUnload) OR FIREABLE(startNext)))))
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(startFirst) OR (FIREABLE(startFirst) AND FIREABLE(endUnload)) OR FIREABLE(startLoading)) AND (FIREABLE(freeMemory) OR FIREABLE(suspend) OR NOT FIREABLE(startUnload) OR FIREABLE(startNext)))))
lola: processed formula length: 213
lola: 5 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((NOT FIREABLE(startFirst) AND (NOT FIREABLE(startFirst) OR NOT FIREABLE(endUnload)) AND NOT FIREABLE(startLoading)) OR (NOT FIREABLE(freeMemory) AND NOT FIREABLE(suspend) AND FIREABLE(startUnload) AND NOT FIREABLE(startNext)))
lola: state equation: Generated DNF with 60 literals and 19 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no no no no no no no yes no no no yes yes
lola:
preliminary result: yes yes yes no no no no no no no yes no no no yes yes

lola: memory consumption: 14588 KB
lola: time consumption: 0 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="SmallOperatingSystem-PT-MT0128DC0032"
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/SmallOperatingSystem-PT-MT0128DC0032.tgz
mv SmallOperatingSystem-PT-MT0128DC0032 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 SmallOperatingSystem-PT-MT0128DC0032, 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 r160-smll-152705512400042"
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 ;