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 192K
-rw-r--r-- 1 mcc users 3.5K 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.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 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 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 102 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 340 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 25K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is MAPK-PT-008, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469100157
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527019625037

info: Time: 3600 - MCC
===========================================================================================
prep: translating MAPK-PT-008 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating MAPK-PT-008 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ MAPK-PT-008 @ 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: 52/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from MAPK-PT-008-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= Raf_RasGTP)
lola: ((A (G (((1 <= Phase3) OR (3 <= ERK_MEKPP)))) AND E (X ((1 <= Phase2)))) OR (NOT(E (G ((3 <= Raf)))) OR ((RasGTP <= ERKPP_Phase3) OR A (F ((Phase2 <= MEKP_RafP)))))) : ((1 <= RafP) OR E ((((RafP <= ERKP_Phase3) OR (3 <= RafP)) U ((Raf <= RafP) OR (2 <= MEKP_Phase2))))) : A (G (A (F (((MEKP_RafP <= ERK) OR (2 <= ERK_MEKPP)))))) : A (G (((MEKP_RafP <= 0) OR (ERKP_MEKPP + 1 <= MEK) OR (ERK_MEKPP <= 0)))) : E ((E (F ((RasGTP <= ERK))) U A (X ((2 <= MEKP_RafP))))) : NOT(E ((((2 <= Phase2) OR (3 <= ERKPP)) U ((3 <= MEKPP) OR (Phase2 <= MEKPP))))) : (E (G ((ERK_MEKPP <= 1))) AND NOT(A (G (((3 <= Phase3) OR (MEKPP_Phase2 <= Raf)))))) : A (G (E (F ((ERKP <= ERKP_Phase3))))) : E (F (A (X (((3 <= ERKPP_Phase3) AND (MEKP_RafP <= MEK)))))) : ((ERK_MEKPP <= 0) AND (E (F (((3 <= ERKPP) AND (MEKP <= MEK)))) OR ((Phase1 <= RafP_Phase1) AND (ERKP_MEKPP <= Raf)))) : NOT(A (F (E (F ((2 <= ERKPP_Phase3)))))) : (E (F (A (G (FALSE)))) OR NOT(A (F (((ERKP <= RasGTP) AND (3 <= MEK)))))) : E (F (A (G ((Raf_RasGTP + 1 <= ERK))))) : E (F (((Raf <= ERKP_Phase3) AND (RasGTP <= ERK_MEKPP) AND (MEK_RafP <= 2) AND (Phase3 <= ERKPP)))) : E ((((1 <= Phase2) AND (ERKPP_Phase3 <= MEK)) U ((Raf <= 2) AND (Phase2 <= 2)))) : (E (F (E (X ((3 <= ERKPP))))) OR NOT(E (F (((1 <= RasGTP) OR (3 <= MEK_RafP))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G (((1 <= Phase3) OR (3 <= ERK_MEKPP)))) AND E (X ((1 <= Phase2)))) OR (A (F ((Raf <= 2))) OR ((RasGTP <= ERKPP_Phase3) OR A (F ((Phase2 <= MEKP_RafP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (RasGTP <= ERKPP_Phase3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (RasGTP <= ERKPP_Phase3)
lola: processed formula length: 24
lola: 27 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Raf <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (3 <= Raf)
lola: processed formula length: 10
lola: 29 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Phase2 <= MEKP_RafP)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (MEKP_RafP + 1 <= Phase2)
lola: processed formula length: 25
lola: 29 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Phase3) OR (3 <= ERK_MEKPP))))
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 (((1 <= Phase3) OR (3 <= ERK_MEKPP))))
lola: processed formula length: 44
lola: 29 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.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: ((Phase3 <= 0) AND (ERK_MEKPP <= 2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 30 edges
lola: state equation: write sara problem file to MAPK-PT-008-CTLCardinality-3-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA MAPK-PT-008-CTLCardinality-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 ((E (F ((RasGTP <= ERK))) U A (X ((2 <= MEKP_RafP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(E(TRUE U (RasGTP <= ERK)) U AX((2 <= MEKP_RafP)))
lola: processed formula length: 51
lola: 30 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 126509 markings, 442265 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLCardinality-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: E (F (A (X (((3 <= ERKPP_Phase3) AND (MEKP_RafP <= MEK))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX(((3 <= ERKPP_Phase3) AND (MEKP_RafP <= MEK))))
lola: processed formula length: 58
lola: 29 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 922991 markings, 2331756 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((3 <= ERKPP))))) OR A (G (((RasGTP <= 0) AND (MEK_RafP <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((RasGTP <= 0) AND (MEK_RafP <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G (((RasGTP <= 0) AND (MEK_RafP <= 2))))
lola: processed formula length: 43
lola: 29 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: ((1 <= RasGTP) OR (3 <= MEK_RafP))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((3 <= ERKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (3 <= ERKPP)
lola: processed formula length: 12
lola: 28 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 22 markings, 31 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA MAPK-PT-008-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ERKPP_Phase3 <= 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:695
lola: processed formula: A (G ((ERKPP_Phase3 <= 1)))
lola: processed formula length: 27
lola: 29 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.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:695
lola: formula 0: (2 <= ERKPP_Phase3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-008-CTLCardinality-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 24 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLCardinality-10 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 (((MEKP_RafP <= 0) OR (ERKP_MEKPP + 1 <= MEK) OR (ERK_MEKPP <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((MEKP_RafP <= 0) OR (ERKP_MEKPP + 1 <= MEK) OR (ERK_MEKPP <= 0))))
lola: processed formula length: 75
lola: 29 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.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: ((1 <= MEKP_RafP) AND (MEK <= ERKP_MEKPP) AND (1 <= ERK_MEKPP))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 25 edges
lola: state equation: write sara problem file to MAPK-PT-008-CTLCardinality-5-0.sara

FORMULA MAPK-PT-008-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Raf <= ERKP_Phase3) AND (RasGTP <= ERK_MEKPP) AND (MEK_RafP <= 2) AND (Phase3 <= ERKPP))))
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 (((Raf <= ERKP_Phase3) AND (RasGTP <= ERK_MEKPP) AND (MEK_RafP <= 2) AND (Phase3 <= ERKPP))))
lola: processed formula length: 98
lola: 28 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.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: ((Raf <= ERKP_Phase3) AND (RasGTP <= ERK_MEKPP) AND (MEK_RafP <= 2) AND (Phase3 <= ERKPP))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: lola: state equation: write sara problem file to MAPK-PT-008-CTLCardinality-6-0.sara
state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-008-CTLCardinality-5-0.sara.

sara: try reading problem file MAPK-PT-008-CTLCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 37 markings, 47 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((ERKP <= ERKP_Phase3)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (ERKP <= ERKP_Phase3)
lola: processed formula length: 21
lola: 28 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2489951 markings, 6805954 edges, 497990 markings/sec, 0 secs
lola: 4286388 markings, 12495477 edges, 359287 markings/sec, 5 secs
lola: 5710780 markings, 17914250 edges, 284878 markings/sec, 10 secs
lola: 6064669 markings, 23954092 edges, 70778 markings/sec, 15 secs
lola: 6084799 markings, 29756772 edges, 4026 markings/sec, 20 secs
lola: 6093957 markings, 35394536 edges, 1832 markings/sec, 25 secs
lola: 6099463 markings, 41257874 edges, 1101 markings/sec, 30 secs
lola: 6103056 markings, 47413987 edges, 719 markings/sec, 35 secs
lola: 6105645 markings, 53522423 edges, 518 markings/sec, 40 secs
lola: 6107510 markings, 60353477 edges, 373 markings/sec, 45 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 6108223 markings, 67620104 edges

FORMULA MAPK-PT-008-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((Raf_RasGTP + 1 <= ERK)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (ERK <= Raf_RasGTP)
lola: processed formula length: 19
lola: 29 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2320005 markings, 6237773 edges, 464001 markings/sec, 0 secs
lola: 4114719 markings, 12112427 edges, 358943 markings/sec, 5 secs
lola: 5752304 markings, 18402300 edges, 327517 markings/sec, 10 secs
lola: 6049284 markings, 26004321 edges, 59396 markings/sec, 15 secs
lola: 6056815 markings, 33172422 edges, 1506 markings/sec, 20 secs
lola: 6068175 markings, 40006329 edges, 2272 markings/sec, 25 secs
lola: 6079939 markings, 46622189 edges, 2353 markings/sec, 30 secs
lola: 6087981 markings, 53089218 edges, 1608 markings/sec, 35 secs
lola: 6092185 markings, 59207270 edges, 841 markings/sec, 40 secs
lola: 6094307 markings, 65292118 edges, 424 markings/sec, 45 secs
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 6095428 markings, 68308804 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((RasGTP + 1 <= ERKP) OR (MEK <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((RasGTP + 1 <= ERKP) OR (MEK <= 2))))
lola: processed formula length: 45
lola: 27 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges

FORMULA MAPK-PT-008-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((MEKP_RafP <= ERK) OR (2 <= ERK_MEKPP))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((ERK + 1 <= MEKP_RafP) AND (ERK_MEKPP <= 1))
lola: processed formula length: 45
lola: 29 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 24 markings, 33 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((Phase2 <= 1) AND (ERKPP <= 2)) R ((MEKPP <= 2) AND (MEKPP + 1 <= Phase2))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A ((((Phase2 <= 1) AND (ERKPP <= 2)) R ((MEKPP <= 2) AND (MEKPP + 1 <= Phase2))))
lola: processed formula length: 81
lola: 33 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((3 <= MEKPP) OR (Phase2 <= MEKPP))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-008-CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-008-CTLCardinality-11-0.sara.

lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 15792 markings, 35522 edges
lola: ========================================

FORMULA MAPK-PT-008-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 865 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= Phase2) AND (ERKPP_Phase3 <= MEK)) U ((Raf <= 2) AND (Phase2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((1 <= Phase2) AND (ERKPP_Phase3 <= MEK)) U ((Raf <= 2) AND (Phase2 <= 2))))
lola: processed formula length: 80
lola: 30 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((Raf <= 2) AND (Phase2 <= 2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-008-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-008-CTLCardinality-12-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 19104 markings, 42725 edges

FORMULA MAPK-PT-008-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1153 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= RafP) OR E ((((RafP <= ERKP_Phase3) OR (3 <= RafP)) U ((Raf <= RafP) OR (2 <= MEKP_Phase2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1153 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= RafP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= RafP)
lola: processed formula length: 11
lola: 27 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 14 will run for 1730 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((RafP <= ERKP_Phase3) OR (3 <= RafP)) U ((Raf <= RafP) OR (2 <= MEKP_Phase2))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((RafP <= ERKP_Phase3) OR (3 <= RafP)) U ((Raf <= RafP) OR (2 <= MEKP_Phase2))))
lola: processed formula length: 86
lola: 30 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 3 markings, 4 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA MAPK-PT-008-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: formula 0: ((Raf <= RafP) OR (2 <= MEKP_Phase2))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: lola: subprocess 14 will run for 1730 seconds at most (--localtimelimit=0)
lola: ========================================
state equation: write sara problem file to MAPK-PT-008-CTLCardinality-14-0.sara
lola: ...considering subproblem: (E (G ((ERK_MEKPP <= 1))) AND E (F (((Phase3 <= 2) AND (Raf + 1 <= MEKPP_Phase2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1730 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((ERK_MEKPP <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((ERK_MEKPP <= 1)))
lola: processed formula length: 24
lola: 27 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 3 markings, 3 edges
lola: ========================================
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-008-CTLCardinality-14-0.sara.

lola: subprocess 15 will run for 3461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Phase3 <= 2) AND (Raf + 1 <= MEKPP_Phase2))))
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 (((Phase3 <= 2) AND (Raf + 1 <= MEKPP_Phase2))))
lola: processed formula length: 53
lola: 28 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 41 markings, 54 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA MAPK-PT-008-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((ERK_MEKPP <= 0) AND (E (F (((3 <= ERKPP) AND (MEKP <= MEK)))) OR ((Phase1 <= RafP_Phase1) AND (ERKP_MEKPP <= Raf))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Phase1 <= RafP_Phase1) AND (ERKP_MEKPP <= Raf))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Phase1 <= RafP_Phase1) AND (ERKP_MEKPP <= Raf))
lola: processed formula length: 49
lola: 27 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= ERKPP) AND (MEKP <= MEK))))
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 (((3 <= ERKPP) AND (MEKP <= MEK))))
lola: processed formula length: 40
lola: 28 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 32 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: formula 0: ((Phase3 <= 2) AND (Raf + 1 <= MEKPP_Phase2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-008-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-008-CTLCardinality-15-0.sara.

lola: state equation 0: solution produced
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((ERK_MEKPP <= 0) AND (E (F (((3 <= ERKPP) AND (MEKP <= MEK)))) OR ((Phase1 <= RafP_Phase1) AND (ERKP_MEKPP <= Raf))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (ERK_MEKPP <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ERK_MEKPP <= 0)
lola: processed formula length: 16
lola: 27 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((Phase1 <= RafP_Phase1) AND (ERKP_MEKPP <= Raf))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Phase1 <= RafP_Phase1) AND (ERKP_MEKPP <= Raf))
lola: processed formula length: 49
lola: 27 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= ERKPP) AND (MEKP <= MEK))))
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 (((3 <= ERKPP) AND (MEKP <= MEK))))
lola: processed formula length: 40
lola: 28 rewrites
lola: closed formula file MAPK-PT-008-CTLCardinality.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: ((3 <= ERKPP) AND (MEKP <= MEK))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-008-CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-008-CTLCardinality-18-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 32 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA MAPK-PT-008-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes no yes yes yes yes no no no yes yes yes
lola:
preliminary result: no no no no yes no yes yes yes yes no no no yes yes yes
lola: memory consumption: 23700 KB
lola: time consumption: 109 seconds

BK_STOP 1527019734748

--------------------
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="MAPK-PT-008"
export BK_EXAMINATION="CTLCardinality"
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/MAPK-PT-008.tgz
mv MAPK-PT-008 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 MAPK-PT-008, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r112-csrt-152666469100157"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;