About the Execution of LoLA for MAPK-PT-080
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.290 | 1208798.00 | 1142057.00 | 12708.30 | TFTTTTF?TTFF?FTT | 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 184K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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-080, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469100178
=====================================================================
--------------------
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-080-CTLCardinality-00
FORMULA_NAME MAPK-PT-080-CTLCardinality-01
FORMULA_NAME MAPK-PT-080-CTLCardinality-02
FORMULA_NAME MAPK-PT-080-CTLCardinality-03
FORMULA_NAME MAPK-PT-080-CTLCardinality-04
FORMULA_NAME MAPK-PT-080-CTLCardinality-05
FORMULA_NAME MAPK-PT-080-CTLCardinality-06
FORMULA_NAME MAPK-PT-080-CTLCardinality-07
FORMULA_NAME MAPK-PT-080-CTLCardinality-08
FORMULA_NAME MAPK-PT-080-CTLCardinality-09
FORMULA_NAME MAPK-PT-080-CTLCardinality-10
FORMULA_NAME MAPK-PT-080-CTLCardinality-11
FORMULA_NAME MAPK-PT-080-CTLCardinality-12
FORMULA_NAME MAPK-PT-080-CTLCardinality-13
FORMULA_NAME MAPK-PT-080-CTLCardinality-14
FORMULA_NAME MAPK-PT-080-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527020247497
info: Time: 3600 - MCC
===========================================================================================
prep: translating MAPK-PT-080 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating MAPK-PT-080 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ MAPK-PT-080 @ 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-080-CTLCardinality.task
lola: always true
lola: always true
lola: always true
lola: LP says that atomic proposition is always true: (ERKP_MEKPP <= Phase3)
lola: E (((((1 <= RafP_Phase1) OR (3 <= Raf)) AND ((2 <= MEK) OR (MEKP_RafP <= ERKP_Phase3))) U ((MEKP_RafP <= ERKP) AND (1 <= MEKP_RafP) AND (RasGTP + 1 <= RafP)))) : A (G ((1 <= RasGTP))) : E (F ((RasGTP <= RafP))) : A (X ((((ERKP_MEKPP <= 1)) AND E (F ((3 <= ERKPP_Phase3)))))) : E (F ((E (X ((MEK <= MEKP_RafP))) AND (3 <= ERK)))) : E ((A (X ((MEKPP <= Phase3))) U ((1 <= ERKP_MEKPP) AND (1 <= RafP_Phase1) AND ((3 <= MEKP) OR (2 <= ERKP_Phase3))))) : E (G (A (G (((1 <= Raf)))))) : A (G ((A (F ((ERKP_Phase3 <= ERKP_MEKPP))) OR E (F ((1 <= RasGTP)))))) : (((A (F ((MEKPP <= Raf))) AND E (F ((3 <= Phase2)))) AND NOT(A (G ((3 <= Phase2))))) OR (NOT(E (G (TRUE))) OR (((ERKPP_Phase3 + 1 <= ERKP)) AND E (F ((MEKP_Phase2 <= RasGTP)))))) : NOT(NOT((E (F ((MEK <= ERKP_MEKPP))) OR (Phase3 <= 2)))) : A (G (((MEK <= Phase3) OR (RasGTP + 1 <= RafP_Phase1)))) : A (G (E (G (((MEK <= MEKP) OR (2 <= RasGTP)))))) : A (G (E (X (((ERK_MEKPP <= MEK) OR (RafP_Phase1 <= ERK_MEKPP)))))) : (NOT(NOT(A (G ((ERKP_Phase3 <= ERK))))) AND (ERKPP <= ERK_MEKPP)) : (((MEKP_RafP <= 1) AND E (F ((2 <= ERKPP)))) AND (ERKP_Phase3 <= ERK)) : (E (F (E (G ((2 <= ERK_MEKPP))))) AND ((ERKP <= Raf) OR (2 <= RasGTP) OR (MEKPP <= Phase3) OR (1 <= ERK_MEKPP)))
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((ERKP_MEKPP <= 1)))) AND A (X (E (F ((3 <= ERKPP_Phase3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((ERKP_MEKPP <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(((ERKP_MEKPP <= 1)))
lola: processed formula length: 23
lola: 30 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((3 <= ERKPP_Phase3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(TRUE U (3 <= ERKPP_Phase3)))
lola: processed formula length: 33
lola: 31 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2882663 markings, 7136262 edges, 576533 markings/sec, 0 secs
lola: 5801062 markings, 14357900 edges, 583680 markings/sec, 5 secs
lola: 8750983 markings, 21646877 edges, 589984 markings/sec, 10 secs
lola: 11599862 markings, 28686733 edges, 569776 markings/sec, 15 secs
lola: 14247720 markings, 35234466 edges, 529572 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14247720 markings, 35234466 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
FORMULA MAPK-PT-080-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (X ((MEK <= MEKP_RafP))) AND (3 <= ERK))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (EX((MEK <= MEKP_RafP)) AND (3 <= ERK)))
lola: processed formula length: 49
lola: 31 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1563 markings, 3823 edges
lola: ========================================
FORMULA MAPK-PT-080-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (X ((MEKPP <= Phase3))) U ((1 <= ERKP_MEKPP) AND (1 <= RafP_Phase1) AND ((3 <= MEKP) OR (2 <= ERKP_Phase3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(AX((MEKPP <= Phase3)) U ((1 <= ERKP_MEKPP) AND (1 <= RafP_Phase1) AND ((3 <= MEKP) OR (2 <= ERKP_Phase3))))
lola: processed formula length: 110
lola: 31 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 53429 markings, 132406 edges
lola: ========================================
FORMULA MAPK-PT-080-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((ERK_MEKPP <= MEK) OR (RafP_Phase1 <= ERK_MEKPP))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX(((ERK_MEKPP <= MEK) OR (RafP_Phase1 <= ERK_MEKPP))))))
lola: processed formula length: 75
lola: 31 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2751804 markings, 6812988 edges, 550361 markings/sec, 0 secs
lola: 5514050 markings, 13648151 edges, 552449 markings/sec, 5 secs
lola: 8244551 markings, 20394581 edges, 546100 markings/sec, 10 secs
lola: 10947551 markings, 27075355 edges, 540600 markings/sec, 15 secs
lola: 13525260 markings, 33446088 edges, 515542 markings/sec, 20 secs
lola: 16176160 markings, 40007451 edges, 530180 markings/sec, 25 secs
lola: 18744852 markings, 46363088 edges, 513738 markings/sec, 30 secs
lola: 21267904 markings, 52603654 edges, 504610 markings/sec, 35 secs
lola: 23581226 markings, 58319603 edges, 462664 markings/sec, 40 secs
lola: 25945976 markings, 64164819 edges, 472950 markings/sec, 45 secs
lola: 28324722 markings, 70043631 edges, 475749 markings/sec, 50 secs
lola: 30786703 markings, 76125530 edges, 492396 markings/sec, 55 secs
lola: 33329079 markings, 82407874 edges, 508475 markings/sec, 60 secs
lola: 35768027 markings, 88435895 edges, 487790 markings/sec, 65 secs
lola: 38249994 markings, 94570855 edges, 496393 markings/sec, 70 secs
lola: 40722808 markings, 100683095 edges, 494563 markings/sec, 75 secs
lola: 43136221 markings, 106644919 edges, 482683 markings/sec, 80 secs
lola: 45581831 markings, 112687514 edges, 489122 markings/sec, 85 secs
lola: 48051940 markings, 118944783 edges, 494022 markings/sec, 90 secs
lola: 50624920 markings, 125302357 edges, 514596 markings/sec, 95 secs
lola: 53038865 markings, 131266061 edges, 482789 markings/sec, 100 secs
lola: 55551174 markings, 137476552 edges, 502462 markings/sec, 105 secs
lola: 57791225 markings, 143013075 edges, 448010 markings/sec, 110 secs
lola: 60008113 markings, 148489603 edges, 443378 markings/sec, 115 secs
lola: 62381886 markings, 154365639 edges, 474755 markings/sec, 120 secs
lola: 64702170 markings, 160103813 edges, 464057 markings/sec, 125 secs
lola: 64914001 markings, 160627999 edges, 42366 markings/sec, 130 secs
lola: 64931509 markings, 160671112 edges, 3502 markings/sec, 135 secs
lola: 64937945 markings, 160686856 edges, 1287 markings/sec, 140 secs
lola: 64947794 markings, 160711227 edges, 1970 markings/sec, 145 secs
lola: 64953047 markings, 160724325 edges, 1051 markings/sec, 150 secs
lola: 64960243 markings, 160742291 edges, 1439 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Raf))))
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 <= Raf))))
lola: processed formula length: 20
lola: 31 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((Raf <= 0))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-080-CTLCardinality-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 141 markings, 200 edges
lola: ========================================
FORMULA MAPK-PT-080-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= 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 ((1 <= RasGTP)))
lola: processed formula length: 21
lola: 31 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (RasGTP <= 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: 21 markings, 20 edges
lola: ========================================
FORMULA MAPK-PT-080-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((RasGTP <= RafP)))
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 ((RasGTP <= RafP)))
lola: processed formula length: 24
lola: 30 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (RasGTP <= RafP)
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 reachable.
lola: 21 markings, 20 edges
lola: ========================================
FORMULA MAPK-PT-080-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((MEK <= MEKP) OR (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 (((MEK <= MEKP) OR (2 <= RasGTP))))
lola: processed formula length: 41
lola: 31 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((MEKP + 1 <= MEK) AND (RasGTP <= 1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
FORMULA MAPK-PT-080-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((MEK <= Phase3) OR (RasGTP + 1 <= RafP_Phase1))))
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 <= Phase3) OR (RasGTP + 1 <= RafP_Phase1))))
lola: processed formula length: 57
lola: 31 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((Phase3 + 1 <= MEK) AND (RafP_Phase1 <= RasGTP))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-080-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-080-CTLCardinality-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 41693 markings, 77541 edges
lola: ========================================
FORMULA MAPK-PT-080-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((ERKP_Phase3 <= ERKP_MEKPP))) OR E (F ((1 <= RasGTP))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U (ERKP_Phase3 <= ERKP_MEKPP))) AND NOT(E(TRUE U (1 <= RasGTP))))))
lola: processed formula length: 92
lola: 33 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1463702 markings, 7924773 edges, 292740 markings/sec, 0 secs
lola: 2891401 markings, 15705876 edges, 285540 markings/sec, 5 secs
lola: 4296700 markings, 23381257 edges, 281060 markings/sec, 10 secs
lola: 5711312 markings, 31066660 edges, 282922 markings/sec, 15 secs
lola: 7040810 markings, 38316696 edges, 265900 markings/sec, 20 secs
lola: 8437382 markings, 45941647 edges, 279314 markings/sec, 25 secs
lola: 9815884 markings, 53466164 edges, 275700 markings/sec, 30 secs
lola: 11172609 markings, 60872959 edges, 271345 markings/sec, 35 secs
lola: 12477024 markings, 67995251 edges, 260883 markings/sec, 40 secs
lola: 13779591 markings, 75091264 edges, 260513 markings/sec, 45 secs
lola: 15069899 markings, 82094819 edges, 258062 markings/sec, 50 secs
lola: 16353924 markings, 89103407 edges, 256805 markings/sec, 55 secs
lola: 17571549 markings, 95744618 edges, 243525 markings/sec, 60 secs
lola: 18784930 markings, 102371103 edges, 242676 markings/sec, 65 secs
lola: 20006716 markings, 109031729 edges, 244357 markings/sec, 70 secs
lola: 21289819 markings, 116032422 edges, 256621 markings/sec, 75 secs
lola: 22539871 markings, 122858368 edges, 250010 markings/sec, 80 secs
lola: 23785348 markings, 129661927 edges, 249095 markings/sec, 85 secs
lola: 25158906 markings, 137150702 edges, 274712 markings/sec, 90 secs
lola: 26522893 markings, 144600379 edges, 272797 markings/sec, 95 secs
lola: 27874827 markings, 151983128 edges, 270387 markings/sec, 100 secs
lola: 29222205 markings, 159337600 edges, 269476 markings/sec, 105 secs
lola: 30523070 markings, 166437942 edges, 260173 markings/sec, 110 secs
lola: 31832791 markings, 173588318 edges, 261944 markings/sec, 115 secs
lola: 33200167 markings, 181044153 edges, 273475 markings/sec, 120 secs
lola: 34503628 markings, 188162361 edges, 260692 markings/sec, 125 secs
lola: 35757418 markings, 195010885 edges, 250758 markings/sec, 130 secs
lola: 37042897 markings, 202031489 edges, 257096 markings/sec, 135 secs
lola: 38377437 markings, 209303010 edges, 266908 markings/sec, 140 secs
lola: 39706843 markings, 216563917 edges, 265881 markings/sec, 145 secs
lola: 41064929 markings, 223978102 edges, 271617 markings/sec, 150 secs
lola: 42398716 markings, 231261079 edges, 266757 markings/sec, 155 secs
lola: 43703975 markings, 238382767 edges, 261052 markings/sec, 160 secs
lola: 45019604 markings, 245566125 edges, 263126 markings/sec, 165 secs
lola: 46443384 markings, 253326578 edges, 284756 markings/sec, 170 secs
lola: 47789531 markings, 260671064 edges, 269229 markings/sec, 175 secs
lola: 49252766 markings, 268702510 edges, 292647 markings/sec, 180 secs
lola: 50597519 markings, 276046392 edges, 268951 markings/sec, 185 secs
lola: 51884082 markings, 283073617 edges, 257313 markings/sec, 190 secs
lola: 53069904 markings, 289548365 edges, 237164 markings/sec, 195 secs
lola: 54287503 markings, 296196832 edges, 243520 markings/sec, 200 secs
lola: 55552616 markings, 303102319 edges, 253023 markings/sec, 205 secs
lola: 56885520 markings, 310380446 edges, 266581 markings/sec, 210 secs
lola: 58158329 markings, 317330215 edges, 254562 markings/sec, 215 secs
lola: 59451161 markings, 324389004 edges, 258566 markings/sec, 220 secs
lola: 60820787 markings, 331940006 edges, 273925 markings/sec, 225 secs
lola: 62171750 markings, 339293023 edges, 270193 markings/sec, 230 secs
lola: 63580843 markings, 346981104 edges, 281819 markings/sec, 235 secs
lola: 64923527 markings, 354315603 edges, 268537 markings/sec, 240 secs
lola: 66208693 markings, 361327801 edges, 257033 markings/sec, 245 secs
lola: 67529454 markings, 368525863 edges, 264152 markings/sec, 250 secs
lola: 68862436 markings, 375804219 edges, 266596 markings/sec, 255 secs
lola: 70197964 markings, 383098009 edges, 267106 markings/sec, 260 secs
lola: 71628142 markings, 390908340 edges, 286036 markings/sec, 265 secs
lola: 72939401 markings, 398067454 edges, 262252 markings/sec, 270 secs
lola: 74258608 markings, 405269177 edges, 263841 markings/sec, 275 secs
lola: 75634131 markings, 412781649 edges, 275105 markings/sec, 280 secs
lola: 76915673 markings, 419778625 edges, 256308 markings/sec, 285 secs
lola: 78229521 markings, 426950515 edges, 262770 markings/sec, 290 secs
lola: 79532630 markings, 434064317 edges, 260622 markings/sec, 295 secs
lola: 80816990 markings, 441076671 edges, 256872 markings/sec, 300 secs
lola: 82096081 markings, 448065857 edges, 255818 markings/sec, 305 secs
lola: 83406422 markings, 455217899 edges, 262068 markings/sec, 310 secs
lola: 84691936 markings, 462240574 edges, 257103 markings/sec, 315 secs
lola: 85975545 markings, 469246537 edges, 256722 markings/sec, 320 secs
lola: 87330358 markings, 476634407 edges, 270963 markings/sec, 325 secs
lola: 88722343 markings, 484236207 edges, 278397 markings/sec, 330 secs
lola: 90057029 markings, 491521801 edges, 266937 markings/sec, 335 secs
lola: 91022238 markings, 496794524 edges, 193042 markings/sec, 340 secs
lola: 91061526 markings, 497008793 edges, 7858 markings/sec, 345 secs
lola: 91067701 markings, 497042280 edges, 1235 markings/sec, 350 secs
lola: 91070505 markings, 497057602 edges, 561 markings/sec, 355 secs
lola: 91072634 markings, 497069264 edges, 426 markings/sec, 360 secs
lola: 91079218 markings, 497105292 edges, 1317 markings/sec, 365 secs
lola: 91093041 markings, 497181148 edges, 2765 markings/sec, 370 secs
lola: 91098761 markings, 497212297 edges, 1144 markings/sec, 375 secs
lola: 91104700 markings, 497244805 edges, 1188 markings/sec, 380 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((MEK <= ERKP_MEKPP))) OR (Phase3 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Phase3 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Phase3 <= 2)
lola: processed formula length: 13
lola: 29 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 598 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((MEK <= ERKP_MEKPP)))
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 ((MEK <= ERKP_MEKPP)))
lola: processed formula length: 27
lola: 30 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (MEK <= ERKP_MEKPP)
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 reachable.
lola: 82 markings, 120 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
FORMULA MAPK-PT-080-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 598 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((ERKP_Phase3 <= ERK))) AND (ERKPP <= ERK_MEKPP))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 598 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ERKPP <= ERK_MEKPP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ERKPP <= ERK_MEKPP)
lola: processed formula length: 20
lola: 29 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================lola:
subprocess 12 will run for 747 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ERKP_Phase3 <= ERK)))
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 ((ERKP_Phase3 <= ERK)))
lola: processed formula length: 28
lola: 31 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (ERK + 1 <= ERKP_Phase3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-080-CTLCardinality-12-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1644 markings, 3054 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA MAPK-PT-080-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 747 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((MEKP_RafP <= 1) AND (E (F ((2 <= ERKPP))) AND (ERKP_Phase3 <= ERK)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 747 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (MEKP_RafP <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MEKP_RafP <= 1)
lola: processed formula length: 16
lola: 29 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 997 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ERKP_Phase3 <= ERK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ERKP_Phase3 <= ERK)
lola: processed formula length: 20
lola: 29 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= ERKPP)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((2 <= ERKPP)))
lola: processed formula length: 20
lola: 30 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (2 <= ERKPP)
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 reachable.
lola: 17 markings, 22 edges
lola: state equation: write sara problem file to MAPK-PT-080-CTLCardinality-14-0.sara
lola: ========================================lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA MAPK-PT-080-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 997 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= RafP_Phase1) OR (3 <= Raf)) AND ((2 <= MEK) OR (MEKP_RafP <= ERKP_Phase3))) U ((MEKP_RafP <= ERKP) AND (1 <= MEKP_RafP) AND (RasGTP + 1 <= RafP))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((((1 <= RafP_Phase1) OR (3 <= Raf)) AND ((2 <= MEK) OR (MEKP_RafP <= ERKP_Phase3))) U ((MEKP_RafP <= ERKP) AND (1 <= MEKP_RafP) AND (RasGTP + 1 <= RafP))))
lola: processed formula length: 161
lola: 32 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((MEKP_RafP <= ERKP) AND (1 <= MEKP_RafP) AND (RasGTP + 1 <= RafP))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-080-CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-080-CTLCardinality-13-0.sara.
lola: state equation 0: solution produced
lola: sara is running 0 secs || 3096289 markings, 7663732 edges, 619258 markings/sec, 0 secs
lola: sara is running 5 secs || 6175748 markings, 15285120 edges, 615892 markings/sec, 5 secs
lola: sara is running 10 secs || 9224029 markings, 22815614 edges, 609656 markings/sec, 10 secs
lola: sara is running 15 secs || 12198057 markings, 30163586 edges, 594806 markings/sec, 15 secs
lola: sara is running 20 secs || 15127312 markings, 37414089 edges, 585851 markings/sec, 20 secs
lola: sara is running 25 secs || 18080773 markings, 44722651 edges, 590692 markings/sec, 25 secs
lola: sara is running 30 secs || 21059084 markings, 52087301 edges, 595662 markings/sec, 30 secs
lola: sara is running 35 secs || 23934027 markings, 59192150 edges, 574989 markings/sec, 35 secs
lola: sara is running 40 secs || 26879743 markings, 66471703 edges, 589143 markings/sec, 40 secs
lola: sara is running 45 secs || 29810465 markings, 73713175 edges, 586144 markings/sec, 45 secs
lola: sara is running 50 secs || 32770909 markings, 81029443 edges, 592089 markings/sec, 50 secs
lola: sara is running 55 secs || 35647751 markings, 88138606 edges, 575368 markings/sec, 55 secs
lola: sara is running 60 secs || 38549207 markings, 95310586 edges, 580291 markings/sec, 60 secs
lola: sara is running 65 secs || 41423811 markings, 102415080 edges, 574921 markings/sec, 65 secs
lola: sara is running 70 secs || 44274412 markings, 109456192 edges, 570120 markings/sec, 70 secs
lola: sara is running 75 secs || 47180161 markings, 116639471 edges, 581150 markings/sec, 75 secs
lola: sara is running 80 secs || 50060934 markings, 123908547 edges, 576155 markings/sec, 80 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 52826335 markings, 130749153 edges
lola: ========================================
FORMULA MAPK-PT-080-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1450 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((2 <= ERK_MEKPP))))) AND ((ERKP <= Raf) OR (2 <= RasGTP) OR (MEKPP <= Phase3) OR (1 <= ERK_MEKPP)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1450 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((2 <= ERK_MEKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (2 <= ERK_MEKPP)
lola: processed formula length: 16
lola: 30 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 962 markings, 1591 edges
lola: ========================================
lola: subprocess 15 will run for 2901 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((ERKP <= Raf) OR (2 <= RasGTP) OR (MEKPP <= Phase3) OR (1 <= ERK_MEKPP))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ERKP <= Raf) OR (2 <= RasGTP) OR (MEKPP <= Phase3) OR (1 <= ERK_MEKPP))
lola: processed formula length: 76
lola: 29 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA MAPK-PT-080-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2901 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F ((MEKPP <= Raf))) AND (E (F ((3 <= Phase2))) AND E (F ((Phase2 <= 2))))) OR (((ERKPP_Phase3 + 1 <= ERKP)) AND E (F ((MEKP_Phase2 <= RasGTP)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2901 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((ERKPP_Phase3 + 1 <= ERKP))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ERKPP_Phase3 + 1 <= ERKP))
lola: processed formula length: 28
lola: 29 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= Phase2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((3 <= Phase2)))
lola: processed formula length: 21
lola: 30 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (3 <= Phase2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((MEKPP <= Raf)))
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: (Raf + 1 <= MEKPP)
lola: processed formula length: 18
lola: 31 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((ERK_MEKPP <= MEK) OR (RafP_Phase1 <= ERK_MEKPP))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX(((ERK_MEKPP <= MEK) OR (RafP_Phase1 <= ERK_MEKPP))))))
lola: processed formula length: 75
lola: 31 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2836953 markings, 7023254 edges, 567391 markings/sec, 0 secs
lola: 5634338 markings, 13945706 edges, 559477 markings/sec, 5 secs
lola: 8363865 markings, 20689249 edges, 545905 markings/sec, 10 secs
lola: 11088825 markings, 27424153 edges, 544992 markings/sec, 15 secs
lola: 13700106 markings, 33878996 edges, 522256 markings/sec, 20 secs
lola: 16404697 markings, 40572365 edges, 540918 markings/sec, 25 secs
lola: 19056200 markings, 47134398 edges, 530301 markings/sec, 30 secs
lola: 21779822 markings, 53869333 edges, 544724 markings/sec, 35 secs
lola: 24437949 markings, 60439812 edges, 531625 markings/sec, 40 secs
lola: 27079929 markings, 66966321 edges, 528396 markings/sec, 45 secs
lola: 29691044 markings, 73418807 edges, 522223 markings/sec, 50 secs
lola: 32302235 markings, 79871280 edges, 522238 markings/sec, 55 secs
lola: 34927744 markings, 86358664 edges, 525102 markings/sec, 60 secs
lola: 37484995 markings, 92680698 edges, 511450 markings/sec, 65 secs
lola: 40074165 markings, 99079883 edges, 517834 markings/sec, 70 secs
lola: 42608644 markings, 105342838 edges, 506896 markings/sec, 75 secs
lola: 45132108 markings, 111576241 edges, 504693 markings/sec, 80 secs
lola: 47643126 markings, 117783795 edges, 502204 markings/sec, 85 secs
lola: 50256874 markings, 124393552 edges, 522750 markings/sec, 90 secs
lola: 52741043 markings, 130530517 edges, 496834 markings/sec, 95 secs
lola: 55124352 markings, 136421416 edges, 476662 markings/sec, 100 secs
lola: 57421550 markings, 142099269 edges, 459440 markings/sec, 105 secs
lola: 59752939 markings, 147859936 edges, 466278 markings/sec, 110 secs
lola: 62133078 markings, 153750986 edges, 476028 markings/sec, 115 secs
lola: 64542686 markings, 159709563 edges, 481922 markings/sec, 120 secs
lola: 64960924 markings, 160743991 edges, 83648 markings/sec, 125 secs
lola: 64963640 markings, 160750605 edges, 543 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA MAPK-PT-080-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((ERKP_Phase3 <= ERKP_MEKPP))) OR E (F ((1 <= RasGTP))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U (ERKP_Phase3 <= ERKP_MEKPP))) AND NOT(E(TRUE U (1 <= RasGTP))))))
lola: processed formula length: 92
lola: 33 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1427236 markings, 7725583 edges, 285447 markings/sec, 0 secs
lola: 2795064 markings, 15179679 edges, 273566 markings/sec, 5 secs
lola: 4091453 markings, 22259750 edges, 259278 markings/sec, 10 secs
lola: 5509970 markings, 29966391 edges, 283703 markings/sec, 15 secs
lola: 6843508 markings, 37238634 edges, 266708 markings/sec, 20 secs
lola: 8199564 markings, 44643433 edges, 271211 markings/sec, 25 secs
lola: 9497947 markings, 51729385 edges, 259677 markings/sec, 30 secs
lola: 10754829 markings, 58591116 edges, 251376 markings/sec, 35 secs
lola: 11991293 markings, 65343225 edges, 247293 markings/sec, 40 secs
lola: 13241217 markings, 72150500 edges, 249985 markings/sec, 45 secs
lola: 14491567 markings, 78960066 edges, 250070 markings/sec, 50 secs
lola: 15764735 markings, 85884181 edges, 254634 markings/sec, 55 secs
lola: 17019477 markings, 92730256 edges, 250948 markings/sec, 60 secs
lola: 18236518 markings, 99376723 edges, 243408 markings/sec, 65 secs
lola: 19462875 markings, 106068907 edges, 245271 markings/sec, 70 secs
lola: 20724647 markings, 112948246 edges, 252354 markings/sec, 75 secs
lola: 21961010 markings, 119698816 edges, 247273 markings/sec, 80 secs
lola: 23168500 markings, 126293032 edges, 241498 markings/sec, 85 secs
lola: 24424659 markings, 133141185 edges, 251232 markings/sec, 90 secs
lola: 25734767 markings, 140295384 edges, 262022 markings/sec, 95 secs
lola: 26961808 markings, 146997852 edges, 245408 markings/sec, 100 secs
lola: 28290376 markings, 154249144 edges, 265714 markings/sec, 105 secs
lola: 29588424 markings, 161336393 edges, 259610 markings/sec, 110 secs
lola: 30893311 markings, 168459184 edges, 260977 markings/sec, 115 secs
lola: 32202569 markings, 175602019 edges, 261852 markings/sec, 120 secs
lola: 33588634 markings, 183166228 edges, 277213 markings/sec, 125 secs
lola: 34841271 markings, 190006250 edges, 250527 markings/sec, 130 secs
lola: 36087744 markings, 196815580 edges, 249295 markings/sec, 135 secs
lola: 37393716 markings, 203930175 edges, 261194 markings/sec, 140 secs
lola: 38697094 markings, 211049170 edges, 260676 markings/sec, 145 secs
lola: 39993165 markings, 218126933 edges, 259214 markings/sec, 150 secs
lola: 41271509 markings, 225105607 edges, 255669 markings/sec, 155 secs
lola: 42461026 markings, 231600281 edges, 237903 markings/sec, 160 secs
lola: 43622339 markings, 237937675 edges, 232263 markings/sec, 165 secs
lola: 44862112 markings, 244706690 edges, 247955 markings/sec, 170 secs
lola: 46235305 markings, 252189599 edges, 274639 markings/sec, 175 secs
lola: 47509819 markings, 259144455 edges, 254903 markings/sec, 180 secs
lola: 48928754 markings, 266932828 edges, 283787 markings/sec, 185 secs
lola: 50255279 markings, 274177552 edges, 265305 markings/sec, 190 secs
lola: 51505656 markings, 281005807 edges, 250075 markings/sec, 195 secs
lola: 52752796 markings, 287817871 edges, 249428 markings/sec, 200 secs
lola: 54028821 markings, 294787325 edges, 255205 markings/sec, 205 secs
lola: 55357160 markings, 302036079 edges, 265668 markings/sec, 210 secs
lola: 56648394 markings, 309084503 edges, 258247 markings/sec, 215 secs
lola: 57885875 markings, 315843222 edges, 247496 markings/sec, 220 secs
lola: 59124346 markings, 322603604 edges, 247694 markings/sec, 225 secs
lola: 60387832 markings, 329574528 edges, 252697 markings/sec, 230 secs
lola: 61636882 markings, 336391889 edges, 249810 markings/sec, 235 secs
lola: 62986358 markings, 343735938 edges, 269895 markings/sec, 240 secs
lola: 64295548 markings, 350885718 edges, 261838 markings/sec, 245 secs
lola: 65550624 markings, 357740522 edges, 251015 markings/sec, 250 secs
lola: 66743155 markings, 364233651 edges, 238506 markings/sec, 255 secs
lola: 67924776 markings, 370683680 edges, 236324 markings/sec, 260 secs
lola: 69145563 markings, 377350047 edges, 244157 markings/sec, 265 secs
lola: 70441696 markings, 384427867 edges, 259227 markings/sec, 270 secs
lola: 71799535 markings, 391844199 edges, 271568 markings/sec, 275 secs
lola: 73080929 markings, 398839321 edges, 256279 markings/sec, 280 secs
lola: 74364310 markings, 405847385 edges, 256676 markings/sec, 285 secs
lola: 75676225 markings, 413011067 edges, 262383 markings/sec, 290 secs
lola: 76918033 markings, 419791608 edges, 248362 markings/sec, 295 secs
lola: 78190623 markings, 426738486 edges, 254518 markings/sec, 300 secs
lola: 79447721 markings, 433600459 edges, 251420 markings/sec, 305 secs
lola: 80721476 markings, 440555217 edges, 254751 markings/sec, 310 secs
lola: 81964588 markings, 447346535 edges, 248622 markings/sec, 315 secs
lola: 83224976 markings, 454228099 edges, 252078 markings/sec, 320 secs
lola: 84477688 markings, 461069754 edges, 250542 markings/sec, 325 secs
lola: 85669127 markings, 467572774 edges, 238288 markings/sec, 330 secs
lola: 86871787 markings, 474128961 edges, 240532 markings/sec, 335 secs
lola: 88219367 markings, 481489913 edges, 269516 markings/sec, 340 secs
lola: 89461306 markings, 488268670 edges, 248388 markings/sec, 345 secs
lola: 90681131 markings, 494931113 edges, 243965 markings/sec, 350 secs
lola: 91026989 markings, 496820435 edges, 69172 markings/sec, 355 secs
lola: 91032099 markings, 496848226 edges, 1022 markings/sec, 360 secs
lola: 91042239 markings, 496903608 edges, 2028 markings/sec, 365 secs
lola: 91049469 markings, 496942948 edges, 1446 markings/sec, 370 secs
lola: 91059519 markings, 496997802 edges, 2010 markings/sec, 375 secs
lola: 91070301 markings, 497056484 edges, 2156 markings/sec, 380 secs
lola: 91077010 markings, 497093242 edges, 1342 markings/sec, 385 secs
lola: 91099357 markings, 497215550 edges, 4469 markings/sec, 390 secs
lola: 91104468 markings, 497243541 edges, 1022 markings/sec, 395 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA MAPK-PT-080-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: ((A (F ((MEKPP <= Raf))) AND (E (F ((3 <= Phase2))) AND E (F ((Phase2 <= 2))))) OR (((ERKPP_Phase3 + 1 <= ERKP)) AND E (F ((MEKP_Phase2 <= RasGTP)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((ERKPP_Phase3 + 1 <= ERKP))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ERKPP_Phase3 + 1 <= ERKP))
lola: processed formula length: 28
lola: 29 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((Phase2 <= 2)))
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 ((Phase2 <= 2)))
lola: processed formula length: 21
lola: 30 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (Phase2 <= 2)
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 reachable.
lola: 117 markings, 153 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= Phase2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((3 <= Phase2)))
lola: processed formula length: 21
lola: 30 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((MEKPP <= Raf)))
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: (Raf + 1 <= MEKPP)
lola: processed formula length: 18
lola: 31 rewrites
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA MAPK-PT-080-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes yes yes no unknown yes yes no no unknown no yes yes
lola:
preliminary result: yes no yes yes yes yes no unknown yes yes no no unknown no yes yes
lola: memory consumption: 21496 KB
lola: time consumption: 1209 seconds
BK_STOP 1527021456295
--------------------
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-080"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-080.tgz
mv MAPK-PT-080 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-080, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r112-csrt-152666469100178"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;