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 208K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 41K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Raft-PT-04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578800126
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526943091950

info: Time: 3600 - MCC
===========================================================================================
prep: translating Raft-PT-04 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating Raft-PT-04 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Raft-PT-04 @ 3563 seconds
lola: LoLA will run for 3563 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 248/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 88
lola: finding significant places
lola: 88 places, 160 transitions, 72 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 155 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-04-ReachabilityFireability.task
lola: E (F (((FIREABLE(t16) OR FIREABLE(t107)) AND NOT FIREABLE(t56)))) : E (F ((FIREABLE(t82) AND NOT FIREABLE(t11) AND FIREABLE(t146) AND FIREABLE(t6)))) : A (G (NOT FIREABLE(t28))) : E (F ((FIREABLE(t22) AND (FIREABLE(t141) OR FIREABLE(t2)) AND FIREABLE(t127) AND (FIREABLE(t18) OR (FIREABLE(t21) AND FIREABLE(t118) AND FIREABLE(t120)))))) : E (F ((FIREABLE(t149) AND NOT FIREABLE(t7) AND FIREABLE(t106) AND FIREABLE(t41) AND FIREABLE(t75)))) : A (G ((NOT FIREABLE(t36) OR NOT FIREABLE(t32) OR NOT FIREABLE(t116) OR NOT FIREABLE(t17)))) : E (F (())) : E (F ((NOT FIREABLE(t32) AND NOT FIREABLE(t54) AND FIREABLE(t112) AND NOT FIREABLE(t98)))) : A (G ((FIREABLE(t121) OR FIREABLE(t112) OR NOT FIREABLE(t28)))) : A (G (((FIREABLE(t81) AND FIREABLE(t90)) OR NOT FIREABLE(t49) OR NOT FIREABLE(t23) OR FIREABLE(t111) OR FIREABLE(t76) OR FIREABLE(t24) OR FIREABLE(t120) OR (FIREABLE(t157) AND NOT FIREABLE(t133))))) : E (F ((NOT FIREABLE(t25) AND NOT FIREABLE(t53) AND (FIREABLE(t42) OR FIREABLE(t23))))) : E (F (((FIREABLE(t64) OR FIREABLE(t157)) AND FIREABLE(t158) AND (FIREABLE(t42) OR (FIREABLE(t2) AND FIREABLE(t21))) AND FIREABLE(t142)))) : E (F (FIREABLE(t10))) : E (F ((NOT FIREABLE(t84) AND NOT FIREABLE(t43) AND (FIREABLE(t52) OR FIREABLE(t157) OR NOT FIREABLE(t40)) AND FIREABLE(t19) AND NOT FIREABLE(t102) AND NOT FIREABLE(t70) AND (FIREABLE(t58) OR FIREABLE(t109))))) : E (F ((FIREABLE(t82) AND (NOT FIREABLE(t133) OR NOT FIREABLE(t141)) AND FIREABLE(t34)))) : A (G (((NOT FIREABLE(t25) OR NOT FIREABLE(t155)) AND (NOT FIREABLE(t51) OR NOT FIREABLE(t18) OR FIREABLE(t52)))))
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 222 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: 3 rewrites
lola: closed formula file Raft-PT-04-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 Raft-PT-04-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t28)))
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(t28)))
lola: processed formula length: 25
lola: 5 rewrites
lola: closed formula file Raft-PT-04-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(t28)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-04-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================

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

FORMULA Raft-PT-04-ReachabilityFireability-12 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: A (G ((FIREABLE(t121) OR FIREABLE(t112) OR NOT FIREABLE(t28))))
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(t121) OR FIREABLE(t112) OR NOT FIREABLE(t28))))
lola: processed formula length: 65
lola: 5 rewrites
lola: closed formula file Raft-PT-04-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(t121) AND NOT FIREABLE(t112) AND FIREABLE(t28))
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 10 edges
lola: ========================================

FORMULA Raft-PT-04-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t16) OR FIREABLE(t107)) AND NOT FIREABLE(t56))))
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(t16) OR FIREABLE(t107)) AND NOT FIREABLE(t56))))
lola: processed formula length: 66
lola: 4 rewrites
lola: closed formula file Raft-PT-04-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(t16) OR FIREABLE(t107)) AND NOT FIREABLE(t56))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-04-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1454 markings, 7711 edges

FORMULA Raft-PT-04-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t32) AND NOT FIREABLE(t54) AND FIREABLE(t112) AND NOT FIREABLE(t98))))
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(t32) AND NOT FIREABLE(t54) AND FIREABLE(t112) AND NOT FIREABLE(t98))))
lola: processed formula length: 90
lola: 4 rewrites
lola: closed formula file Raft-PT-04-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(t32) AND NOT FIREABLE(t54) AND FIREABLE(t112) AND NOT FIREABLE(t98))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA Raft-PT-04-ReachabilityFireability-7 FALSE 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: A (G ((NOT FIREABLE(t36) OR NOT FIREABLE(t32) OR NOT FIREABLE(t116) OR NOT FIREABLE(t17))))
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(t36) OR NOT FIREABLE(t32) OR NOT FIREABLE(t116) OR NOT FIREABLE(t17))))
lola: processed formula length: 94
lola: 5 rewrites
lola: closed formula file Raft-PT-04-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(t36) AND FIREABLE(t32) AND FIREABLE(t116) AND FIREABLE(t17))
lola: state equation: Generated DNF with 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-04-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-04-ReachabilityFireability-6-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 Raft-PT-04-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t25) AND NOT FIREABLE(t53) AND (FIREABLE(t42) OR FIREABLE(t23)))))
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(t25) AND NOT FIREABLE(t53) AND (FIREABLE(t42) OR FIREABLE(t23)))))
lola: processed formula length: 87
lola: 4 rewrites
lola: closed formula file Raft-PT-04-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(t25) AND NOT FIREABLE(t53) AND (FIREABLE(t42) OR FIREABLE(t23)))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-04-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 82 markings, 360 edges
lola: ========================================

FORMULA Raft-PT-04-ReachabilityFireability-10 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: E (F ((FIREABLE(t82) AND NOT FIREABLE(t11) AND FIREABLE(t146) AND FIREABLE(t6))))
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(t82) AND NOT FIREABLE(t11) AND FIREABLE(t146) AND FIREABLE(t6))))
lola: processed formula length: 81
lola: 4 rewrites
lola: closed formula file Raft-PT-04-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(t82) AND NOT FIREABLE(t11) AND FIREABLE(t146) AND FIREABLE(t6))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-04-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-04-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Raft-PT-04-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t82) AND (NOT FIREABLE(t133) OR NOT FIREABLE(t141)) AND FIREABLE(t34))))
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(t82) AND (NOT FIREABLE(t133) OR NOT FIREABLE(t141)) AND FIREABLE(t34))))
lola: processed formula length: 89
lola: 4 rewrites
lola: closed formula file Raft-PT-04-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(t82) AND (NOT FIREABLE(t133) OR NOT FIREABLE(t141)) AND FIREABLE(t34))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-04-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 9 edges
lola: ========================================

FORMULA Raft-PT-04-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t149) AND NOT FIREABLE(t7) AND FIREABLE(t106) AND FIREABLE(t41) AND FIREABLE(t75))))
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(t149) AND NOT FIREABLE(t7) AND FIREABLE(t106) AND FIREABLE(t41) AND FIREABLE(t75))))
lola: processed formula length: 100
lola: 4 rewrites
lola: closed formula file Raft-PT-04-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(t149) AND NOT FIREABLE(t7) AND FIREABLE(t106) AND FIREABLE(t41) AND FIREABLE(t75))
lola: state equation: Generated DNF with 9 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-04-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 11 edges

FORMULA Raft-PT-04-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t25) OR NOT FIREABLE(t155)) AND (NOT FIREABLE(t51) OR NOT FIREABLE(t18) OR FIREABLE(t52)))))
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(t25) OR NOT FIREABLE(t155)) AND (NOT FIREABLE(t51) OR NOT FIREABLE(t18) OR FIREABLE(t52)))))
lola: processed formula length: 116
lola: 5 rewrites
lola: closed formula file Raft-PT-04-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(t25) AND FIREABLE(t155)) OR (FIREABLE(t51) AND FIREABLE(t18) AND NOT FIREABLE(t52)))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-04-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-04-ReachabilityFireability-11-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.
lola: ========================================

FORMULA Raft-PT-04-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t64) OR FIREABLE(t157)) AND FIREABLE(t158) AND (FIREABLE(t42) OR (FIREABLE(t2) AND FIREABLE(t21))) AND FIREABLE(t142))))
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(t64) OR FIREABLE(t157)) AND FIREABLE(t158) AND (FIREABLE(t42) OR (FIREABLE(t2) AND FIREABLE(t21))) AND FIREABLE(t142))))
lola: processed formula length: 139
lola: 4 rewrites
lola: closed formula file Raft-PT-04-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(t64) OR FIREABLE(t157)) AND FIREABLE(t158) AND (FIREABLE(t42) OR (FIREABLE(t2) AND FIREABLE(t21))) AND FIREABLE(t142))
lola: state equation: Generated DNF with 30 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-04-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-04-ReachabilityFireability-12-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 Raft-PT-04-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t22) AND (FIREABLE(t141) OR FIREABLE(t2)) AND FIREABLE(t127) AND (FIREABLE(t18) OR (FIREABLE(t21) AND FIREABLE(t118) AND FIREABLE(t120))))))
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(t22) AND (FIREABLE(t141) OR FIREABLE(t2)) AND FIREABLE(t127) AND (FIREABLE(t18) OR (FIREABLE(t21) AND FIREABLE(t118) AND FIREABLE(t120))))))
lola: processed formula length: 158
lola: 4 rewrites
lola: closed formula file Raft-PT-04-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(t22) AND (FIREABLE(t141) OR FIREABLE(t2)) AND FIREABLE(t127) AND (FIREABLE(t18) OR (FIREABLE(t21) AND FIREABLE(t118) AND FIREABLE(t120))))
lola: state equation: Generated DNF with 30 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-04-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-04-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 Raft-PT-04-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t81) AND FIREABLE(t90)) OR NOT FIREABLE(t49) OR NOT FIREABLE(t23) OR FIREABLE(t111) OR FIREABLE(t76) OR FIREABLE(t24) OR FIREABLE(t120) OR (FIREABLE(t157) AND NOT FIREABLE(t133)))))
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(t81) AND FIREABLE(t90)) OR NOT FIREABLE(t49) OR NOT FIREABLE(t23) OR FIREABLE(t111) OR FIREABLE(t76) OR FIREABLE(t24) OR FIREABLE(t120) OR (FIREABLE(t157) AND NOT FIREABLE(t133)))))
lola: processed formula length: 205
lola: 5 rewrites
lola: closed formula file Raft-PT-04-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(t81) OR NOT FIREABLE(t90)) AND FIREABLE(t49) AND FIREABLE(t23) AND NOT FIREABLE(t111) AND NOT FIREABLE(t76) AND NOT FIREABLE(t24) AND NOT FIREABLE(t120) AND (NOT FIREABLE(t157) OR FIREABLE(t133)))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA Raft-PT-04-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t84) AND NOT FIREABLE(t43) AND (FIREABLE(t52) OR FIREABLE(t157) OR NOT FIREABLE(t40)) AND FIREABLE(t19) AND NOT FIREABLE(t102) AND NOT FIREABLE(t70) AND (FIREABLE(t58) OR FIREABLE(t109)))))
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(t84) AND NOT FIREABLE(t43) AND (FIREABLE(t52) OR FIREABLE(t157) OR NOT FIREABLE(t40)) AND FIREABLE(t19) AND NOT FIREABLE(t102) AND NOT FIREABLE(t70) AND (FIREABLE(t58) OR FIREABLE(t109)))))
lola: processed formula length: 212
lola: 4 rewrites
lola: closed formula file Raft-PT-04-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(t84) AND NOT FIREABLE(t43) AND (FIREABLE(t52) OR FIREABLE(t157) OR NOT FIREABLE(t40)) AND FIREABLE(t19) AND NOT FIREABLE(t102) AND NOT FIREABLE(t70) AND (FIREABLE(t58) OR FIREABLE(t109)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 19 edges
lola: ========================================

FORMULA Raft-PT-04-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no yes yes no no no yes yes yes yes yes yes no
lola:
preliminary result: yes no no no yes yes no no no yes yes yes yes yes yes no
lola: memory consumption: 14772 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="Raft-PT-04"
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/Raft-PT-04.tgz
mv Raft-PT-04 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 Raft-PT-04, 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 r136-qhx2-152673578800126"
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 ;