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 224K
-rw-r--r-- 1 mcc users 3.7K May 30 21:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 30 21:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 29 15:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 29 15:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 28 09:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 09:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 28 08:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 28 08:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.7K May 28 06:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 28 06:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.4K May 27 03:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K May 27 03:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw------- 1 mcc users 57K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is EGFr-PT-02010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169700261
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527786402438

info: Time: 3600 - MCC
===========================================================================================
prep: translating EGFr-PT-02010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating EGFr-PT-02010 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ EGFr-PT-02010 @ 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: 108/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1280
lola: finding significant places
lola: 40 places, 68 transitions, 20 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 132 transition conflict sets
lola: TASK
lola: reading formula from EGFr-PT-02010-ReachabilityFireability.task
lola: E (F (FIREABLE(CDK4_equals_1_to_CDK4_equals_0_when_p27_equals_1))) : A (G (((FIREABLE(CyclinD1_equals_1_to_CyclinD1_equals_0_when_AKT1_equals_0_and_MEK1_equals_0) AND (FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_equals_1) OR FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB2_equals_0))) OR NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) OR NOT FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1) OR NOT FIREABLE(ERalpha_equals_1_to_ERalpha_equals_0_when_AKT1_equals_0_and_MEK1_equals_0) OR (NOT FIREABLE(ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1) AND (FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB2_3_equals_1) OR FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1)))))) : A (G ((NOT FIREABLE(CDK6_equals_1_to_CDK6_equals_0_when_CyclinD1_equals_0) OR FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) OR NOT FIREABLE(ERBB2_equals_0_to_ERBB2_equals_1_when_EGF_equals_1)))) : E (F ((FIREABLE(pRB1_equals_1_to_pRB1_equals_0_when_CDK6_equals_0) AND (NOT FIREABLE(p21_equals_1_to_p21_equals_0_when_AKT1_equals_1) OR NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_CyclinE1_equals_0)) AND NOT FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB2_3_equals_1)))) : E (F ((FIREABLE(CDK4_equals_1_to_CDK4_equals_0_when_p21_equals_1) AND (FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1) OR FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_AKT1_equals_0_and_ERalpha_equals_0) OR FIREABLE(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_0_and_ERBB2_3_equals_0_and_ERalpha_equals_1) OR FIREABLE(CyclinD1_equals_0_to_CyclinD1_equals_1_when_AKT1_equals_1_and_ERalpha_equals_1_and_MYC_equals_1) OR FIREABLE(MYC_equals_0_to_MYC_equals_1_when_ERalpha_equals_1))))) : E (F ((FIREABLE(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1) AND FIREABLE(CDK4_equals_1_to_CDK4_equals_0_when_p21_equals_1) AND NOT FIREABLE(ERBB2_equals_0_to_ERBB2_equals_1_when_EGF_equals_1) AND (NOT FIREABLE(AKT1_equals_1_to_AKT1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0) OR NOT FIREABLE(MEK1_equals_1_to_MEK1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0)) AND FIREABLE(p21_equals_1_to_p21_equals_0_when_MYC_equals_1) AND FIREABLE(CDK6_equals_1_to_CDK6_equals_0_when_CyclinD1_equals_0) AND FIREABLE(AKT1_equals_1_to_AKT1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0) AND (NOT FIREABLE(CyclinE1_equals_1_to_CyclinE1_equals_0_when_MYC_equals_0) OR NOT FIREABLE(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1))))) : E (F ((FIREABLE(ERalpha_equals_1_to_ERalpha_equals_0_when_AKT1_equals_0_and_MEK1_equals_0) AND ((FIREABLE(pRB1_equals_1_to_pRB1_equals_0_when_CDK4_equals_0) AND FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB2_equals_0)) OR NOT FIREABLE(ERBB2_3_equals_0_to_ERBB2_3_equals_1_when_ERBB2_equals_1_and_ERBB3_equals_1)) AND FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1) AND FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1)))) : A (G ((NOT FIREABLE(AKT1_equals_1_to_AKT1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0) OR NOT FIREABLE(CyclinD1_equals_0_to_CyclinD1_equals_1_when_AKT1_equals_1_and_ERalpha_equals_1_and_MYC_equals_1)))) : E (F ((FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) AND (NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_CyclinE1_equals_0) OR NOT FIREABLE(ERBB1_3_equals_0_to_ERBB1_3_equals_1_when_ERBB1_equals_1_and_ERBB3_equals_1) OR FIREABLE(p21_equals_1_to_p21_equals_0_when_MYC_equals_1))))) : E (F ((FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB2_equals_0) AND (NOT FIREABLE(pRB1_equals_1_to_pRB1_equals_0_when_CDK4_equals_0) OR NOT FIREABLE(pRB1_equals_1_to_pRB1_equals_0_when_CDK6_equals_0)) AND FIREABLE(ERBB1_3_equals_1_to_ERBB1_3_equals_0_when_ERBB1_equals_0) AND (NOT FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1) OR NOT FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1))))) : E (F (((FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) OR FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_IGF1R_equals_1) OR (FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1) AND FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB1_equals_0))) AND (FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB2_equals_0) OR FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_IGF1R_equals_1) OR (FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_equals_1) AND FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_equals_1))) AND (FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_IGF1R_equals_1) OR FIREABLE(ERBB3_equals_1_to_ERBB3_equals_0_when_EGF_equals_0))))) : E (F ((NOT FIREABLE(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_1_and_ERBB2_3_equals_0) AND FIREABLE(ERBB3_equals_1_to_ERBB3_equals_0_when_EGF_equals_0)))) : E (F ((FIREABLE(AKT1_equals_1_to_AKT1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0) AND FIREABLE(CDK2_equals_0_to_CDK2_equals_1_when_CyclinE1_equals_1_and_p21_equals_0_and_p27_equals_0) AND NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1)))) : E (F (FIREABLE(p27_equals_1_to_p27_equals_0_when_CDK4_equals_1))) : A (G (((FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1) AND NOT FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1) AND ((FIREABLE(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_0_and_ERBB2_3_equals_0_and_ERalpha_equals_1) AND FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1)) OR NOT FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_2_equals_1))) OR NOT FIREABLE(CDK4_equals_1_to_CDK4_equals_0_when_p27_equals_1)))) : E (F ((FIREABLE(ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1) AND FIREABLE(ERBB1_equals_1_to_ERBB1_equals_0_when_EGF_equals_0) AND (FIREABLE(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_1_and_ERBB2_3_equals_0) OR NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_CyclinE1_equals_0) OR (FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1) AND FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT1_equals_1) AND (FIREABLE(CDK2_equals_0_to_CDK2_equals_1_when_CyclinE1_equals_1_and_p21_equals_0_and_p27_equals_0) OR FIREABLE(ERBB3_equals_0_to_ERBB3_equals_1_when_EGF_equals_1)))))))
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(CDK4_equals_1_to_CDK4_equals_0_when_p27_equals_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(CDK4_equals_1_to_CDK4_equals_0_when_p27_equals_1)))
lola: processed formula length: 66
lola: 1 rewrites
lola: closed formula file EGFr-PT-02010-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(CDK4_equals_1_to_CDK4_equals_0_when_p27_equals_1)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3251 markings, 16122 edges
lola: ========================================

FORMULA EGFr-PT-02010-ReachabilityFireability-0 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(p27_equals_1_to_p27_equals_0_when_CDK4_equals_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(p27_equals_1_to_p27_equals_0_when_CDK4_equals_1)))
lola: processed formula length: 65
lola: 1 rewrites
lola: closed formula file EGFr-PT-02010-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(p27_equals_1_to_p27_equals_0_when_CDK4_equals_1)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file EGFr-PT-02010-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3251 markings, 16122 edges
lola: ========================================

FORMULA EGFr-PT-02010-ReachabilityFireability-13 FALSE 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: E (F ((NOT FIREABLE(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_1_and_ERBB2_3_equals_0) AND FIREABLE(ERBB3_equals_1_to_ERBB3_equals_0_when_EGF_equals_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(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_1_and_ERBB2_3_equals_0) AND FIREABLE(ERBB3_equals_1_to_ERBB3_equals_0_when_EGF_equals_0))))
lola: processed formula length: 161
lola: 1 rewrites
lola: closed formula file EGFr-PT-02010-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(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_1_and_ERBB2_3_equals_0) AND FIREABLE(ERBB3_equals_1_to_ERBB3_equals_0_when_EGF_equals_0))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 9 markings, 9 edges
lola: ========================================

FORMULA EGFr-PT-02010-ReachabilityFireability-11 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(AKT1_equals_1_to_AKT1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0) OR NOT FIREABLE(CyclinD1_equals_0_to_CyclinD1_equals_1_when_AKT1_equals_1_and_ERalpha_equals_1_and_MYC_equals_1))))
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(AKT1_equals_1_to_AKT1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0) OR NOT FIREABLE(CyclinD1_equals_0_to_CyclinD1_equals_1_when_AKT1_equals_1_and_ERalpha_equals_1_and_MYC_equals_1))))
lola: processed formula length: 270
lola: 2 rewrites
lola: closed formula file EGFr-PT-02010-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(AKT1_equals_1_to_AKT1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0) AND FIREABLE(CyclinD1_equals_0_to_CyclinD1_equals_1_when_AKT1_equals_1_and_ERalpha_equals_1_and_MYC_equals_1))
lola: state equation: Generated DNF with 10 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file EGFr-PT-02010-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2230 markings, 10384 edges
lola: ========================================

FORMULA EGFr-PT-02010-ReachabilityFireability-7 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(AKT1_equals_1_to_AKT1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0) AND FIREABLE(CDK2_equals_0_to_CDK2_equals_1_when_CyclinE1_equals_1_and_p21_equals_0_and_p27_equals_0) AND NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_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(AKT1_equals_1_to_AKT1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0) AND FIREABLE(CDK2_equals_0_to_CDK2_equals_1_when_CyclinE1_equals_1_and_p21_equals_0_and_p27_equals_0) AND NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1))))
lola: processed formula length: 325
lola: 1 rewrites
lola: closed formula file EGFr-PT-02010-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(AKT1_equals_1_to_AKT1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0) AND FIREABLE(CDK2_equals_0_to_CDK2_equals_1_when_CyclinE1_equals_1_and_p21_equals_0_and_p27_equals_0) AND NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1))
lola: state equation: Generated DNF with 22 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file EGFr-PT-02010-ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2497 markings, 15033 edges
lola: ========================================

FORMULA EGFr-PT-02010-ReachabilityFireability-12 FALSE 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(CDK6_equals_1_to_CDK6_equals_0_when_CyclinD1_equals_0) OR FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) OR NOT FIREABLE(ERBB2_equals_0_to_ERBB2_equals_1_when_EGF_equals_1))))
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(CDK6_equals_1_to_CDK6_equals_0_when_CyclinD1_equals_0) OR FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) OR NOT FIREABLE(ERBB2_equals_0_to_ERBB2_equals_1_when_EGF_equals_1))))
lola: processed formula length: 209
lola: 2 rewrites
lola: closed formula file EGFr-PT-02010-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(CDK6_equals_1_to_CDK6_equals_0_when_CyclinD1_equals_0) AND NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) AND FIREABLE(ERBB2_equals_0_to_ERBB2_equals_1_when_EGF_equals_1))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1337 markings, 3454 edges
lola: ========================================

FORMULA EGFr-PT-02010-ReachabilityFireability-2 TRUE 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(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) AND (NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_CyclinE1_equals_0) OR NOT FIREABLE(ERBB1_3_equals_0_to_ERBB1_3_equals_1_when_ERBB1_equals_1_and_ERBB3_equals_1) OR FIREABLE(p21_equals_1_to_p21_equals_0_when_MYC_equals_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(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) AND (NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_CyclinE1_equals_0) OR NOT FIREABLE(ERBB1_3_equals_0_to_ERBB1_3_equals_1_when_ERBB1_equals_1_and_ERBB3_equals_1) OR FIREABLE(p21_equals_1_to_p21_equals_0_when_MYC_equals_1)))))
lola: processed formula length: 297
lola: 1 rewrites
lola: closed formula file EGFr-PT-02010-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(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) AND (NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_CyclinE1_equals_0) OR NOT FIREABLE(ERBB1_3_equals_0_to_ERBB1_3_equals_1_when_ERBB1_equals_1_and_ERBB3_equals_1) OR FIREABLE(p21_equals_1_to_p21_equals_0_when_MYC_equals_1)))
lola: state equation: Generated DNF with 16 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file EGFr-PT-02010-ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3213 markings, 16462 edges
lola: ========================================

FORMULA EGFr-PT-02010-ReachabilityFireability-8 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(pRB1_equals_1_to_pRB1_equals_0_when_CDK6_equals_0) AND (NOT FIREABLE(p21_equals_1_to_p21_equals_0_when_AKT1_equals_1) OR NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_CyclinE1_equals_0)) AND NOT FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB2_3_equals_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(pRB1_equals_1_to_pRB1_equals_0_when_CDK6_equals_0) AND (NOT FIREABLE(p21_equals_1_to_p21_equals_0_when_AKT1_equals_1) OR NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_CyclinE1_equals_0)) AND NOT FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB2_3_equals_1))))
lola: processed formula length: 280
lola: 1 rewrites
lola: closed formula file EGFr-PT-02010-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(pRB1_equals_1_to_pRB1_equals_0_when_CDK6_equals_0) AND (NOT FIREABLE(p21_equals_1_to_p21_equals_0_when_AKT1_equals_1) OR NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_CyclinE1_equals_0)) AND NOT FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB2_3_equals_1))
lola: state equation: Generated DNF with 32 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file EGFr-PT-02010-ReachabilityFireability-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3893 markings, 19836 edges

FORMULA EGFr-PT-02010-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1) AND NOT FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1) AND ((FIREABLE(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_0_and_ERBB2_3_equals_0_and_ERalpha_equals_1) AND FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1)) OR NOT FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_2_equals_1))) OR ... (shortened)
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(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1) AND NOT FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1) AND ((FIREABLE(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_0_and_ERBB2_3_equals_0_and_ERalpha_equals_1) AND FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1)) OR NOT FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_2_equals_1))) OR ... (shortened)
lola: processed formula length: 466
lola: 2 rewrites
lola: closed formula file EGFr-PT-02010-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(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1) OR FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1) OR ((NOT FIREABLE(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_0_and_ERBB2_3_equals_0_and_ERalpha_equals_1) OR NOT FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1)) AND FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_2_equals_1))) AND FIREABLE(CDK4_equals_1_to_CDK4_equals_0_when_p27_equals_1))
lola: state equation: Generated DNF with 35 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3221 markings, 16206 edges
lola: ========================================

FORMULA EGFr-PT-02010-ReachabilityFireability-14 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(ERalpha_equals_1_to_ERalpha_equals_0_when_AKT1_equals_0_and_MEK1_equals_0) AND ((FIREABLE(pRB1_equals_1_to_pRB1_equals_0_when_CDK4_equals_0) AND FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB2_equals_0)) OR NOT FIREABLE(ERBB2_3_equals_0_to_ERBB2_3_equals_1_when_ERBB2_equals_1_and_ERBB3_equals_1)) AND FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1) AND FIREA... (shortened)
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(ERalpha_equals_1_to_ERalpha_equals_0_when_AKT1_equals_0_and_MEK1_equals_0) AND ((FIREABLE(pRB1_equals_1_to_pRB1_equals_0_when_CDK4_equals_0) AND FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB2_equals_0)) OR NOT FIREABLE(ERBB2_3_equals_0_to_ERBB2_3_equals_1_when_ERBB2_equals_1_and_ERBB3_equals_1)) AND FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1) AND FIREA... (shortened)
lola: processed formula length: 460
lola: 1 rewrites
lola: closed formula file EGFr-PT-02010-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(ERalpha_equals_1_to_ERalpha_equals_0_when_AKT1_equals_0_and_MEK1_equals_0) AND ((FIREABLE(pRB1_equals_1_to_pRB1_equals_0_when_CDK4_equals_0) AND FIREABLE(ERBB2_3_equals_1_to_ERBB2_3_equals_0_when_ERBB2_equals_0)) OR NOT FIREABLE(ERBB2_3_equals_0_to_ERBB2_3_equals_1_when_ERBB2_equals_1_and_ERBB3_equals_1)) AND FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1) AND FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1))
lola: state equation: Generated DNF with 35 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file EGFr-PT-02010-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2994 markings, 11922 edges
lola: ========================================

FORMULA EGFr-PT-02010-ReachabilityFireability-6 FALSE 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: E (F ((FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB2_equals_0) AND (NOT FIREABLE(pRB1_equals_1_to_pRB1_equals_0_when_CDK4_equals_0) OR NOT FIREABLE(pRB1_equals_1_to_pRB1_equals_0_when_CDK6_equals_0)) AND FIREABLE(ERBB1_3_equals_1_to_ERBB1_3_equals_0_when_ERBB1_equals_0) AND (NOT FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1) OR NOT FIREABLE(AKT1_equals_0_to_AKT1_equ... (shortened)
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(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB2_equals_0) AND (NOT FIREABLE(pRB1_equals_1_to_pRB1_equals_0_when_CDK4_equals_0) OR NOT FIREABLE(pRB1_equals_1_to_pRB1_equals_0_when_CDK6_equals_0)) AND FIREABLE(ERBB1_3_equals_1_to_ERBB1_3_equals_0_when_ERBB1_equals_0) AND (NOT FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1) OR NOT FIREABLE(AKT1_equals_0_to_AKT1_equ... (shortened)
lola: processed formula length: 432
lola: 1 rewrites
lola: closed formula file EGFr-PT-02010-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(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB2_equals_0) AND (NOT FIREABLE(pRB1_equals_1_to_pRB1_equals_0_when_CDK4_equals_0) OR NOT FIREABLE(pRB1_equals_1_to_pRB1_equals_0_when_CDK6_equals_0)) AND FIREABLE(ERBB1_3_equals_1_to_ERBB1_3_equals_0_when_ERBB1_equals_0) AND (NOT FIREABLE(ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1) OR NOT FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1)))
lola: state equation: Generated DNF with 72 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file EGFr-PT-02010-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1887 markings, 5082 edges

FORMULA EGFr-PT-02010-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(CDK4_equals_1_to_CDK4_equals_0_when_p21_equals_1) AND (FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1) OR FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_AKT1_equals_0_and_ERalpha_equals_0) OR FIREABLE(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_0_and_ERBB2_3_equals_0_and_ERalpha_equals_1) OR FIREABLE(CyclinD1_equals_0_to_CyclinD1_equals_1_when_AKT1_equals_1_... (shortened)
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(CDK4_equals_1_to_CDK4_equals_0_when_p21_equals_1) AND (FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1) OR FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_AKT1_equals_0_and_ERalpha_equals_0) OR FIREABLE(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_0_and_ERBB2_3_equals_0_and_ERalpha_equals_1) OR FIREABLE(CyclinD1_equals_0_to_CyclinD1_equals_1_when_AKT1_equals_1_... (shortened)
lola: processed formula length: 507
lola: 1 rewrites
lola: closed formula file EGFr-PT-02010-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(CDK4_equals_1_to_CDK4_equals_0_when_p21_equals_1) AND (FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1) OR FIREABLE(IGF1R_equals_1_to_IGF1R_equals_0_when_AKT1_equals_0_and_ERalpha_equals_0) OR FIREABLE(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_0_and_ERBB2_3_equals_0_and_ERalpha_equals_1) OR FIREABLE(CyclinD1_equals_0_to_CyclinD1_equals_1_when_AKT1_equals_1_and_ERalpha_equals_1_and_MYC_equals_1) OR FIREABLE(MYC_equals_0_to_MYC_equals_1_when_ERalpha_equals_1)))
lola: state equation: Generated DNF with 25 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file EGFr-PT-02010-ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2435 markings, 11473 edges
lola: ========================================

FORMULA EGFr-PT-02010-ReachabilityFireability-4 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(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1) AND FIREABLE(CDK4_equals_1_to_CDK4_equals_0_when_p21_equals_1) AND NOT FIREABLE(ERBB2_equals_0_to_ERBB2_equals_1_when_EGF_equals_1) AND (NOT FIREABLE(AKT1_equals_1_to_AKT1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0) OR NOT FIREABLE(MEK1_e... (shortened)
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(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1) AND FIREABLE(CDK4_equals_1_to_CDK4_equals_0_when_p21_equals_1) AND NOT FIREABLE(ERBB2_equals_0_to_ERBB2_equals_1_when_EGF_equals_1) AND (NOT FIREABLE(AKT1_equals_1_to_AKT1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0) OR NOT FIREABLE(MEK1_e... (shortened)
lola: processed formula length: 978
lola: 1 rewrites
lola: closed formula file EGFr-PT-02010-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(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1) AND FIREABLE(CDK4_equals_1_to_CDK4_equals_0_when_p21_equals_1) AND NOT FIREABLE(ERBB2_equals_0_to_ERBB2_equals_1_when_EGF_equals_1) AND (NOT FIREABLE(AKT1_equals_1_to_AKT1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0) OR NOT FIREABLE(MEK1_equals_1_to_MEK1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0)) AND FIREABLE(p21_equals_1_to_p21_equals_0_when_MYC_equals_1) AND FIREABLE(CDK6_equals_1_to_CDK6_equals_0_when_CyclinD1_equals_0) AND FIREABLE(AKT1_equals_1_to_AKT1_equals_0_when_ERBB1_equals_0_and_ERBB1_2_equals_0_and_ERBB1_3_equals_0_and_ERBB2_3_equals_0_and_IGF1R_equals_0) AND (NOT FIREABLE(CyclinE1_equals_1_to_CyclinE1_equals_0_when_MYC_equals_0) OR NOT FIREABLE(ERBB1_2_equals_0_to_ERBB1_2_equals_1_when_ERBB1_equals_1_and_ERBB2_equals_1)))
lola: state equation: Generated DNF with 72 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1460 markings, 3835 edges
lola: ========================================

FORMULA EGFr-PT-02010-ReachabilityFireability-5 FALSE 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(ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1) AND FIREABLE(ERBB1_equals_1_to_ERBB1_equals_0_when_EGF_equals_0) AND (FIREABLE(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_1_and_ERBB2_3_equals_0) OR NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_CyclinE1_equals_0) OR (FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1) AND FIREABLE(MYC_equals_0_to_MYC_equals... (shortened)
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(ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1) AND FIREABLE(ERBB1_equals_1_to_ERBB1_equals_0_when_EGF_equals_0) AND (FIREABLE(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_1_and_ERBB2_3_equals_0) OR NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_CyclinE1_equals_0) OR (FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1) AND FIREABLE(MYC_equals_0_to_MYC_equals... (shortened)
lola: processed formula length: 596
lola: 1 rewrites
lola: closed formula file EGFr-PT-02010-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(ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1) AND FIREABLE(ERBB1_equals_1_to_ERBB1_equals_0_when_EGF_equals_0) AND (FIREABLE(IGF1R_equals_0_to_IGF1R_equals_1_when_AKT1_equals_1_and_ERBB2_3_equals_0) OR NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_CyclinE1_equals_0) OR (FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1) AND FIREABLE(MYC_equals_0_to_MYC_equals_1_when_AKT1_equals_1) AND (FIREABLE(CDK2_equals_0_to_CDK2_equals_1_when_CyclinE1_equals_1_and_p21_equals_0_and_p27_equals_0) OR FIREABLE(ERBB3_equals_0_to_ERBB3_equals_1_when_EGF_equals_1)))))
lola: state equation: Generated DNF with 39 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: state equation: calling and running sara
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 89 markings, 102 edges
lola: ========================================
sara: try reading problem file EGFr-PT-02010-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic


FORMULA EGFr-PT-02010-ReachabilityFireability-15 FALSE 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(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) OR FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_IGF1R_equals_1) OR (FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1) AND FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB1_equals_0))) AND (FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB2_equals_0) OR FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_IGF1R_... (shortened)
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(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) OR FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_IGF1R_equals_1) OR (FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1) AND FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB1_equals_0))) AND (FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB2_equals_0) OR FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_IGF1R_... (shortened)
lola: processed formula length: 677
lola: 1 rewrites
lola: closed formula file EGFr-PT-02010-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(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) OR FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_IGF1R_equals_1) OR (FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1) AND FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB1_equals_0))) AND (FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB2_equals_0) OR FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_IGF1R_equals_1) OR (FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_equals_1) AND FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_equals_1))) AND (FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_IGF1R_equals_1) OR FIREABLE(ERBB3_equals_1_to_ERBB3_equals_0_when_EGF_equals_0)))
lola: state equation: Generated DNF with 132 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file EGFr-PT-02010-ReachabilityFireability-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2576 markings, 10942 edges

FORMULA EGFr-PT-02010-ReachabilityFireability-10 FALSE 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: A (G (((FIREABLE(CyclinD1_equals_1_to_CyclinD1_equals_0_when_AKT1_equals_0_and_MEK1_equals_0) AND (FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_equals_1) OR FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB2_equals_0))) OR NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) OR NOT FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1) OR NOT FIREABLE(ERalpha_equals_1_... (shortened)
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(CyclinD1_equals_1_to_CyclinD1_equals_0_when_AKT1_equals_0_and_MEK1_equals_0) AND (FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_equals_1) OR FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB2_equals_0))) OR NOT FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) OR NOT FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1) OR NOT FIREABLE(ERalpha_equals_1_... (shortened)
lola: processed formula length: 667
lola: 2 rewrites
lola: closed formula file EGFr-PT-02010-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(CyclinD1_equals_1_to_CyclinD1_equals_0_when_AKT1_equals_0_and_MEK1_equals_0) OR (NOT FIREABLE(MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_equals_1) AND NOT FIREABLE(ERBB1_2_equals_1_to_ERBB1_2_equals_0_when_ERBB2_equals_0))) AND FIREABLE(CDK2_equals_1_to_CDK2_equals_0_when_p27_equals_1) AND FIREABLE(p27_equals_1_to_p27_equals_0_when_AKT1_equals_1) AND FIREABLE(ERalpha_equals_1_to_ERalpha_equals_0_when_AKT1_equals_0_and_MEK1_equals_0) AND (FIREABLE(ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1) OR (NOT FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB2_3_equals_1) AND NOT FIREABLE(AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_3_equals_1))))
lola: state equation: Generated DNF with 64 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to EGFr-PT-02010-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2030 markings, 6811 edges
lola: ========================================

FORMULA EGFr-PT-02010-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no no no yes no no no no no no yes no
lola:
preliminary result: no yes yes no no no no yes no no no no no no yes no
lola: memory consumption: 14796 KB
lola: time consumption: 0 seconds

BK_STOP 1527786402998

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

grep: GenericPropertiesVerdict.xml: No such file or directory

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="EGFr-PT-02010"
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/EGFr-PT-02010.tgz
mv EGFr-PT-02010 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 EGFr-PT-02010, 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 r280-csrt-152749169700261"
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 ;