Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r225-tall-167856407800545.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is MAPK-PT-00008, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r225-tall-167856407800545
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.0K Feb 26 10:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 10:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 25K Mar 5 18:22 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-00008-CTLCardinality-00
FORMULA_NAME MAPK-PT-00008-CTLCardinality-01
FORMULA_NAME MAPK-PT-00008-CTLCardinality-02
FORMULA_NAME MAPK-PT-00008-CTLCardinality-03
FORMULA_NAME MAPK-PT-00008-CTLCardinality-04
FORMULA_NAME MAPK-PT-00008-CTLCardinality-05
FORMULA_NAME MAPK-PT-00008-CTLCardinality-06
FORMULA_NAME MAPK-PT-00008-CTLCardinality-07
FORMULA_NAME MAPK-PT-00008-CTLCardinality-08
FORMULA_NAME MAPK-PT-00008-CTLCardinality-09
FORMULA_NAME MAPK-PT-00008-CTLCardinality-10
FORMULA_NAME MAPK-PT-00008-CTLCardinality-11
FORMULA_NAME MAPK-PT-00008-CTLCardinality-12
FORMULA_NAME MAPK-PT-00008-CTLCardinality-13
FORMULA_NAME MAPK-PT-00008-CTLCardinality-14
FORMULA_NAME MAPK-PT-00008-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678634716119

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MAPK-PT-00008
Not applying reductions.
Model is PT
CTLCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: MAPK_PT_00008
(NrP: 22 NrTr: 30 NrArc: 90)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.903sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 667 (6.7e+02) #states 6,110,643 (6)



starting MCC model checker
--------------------------

checking: EF [~ [MEKPP_Phase2<=4]]
normalized: E [true U ~ [MEKPP_Phase2<=4]]

abstracting: (MEKPP_Phase2<=4)
states: 6,110,643 (6)
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [AG [EX [EF [~ [ERK<=ERK]]]]]
normalized: ~ [EX [E [true U ~ [EX [E [true U ~ [ERK<=ERK]]]]]]]

abstracting: (ERK<=ERK)
states: 6,110,643 (6)
..-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: ~ [E [MEKPP_Phase2<=6 U AX [AF [Phase3<=ERK_MEKPP]]]]
normalized: ~ [E [MEKPP_Phase2<=6 U ~ [EX [EG [~ [Phase3<=ERK_MEKPP]]]]]]

abstracting: (Phase3<=ERK_MEKPP)
states: 180,451 (5)
.
EG iterations: 1
.abstracting: (MEKPP_Phase2<=6)
states: 6,110,643 (6)
-> the formula is TRUE

FORMULA MAPK-PT-00008-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AX [[~ [EF [AG [[MEKPP_Phase2<=2 | 5<=ERKP_MEKPP]]]] | Raf_RasGTP<=MEKPP]]
normalized: ~ [EX [~ [[~ [E [true U ~ [E [true U ~ [[MEKPP_Phase2<=2 | 5<=ERKP_MEKPP]]]]]] | Raf_RasGTP<=MEKPP]]]]

abstracting: (Raf_RasGTP<=MEKPP)
states: 3,506,328 (6)
abstracting: (5<=ERKP_MEKPP)
states: 0
abstracting: (MEKPP_Phase2<=2)
states: 5,938,653 (6)
.-> the formula is TRUE

FORMULA MAPK-PT-00008-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: E [~ [[~ [EF [A [MEKPP<=4 U 3<=ERKP]]] & ~ [EF [EX [MEKP_RafP<=MEKP]]]]] U AG [A [2<=Raf_RasGTP U EX [~ [1<=MEKPP_Phase2]]]]]
normalized: E [~ [[~ [E [true U EX [MEKP_RafP<=MEKP]]] & ~ [E [true U [~ [EG [~ [3<=ERKP]]] & ~ [E [~ [3<=ERKP] U [~ [MEKPP<=4] & ~ [3<=ERKP]]]]]]]]] U ~ [E [true U ~ [[~ [E [~ [EX [~ [1<=MEKPP_Phase2]]] U [~ [2<=Raf_RasGTP] & ~ [EX [~ [1<=MEKPP_Phase2]]]]]] & ~ [EG [~ [EX [~ [1<=MEKPP_Phase2]]]]]]]]]]

abstracting: (1<=MEKPP_Phase2)
states: 2,358,384 (6)
..
EG iterations: 1
abstracting: (1<=MEKPP_Phase2)
states: 2,358,384 (6)
.abstracting: (2<=Raf_RasGTP)
states: 1,552,180 (6)
abstracting: (1<=MEKPP_Phase2)
states: 2,358,384 (6)
.abstracting: (3<=ERKP)
states: 863,522 (5)
abstracting: (MEKPP<=4)
states: 6,110,643 (6)
abstracting: (3<=ERKP)
states: 863,522 (5)
abstracting: (3<=ERKP)
states: 863,522 (5)
.
EG iterations: 1
abstracting: (MEKP_RafP<=MEKP)
states: 4,773,195 (6)
.-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: EF [~ [[EF [A [~ [ERKP_MEKPP<=MEKP_RafP] U MEK_RafP<=ERKP]] | ERKP_Phase3<=Raf_RasGTP]]]
normalized: E [true U ~ [[E [true U [~ [E [~ [MEK_RafP<=ERKP] U [~ [MEK_RafP<=ERKP] & ERKP_MEKPP<=MEKP_RafP]]] & ~ [EG [~ [MEK_RafP<=ERKP]]]]] | ERKP_Phase3<=Raf_RasGTP]]]

abstracting: (ERKP_Phase3<=Raf_RasGTP)
states: 3,824,610 (6)
abstracting: (MEK_RafP<=ERKP)
states: 5,211,423 (6)
.
EG iterations: 1
abstracting: (ERKP_MEKPP<=MEKP_RafP)
states: 5,044,452 (6)
abstracting: (MEK_RafP<=ERKP)
states: 5,211,423 (6)
abstracting: (MEK_RafP<=ERKP)
states: 5,211,423 (6)
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: E [Raf<=8 U AG [[~ [[MEKPP<=ERK | ~ [EF [ERKP<=ERK]]]] | 6<=ERKP_Phase3]]]
normalized: E [Raf<=8 U ~ [E [true U ~ [[~ [[~ [E [true U ERKP<=ERK]] | MEKPP<=ERK]] | 6<=ERKP_Phase3]]]]]

abstracting: (6<=ERKP_Phase3)
states: 17,185 (4)
abstracting: (MEKPP<=ERK)
states: 4,889,661 (6)
abstracting: (ERKP<=ERK)
states: 3,840,359 (6)
abstracting: (Raf<=8)
states: 6,110,643 (6)
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: ~ [AG [[EX [EF [~ [ERKP<=4]]] | [AF [EG [6<=MEKPP]] & E [[[MEKP_Phase2<=4 | MEK_RafP<=Phase3] | [1<=MEKPP_Phase2 & 5<=RafP]] U EG [Raf_RasGTP<=8]]]]]]
normalized: E [true U ~ [[[E [[[1<=MEKPP_Phase2 & 5<=RafP] | [MEKP_Phase2<=4 | MEK_RafP<=Phase3]] U EG [Raf_RasGTP<=8]] & ~ [EG [~ [EG [6<=MEKPP]]]]] | EX [E [true U ~ [ERKP<=4]]]]]]

abstracting: (ERKP<=4)
states: 6,010,040 (6)
.abstracting: (6<=MEKPP)
states: 0
.
EG iterations: 1

EG iterations: 0
abstracting: (Raf_RasGTP<=8)
states: 6,110,643 (6)

EG iterations: 0
abstracting: (MEK_RafP<=Phase3)
states: 6,027,367 (6)
abstracting: (MEKP_Phase2<=4)
states: 6,110,643 (6)
abstracting: (5<=RafP)
states: 828,503 (5)
abstracting: (1<=MEKPP_Phase2)
states: 2,358,384 (6)
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EF [[E [AG [[[ERKPP<=7 | 2<=Raf_RasGTP] & [Raf_RasGTP<=0 | 1<=ERKP_MEKPP]]] U [~ [[AG [MEKPP_Phase2<=0] & ~ [5<=MEKPP_Phase2]]] & [A [3<=MEK_RafP U 1<=ERKPP_Phase3] | ERK_MEKPP<=7]]] & AG [AG [EX [ERKP_MEKPP<=0]]]]]
normalized: E [true U [~ [E [true U E [true U ~ [EX [ERKP_MEKPP<=0]]]]] & E [~ [E [true U ~ [[[Raf_RasGTP<=0 | 1<=ERKP_MEKPP] & [ERKPP<=7 | 2<=Raf_RasGTP]]]]] U [[ERK_MEKPP<=7 | [~ [EG [~ [1<=ERKPP_Phase3]]] & ~ [E [~ [1<=ERKPP_Phase3] U [~ [3<=MEK_RafP] & ~ [1<=ERKPP_Phase3]]]]]] & ~ [[~ [5<=MEKPP_Phase2] & ~ [E [true U ~ [MEKPP_Phase2<=0]]]]]]]]]

abstracting: (MEKPP_Phase2<=0)
states: 3,752,259 (6)
abstracting: (5<=MEKPP_Phase2)
states: 0
abstracting: (1<=ERKPP_Phase3)
states: 3,510,710 (6)
abstracting: (3<=MEK_RafP)
states: 72,912 (4)
abstracting: (1<=ERKPP_Phase3)
states: 3,510,710 (6)
abstracting: (1<=ERKPP_Phase3)
states: 3,510,710 (6)
.
EG iterations: 1
abstracting: (ERK_MEKPP<=7)
states: 6,110,643 (6)
abstracting: (2<=Raf_RasGTP)
states: 1,552,180 (6)
abstracting: (ERKPP<=7)
states: 6,110,643 (6)
abstracting: (1<=ERKP_MEKPP)
states: 1,368,759 (6)
abstracting: (Raf_RasGTP<=0)
states: 2,528,288 (6)
abstracting: (ERKP_MEKPP<=0)
states: 4,741,884 (6)
.-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: AF [[[AF [[AG [MEKP<=6] | ~ [MEKPP<=5]]] & E [AF [7<=MEK_RafP] U EF [AG [Raf_RasGTP<=0]]]] & EX [EX [[[RafP_Phase1<=2 & Phase2<=1] | [Raf_RasGTP<=MEKPP & ERKPP<=ERKP_MEKPP]]]]]]
normalized: ~ [EG [~ [[EX [EX [[[Raf_RasGTP<=MEKPP & ERKPP<=ERKP_MEKPP] | [RafP_Phase1<=2 & Phase2<=1]]]] & [E [~ [EG [~ [7<=MEK_RafP]]] U E [true U ~ [E [true U ~ [Raf_RasGTP<=0]]]]] & ~ [EG [~ [[~ [MEKPP<=5] | ~ [E [true U ~ [MEKP<=6]]]]]]]]]]]]

abstracting: (MEKP<=6)
states: 6,110,643 (6)
abstracting: (MEKPP<=5)
states: 6,110,643 (6)
.
EG iterations: 1
abstracting: (Raf_RasGTP<=0)
states: 2,528,288 (6)
abstracting: (7<=MEK_RafP)
states: 0

EG iterations: 0
abstracting: (Phase2<=1)
states: 621,810 (5)
abstracting: (RafP_Phase1<=2)
states: 3,899,133 (6)
abstracting: (ERKPP<=ERKP_MEKPP)
states: 3,016,170 (6)
abstracting: (Raf_RasGTP<=MEKPP)
states: 3,506,328 (6)
..
EG iterations: 0
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: EF [[[[~ [ERKPP_Phase3<=6] & MEKPP<=MEKP_RafP] & [AG [~ [RafP<=4]] & [~ [AG [MEKP_RafP<=8]] & AG [AG [6<=MEKPP]]]]] | ~ [[EF [~ [MEKPP<=6]] | E [EX [ERKPP_Phase3<=2] U [EG [MEKP_RafP<=1] | [6<=MEKPP | Phase2<=MEKP_RafP]]]]]]]
normalized: E [true U [~ [[E [EX [ERKPP_Phase3<=2] U [[6<=MEKPP | Phase2<=MEKP_RafP] | EG [MEKP_RafP<=1]]] | E [true U ~ [MEKPP<=6]]]] | [[[~ [E [true U E [true U ~ [6<=MEKPP]]]] & E [true U ~ [MEKP_RafP<=8]]] & ~ [E [true U RafP<=4]]] & [MEKPP<=MEKP_RafP & ~ [ERKPP_Phase3<=6]]]]]

abstracting: (ERKPP_Phase3<=6)
states: 6,110,643 (6)
abstracting: (MEKPP<=MEKP_RafP)
states: 4,213,167 (6)
abstracting: (RafP<=4)
states: 5,282,140 (6)
abstracting: (MEKP_RafP<=8)
states: 6,110,643 (6)
abstracting: (6<=MEKPP)
states: 0
abstracting: (MEKPP<=6)
states: 6,110,643 (6)
abstracting: (MEKP_RafP<=1)
states: 5,675,649 (6)
.
EG iterations: 1
abstracting: (Phase2<=MEKP_RafP)
states: 246,960 (5)
abstracting: (6<=MEKPP)
states: 0
abstracting: (ERKPP_Phase3<=2)
states: 5,247,121 (6)
.-> the formula is TRUE

FORMULA MAPK-PT-00008-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: [AX [~ [A [[A [MEKPP_Phase2<=3 U ERKP_MEKPP<=MEKP_Phase2] & EX [Raf<=2]] U ~ [[EF [Raf_RasGTP<=2] | E [ERKP_Phase3<=0 U Phase2<=6]]]]]] & AG [[6<=Phase3 | E [EF [7<=ERKP_MEKPP] U E [AF [Phase2<=RafP_Phase1] U [ERKPP_Phase3<=3 & 5<=MEKPP]]]]]]
normalized: [~ [E [true U ~ [[6<=Phase3 | E [E [true U 7<=ERKP_MEKPP] U E [~ [EG [~ [Phase2<=RafP_Phase1]]] U [ERKPP_Phase3<=3 & 5<=MEKPP]]]]]]] & ~ [EX [[~ [EG [[E [ERKP_Phase3<=0 U Phase2<=6] | E [true U Raf_RasGTP<=2]]]] & ~ [E [[E [ERKP_Phase3<=0 U Phase2<=6] | E [true U Raf_RasGTP<=2]] U [~ [[EX [Raf<=2] & [~ [EG [~ [ERKP_MEKPP<=MEKP_Phase2]]] & ~ [E [~ [ERKP_MEKPP<=MEKP_Phase2] U [~ [MEKPP_Phase2<=3] & ~ [ERKP_MEKPP<=MEKP_Phase2]]]]]]] & [E [ERKP_Phase3<=0 U Phase2<=6] | E [true U Raf_RasGTP<=2]]]]]]]]]

abstracting: (Raf_RasGTP<=2)
states: 6,110,643 (6)
abstracting: (Phase2<=6)
states: 6,110,643 (6)
abstracting: (ERKP_Phase3<=0)
states: 2,599,933 (6)
abstracting: (ERKP_MEKPP<=MEKP_Phase2)
states: 5,129,901 (6)
abstracting: (MEKPP_Phase2<=3)
states: 6,088,593 (6)
abstracting: (ERKP_MEKPP<=MEKP_Phase2)
states: 5,129,901 (6)
abstracting: (ERKP_MEKPP<=MEKP_Phase2)
states: 5,129,901 (6)
.
EG iterations: 1
abstracting: (Raf<=2)
states: 3,764,713 (6)
.abstracting: (Raf_RasGTP<=2)
states: 6,110,643 (6)
abstracting: (Phase2<=6)
states: 6,110,643 (6)
abstracting: (ERKP_Phase3<=0)
states: 2,599,933 (6)
abstracting: (Raf_RasGTP<=2)
states: 6,110,643 (6)
abstracting: (Phase2<=6)
states: 6,110,643 (6)
abstracting: (ERKP_Phase3<=0)
states: 2,599,933 (6)

EG iterations: 0
.abstracting: (5<=MEKPP)
states: 0
abstracting: (ERKPP_Phase3<=3)
states: 5,771,657 (6)
abstracting: (Phase2<=RafP_Phase1)
states: 2,391,993 (6)
.
EG iterations: 1
abstracting: (7<=ERKP_MEKPP)
states: 0
abstracting: (6<=Phase3)
states: 937,603 (5)
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: AX [[AF [EG [EF [8<=Phase2]]] & [EF [[[EX [ERKP<=Phase2] | [RafP_Phase1<=0 | MEKP_Phase2<=Phase1]] & ~ [[3<=MEKPP | 7<=MEKP]]]] & [ERKPP<=1 | ~ [A [RasGTP<=Phase3 U [MEKPP_Phase2<=2 & Phase2<=Phase3]]]]]]]
normalized: ~ [EX [~ [[[[ERKPP<=1 | ~ [[~ [EG [~ [[MEKPP_Phase2<=2 & Phase2<=Phase3]]]] & ~ [E [~ [[MEKPP_Phase2<=2 & Phase2<=Phase3]] U [~ [RasGTP<=Phase3] & ~ [[MEKPP_Phase2<=2 & Phase2<=Phase3]]]]]]]] & E [true U [~ [[3<=MEKPP | 7<=MEKP]] & [[RafP_Phase1<=0 | MEKP_Phase2<=Phase1] | EX [ERKP<=Phase2]]]]] & ~ [EG [~ [EG [E [true U 8<=Phase2]]]]]]]]]

abstracting: (8<=Phase2)
states: 0
.
EG iterations: 1

EG iterations: 0
abstracting: (ERKP<=Phase2)
states: 5,547,264 (6)
.abstracting: (MEKP_Phase2<=Phase1)
states: 5,923,449 (6)
abstracting: (RafP_Phase1<=0)
states: 1,516,320 (6)
abstracting: (7<=MEKP)
states: 0
abstracting: (3<=MEKPP)
states: 171,990 (5)
abstracting: (Phase2<=Phase3)
states: 4,729,623 (6)
abstracting: (MEKPP_Phase2<=2)
states: 5,938,653 (6)
abstracting: (RasGTP<=Phase3)
states: 5,855,795 (6)
abstracting: (Phase2<=Phase3)
states: 4,729,623 (6)
abstracting: (MEKPP_Phase2<=2)
states: 5,938,653 (6)
abstracting: (Phase2<=Phase3)
states: 4,729,623 (6)
abstracting: (MEKPP_Phase2<=2)
states: 5,938,653 (6)
.
EG iterations: 1
abstracting: (ERKPP<=1)
states: 4,262,263 (6)
.-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.055sec

checking: E [~ [A [ERKP_Phase3<=3 U ~ [[[[Raf<=0 | MEKP_Phase2<=MEKP] & AF [RafP<=MEKP_Phase2]] & ~ [[Phase1<=Raf_RasGTP | 4<=RafP]]]]]] U EG [[~ [EF [~ [MEK_RafP<=RasGTP]]] & [AG [Phase3<=RafP] & [~ [ERKPP<=Raf] | AG [RafP<=ERKPP]]]]]]
normalized: E [~ [[~ [EG [[~ [[Phase1<=Raf_RasGTP | 4<=RafP]] & [~ [EG [~ [RafP<=MEKP_Phase2]]] & [Raf<=0 | MEKP_Phase2<=MEKP]]]]] & ~ [E [[~ [[Phase1<=Raf_RasGTP | 4<=RafP]] & [~ [EG [~ [RafP<=MEKP_Phase2]]] & [Raf<=0 | MEKP_Phase2<=MEKP]]] U [~ [ERKP_Phase3<=3] & [~ [[Phase1<=Raf_RasGTP | 4<=RafP]] & [~ [EG [~ [RafP<=MEKP_Phase2]]] & [Raf<=0 | MEKP_Phase2<=MEKP]]]]]]]] U EG [[[[~ [E [true U ~ [RafP<=ERKPP]]] | ~ [ERKPP<=Raf]] & ~ [E [true U ~ [Phase3<=RafP]]]] & ~ [E [true U ~ [MEK_RafP<=RasGTP]]]]]]

abstracting: (MEK_RafP<=RasGTP)
states: 5,493,201 (6)
abstracting: (Phase3<=RafP)
states: 1,878,035 (6)
abstracting: (ERKPP<=Raf)
states: 4,700,658 (6)
abstracting: (RafP<=ERKPP)
states: 2,634,993 (6)
.
EG iterations: 1
abstracting: (MEKP_Phase2<=MEKP)
states: 4,346,475 (6)
abstracting: (Raf<=0)
states: 1,409,345 (6)
abstracting: (RafP<=MEKP_Phase2)
states: 2,047,605 (6)
.
EG iterations: 1
abstracting: (4<=RafP)
states: 1,479,437 (6)
abstracting: (Phase1<=Raf_RasGTP)
states: 622,930 (5)
abstracting: (ERKP_Phase3<=3)
states: 5,771,657 (6)
abstracting: (MEKP_Phase2<=MEKP)
states: 4,346,475 (6)
abstracting: (Raf<=0)
states: 1,409,345 (6)
abstracting: (RafP<=MEKP_Phase2)
states: 2,047,605 (6)
.
EG iterations: 1
abstracting: (4<=RafP)
states: 1,479,437 (6)
abstracting: (Phase1<=Raf_RasGTP)
states: 622,930 (5)
abstracting: (MEKP_Phase2<=MEKP)
states: 4,346,475 (6)
abstracting: (Raf<=0)
states: 1,409,345 (6)
abstracting: (RafP<=MEKP_Phase2)
states: 2,047,605 (6)
.
EG iterations: 1
abstracting: (4<=RafP)
states: 1,479,437 (6)
abstracting: (Phase1<=Raf_RasGTP)
states: 622,930 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: A [~ [[[[[A [Phase3<=1 U 3<=RafP] | AF [MEKP<=MEKP_RafP]] & ~ [[[MEKP<=RafP_Phase1 | MEKP<=Raf] & EG [6<=Raf_RasGTP]]]] | EF [8<=Phase3]] | EX [EX [AF [2<=ERKPP]]]]] U [[Raf<=MEK | AX [AX [[7<=MEKP_RafP & 2<=RafP]]]] & [RafP_Phase1<=ERKP_Phase3 & [~ [EF [[ERKPP<=ERKPP | MEK_RafP<=0]]] & [AX [[MEKP<=Raf_RasGTP & 5<=ERK_MEKPP]] | [ERK<=ERKP_Phase3 & AF [ERK_MEKPP<=8]]]]]]]
normalized: [~ [EG [~ [[[RafP_Phase1<=ERKP_Phase3 & [[[ERK<=ERKP_Phase3 & ~ [EG [~ [ERK_MEKPP<=8]]]] | ~ [EX [~ [[MEKP<=Raf_RasGTP & 5<=ERK_MEKPP]]]]] & ~ [E [true U [ERKPP<=ERKPP | MEK_RafP<=0]]]]] & [Raf<=MEK | ~ [EX [EX [~ [[7<=MEKP_RafP & 2<=RafP]]]]]]]]]] & ~ [E [~ [[[RafP_Phase1<=ERKP_Phase3 & [[[ERK<=ERKP_Phase3 & ~ [EG [~ [ERK_MEKPP<=8]]]] | ~ [EX [~ [[MEKP<=Raf_RasGTP & 5<=ERK_MEKPP]]]]] & ~ [E [true U [ERKPP<=ERKPP | MEK_RafP<=0]]]]] & [Raf<=MEK | ~ [EX [EX [~ [[7<=MEKP_RafP & 2<=RafP]]]]]]]] U [[EX [EX [~ [EG [~ [2<=ERKPP]]]]] | [E [true U 8<=Phase3] | [~ [[EG [6<=Raf_RasGTP] & [MEKP<=RafP_Phase1 | MEKP<=Raf]]] & [~ [EG [~ [MEKP<=MEKP_RafP]]] | [~ [EG [~ [3<=RafP]]] & ~ [E [~ [3<=RafP] U [~ [Phase3<=1] & ~ [3<=RafP]]]]]]]]] & ~ [[[RafP_Phase1<=ERKP_Phase3 & [[[ERK<=ERKP_Phase3 & ~ [EG [~ [ERK_MEKPP<=8]]]] | ~ [EX [~ [[MEKP<=Raf_RasGTP & 5<=ERK_MEKPP]]]]] & ~ [E [true U [ERKPP<=ERKPP | MEK_RafP<=0]]]]] & [Raf<=MEK | ~ [EX [EX [~ [[7<=MEKP_RafP & 2<=RafP]]]]]]]]]]]]

abstracting: (2<=RafP)
states: 3,429,032 (6)
abstracting: (7<=MEKP_RafP)
states: 0
..abstracting: (Raf<=MEK)
states: 2,047,605 (6)
abstracting: (MEK_RafP<=0)
states: 4,278,687 (6)
abstracting: (ERKPP<=ERKPP)
states: 6,110,643 (6)
abstracting: (5<=ERK_MEKPP)
states: 0
abstracting: (MEKP<=Raf_RasGTP)
states: 4,849,677 (6)
.abstracting: (ERK_MEKPP<=8)
states: 6,110,643 (6)
.
EG iterations: 1
abstracting: (ERK<=ERKP_Phase3)
states: 3,840,359 (6)
abstracting: (RafP_Phase1<=ERKP_Phase3)
states: 2,757,588 (6)
abstracting: (3<=RafP)
states: 2,345,930 (6)
abstracting: (Phase3<=1)
states: 517,693 (5)
abstracting: (3<=RafP)
states: 2,345,930 (6)
abstracting: (3<=RafP)
states: 2,345,930 (6)
.
EG iterations: 1
abstracting: (MEKP<=MEKP_RafP)
states: 4,213,167 (6)
.
EG iterations: 1
abstracting: (MEKP<=Raf)
states: 5,402,607 (6)
abstracting: (MEKP<=RafP_Phase1)
states: 5,351,787 (6)
abstracting: (6<=Raf_RasGTP)
states: 0
.
EG iterations: 1
abstracting: (8<=Phase3)
states: 0
abstracting: (2<=ERKPP)
states: 1,848,380 (6)
.
EG iterations: 1
..abstracting: (2<=RafP)
states: 3,429,032 (6)
abstracting: (7<=MEKP_RafP)
states: 0
..abstracting: (Raf<=MEK)
states: 2,047,605 (6)
abstracting: (MEK_RafP<=0)
states: 4,278,687 (6)
abstracting: (ERKPP<=ERKPP)
states: 6,110,643 (6)
abstracting: (5<=ERK_MEKPP)
states: 0
abstracting: (MEKP<=Raf_RasGTP)
states: 4,849,677 (6)
.abstracting: (ERK_MEKPP<=8)
states: 6,110,643 (6)
.
EG iterations: 1
abstracting: (ERK<=ERKP_Phase3)
states: 3,840,359 (6)
abstracting: (RafP_Phase1<=ERKP_Phase3)
states: 2,757,588 (6)
abstracting: (2<=RafP)
states: 3,429,032 (6)
abstracting: (7<=MEKP_RafP)
states: 0
..abstracting: (Raf<=MEK)
states: 2,047,605 (6)
abstracting: (MEK_RafP<=0)
states: 4,278,687 (6)
abstracting: (ERKPP<=ERKPP)
states: 6,110,643 (6)
abstracting: (5<=ERK_MEKPP)
states: 0
abstracting: (MEKP<=Raf_RasGTP)
states: 4,849,677 (6)
.abstracting: (ERK_MEKPP<=8)
states: 6,110,643 (6)
.
EG iterations: 1
abstracting: (ERK<=ERKP_Phase3)
states: 3,840,359 (6)
abstracting: (RafP_Phase1<=ERKP_Phase3)
states: 2,757,588 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: EF [[~ [[A [~ [Phase2<=MEK] U ~ [[ERKP_MEKPP<=MEKP | MEKP_RafP<=RasGTP]]] | [[AG [ERKP_Phase3<=7] & ~ [[7<=ERKP_MEKPP & Raf<=3]]] | 2<=MEKP_Phase2]]] & [[[[EF [2<=Phase1] | [[ERKPP_Phase3<=Raf_RasGTP | ERKP_Phase3<=MEK] | AG [Raf_RasGTP<=7]]] | [A [1<=Phase3 U RafP_Phase1<=RafP] | 7<=ERKPP_Phase3]] & [~ [[~ [Raf<=ERK] & EF [ERKP_Phase3<=8]]] & [AX [4<=MEKP] | [AG [RasGTP<=Raf_RasGTP] & A [7<=Phase3 U 5<=MEKPP_Phase2]]]]] | [~ [[[~ [2<=ERKPP] | EX [MEKP_RafP<=8]] & 5<=MEKPP_Phase2]] & AX [[[RafP<=RafP_Phase1 | RafP_Phase1<=1] | ~ [RafP_Phase1<=Phase2]]]]]]]
normalized: E [true U [[[~ [EX [~ [[~ [RafP_Phase1<=Phase2] | [RafP<=RafP_Phase1 | RafP_Phase1<=1]]]]] & ~ [[5<=MEKPP_Phase2 & [EX [MEKP_RafP<=8] | ~ [2<=ERKPP]]]]] | [[[[[~ [EG [~ [5<=MEKPP_Phase2]]] & ~ [E [~ [5<=MEKPP_Phase2] U [~ [7<=Phase3] & ~ [5<=MEKPP_Phase2]]]]] & ~ [E [true U ~ [RasGTP<=Raf_RasGTP]]]] | ~ [EX [~ [4<=MEKP]]]] & ~ [[E [true U ERKP_Phase3<=8] & ~ [Raf<=ERK]]]] & [[7<=ERKPP_Phase3 | [~ [EG [~ [RafP_Phase1<=RafP]]] & ~ [E [~ [RafP_Phase1<=RafP] U [~ [1<=Phase3] & ~ [RafP_Phase1<=RafP]]]]]] | [[~ [E [true U ~ [Raf_RasGTP<=7]]] | [ERKPP_Phase3<=Raf_RasGTP | ERKP_Phase3<=MEK]] | E [true U 2<=Phase1]]]]] & ~ [[[2<=MEKP_Phase2 | [~ [[7<=ERKP_MEKPP & Raf<=3]] & ~ [E [true U ~ [ERKP_Phase3<=7]]]]] | [~ [EG [[ERKP_MEKPP<=MEKP | MEKP_RafP<=RasGTP]]] & ~ [E [[ERKP_MEKPP<=MEKP | MEKP_RafP<=RasGTP] U [Phase2<=MEK & [ERKP_MEKPP<=MEKP | MEKP_RafP<=RasGTP]]]]]]]]]

abstracting: (MEKP_RafP<=RasGTP)
states: 5,493,201 (6)
abstracting: (ERKP_MEKPP<=MEKP)
states: 5,129,901 (6)
abstracting: (Phase2<=MEK)
states: 330,750 (5)
abstracting: (MEKP_RafP<=RasGTP)
states: 5,493,201 (6)
abstracting: (ERKP_MEKPP<=MEKP)
states: 5,129,901 (6)
abstracting: (MEKP_RafP<=RasGTP)
states: 5,493,201 (6)
abstracting: (ERKP_MEKPP<=MEKP)
states: 5,129,901 (6)
.
EG iterations: 1
abstracting: (ERKP_Phase3<=7)
states: 6,110,643 (6)
abstracting: (Raf<=3)
states: 4,631,206 (6)
abstracting: (7<=ERKP_MEKPP)
states: 0
abstracting: (2<=MEKP_Phase2)
states: 744,156 (5)
abstracting: (2<=Phase1)
states: 5,416,560 (6)
abstracting: (ERKP_Phase3<=MEK)
states: 3,378,312 (6)
abstracting: (ERKPP_Phase3<=Raf_RasGTP)
states: 3,824,610 (6)
abstracting: (Raf_RasGTP<=7)
states: 6,110,643 (6)
abstracting: (RafP_Phase1<=RafP)
states: 3,530,251 (6)
abstracting: (1<=Phase3)
states: 5,990,348 (6)
abstracting: (RafP_Phase1<=RafP)
states: 3,530,251 (6)
abstracting: (RafP_Phase1<=RafP)
states: 3,530,251 (6)
.
EG iterations: 1
abstracting: (7<=ERKPP_Phase3)
states: 0
abstracting: (Raf<=ERK)
states: 2,634,993 (6)
abstracting: (ERKP_Phase3<=8)
states: 6,110,643 (6)
abstracting: (4<=MEKP)
states: 22,050 (4)
.abstracting: (RasGTP<=Raf_RasGTP)
states: 3,582,355 (6)
abstracting: (5<=MEKPP_Phase2)
states: 0
abstracting: (7<=Phase3)
states: 0
abstracting: (5<=MEKPP_Phase2)
states: 0
abstracting: (5<=MEKPP_Phase2)
states: 0

EG iterations: 0
abstracting: (2<=ERKPP)
states: 1,848,380 (6)
abstracting: (MEKP_RafP<=8)
states: 6,110,643 (6)
.abstracting: (5<=MEKPP_Phase2)
states: 0
abstracting: (RafP_Phase1<=1)
states: 2,816,031 (6)
abstracting: (RafP<=RafP_Phase1)
states: 3,395,831 (6)
abstracting: (RafP_Phase1<=Phase2)
states: 4,586,136 (6)
.-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.058sec

totally nodes used: 191636 (1.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1031077 775302 1806379
used/not used/entry size/cache size: 931768 66177096 16 1024MB
basic ops cache: hits/miss/sum: 247512 209043 456555
used/not used/entry size/cache size: 369236 16407980 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 26752 18940 45692
used/not used/entry size/cache size: 18936 8369672 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66940375
1 160756
2 4628
3 902
4 897
5 394
6 184
7 125
8 143
9 69
>= 10 391

Total processing time: 0m 4.954sec


BK_STOP 1678634721120

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

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:761 (25), effective:112 (3)

initing FirstDep: 0m 0.000sec


iterations count:30 (1), effective:0 (0)

iterations count:323 (10), effective:33 (1)

iterations count:41 (1), effective:1 (0)

iterations count:219 (7), effective:22 (0)

iterations count:211 (7), effective:30 (1)

iterations count:74 (2), effective:6 (0)

iterations count:78 (2), effective:7 (0)

iterations count:195 (6), effective:28 (0)

iterations count:88 (2), effective:15 (0)

iterations count:126 (4), effective:16 (0)

iterations count:275 (9), effective:43 (1)

iterations count:30 (1), effective:0 (0)

iterations count:115 (3), effective:11 (0)

iterations count:44 (1), effective:2 (0)

iterations count:61 (2), effective:7 (0)

iterations count:30 (1), effective:0 (0)

iterations count:267 (8), effective:32 (1)

iterations count:30 (1), effective:0 (0)

iterations count:45 (1), effective:3 (0)

iterations count:186 (6), effective:28 (0)

iterations count:30 (1), effective:0 (0)

iterations count:30 (1), effective:0 (0)

iterations count:114 (3), effective:10 (0)

iterations count:607 (20), effective:106 (3)

iterations count:30 (1), effective:0 (0)

iterations count:30 (1), effective:0 (0)

iterations count:30 (1), effective:0 (0)

iterations count:30 (1), effective:0 (0)

iterations count:179 (5), effective:25 (0)

iterations count:30 (1), effective:0 (0)

iterations count:30 (1), effective:0 (0)

iterations count:129 (4), effective:14 (0)

iterations count:108 (3), effective:16 (0)

iterations count:288 (9), effective:50 (1)

iterations count:320 (10), effective:34 (1)

iterations count:225 (7), effective:33 (1)

iterations count:115 (3), effective:11 (0)

iterations count:242 (8), effective:38 (1)

iterations count:30 (1), effective:0 (0)

iterations count:56 (1), effective:4 (0)

iterations count:30 (1), effective:0 (0)

iterations count:130 (4), effective:24 (0)

iterations count:30 (1), effective:0 (0)

iterations count:226 (7), effective:24 (0)

iterations count:48 (1), effective:2 (0)

iterations count:237 (7), effective:40 (1)

iterations count:30 (1), effective:0 (0)

iterations count:52 (1), effective:2 (0)

iterations count:30 (1), effective:0 (0)

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-00008"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5348"
echo " Executing tool marcie"
echo " Input is MAPK-PT-00008, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r225-tall-167856407800545"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-00008.tgz
mv MAPK-PT-00008 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; 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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;