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 252K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.5K 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 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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 2.9K 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.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 77K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Solitaire-PT-EngCT7x7, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512500140
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527253984403

info: Time: 3600 - MCC
===========================================================================================
prep: translating Solitaire-PT-EngCT7x7 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Solitaire-PT-EngCT7x7 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Solitaire-PT-EngCT7x7 @ 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: 143/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2144
lola: finding significant places
lola: 67 places, 76 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 77 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-EngCT7x7-ReachabilityFireability.task
lola: E (F ((FIREABLE(left46) AND FIREABLE(up24) AND FIREABLE(down55)))) : E (F ((FIREABLE(down53) AND FIREABLE(right55) AND FIREABLE(up43)))) : E (F (((NOT FIREABLE(down45) OR NOT FIREABLE(right36)) AND (FIREABLE(up35) OR FIREABLE(left33) OR FIREABLE(up24) OR FIREABLE(up34)) AND FIREABLE(left35) AND FIREABLE(left36) AND FIREABLE(right64) AND FIREABLE(left42) AND FIREABLE(right74)))) : E (F ((FIREABLE(up43) AND FIREABLE(left46) AND FIREABLE(right64)))) : A (G ((NOT FIREABLE(down23) OR (FIREABLE(down46) AND FIREABLE(down64)) OR (NOT FIREABLE(left36) AND NOT FIREABLE(down25)) OR FIREABLE(up34)))) : A (G ((NOT FIREABLE(right56) OR NOT FIREABLE(left24) OR (NOT FIREABLE(right74) AND NOT FIREABLE(right14)) OR NOT FIREABLE(right54)))) : E (F ((FIREABLE(right34) AND FIREABLE(up43) AND NOT FIREABLE(down63) AND NOT FIREABLE(left32) AND (NOT FIREABLE(right33) OR NOT FIREABLE(left54))))) : A (G (())) : E (F ((FIREABLE(down54) AND FIREABLE(down47) AND FIREABLE(down23)))) : E (F (FIREABLE(down41))) : E (F (FIREABLE(right45))) : E (F (FIREABLE(down24))) : E (F (FIREABLE(right34))) : A (G (((FIREABLE(down47) AND ((FIREABLE(left56) AND FIREABLE(left24)) OR NOT FIREABLE(down53))) OR (NOT FIREABLE(down47) AND NOT FIREABLE(up53) AND ((FIREABLE(down54) AND FIREABLE(up65)) OR NOT FIREABLE(right53)))))) : E (F ((FIREABLE(up63) OR FIREABLE(right64) OR FIREABLE(right35) OR FIREABLE(down54) OR (FIREABLE(right34) AND FIREABLE(down53))))) : E (F ((FIREABLE(left46) AND (FIREABLE(up65) OR (FIREABLE(down55) AND FIREABLE(up47))) AND FIREABLE(right44) AND (FIREABLE(down42) OR (FIREABLE(right44) AND FIREABLE(right32))))))
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 Solitaire-PT-EngCT7x7-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 Solitaire-PT-EngCT7x7-ReachabilityFireability-7 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(down41)))
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)))
lola: processed formula length: 24
lola: 4 rewrites
lola: closed formula file Solitaire-PT-EngCT7x7-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)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA Solitaire-PT-EngCT7x7-ReachabilityFireability-9 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(right45)))
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)))
lola: processed formula length: 25
lola: 4 rewrites
lola: closed formula file Solitaire-PT-EngCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(right45)
lola: ========================================

FORMULA Solitaire-PT-EngCT7x7-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(down24)))
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(down24)))
lola: processed formula length: 24
lola: 4 rewrites
lola: closed formula file Solitaire-PT-EngCT7x7-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(down24)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges

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

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

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

FORMULA Solitaire-PT-EngCT7x7-ReachabilityFireability-1 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(up43) AND FIREABLE(left46) AND FIREABLE(right64))))
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(up43) AND FIREABLE(left46) AND FIREABLE(right64))))
lola: processed formula length: 67
lola: 4 rewrites
lola: closed formula file Solitaire-PT-EngCT7x7-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(up43) AND FIREABLE(left46) AND FIREABLE(right64))
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityFireability-6-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-EngCT7x7-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(left46) AND FIREABLE(up24) 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(left46) AND FIREABLE(up24) AND FIREABLE(down55))))
lola: processed formula length: 66
lola: 4 rewrites
lola: closed formula file Solitaire-PT-EngCT7x7-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(left46) AND FIREABLE(up24) AND FIREABLE(down55))
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Solitaire-PT-EngCT7x7-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(down54) AND FIREABLE(down47) AND FIREABLE(down23))))
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(down54) AND FIREABLE(down47) AND FIREABLE(down23))))
lola: processed formula length: 68
lola: 4 rewrites
lola: closed formula file Solitaire-PT-EngCT7x7-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(down54) AND FIREABLE(down47) AND FIREABLE(down23))
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: state equation: calling and running sara
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================

FORMULA Solitaire-PT-EngCT7x7-ReachabilityFireability-8 TRUE 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: A (G ((NOT FIREABLE(right56) OR NOT FIREABLE(left24) OR (NOT FIREABLE(right74) AND NOT FIREABLE(right14)) OR NOT FIREABLE(right54))))
lola: ========================================
lola: SUBTASK
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityFireability-8-0.sara.
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(right56) OR NOT FIREABLE(left24) OR (NOT FIREABLE(right74) AND NOT FIREABLE(right14)) OR NOT FIREABLE(right54))))
lola: processed formula length: 136
lola: 5 rewrites
lola: closed formula file Solitaire-PT-EngCT7x7-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(right56) AND FIREABLE(left24) AND (FIREABLE(right74) OR FIREABLE(right14)) AND FIREABLE(right54))
lola: state equation: Generated DNF with 32 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityFireability-9-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-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-EngCT7x7-ReachabilityFireability-5 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(down23) OR (FIREABLE(down46) AND FIREABLE(down64)) OR (NOT FIREABLE(left36) AND NOT FIREABLE(down25)) OR FIREABLE(up34))))
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(down23) OR (FIREABLE(down46) AND FIREABLE(down64)) OR (NOT FIREABLE(left36) AND NOT FIREABLE(down25)) OR FIREABLE(up34))))
lola: processed formula length: 145
lola: 5 rewrites
lola: closed formula file Solitaire-PT-EngCT7x7-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(down23) AND (NOT FIREABLE(down46) OR NOT FIREABLE(down64)) AND (FIREABLE(left36) OR FIREABLE(down25)) AND NOT FIREABLE(up34))
lola: state equation: Generated DNF with 360 literals and 36 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityFireability-10-0.sara
lola: ========================================

FORMULA Solitaire-PT-EngCT7x7-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 ((FIREABLE(right34) AND FIREABLE(up43) AND NOT FIREABLE(down63) AND NOT FIREABLE(left32) AND (NOT FIREABLE(right33) OR NOT FIREABLE(left54)))))
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(right34) AND FIREABLE(up43) AND NOT FIREABLE(down63) AND NOT FIREABLE(left32) AND (NOT FIREABLE(right33) OR NOT FIREABLE(left54)))))
lola: processed formula length: 149
lola: 4 rewrites
lola: closed formula file Solitaire-PT-EngCT7x7-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(right34) AND FIREABLE(up43) AND NOT FIREABLE(down63) AND NOT FIREABLE(left32) AND (NOT FIREABLE(right33) OR NOT FIREABLE(left54)))
lola: state equation: Generated DNF with 176 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityFireability-11-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-EngCT7x7-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(up63) OR FIREABLE(right64) OR FIREABLE(right35) OR FIREABLE(down54) OR (FIREABLE(right34) AND FIREABLE(down53)))))
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(up63) OR FIREABLE(right64) OR FIREABLE(right35) OR FIREABLE(down54) OR (FIREABLE(right34) AND FIREABLE(down53)))))
lola: processed formula length: 134
lola: 4 rewrites
lola: closed formula file Solitaire-PT-EngCT7x7-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Solitaire-PT-EngCT7x7-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(left46) AND (FIREABLE(up65) OR (FIREABLE(down55) AND FIREABLE(up47))) AND FIREABLE(right44) AND (FIREABLE(down42) OR (FIREABLE(right44) AND FIREABLE(right32))))))
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(left46) AND (FIREABLE(up65) OR (FIREABLE(down55) AND FIREABLE(up47))) AND FIREABLE(right44) AND (FIREABLE(down42) OR (FIREABLE(right44) AND FIREABLE(right32))))))
lola: processed formula length: 180
lola: 4 rewrites
lola: closed formula file Solitaire-PT-EngCT7x7-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(left46) AND (FIREABLE(up65) OR (FIREABLE(down55) AND FIREABLE(up47))) AND FIREABLE(right44) AND (FIREABLE(down42) OR (FIREABLE(right44) AND FIREABLE(right32))))
lola: state equation: Generated DNF with 80 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Solitaire-PT-EngCT7x7-ReachabilityFireability-15 TRUE 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(down47) AND ((FIREABLE(left56) AND FIREABLE(left24)) OR NOT FIREABLE(down53))) OR (NOT FIREABLE(down47) AND NOT FIREABLE(up53) AND ((FIREABLE(down54) AND FIREABLE(up65)) OR NOT FIREABLE(right53))))))
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(down47) AND ((FIREABLE(left56) AND FIREABLE(left24)) OR NOT FIREABLE(down53))) OR (NOT FIREABLE(down47) AND NOT FIREABLE(up53) AND ((FIREABLE(down54) AND FIREABLE(up65)) OR NOT FIREABLE(right53))))))
lola: processed formula length: 219
lola: 5 rewrites
lola: closed formula file Solitaire-PT-EngCT7x7-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(down47) OR ((NOT FIREABLE(left56) OR NOT FIREABLE(left24)) AND FIREABLE(down53))) AND (FIREABLE(down47) OR FIREABLE(up53) OR ((NOT FIREABLE(down54) OR NOT FIREABLE(up65)) AND FIREABLE(right53))))
lola: state equation: Generated DNF with 513 literals and 60 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA Solitaire-PT-EngCT7x7-ReachabilityFireability-13 FALSE 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: E (F (((NOT FIREABLE(down45) OR NOT FIREABLE(right36)) AND (FIREABLE(up35) OR FIREABLE(left33) OR FIREABLE(up24) OR FIREABLE(up34)) AND FIREABLE(left35) AND FIREABLE(left36) AND FIREABLE(right64) AND FIREABLE(left42) AND FIREABLE(right74))))
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(down45) OR NOT FIREABLE(right36)) AND (FIREABLE(up35) OR FIREABLE(left33) OR FIREABLE(up24) OR FIREABLE(up34)) AND FIREABLE(left35) AND FIREABLE(left36) AND FIREABLE(right64) AND FIREABLE(left42) AND FIREABLE(right74))))
lola: processed formula length: 245
lola: 4 rewrites
lola: closed formula file Solitaire-PT-EngCT7x7-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(down45) OR NOT FIREABLE(right36)) AND (FIREABLE(up35) OR FIREABLE(left33) OR FIREABLE(up24) OR FIREABLE(up34)) AND FIREABLE(left35) AND FIREABLE(left36) AND FIREABLE(right64) AND FIREABLE(left42) AND FIREABLE(right74))
lola: state equation: Generated DNF with 500 literals and 20 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-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-EngCT7x7-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no yes no yes yes yes yes yes yes no yes yes
lola:
preliminary result: no no no yes no yes no yes yes yes yes yes yes no yes yes
lola: memory consumption: 14828 KB
lola: time consumption: 1 seconds


BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Solitaire-PT-EngCT7x7"
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-EngCT7x7.tgz
mv Solitaire-PT-EngCT7x7 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-EngCT7x7, 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-152705512500140"
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 ;