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 200K
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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-320, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r256-csrt-152732582800055
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527429928584

info: Time: 3600 - MCC
===========================================================================================
prep: translating MAPK-PT-320 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating MAPK-PT-320 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ MAPK-PT-320 @ 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-320-LTLCardinality.task
lola: A (F ((X ((MEKPP_Phase2 <= MEKP)) U (3 <= ERKP_Phase3)))) : A ((G ((ERKP_Phase3 <= MEKP)) U G ((1 <= Phase2)))) : A (F ((G ((RafP <= Phase2)) U (ERKPP <= MEKP_Phase2)))) : A (F ((X ((3 <= ERK)) U F ((2 <= RafP_Phase1))))) : A ((3 <= RafP)) : A ((MEKP <= ERK)) : A (G (X (G ((3 <= Phase1))))) : A (F (X (X (X ((MEKPP <= Raf)))))) : A (X (X ((2 <= ERK_MEKPP)))) : A (((2 <= MEKPP_Phase2) U F (G ((ERKPP <= RafP_Phase1))))) : A ((G ((3 <= MEKP_Phase2)) U G (F ((3 <= ERKPP_Phase3))))) : A ((X (F ((ERKPP_Phase3 <= MEKP_RafP))) U (ERK <= MEK))) : A (F ((X ((ERK_MEKPP <= MEKP_Phase2)) U (ERKP_Phase3 <= RasGTP)))) : A (X ((F ((2 <= Phase1)) U X ((Raf <= RafP))))) : A (G ((1 <= MEKP_RafP))) : A ((F (G ((3 <= RafP))) U F (F ((RafP <= MEKPP)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= RafP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= RafP)
lola: processed formula length: 11
lola: 20 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.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: ========================================

FORMULA MAPK-PT-320-LTLCardinality-4 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: (MEKP <= ERK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MEKP <= ERK)
lola: processed formula length: 13
lola: 20 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.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: ========================================

FORMULA MAPK-PT-320-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((3 <= Phase1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((3 <= Phase1))))
lola: processed formula length: 25
lola: 20 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3250032 markings, 8136406 edges, 650006 markings/sec, 0 secs
lola: 6362282 markings, 15905242 edges, 622450 markings/sec, 5 secs
lola: 9387017 markings, 23468638 edges, 604947 markings/sec, 10 secs
lola: 12282145 markings, 30751918 edges, 579026 markings/sec, 15 secs
lola: 15368664 markings, 38470782 edges, 617304 markings/sec, 20 secs
lola: 18500282 markings, 46276570 edges, 626324 markings/sec, 25 secs
lola: 21379399 markings, 53456861 edges, 575823 markings/sec, 30 secs
lola: 24234107 markings, 60574692 edges, 570942 markings/sec, 35 secs
lola: 27137301 markings, 67811910 edges, 580639 markings/sec, 40 secs
lola: 29795047 markings, 74451608 edges, 531549 markings/sec, 45 secs
lola: 32326759 markings, 80765596 edges, 506342 markings/sec, 50 secs
lola: 35144843 markings, 87793431 edges, 563617 markings/sec, 55 secs
lola: 38125995 markings, 95222251 edges, 596230 markings/sec, 60 secs
lola: 41171940 markings, 102839472 edges, 609189 markings/sec, 65 secs
lola: 44145120 markings, 110247982 edges, 594636 markings/sec, 70 secs
lola: 47055743 markings, 117502736 edges, 582125 markings/sec, 75 secs
lola: 49872999 markings, 124525140 edges, 563451 markings/sec, 80 secs
lola: 52840474 markings, 131922044 edges, 593495 markings/sec, 85 secs
lola: 55510209 markings, 138577179 edges, 533947 markings/sec, 90 secs
lola: 58177978 markings, 145227687 edges, 533554 markings/sec, 95 secs
lola: 60654140 markings, 151400062 edges, 495232 markings/sec, 100 secs
lola: 63342246 markings, 158099954 edges, 537621 markings/sec, 105 secs
lola: 66248263 markings, 165357677 edges, 581203 markings/sec, 110 secs
lola: 68835734 markings, 171833447 edges, 517494 markings/sec, 115 secs
lola: 71390158 markings, 178253921 edges, 510885 markings/sec, 120 secs
lola: 74331090 markings, 185647311 edges, 588186 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((MEKPP <= Raf))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((MEKPP <= Raf))))))
lola: processed formula length: 34
lola: 20 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 10 markings, 11 edges
lola: ========================================

FORMULA MAPK-PT-320-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((2 <= ERK_MEKPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((2 <= ERK_MEKPP))))
lola: processed formula length: 28
lola: 20 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================

FORMULA MAPK-PT-320-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((ERKPP_Phase3 <= MEKP_RafP))) U (ERK <= MEK)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((ERKPP_Phase3 <= MEKP_RafP))) U (ERK <= MEK)))
lola: processed formula length: 56
lola: 20 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 12 edges
lola: ========================================

FORMULA MAPK-PT-320-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((2 <= Phase1)) U X ((Raf <= RafP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((2 <= Phase1)) U X ((Raf <= RafP)))))
lola: processed formula length: 47
lola: 20 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================

FORMULA MAPK-PT-320-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= MEKP_RafP)))
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 <= MEKP_RafP)))
lola: processed formula length: 24
lola: 22 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.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: (MEKP_RafP <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA MAPK-PT-320-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= ERKP_Phase3)))
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: (ERKP_Phase3 <= 2)
lola: processed formula length: 18
lola: 22 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.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: 81 markings, 81 edges
lola: ========================================

FORMULA MAPK-PT-320-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= RafP_Phase1)))
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: (RafP_Phase1 <= 1)
lola: processed formula length: 18
lola: 22 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.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: 81 markings, 81 edges
lola: ========================================

FORMULA MAPK-PT-320-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((ERKP_Phase3 <= RasGTP)))
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: (RasGTP + 1 <= ERKP_Phase3)
lola: processed formula length: 27
lola: 22 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.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 eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA MAPK-PT-320-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((ERKPP <= RafP_Phase1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((ERKPP <= RafP_Phase1))))
lola: processed formula length: 34
lola: 20 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 28
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 741 markings, 1074 edges
lola: ========================================

FORMULA MAPK-PT-320-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 859 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((3 <= ERKPP_Phase3))) OR G (((3 <= MEKP_Phase2) AND F ((3 <= ERKPP_Phase3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((3 <= ERKPP_Phase3))) OR G (((3 <= MEKP_Phase2) AND F ((3 <= ERKPP_Phase3))))))
lola: processed formula length: 89
lola: 20 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 81 markings, 81 edges
lola: ========================================

FORMULA MAPK-PT-320-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1145 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((RafP <= MEKPP)) OR (F ((RafP <= MEKPP)) AND F (G ((3 <= RafP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((RafP <= MEKPP)) OR (F ((RafP <= MEKPP)) AND F (G ((3 <= RafP))))))
lola: processed formula length: 74
lola: 20 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA MAPK-PT-320-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1718 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((1 <= Phase2)) OR (G ((ERKP_Phase3 <= MEKP)) AND F (G ((1 <= Phase2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((1 <= Phase2)) OR (G ((ERKP_Phase3 <= MEKP)) AND F (G ((1 <= Phase2))))))
lola: processed formula length: 80
lola: 20 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 3461225 markings, 7384004 edges, 692245 markings/sec, 0 secs
lola: 6648812 markings, 14197103 edges, 637517 markings/sec, 5 secs
lola: 9783917 markings, 20907120 edges, 627021 markings/sec, 10 secs
lola: 12752893 markings, 27250668 edges, 593795 markings/sec, 15 secs
lola: 15759762 markings, 33680429 edges, 601374 markings/sec, 20 secs
lola: 18742453 markings, 40082739 edges, 596538 markings/sec, 25 secs
lola: 21688359 markings, 46400920 edges, 589181 markings/sec, 30 secs
lola: 24678934 markings, 52789371 edges, 598115 markings/sec, 35 secs
lola: 27691652 markings, 59242885 edges, 602544 markings/sec, 40 secs
lola: 30617746 markings, 65506908 edges, 585219 markings/sec, 45 secs
lola: 33539956 markings, 71763629 edges, 584442 markings/sec, 50 secs
lola: 36409502 markings, 77885423 edges, 573909 markings/sec, 55 secs
lola: 39282938 markings, 84031112 edges, 574687 markings/sec, 60 secs
lola: 41992311 markings, 89834319 edges, 541875 markings/sec, 65 secs
lola: 44634598 markings, 95509247 edges, 528457 markings/sec, 70 secs
lola: 47209794 markings, 101031951 edges, 515039 markings/sec, 75 secs
lola: 49898738 markings, 106777624 edges, 537789 markings/sec, 80 secs
lola: 52634212 markings, 112637577 edges, 547095 markings/sec, 85 secs
lola: 55390044 markings, 118548095 edges, 551166 markings/sec, 90 secs
lola: 58179990 markings, 124534182 edges, 557989 markings/sec, 95 secs
lola: 60901460 markings, 130346966 edges, 544294 markings/sec, 100 secs
lola: 63568078 markings, 136047781 edges, 533324 markings/sec, 105 secs
lola: 66272234 markings, 141832145 edges, 540831 markings/sec, 110 secs
lola: 68856992 markings, 147368280 edges, 516952 markings/sec, 115 secs
lola: 71490123 markings, 153016868 edges, 526626 markings/sec, 120 secs
lola: 74165553 markings, 158758417 edges, 535086 markings/sec, 125 secs
lola: 76830426 markings, 164469623 edges, 532975 markings/sec, 130 secs
lola: 79495961 markings, 170176155 edges, 533107 markings/sec, 135 secs
lola: 82166540 markings, 175924031 edges, 534116 markings/sec, 140 secs
lola: 84807991 markings, 181564212 edges, 528290 markings/sec, 145 secs
lola: 87296514 markings, 186889032 edges, 497705 markings/sec, 150 secs
lola: 89774007 markings, 192201916 edges, 495499 markings/sec, 155 secs
lola: 92336611 markings, 197689829 edges, 512521 markings/sec, 160 secs
lola: 94992849 markings, 203368240 edges, 531248 markings/sec, 165 secs
lola: 96162405 markings, 205878303 edges, 233911 markings/sec, 170 secs
lola: 96205002 markings, 205970439 edges, 8519 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((ERKPP <= MEKP_Phase2) OR (G ((RafP <= Phase2)) AND F ((ERKPP <= MEKP_Phase2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((ERKPP <= MEKP_Phase2) OR (G ((RafP <= Phase2)) AND F ((ERKPP <= MEKP_Phase2))))))
lola: processed formula length: 89
lola: 20 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola:
========================================
FORMULA MAPK-PT-320-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (G ((3 <= Phase1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((3 <= Phase1))))
lola: processed formula length: 25
lola: 20 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3381415 markings, 8463059 edges, 676283 markings/sec, 0 secs
lola: 6559896 markings, 16398653 edges, 635696 markings/sec, 5 secs
lola: 9651268 markings, 24127200 edges, 618274 markings/sec, 10 secs
lola: 12658614 markings, 31703095 edges, 601469 markings/sec, 15 secs
lola: 15856518 markings, 39686627 edges, 639581 markings/sec, 20 secs
lola: 18911105 markings, 47300416 edges, 610917 markings/sec, 25 secs
lola: 21566063 markings, 53920968 edges, 530992 markings/sec, 30 secs
lola: 24252509 markings, 60620666 edges, 537289 markings/sec, 35 secs
lola: 26934562 markings, 67306093 edges, 536411 markings/sec, 40 secs
lola: 29848332 markings, 74584604 edges, 582754 markings/sec, 45 secs
lola: 32606279 markings, 81463145 edges, 551589 markings/sec, 50 secs
lola: 35469591 markings, 88603213 edges, 572662 markings/sec, 55 secs
lola: 38479699 markings, 96103772 edges, 602022 markings/sec, 60 secs
lola: 41652983 markings, 104037041 edges, 634657 markings/sec, 65 secs
lola: 44427054 markings, 110951818 edges, 554814 markings/sec, 70 secs
lola: 47139826 markings, 117712485 edges, 542554 markings/sec, 75 secs
lola: 49697366 markings, 124088263 edges, 511508 markings/sec, 80 secs
lola: 52510176 markings, 131097955 edges, 562562 markings/sec, 85 secs
lola: 55009475 markings, 137329196 edges, 499860 markings/sec, 90 secs
lola: 57498065 markings, 143532546 edges, 497718 markings/sec, 95 secs
lola: 59973938 markings, 149706255 edges, 495175 markings/sec, 100 secs
lola: 62457107 markings, 155892287 edges, 496634 markings/sec, 105 secs
lola: 65265899 markings, 162908398 edges, 561758 markings/sec, 110 secs
lola: 67894113 markings, 169486418 edges, 525643 markings/sec, 115 secs
lola: 70530535 markings, 176111905 edges, 527284 markings/sec, 120 secs
lola: 73211360 markings, 182829929 edges, 536165 markings/sec, 125 secs
lola: lola: Child process aborted or communication problem between parent and child process

FORMULA MAPK-PT-320-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A ((G ((1 <= Phase2)) OR (G ((ERKP_Phase3 <= MEKP)) AND F (G ((1 <= Phase2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((1 <= Phase2)) OR (G ((ERKP_Phase3 <= MEKP)) AND F (G ((1 <= Phase2))))))
lola: processed formula length: 80
lola: 20 rewrites
lola: closed formula file MAPK-PT-320-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 3200403 markings, 6827473 edges, 640081 markings/sec, 0 secs
lola: 6290570 markings, 13429800 edges, 618033 markings/sec, 5 secs
lola: 9161329 markings, 19577909 edges, 574152 markings/sec, 10 secs
lola: 11923994 markings, 25486051 edges, 552533 markings/sec, 15 secs
lola: 14663850 markings, 31333549 edges, 547971 markings/sec, 20 secs
lola: 17381778 markings, 37160421 edges, 543586 markings/sec, 25 secs
lola: 20085497 markings, 42960949 edges, 540744 markings/sec, 30 secs
lola: 22847900 markings, 48879783 edges, 552481 markings/sec, 35 secs
lola: 25729780 markings, 55032543 edges, 576376 markings/sec, 40 secs
lola: 28599999 markings, 61194625 edges, 574044 markings/sec, 45 secs
lola: 31445764 markings, 67272706 edges, 569153 markings/sec, 50 secs
lola: 34239691 markings, 73257207 edges, 558785 markings/sec, 55 secs
lola: 37045598 markings, 79250441 edges, 561181 markings/sec, 60 secs
lola: 39855081 markings, 85250502 edges, 561897 markings/sec, 65 secs
lola: 42672780 markings, 91293604 edges, 563540 markings/sec, 70 secs
lola: 45509384 markings, 97386707 edges, 567321 markings/sec, 75 secs
lola: 48292229 markings, 103354402 edges, 556569 markings/sec, 80 secs
lola: 51102372 markings, 109358537 edges, 562029 markings/sec, 85 secs
lola: 53841579 markings, 115233675 edges, 547841 markings/sec, 90 secs
lola: 56660968 markings, 121273832 edges, 563878 markings/sec, 95 secs
lola: 59401043 markings, 127148127 edges, 548015 markings/sec, 100 secs
lola: 62101137 markings, 132898865 edges, 540019 markings/sec, 105 secs
lola: 64817189 markings, 138712859 edges, 543210 markings/sec, 110 secs
lola: 67575503 markings, 144617358 edges, 551663 markings/sec, 115 secs
lola: 70298470 markings, 150466217 edges, 544593 markings/sec, 120 secs
lola: 73000722 markings, 156264520 edges, 540450 markings/sec, 125 secs
lola: 75759139 markings, 162179789 edges, 551683 markings/sec, 130 secs
lola: 78475986 markings, 167977691 edges, 543369 markings/sec, 135 secs
lola: 81159752 markings, 173751548 edges, 536753 markings/sec, 140 secs
lola: 83852339 markings, 179529254 edges, 538517 markings/sec, 145 secs
lola: 86464095 markings, 185107754 edges, 522351 markings/sec, 150 secs
lola: 88991767 markings, 190520442 edges, 505534 markings/sec, 155 secs
lola: 91532219 markings, 195969797 edges, 508090 markings/sec, 160 secs
lola: 94062016 markings, 201379115 edges, 505959 markings/sec, 165 secs
lola: 96179367 markings, 205914508 edges, 423470 markings/sec, 170 secs
lola: 96229671 markings, 206023276 edges, 10061 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA MAPK-PT-320-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no unknown yes no no yes unknown yes no no no no yes no no yes
lola:
preliminary result: no unknown yes no no yes unknown yes no no no no yes no no yes
lola: memory consumption: 17536 KB
lola: time consumption: 632 seconds

BK_STOP 1527430560663

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