fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r280-csrt-152749169800304
Last Updated
June 26, 2018

About the Execution of LoLA for MAPKbis-PT-5320

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.310 2174783.00 2527285.00 15694.00 FTTFTFFFTTTTFTFF normal

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 348K
-rw-r--r-- 1 mcc users 4.4K May 30 21:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 30 21:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 29 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 28 09:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 28 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 28 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 4.3K May 28 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 28 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.7K May 27 04:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 27 04:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 5 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 166K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is MAPKbis-PT-5320, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169800304
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527789964808

info: Time: 3600 - MCC
===========================================================================================
prep: translating MAPKbis-PT-5320 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating MAPKbis-PT-5320 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ MAPKbis-PT-5320 @ 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: 279/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3392
lola: finding significant places
lola: 106 places, 173 transitions, 49 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 343 transition conflict sets
lola: TASK
lola: reading formula from MAPKbis-PT-5320-ReachabilityCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (RSK_equals_1 <= EGFR_stimulus_equals_1)
lola: after: (RSK_equals_1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (TGFBR_stimulus_equals_0 <= AP1_equals_0)
lola: after: (1 <= AP1_equals_0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= TGFBR_stimulus_equals_0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (FGFR3_stimulus_equals_1 <= AP1_equals_1)
lola: after: (0 <= AP1_equals_1)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= MEK1_2_equals_0)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= MEK1_2_equals_0)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= EGFR_stimulus_equals_0)
lola: after: (2 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (3 <= MYC_equals_0)
lola: LP says that atomic proposition is always false: (3 <= Apoptosis_equals_0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= DNA_damage_equals_0)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (3 <= ERK_equals_1)
lola: place invariant simplifies atomic proposition
lola: before: (PDK1_equals_1 <= EGFR_stimulus_equals_1)
lola: after: (PDK1_equals_1 <= 0)
lola: LP says that atomic proposition is always false: (2 <= MAX_equals_1)
lola: LP says that atomic proposition is always false: (2 <= PI3K_equals_1)
lola: LP says that atomic proposition is always false: (3 <= FRS2_equals_0)
lola: LP says that atomic proposition is always false: (3 <= p70_equals_1)
lola: LP says that atomic proposition is always false: (2 <= MDM2_equals_0)
lola: LP says that atomic proposition is always false: (2 <= JNK_equals_0)
lola: LP says that atomic proposition is always false: (2 <= p38_equals_0)
lola: LP says that atomic proposition is always false: (2 <= AP1_equals_1)
lola: LP says that atomic proposition is always false: (3 <= JNK_equals_1)
lola: LP says that atomic proposition is always false: (3 <= PPP2CA_equals_1)
lola: LP says that atomic proposition is always false: (3 <= DUSP1_equals_0)
lola: E (F (((SPRY_equals_0 + 1 <= MEK1_2_equals_1) AND (PKC_equals_1 + 1 <= PDK1_equals_0)))) : A (G ((SPRY_equals_0 <= SMAD_equals_0))) : A (G ((((MAX_equals_1 <= 0) AND (SOS_equals_0 + 1 <= MAP3K1_3_equals_1)) OR (RAS_equals_1 <= GAB1_equals_1)))) : E (F (((PI3K_equals_1 <= 0) AND (AP1_equals_0 <= 0) AND (1 <= RSK_equals_1) AND (p70_equals_0 <= TAOK_equals_1)))) : A (G (((EGFR_equals_1 <= GAB1_equals_0)))) : E (F ((((MDM2_equals_1 <= PKC_equals_0)) AND (ATF2_equals_0 <= SOS_equals_1) AND (MAP3K1_3_equals_0 + 1 <= GAB1_equals_0)))) : E (F (FALSE)) : E (F ((((FOS_equals_0 <= 0) AND (CREB_equals_1 <= 0))))) : A (G (())) : A (G (((TAOK_equals_0 <= RAS_equals_0) AND (ELK1_equals_0 <= AKT_0)))) : A (G (())) : A (G (())) : E (F (())) : A (G (())) : E (F ((BCL2_equals_0 <= AKT_equals_1))) : E (F (((FGFR3_equals_0 <= ERK_equals_1))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 18 rewrites
lola: closed formula file MAPKbis-PT-5320-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

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

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

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

FORMULA MAPKbis-PT-5320-ReachabilityCardinality-11 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 18 rewrites
lola: closed formula file MAPKbis-PT-5320-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-ReachabilityCardinality-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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 18 rewrites
lola: closed formula file MAPKbis-PT-5320-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FOS_equals_0 <= 0) AND (CREB_equals_1 <= 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 ((((FOS_equals_0 <= 0) AND (CREB_equals_1 <= 0)))))
lola: processed formula length: 56
lola: 19 rewrites
lola: closed formula file MAPKbis-PT-5320-ReachabilityCardinality.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: (((FOS_equals_0 <= 0) AND (CREB_equals_1 <= 0)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-ReachabilityCardinality-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((EGFR_equals_1 <= GAB1_equals_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 (((EGFR_equals_1 <= GAB1_equals_0))))
lola: processed formula length: 42
lola: 20 rewrites
lola: closed formula file MAPKbis-PT-5320-ReachabilityCardinality.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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((GAB1_equals_0 + 1 <= EGFR_equals_1))
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================

FORMULA MAPKbis-PT-5320-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((SPRY_equals_0 <= SMAD_equals_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 ((SPRY_equals_0 <= SMAD_equals_0)))
lola: processed formula length: 40
lola: 20 rewrites
lola: closed formula file MAPKbis-PT-5320-ReachabilityCardinality.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: (SMAD_equals_0 + 1 <= SPRY_equals_0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to MAPKbis-PT-5320-ReachabilityCardinality-8-0.sara
lola: ========================================

FORMULA MAPKbis-PT-5320-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((BCL2_equals_0 <= AKT_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 ((BCL2_equals_0 <= AKT_equals_1)))
lola: processed formula length: 39
lola: 19 rewrites
lola: closed formula file MAPKbis-PT-5320-ReachabilityCardinality.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: (BCL2_equals_0 <= AKT_equals_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-ReachabilityCardinality-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FGFR3_equals_0 <= ERK_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 (((FGFR3_equals_0 <= ERK_equals_1))))
lola: processed formula length: 42
lola: 19 rewrites
lola: closed formula file MAPKbis-PT-5320-ReachabilityCardinality.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)
sara: try reading problem file MAPKbis-PT-5320-ReachabilityCardinality-8-0.sara.
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: ((FGFR3_equals_0 <= ERK_equals_1))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-ReachabilityCardinality-10-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: 1 markings, 0 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((SPRY_equals_0 + 1 <= MEK1_2_equals_1) AND (PKC_equals_1 + 1 <= PDK1_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 (((SPRY_equals_0 + 1 <= MEK1_2_equals_1) AND (PKC_equals_1 + 1 <= PDK1_equals_0))))
lola: processed formula length: 88
lola: 19 rewrites
lola: closed formula file MAPKbis-PT-5320-ReachabilityCardinality.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: ((SPRY_equals_0 + 1 <= MEK1_2_equals_1) AND (PKC_equals_1 + 1 <= PDK1_equals_0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to MAPKbis-PT-5320-ReachabilityCardinality-11-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((TAOK_equals_0 <= RAS_equals_0) AND (ELK1_equals_0 <= AKT_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 (((TAOK_equals_0 <= RAS_equals_0) AND (ELK1_equals_0 <= AKT_0))))
lola: processed formula length: 70
lola: 20 rewrites
lola: closed formula file MAPKbis-PT-5320-ReachabilityCardinality.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: ((RAS_equals_0 + 1 <= TAOK_equals_0) OR (AKT_0 + 1 <= ELK1_equals_0))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-ReachabilityCardinality-12-0.sara

sara: try reading problem file MAPKbis-PT-5320-ReachabilityCardinality-11-0.sara.
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file MAPKbis-PT-5320-ReachabilityCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 631940 markings, 2234272 edges, 126388 markings/sec, 0 secs
lola: sara is running 5 secs || 1151001 markings, 4504600 edges, 103812 markings/sec, 5 secs
lola: sara is running 10 secs || 1581576 markings, 6955921 edges, 86115 markings/sec, 10 secs
lola: sara is running 15 secs || 1985608 markings, 9599448 edges, 80806 markings/sec, 15 secs
lola: sara is running 20 secs || 2350104 markings, 12428728 edges, 72899 markings/sec, 20 secs
lola: sara is running 25 secs || 2679654 markings, 15432439 edges, 65910 markings/sec, 25 secs
lola: sara is running 30 secs || 2995677 markings, 18613501 edges, 63205 markings/sec, 30 secs
lola: sara is running 35 secs || 3297584 markings, 21888884 edges, 60381 markings/sec, 35 secs
lola: sara is running 40 secs || 3586547 markings, 25186038 edges, 57793 markings/sec, 40 secs
lola: sara is running 45 secs || 3859901 markings, 28515112 edges, 54671 markings/sec, 45 secs
lola: sara is running 50 secs || 4125763 markings, 32296547 edges, 53172 markings/sec, 50 secs
lola: sara is running 55 secs || 4182484 markings, 36091969 edges, 11344 markings/sec, 55 secs
lola: sara is running 60 secs || 4186078 markings, 39793416 edges, 719 markings/sec, 60 secs
lola: sara is running 65 secs || 4186114 markings, 43725276 edges, 7 markings/sec, 65 secs
lola: sara is running 70 secs || 4593759 markings, 46529712 edges, 81529 markings/sec, 70 secs
lola: sara is running 75 secs || 5036784 markings, 48716740 edges, 88605 markings/sec, 75 secs
lola: sara is running 80 secs || 5446628 markings, 51000933 edges, 81969 markings/sec, 80 secs
lola: sara is running 85 secs || 5809909 markings, 53469282 edges, 72656 markings/sec, 85 secs
lola: sara is running 90 secs || 6160272 markings, 56179954 edges, 70073 markings/sec, 90 secs
lola: sara is running 95 secs || 6495334 markings, 59084216 edges, 67012 markings/sec, 95 secs
lola: sara is running 100 secs || 6812276 markings, 62021546 edges, 63388 markings/sec, 100 secs
lola: sara is running 105 secs || 7111319 markings, 64967700 edges, 59809 markings/sec, 105 secs
lola: sara is running 110 secs || 7391884 markings, 68085138 edges, 56113 markings/sec, 110 secs
lola: sara is running 115 secs || 7673036 markings, 71748048 edges, 56230 markings/sec, 115 secs
lola: sara is running 120 secs || 7927031 markings, 75756449 edges, 50799 markings/sec, 120 secs
lola: sara is running 125 secs || 8123914 markings, 79482820 edges, 39377 markings/sec, 125 secs
lola: sara is running 130 secs || 8125285 markings, 82749256 edges, 274 markings/sec, 130 secs
lola: sara is running 135 secs || 8126457 markings, 86108689 edges, 234 markings/sec, 135 secs
lola: sara is running 140 secs || 8126465 markings, 89800448 edges, 2 markings/sec, 140 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 8126465 markings, 90997881 edges
lola:
FORMULA MAPKbis-PT-5320-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
subprocess 13 will run for 1141 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((PI3K_equals_1 <= 0) AND (AP1_equals_0 <= 0) AND (1 <= RSK_equals_1) AND (p70_equals_0 <= TAOK_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 (((PI3K_equals_1 <= 0) AND (AP1_equals_0 <= 0) AND (1 <= RSK_equals_1) AND (p70_equals_0 <= TAOK_equals_1))))
lola: processed formula length: 114
lola: 19 rewrites
lola: closed formula file MAPKbis-PT-5320-ReachabilityCardinality.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: ((PI3K_equals_1 <= 0) AND (AP1_equals_0 <= 0) AND (1 <= RSK_equals_1) AND (p70_equals_0 <= TAOK_equals_1))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 918861 markings, 1945675 edges, 183772 markings/sec, 0 secs
lola: sara is running 5 secs || 1665044 markings, 4342536 edges, 149237 markings/sec, 5 secs
lola: sara is running 10 secs || 2310690 markings, 6766875 edges, 129129 markings/sec, 10 secs
lola: sara is running 15 secs || 2892122 markings, 9281620 edges, 116286 markings/sec, 15 secs
lola: sara is running 20 secs || 3473030 markings, 11984551 edges, 116182 markings/sec, 20 secs
lola: sara is running 25 secs || 3945653 markings, 15093204 edges, 94525 markings/sec, 25 secs
lola: sara is running 30 secs || 4041041 markings, 18650656 edges, 19078 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4100047 markings, 22103680 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((MAX_equals_1 <= 0) AND (SOS_equals_0 + 1 <= MAP3K1_3_equals_1)) OR (RAS_equals_1 <= GAB1_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 ((((MAX_equals_1 <= 0) AND (SOS_equals_0 + 1 <= MAP3K1_3_equals_1)) OR (RAS_equals_1 <= GAB1_equals_1))))
lola: processed formula length: 111
lola: 20 rewrites
lola: closed formula file MAPKbis-PT-5320-ReachabilityCardinality.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 <= MAX_equals_1) OR (MAP3K1_3_equals_1 <= SOS_equals_0)) AND (GAB1_equals_1 + 1 <= RAS_equals_1))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-ReachabilityCardinality-14-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: 1 markings, 0 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((MDM2_equals_1 <= PKC_equals_0)) AND (ATF2_equals_0 <= SOS_equals_1) AND (MAP3K1_3_equals_0 + 1 <= GAB1_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 ((((MDM2_equals_1 <= PKC_equals_0)) AND (ATF2_equals_0 <= SOS_equals_1) AND (MAP3K1_3_equals_0 + 1 <= GAB1_equals_0))))
lola: processed formula length: 124
lola: 19 rewrites
lola: closed formula file MAPKbis-PT-5320-ReachabilityCardinality.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: (((MDM2_equals_1 <= PKC_equals_0)) AND (ATF2_equals_0 <= SOS_equals_1) AND (MAP3K1_3_equals_0 + 1 <= GAB1_equals_0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-ReachabilityCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 1973)
lola: sara is running 0 secs || 737018 markings, 2419204 edges, 147404 markings/sec, 0 secs
lola: sara is running 5 secs || 1323528 markings, 4917658 edges, 117302 markings/sec, 5 secs
lola: sara is running 10 secs || 1792165 markings, 8037674 edges, 93727 markings/sec, 10 secs
lola: sara is running 15 secs || 1979639 markings, 11902210 edges, 37495 markings/sec, 15 secs
lola: sara is running 20 secs || 2605623 markings, 14124296 edges, 125197 markings/sec, 20 secs
lola: sara is running 25 secs || 3130369 markings, 16651710 edges, 104949 markings/sec, 25 secs
lola: sara is running 30 secs || 3538332 markings, 19806953 edges, 81593 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3538945 markings, 22931185 edges

FORMULA MAPKbis-PT-5320-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no yes no no no yes yes yes yes no yes no no
lola:
preliminary result: no yes yes no yes no no no yes yes yes yes no yes no no
lola: memory consumption: 178176 KB
lola: time consumption: 226 seconds
lola: ========================================
sara: warning, failure of lp_solve (at job 193125)

BK_STOP 1527792139591

--------------------
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="MAPKbis-PT-5320"
export BK_EXAMINATION="ReachabilityCardinality"
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/MAPKbis-PT-5320.tgz
mv MAPKbis-PT-5320 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 MAPKbis-PT-5320, examination is ReachabilityCardinality"
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-152749169800304"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;