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-167856407800561.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-00040, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r225-tall-167856407800561
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 10:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 10:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 10:49 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.4K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 9.8K Feb 26 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 10:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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-00040-CTLCardinality-00
FORMULA_NAME MAPK-PT-00040-CTLCardinality-01
FORMULA_NAME MAPK-PT-00040-CTLCardinality-02
FORMULA_NAME MAPK-PT-00040-CTLCardinality-03
FORMULA_NAME MAPK-PT-00040-CTLCardinality-04
FORMULA_NAME MAPK-PT-00040-CTLCardinality-05
FORMULA_NAME MAPK-PT-00040-CTLCardinality-06
FORMULA_NAME MAPK-PT-00040-CTLCardinality-07
FORMULA_NAME MAPK-PT-00040-CTLCardinality-08
FORMULA_NAME MAPK-PT-00040-CTLCardinality-09
FORMULA_NAME MAPK-PT-00040-CTLCardinality-10
FORMULA_NAME MAPK-PT-00040-CTLCardinality-11
FORMULA_NAME MAPK-PT-00040-CTLCardinality-12
FORMULA_NAME MAPK-PT-00040-CTLCardinality-13
FORMULA_NAME MAPK-PT-00040-CTLCardinality-14
FORMULA_NAME MAPK-PT-00040-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678634964648

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-00040
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_00040
(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.850sec


RS generation: 0m 0.325sec


-> reachability set: #nodes 27287 (2.7e+04) #states 478,293,389,221,095 (14)



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

checking: EF [~ [AF [EF [EF [15<=ERKP]]]]]
normalized: E [true U EG [~ [E [true U E [true U 15<=ERKP]]]]]

abstracting: (15<=ERKP)
states: 26,974,968,633,294 (13)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 3.348sec

checking: EF [AF [Phase3<=Phase2]]
normalized: E [true U ~ [EG [~ [Phase3<=Phase2]]]]

abstracting: (Phase3<=Phase2)
states: 136,161,076,285,233 (14)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 6.815sec

checking: AG [EF [EX [E [EX [3<=RafP] U ERKPP<=13]]]]
normalized: ~ [E [true U ~ [E [true U EX [E [EX [3<=RafP] U ERKPP<=13]]]]]]

abstracting: (ERKPP<=13)
states: 443,122,846,852,700 (14)
abstracting: (3<=RafP)
states: 396,985,919,387,714 (14)
..-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.429sec

checking: AG [AF [A [~ [[MEKP_RafP<=35 | 25<=ERK_MEKPP]] U ERKP_Phase3<=32]]]
normalized: ~ [E [true U EG [~ [[~ [EG [~ [ERKP_Phase3<=32]]] & ~ [E [~ [ERKP_Phase3<=32] U [[MEKP_RafP<=35 | 25<=ERK_MEKPP] & ~ [ERKP_Phase3<=32]]]]]]]]]

abstracting: (ERKP_Phase3<=32)
states: 478,293,389,221,095 (14)
abstracting: (25<=ERK_MEKPP)
states: 0
abstracting: (MEKP_RafP<=35)
states: 478,293,389,221,095 (14)
abstracting: (ERKP_Phase3<=32)
states: 478,293,389,221,095 (14)
abstracting: (ERKP_Phase3<=32)
states: 478,293,389,221,095 (14)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.079sec

checking: AG [~ [AG [~ [[E [27<=Phase1 U 33<=ERKP] | AF [RafP<=MEKPP]]]]]]
normalized: ~ [E [true U ~ [E [true U [~ [EG [~ [RafP<=MEKPP]]] | E [27<=Phase1 U 33<=ERKP]]]]]]

abstracting: (33<=ERKP)
states: 0
abstracting: (27<=Phase1)
states: 112,146,493,136,370 (14)
abstracting: (RafP<=MEKPP)
states: 90,803,333,845,215 (13)
.
EG iterations: 1
-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.903sec

checking: EX [EF [E [[EG [RafP<=18] & AF [RasGTP<=14]] U AG [ERKP_Phase3<=MEK]]]]
normalized: EX [E [true U E [[~ [EG [~ [RasGTP<=14]]] & EG [RafP<=18]] U ~ [E [true U ~ [ERKP_Phase3<=MEK]]]]]]

abstracting: (ERKP_Phase3<=MEK)
states: 175,833,833,481,000 (14)
abstracting: (RafP<=18)
states: 392,348,853,491,337 (14)
.
EG iterations: 1
abstracting: (RasGTP<=14)
states: 478,293,389,221,095 (14)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 7.299sec

checking: AX [EF [[EX [EX [Phase2<=Raf]] & [ERK<=RasGTP | AG [~ [RasGTP<=11]]]]]]
normalized: ~ [EX [~ [E [true U [[ERK<=RasGTP | ~ [E [true U RasGTP<=11]]] & EX [EX [Phase2<=Raf]]]]]]]

abstracting: (Phase2<=Raf)
states: 146,680,858,261,689 (14)
..abstracting: (RasGTP<=11)
states: 478,293,389,221,095 (14)
abstracting: (ERK<=RasGTP)
states: 287,360,350,873,690 (14)
.-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m25.679sec

checking: AF [E [2<=RasGTP U [AF [[EX [34<=Phase2] | ~ [RafP_Phase1<=39]]] | ~ [EF [MEK<=RafP]]]]]
normalized: ~ [EG [~ [E [2<=RasGTP U [~ [E [true U MEK<=RafP]] | ~ [EG [~ [[~ [RafP_Phase1<=39] | EX [34<=Phase2]]]]]]]]]]

abstracting: (34<=Phase2)
states: 0
.abstracting: (RafP_Phase1<=39)
states: 478,293,389,221,095 (14)

EG iterations: 0
abstracting: (MEK<=RafP)
states: 413,702,200,969,875 (14)
abstracting: (2<=RasGTP)
states: 413,850,356,086,890 (14)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.274sec

checking: [~ [AG [AF [20<=MEKP_RafP]]] & AX [[E [[AG [ERKPP<=ERKPP_Phase3] | [~ [25<=ERKPP_Phase3] | EX [Raf<=1]]] U AX [ERK_MEKPP<=13]] & [AX [EF [15<=MEKPP]] | AG [33<=RafP_Phase1]]]]]
normalized: [~ [EX [~ [[[~ [E [true U ~ [33<=RafP_Phase1]]] | ~ [EX [~ [E [true U 15<=MEKPP]]]]] & E [[[EX [Raf<=1] | ~ [25<=ERKPP_Phase3]] | ~ [E [true U ~ [ERKPP<=ERKPP_Phase3]]]] U ~ [EX [~ [ERK_MEKPP<=13]]]]]]]] & E [true U EG [~ [20<=MEKP_RafP]]]]

abstracting: (20<=MEKP_RafP)
states: 71,929,176 (7)
.
EG iterations: 1
abstracting: (ERK_MEKPP<=13)
states: 478,219,250,592,109 (14)
.abstracting: (ERKPP<=ERKPP_Phase3)
states: 255,714,555,085,625 (14)
abstracting: (25<=ERKPP_Phase3)
states: 409,814,982,874 (11)
abstracting: (Raf<=1)
states: 54,740,879,736,015 (13)
.abstracting: (15<=MEKPP)
states: 354,006,039,243 (11)
.abstracting: (33<=RafP_Phase1)
states: 0
.-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.616sec

checking: AG [A [[AX [A [24<=MEKP_RafP U MEKP<=4]] & [~ [[[ERKPP_Phase3<=11 | MEKPP_Phase2<=MEKP_Phase2] & ~ [30<=RafP]]] & AX [[Raf_RasGTP<=ERKPP | 12<=MEKPP_Phase2]]]] U MEKP_RafP<=13]]
normalized: ~ [E [true U ~ [[~ [EG [~ [MEKP_RafP<=13]]] & ~ [E [~ [MEKP_RafP<=13] U [~ [[[~ [EX [~ [[Raf_RasGTP<=ERKPP | 12<=MEKPP_Phase2]]]] & ~ [[~ [30<=RafP] & [ERKPP_Phase3<=11 | MEKPP_Phase2<=MEKP_Phase2]]]] & ~ [EX [~ [[~ [EG [~ [MEKP<=4]]] & ~ [E [~ [MEKP<=4] U [~ [24<=MEKP_RafP] & ~ [MEKP<=4]]]]]]]]]] & ~ [MEKP_RafP<=13]]]]]]]]

abstracting: (MEKP_RafP<=13)
states: 477,994,548,816,144 (14)
abstracting: (MEKP<=4)
states: 386,553,529,672,595 (14)
abstracting: (24<=MEKP_RafP)
states: 0
abstracting: (MEKP<=4)
states: 386,553,529,672,595 (14)
abstracting: (MEKP<=4)
states: 386,553,529,672,595 (14)
.
EG iterations: 1
.abstracting: (MEKPP_Phase2<=MEKP_Phase2)
states: 273,715,601,971,329 (14)
abstracting: (ERKPP_Phase3<=11)
states: 421,090,877,502,945 (14)
abstracting: (30<=RafP)
states: 8,256,490,171,602 (12)
abstracting: (12<=MEKPP_Phase2)
states: 3,156,891,980,964 (12)
abstracting: (Raf_RasGTP<=ERKPP)
states: 270,273,791,568,918 (14)
.abstracting: (MEKP_RafP<=13)
states: 477,994,548,816,144 (14)
abstracting: (MEKP_RafP<=13)
states: 477,994,548,816,144 (14)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 3.197sec

checking: AF [[EF [[AG [~ [26<=MEK_RafP]] & AX [[RafP_Phase1<=Phase3 & Phase2<=MEKP_Phase2]]]] & [[14<=MEK_RafP & [[EG [MEKP_Phase2<=16] | EF [Phase2<=15]] | A [AG [ERK<=Raf] U [4<=ERKPP & RafP_Phase1<=35]]]] | [AX [~ [ERK<=MEK_RafP]] | AG [~ [EX [ERKPP_Phase3<=Phase3]]]]]]]
normalized: ~ [EG [~ [[[[~ [E [true U EX [ERKPP_Phase3<=Phase3]]] | ~ [EX [ERK<=MEK_RafP]]] | [14<=MEK_RafP & [[~ [EG [~ [[4<=ERKPP & RafP_Phase1<=35]]]] & ~ [E [~ [[4<=ERKPP & RafP_Phase1<=35]] U [E [true U ~ [ERK<=Raf]] & ~ [[4<=ERKPP & RafP_Phase1<=35]]]]]] | [E [true U Phase2<=15] | EG [MEKP_Phase2<=16]]]]] & E [true U [~ [EX [~ [[RafP_Phase1<=Phase3 & Phase2<=MEKP_Phase2]]]] & ~ [E [true U 26<=MEK_RafP]]]]]]]]

abstracting: (26<=MEK_RafP)
states: 0
abstracting: (Phase2<=MEKP_Phase2)
states: 15,677,159,357,996 (13)
abstracting: (RafP_Phase1<=Phase3)
states: 397,317,929,065,140 (14)
.abstracting: (MEKP_Phase2<=16)
states: 478,244,431,418,707 (14)
.
EG iterations: 1
abstracting: (Phase2<=15)
states: 239,412,629,099,500 (14)
abstracting: (RafP_Phase1<=35)
states: 478,293,389,221,095 (14)
abstracting: (4<=ERKPP)
states: 263,680,200,784,880 (14)
abstracting: (ERK<=Raf)
states: 346,914,866,108,663 (14)
abstracting: (RafP_Phase1<=35)
states: 478,293,389,221,095 (14)
abstracting: (4<=ERKPP)
states: 263,680,200,784,880 (14)
abstracting: (RafP_Phase1<=35)
states: 478,293,389,221,095 (14)
abstracting: (4<=ERKPP)
states: 263,680,200,784,880 (14)
.
EG iterations: 1
abstracting: (14<=MEK_RafP)
states: 298,840,404,951 (11)
abstracting: (ERK<=MEK_RafP)
states: 160,083,257,504,690 (14)
.abstracting: (ERKPP_Phase3<=Phase3)
states: 437,617,024,271,435 (14)
..
EG iterations: 1
-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m23.996sec

checking: E [AX [[Phase1<=9 | AX [ERKP<=Raf_RasGTP]]] U [[Phase3<=36 & EF [MEKP<=ERKP_MEKPP]] & [[[A [A [5<=Phase3 U MEK_RafP<=Phase2] U 18<=ERKP] | AX [[MEKP_RafP<=ERKPP | ERKPP_Phase3<=18]]] & 7<=Raf] & [~ [[[~ [ERK<=24] | ERKP_MEKPP<=Phase2] | AG [Phase1<=MEK_RafP]]] | [EX [[Raf<=MEKP_RafP & MEK<=35]] & 28<=MEKPP_Phase2]]]]]
normalized: E [~ [EX [~ [[Phase1<=9 | ~ [EX [~ [ERKP<=Raf_RasGTP]]]]]]] U [[[[28<=MEKPP_Phase2 & EX [[Raf<=MEKP_RafP & MEK<=35]]] | ~ [[~ [E [true U ~ [Phase1<=MEK_RafP]]] | [ERKP_MEKPP<=Phase2 | ~ [ERK<=24]]]]] & [7<=Raf & [~ [EX [~ [[MEKP_RafP<=ERKPP | ERKPP_Phase3<=18]]]] | [~ [EG [~ [18<=ERKP]]] & ~ [E [~ [18<=ERKP] U [~ [[~ [EG [~ [MEK_RafP<=Phase2]]] & ~ [E [~ [MEK_RafP<=Phase2] U [~ [5<=Phase3] & ~ [MEK_RafP<=Phase2]]]]]] & ~ [18<=ERKP]]]]]]]] & [Phase3<=36 & E [true U MEKP<=ERKP_MEKPP]]]]

abstracting: (MEKP<=ERKP_MEKPP)
states: 238,961,664,204,931 (14)
abstracting: (Phase3<=36)
states: 478,293,389,221,095 (14)
abstracting: (18<=ERKP)
states: 10,882,507,456,480 (13)
abstracting: (MEK_RafP<=Phase2)
states: 478,293,389,221,095 (14)
abstracting: (5<=Phase3)
states: 475,136,445,285,235 (14)
abstracting: (MEK_RafP<=Phase2)
states: 478,293,389,221,095 (14)
abstracting: (MEK_RafP<=Phase2)
states: 478,293,389,221,095 (14)
.
EG iterations: 1
abstracting: (18<=ERKP)
states: 10,882,507,456,480 (13)
abstracting: (18<=ERKP)
states: 10,882,507,456,480 (13)
.
EG iterations: 1
abstracting: (ERKPP_Phase3<=18)
states: 470,614,886,649,135 (14)
abstracting: (MEKP_RafP<=ERKPP)
states: 369,510,789,109,695 (14)
.abstracting: (7<=Raf)
states: 297,723,160,903,410 (14)
abstracting: (ERK<=24)
states: 477,883,574,238,221 (14)
abstracting: (ERKP_MEKPP<=Phase2)
states: 478,293,389,221,095 (14)
abstracting: (Phase1<=MEK_RafP)
states: 8,948,737,199,790 (12)
abstracting: (MEK<=35)
states: 478,293,389,221,095 (14)
abstracting: (Raf<=MEKP_RafP)
states: 85,080,204,529,030 (13)
.abstracting: (28<=MEKPP_Phase2)
states: 0
abstracting: (ERKP<=Raf_RasGTP)
states: 247,666,307,958,350 (14)
.abstracting: (Phase1<=9)
states: 57,945,380,232,225 (13)
.-> the formula is FALSE

FORMULA MAPK-PT-00040-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m32.518sec

checking: [E [[EX [[EG [RasGTP<=32] | RafP<=Phase1]] & AF [~ [6<=RafP_Phase1]]] U [[~ [23<=ERKP_Phase3] & [ERKPP<=ERK & [E [MEKPP<=MEK U 18<=MEKP_Phase2] | [ERK_MEKPP<=ERKP & EG [28<=ERKP]]]]] & ~ [AF [Phase1<=30]]]] & ~ [E [E [[[Phase2<=1 | ERKPP_Phase3<=MEKP] | [MEK_RafP<=17 & Raf<=MEKPP]] U A [14<=MEKPP_Phase2 U MEKPP_Phase2<=38]] U ~ [[~ [8<=RafP_Phase1] | 33<=RafP_Phase1]]]]]
normalized: [~ [E [E [[[MEK_RafP<=17 & Raf<=MEKPP] | [Phase2<=1 | ERKPP_Phase3<=MEKP]] U [~ [EG [~ [MEKPP_Phase2<=38]]] & ~ [E [~ [MEKPP_Phase2<=38] U [~ [14<=MEKPP_Phase2] & ~ [MEKPP_Phase2<=38]]]]]] U ~ [[33<=RafP_Phase1 | ~ [8<=RafP_Phase1]]]]] & E [[~ [EG [6<=RafP_Phase1]] & EX [[RafP<=Phase1 | EG [RasGTP<=32]]]] U [EG [~ [Phase1<=30]] & [[ERKPP<=ERK & [[ERK_MEKPP<=ERKP & EG [28<=ERKP]] | E [MEKPP<=MEK U 18<=MEKP_Phase2]]] & ~ [23<=ERKP_Phase3]]]]]

abstracting: (23<=ERKP_Phase3)
states: 1,347,058,624,087 (12)
abstracting: (18<=MEKP_Phase2)
states: 13,864,978,160 (10)
abstracting: (MEKPP<=MEK)
states: 273,715,601,971,329 (14)
abstracting: (28<=ERKP)
states: 29,980,051,662 (10)
.
EG iterations: 1
abstracting: (ERK_MEKPP<=ERKP)
states: 383,870,723,900,969 (14)
abstracting: (ERKPP<=ERK)
states: 255,714,555,085,625 (14)
abstracting: (Phase1<=30)
states: 478,293,389,221,095 (14)
.
EG iterations: 1
abstracting: (RasGTP<=32)
states: 478,293,389,221,095 (14)

EG iterations: 0
abstracting: (RafP<=Phase1)
states: 421,265,533,075,380 (14)
.abstracting: (6<=RafP_Phase1)
states: 315,735,781,782,330 (14)
.
EG iterations: 1
abstracting: (8<=RafP_Phase1)
states: 269,099,422,323,795 (14)
abstracting: (33<=RafP_Phase1)
states: 0
abstracting: (MEKPP_Phase2<=38)
states: 478,293,389,221,095 (14)
abstracting: (14<=MEKPP_Phase2)
states: 795,159,167,490 (11)
abstracting: (MEKPP_Phase2<=38)
states: 478,293,389,221,095 (14)
abstracting: (MEKPP_Phase2<=38)
states: 478,293,389,221,095 (14)
.
EG iterations: 1
abstracting: (ERKPP_Phase3<=MEKP)
states: 175,833,833,481,000 (14)
abstracting: (Phase2<=1)
states: 51,272,479,016 (10)
abstracting: (Raf<=MEKPP)
states: 90,803,333,845,215 (13)
abstracting: (MEK_RafP<=17)
states: 478,289,735,116,927 (14)
-> the formula is FALSE

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

MC time: 0m21.588sec

checking: [AX [E [[[~ [EX [ERKP_Phase3<=RasGTP]] | [[27<=Phase1 & MEKP_RafP<=MEKP] | ~ [Phase1<=16]]] | A [EX [15<=Raf] U ~ [ERKPP<=MEK]]] U ERKP_Phase3<=ERK]] & EG [~ [[[~ [[~ [MEKP<=6] & EX [12<=ERK_MEKPP]]] & [EF [36<=RafP] & ~ [E [ERKP_MEKPP<=ERKP_MEKPP U 11<=MEKPP_Phase2]]]] | [A [~ [Phase3<=10] U AF [MEK<=9]] | [AG [16<=ERKP_MEKPP] & [EX [MEKP_RafP<=MEK_RafP] | MEK_RafP<=Raf_RasGTP]]]]]]]
normalized: [EG [~ [[[[[MEK_RafP<=Raf_RasGTP | EX [MEKP_RafP<=MEK_RafP]] & ~ [E [true U ~ [16<=ERKP_MEKPP]]]] | [~ [EG [EG [~ [MEK<=9]]]] & ~ [E [EG [~ [MEK<=9]] U [Phase3<=10 & EG [~ [MEK<=9]]]]]]] | [[~ [E [ERKP_MEKPP<=ERKP_MEKPP U 11<=MEKPP_Phase2]] & E [true U 36<=RafP]] & ~ [[EX [12<=ERK_MEKPP] & ~ [MEKP<=6]]]]]]] & ~ [EX [~ [E [[[~ [EG [ERKPP<=MEK]] & ~ [E [ERKPP<=MEK U [ERKPP<=MEK & ~ [EX [15<=Raf]]]]]] | [[~ [Phase1<=16] | [27<=Phase1 & MEKP_RafP<=MEKP]] | ~ [EX [ERKP_Phase3<=RasGTP]]]] U ERKP_Phase3<=ERK]]]]]

abstracting: (ERKP_Phase3<=ERK)
states: 255,714,555,085,625 (14)
abstracting: (ERKP_Phase3<=RasGTP)
states: 287,360,350,873,690 (14)
.abstracting: (MEKP_RafP<=MEKP)
states: 296,508,544,270,819 (14)
abstracting: (27<=Phase1)
states: 112,146,493,136,370 (14)
abstracting: (Phase1<=16)
states: 151,838,862,841,366 (14)
abstracting: (15<=Raf)
states: 141,475,277,766,700 (14)
.abstracting: (ERKPP<=MEK)
states: 175,833,833,481,000 (14)
abstracting: (ERKPP<=MEK)
states: 175,833,833,481,000 (14)
abstracting: (ERKPP<=MEK)
states: 175,833,833,481,000 (14)
.
EG iterations: 1
.abstracting: (MEKP<=6)
states: 437,139,776,346,281 (14)
abstracting: (12<=ERK_MEKPP)
states: 442,731,418,902 (11)
.abstracting: (36<=RafP)
states: 519,363,534,415 (11)
abstracting: (11<=MEKPP_Phase2)
states: 5,738,340,644,220 (12)
abstracting: (ERKP_MEKPP<=ERKP_MEKPP)
states: 478,293,389,221,095 (14)
abstracting: (MEK<=9)
states: 468,354,570,507,319 (14)
.
EG iterations: 1
abstracting: (Phase3<=10)
states: 40,777,146,330,492 (13)
abstracting: (MEK<=9)
states: 468,354,570,507,319 (14)
.
EG iterations: 1
abstracting: (MEK<=9)
states: 468,354,570,507,319 (14)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (16<=ERKP_MEKPP)
states: 8,469,108,785 (9)
abstracting: (MEKP_RafP<=MEK_RafP)
states: 280,534,440,802,347 (14)
.abstracting: (MEK_RafP<=Raf_RasGTP)
states: 369,668,527,879,475 (14)
.
EG iterations: 1
-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m16.103sec

checking: [E [[~ [[[EX [ERK_MEKPP<=24] | ~ [ERKPP<=26]] | [[MEKPP<=7 | ~ [MEKPP<=Raf]] | ~ [[RafP_Phase1<=23 & 6<=RasGTP]]]]] | A [AG [~ [ERKP_MEKPP<=16]] U ~ [[EF [Phase1<=25] & [ERKP<=Phase1 & ERKP<=21]]]]] U ~ [[Raf<=33 & AF [[AX [RasGTP<=MEK] & ~ [MEKP_RafP<=RasGTP]]]]]] & EF [[[AX [A [18<=ERKP_MEKPP U MEKP<=13]] & ~ [[~ [[31<=MEK_RafP | RafP_Phase1<=RafP]] | MEKP<=19]]] & AX [EF [A [34<=Phase3 U ERKP_MEKPP<=13]]]]]]
normalized: [E [true U [~ [EX [~ [E [true U [~ [EG [~ [ERKP_MEKPP<=13]]] & ~ [E [~ [ERKP_MEKPP<=13] U [~ [34<=Phase3] & ~ [ERKP_MEKPP<=13]]]]]]]]] & [~ [[MEKP<=19 | ~ [[31<=MEK_RafP | RafP_Phase1<=RafP]]]] & ~ [EX [~ [[~ [EG [~ [MEKP<=13]]] & ~ [E [~ [MEKP<=13] U [~ [18<=ERKP_MEKPP] & ~ [MEKP<=13]]]]]]]]]]] & E [[[~ [EG [[[ERKP<=Phase1 & ERKP<=21] & E [true U Phase1<=25]]]] & ~ [E [[[ERKP<=Phase1 & ERKP<=21] & E [true U Phase1<=25]] U [E [true U ERKP_MEKPP<=16] & [[ERKP<=Phase1 & ERKP<=21] & E [true U Phase1<=25]]]]]] | ~ [[[~ [[RafP_Phase1<=23 & 6<=RasGTP]] | [MEKPP<=7 | ~ [MEKPP<=Raf]]] | [~ [ERKPP<=26] | EX [ERK_MEKPP<=24]]]]] U ~ [[Raf<=33 & ~ [EG [~ [[~ [MEKP_RafP<=RasGTP] & ~ [EX [~ [RasGTP<=MEK]]]]]]]]]]]

abstracting: (RasGTP<=MEK)
states: 126,000,953,900,500 (14)
.abstracting: (MEKP_RafP<=RasGTP)
states: 405,893,543,550,255 (14)
.
EG iterations: 1
abstracting: (Raf<=33)
states: 476,634,345,275,819 (14)
abstracting: (ERK_MEKPP<=24)
states: 478,293,389,221,095 (14)
.abstracting: (ERKPP<=26)
states: 478,208,967,436,945 (14)
abstracting: (MEKPP<=Raf)
states: 413,702,200,969,875 (14)
abstracting: (MEKPP<=7)
states: 451,810,000,924,805 (14)
abstracting: (6<=RasGTP)
states: 255,739,755,924,370 (14)
abstracting: (RafP_Phase1<=23)
states: 446,576,636,934,868 (14)
abstracting: (Phase1<=25)
states: 340,469,494,578,045 (14)
abstracting: (ERKP<=21)
states: 476,073,343,209,010 (14)
abstracting: (ERKP<=Phase1)
states: 447,848,730,924,810 (14)
abstracting: (ERKP_MEKPP<=16)
states: 478,291,074,803,836 (14)
abstracting: (Phase1<=25)
states: 340,469,494,578,045 (14)
abstracting: (ERKP<=21)
states: 476,073,343,209,010 (14)
abstracting: (ERKP<=Phase1)
states: 447,848,730,924,810 (14)
abstracting: (Phase1<=25)
states: 340,469,494,578,045 (14)
abstracting: (ERKP<=21)
states: 476,073,343,209,010 (14)
abstracting: (ERKP<=Phase1)
states: 447,848,730,924,810 (14)

before gc: list nodes free: 692694

after gc: idd nodes used:1930470, unused:62069530; list nodes free:684921706
.
EG iterations: 1
abstracting: (MEKP<=13)
states: 477,498,230,053,605 (14)
abstracting: (18<=ERKP_MEKPP)
states: 511,489,433 (8)
abstracting: (MEKP<=13)
states: 477,498,230,053,605 (14)
abstracting: (MEKP<=13)
states: 477,498,230,053,605 (14)
.
EG iterations: 1
.abstracting: (RafP_Phase1<=RafP)
states: 249,566,393,962,831 (14)
abstracting: (31<=MEK_RafP)
states: 0
abstracting: (MEKP<=19)
states: 478,293,057,122,559 (14)
abstracting: (ERKP_MEKPP<=13)
states: 478,219,250,592,109 (14)
abstracting: (34<=Phase3)
states: 0
abstracting: (ERKP_MEKPP<=13)
states: 478,219,250,592,109 (14)
abstracting: (ERKP_MEKPP<=13)
states: 478,219,250,592,109 (14)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA MAPK-PT-00040-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m47.507sec

checking: [[~ [[AG [~ [[[MEK<=9 & ERKP_Phase3<=Raf_RasGTP] | [MEK_RafP<=4 | 20<=RafP]]]] | E [[[[ERK_MEKPP<=ERK_MEKPP & 2<=MEK_RafP] | ~ [MEK<=MEKP_RafP]] & [[MEK_RafP<=MEKP_Phase2 | ERKPP_Phase3<=Raf] | MEKP_RafP<=Phase1]] U ~ [AG [24<=MEKP_RafP]]]]] & ~ [EF [[[[[ERK_MEKPP<=RafP_Phase1 & 31<=RasGTP] & [MEKPP_Phase2<=8 | Phase1<=ERK_MEKPP]] | [EF [MEKP<=17] & [RafP_Phase1<=ERKPP_Phase3 & MEK<=14]]] | EF [AG [MEKP_RafP<=Phase3]]]]]] | EX [~ [[EX [EF [Phase3<=1]] & EX [[~ [Raf_RasGTP<=ERKPP] | ~ [MEK_RafP<=Raf_RasGTP]]]]]]]
normalized: [EX [~ [[EX [[~ [MEK_RafP<=Raf_RasGTP] | ~ [Raf_RasGTP<=ERKPP]]] & EX [E [true U Phase3<=1]]]]] | [~ [E [true U [E [true U ~ [E [true U ~ [MEKP_RafP<=Phase3]]]] | [[[RafP_Phase1<=ERKPP_Phase3 & MEK<=14] & E [true U MEKP<=17]] | [[MEKPP_Phase2<=8 | Phase1<=ERK_MEKPP] & [ERK_MEKPP<=RafP_Phase1 & 31<=RasGTP]]]]]] & ~ [[E [[[MEKP_RafP<=Phase1 | [MEK_RafP<=MEKP_Phase2 | ERKPP_Phase3<=Raf]] & [~ [MEK<=MEKP_RafP] | [ERK_MEKPP<=ERK_MEKPP & 2<=MEK_RafP]]] U E [true U ~ [24<=MEKP_RafP]]] | ~ [E [true U [[MEK_RafP<=4 | 20<=RafP] | [MEK<=9 & ERKP_Phase3<=Raf_RasGTP]]]]]]]]

abstracting: (ERKP_Phase3<=Raf_RasGTP)
states: 247,666,307,958,350 (14)
abstracting: (MEK<=9)
states: 468,354,570,507,319 (14)
abstracting: (20<=RafP)
states: 74,415,193,735,545 (13)
abstracting: (MEK_RafP<=4)
states: 411,028,748,781,675 (14)
abstracting: (24<=MEKP_RafP)
states: 0
abstracting: (2<=MEK_RafP)
states: 230,738,678,087,340 (14)
abstracting: (ERK_MEKPP<=ERK_MEKPP)
states: 478,293,389,221,095 (14)
abstracting: (MEK<=MEKP_RafP)
states: 257,581,746,861,581 (14)
abstracting: (ERKPP_Phase3<=Raf)
states: 346,914,866,108,663 (14)
abstracting: (MEK_RafP<=MEKP_Phase2)
states: 296,508,544,270,819 (14)
abstracting: (MEKP_RafP<=Phase1)
states: 473,160,786,299,235 (14)
abstracting: (31<=RasGTP)
states: 0
abstracting: (ERK_MEKPP<=RafP_Phase1)
states: 431,959,227,141,945 (14)
abstracting: (Phase1<=ERK_MEKPP)
states: 9,620,256,016,528 (12)
abstracting: (MEKPP_Phase2<=8)
states: 461,776,439,812,655 (14)
abstracting: (MEKP<=17)
states: 478,279,524,242,935 (14)
abstracting: (MEK<=14)
states: 477,939,383,181,852 (14)
abstracting: (RafP_Phase1<=ERKPP_Phase3)
states: 159,809,301,837,625 (14)
abstracting: (MEKP_RafP<=Phase3)
states: 476,334,872,794,723 (14)
abstracting: (Phase3<=1)
states: 204,377,550,245 (11)
.abstracting: (Raf_RasGTP<=ERKPP)
states: 270,273,791,568,918 (14)
abstracting: (MEK_RafP<=Raf_RasGTP)
states: 369,668,527,879,475 (14)
..-> the formula is FALSE

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

MC time: 1m 7.634sec

totally nodes used: 74646925 (7.5e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 1370780458 260146114 1630926572
used/not used/entry size/cache size: 37760324 29348540 16 1024MB
basic ops cache: hits/miss/sum: 396729550 84904793 481634343
used/not used/entry size/cache size: 11290964 5486252 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: 15373832 2419500 17793332
used/not used/entry size/cache size: 689586 7699022 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 58331943
1 7644711
2 635640
3 75892
4 116520
5 37563
6 18467
7 154908
8 42600
9 10102
>= 10 40518

Total processing time: 17m20.323sec


BK_STOP 1678636005273

--------------------
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.001sec


iterations count:3665 (122), effective:560 (18)

initing FirstDep: 0m 0.000sec


iterations count:619 (20), effective:114 (3)

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

iterations count:780 (26), effective:176 (5)

iterations count:132 (4), effective:17 (0)

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

iterations count:890 (29), effective:140 (4)

iterations count:667 (22), effective:132 (4)

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

iterations count:1924 (64), effective:316 (10)

iterations count:887 (29), effective:78 (2)

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

iterations count:353 (11), effective:46 (1)

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

iterations count:1556 (51), effective:165 (5)

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

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

iterations count:163 (5), effective:19 (0)

iterations count:1010 (33), effective:154 (5)

iterations count:2069 (68), effective:303 (10)

iterations count:434 (14), effective:46 (1)

iterations count:905 (30), effective:172 (5)

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

iterations count:212 (7), effective:28 (0)

iterations count:560 (18), effective:100 (3)

iterations count:116 (3), effective:12 (0)

iterations count:2493 (83), effective:364 (12)

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

iterations count:414 (13), effective:40 (1)

iterations count:654 (21), effective:78 (2)

iterations count:671 (22), effective:143 (4)

iterations count:1340 (44), effective:142 (4)

iterations count:1155 (38), effective:121 (4)

iterations count:509 (16), effective:109 (3)

iterations count:50 (1), effective:5 (0)

iterations count:270 (9), effective:25 (0)

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

iterations count:270 (9), effective:25 (0)

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

iterations count:270 (9), effective:25 (0)

iterations count:372 (12), effective:19 (0)

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

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

iterations count:58 (1), effective:7 (0)

iterations count:342 (11), effective:41 (1)

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

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

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

iterations count:922 (30), effective:227 (7)

iterations count:1259 (41), effective:234 (7)

iterations count:689 (22), effective:154 (5)

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-00040"
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-00040, 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-167856407800561"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-00040.tgz
mv MAPK-PT-00040 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 ;