About the Execution of Marcie for ERK-PT-000001
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5448.191 | 4535.00 | 4060.00 | 0.00 | FTTFFFTTTTFFFTTT | normal |
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.r161-tall-167838844500001.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 ERK-PT-000001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-tall-167838844500001
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 8.4K Feb 26 16:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 16:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 16:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 16:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.4K 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 ERK-PT-000001-CTLCardinality-00
FORMULA_NAME ERK-PT-000001-CTLCardinality-01
FORMULA_NAME ERK-PT-000001-CTLCardinality-02
FORMULA_NAME ERK-PT-000001-CTLCardinality-03
FORMULA_NAME ERK-PT-000001-CTLCardinality-04
FORMULA_NAME ERK-PT-000001-CTLCardinality-05
FORMULA_NAME ERK-PT-000001-CTLCardinality-06
FORMULA_NAME ERK-PT-000001-CTLCardinality-07
FORMULA_NAME ERK-PT-000001-CTLCardinality-08
FORMULA_NAME ERK-PT-000001-CTLCardinality-09
FORMULA_NAME ERK-PT-000001-CTLCardinality-10
FORMULA_NAME ERK-PT-000001-CTLCardinality-11
FORMULA_NAME ERK-PT-000001-CTLCardinality-12
FORMULA_NAME ERK-PT-000001-CTLCardinality-13
FORMULA_NAME ERK-PT-000001-CTLCardinality-14
FORMULA_NAME ERK-PT-000001-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679411931598
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=ERK-PT-000001
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: ERK_PT_000001
(NrP: 11 NrTr: 11 NrArc: 34)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.852sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 21 (2.1e+01) #states 13
starting MCC model checker
--------------------------
checking: EF [~ [EF [EX [[AG [Raf1Star_RKIP<=1] | AF [RKIPP_RP<=1]]]]]]
normalized: E [true U ~ [E [true U EX [[~ [EG [~ [RKIPP_RP<=1]]] | ~ [E [true U ~ [Raf1Star_RKIP<=1]]]]]]]]
abstracting: (Raf1Star_RKIP<=1)
states: 13
abstracting: (RKIPP_RP<=1)
states: 13
.
EG iterations: 1
.-> the formula is FALSE
FORMULA ERK-PT-000001-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [EF [EG [EF [[ERKPP<=1 & ~ [RP<=RKIPP_RP]]]]]]
normalized: ~ [E [true U EG [E [true U [~ [RP<=RKIPP_RP] & ERKPP<=1]]]]]
abstracting: (ERKPP<=1)
states: 13
abstracting: (RP<=RKIPP_RP)
states: 3
EG iterations: 0
-> the formula is FALSE
FORMULA ERK-PT-000001-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [[AX [Raf1Star_RKIP<=MEKPP_ERK] & AF [1<=ERKPP]]]
normalized: ~ [[~ [EG [~ [1<=ERKPP]]] & ~ [EX [~ [Raf1Star_RKIP<=MEKPP_ERK]]]]]
abstracting: (Raf1Star_RKIP<=MEKPP_ERK)
states: 11
.abstracting: (1<=ERKPP)
states: 4
.
EG iterations: 1
-> the formula is TRUE
FORMULA ERK-PT-000001-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EX [EG [E [ERK<=0 U E [EG [RKIPP<=0] U ~ [ERKPP<=Raf1Star_RKIP]]]]]
normalized: EX [EG [E [ERK<=0 U E [EG [RKIPP<=0] U ~ [ERKPP<=Raf1Star_RKIP]]]]]
abstracting: (ERKPP<=Raf1Star_RKIP)
states: 10
abstracting: (RKIPP<=0)
states: 10
.
EG iterations: 1
abstracting: (ERK<=0)
states: 9
.
EG iterations: 1
.-> the formula is TRUE
FORMULA ERK-PT-000001-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [EX [EF [[~ [EX [ERK<=RKIPP]] & RKIPP<=ERK]]]]
normalized: ~ [EX [E [true U [~ [EX [ERK<=RKIPP]] & RKIPP<=ERK]]]]
abstracting: (RKIPP<=ERK)
states: 11
abstracting: (ERK<=RKIPP)
states: 10
..-> the formula is TRUE
FORMULA ERK-PT-000001-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EG [E [MEKPP_ERK<=0 U [RKIPP_RP<=MEKPP_ERK | [RP<=0 | ~ [EX [MEKPP<=ERK]]]]]]
normalized: EG [E [MEKPP_ERK<=0 U [[~ [EX [MEKPP<=ERK]] | RP<=0] | RKIPP_RP<=MEKPP_ERK]]]
abstracting: (RKIPP_RP<=MEKPP_ERK)
states: 11
abstracting: (RP<=0)
states: 3
abstracting: (MEKPP<=ERK)
states: 8
.abstracting: (MEKPP_ERK<=0)
states: 9
EG iterations: 0
-> the formula is TRUE
FORMULA ERK-PT-000001-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [EG [EG [[[[AF [ERK<=MEKPP_ERK] | [1<=Raf1Star_RKIP_ERKPP & ERK<=Raf1Star_RKIP_ERKPP]] | ~ [EG [MEKPP<=RKIPP_RP]]] & RKIPP<=0]]]]
normalized: ~ [EG [EG [[RKIPP<=0 & [[~ [EG [~ [ERK<=MEKPP_ERK]]] | [1<=Raf1Star_RKIP_ERKPP & ERK<=Raf1Star_RKIP_ERKPP]] | ~ [EG [MEKPP<=RKIPP_RP]]]]]]]
abstracting: (MEKPP<=RKIPP_RP)
states: 6
..
EG iterations: 2
abstracting: (ERK<=Raf1Star_RKIP_ERKPP)
states: 9
abstracting: (1<=Raf1Star_RKIP_ERKPP)
states: 1
abstracting: (ERK<=MEKPP_ERK)
states: 9
.
EG iterations: 1
abstracting: (RKIPP<=0)
states: 10
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA ERK-PT-000001-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [[EG [~ [EF [EG [1<=RKIP]]]] | [AF [[[[Raf1Star_RKIP<=1 | 1<=MEKPP_ERK] | [1<=Raf1Star_RKIP_ERKPP & RKIP<=MEKPP]] & Raf1Star<=1]] | 1<=MEKPP_ERK]]]
normalized: ~ [EG [~ [[EG [~ [E [true U EG [1<=RKIP]]]] | [~ [EG [~ [[[[1<=Raf1Star_RKIP_ERKPP & RKIP<=MEKPP] | [Raf1Star_RKIP<=1 | 1<=MEKPP_ERK]] & Raf1Star<=1]]]] | 1<=MEKPP_ERK]]]]]
abstracting: (1<=MEKPP_ERK)
states: 4
abstracting: (Raf1Star<=1)
states: 13
abstracting: (1<=MEKPP_ERK)
states: 4
abstracting: (Raf1Star_RKIP<=1)
states: 13
abstracting: (RKIP<=MEKPP)
states: 12
abstracting: (1<=Raf1Star_RKIP_ERKPP)
states: 1
.
EG iterations: 1
abstracting: (1<=RKIP)
states: 3
..
EG iterations: 2
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA ERK-PT-000001-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EG [[~ [1<=RKIPP_RP] | [~ [[AX [E [MEKPP<=0 U 1<=Raf1Star]] & AG [A [MEKPP<=Raf1Star U 1<=ERK]]]] | [MEKPP_ERK<=MEKPP_ERK & ~ [[RKIPP<=0 & A [Raf1Star_RKIP_ERKPP<=MEKPP_ERK U 1<=RKIPP]]]]]]]
normalized: EG [[~ [1<=RKIPP_RP] | [[~ [[[~ [EG [~ [1<=RKIPP]]] & ~ [E [~ [1<=RKIPP] U [~ [1<=RKIPP] & ~ [Raf1Star_RKIP_ERKPP<=MEKPP_ERK]]]]] & RKIPP<=0]] & MEKPP_ERK<=MEKPP_ERK] | ~ [[~ [E [true U ~ [[~ [EG [~ [1<=ERK]]] & ~ [E [~ [1<=ERK] U [~ [MEKPP<=Raf1Star] & ~ [1<=ERK]]]]]]]] & ~ [EX [~ [E [MEKPP<=0 U 1<=Raf1Star]]]]]]]]]
abstracting: (1<=Raf1Star)
states: 9
abstracting: (MEKPP<=0)
states: 4
.abstracting: (1<=ERK)
states: 4
abstracting: (MEKPP<=Raf1Star)
states: 10
abstracting: (1<=ERK)
states: 4
abstracting: (1<=ERK)
states: 4
.
EG iterations: 1
abstracting: (MEKPP_ERK<=MEKPP_ERK)
states: 13
abstracting: (RKIPP<=0)
states: 10
abstracting: (Raf1Star_RKIP_ERKPP<=MEKPP_ERK)
states: 12
abstracting: (1<=RKIPP)
states: 3
abstracting: (1<=RKIPP)
states: 3
abstracting: (1<=RKIPP)
states: 3
.
EG iterations: 1
abstracting: (1<=RKIPP_RP)
states: 3
EG iterations: 0
-> the formula is TRUE
FORMULA ERK-PT-000001-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: E [~ [[~ [[A [ERK<=1 U Raf1Star_RKIP<=0] | [AG [ERKPP<=ERK] & [1<=RKIP & Raf1Star_RKIP_ERKPP<=ERK]]]] | [EG [[1<=ERKPP | [Raf1Star<=0 & 1<=RKIPP_RP]]] | EG [1<=ERKPP]]]] U ERK<=0]
normalized: E [~ [[~ [[[~ [E [~ [Raf1Star_RKIP<=0] U [~ [ERK<=1] & ~ [Raf1Star_RKIP<=0]]]] & ~ [EG [~ [Raf1Star_RKIP<=0]]]] | [[1<=RKIP & Raf1Star_RKIP_ERKPP<=ERK] & ~ [E [true U ~ [ERKPP<=ERK]]]]]] | [EG [1<=ERKPP] | EG [[[Raf1Star<=0 & 1<=RKIPP_RP] | 1<=ERKPP]]]]] U ERK<=0]
abstracting: (ERK<=0)
states: 9
abstracting: (1<=ERKPP)
states: 4
abstracting: (1<=RKIPP_RP)
states: 3
abstracting: (Raf1Star<=0)
states: 4
.
EG iterations: 1
abstracting: (1<=ERKPP)
states: 4
.
EG iterations: 1
abstracting: (ERKPP<=ERK)
states: 9
abstracting: (Raf1Star_RKIP_ERKPP<=ERK)
states: 12
abstracting: (1<=RKIP)
states: 3
abstracting: (Raf1Star_RKIP<=0)
states: 10
..
EG iterations: 2
abstracting: (Raf1Star_RKIP<=0)
states: 10
abstracting: (ERK<=1)
states: 13
abstracting: (Raf1Star_RKIP<=0)
states: 10
-> the formula is TRUE
FORMULA ERK-PT-000001-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: [[EX [E [~ [1<=RKIPP] U 1<=RP]] | [EX [[~ [EX [1<=Raf1Star_RKIP_ERKPP]] | ~ [[A [Raf1Star_RKIP<=MEKPP U MEKPP<=MEKPP_ERK] | ERKPP<=0]]]] | [~ [AG [1<=Raf1Star]] & AG [~ [[EF [MEKPP<=RP] | [1<=RKIP & ERK<=0]]]]]]] | ~ [AX [Raf1Star_RKIP<=RKIPP_RP]]]
normalized: [EX [~ [Raf1Star_RKIP<=RKIPP_RP]] | [[[~ [E [true U [[1<=RKIP & ERK<=0] | E [true U MEKPP<=RP]]]] & E [true U ~ [1<=Raf1Star]]] | EX [[~ [[[~ [EG [~ [MEKPP<=MEKPP_ERK]]] & ~ [E [~ [MEKPP<=MEKPP_ERK] U [~ [Raf1Star_RKIP<=MEKPP] & ~ [MEKPP<=MEKPP_ERK]]]]] | ERKPP<=0]] | ~ [EX [1<=Raf1Star_RKIP_ERKPP]]]]] | EX [E [~ [1<=RKIPP] U 1<=RP]]]]
abstracting: (1<=RP)
states: 10
abstracting: (1<=RKIPP)
states: 3
.abstracting: (1<=Raf1Star_RKIP_ERKPP)
states: 1
.abstracting: (ERKPP<=0)
states: 9
abstracting: (MEKPP<=MEKPP_ERK)
states: 4
abstracting: (Raf1Star_RKIP<=MEKPP)
states: 12
abstracting: (MEKPP<=MEKPP_ERK)
states: 4
abstracting: (MEKPP<=MEKPP_ERK)
states: 4
.
EG iterations: 1
.abstracting: (1<=Raf1Star)
states: 9
abstracting: (MEKPP<=RP)
states: 11
abstracting: (ERK<=0)
states: 9
abstracting: (1<=RKIP)
states: 3
abstracting: (Raf1Star_RKIP<=RKIPP_RP)
states: 10
.-> the formula is TRUE
FORMULA ERK-PT-000001-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: E [EF [[MEKPP_ERK<=1 & [~ [A [1<=RKIP U ERKPP<=RKIP]] & E [AF [1<=Raf1Star_RKIP_ERKPP] U EG [ERK<=ERKPP]]]]] U A [[~ [[EF [Raf1Star_RKIP<=MEKPP] | ~ [[RP<=Raf1Star | RKIPP_RP<=0]]]] | EG [AF [1<=MEKPP_ERK]]] U ~ [RKIPP_RP<=Raf1Star]]]
normalized: E [E [true U [[E [~ [EG [~ [1<=Raf1Star_RKIP_ERKPP]]] U EG [ERK<=ERKPP]] & ~ [[~ [EG [~ [ERKPP<=RKIP]]] & ~ [E [~ [ERKPP<=RKIP] U [~ [1<=RKIP] & ~ [ERKPP<=RKIP]]]]]]] & MEKPP_ERK<=1]] U [~ [EG [RKIPP_RP<=Raf1Star]] & ~ [E [RKIPP_RP<=Raf1Star U [~ [[EG [~ [EG [~ [1<=MEKPP_ERK]]]] | ~ [[~ [[RP<=Raf1Star | RKIPP_RP<=0]] | E [true U Raf1Star_RKIP<=MEKPP]]]]] & RKIPP_RP<=Raf1Star]]]]]
abstracting: (RKIPP_RP<=Raf1Star)
states: 13
abstracting: (Raf1Star_RKIP<=MEKPP)
states: 12
abstracting: (RKIPP_RP<=0)
states: 10
abstracting: (RP<=Raf1Star)
states: 9
abstracting: (1<=MEKPP_ERK)
states: 4
.
EG iterations: 1
.
EG iterations: 1
abstracting: (RKIPP_RP<=Raf1Star)
states: 13
abstracting: (RKIPP_RP<=Raf1Star)
states: 13
EG iterations: 0
abstracting: (MEKPP_ERK<=1)
states: 13
abstracting: (ERKPP<=RKIP)
states: 10
abstracting: (1<=RKIP)
states: 3
abstracting: (ERKPP<=RKIP)
states: 10
abstracting: (ERKPP<=RKIP)
states: 10
..
EG iterations: 2
abstracting: (ERK<=ERKPP)
states: 9
.
EG iterations: 1
abstracting: (1<=Raf1Star_RKIP_ERKPP)
states: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA ERK-PT-000001-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [A [[EG [[AG [Raf1Star_RKIP<=1] & [[RP<=RKIP | MEKPP_ERK<=Raf1Star] | [1<=MEKPP_ERK | RKIP<=0]]]] & [~ [EX [1<=Raf1Star]] | ~ [AX [AX [1<=ERKPP]]]]] U AF [~ [EF [EF [Raf1Star_RKIP_ERKPP<=0]]]]] & AX [E [[EX [AG [ERK<=1]] | RKIPP_RP<=RP] U [~ [[[MEKPP<=RKIP & 1<=Raf1Star_RKIP_ERKPP] & [1<=MEKPP_ERK & 1<=RP]]] | Raf1Star_RKIP<=0]]]]
normalized: [[~ [EG [EG [E [true U E [true U Raf1Star_RKIP_ERKPP<=0]]]]] & ~ [E [EG [E [true U E [true U Raf1Star_RKIP_ERKPP<=0]]] U [~ [[[EX [EX [~ [1<=ERKPP]]] | ~ [EX [1<=Raf1Star]]] & EG [[[[1<=MEKPP_ERK | RKIP<=0] | [RP<=RKIP | MEKPP_ERK<=Raf1Star]] & ~ [E [true U ~ [Raf1Star_RKIP<=1]]]]]]] & EG [E [true U E [true U Raf1Star_RKIP_ERKPP<=0]]]]]]] & ~ [EX [~ [E [[EX [~ [E [true U ~ [ERK<=1]]]] | RKIPP_RP<=RP] U [~ [[[1<=MEKPP_ERK & 1<=RP] & [MEKPP<=RKIP & 1<=Raf1Star_RKIP_ERKPP]]] | Raf1Star_RKIP<=0]]]]]]
abstracting: (Raf1Star_RKIP<=0)
states: 10
abstracting: (1<=Raf1Star_RKIP_ERKPP)
states: 1
abstracting: (MEKPP<=RKIP)
states: 6
abstracting: (1<=RP)
states: 10
abstracting: (1<=MEKPP_ERK)
states: 4
abstracting: (RKIPP_RP<=RP)
states: 10
abstracting: (ERK<=1)
states: 13
..abstracting: (Raf1Star_RKIP_ERKPP<=0)
states: 12
EG iterations: 0
abstracting: (Raf1Star_RKIP<=1)
states: 13
abstracting: (MEKPP_ERK<=Raf1Star)
states: 12
abstracting: (RP<=RKIP)
states: 6
abstracting: (RKIP<=0)
states: 10
abstracting: (1<=MEKPP_ERK)
states: 4
EG iterations: 0
abstracting: (1<=Raf1Star)
states: 9
.abstracting: (1<=ERKPP)
states: 4
..abstracting: (Raf1Star_RKIP_ERKPP<=0)
states: 12
EG iterations: 0
abstracting: (Raf1Star_RKIP_ERKPP<=0)
states: 12
EG iterations: 0
EG iterations: 0
-> the formula is FALSE
FORMULA ERK-PT-000001-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EX [[[1<=Raf1Star & [MEKPP<=Raf1Star & [EG [EX [1<=Raf1Star_RKIP_ERKPP]] & AG [E [1<=ERK U MEKPP<=1]]]]] | [[[~ [[~ [Raf1Star_RKIP<=MEKPP] | EX [RKIPP_RP<=ERKPP]]] & EF [EF [1<=MEKPP]]] | [RKIPP_RP<=0 & [~ [[MEKPP<=1 & Raf1Star<=1]] & ~ [1<=Raf1Star]]]] & [A [Raf1Star<=ERKPP U [AG [1<=RKIP] & E [Raf1Star_RKIP<=1 U RP<=1]]] & EF [~ [[1<=Raf1Star_RKIP_ERKPP | 1<=RKIPP]]]]]]]
normalized: EX [[[[[~ [E [true U ~ [E [1<=ERK U MEKPP<=1]]]] & EG [EX [1<=Raf1Star_RKIP_ERKPP]]] & MEKPP<=Raf1Star] & 1<=Raf1Star] | [[E [true U ~ [[1<=Raf1Star_RKIP_ERKPP | 1<=RKIPP]]] & [~ [EG [~ [[E [Raf1Star_RKIP<=1 U RP<=1] & ~ [E [true U ~ [1<=RKIP]]]]]]] & ~ [E [~ [[E [Raf1Star_RKIP<=1 U RP<=1] & ~ [E [true U ~ [1<=RKIP]]]]] U [~ [Raf1Star<=ERKPP] & ~ [[E [Raf1Star_RKIP<=1 U RP<=1] & ~ [E [true U ~ [1<=RKIP]]]]]]]]]] & [[[~ [1<=Raf1Star] & ~ [[MEKPP<=1 & Raf1Star<=1]]] & RKIPP_RP<=0] | [E [true U E [true U 1<=MEKPP]] & ~ [[EX [RKIPP_RP<=ERKPP] | ~ [Raf1Star_RKIP<=MEKPP]]]]]]]]
abstracting: (Raf1Star_RKIP<=MEKPP)
states: 12
abstracting: (RKIPP_RP<=ERKPP)
states: 11
.abstracting: (1<=MEKPP)
states: 9
abstracting: (RKIPP_RP<=0)
states: 10
abstracting: (Raf1Star<=1)
states: 13
abstracting: (MEKPP<=1)
states: 13
abstracting: (1<=Raf1Star)
states: 9
abstracting: (1<=RKIP)
states: 3
abstracting: (RP<=1)
states: 13
abstracting: (Raf1Star_RKIP<=1)
states: 13
abstracting: (Raf1Star<=ERKPP)
states: 7
abstracting: (1<=RKIP)
states: 3
abstracting: (RP<=1)
states: 13
abstracting: (Raf1Star_RKIP<=1)
states: 13
abstracting: (1<=RKIP)
states: 3
abstracting: (RP<=1)
states: 13
abstracting: (Raf1Star_RKIP<=1)
states: 13
EG iterations: 0
abstracting: (1<=RKIPP)
states: 3
abstracting: (1<=Raf1Star_RKIP_ERKPP)
states: 1
abstracting: (1<=Raf1Star)
states: 9
abstracting: (MEKPP<=Raf1Star)
states: 10
abstracting: (1<=Raf1Star_RKIP_ERKPP)
states: 1
...
EG iterations: 2
abstracting: (MEKPP<=1)
states: 13
abstracting: (1<=ERK)
states: 4
.-> the formula is FALSE
FORMULA ERK-PT-000001-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [A [E [EG [A [Raf1Star<=0 U 1<=Raf1Star_RKIP_ERKPP]] U [EG [MEKPP_ERK<=MEKPP_ERK] | AG [E [Raf1Star_RKIP<=MEKPP_ERK U RP<=0]]]] U AF [E [[~ [1<=RP] & EX [MEKPP_ERK<=ERKPP]] U ~ [[RKIP<=Raf1Star & 1<=ERK]]]]] | [AX [AF [EF [MEKPP<=Raf1Star]]] & EX [[AG [Raf1Star<=1] & [[Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP_ERKPP | ~ [A [RKIPP_RP<=Raf1Star_RKIP_ERKPP U Raf1Star<=RKIPP_RP]]] | EG [EG [1<=RP]]]]]]]
normalized: [[EX [[[EG [EG [1<=RP]] | [~ [[~ [EG [~ [Raf1Star<=RKIPP_RP]]] & ~ [E [~ [Raf1Star<=RKIPP_RP] U [~ [RKIPP_RP<=Raf1Star_RKIP_ERKPP] & ~ [Raf1Star<=RKIPP_RP]]]]]] | Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP_ERKPP]] & ~ [E [true U ~ [Raf1Star<=1]]]]] & ~ [EX [EG [~ [E [true U MEKPP<=Raf1Star]]]]]] | [~ [EG [EG [~ [E [[EX [MEKPP_ERK<=ERKPP] & ~ [1<=RP]] U ~ [[RKIP<=Raf1Star & 1<=ERK]]]]]]] & ~ [E [EG [~ [E [[EX [MEKPP_ERK<=ERKPP] & ~ [1<=RP]] U ~ [[RKIP<=Raf1Star & 1<=ERK]]]]] U [~ [E [EG [[~ [EG [~ [1<=Raf1Star_RKIP_ERKPP]]] & ~ [E [~ [1<=Raf1Star_RKIP_ERKPP] U [~ [Raf1Star<=0] & ~ [1<=Raf1Star_RKIP_ERKPP]]]]]] U [~ [E [true U ~ [E [Raf1Star_RKIP<=MEKPP_ERK U RP<=0]]]] | EG [MEKPP_ERK<=MEKPP_ERK]]]] & EG [~ [E [[EX [MEKPP_ERK<=ERKPP] & ~ [1<=RP]] U ~ [[RKIP<=Raf1Star & 1<=ERK]]]]]]]]]]
abstracting: (1<=ERK)
states: 4
abstracting: (RKIP<=Raf1Star)
states: 13
abstracting: (1<=RP)
states: 10
abstracting: (MEKPP_ERK<=ERKPP)
states: 9
...
EG iterations: 2
abstracting: (MEKPP_ERK<=MEKPP_ERK)
states: 13
EG iterations: 0
abstracting: (RP<=0)
states: 3
abstracting: (Raf1Star_RKIP<=MEKPP_ERK)
states: 11
abstracting: (1<=Raf1Star_RKIP_ERKPP)
states: 1
abstracting: (Raf1Star<=0)
states: 4
abstracting: (1<=Raf1Star_RKIP_ERKPP)
states: 1
abstracting: (1<=Raf1Star_RKIP_ERKPP)
states: 1
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=ERK)
states: 4
abstracting: (RKIP<=Raf1Star)
states: 13
abstracting: (1<=RP)
states: 10
abstracting: (MEKPP_ERK<=ERKPP)
states: 9
...
EG iterations: 2
abstracting: (1<=ERK)
states: 4
abstracting: (RKIP<=Raf1Star)
states: 13
abstracting: (1<=RP)
states: 10
abstracting: (MEKPP_ERK<=ERKPP)
states: 9
...
EG iterations: 2
.
EG iterations: 1
abstracting: (MEKPP<=Raf1Star)
states: 10
.
EG iterations: 1
.abstracting: (Raf1Star<=1)
states: 13
abstracting: (Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP_ERKPP)
states: 13
abstracting: (Raf1Star<=RKIPP_RP)
states: 7
abstracting: (RKIPP_RP<=Raf1Star_RKIP_ERKPP)
states: 10
abstracting: (Raf1Star<=RKIPP_RP)
states: 7
abstracting: (Raf1Star<=RKIPP_RP)
states: 7
..
EG iterations: 2
abstracting: (1<=RP)
states: 10
..
EG iterations: 2
.
EG iterations: 1
.-> the formula is TRUE
FORMULA ERK-PT-000001-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [A [ERK<=Raf1Star_RKIP U [[~ [Raf1Star_RKIP<=0] | ERK<=MEKPP_ERK] & [[[1<=ERK & AX [1<=RKIP]] | [[[MEKPP<=Raf1Star & Raf1Star_RKIP<=ERK] | AF [ERK<=1]] | ERKPP<=RKIP]] | AG [[[RP<=0 | RKIP<=Raf1Star_RKIP] & [RKIPP<=1 & ERK<=0]]]]]] | AG [[A [A [~ [RKIPP_RP<=RP] U 1<=RKIPP_RP] U [EG [RKIPP<=MEKPP] & [[RP<=Raf1Star_RKIP | Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP] | [1<=ERK | 1<=RKIP]]]] | ~ [ERK<=MEKPP]]]]
normalized: [~ [E [true U ~ [[~ [ERK<=MEKPP] | [~ [EG [~ [[[[1<=ERK | 1<=RKIP] | [RP<=Raf1Star_RKIP | Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP]] & EG [RKIPP<=MEKPP]]]]] & ~ [E [~ [[[[1<=ERK | 1<=RKIP] | [RP<=Raf1Star_RKIP | Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP]] & EG [RKIPP<=MEKPP]]] U [~ [[~ [EG [~ [1<=RKIPP_RP]]] & ~ [E [~ [1<=RKIPP_RP] U [~ [1<=RKIPP_RP] & RKIPP_RP<=RP]]]]] & ~ [[[[1<=ERK | 1<=RKIP] | [RP<=Raf1Star_RKIP | Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP]] & EG [RKIPP<=MEKPP]]]]]]]]]]] | [~ [EG [~ [[[~ [E [true U ~ [[[RKIPP<=1 & ERK<=0] & [RP<=0 | RKIP<=Raf1Star_RKIP]]]]] | [[[~ [EG [~ [ERK<=1]]] | [MEKPP<=Raf1Star & Raf1Star_RKIP<=ERK]] | ERKPP<=RKIP] | [~ [EX [~ [1<=RKIP]]] & 1<=ERK]]] & [~ [Raf1Star_RKIP<=0] | ERK<=MEKPP_ERK]]]]] & ~ [E [~ [[[~ [E [true U ~ [[[RKIPP<=1 & ERK<=0] & [RP<=0 | RKIP<=Raf1Star_RKIP]]]]] | [[[~ [EG [~ [ERK<=1]]] | [MEKPP<=Raf1Star & Raf1Star_RKIP<=ERK]] | ERKPP<=RKIP] | [~ [EX [~ [1<=RKIP]]] & 1<=ERK]]] & [~ [Raf1Star_RKIP<=0] | ERK<=MEKPP_ERK]]] U [~ [ERK<=Raf1Star_RKIP] & ~ [[[~ [E [true U ~ [[[RKIPP<=1 & ERK<=0] & [RP<=0 | RKIP<=Raf1Star_RKIP]]]]] | [[[~ [EG [~ [ERK<=1]]] | [MEKPP<=Raf1Star & Raf1Star_RKIP<=ERK]] | ERKPP<=RKIP] | [~ [EX [~ [1<=RKIP]]] & 1<=ERK]]] & [~ [Raf1Star_RKIP<=0] | ERK<=MEKPP_ERK]]]]]]]]
abstracting: (ERK<=MEKPP_ERK)
states: 9
abstracting: (Raf1Star_RKIP<=0)
states: 10
abstracting: (1<=ERK)
states: 4
abstracting: (1<=RKIP)
states: 3
.abstracting: (ERKPP<=RKIP)
states: 10
abstracting: (Raf1Star_RKIP<=ERK)
states: 11
abstracting: (MEKPP<=Raf1Star)
states: 10
abstracting: (ERK<=1)
states: 13
.
EG iterations: 1
abstracting: (RKIP<=Raf1Star_RKIP)
states: 10
abstracting: (RP<=0)
states: 3
abstracting: (ERK<=0)
states: 9
abstracting: (RKIPP<=1)
states: 13
abstracting: (ERK<=Raf1Star_RKIP)
states: 10
abstracting: (ERK<=MEKPP_ERK)
states: 9
abstracting: (Raf1Star_RKIP<=0)
states: 10
abstracting: (1<=ERK)
states: 4
abstracting: (1<=RKIP)
states: 3
.abstracting: (ERKPP<=RKIP)
states: 10
abstracting: (Raf1Star_RKIP<=ERK)
states: 11
abstracting: (MEKPP<=Raf1Star)
states: 10
abstracting: (ERK<=1)
states: 13
.
EG iterations: 1
abstracting: (RKIP<=Raf1Star_RKIP)
states: 10
abstracting: (RP<=0)
states: 3
abstracting: (ERK<=0)
states: 9
abstracting: (RKIPP<=1)
states: 13
abstracting: (ERK<=MEKPP_ERK)
states: 9
abstracting: (Raf1Star_RKIP<=0)
states: 10
abstracting: (1<=ERK)
states: 4
abstracting: (1<=RKIP)
states: 3
.abstracting: (ERKPP<=RKIP)
states: 10
abstracting: (Raf1Star_RKIP<=ERK)
states: 11
abstracting: (MEKPP<=Raf1Star)
states: 10
abstracting: (ERK<=1)
states: 13
.
EG iterations: 1
abstracting: (RKIP<=Raf1Star_RKIP)
states: 10
abstracting: (RP<=0)
states: 3
abstracting: (ERK<=0)
states: 9
abstracting: (RKIPP<=1)
states: 13
..
EG iterations: 2
abstracting: (RKIPP<=MEKPP)
states: 12
.
EG iterations: 1
abstracting: (Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP)
states: 12
abstracting: (RP<=Raf1Star_RKIP)
states: 6
abstracting: (1<=RKIP)
states: 3
abstracting: (1<=ERK)
states: 4
abstracting: (RKIPP_RP<=RP)
states: 10
abstracting: (1<=RKIPP_RP)
states: 3
abstracting: (1<=RKIPP_RP)
states: 3
abstracting: (1<=RKIPP_RP)
states: 3
..
EG iterations: 2
abstracting: (RKIPP<=MEKPP)
states: 12
.
EG iterations: 1
abstracting: (Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP)
states: 12
abstracting: (RP<=Raf1Star_RKIP)
states: 6
abstracting: (1<=RKIP)
states: 3
abstracting: (1<=ERK)
states: 4
abstracting: (RKIPP<=MEKPP)
states: 12
.
EG iterations: 1
abstracting: (Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP)
states: 12
abstracting: (RP<=Raf1Star_RKIP)
states: 6
abstracting: (1<=RKIP)
states: 3
abstracting: (1<=ERK)
states: 4
..
EG iterations: 2
abstracting: (ERK<=MEKPP)
states: 13
-> the formula is FALSE
FORMULA ERK-PT-000001-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
totally nodes used: 812 (8.1e+02)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2209 3480 5689
used/not used/entry size/cache size: 4153 67104711 16 1024MB
basic ops cache: hits/miss/sum: 1209 1969 3178
used/not used/entry size/cache size: 3451 16773765 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: 289 206 495
used/not used/entry size/cache size: 206 8388402 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 67108068
1 780
2 16
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.474sec
BK_STOP 1679411936133
--------------------
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:35 (3), effective:8 (0)
initing FirstDep: 0m 0.000sec
iterations count:11 (1), effective:0 (0)
iterations count:15 (1), effective:1 (0)
iterations count:11 (1), effective:0 (0)
iterations count:22 (2), effective:4 (0)
iterations count:14 (1), effective:1 (0)
iterations count:11 (1), effective:0 (0)
iterations count:42 (3), effective:8 (0)
iterations count:15 (1), effective:1 (0)
iterations count:24 (2), effective:4 (0)
iterations count:12 (1), effective:1 (0)
iterations count:24 (2), effective:5 (0)
iterations count:18 (1), effective:3 (0)
iterations count:12 (1), effective:1 (0)
iterations count:15 (1), effective:1 (0)
iterations count:21 (1), effective:3 (0)
iterations count:16 (1), effective:2 (0)
iterations count:11 (1), effective:0 (0)
iterations count:13 (1), effective:1 (0)
iterations count:13 (1), effective:1 (0)
iterations count:11 (1), effective:0 (0)
iterations count:11 (1), effective:0 (0)
iterations count:21 (1), effective:4 (0)
iterations count:11 (1), effective:0 (0)
iterations count:14 (1), effective:1 (0)
iterations count:11 (1), effective:0 (0)
iterations count:14 (1), effective:1 (0)
iterations count:11 (1), effective:0 (0)
iterations count:32 (2), effective:7 (0)
iterations count:14 (1), effective:1 (0)
iterations count:11 (1), effective:0 (0)
iterations count:13 (1), effective:1 (0)
iterations count:11 (1), effective:0 (0)
iterations count:14 (1), effective:1 (0)
iterations count:11 (1), effective:0 (0)
iterations count:14 (1), effective:1 (0)
iterations count:11 (1), effective:0 (0)
iterations count:35 (3), effective:6 (0)
iterations count:14 (1), effective:1 (0)
iterations count:11 (1), effective:0 (0)
iterations count:17 (1), effective:2 (0)
iterations count:11 (1), effective:0 (0)
iterations count:12 (1), effective:1 (0)
iterations count:22 (2), effective:2 (0)
iterations count:21 (1), effective:3 (0)
iterations count:15 (1), effective:1 (0)
iterations count:11 (1), effective:0 (0)
iterations count:12 (1), effective:1 (0)
iterations count:12 (1), effective:1 (0)
iterations count:19 (1), effective:3 (0)
iterations count:27 (2), effective:5 (0)
iterations count:27 (2), effective:5 (0)
iterations count:11 (1), effective:0 (0)
iterations count:27 (2), effective:5 (0)
iterations count:11 (1), effective:0 (0)
iterations count:11 (1), effective:0 (0)
iterations count:28 (2), effective:7 (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="ERK-PT-000001"
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 ERK-PT-000001, 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 r161-tall-167838844500001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ERK-PT-000001.tgz
mv ERK-PT-000001 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 '
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 ;