fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r099-smll-155246598400101
Last Updated
Apr 15, 2019

About the Execution of 2018-Gold for MAPK-PT-00640

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.040 550319.00 525681.00 5834.50 FTFFTT?TF?FFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r099-smll-155246598400101.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is MAPK-PT-00640, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r099-smll-155246598400101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.9K Feb 11 22:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 11 22:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 7 23:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 7 23:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 95 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 333 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 4 06:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 06:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Jan 31 23:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Jan 31 23:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:21 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 25K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552797400844

info: Time: 3600 - MCC
===========================================================================================
prep: translating MAPK-PT-00640 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating MAPK-PT-00640 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ MAPK-PT-00640 @ 3569 seconds
lola: LoLA will run for 3569 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--LTLCardinality.task
lola: LP says that atomic proposition is always true: (MEK_RafP <= Phase2)
lola: LP says that atomic proposition is always true: (MEKP_RafP <= Phase2)
lola: A ((3 <= ERKPP)) : A ((G (F ((2 <= MEK_RafP))) U (RafP_Phase1 <= MEKP_RafP))) : A (F ((ERK <= MEKPP))) : A ((2 <= RafP_Phase1)) : A (F (F ((2 <= RasGTP)))) : A (((TRUE U (1 <= MEKPP_Phase2)) U F (X ((2 <= Phase3))))) : A (G (X ((3 <= Phase1)))) : A ((Raf_RasGTP <= MEKPP)) : A (F (F (F (G ((ERK_MEKPP <= Raf_RasGTP)))))) : A (X ((X ((2 <= ERK_MEKPP)) U G ((1 <= Raf))))) : A (X (G ((2 <= MEKPP)))) : A ((X (G ((3 <= MEKP_Phase2))) U (TRUE U (1 <= ERKPP)))) : A (G (F (((Raf <= RafP) U (3 <= RafP_Phase1))))) : A (G ((MEK <= ERKP))) : A ((((ERK <= ERKP) U (Phase1 <= MEK_RafP)) U F (G ((3 <= MEKP))))) : A (G ((2 <= RasGTP)))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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 <= ERKPP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= ERKPP)
lola: processed formula length: 12
lola: 16 rewrites
lola: closed formula file MAPK-PT--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--LTLCardinality-0 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: (2 <= RafP_Phase1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= RafP_Phase1)
lola: processed formula length: 18
lola: 16 rewrites
lola: closed formula file MAPK-PT--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--LTLCardinality-3 FALSE 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: (Raf_RasGTP <= MEKPP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Raf_RasGTP <= MEKPP)
lola: processed formula length: 21
lola: 16 rewrites
lola: closed formula file MAPK-PT--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--LTLCardinality-7 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: 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: 16 rewrites
lola: closed formula file MAPK-PT--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: 2339312 markings, 5838737 edges, 467862 markings/sec, 0 secs
lola: 4848745 markings, 12149953 edges, 501887 markings/sec, 5 secs
lola: 7395076 markings, 18608556 edges, 509266 markings/sec, 10 secs
lola: 9857970 markings, 24757766 edges, 492579 markings/sec, 15 secs
lola: 12067656 markings, 30274518 edges, 441937 markings/sec, 20 secs
lola: 14495835 markings, 36333444 edges, 485636 markings/sec, 25 secs
lola: 16778259 markings, 42029619 edges, 456485 markings/sec, 30 secs
lola: 18945925 markings, 47440529 edges, 433533 markings/sec, 35 secs
lola: 21453980 markings, 53701625 edges, 501611 markings/sec, 40 secs
lola: 23812691 markings, 59608496 edges, 471742 markings/sec, 45 secs
lola: 26261679 markings, 65754959 edges, 489798 markings/sec, 50 secs
lola: 28453618 markings, 71224713 edges, 438388 markings/sec, 55 secs
lola: 30668818 markings, 76751420 edges, 443040 markings/sec, 60 secs
lola: 32944519 markings, 82432689 edges, 455140 markings/sec, 65 secs
lola: 35488289 markings, 88791967 edges, 508754 markings/sec, 70 secs
lola: 37685301 markings, 94369186 edges, 439402 markings/sec, 75 secs
lola: 39889583 markings, 99871911 edges, 440856 markings/sec, 80 secs
lola: 41964223 markings, 105101881 edges, 414928 markings/sec, 85 secs
lola: 44188602 markings, 110760227 edges, 444876 markings/sec, 90 secs
lola: 46632695 markings, 116862792 edges, 488819 markings/sec, 95 secs
lola: 48817303 markings, 122418639 edges, 436922 markings/sec, 100 secs
lola: 51157186 markings, 128310554 edges, 467977 markings/sec, 105 secs
lola: 53579133 markings, 134355760 edges, 484389 markings/sec, 110 secs
lola: 55775633 markings, 139840395 edges, 439300 markings/sec, 115 secs
lola: 58164166 markings, 145802814 edges, 477707 markings/sec, 120 secs
lola: 60601164 markings, 151938292 edges, 487400 markings/sec, 125 secs
lola: 62999834 markings, 157923992 edges, 479734 markings/sec, 130 secs
lola: 65474159 markings, 164102908 edges, 494865 markings/sec, 135 secs
lola: 67738964 markings, 169756084 edges, 452961 markings/sec, 140 secs
lola: 69975619 markings, 175339590 edges, 447331 markings/sec, 145 secs
lola: 72251311 markings, 181018572 edges, 455138 markings/sec, 150 secs
lola: 74475690 markings, 186572287 edges, 444876 markings/sec, 155 secs
lola: 76600060 markings, 191876933 edges, 424874 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((1 <= MEKPP_Phase2)) U X (F ((2 <= Phase3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((1 <= MEKPP_Phase2)) U X (F ((2 <= Phase3)))))
lola: processed formula length: 53
lola: 16 rewrites
lola: closed formula file MAPK-PT--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: 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: 3 markings, 2 edges
lola: ========================================

FORMULA MAPK-PT--LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((2 <= ERK_MEKPP)) U G ((1 <= Raf)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((2 <= ERK_MEKPP)) U G ((1 <= Raf)))))
lola: processed formula length: 47
lola: 16 rewrites
lola: closed formula file MAPK-PT--LTLCardinality.task
lola: the resulting Büchi automaton has 7 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: 2357734 markings, 5985004 edges, 471547 markings/sec, 0 secs
lola: 4949745 markings, 12456138 edges, 518402 markings/sec, 5 secs
lola: 7300817 markings, 18324077 edges, 470214 markings/sec, 10 secs
lola: 9416016 markings, 23708067 edges, 423040 markings/sec, 15 secs
lola: 11927307 markings, 29977246 edges, 502258 markings/sec, 20 secs
lola: 14239823 markings, 35797213 edges, 462503 markings/sec, 25 secs
lola: 16516383 markings, 41480940 edges, 455312 markings/sec, 30 secs
lola: 18814782 markings, 47220232 edges, 459680 markings/sec, 35 secs
lola: 21182825 markings, 53131644 edges, 473609 markings/sec, 40 secs
lola: 23362749 markings, 58574460 edges, 435985 markings/sec, 45 secs
lola: 25508557 markings, 63927133 edges, 429162 markings/sec, 50 secs
lola: 27611759 markings, 69177030 edges, 420640 markings/sec, 55 secs
lola: 29981281 markings, 75094690 edges, 473904 markings/sec, 60 secs
lola: 32159506 markings, 80530061 edges, 435645 markings/sec, 65 secs
lola: 34332783 markings, 85956198 edges, 434655 markings/sec, 70 secs
lola: 36352096 markings, 90995631 edges, 403863 markings/sec, 75 secs
lola: 38558050 markings, 96500706 edges, 441191 markings/sec, 80 secs
lola: 40990642 markings, 102575143 edges, 486518 markings/sec, 85 secs
lola: 43316012 markings, 108380037 edges, 465074 markings/sec, 90 secs
lola: 45486168 markings, 113798704 edges, 434031 markings/sec, 95 secs
lola: 47748390 markings, 119444930 edges, 452444 markings/sec, 100 secs
lola: 50129437 markings, 125439648 edges, 476209 markings/sec, 105 secs
lola: 52379827 markings, 131057604 edges, 450078 markings/sec, 110 secs
lola: 54445683 markings, 136265766 edges, 413171 markings/sec, 115 secs
lola: 56610575 markings, 141775146 edges, 432978 markings/sec, 120 secs
lola: 59032824 markings, 147821981 edges, 484450 markings/sec, 125 secs
lola: 61129032 markings, 153053738 edges, 419242 markings/sec, 130 secs
lola: 63249554 markings, 158344521 edges, 424104 markings/sec, 135 secs
lola: 65522276 markings, 164018485 edges, 454544 markings/sec, 140 secs
lola: 67602097 markings, 169211776 edges, 415964 markings/sec, 145 secs
lola: 69657509 markings, 174342164 edges, 411082 markings/sec, 150 secs
lola: 71686290 markings, 179406746 edges, 405756 markings/sec, 155 secs
lola: 73676507 markings, 184373239 edges, 398043 markings/sec, 160 secs
lola: 75963220 markings, 190081341 edges, 457343 markings/sec, 165 secs
lola: 76486318 markings, 191388022 edges, 104620 markings/sec, 170 secs
lola: 76512876 markings, 191454457 edges, 5312 markings/sec, 175 secs
lola: 76516729 markings, 191464103 edges, 771 markings/sec, 180 secs
lola: 76520416 markings, 191473271 edges, 737 markings/sec, 185 secs
lola: 76526730 markings, 191489066 edges, 1263 markings/sec, 190 secs
lola: 76543894 markings, 191532019 edges, 3433 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((2 <= MEKPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((2 <= MEKPP))))
lola: processed formula length: 24
lola: 16 rewrites
lola: closed formula file MAPK-PT--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: 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--LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= RasGTP)))
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 ((2 <= RasGTP)))
lola: processed formula length: 21
lola: 18 rewrites
lola: closed formula file MAPK-PT--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: (RasGTP <= 1)
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: 160 markings, 159 edges
lola: ========================================

FORMULA MAPK-PT--LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 400 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((MEK <= ERKP)))
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 ((MEK <= ERKP)))
lola: processed formula length: 21
lola: 18 rewrites
lola: closed formula file MAPK-PT--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: (ERKP + 1 <= MEK)
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--LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 457 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= 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)
lola: processed formula length: 13
lola: 18 rewrites
lola: closed formula file MAPK-PT--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--LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= ERKPP)))
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: (ERKPP <= 0)
lola: processed formula length: 12
lola: 18 rewrites
lola: closed formula file MAPK-PT--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: 161 markings, 161 edges
lola: ========================================

FORMULA MAPK-PT--LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((ERK <= MEKPP)))
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: (MEKPP + 1 <= ERK)
lola: processed formula length: 18
lola: 18 rewrites
lola: closed formula file MAPK-PT--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: 161 markings, 161 edges
lola: ========================================

FORMULA MAPK-PT--LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 800 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= MEKP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= MEKP))))
lola: processed formula length: 23
lola: 16 rewrites
lola: closed formula file MAPK-PT--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 1
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: 162 markings, 163 edges
lola: ========================================

FORMULA MAPK-PT--LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1067 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= RafP_Phase1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= RafP_Phase1))))
lola: processed formula length: 30
lola: 16 rewrites
lola: closed formula file MAPK-PT--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: 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: 161 markings, 161 edges
lola: ========================================

FORMULA MAPK-PT--LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1600 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((ERK_MEKPP <= Raf_RasGTP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((ERK_MEKPP <= Raf_RasGTP))))
lola: processed formula length: 37
lola: 16 rewrites
lola: closed formula file MAPK-PT--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 25
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: 86979 markings, 134587 edges
lola: ========================================

FORMULA MAPK-PT--LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3201 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((RafP_Phase1 <= MEKP_RafP) OR (G (F ((2 <= MEK_RafP))) AND F ((RafP_Phase1 <= MEKP_RafP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((RafP_Phase1 <= MEKP_RafP) OR (G (F ((2 <= MEK_RafP))) AND F ((RafP_Phase1 <= MEKP_RafP)))))
lola: processed formula length: 96
lola: 16 rewrites
lola: closed formula file MAPK-PT--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--LTLCardinality-1 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: 16 rewrites
lola: closed formula file MAPK-PT--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: 2595118 markings, 6477170 edges, 519024 markings/sec, 0 secs
lola: 5069582 markings, 12701738 edges, 494893 markings/sec, 5 secs
lola: 7542278 markings, 18976035 edges, 494539 markings/sec, 10 secs
lola: 9948413 markings, 24982728 edges, 481227 markings/sec, 15 secs
lola: 12144291 markings, 30465796 edges, 439176 markings/sec, 20 secs
lola: 14590439 markings, 36570105 edges, 489230 markings/sec, 25 secs
lola: 16881036 markings, 42286338 edges, 458119 markings/sec, 30 secs
lola: 19074447 markings, 47760645 edges, 438682 markings/sec, 35 secs
lola: 21594171 markings, 54051816 edges, 503945 markings/sec, 40 secs
lola: 23927046 markings, 59922884 edges, 466575 markings/sec, 45 secs
lola: 26415772 markings, 66139150 edges, 497745 markings/sec, 50 secs
lola: 28581406 markings, 71544083 edges, 433127 markings/sec, 55 secs
lola: 30828060 markings, 77149021 edges, 449331 markings/sec, 60 secs
lola: 33086285 markings, 82786607 edges, 451645 markings/sec, 65 secs
lola: 35612175 markings, 89132375 edges, 505178 markings/sec, 70 secs
lola: 37805379 markings, 94669075 edges, 438641 markings/sec, 75 secs
lola: 40001550 markings, 100151494 edges, 439234 markings/sec, 80 secs
lola: 42085960 markings, 105405971 edges, 416882 markings/sec, 85 secs
lola: 44347010 markings, 111154917 edges, 452210 markings/sec, 90 secs
lola: 46751474 markings, 117159796 edges, 480893 markings/sec, 95 secs
lola: 48917211 markings, 122668421 edges, 433147 markings/sec, 100 secs
lola: 51284498 markings, 128628607 edges, 473457 markings/sec, 105 secs
lola: 53690425 markings, 134633517 edges, 481185 markings/sec, 110 secs
lola: 55883225 markings, 140108403 edges, 438560 markings/sec, 115 secs
lola: 58297915 markings, 146138713 edges, 482938 markings/sec, 120 secs
lola: 60735243 markings, 152273520 edges, 487466 markings/sec, 125 secs
lola: 63128603 markings, 158245890 edges, 478672 markings/sec, 130 secs
lola: 65613325 markings, 164450901 edges, 496944 markings/sec, 135 secs
lola: 67866744 markings, 170074469 edges, 450684 markings/sec, 140 secs
lola: 70095786 markings, 175639904 edges, 445808 markings/sec, 145 secs
lola: 72408630 markings, 181411287 edges, 462569 markings/sec, 150 secs
lola: 74594275 markings, 186867597 edges, 437129 markings/sec, 155 secs
lola: 76719340 markings, 192173780 edges, 425013 markings/sec, 160 secs
lola: 76856896 markings, 192517317 edges, 27511 markings/sec, 165 secs
lola: 76886843 markings, 192592020 edges, 5989 markings/sec, 170 secs

BK_STOP 1552797951163

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

Killed

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-00640"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
echo " Input is MAPK-PT-00640, 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 r099-smll-155246598400101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-00640.tgz
mv MAPK-PT-00640 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;