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 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 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 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K 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 66K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Solitaire-PT-SqrNC5x5, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512600175
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527272803671

info: Time: 3600 - MCC
===========================================================================================
prep: translating Solitaire-PT-SqrNC5x5 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Solitaire-PT-SqrNC5x5 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Solitaire-PT-SqrNC5x5 @ 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: 134/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1600
lola: finding significant places
lola: 50 places, 84 transitions, 25 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 168 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-SqrNC5x5-ReachabilityFireability.task
lola: A (G (((FIREABLE(right43) AND FIREABLE(up34)) OR NOT FIREABLE(right23) OR FIREABLE(right42) OR FIREABLE(left64) OR (FIREABLE(left65) AND FIREABLE(left24)) OR FIREABLE(down53) OR FIREABLE(down42) OR FIREABLE(left36) OR (NOT FIREABLE(left34) AND FIREABLE(right56))))) : A (G ((NOT FIREABLE(down52) OR NOT FIREABLE(up42) OR FIREABLE(up53) OR (NOT FIREABLE(right65) AND NOT FIREABLE(right46) AND (NOT FIREABLE(right55) OR NOT FIREABLE(up24)))))) : E (F ((FIREABLE(left33) AND FIREABLE(down55) AND FIREABLE(down35)))) : E (F ((FIREABLE(right52) AND FIREABLE(down45) AND (FIREABLE(down35) OR (FIREABLE(up25) AND FIREABLE(right33) AND FIREABLE(right65)))))) : E (F (())) : A (G (((FIREABLE(left32) AND FIREABLE(right24)) OR FIREABLE(left45) OR FIREABLE(left35) OR NOT FIREABLE(down54) OR NOT FIREABLE(down33) OR NOT FIREABLE(down34)))) : A (G ((NOT FIREABLE(right44) OR NOT FIREABLE(up52) OR FIREABLE(right34) OR (FIREABLE(up36) AND FIREABLE(left63)) OR FIREABLE(up43) OR FIREABLE(left42)))) : E (F ((FIREABLE(left64) AND (FIREABLE(down24) OR FIREABLE(left44) OR NOT FIREABLE(right46)) AND FIREABLE(down44) AND (FIREABLE(right65) OR FIREABLE(up65)) AND FIREABLE(up33)))) : A (G (((NOT FIREABLE(up65) OR NOT FIREABLE(down36) OR NOT FIREABLE(down63) OR NOT FIREABLE(up35)) AND (NOT FIREABLE(right43) OR NOT FIREABLE(up42) OR NOT FIREABLE(left52))))) : A (G ((NOT FIREABLE(down36) OR NOT FIREABLE(right55) OR FIREABLE(up52) OR NOT FIREABLE(right25)))) : E (F ((NOT FIREABLE(right64) AND FIREABLE(right25) AND (FIREABLE(right64) OR FIREABLE(down35))))) : E (F (())) : E (F ((FIREABLE(down33) AND FIREABLE(left42) AND FIREABLE(down54)))) : E (F ((NOT FIREABLE(down64) AND NOT FIREABLE(left33) AND FIREABLE(right32) AND FIREABLE(left63) AND FIREABLE(up43) AND FIREABLE(left53) AND FIREABLE(up34)))) : A (G ((NOT FIREABLE(right65) OR NOT FIREABLE(down65) OR NOT FIREABLE(up65) OR NOT FIREABLE(up34) OR NOT FIREABLE(up33) OR NOT FIREABLE(right53) OR NOT FIREABLE(down43)))) : A (G ((NOT FIREABLE(right65) OR NOT FIREABLE(up45) OR (NOT FIREABLE(down65) AND NOT FIREABLE(down42)) OR NOT FIREABLE(up64) OR NOT FIREABLE(up42) OR (NOT FIREABLE(up52) AND NOT FIREABLE(right45)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityFireability-4 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityFireability-11 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 ((NOT FIREABLE(right64) AND FIREABLE(right25) AND (FIREABLE(right64) OR FIREABLE(down35)))))
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(right64) AND FIREABLE(right25) AND (FIREABLE(right64) OR FIREABLE(down35)))))
lola: processed formula length: 98
lola: 7 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-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(right64) AND FIREABLE(right25) AND (FIREABLE(right64) OR FIREABLE(down35)))
lola: state equation: Generated DNF with 21 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrNC5x5-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrNC5x5-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-SqrNC5x5-ReachabilityFireability-10 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(left33) AND FIREABLE(down55) AND FIREABLE(down35))))
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(left33) AND FIREABLE(down55) AND FIREABLE(down35))))
lola: processed formula length: 68
lola: 7 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-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(left33) AND FIREABLE(down55) AND FIREABLE(down35))
lola: state equation: Generated DNF with 9 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrNC5x5-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrNC5x5-ReachabilityFireability-3-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-SqrNC5x5-ReachabilityFireability-2 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 ((FIREABLE(down33) AND FIREABLE(left42) AND FIREABLE(down54))))
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(down33) AND FIREABLE(left42) AND FIREABLE(down54))))
lola: processed formula length: 68
lola: 7 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-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(down33) AND FIREABLE(left42) AND FIREABLE(down54))
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrNC5x5-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrNC5x5-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-SqrNC5x5-ReachabilityFireability-12 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(down36) OR NOT FIREABLE(right55) OR FIREABLE(up52) OR NOT FIREABLE(right25))))
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(down36) OR NOT FIREABLE(right55) OR FIREABLE(up52) OR NOT FIREABLE(right25))))
lola: processed formula length: 101
lola: 8 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-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(down36) AND FIREABLE(right55) AND NOT FIREABLE(up52) AND FIREABLE(right25))
lola: state equation: Generated DNF with 30 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrNC5x5-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrNC5x5-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-SqrNC5x5-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(right52) AND FIREABLE(down45) AND (FIREABLE(down35) OR (FIREABLE(up25) AND FIREABLE(right33) AND FIREABLE(right65))))))
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(right52) AND FIREABLE(down45) AND (FIREABLE(down35) OR (FIREABLE(up25) AND FIREABLE(right33) AND FIREABLE(right65))))))
lola: processed formula length: 136
lola: 7 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-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(right52) AND FIREABLE(down45) AND (FIREABLE(down35) OR (FIREABLE(up25) AND FIREABLE(right33) AND FIREABLE(right65))))
lola: state equation: Generated DNF with 21 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrNC5x5-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrNC5x5-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-SqrNC5x5-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: A (G ((NOT FIREABLE(down52) OR NOT FIREABLE(up42) OR FIREABLE(up53) OR (NOT FIREABLE(right65) AND NOT FIREABLE(right46) AND (NOT FIREABLE(right55) OR NOT FIREABLE(up24))))))
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(down52) OR NOT FIREABLE(up42) OR FIREABLE(up53) OR (NOT FIREABLE(right65) AND NOT FIREABLE(right46) AND (NOT FIREABLE(right55) OR NOT FIREABLE(up24))))))
lola: processed formula length: 177
lola: 8 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-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(down52) AND FIREABLE(up42) AND NOT FIREABLE(up53) AND (FIREABLE(right65) OR FIREABLE(right46) OR (FIREABLE(right55) AND FIREABLE(up24))))
lola: state equation: Generated DNF with 93 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrNC5x5-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrNC5x5-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.

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(left32) AND FIREABLE(right24)) OR FIREABLE(left45) OR FIREABLE(left35) OR NOT FIREABLE(down54) OR NOT FIREABLE(down33) OR NOT FIREABLE(down34))))
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(left32) AND FIREABLE(right24)) OR FIREABLE(left45) OR FIREABLE(left35) OR NOT FIREABLE(down54) OR NOT FIREABLE(down33) OR NOT FIREABLE(down34))))
lola: processed formula length: 167
lola: 8 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-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(left32) OR NOT FIREABLE(right24)) AND NOT FIREABLE(left45) AND NOT FIREABLE(left35) AND FIREABLE(down54) AND FIREABLE(down33) AND FIREABLE(down34))
lola: state equation: Generated DNF with 192 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrNC5x5-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrNC5x5-ReachabilityFireability-8-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-SqrNC5x5-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(right44) OR NOT FIREABLE(up52) OR FIREABLE(right34) OR (FIREABLE(up36) AND FIREABLE(left63)) OR FIREABLE(up43) OR FIREABLE(left42))))
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(right44) OR NOT FIREABLE(up52) OR FIREABLE(right34) OR (FIREABLE(up36) AND FIREABLE(left63)) OR FIREABLE(up43) OR FIREABLE(left42))))
lola: processed formula length: 158
lola: 8 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-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(right44) AND FIREABLE(up52) AND NOT FIREABLE(right34) AND (NOT FIREABLE(up36) OR NOT FIREABLE(left63)) AND NOT FIREABLE(up43) AND NOT FIREABLE(left42))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityFireability-6 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: A (G (((NOT FIREABLE(up65) OR NOT FIREABLE(down36) OR NOT FIREABLE(down63) OR NOT FIREABLE(up35)) AND (NOT FIREABLE(right43) OR NOT FIREABLE(up42) OR NOT FIREABLE(left52)))))
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(up65) OR NOT FIREABLE(down36) OR NOT FIREABLE(down63) OR NOT FIREABLE(up35)) AND (NOT FIREABLE(right43) OR NOT FIREABLE(up42) OR NOT FIREABLE(left52)))))
lola: processed formula length: 179
lola: 8 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-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(up65) AND FIREABLE(down36) AND FIREABLE(down63) AND FIREABLE(up35)) OR (FIREABLE(right43) AND FIREABLE(up42) AND FIREABLE(left52)))
lola: state equation: Generated DNF with 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrNC5x5-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: lola: state equation: calling and running sara
result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityFireability-8 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: ========================================
sara: try reading problem file Solitaire-PT-SqrNC5x5-ReachabilityFireability-10-0.sara.
lola: ...considering subproblem: E (F ((NOT FIREABLE(down64) AND NOT FIREABLE(left33) AND FIREABLE(right32) AND FIREABLE(left63) AND FIREABLE(up43) AND FIREABLE(left53) AND FIREABLE(up34))))
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(down64) AND NOT FIREABLE(left33) AND FIREABLE(right32) AND FIREABLE(left63) AND FIREABLE(up43) AND FIREABLE(left53) AND FIREABLE(up34))))
lola: processed formula length: 157
lola: 7 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-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(down64) AND NOT FIREABLE(left33) AND FIREABLE(right32) AND FIREABLE(left63) AND FIREABLE(up43) AND FIREABLE(left53) AND FIREABLE(up34))
lola: state equation: Generated DNF with 16 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrNC5x5-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrNC5x5-ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola:
========================================
FORMULA Solitaire-PT-SqrNC5x5-ReachabilityFireability-13 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: A (G ((NOT FIREABLE(right65) OR NOT FIREABLE(down65) OR NOT FIREABLE(up65) OR NOT FIREABLE(up34) OR NOT FIREABLE(up33) OR NOT FIREABLE(right53) OR NOT FIREABLE(down43))))
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(right65) OR NOT FIREABLE(down65) OR NOT FIREABLE(up65) OR NOT FIREABLE(up34) OR NOT FIREABLE(up33) OR NOT FIREABLE(right53) OR NOT FIREABLE(down43))))
lola: processed formula length: 176
lola: 8 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-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(right65) AND FIREABLE(down65) AND FIREABLE(up65) AND FIREABLE(up34) AND FIREABLE(up33) AND FIREABLE(right53) AND FIREABLE(down43))
lola: state equation: Generated DNF with 19 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrNC5x5-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrNC5x5-ReachabilityFireability-12-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-SqrNC5x5-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(left64) AND (FIREABLE(down24) OR FIREABLE(left44) OR NOT FIREABLE(right46)) AND FIREABLE(down44) AND (FIREABLE(right65) OR FIREABLE(up65)) AND FIREABLE(up33))))
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(left64) AND (FIREABLE(down24) OR FIREABLE(left44) OR NOT FIREABLE(right46)) AND FIREABLE(down44) AND (FIREABLE(right65) OR FIREABLE(up65)) AND FIREABLE(up33))))
lola: processed formula length: 179
lola: 7 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-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(left64) AND (FIREABLE(down24) OR FIREABLE(left44) OR NOT FIREABLE(right46)) AND FIREABLE(down44) AND (FIREABLE(right65) OR FIREABLE(up65)) AND FIREABLE(up33))
lola: state equation: Generated DNF with 106 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrNC5x5-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrNC5x5-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-SqrNC5x5-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(right65) OR NOT FIREABLE(up45) OR (NOT FIREABLE(down65) AND NOT FIREABLE(down42)) OR NOT FIREABLE(up64) OR NOT FIREABLE(up42) OR (NOT FIREABLE(up52) AND NOT FIREABLE(right45)))))
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(right65) OR NOT FIREABLE(up45) OR (NOT FIREABLE(down65) AND NOT FIREABLE(down42)) OR NOT FIREABLE(up64) OR NOT FIREABLE(up42) OR (NOT FIREABLE(up52) AND NOT FIREABLE(right45)))))
lola: processed formula length: 203
lola: 8 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-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(right65) AND FIREABLE(up45) AND (FIREABLE(down65) OR FIREABLE(down42)) AND FIREABLE(up64) AND FIREABLE(up42) AND (FIREABLE(up52) OR FIREABLE(right45)))
lola: state equation: Generated DNF with 66 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-SqrNC5x5-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-SqrNC5x5-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 Solitaire-PT-SqrNC5x5-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(right43) AND FIREABLE(up34)) OR NOT FIREABLE(right23) OR FIREABLE(right42) OR FIREABLE(left64) OR (FIREABLE(left65) AND FIREABLE(left24)) OR FIREABLE(down53) OR FIREABLE(down42) OR FIREABLE(left36) OR (NOT FIREABLE(left34) AND FIREABLE(right56)))))
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(right43) AND FIREABLE(up34)) OR NOT FIREABLE(right23) OR FIREABLE(right42) OR FIREABLE(left64) OR (FIREABLE(left65) AND FIREABLE(left24)) OR FIREABLE(down53) OR FIREABLE(down42) OR FIREABLE(left36) OR (NOT FIREABLE(left34) AND FIREABLE(right56)))))
lola: processed formula length: 273
lola: 8 rewrites
lola: closed formula file Solitaire-PT-SqrNC5x5-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(right43) OR NOT FIREABLE(up34)) AND FIREABLE(right23) AND NOT FIREABLE(right42) AND NOT FIREABLE(left64) AND (NOT FIREABLE(left65) OR NOT FIREABLE(left24)) AND NOT FIREABLE(down53) AND NOT FIREABLE(down42) AND NOT FIREABLE(left36) AND (FIREABLE(left34) OR NOT FIREABLE(right56)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes no yes yes no no yes no no no no yes yes
lola:
preliminary result: no yes no yes no yes yes no no yes no no no no yes yes
lola: memory consumption: 14816 KB
lola: time consumption: 1 seconds

BK_STOP 1527272804333

--------------------
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-SqrNC5x5"
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-SqrNC5x5.tgz
mv Solitaire-PT-SqrNC5x5 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-SqrNC5x5, 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-152705512600175"
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 ;