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 272K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 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 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 103K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ResAllocation-PT-R003C015, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673579100357
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527006614449

info: Time: 3600 - MCC
===========================================================================================
prep: translating ResAllocation-PT-R003C015 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating ResAllocation-PT-R003C015 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ ResAllocation-PT-R003C015 @ 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: 150/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 90
lola: finding significant places
lola: 90 places, 60 transitions, 45 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 105 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C015-ReachabilityFireability.task
lola: E (F ((FIREABLE(t_8_3) AND FIREABLE(t_11_0) AND NOT FIREABLE(t_13_1) AND FIREABLE(t_14_0) AND (NOT FIREABLE(t_12_1) OR NOT FIREABLE(t_3_0)) AND NOT FIREABLE(t_0_0)))) : A (G (())) : E (F ((FIREABLE(t_2_2) AND FIREABLE(t_14_2) AND NOT FIREABLE(t_0_0)))) : A (G (())) : A (G ((NOT FIREABLE(t_3_3) OR NOT FIREABLE(t_13_0) OR (NOT FIREABLE(t_9_1) AND NOT FIREABLE(t_7_1)) OR (FIREABLE(t_3_3) AND FIREABLE(t_1_1)) OR (FIREABLE(t_3_1) AND FIREABLE(t_13_3) AND (FIREABLE(t_6_1) OR FIREABLE(t_8_0)))))) : A (G ((NOT FIREABLE(t_6_3) OR NOT FIREABLE(t_10_2)))) : E (F ((FIREABLE(t_5_2) AND FIREABLE(t_6_3) AND NOT FIREABLE(t_12_3)))) : E (F ((FIREABLE(t_14_0) AND NOT FIREABLE(t_1_3) AND FIREABLE(t_7_0) AND (FIREABLE(t_2_1) OR FIREABLE(t_2_2) OR FIREABLE(t_5_2))))) : E (F ((FIREABLE(t_11_2) AND (NOT FIREABLE(t_1_3) OR NOT FIREABLE(t_7_1)) AND FIREABLE(t_13_0)))) : A (G (())) : A (G ((NOT FIREABLE(t_4_1) OR NOT FIREABLE(t_9_2) OR (NOT FIREABLE(t_10_3) AND NOT FIREABLE(t_13_3)) OR (FIREABLE(t_2_0) AND FIREABLE(t_2_3)) OR NOT FIREABLE(t_2_1) OR NOT FIREABLE(t_7_0)))) : A (G ((NOT FIREABLE(t_5_0) OR NOT FIREABLE(t_6_3)))) : E (F (((NOT FIREABLE(t_3_3) OR NOT FIREABLE(t_1_3)) AND FIREABLE(t_7_2) AND FIREABLE(t_2_3)))) : E (F ((FIREABLE(t_9_0) AND FIREABLE(t_2_2) AND NOT FIREABLE(t_9_1)))) : A (G ((NOT FIREABLE(t_2_0) OR (FIREABLE(t_2_1) AND FIREABLE(t_3_3) AND NOT FIREABLE(t_13_1)) OR NOT FIREABLE(t_0_0) OR NOT FIREABLE(t_9_0) OR (NOT FIREABLE(t_10_0) AND NOT FIREABLE(t_8_2))))) : E (F ((NOT FIREABLE(t_8_3) AND NOT FIREABLE(t_0_1) AND FIREABLE(t_12_0) AND FIREABLE(t_6_1) AND (FIREABLE(t_1_2) OR FIREABLE(t_7_2)) AND FIREABLE(t_9_0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 9 rewrites
lola: closed formula file ResAllocation-PT-R003C015-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 9 rewrites
lola: closed formula file ResAllocation-PT-R003C015-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 9 rewrites
lola: closed formula file ResAllocation-PT-R003C015-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C015-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: A (G ((NOT FIREABLE(t_6_3) OR NOT FIREABLE(t_10_2))))
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(t_6_3) OR NOT FIREABLE(t_10_2))))
lola: processed formula length: 54
lola: 11 rewrites
lola: closed formula file ResAllocation-PT-R003C015-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(t_6_3) AND FIREABLE(t_10_2))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_5_0) OR NOT FIREABLE(t_6_3))))
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(t_5_0) OR NOT FIREABLE(t_6_3))))
lola: processed formula length: 53
lola: 11 rewrites
lola: closed formula file ResAllocation-PT-R003C015-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(t_5_0) AND FIREABLE(t_6_3))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1421521 markings, 3593694 edges, 284304 markings/sec, 0 secs
lola: sara is running 5 secs || 2885547 markings, 7052807 edges, 292805 markings/sec, 5 secs
lola: sara is running 10 secs || 4139076 markings, 10516004 edges, 250706 markings/sec, 10 secs
lola: sara is running 15 secs || 5240023 markings, 14114454 edges, 220189 markings/sec, 15 secs
lola: sara is running 20 secs || 5990164 markings, 17911913 edges, 150028 markings/sec, 20 secs
sara: warning, failure of lp_solve (at job 1889)
lola: sara is running 25 secs || 6661902 markings, 21489561 edges, 134348 markings/sec, 25 secs
lola: sara is running 30 secs || 7362520 markings, 25195065 edges, 140124 markings/sec, 30 secs
lola: sara is running 35 secs || 8011729 markings, 29016333 edges, 129842 markings/sec, 35 secs
lola: sara is running 40 secs || 8594927 markings, 32684837 edges, 116640 markings/sec, 40 secs
lola: sara is running 45 secs || 9134164 markings, 36047090 edges, 107847 markings/sec, 45 secs
lola: sara is running 50 secs || 9522542 markings, 38844597 edges, 77676 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 9523311 markings, 39154126 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_2_2) AND FIREABLE(t_14_2) AND NOT FIREABLE(t_0_0))))
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(t_2_2) AND FIREABLE(t_14_2) AND NOT FIREABLE(t_0_0))))
lola: processed formula length: 70
lola: 10 rewrites
lola: closed formula file ResAllocation-PT-R003C015-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: 6 markings, 5 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_5_2) AND FIREABLE(t_6_3) AND NOT FIREABLE(t_12_3))))
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(t_5_2) AND FIREABLE(t_6_3) AND NOT FIREABLE(t_12_3))))
lola: processed formula length: 70
lola: 10 rewrites
lola: closed formula file ResAllocation-PT-R003C015-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(t_5_2) AND FIREABLE(t_6_3) AND NOT FIREABLE(t_12_3))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-ReachabilityFireability-6-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 ResAllocation-PT-R003C015-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_9_0) AND FIREABLE(t_2_2) AND NOT FIREABLE(t_9_1))))
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(t_9_0) AND FIREABLE(t_2_2) AND NOT FIREABLE(t_9_1))))
lola: processed formula length: 69
lola: 10 rewrites
lola: closed formula file ResAllocation-PT-R003C015-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(t_9_0) AND FIREABLE(t_2_2) AND NOT FIREABLE(t_9_1))
lola: state equation: Generated DNF with 15 literals and 3 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 ResAllocation-PT-R003C015-ReachabilityFireability-7-0.sara
lola: ========================================

FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t_3_3) OR NOT FIREABLE(t_1_3)) AND FIREABLE(t_7_2) AND FIREABLE(t_2_3))))
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(t_3_3) OR NOT FIREABLE(t_1_3)) AND FIREABLE(t_7_2) AND FIREABLE(t_2_3))))
lola: processed formula length: 95
lola: 10 rewrites
lola: closed formula file ResAllocation-PT-R003C015-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(t_3_3) OR NOT FIREABLE(t_1_3)) AND FIREABLE(t_7_2) AND FIREABLE(t_2_3))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-ReachabilityFireability-8-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 ResAllocation-PT-R003C015-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 502 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_11_2) AND (NOT FIREABLE(t_1_3) OR NOT FIREABLE(t_7_1)) AND FIREABLE(t_13_0))))
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(t_11_2) AND (NOT FIREABLE(t_1_3) OR NOT FIREABLE(t_7_1)) AND FIREABLE(t_13_0))))
lola: processed formula length: 97
lola: 10 rewrites
lola: closed formula file ResAllocation-PT-R003C015-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(t_11_2) AND (NOT FIREABLE(t_1_3) OR NOT FIREABLE(t_7_1)) AND FIREABLE(t_13_0))
lola: state equation: Generated DNF with 25 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-9-0.sara
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 585 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_14_0) AND NOT FIREABLE(t_1_3) AND FIREABLE(t_7_0) AND (FIREABLE(t_2_1) OR FIREABLE(t_2_2) OR FIREABLE(t_5_2)))))
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(t_14_0) AND NOT FIREABLE(t_1_3) AND FIREABLE(t_7_0) AND (FIREABLE(t_2_1) OR FIREABLE(t_2_2) OR FIREABLE(t_5_2)))))
lola: processed formula length: 132
lola: 10 rewrites
lola: closed formula file ResAllocation-PT-R003C015-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(t_14_0) AND NOT FIREABLE(t_1_3) AND FIREABLE(t_7_0) AND (FIREABLE(t_2_1) OR FIREABLE(t_2_2) OR FIREABLE(t_5_2)))
lola: state equation: Generated DNF with 35 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: ========================================

FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file ResAllocation-PT-R003C015-ReachabilityFireability-9-0.sara.
lola: subprocess 11 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_8_3) AND FIREABLE(t_11_0) AND NOT FIREABLE(t_13_1) AND FIREABLE(t_14_0) AND (NOT FIREABLE(t_12_1) OR NOT FIREABLE(t_3_0)) AND NOT FIREABLE(t_0_0))))
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(t_8_3) AND FIREABLE(t_11_0) AND NOT FIREABLE(t_13_1) AND FIREABLE(t_14_0) AND (NOT FIREABLE(t_12_1) OR NOT FIREABLE(t_3_0)) AND NOT FIREABLE(t_0_0))))
lola: processed formula length: 167
lola: 10 rewrites
lola: closed formula file ResAllocation-PT-R003C015-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: 8 markings, 7 edges
lola: formula 0: (FIREABLE(t_8_3) AND FIREABLE(t_11_0) AND NOT FIREABLE(t_13_1) AND FIREABLE(t_14_0) AND (NOT FIREABLE(t_12_1) OR NOT FIREABLE(t_3_0)) AND NOT FIREABLE(t_0_0))

FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 878 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t_8_3) AND NOT FIREABLE(t_0_1) AND FIREABLE(t_12_0) AND FIREABLE(t_6_1) AND (FIREABLE(t_1_2) OR FIREABLE(t_7_2)) AND FIREABLE(t_9_0))))
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(t_8_3) AND NOT FIREABLE(t_0_1) AND FIREABLE(t_12_0) AND FIREABLE(t_6_1) AND (FIREABLE(t_1_2) OR FIREABLE(t_7_2)) AND FIREABLE(t_9_0))))
lola: processed formula length: 156
lola: 10 rewrites
lola: closed formula file ResAllocation-PT-R003C015-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(t_8_3) AND NOT FIREABLE(t_0_1) AND FIREABLE(t_12_0) AND FIREABLE(t_6_1) AND (FIREABLE(t_1_2) OR FIREABLE(t_7_2)) AND FIREABLE(t_9_0))
lola: state equation: Generated DNF with 33 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola:
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-12-0.sara
lola: ========================================
lola: subprocess 13 will run for 1171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_2_0) OR (FIREABLE(t_2_1) AND FIREABLE(t_3_3) AND NOT FIREABLE(t_13_1)) OR NOT FIREABLE(t_0_0) OR NOT FIREABLE(t_9_0) OR (NOT FIREABLE(t_10_0) AND NOT FIREABLE(t_8_2)))))
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(t_2_0) OR (FIREABLE(t_2_1) AND FIREABLE(t_3_3) AND NOT FIREABLE(t_13_1)) OR NOT FIREABLE(t_0_0) OR NOT FIREABLE(t_9_0) OR (NOT FIREABLE(t_10_0) AND NOT FIREABLE(t_8_2)))))
lola: processed formula length: 195
lola: 11 rewrites
lola: closed formula file ResAllocation-PT-R003C015-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(t_2_0) AND (NOT FIREABLE(t_2_1) OR NOT FIREABLE(t_3_3) OR FIREABLE(t_13_1)) AND FIREABLE(t_0_0) AND FIREABLE(t_9_0) AND (FIREABLE(t_10_0) OR FIREABLE(t_8_2)))
lola: state equation: Generated DNF with 94 literals and 12 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-ReachabilityFireability-13-0.sara.

sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 181)
lola: sara is running 0 secs || 1212566 markings, 3783104 edges, 242513 markings/sec, 0 secs
lola: sara is running 5 secs || 2162094 markings, 7519088 edges, 189906 markings/sec, 5 secs
sara: warning: empty constraint in comparison
lola: sara is running 10 secs || 3249801 markings, 11229118 edges, 217541 markings/sec, 10 secs
lola: sara is running 15 secs || 4270541 markings, 14892283 edges, 204148 markings/sec, 15 secs
lola: sara is running 20 secs || 5109136 markings, 18657938 edges, 167719 markings/sec, 20 secs
lola: sara is running 25 secs || 5796191 markings, 22371777 edges, 137411 markings/sec, 25 secs
lola: sara is running 30 secs || 6562995 markings, 26055095 edges, 153361 markings/sec, 30 secs
lola: sara is running 35 secs || 7327367 markings, 29591347 edges, 152874 markings/sec, 35 secs
lola: sara is running 40 secs || 8053796 markings, 33266670 edges, 145286 markings/sec, 40 secs
lola: sara is running 45 secs || 8804150 markings, 37065988 edges, 150071 markings/sec, 45 secs
lola: sara is running 50 secs || 9455327 markings, 40695100 edges, 130235 markings/sec, 50 secs
lola: sara is running 55 secs || 10119912 markings, 44224971 edges, 132917 markings/sec, 55 secs
lola: sara is running 60 secs || 10574372 markings, 47007909 edges, 90892 markings/sec, 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 10588839 markings, 47670672 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1724 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_4_1) OR NOT FIREABLE(t_9_2) OR (NOT FIREABLE(t_10_3) AND NOT FIREABLE(t_13_3)) OR (FIREABLE(t_2_0) AND FIREABLE(t_2_3)) OR NOT FIREABLE(t_2_1) OR NOT FIREABLE(t_7_0))))
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(t_4_1) OR NOT FIREABLE(t_9_2) OR (NOT FIREABLE(t_10_3) AND NOT FIREABLE(t_13_3)) OR (FIREABLE(t_2_0) AND FIREABLE(t_2_3)) OR NOT FIREABLE(t_2_1) OR NOT FIREABLE(t_7_0))))
lola: processed formula length: 195
lola: 11 rewrites
lola: closed formula file ResAllocation-PT-R003C015-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(t_4_1) AND FIREABLE(t_9_2) AND (FIREABLE(t_10_3) OR FIREABLE(t_13_3)) AND (NOT FIREABLE(t_2_0) OR NOT FIREABLE(t_2_3)) AND FIREABLE(t_2_1) AND FIREABLE(t_7_0))
lola: state equation: Generated DNF with 75 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3449 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_3_3) OR NOT FIREABLE(t_13_0) OR (NOT FIREABLE(t_9_1) AND NOT FIREABLE(t_7_1)) OR (FIREABLE(t_3_3) AND FIREABLE(t_1_1)) OR (FIREABLE(t_3_1) AND FIREABLE(t_13_3) AND (FIREABLE(t_6_1) OR FIREABLE(t_8_0))))))
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(t_3_3) OR NOT FIREABLE(t_13_0) OR (NOT FIREABLE(t_9_1) AND NOT FIREABLE(t_7_1)) OR (FIREABLE(t_3_3) AND FIREABLE(t_1_1)) OR (FIREABLE(t_3_1) AND FIREABLE(t_13_3) AND (FIREABLE(t_6_1) OR FIREABLE(t_8_0))))))
lola: processed formula length: 231
lola: 11 rewrites
lola: closed formula file ResAllocation-PT-R003C015-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(t_3_3) AND FIREABLE(t_13_0) AND (FIREABLE(t_9_1) OR FIREABLE(t_7_1)) AND (NOT FIREABLE(t_3_3) OR NOT FIREABLE(t_1_1)) AND (NOT FIREABLE(t_3_1) OR NOT FIREABLE(t_13_3) OR (NOT FIREABLE(t_6_1) AND NOT FIREABLE(t_8_0))))
lola: state equation: Generated DNF with 402 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no yes yes yes no yes yes yes yes yes
lola:
preliminary result: yes yes yes yes no no no yes yes yes no yes yes yes yes yes
lola: memory consumption: 14692 KB
lola: time consumption: 122 seconds

BK_STOP 1527006757150

--------------------
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="ResAllocation-PT-R003C015"
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/ResAllocation-PT-R003C015.tgz
mv ResAllocation-PT-R003C015 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 ResAllocation-PT-R003C015, 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-152673579100357"
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 ;