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 244K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 13K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 81K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Solitaire-PT-FrnNC7x7, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512500161
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527265564181

info: Time: 3600 - MCC
===========================================================================================
prep: translating Solitaire-PT-FrnNC7x7 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Solitaire-PT-FrnNC7x7 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Solitaire-PT-FrnNC7x7 @ 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: 166/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2368
lola: finding significant places
lola: 74 places, 92 transitions, 37 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 184 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-FrnNC7x7-ReachabilityFireability.task
lola: E (F ((FIREABLE(up52) AND FIREABLE(right25) AND NOT FIREABLE(right55) AND FIREABLE(right56) AND FIREABLE(down23) AND FIREABLE(up35) AND FIREABLE(down34) AND FIREABLE(down55)))) : A (G ((FIREABLE(right34) OR FIREABLE(up44) OR NOT FIREABLE(right53) OR NOT FIREABLE(up63) OR FIREABLE(down41)))) : E (F ((NOT FIREABLE(left54) AND NOT FIREABLE(up32) AND FIREABLE(right74) AND FIREABLE(down56) AND FIREABLE(down65) AND FIREABLE(right34) AND (FIREABLE(up53) OR FIREABLE(down56) OR NOT FIREABLE(right54))))) : E (F ((FIREABLE(left63) AND FIREABLE(right63)))) : A (G ((NOT FIREABLE(down47) OR NOT FIREABLE(up47) OR FIREABLE(right54) OR NOT FIREABLE(down44)))) : E (F (((FIREABLE(up46) OR FIREABLE(down54)) AND NOT FIREABLE(down24) AND FIREABLE(left44) AND FIREABLE(right14)))) : E (F ((NOT FIREABLE(right32) AND NOT FIREABLE(left64) AND FIREABLE(down46) AND FIREABLE(up34) AND (FIREABLE(down47) OR FIREABLE(left43)) AND FIREABLE(down52)))) : A (G ((NOT FIREABLE(left53) OR NOT FIREABLE(left54) OR NOT FIREABLE(down23) OR NOT FIREABLE(left44) OR NOT FIREABLE(left23)))) : E (F ((FIREABLE(right45) AND NOT FIREABLE(up54) AND FIREABLE(up33) AND FIREABLE(up23) AND NOT FIREABLE(left63) AND (NOT FIREABLE(up65) OR NOT FIREABLE(down35) OR (NOT FIREABLE(up42) AND NOT FIREABLE(down56)))))) : A (G ((NOT FIREABLE(left42) OR NOT FIREABLE(right24) OR (FIREABLE(down55) AND FIREABLE(up34) AND FIREABLE(up56) AND FIREABLE(right33)) OR NOT FIREABLE(down23)))) : E (F ((NOT FIREABLE(right34) AND NOT FIREABLE(left33) AND FIREABLE(up23) AND FIREABLE(down33) AND FIREABLE(right55) AND NOT FIREABLE(down34) AND FIREABLE(down56)))) : E (F ((FIREABLE(left23) AND (NOT FIREABLE(right63) OR NOT FIREABLE(right42)) AND FIREABLE(down33)))) : E (F ((FIREABLE(down41) AND FIREABLE(left32)))) : E (F ((FIREABLE(left35) AND FIREABLE(up46)))) : E (F ((FIREABLE(down34) AND FIREABLE(left36) AND FIREABLE(up41)))) : A (G ((NOT FIREABLE(right42) OR NOT FIREABLE(up53) OR NOT FIREABLE(left55) OR ((NOT FIREABLE(right74) OR NOT FIREABLE(right44)) AND (NOT FIREABLE(right65) OR NOT FIREABLE(left24))))))
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(left63) AND FIREABLE(right63))))
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(left63) AND FIREABLE(right63))))
lola: processed formula length: 48
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(left63) AND FIREABLE(right63))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-3 FALSE 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(down41) AND FIREABLE(left32))))
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(down41) AND FIREABLE(left32))))
lola: processed formula length: 47
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(down41) AND FIREABLE(left32))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(left35) AND FIREABLE(up46))))
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(left35) AND FIREABLE(up46))))
lola: processed formula length: 45
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(left35) AND FIREABLE(up46))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(down34) AND FIREABLE(left36) AND FIREABLE(up41))))
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(down34) AND FIREABLE(left36) AND FIREABLE(up41))))
lola: processed formula length: 66
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(down34) AND FIREABLE(left36) AND FIREABLE(up41))
lola: state equation: Generated DNF with 9 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-3-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 Solitaire-PT-FrnNC7x7-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(left23) AND (NOT FIREABLE(right63) OR NOT FIREABLE(right42)) AND FIREABLE(down33))))
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(left23) AND (NOT FIREABLE(right63) OR NOT FIREABLE(right42)) AND FIREABLE(down33))))
lola: processed formula length: 101
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(left23) AND (NOT FIREABLE(right63) OR NOT FIREABLE(right42)) AND FIREABLE(down33))
lola: state equation: Generated DNF with 35 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(down47) OR NOT FIREABLE(up47) OR FIREABLE(right54) OR NOT FIREABLE(down44))))
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(down47) OR NOT FIREABLE(up47) OR FIREABLE(right54) OR NOT FIREABLE(down44))))
lola: processed formula length: 100
lola: 2 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(down47) AND FIREABLE(up47) AND NOT FIREABLE(right54) AND FIREABLE(down44))
lola: state equation: Generated DNF with 20 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-5-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 Solitaire-PT-FrnNC7x7-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(up46) OR FIREABLE(down54)) AND NOT FIREABLE(down24) AND FIREABLE(left44) AND FIREABLE(right14))))
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(up46) OR FIREABLE(down54)) AND NOT FIREABLE(down24) AND FIREABLE(left44) AND FIREABLE(right14))))
lola: processed formula length: 115
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(up46) OR FIREABLE(down54)) AND NOT FIREABLE(down24) AND FIREABLE(left44) AND FIREABLE(right14))
lola: state equation: Generated DNF with 60 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 448791 markings, 1630553 edges
lola: ========================================

FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(left53) OR NOT FIREABLE(left54) OR NOT FIREABLE(down23) OR NOT FIREABLE(left44) OR NOT FIREABLE(left23))))
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(left53) OR NOT FIREABLE(left54) OR NOT FIREABLE(down23) OR NOT FIREABLE(left44) OR NOT FIREABLE(left23))))
lola: processed formula length: 130
lola: 2 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(left53) AND FIREABLE(left54) AND FIREABLE(down23) AND FIREABLE(left44) AND FIREABLE(left23))
lola: state equation: Generated DNF with 15 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-7-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 Solitaire-PT-FrnNC7x7-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(right34) OR FIREABLE(up44) OR NOT FIREABLE(right53) OR NOT FIREABLE(up63) OR FIREABLE(down41))))
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(right34) OR FIREABLE(up44) OR NOT FIREABLE(right53) OR NOT FIREABLE(up63) OR FIREABLE(down41))))
lola: processed formula length: 116
lola: 2 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(right34) AND NOT FIREABLE(up44) AND FIREABLE(right53) AND FIREABLE(up63) AND NOT FIREABLE(down41))
lola: state equation: Generated DNF with 243 literals and 27 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola:
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-8-0.sara
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(left42) OR NOT FIREABLE(right24) OR (FIREABLE(down55) AND FIREABLE(up34) AND FIREABLE(up56) AND FIREABLE(right33)) OR NOT FIREABLE(down23))))
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(left42) OR NOT FIREABLE(right24) OR (FIREABLE(down55) AND FIREABLE(up34) AND FIREABLE(up56) AND FIREABLE(right33)) OR NOT FIREABLE(down23))))
lola: processed formula length: 164
lola: 2 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(left42) AND FIREABLE(right24) AND (NOT FIREABLE(down55) OR NOT FIREABLE(up34) OR NOT FIREABLE(up56) OR NOT FIREABLE(right33)) AND FIREABLE(down23))
lola: state equation: Generated DNF with 100 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-9-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 Solitaire-PT-FrnNC7x7-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 ((NOT FIREABLE(right34) AND NOT FIREABLE(left33) AND FIREABLE(up23) AND FIREABLE(down33) AND FIREABLE(right55) AND NOT FIREABLE(down34) AND FIREABLE(down56))))
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(right34) AND NOT FIREABLE(left33) AND FIREABLE(up23) AND FIREABLE(down33) AND FIREABLE(right55) AND NOT FIREABLE(down34) AND FIREABLE(down56))))
lola: processed formula length: 164
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(right34) AND NOT FIREABLE(left33) AND FIREABLE(up23) AND FIREABLE(down33) AND FIREABLE(right55) AND NOT FIREABLE(down34) AND FIREABLE(down56))
lola: state equation: Generated DNF with 180 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-10-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 Solitaire-PT-FrnNC7x7-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(right32) AND NOT FIREABLE(left64) AND FIREABLE(down46) AND FIREABLE(up34) AND (FIREABLE(down47) OR FIREABLE(left43)) AND FIREABLE(down52))))
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(right32) AND NOT FIREABLE(left64) AND FIREABLE(down46) AND FIREABLE(up34) AND (FIREABLE(down47) OR FIREABLE(left43)) AND FIREABLE(down52))))
lola: processed formula length: 161
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(right32) AND NOT FIREABLE(left64) AND FIREABLE(down46) AND FIREABLE(up34) AND (FIREABLE(down47) OR FIREABLE(left43)) AND FIREABLE(down52))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation: Generated DNF with 252 literals and 18 conjunctive subformulas
lola:
FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-11-0.sara
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(right42) OR NOT FIREABLE(up53) OR NOT FIREABLE(left55) OR ((NOT FIREABLE(right74) OR NOT FIREABLE(right44)) AND (NOT FIREABLE(right65) OR NOT FIREABLE(left24))))))
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(right42) OR NOT FIREABLE(up53) OR NOT FIREABLE(left55) OR ((NOT FIREABLE(right74) OR NOT FIREABLE(right44)) AND (NOT FIREABLE(right65) OR NOT FIREABLE(left24))))))
lola: processed formula length: 188
lola: 2 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(right42) AND FIREABLE(up53) AND FIREABLE(left55) AND ((FIREABLE(right74) AND FIREABLE(right44)) OR (FIREABLE(right65) AND FIREABLE(left24))))
lola: state equation: Generated DNF with 30 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(up52) AND FIREABLE(right25) AND NOT FIREABLE(right55) AND FIREABLE(right56) AND FIREABLE(down23) AND FIREABLE(up35) AND FIREABLE(down34) AND FIREABLE(down55))))
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(up52) AND FIREABLE(right25) AND NOT FIREABLE(right55) AND FIREABLE(right56) AND FIREABLE(down23) AND FIREABLE(up35) AND FIREABLE(down34) AND FIREABLE(down55))))
lola: processed formula length: 176
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(up52) AND FIREABLE(right25) AND NOT FIREABLE(right55) AND FIREABLE(right56) AND FIREABLE(down23) AND FIREABLE(up35) AND FIREABLE(down34) AND FIREABLE(down55))
lola: state equation: Generated DNF with 22 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-13-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 Solitaire-PT-FrnNC7x7-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(left54) AND NOT FIREABLE(up32) AND FIREABLE(right74) AND FIREABLE(down56) AND FIREABLE(down65) AND FIREABLE(right34) AND (FIREABLE(up53) OR FIREABLE(down56) OR NOT FIREABLE(right54)))))
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(left54) AND NOT FIREABLE(up32) AND FIREABLE(right74) AND FIREABLE(down56) AND FIREABLE(down65) AND FIREABLE(right34) AND (FIREABLE(up53) OR FIREABLE(down56) OR NOT FIREABLE(right54)))))
lola: processed formula length: 207
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(left54) AND NOT FIREABLE(up32) AND FIREABLE(right74) AND FIREABLE(down56) AND FIREABLE(down65) AND FIREABLE(right34) AND (FIREABLE(up53) OR FIREABLE(down56) OR NOT FIREABLE(right54)))
lola: state equation: Generated DNF with 423 literals and 27 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 146577 markings, 530488 edges
lola: ========================================

FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(right45) AND NOT FIREABLE(up54) AND FIREABLE(up33) AND FIREABLE(up23) AND NOT FIREABLE(left63) AND (NOT FIREABLE(up65) OR NOT FIREABLE(down35) OR (NOT FIREABLE(up42) AND NOT FIREABLE(down56))))))
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(right45) AND NOT FIREABLE(up54) AND FIREABLE(up33) AND FIREABLE(up23) AND NOT FIREABLE(left63) AND (NOT FIREABLE(up65) OR NOT FIREABLE(down35) OR (NOT FIREABLE(up42) AND NOT FIREABLE(down56))))))
lola: processed formula length: 213
lola: 1 rewrites
lola: closed formula file Solitaire-PT-FrnNC7x7-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(right45) AND NOT FIREABLE(up54) AND FIREABLE(up33) AND FIREABLE(up23) AND NOT FIREABLE(left63) AND (NOT FIREABLE(up65) OR NOT FIREABLE(down35) OR (NOT FIREABLE(up42) AND NOT FIREABLE(down56))))
lola: state equation: Generated DNF with 1593 literals and 126 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnNC7x7-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnNC7x7-ReachabilityFireability-15-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Solitaire-PT-FrnNC7x7-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no yes yes yes yes no yes no no no no yes no
lola:
preliminary result: no no yes no yes yes yes yes no yes no no no no yes no
lola: memory consumption: 14824 KB
lola: time consumption: 4 seconds

BK_STOP 1527265568683

--------------------
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="Solitaire-PT-FrnNC7x7"
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/Solitaire-PT-FrnNC7x7.tgz
mv Solitaire-PT-FrnNC7x7 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 Solitaire-PT-FrnNC7x7, 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-152705512500161"
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 ;