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 204K
-rw-r--r-- 1 mcc users 3.2K 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.7K 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: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.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 37K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is CircularTrains-PT-048, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-smll-152646357100021
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526475612182

info: Time: 3600 - MCC
===========================================================================================
prep: translating CircularTrains-PT-048 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating CircularTrains-PT-048 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ CircularTrains-PT-048 @ 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: 144/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3072
lola: finding significant places
lola: 96 places, 48 transitions, 47 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 96 transition conflict sets
lola: TASK
lola: reading formula from CircularTrains-PT-048-ReachabilityFireability.task
lola: E (F ((FIREABLE(t11_to_12) OR ((NOT FIREABLE(t19_to_20) OR (FIREABLE(t26_to_27) AND FIREABLE(t37_to_38))) AND FIREABLE(t32_to_33))))) : E (F ((FIREABLE(t23_to_24) AND FIREABLE(t47_to_48)))) : E (F (((FIREABLE(t20_to_21) OR NOT FIREABLE(t40_to_41)) AND FIREABLE(t14_to_15) AND (FIREABLE(t10_to_11) OR FIREABLE(t31_to_32))))) : E (F ((NOT FIREABLE(t26_to_27) AND (FIREABLE(t5_to_6) OR FIREABLE(t6_to_7)) AND FIREABLE(t36_to_37) AND FIREABLE(t44_to_45) AND NOT FIREABLE(t23_to_24) AND FIREABLE(t11_to_12)))) : E (F ((FIREABLE(t20_to_21) AND NOT FIREABLE(t23_to_24) AND (NOT FIREABLE(t20_to_21) OR NOT FIREABLE(t43_to_44)) AND FIREABLE(t21_to_22)))) : E (F ((FIREABLE(t11_to_12) AND FIREABLE(t31_to_32) AND (FIREABLE(t41_to_42) OR FIREABLE(t32_to_33)) AND ((FIREABLE(t38_to_39) AND FIREABLE(t48_to_1)) OR NOT FIREABLE(t46_to_47)) AND NOT FIREABLE(t26_to_27)))) : E (F ((((FIREABLE(t15_to_16) AND FIREABLE(t35_to_36)) OR (FIREABLE(t45_to_46) AND FIREABLE(t33_to_34) AND (FIREABLE(t10_to_11) OR FIREABLE(t24_to_25)))) AND FIREABLE(t46_to_47)))) : E (F ((FIREABLE(t23_to_24) AND FIREABLE(t30_to_31) AND (FIREABLE(t9_to_10) OR FIREABLE(t43_to_44)) AND (NOT FIREABLE(t10_to_11) OR NOT FIREABLE(t5_to_6)) AND (FIREABLE(t30_to_31) OR (NOT FIREABLE(t36_to_37) AND NOT FIREABLE(t16_to_17)))))) : A (G ((NOT FIREABLE(t14_to_15) OR NOT FIREABLE(t20_to_21)))) : E (F ((FIREABLE(t20_to_21) AND FIREABLE(t14_to_15)))) : E (F ((FIREABLE(t32_to_33) AND FIREABLE(t20_to_21)))) : E (F (((FIREABLE(t18_to_19) AND FIREABLE(t47_to_48)) OR ((NOT FIREABLE(t13_to_14) OR NOT FIREABLE(t8_to_9)) AND FIREABLE(t23_to_24))))) : A (G ((NOT FIREABLE(t25_to_26) OR NOT FIREABLE(t26_to_27) OR NOT FIREABLE(t11_to_12) OR FIREABLE(t37_to_38)))) : E (F (FIREABLE(t5_to_6))) : E (F (FIREABLE(t5_to_6))) : E (F ((FIREABLE(t11_to_12) AND FIREABLE(t44_to_45) AND FIREABLE(t36_to_37) AND FIREABLE(t13_to_14) AND NOT FIREABLE(t12_to_13) AND NOT FIREABLE(t40_to_41))))
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(t5_to_6)))
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(t5_to_6)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-048-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(t5_to_6)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to CircularTrains-PT-048-ReachabilityFireability-0.sara
lola: The predicate is reachable.
lola: 5 markings, 4 edges

FORMULA CircularTrains-PT-048-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t5_to_6)))
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(t5_to_6)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-048-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(t5_to_6)
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-048-ReachabilityFireability-0.sara

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

FORMULA CircularTrains-PT-048-ReachabilityFireability-9 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(t32_to_33) AND FIREABLE(t20_to_21))))
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(t32_to_33) AND FIREABLE(t20_to_21))))
lola: processed formula length: 53
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-048-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(t32_to_33) AND FIREABLE(t20_to_21))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA CircularTrains-PT-048-ReachabilityFireability-10 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(t23_to_24) AND FIREABLE(t47_to_48))))
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(t23_to_24) AND FIREABLE(t47_to_48))))
lola: processed formula length: 53
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-048-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(t23_to_24) AND FIREABLE(t47_to_48))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA CircularTrains-PT-048-ReachabilityFireability-1 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(t14_to_15) OR NOT FIREABLE(t20_to_21))))
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(t14_to_15) OR NOT FIREABLE(t20_to_21))))
lola: processed formula length: 61
lola: 2 rewrites
lola: closed formula file CircularTrains-PT-048-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(t14_to_15) AND FIREABLE(t20_to_21))
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 4 literals and 1 conjunctive subformulas
lola: ========================================

FORMULA CircularTrains-PT-048-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t20_to_21) AND NOT FIREABLE(t23_to_24) AND (NOT FIREABLE(t20_to_21) OR NOT FIREABLE(t43_to_44)) AND FIREABLE(t21_to_22))))
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(t20_to_21) AND NOT FIREABLE(t23_to_24) AND (NOT FIREABLE(t20_to_21) OR NOT FIREABLE(t43_to_44)) AND FIREABLE(t21_to_22))))
lola: processed formula length: 139
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-048-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(t20_to_21) AND NOT FIREABLE(t23_to_24) AND (NOT FIREABLE(t20_to_21) OR NOT FIREABLE(t43_to_44)) AND FIREABLE(t21_to_22))
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 209 markings, 209 edges
lola: ========================================

FORMULA CircularTrains-PT-048-ReachabilityFireability-4 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(t25_to_26) OR NOT FIREABLE(t26_to_27) OR NOT FIREABLE(t11_to_12) OR FIREABLE(t37_to_38))))
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_to_26) OR NOT FIREABLE(t26_to_27) OR NOT FIREABLE(t11_to_12) OR FIREABLE(t37_to_38))))
lola: processed formula length: 113
lola: 2 rewrites
lola: closed formula file CircularTrains-PT-048-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_to_26) AND FIREABLE(t26_to_27) AND FIREABLE(t11_to_12) AND NOT FIREABLE(t37_to_38))
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
sara: try reading problem file CircularTrains-PT-048-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 197 markings, 197 edges
lola: ========================================

FORMULA CircularTrains-PT-048-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file CircularTrains-PT-048-ReachabilityFireability-0.sara.
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t11_to_12) OR ((NOT FIREABLE(t19_to_20) OR (FIREABLE(t26_to_27) AND FIREABLE(t37_to_38))) AND FIREABLE(t32_to_33)))))
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(t11_to_12) OR ((NOT FIREABLE(t19_to_20) OR (FIREABLE(t26_to_27) AND FIREABLE(t37_to_38))) AND FIREABLE(t32_to_33)))))
lola: processed formula length: 135
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-048-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA CircularTrains-PT-048-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t20_to_21) OR NOT FIREABLE(t40_to_41)) AND FIREABLE(t14_to_15) AND (FIREABLE(t10_to_11) OR FIREABLE(t31_to_32)))))
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(t20_to_21) OR NOT FIREABLE(t40_to_41)) AND FIREABLE(t14_to_15) AND (FIREABLE(t10_to_11) OR FIREABLE(t31_to_32)))))
lola: processed formula length: 133
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-048-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: 6 markings, 5 edges
lola: ========================================

FORMULA CircularTrains-PT-048-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t18_to_19) AND FIREABLE(t47_to_48)) OR ((NOT FIREABLE(t13_to_14) OR NOT FIREABLE(t8_to_9)) AND FIREABLE(t23_to_24)))))
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(t18_to_19) AND FIREABLE(t47_to_48)) OR ((NOT FIREABLE(t13_to_14) OR NOT FIREABLE(t8_to_9)) AND FIREABLE(t23_to_24)))))
lola: processed formula length: 137
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-048-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(t18_to_19) AND FIREABLE(t47_to_48)) OR ((NOT FIREABLE(t13_to_14) OR NOT FIREABLE(t8_to_9)) AND FIREABLE(t23_to_24)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 16 literals and 5 conjunctive subformulas
lola: 5 markings, 4 edges
lola: ========================================

FORMULA CircularTrains-PT-048-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t11_to_12) AND FIREABLE(t44_to_45) AND FIREABLE(t36_to_37) AND FIREABLE(t13_to_14) AND NOT FIREABLE(t12_to_13) AND NOT FIREABLE(t40_to_41))))
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(t11_to_12) AND FIREABLE(t44_to_45) AND FIREABLE(t36_to_37) AND FIREABLE(t13_to_14) AND NOT FIREABLE(t12_to_13) AND NOT FIREABLE(t40_to_41))))
lola: processed formula length: 157
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-048-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(t11_to_12) AND FIREABLE(t44_to_45) AND FIREABLE(t36_to_37) AND FIREABLE(t13_to_14) AND NOT FIREABLE(t12_to_13) AND NOT FIREABLE(t40_to_41))
lola: state equation: Generated DNF with 40 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-048-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara

sara: try reading problem file CircularTrains-PT-048-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 175 markings, 175 edges
lola: ========================================

FORMULA CircularTrains-PT-048-ReachabilityFireability-15 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(t26_to_27) AND (FIREABLE(t5_to_6) OR FIREABLE(t6_to_7)) AND FIREABLE(t36_to_37) AND FIREABLE(t44_to_45) AND NOT FIREABLE(t23_to_24) AND FIREABLE(t11_to_12))))
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(t26_to_27) AND (FIREABLE(t5_to_6) OR FIREABLE(t6_to_7)) AND FIREABLE(t36_to_37) AND FIREABLE(t44_to_45) AND NOT FIREABLE(t23_to_24) AND FIREABLE(t11_to_12))))
lola: processed formula length: 179
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-048-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(t26_to_27) AND (FIREABLE(t5_to_6) OR FIREABLE(t6_to_7)) AND FIREABLE(t36_to_37) AND FIREABLE(t44_to_45) AND NOT FIREABLE(t23_to_24) AND FIREABLE(t11_to_12))
lola: state equation: Generated DNF with 80 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
sara: place or transition ordering is non-deterministic

lola: state equation: write sara problem file to CircularTrains-PT-048-ReachabilityFireability-12-0.sara
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA CircularTrains-PT-048-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t15_to_16) AND FIREABLE(t35_to_36)) OR (FIREABLE(t45_to_46) AND FIREABLE(t33_to_34) AND (FIREABLE(t10_to_11) OR FIREABLE(t24_to_25)))) AND FIREABLE(t46_to_47))))
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(t15_to_16) AND FIREABLE(t35_to_36)) OR (FIREABLE(t45_to_46) AND FIREABLE(t33_to_34) AND (FIREABLE(t10_to_11) OR FIREABLE(t24_to_25)))) AND FIREABLE(t46_to_47))))
lola: processed formula length: 181
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-048-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(t15_to_16) AND FIREABLE(t35_to_36)) OR (FIREABLE(t45_to_46) AND FIREABLE(t33_to_34) AND (FIREABLE(t10_to_11) OR FIREABLE(t24_to_25)))) AND FIREABLE(t46_to_47))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: state equation: Generated DNF with 22 literals and 3 conjunctive subformulas
lola: ========================================

FORMULA CircularTrains-PT-048-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t11_to_12) AND FIREABLE(t31_to_32) AND (FIREABLE(t41_to_42) OR FIREABLE(t32_to_33)) AND ((FIREABLE(t38_to_39) AND FIREABLE(t48_to_1)) OR NOT FIREABLE(t46_to_47)) AND NOT FIREABLE(t26_to_27))))
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(t11_to_12) AND FIREABLE(t31_to_32) AND (FIREABLE(t41_to_42) OR FIREABLE(t32_to_33)) AND ((FIREABLE(t38_to_39) AND FIREABLE(t48_to_1)) OR NOT FIREABLE(t46_to_47)) AND NOT FIREABLE(t26_to_27))))
lola: processed formula length: 210
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-048-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(t11_to_12) AND FIREABLE(t31_to_32) AND (FIREABLE(t41_to_42) OR FIREABLE(t32_to_33)) AND ((FIREABLE(t38_to_39) AND FIREABLE(t48_to_1)) OR NOT FIREABLE(t46_to_47)) AND NOT FIREABLE(t26_to_27))
lola: state equation: Generated DNF with 108 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA CircularTrains-PT-048-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t23_to_24) AND FIREABLE(t30_to_31) AND (FIREABLE(t9_to_10) OR FIREABLE(t43_to_44)) AND (NOT FIREABLE(t10_to_11) OR NOT FIREABLE(t5_to_6)) AND (FIREABLE(t30_to_31) OR (NOT FIREABLE(t36_to_37) AND NOT FIREABLE(t16_to_17))))))
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(t23_to_24) AND FIREABLE(t30_to_31) AND (FIREABLE(t9_to_10) OR FIREABLE(t43_to_44)) AND (NOT FIREABLE(t10_to_11) OR NOT FIREABLE(t5_to_6)) AND (FIREABLE(t30_to_31) OR (NOT FIREABLE(t36_to_37) AND NOT FIREABLE(t16_to_17))))))
lola: processed formula length: 242
lola: 1 rewrites
lola: closed formula file CircularTrains-PT-048-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(t23_to_24) AND FIREABLE(t30_to_31) AND (FIREABLE(t9_to_10) OR FIREABLE(t43_to_44)) AND (NOT FIREABLE(t10_to_11) OR NOT FIREABLE(t5_to_6)) AND (FIREABLE(t30_to_31) OR (NOT FIREABLE(t36_to_37) AND NOT FIREABLE(t16_to_17))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA CircularTrains-PT-048-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes yes yes no yes yes yes yes yes yes no
lola:
preliminary result: yes yes yes yes no yes yes yes no yes yes yes yes yes yes no
lola: memory consumption: 14568 KB
lola: time consumption: 0 seconds

BK_STOP 1526475612568

--------------------
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-048"
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-048.tgz
mv CircularTrains-PT-048 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-048, 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-152646357100021"
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 ;