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 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K 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 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 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 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 33K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Angiogenesis-PT-25, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-qhx1-152646241100042
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526632417247

info: Time: 3600 - MCC
===========================================================================================
prep: translating Angiogenesis-PT-25 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Angiogenesis-PT-25 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Angiogenesis-PT-25 @ 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: 103/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 64 transitions, 31 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 54 transition conflict sets
lola: TASK
lola: reading formula from Angiogenesis-PT-25-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(k23) OR (FIREABLE(k16) AND FIREABLE(k61))))) : E (F ((FIREABLE(k42) AND FIREABLE(k39) AND NOT FIREABLE(k3) AND NOT FIREABLE(k56) AND ((NOT FIREABLE(k8) AND NOT FIREABLE(k41)) OR FIREABLE(k10))))) : E (F (((FIREABLE(k28) OR FIREABLE(k18)) AND FIREABLE(k25) AND FIREABLE(k52) AND FIREABLE(k17)))) : E (F ((FIREABLE(k51) AND FIREABLE(k21) AND NOT FIREABLE(k3)))) : E (F (FIREABLE(k47))) : E (F (())) : E (F (((FIREABLE(k11) OR FIREABLE(k15)) AND FIREABLE(k39) AND NOT FIREABLE(k52) AND (FIREABLE(t1) OR FIREABLE(k29) OR (FIREABLE(k31) AND (FIREABLE(k38) OR FIREABLE(k47))))))) : E (F (((NOT FIREABLE(k50) AND NOT FIREABLE(k56) AND FIREABLE(k30)) OR FIREABLE(k48)))) : A (G (FIREABLE(t0))) : A (G (NOT FIREABLE(k48))) : A (G ((NOT FIREABLE(k20) OR NOT FIREABLE(k43) OR FIREABLE(k25) OR FIREABLE(t1) OR NOT FIREABLE(k42) OR FIREABLE(k58)))) : A (G ((NOT FIREABLE(k3) OR FIREABLE(k20) OR FIREABLE(k53) OR FIREABLE(k37) OR (FIREABLE(k34) AND FIREABLE(k12)) OR (FIREABLE(k48) AND FIREABLE(k36)) OR (FIREABLE(k34) AND FIREABLE(k53))))) : E (F (FIREABLE(k46))) : E (F (((FIREABLE(k63) OR FIREABLE(k54)) AND (FIREABLE(k36) OR FIREABLE(k27)) AND (FIREABLE(k13) OR NOT FIREABLE(k35)) AND (FIREABLE(k33) OR FIREABLE(t1) OR (FIREABLE(k11) AND FIREABLE(k18)) OR (FIREABLE(k62) AND NOT FIREABLE(t1)))))) : E (F (FIREABLE(k14))) : A (G ((NOT FIREABLE(k47) OR NOT FIREABLE(k15) OR NOT FIREABLE(k40) OR NOT FIREABLE(k30) OR FIREABLE(k36) OR FIREABLE(t0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: closed formula file Angiogenesis-PT-25-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

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

FORMULA Angiogenesis-PT-25-ReachabilityFireability-4 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: A (G (FIREABLE(t0)))
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(t0)))
lola: processed formula length: 20
lola: 5 rewrites
lola: closed formula file Angiogenesis-PT-25-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(t0)
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 25 edges
lola: ========================================

FORMULA Angiogenesis-PT-25-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(k48)))
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(k48)))
lola: processed formula length: 25
lola: 5 rewrites
lola: closed formula file Angiogenesis-PT-25-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(k48)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: state equation: write sara problem file to Angiogenesis-PT-25-ReachabilityFireability-3-0.sara

FORMULA Angiogenesis-PT-25-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(k46)))
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(k46)))
lola: processed formula length: 21
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-25-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(k46)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-25-ReachabilityFireability-4-0.sara
sara: try reading problem file Angiogenesis-PT-25-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA Angiogenesis-PT-25-ReachabilityFireability-12 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: E (F (FIREABLE(k14)))
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(k14)))
lola: processed formula length: 21
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-25-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(k14)
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: 11 markings, 10 edges
lola: state equation: write sara problem file to Angiogenesis-PT-25-ReachabilityFireability-5-0.sara

FORMULA Angiogenesis-PT-25-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(k23) OR (FIREABLE(k16) AND FIREABLE(k61)))))
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(k23) OR (FIREABLE(k16) AND FIREABLE(k61)))))
lola: processed formula length: 65
lola: 5 rewrites
lola: closed formula file Angiogenesis-PT-25-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(k23) AND (NOT FIREABLE(k16) OR NOT FIREABLE(k61)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA Angiogenesis-PT-25-ReachabilityFireability-0 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: E (F ((FIREABLE(k51) AND FIREABLE(k21) AND NOT FIREABLE(k3))))
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(k51) AND FIREABLE(k21) AND NOT FIREABLE(k3))))
lola: processed formula length: 62
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-25-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(k51) AND FIREABLE(k21) AND NOT FIREABLE(k3))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-25-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA Angiogenesis-PT-25-ReachabilityFireability-3 TRUE 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: E (F (((NOT FIREABLE(k50) AND NOT FIREABLE(k56) AND FIREABLE(k30)) OR FIREABLE(k48))))
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(k50) AND NOT FIREABLE(k56) AND FIREABLE(k30)) OR FIREABLE(k48))))
lola: processed formula length: 87
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-25-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(k50) AND NOT FIREABLE(k56) AND FIREABLE(k30)) OR FIREABLE(k48))
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-25-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 50 markings, 63 edges
lola: ========================================

FORMULA Angiogenesis-PT-25-ReachabilityFireability-7 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(k28) OR FIREABLE(k18)) AND FIREABLE(k25) AND FIREABLE(k52) AND FIREABLE(k17))))
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(k28) OR FIREABLE(k18)) AND FIREABLE(k25) AND FIREABLE(k52) AND FIREABLE(k17))))
lola: processed formula length: 97
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-25-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(k28) OR FIREABLE(k18)) AND FIREABLE(k25) AND FIREABLE(k52) AND FIREABLE(k17))
lola: state equation: Generated DNF with 11 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-25-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1841 markings, 3117 edges
lola: ========================================

FORMULA Angiogenesis-PT-25-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(k20) OR NOT FIREABLE(k43) OR FIREABLE(k25) OR FIREABLE(t1) OR NOT FIREABLE(k42) OR FIREABLE(k58))))
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(k20) OR NOT FIREABLE(k43) OR FIREABLE(k25) OR FIREABLE(t1) OR NOT FIREABLE(k42) OR FIREABLE(k58))))
lola: processed formula length: 124
lola: 5 rewrites
lola: closed formula file Angiogenesis-PT-25-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(k20) AND FIREABLE(k43) AND NOT FIREABLE(k25) AND NOT FIREABLE(t1) AND FIREABLE(k42) AND NOT FIREABLE(k58))
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: state equation: write sara problem file to Angiogenesis-PT-25-ReachabilityFireability-10-0.sara

FORMULA Angiogenesis-PT-25-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(k47) OR NOT FIREABLE(k15) OR NOT FIREABLE(k40) OR NOT FIREABLE(k30) OR FIREABLE(k36) OR FIREABLE(t0))))
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(k47) OR NOT FIREABLE(k15) OR NOT FIREABLE(k40) OR NOT FIREABLE(k30) OR FIREABLE(k36) OR FIREABLE(t0))))
lola: processed formula length: 128
lola: 5 rewrites
lola: closed formula file Angiogenesis-PT-25-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(k47) AND FIREABLE(k15) AND FIREABLE(k40) AND FIREABLE(k30) AND NOT FIREABLE(k36) AND NOT FIREABLE(t0))
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-25-ReachabilityFireability-11-0.sara
sara: try reading problem file Angiogenesis-PT-25-ReachabilityFireability-10-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-25-ReachabilityFireability-11-0.sara.

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4671 markings, 8038 edges
lola: ========================================

FORMULA Angiogenesis-PT-25-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 ((FIREABLE(k42) AND FIREABLE(k39) AND NOT FIREABLE(k3) AND NOT FIREABLE(k56) AND ((NOT FIREABLE(k8) AND NOT FIREABLE(k41)) OR FIREABLE(k10)))))
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(k42) AND FIREABLE(k39) AND NOT FIREABLE(k3) AND NOT FIREABLE(k56) AND ((NOT FIREABLE(k8) AND NOT FIREABLE(k41)) OR FIREABLE(k10)))))
lola: processed formula length: 149
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-25-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(k42) AND FIREABLE(k39) AND NOT FIREABLE(k3) AND NOT FIREABLE(k56) AND ((NOT FIREABLE(k8) AND NOT FIREABLE(k41)) OR FIREABLE(k10)))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-25-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-25-ReachabilityFireability-12-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA Angiogenesis-PT-25-ReachabilityFireability-1 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: A (G ((NOT FIREABLE(k3) OR FIREABLE(k20) OR FIREABLE(k53) OR FIREABLE(k37) OR (FIREABLE(k34) AND FIREABLE(k12)) OR (FIREABLE(k48) AND FIREABLE(k36)) OR (FIREABLE(k34) AND FIREABLE(k53)))))
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(k3) OR FIREABLE(k20) OR FIREABLE(k53) OR FIREABLE(k37) OR (FIREABLE(k34) AND FIREABLE(k12)) OR (FIREABLE(k48) AND FIREABLE(k36)) OR (FIREABLE(k34) AND FIREABLE(k53)))))
lola: processed formula length: 194
lola: 5 rewrites
lola: closed formula file Angiogenesis-PT-25-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(k3) AND NOT FIREABLE(k20) AND NOT FIREABLE(k53) AND NOT FIREABLE(k37) AND (NOT FIREABLE(k34) OR NOT FIREABLE(k12)) AND (NOT FIREABLE(k48) OR NOT FIREABLE(k36)) AND (NOT FIREABLE(k34) OR NOT FIREABLE(k53)))
lola: state equation: Generated DNF with 384 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-25-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-25-ReachabilityFireability-13-0.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.

FORMULA Angiogenesis-PT-25-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(k11) OR FIREABLE(k15)) AND FIREABLE(k39) AND NOT FIREABLE(k52) AND (FIREABLE(t1) OR FIREABLE(k29) OR (FIREABLE(k31) AND (FIREABLE(k38) OR FIREABLE(k47)))))))
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(k11) OR FIREABLE(k15)) AND FIREABLE(k39) AND NOT FIREABLE(k52) AND (FIREABLE(t1) OR FIREABLE(k29) OR (FIREABLE(k31) AND (FIREABLE(k38) OR FIREABLE(k47)))))))
lola: processed formula length: 178
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-25-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(k11) OR FIREABLE(k15)) AND FIREABLE(k39) AND NOT FIREABLE(k52) AND (FIREABLE(t1) OR FIREABLE(k29) OR (FIREABLE(k31) AND (FIREABLE(k38) OR FIREABLE(k47)))))
lola: state equation: Generated DNF with 40 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: state equation: write sara problem file to Angiogenesis-PT-25-ReachabilityFireability-14-0.sara
FORMULA Angiogenesis-PT-25-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(k63) OR FIREABLE(k54)) AND (FIREABLE(k36) OR FIREABLE(k27)) AND (FIREABLE(k13) OR NOT FIREABLE(k35)) AND (FIREABLE(k33) OR FIREABLE(t1) OR (FIREABLE(k11) AND FIREABLE(k18)) OR (FIREABLE(k62) AND NOT FIREABLE(t1))))))
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(k63) OR FIREABLE(k54)) AND (FIREABLE(k36) OR FIREABLE(k27)) AND (FIREABLE(k13) OR NOT FIREABLE(k35)) AND (FIREABLE(k33) OR FIREABLE(t1) OR (FIREABLE(k11) AND FIREABLE(k18)) OR (FIREABLE(k62) AND NOT FIREABLE(t1))))))
lola: processed formula length: 239
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-25-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(k63) OR FIREABLE(k54)) AND (FIREABLE(k36) OR FIREABLE(k27)) AND (FIREABLE(k13) OR NOT FIREABLE(k35)) AND (FIREABLE(k33) OR FIREABLE(t1) OR (FIREABLE(k11) AND FIREABLE(k18)) OR (FIREABLE(k62) AND NOT FIREABLE(t1))))
lola: state equation: Generated DNF with 108 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-25-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 287 markings, 404 edges

FORMULA Angiogenesis-PT-25-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no yes yes no no no yes yes yes yes no
lola:
preliminary result: no yes yes yes yes no yes yes no no no yes yes yes yes no
lola: ========================================
lola: memory consumption: 14628 KB
lola: time consumption: 0 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Angiogenesis-PT-25"
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/Angiogenesis-PT-25.tgz
mv Angiogenesis-PT-25 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 Angiogenesis-PT-25, 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 r016-qhx1-152646241100042"
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 ;