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 320K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 147K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is CircularTrains-PT-192, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-smll-152646357100035
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526482594955

info: Time: 3600 - MCC
===========================================================================================
prep: translating CircularTrains-PT-192 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating CircularTrains-PT-192 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ CircularTrains-PT-192 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 576/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: Size of bit vector: 12288
lola: finding significant places
lola: 384 places, 192 transitions, 191 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 384 transition conflict sets
lola: TASK
lola: reading formula from CircularTrains-PT-192-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t181_to_182) OR NOT FIREABLE(t176_to_177) OR (FIREABLE(t75_to_76) AND FIREABLE(t94_to_95)) OR (FIREABLE(t77_to_78) AND FIREABLE(t41_to_42)) OR FIREABLE(t40_to_41) OR (NOT FIREABLE(t34_to_35) AND NOT FIREABLE(t178_to_179))))) : E (F (FIREABLE(t128_to_129))) : A (G ((NOT FIREABLE(t120_to_121) OR NOT FIREABLE(t99_to_100) OR NOT FIREABLE(t92_to_93) OR NOT FIREABLE(t72_to_73) OR FIREABLE(t128_to_129)))) : E (F (FIREABLE(t182_to_183))) : A (G ((NOT FIREABLE(t133_to_134) OR NOT FIREABLE(t119_to_120) OR (NOT FIREABLE(t117_to_118) AND NOT FIREABLE(t148_to_149)) OR NOT FIREABLE(t184_to_185)))) : A (G ((FIREABLE(t179_to_180) OR FIREABLE(t133_to_134) OR NOT FIREABLE(t130_to_131) OR FIREABLE(t159_to_160)))) : A (G ((((NOT FIREABLE(t81_to_82) OR NOT FIREABLE(t141_to_142)) AND NOT FIREABLE(t139_to_140)) OR ((NOT FIREABLE(t50_to_51) OR NOT FIREABLE(t167_to_168)) AND (NOT FIREABLE(t65_to_66) OR NOT FIREABLE(t84_to_85)))))) : E (F ((((NOT FIREABLE(t42_to_43) AND FIREABLE(t107_to_108)) OR FIREABLE(t151_to_152)) AND (FIREABLE(t38_to_39) OR (FIREABLE(t114_to_115) AND FIREABLE(t38_to_39)) OR ((FIREABLE(t6_to_7) OR FIREABLE(t135_to_136)) AND FIREABLE(t17_to_18)))))) : E (F ((FIREABLE(t146_to_147) AND ((FIREABLE(t111_to_112) AND FIREABLE(t151_to_152)) OR NOT FIREABLE(t25_to_26)) AND NOT FIREABLE(t25_to_26) AND NOT FIREABLE(t30_to_31) AND NOT FIREABLE(t129_to_130)))) : E (F ((FIREABLE(t144_to_145) AND FIREABLE(t169_to_170) AND FIREABLE(t5_to_6) AND FIREABLE(t76_to_77) AND FIREABLE(t97_to_98) AND FIREABLE(t41_to_42) AND NOT FIREABLE(t116_to_117) AND FIREABLE(t119_to_120) AND (FIREABLE(t123_to_124) OR FIREABLE(t172_to_173)) AND (FIREABLE(t120_to_121) OR FIREABLE(t150_to_151) OR (FIREABLE(t68_to_69) AND FIREABLE(t157_to_158)))))) : E (F ((NOT FIREABLE(t118_to_119) AND FIREABLE(t40_to_41) AND NOT FIREABLE(t144_to_145)))) : E (F ((FIREABLE(t74_to_75) AND FIREABLE(t10_to_11) AND (FIREABLE(t192_to_1) OR FIREABLE(t132_to_133))))) : E (F ((FIREABLE(t165_to_166) AND FIREABLE(t124_to_125) AND FIREABLE(t77_to_78) AND (FIREABLE(t96_to_97) OR (NOT FIREABLE(t66_to_67) AND NOT FIREABLE(t127_to_128)))))) : A (G (((NOT FIREABLE(t166_to_167) AND NOT FIREABLE(t148_to_149)) OR NOT FIREABLE(t167_to_168) OR FIREABLE(t60_to_61)))) : A (G ((((FIREABLE(t160_to_161) OR FIREABLE(t8_to_9) OR (FIREABLE(t14_to_15) AND FIREABLE(t172_to_173))) AND (NOT FIREABLE(t160_to_161) OR (FIREABLE(t140_to_141) AND FIREABLE(t40_to_41)))) OR ((NOT FIREABLE(t125_to_126) OR NOT FIREABLE(t137_to_138)) AND (FIREABLE(t138_to_139) OR NOT FIREABLE(t14_to_15)))))) : E (F (((FIREABLE(t172_to_173) OR FIREABLE(t64_to_65)) AND FIREABLE(t8_to_9))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t128_to_129)))
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(t128_to_129)))
lola: processed formula length: 29
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-192-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(t128_to_129)
lola: state equation: Generated DNF with 2 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: state equation: write sara problem file to CircularTrains-PT-192-ReachabilityFireability-0.sara
lola: ========================================

FORMULA CircularTrains-PT-192-ReachabilityFireability-1 TRUE 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: E (F (FIREABLE(t182_to_183)))
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(t182_to_183)))
lola: processed formula length: 29
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-192-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(t182_to_183)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-192-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA CircularTrains-PT-192-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t118_to_119) AND FIREABLE(t40_to_41) AND NOT FIREABLE(t144_to_145))))
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(t118_to_119) AND FIREABLE(t40_to_41) AND NOT FIREABLE(t144_to_145))))
lola: processed formula length: 89
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-192-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(t118_to_119) AND FIREABLE(t40_to_41) AND NOT FIREABLE(t144_to_145))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA CircularTrains-PT-192-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(t172_to_173) OR FIREABLE(t64_to_65)) AND FIREABLE(t8_to_9))))
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(t172_to_173) OR FIREABLE(t64_to_65)) AND FIREABLE(t8_to_9))))
lola: processed formula length: 79
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-192-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(t172_to_173) OR FIREABLE(t64_to_65)) AND FIREABLE(t8_to_9))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA CircularTrains-PT-192-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t74_to_75) AND FIREABLE(t10_to_11) AND (FIREABLE(t192_to_1) OR FIREABLE(t132_to_133)))))
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(t74_to_75) AND FIREABLE(t10_to_11) AND (FIREABLE(t192_to_1) OR FIREABLE(t132_to_133)))))
lola: processed formula length: 105
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-192-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(t74_to_75) AND FIREABLE(t10_to_11) AND (FIREABLE(t192_to_1) OR FIREABLE(t132_to_133)))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA CircularTrains-PT-192-ReachabilityFireability-11 TRUE 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(t166_to_167) AND NOT FIREABLE(t148_to_149)) OR NOT FIREABLE(t167_to_168) OR FIREABLE(t60_to_61))))
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(t166_to_167) AND NOT FIREABLE(t148_to_149)) OR NOT FIREABLE(t167_to_168) OR FIREABLE(t60_to_61))))
lola: processed formula length: 121
lola: 2 rewrites
lola: closed formula file CircularTrains-PT-192-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(t166_to_167) OR FIREABLE(t148_to_149)) AND FIREABLE(t167_to_168) AND NOT FIREABLE(t60_to_61))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA CircularTrains-PT-192-ReachabilityFireability-13 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 ((FIREABLE(t179_to_180) OR FIREABLE(t133_to_134) OR NOT FIREABLE(t130_to_131) OR FIREABLE(t159_to_160))))
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(t179_to_180) OR FIREABLE(t133_to_134) OR NOT FIREABLE(t130_to_131) OR FIREABLE(t159_to_160))))
lola: processed formula length: 113
lola: 2 rewrites
lola: closed formula file CircularTrains-PT-192-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: no
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t179_to_180) AND NOT FIREABLE(t133_to_134) AND FIREABLE(t130_to_131) AND NOT FIREABLE(t159_to_160))
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: state equation: Generated DNF with 40 literals and 8 conjunctive subformulas
lola: ========================================

FORMULA CircularTrains-PT-192-ReachabilityFireability-5 FALSE 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(t133_to_134) OR NOT FIREABLE(t119_to_120) OR (NOT FIREABLE(t117_to_118) AND NOT FIREABLE(t148_to_149)) OR NOT FIREABLE(t184_to_185))))
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(t133_to_134) OR NOT FIREABLE(t119_to_120) OR (NOT FIREABLE(t117_to_118) AND NOT FIREABLE(t148_to_149)) OR NOT FIREABLE(t184_to_185))))
lola: processed formula length: 157
lola: 2 rewrites
lola: closed formula file CircularTrains-PT-192-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(t133_to_134) AND FIREABLE(t119_to_120) AND (FIREABLE(t117_to_118) OR FIREABLE(t148_to_149)) AND FIREABLE(t184_to_185))
lola: state equation: Generated DNF with 16 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
sara: try reading problem file CircularTrains-PT-192-ReachabilityFireability-0.sara.

FORMULA CircularTrains-PT-192-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t120_to_121) OR NOT FIREABLE(t99_to_100) OR NOT FIREABLE(t92_to_93) OR NOT FIREABLE(t72_to_73) OR FIREABLE(t128_to_129))))
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(t120_to_121) OR NOT FIREABLE(t99_to_100) OR NOT FIREABLE(t92_to_93) OR NOT FIREABLE(t72_to_73) OR FIREABLE(t128_to_129))))
lola: processed formula length: 146
lola: 2 rewrites
lola: closed formula file CircularTrains-PT-192-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(t120_to_121) AND FIREABLE(t99_to_100) AND FIREABLE(t92_to_93) AND FIREABLE(t72_to_73) AND NOT FIREABLE(t128_to_129))
lola: state equation: Generated DNF with 18 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: state equation: write sara problem file to CircularTrains-PT-192-ReachabilityFireability-8-0.sara
lola: ========================================

FORMULA CircularTrains-PT-192-ReachabilityFireability-2 FALSE 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: E (F ((FIREABLE(t146_to_147) AND ((FIREABLE(t111_to_112) AND FIREABLE(t151_to_152)) OR NOT FIREABLE(t25_to_26)) AND NOT FIREABLE(t25_to_26) AND NOT FIREABLE(t30_to_31) AND NOT FIREABLE(t129_to_130))))
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(t146_to_147) AND ((FIREABLE(t111_to_112) AND FIREABLE(t151_to_152)) OR NOT FIREABLE(t25_to_26)) AND NOT FIREABLE(t25_to_26) AND NOT FIREABLE(t30_to_31) AND NOT FIREABLE(t129_to_130))))
lola: processed formula length: 201
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-192-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(t146_to_147) AND ((FIREABLE(t111_to_112) AND FIREABLE(t151_to_152)) OR NOT FIREABLE(t25_to_26)) AND NOT FIREABLE(t25_to_26) AND NOT FIREABLE(t30_to_31) AND NOT FIREABLE(t129_to_130))
lola: state equation: Generated DNF with 168 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-192-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA CircularTrains-PT-192-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t165_to_166) AND FIREABLE(t124_to_125) AND FIREABLE(t77_to_78) AND (FIREABLE(t96_to_97) OR (NOT FIREABLE(t66_to_67) AND NOT FIREABLE(t127_to_128))))))
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(t165_to_166) AND FIREABLE(t124_to_125) AND FIREABLE(t77_to_78) AND (FIREABLE(t96_to_97) OR (NOT FIREABLE(t66_to_67) AND NOT FIREABLE(t127_to_128))))))
lola: processed formula length: 167
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-192-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(t165_to_166) AND FIREABLE(t124_to_125) AND FIREABLE(t77_to_78) AND (FIREABLE(t96_to_97) OR (NOT FIREABLE(t66_to_67) AND NOT FIREABLE(t127_to_128))))
lola: state equation: Generated DNF with 40 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: state equation: write sara problem file to CircularTrains-PT-192-ReachabilityFireability-10-0.sara
lola: ========================================

FORMULA CircularTrains-PT-192-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t81_to_82) OR NOT FIREABLE(t141_to_142)) AND NOT FIREABLE(t139_to_140)) OR ((NOT FIREABLE(t50_to_51) OR NOT FIREABLE(t167_to_168)) AND (NOT FIREABLE(t65_to_66) OR NOT FIREABLE(t84_to_85))))))
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(t81_to_82) OR NOT FIREABLE(t141_to_142)) AND NOT FIREABLE(t139_to_140)) OR ((NOT FIREABLE(t50_to_51) OR NOT FIREABLE(t167_to_168)) AND (NOT FIREABLE(t65_to_66) OR NOT FIREABLE(t84_to_85))))))
lola: processed formula length: 217
lola: 2 rewrites
lola: closed formula file CircularTrains-PT-192-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(t81_to_82) AND FIREABLE(t141_to_142)) OR FIREABLE(t139_to_140)) AND ((FIREABLE(t50_to_51) AND FIREABLE(t167_to_168)) OR (FIREABLE(t65_to_66) AND FIREABLE(t84_to_85))))
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-192-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA CircularTrains-PT-192-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 ((((NOT FIREABLE(t42_to_43) AND FIREABLE(t107_to_108)) OR FIREABLE(t151_to_152)) AND (FIREABLE(t38_to_39) OR (FIREABLE(t114_to_115) AND FIREABLE(t38_to_39)) OR ((FIREABLE(t6_to_7) OR FIREABLE(t135_to_136)) AND FIREABLE(t17_to_18))))))
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(t42_to_43) AND FIREABLE(t107_to_108)) OR FIREABLE(t151_to_152)) AND (FIREABLE(t38_to_39) OR (FIREABLE(t114_to_115) AND FIREABLE(t38_to_39)) OR ((FIREABLE(t6_to_7) OR FIREABLE(t135_to_136)) AND FIREABLE(t17_to_18))))))
lola: processed formula length: 243
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-192-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA CircularTrains-PT-192-ReachabilityFireability-7 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: A (G ((((FIREABLE(t160_to_161) OR FIREABLE(t8_to_9) OR (FIREABLE(t14_to_15) AND FIREABLE(t172_to_173))) AND (NOT FIREABLE(t160_to_161) OR (FIREABLE(t140_to_141) AND FIREABLE(t40_to_41)))) OR ((NOT FIREABLE(t125_to_126) OR NOT FIREABLE(t137_to_138)) AND (FIREABLE(t138_to_139) OR NOT FIREABLE(t14_to_15))))))
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(t160_to_161) OR FIREABLE(t8_to_9) OR (FIREABLE(t14_to_15) AND FIREABLE(t172_to_173))) AND (NOT FIREABLE(t160_to_161) OR (FIREABLE(t140_to_141) AND FIREABLE(t40_to_41)))) OR ((NOT FIREABLE(t125_to_126) OR NOT FIREABLE(t137_to_138)) AND (FIREABLE(t138_to_139) OR NOT FIREABLE(t14_to_15))))))
lola: processed formula length: 313
lola: 2 rewrites
lola: closed formula file CircularTrains-PT-192-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(t160_to_161) AND NOT FIREABLE(t8_to_9) AND (NOT FIREABLE(t14_to_15) OR NOT FIREABLE(t172_to_173))) OR (FIREABLE(t160_to_161) AND (NOT FIREABLE(t140_to_141) OR NOT FIREABLE(t40_to_41)))) AND ((FIREABLE(t125_to_126) AND FIREABLE(t137_to_138)) OR (NOT FIREABLE(t138_to_139) AND FIREABLE(t14_to_15))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: state equation: Generated DNF with 284 literals and 44 conjunctive subformulas
lola: ========================================

FORMULA CircularTrains-PT-192-ReachabilityFireability-14 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(t181_to_182) OR NOT FIREABLE(t176_to_177) OR (FIREABLE(t75_to_76) AND FIREABLE(t94_to_95)) OR (FIREABLE(t77_to_78) AND FIREABLE(t41_to_42)) OR FIREABLE(t40_to_41) OR (NOT FIREABLE(t34_to_35) AND NOT FIREABLE(t178_to_179)))))
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(t181_to_182) OR NOT FIREABLE(t176_to_177) OR (FIREABLE(t75_to_76) AND FIREABLE(t94_to_95)) OR (FIREABLE(t77_to_78) AND FIREABLE(t41_to_42)) OR FIREABLE(t40_to_41) OR (NOT FIREABLE(t34_to_35) AND NOT FIREABLE(t178_to_179)))))
lola: processed formula length: 249
lola: 2 rewrites
lola: closed formula file CircularTrains-PT-192-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(t181_to_182) AND FIREABLE(t176_to_177) AND (NOT FIREABLE(t75_to_76) OR NOT FIREABLE(t94_to_95)) AND (NOT FIREABLE(t77_to_78) OR NOT FIREABLE(t41_to_42)) AND NOT FIREABLE(t40_to_41) AND (FIREABLE(t34_to_35) OR FIREABLE(t178_to_179)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA CircularTrains-PT-192-ReachabilityFireability-0 FALSE 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: E (F ((FIREABLE(t144_to_145) AND FIREABLE(t169_to_170) AND FIREABLE(t5_to_6) AND FIREABLE(t76_to_77) AND FIREABLE(t97_to_98) AND FIREABLE(t41_to_42) AND NOT FIREABLE(t116_to_117) AND FIREABLE(t119_to_120) AND (FIREABLE(t123_to_124) OR FIREABLE(t172_to_173)) AND (FIREABLE(t120_to_121) OR FIREABLE(t150_to_151) OR (FIREABLE(t68_to_69) AND FIREABLE(t157_to_158))))))
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(t144_to_145) AND FIREABLE(t169_to_170) AND FIREABLE(t5_to_6) AND FIREABLE(t76_to_77) AND FIREABLE(t97_to_98) AND FIREABLE(t41_to_42) AND NOT FIREABLE(t116_to_117) AND FIREABLE(t119_to_120) AND (FIREABLE(t123_to_124) OR FIREABLE(t172_to_173)) AND (FIREABLE(t120_to_121) OR FIREABLE(t150_to_151) OR (FIREABLE(t68_to_69) AND FIREABLE(t157_to_158))))))
lola: processed formula length: 367
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-192-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(t144_to_145) AND FIREABLE(t169_to_170) AND FIREABLE(t5_to_6) AND FIREABLE(t76_to_77) AND FIREABLE(t97_to_98) AND FIREABLE(t41_to_42) AND NOT FIREABLE(t116_to_117) AND FIREABLE(t119_to_120) AND (FIREABLE(t123_to_124) OR FIREABLE(t172_to_173)) AND (FIREABLE(t120_to_121) OR FIREABLE(t150_to_151) OR (FIREABLE(t68_to_69) AND FIREABLE(t157_to_158))))
lola: state equation: Generated DNF with 236 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-192-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CircularTrains-PT-192-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================

FORMULA CircularTrains-PT-192-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes no no no yes yes yes yes yes yes no no yes
lola:
preliminary result: no yes no yes no no no yes yes yes yes yes yes no no yes
sara: place or transition ordering is non-deterministic
lola: memory consumption: 15092 KB
lola: time consumption: 0 seconds


BK_STOP 1526482595307

--------------------
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="CircularTrains-PT-192"
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/CircularTrains-PT-192.tgz
mv CircularTrains-PT-192 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 CircularTrains-PT-192, 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 r040-smll-152646357100035"
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 ;