About the Execution of Marcie for Diffusion2D-PT-D05N010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5481.056 | 7466.00 | 6998.00 | 110.00 | TFTFTTTTTTTTFTFF | 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.r129-smll-167819403300049.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 Diffusion2D-PT-D05N010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r129-smll-167819403300049
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.6K Feb 26 04:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 04:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 04:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 04:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 04:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 04:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 55K 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 Diffusion2D-PT-D05N010-CTLCardinality-00
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-01
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-02
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-03
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-04
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-05
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-06
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-07
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-08
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-09
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678271473535
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=Diffusion2D-PT-D05N010
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: Diffusion2D_PT_D05N010
(NrP: 25 NrTr: 144 NrArc: 288)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.561sec
RS generation: 0m 0.037sec
-> reachability set: #nodes 265 (2.6e+02) #states 131,128,140 (8)
starting MCC model checker
--------------------------
checking: EF [3<=cAMP__4_1_]
normalized: E [true U 3<=cAMP__4_1_]
abstracting: (3<=cAMP__4_1_)
states: 2,629,575 (6)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.095sec
checking: ~ [AF [AG [AF [AF [cAMP__4_1_<=2]]]]]
normalized: EG [E [true U EG [EG [~ [cAMP__4_1_<=2]]]]]
abstracting: (cAMP__4_1_<=2)
states: 128,498,565 (8)
.
EG iterations: 1
.
EG iterations: 1
EG iterations: 0
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.045sec
checking: EF [8<=cAMP__2_3_]
normalized: E [true U 8<=cAMP__2_3_]
abstracting: (8<=cAMP__2_3_)
states: 325
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.073sec
checking: EF [9<=cAMP__4_2_]
normalized: E [true U 9<=cAMP__4_2_]
abstracting: (9<=cAMP__4_2_)
states: 25
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.052sec
checking: AF [[~ [EG [EF [8<=cAMP__1_2_]]] | AG [~ [[7<=cAMP__4_3_ & AG [4<=cAMP__2_4_]]]]]]
normalized: ~ [EG [~ [[~ [E [true U [~ [E [true U ~ [4<=cAMP__2_4_]]] & 7<=cAMP__4_3_]]] | ~ [EG [E [true U 8<=cAMP__1_2_]]]]]]]
abstracting: (8<=cAMP__1_2_)
states: 325
EG iterations: 0
abstracting: (7<=cAMP__4_3_)
states: 2,925 (3)
abstracting: (4<=cAMP__2_4_)
states: 593,775 (5)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.034sec
checking: ~ [EG [AF [[AX [[cAMP__2_4_<=6 | cAMP__5_1_<=10]] | ~ [AF [2<=cAMP__1_1_]]]]]]
normalized: ~ [EG [~ [EG [~ [[EG [~ [2<=cAMP__1_1_]] | ~ [EX [~ [[cAMP__2_4_<=6 | cAMP__5_1_<=10]]]]]]]]]]
abstracting: (cAMP__5_1_<=10)
states: 131,128,140 (8)
abstracting: (cAMP__2_4_<=6)
states: 131,125,215 (8)
.abstracting: (2<=cAMP__1_1_)
states: 10,518,300 (7)
.
EG iterations: 1
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: [~ [EF [7<=cAMP__3_4_]] & A [AF [cAMP__4_2_<=4] U cAMP__4_4_<=cAMP__1_4_]]
normalized: [[~ [EG [~ [cAMP__4_4_<=cAMP__1_4_]]] & ~ [E [~ [cAMP__4_4_<=cAMP__1_4_] U [EG [~ [cAMP__4_2_<=4]] & ~ [cAMP__4_4_<=cAMP__1_4_]]]]] & ~ [E [true U 7<=cAMP__3_4_]]]
abstracting: (7<=cAMP__3_4_)
states: 2,925 (3)
abstracting: (cAMP__4_4_<=cAMP__1_4_)
states: 100,942,636 (8)
abstracting: (cAMP__4_2_<=4)
states: 131,009,385 (8)
.
EG iterations: 1
abstracting: (cAMP__4_4_<=cAMP__1_4_)
states: 100,942,636 (8)
abstracting: (cAMP__4_4_<=cAMP__1_4_)
states: 100,942,636 (8)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.277sec
checking: AX [EG [~ [E [EG [cAMP__5_5_<=cAMP__5_5_] U [4<=cAMP__4_2_ & 10<=cAMP__2_5_]]]]]
normalized: ~ [EX [~ [EG [~ [E [EG [cAMP__5_5_<=cAMP__5_5_] U [4<=cAMP__4_2_ & 10<=cAMP__2_5_]]]]]]]
abstracting: (10<=cAMP__2_5_)
states: 1
abstracting: (4<=cAMP__4_2_)
states: 593,775 (5)
abstracting: (cAMP__5_5_<=cAMP__5_5_)
states: 131,128,140 (8)
EG iterations: 0
EG iterations: 0
.-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [AG [cAMP__3_1_<=5] & AG [~ [[3<=cAMP__5_2_ | AF [[[3<=cAMP__2_1_ | cAMP__3_3_<=1] | [cAMP__3_5_<=cAMP__3_4_ & 4<=cAMP__4_1_]]]]]]]
normalized: [~ [E [true U [3<=cAMP__5_2_ | ~ [EG [~ [[[cAMP__3_5_<=cAMP__3_4_ & 4<=cAMP__4_1_] | [3<=cAMP__2_1_ | cAMP__3_3_<=1]]]]]]]] & ~ [E [true U ~ [cAMP__3_1_<=5]]]]
abstracting: (cAMP__3_1_<=5)
states: 131,107,665 (8)
abstracting: (cAMP__3_3_<=1)
states: 120,609,840 (8)
abstracting: (3<=cAMP__2_1_)
states: 2,629,575 (6)
abstracting: (4<=cAMP__4_1_)
states: 593,775 (5)
abstracting: (cAMP__3_5_<=cAMP__3_4_)
states: 100,942,636 (8)
.
EG iterations: 1
abstracting: (3<=cAMP__5_2_)
states: 2,629,575 (6)
-> the formula is FALSE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.172sec
checking: ~ [AX [[5<=cAMP__2_1_ & [[[EX [cAMP__3_3_<=cAMP__5_3_] | [7<=cAMP__1_2_ | cAMP__4_2_<=2]] & EX [1<=cAMP__4_1_]] & cAMP__3_4_<=cAMP__4_5_]]]]
normalized: EX [~ [[5<=cAMP__2_1_ & [cAMP__3_4_<=cAMP__4_5_ & [EX [1<=cAMP__4_1_] & [[7<=cAMP__1_2_ | cAMP__4_2_<=2] | EX [cAMP__3_3_<=cAMP__5_3_]]]]]]]
abstracting: (cAMP__3_3_<=cAMP__5_3_)
states: 100,942,636 (8)
.abstracting: (cAMP__4_2_<=2)
states: 128,498,565 (8)
abstracting: (7<=cAMP__1_2_)
states: 2,925 (3)
abstracting: (1<=cAMP__4_1_)
states: 38,567,100 (7)
.abstracting: (cAMP__3_4_<=cAMP__4_5_)
states: 100,942,636 (8)
abstracting: (5<=cAMP__2_1_)
states: 118,755 (5)
.-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.072sec
checking: EF [EF [[[AG [EX [cAMP__1_4_<=cAMP__2_4_]] | [~ [[cAMP__4_4_<=9 & cAMP__4_1_<=cAMP__2_1_]] & AX [cAMP__2_4_<=cAMP__2_5_]]] | [5<=cAMP__3_1_ & EX [AF [cAMP__3_1_<=4]]]]]]
normalized: E [true U E [true U [[5<=cAMP__3_1_ & EX [~ [EG [~ [cAMP__3_1_<=4]]]]] | [[~ [EX [~ [cAMP__2_4_<=cAMP__2_5_]]] & ~ [[cAMP__4_4_<=9 & cAMP__4_1_<=cAMP__2_1_]]] | ~ [E [true U ~ [EX [cAMP__1_4_<=cAMP__2_4_]]]]]]]]
abstracting: (cAMP__1_4_<=cAMP__2_4_)
states: 100,942,636 (8)
.abstracting: (cAMP__4_1_<=cAMP__2_1_)
states: 100,942,636 (8)
abstracting: (cAMP__4_4_<=9)
states: 131,128,139 (8)
abstracting: (cAMP__2_4_<=cAMP__2_5_)
states: 100,942,636 (8)
.abstracting: (cAMP__3_1_<=4)
states: 131,009,385 (8)
.
EG iterations: 1
.abstracting: (5<=cAMP__3_1_)
states: 118,755 (5)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.278sec
checking: AG [[EX [A [E [cAMP__4_2_<=10 U cAMP__1_3_<=6] U [~ [cAMP__1_2_<=cAMP__4_2_] | ~ [cAMP__2_3_<=7]]]] | AG [A [~ [AG [cAMP__2_4_<=4]] U [AG [cAMP__2_4_<=cAMP__1_4_] | ~ [cAMP__3_1_<=cAMP__2_2_]]]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [[~ [EG [~ [[~ [cAMP__3_1_<=cAMP__2_2_] | ~ [E [true U ~ [cAMP__2_4_<=cAMP__1_4_]]]]]]] & ~ [E [~ [[~ [cAMP__3_1_<=cAMP__2_2_] | ~ [E [true U ~ [cAMP__2_4_<=cAMP__1_4_]]]]] U [~ [E [true U ~ [cAMP__2_4_<=4]]] & ~ [[~ [cAMP__3_1_<=cAMP__2_2_] | ~ [E [true U ~ [cAMP__2_4_<=cAMP__1_4_]]]]]]]]]]]] | EX [[~ [EG [~ [[~ [cAMP__2_3_<=7] | ~ [cAMP__1_2_<=cAMP__4_2_]]]]] & ~ [E [~ [[~ [cAMP__2_3_<=7] | ~ [cAMP__1_2_<=cAMP__4_2_]]] U [~ [E [cAMP__4_2_<=10 U cAMP__1_3_<=6]] & ~ [[~ [cAMP__2_3_<=7] | ~ [cAMP__1_2_<=cAMP__4_2_]]]]]]]]]]]]
abstracting: (cAMP__1_2_<=cAMP__4_2_)
states: 100,942,636 (8)
abstracting: (cAMP__2_3_<=7)
states: 131,127,815 (8)
abstracting: (cAMP__1_3_<=6)
states: 131,125,215 (8)
abstracting: (cAMP__4_2_<=10)
states: 131,128,140 (8)
abstracting: (cAMP__1_2_<=cAMP__4_2_)
states: 100,942,636 (8)
abstracting: (cAMP__2_3_<=7)
states: 131,127,815 (8)
abstracting: (cAMP__1_2_<=cAMP__4_2_)
states: 100,942,636 (8)
abstracting: (cAMP__2_3_<=7)
states: 131,127,815 (8)
.
EG iterations: 1
.abstracting: (cAMP__2_4_<=cAMP__1_4_)
states: 100,942,636 (8)
abstracting: (cAMP__3_1_<=cAMP__2_2_)
states: 100,942,636 (8)
abstracting: (cAMP__2_4_<=4)
states: 131,009,385 (8)
abstracting: (cAMP__2_4_<=cAMP__1_4_)
states: 100,942,636 (8)
abstracting: (cAMP__3_1_<=cAMP__2_2_)
states: 100,942,636 (8)
abstracting: (cAMP__2_4_<=cAMP__1_4_)
states: 100,942,636 (8)
abstracting: (cAMP__3_1_<=cAMP__2_2_)
states: 100,942,636 (8)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.283sec
checking: EF [EG [[[[~ [[cAMP__3_4_<=10 | 4<=cAMP__2_3_]] & [AF [cAMP__4_5_<=7] & ~ [2<=cAMP__1_3_]]] & E [[4<=cAMP__4_3_ & 8<=cAMP__3_4_] U AG [1<=cAMP__4_1_]]] & [~ [E [cAMP__1_2_<=1 U cAMP__1_4_<=9]] | E [AG [7<=cAMP__2_2_] U EX [cAMP__1_3_<=cAMP__1_5_]]]]]]
normalized: E [true U EG [[[E [~ [E [true U ~ [7<=cAMP__2_2_]]] U EX [cAMP__1_3_<=cAMP__1_5_]] | ~ [E [cAMP__1_2_<=1 U cAMP__1_4_<=9]]] & [E [[4<=cAMP__4_3_ & 8<=cAMP__3_4_] U ~ [E [true U ~ [1<=cAMP__4_1_]]]] & [[~ [2<=cAMP__1_3_] & ~ [EG [~ [cAMP__4_5_<=7]]]] & ~ [[cAMP__3_4_<=10 | 4<=cAMP__2_3_]]]]]]]
abstracting: (4<=cAMP__2_3_)
states: 593,775 (5)
abstracting: (cAMP__3_4_<=10)
states: 131,128,140 (8)
abstracting: (cAMP__4_5_<=7)
states: 131,127,815 (8)
.
EG iterations: 1
abstracting: (2<=cAMP__1_3_)
states: 10,518,300 (7)
abstracting: (1<=cAMP__4_1_)
states: 38,567,100 (7)
abstracting: (8<=cAMP__3_4_)
states: 325
abstracting: (4<=cAMP__4_3_)
states: 593,775 (5)
abstracting: (cAMP__1_4_<=9)
states: 131,128,139 (8)
abstracting: (cAMP__1_2_<=1)
states: 120,609,840 (8)
abstracting: (cAMP__1_3_<=cAMP__1_5_)
states: 100,942,636 (8)
.abstracting: (7<=cAMP__2_2_)
states: 2,925 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.066sec
checking: [E [AX [~ [AG [[4<=cAMP__1_3_ & cAMP__3_5_<=cAMP__2_4_]]]] U 5<=cAMP__1_2_] & [EX [[~ [AX [[cAMP__5_5_<=cAMP__2_2_ | cAMP__5_5_<=0]]] | AG [E [cAMP__1_2_<=cAMP__5_1_ U cAMP__4_3_<=cAMP__4_3_]]]] | EG [[cAMP__3_2_<=cAMP__5_4_ & [A [~ [cAMP__5_3_<=2] U cAMP__3_1_<=0] & ~ [[4<=cAMP__4_4_ & EF [4<=cAMP__5_2_]]]]]]]]
normalized: [[EG [[cAMP__3_2_<=cAMP__5_4_ & [~ [[4<=cAMP__4_4_ & E [true U 4<=cAMP__5_2_]]] & [~ [EG [~ [cAMP__3_1_<=0]]] & ~ [E [~ [cAMP__3_1_<=0] U [cAMP__5_3_<=2 & ~ [cAMP__3_1_<=0]]]]]]]] | EX [[~ [E [true U ~ [E [cAMP__1_2_<=cAMP__5_1_ U cAMP__4_3_<=cAMP__4_3_]]]] | EX [~ [[cAMP__5_5_<=cAMP__2_2_ | cAMP__5_5_<=0]]]]]] & E [~ [EX [~ [E [true U ~ [[4<=cAMP__1_3_ & cAMP__3_5_<=cAMP__2_4_]]]]]] U 5<=cAMP__1_2_]]
abstracting: (5<=cAMP__1_2_)
states: 118,755 (5)
abstracting: (cAMP__3_5_<=cAMP__2_4_)
states: 100,942,636 (8)
abstracting: (4<=cAMP__1_3_)
states: 593,775 (5)
.abstracting: (cAMP__5_5_<=0)
states: 92,561,040 (7)
abstracting: (cAMP__5_5_<=cAMP__2_2_)
states: 100,942,636 (8)
.abstracting: (cAMP__4_3_<=cAMP__4_3_)
states: 131,128,140 (8)
abstracting: (cAMP__1_2_<=cAMP__5_1_)
states: 100,942,636 (8)
.abstracting: (cAMP__3_1_<=0)
states: 92,561,040 (7)
abstracting: (cAMP__5_3_<=2)
states: 128,498,565 (8)
abstracting: (cAMP__3_1_<=0)
states: 92,561,040 (7)
abstracting: (cAMP__3_1_<=0)
states: 92,561,040 (7)
.
EG iterations: 1
abstracting: (4<=cAMP__5_2_)
states: 593,775 (5)
abstracting: (4<=cAMP__4_4_)
states: 593,775 (5)
abstracting: (cAMP__3_2_<=cAMP__5_4_)
states: 100,942,636 (8)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.242sec
checking: AX [[[A [[~ [AX [1<=cAMP__3_5_]] & cAMP__1_3_<=0] U [5<=cAMP__1_4_ & EX [10<=cAMP__3_1_]]] | [E [[~ [7<=cAMP__2_2_] | cAMP__3_4_<=8] U [E [cAMP__1_1_<=6 U cAMP__4_3_<=cAMP__2_1_] & ~ [cAMP__3_4_<=cAMP__3_3_]]] & [EG [1<=cAMP__5_2_] | [[~ [8<=cAMP__5_5_] | AF [cAMP__4_1_<=cAMP__3_3_]] & [AX [cAMP__1_1_<=6] & EF [cAMP__3_4_<=5]]]]]] | [10<=cAMP__2_3_ & AG [7<=cAMP__5_5_]]]]
normalized: ~ [EX [~ [[[10<=cAMP__2_3_ & ~ [E [true U ~ [7<=cAMP__5_5_]]]] | [[[[[E [true U cAMP__3_4_<=5] & ~ [EX [~ [cAMP__1_1_<=6]]]] & [~ [EG [~ [cAMP__4_1_<=cAMP__3_3_]]] | ~ [8<=cAMP__5_5_]]] | EG [1<=cAMP__5_2_]] & E [[cAMP__3_4_<=8 | ~ [7<=cAMP__2_2_]] U [~ [cAMP__3_4_<=cAMP__3_3_] & E [cAMP__1_1_<=6 U cAMP__4_3_<=cAMP__2_1_]]]] | [~ [EG [~ [[5<=cAMP__1_4_ & EX [10<=cAMP__3_1_]]]]] & ~ [E [~ [[5<=cAMP__1_4_ & EX [10<=cAMP__3_1_]]] U [~ [[cAMP__1_3_<=0 & EX [~ [1<=cAMP__3_5_]]]] & ~ [[5<=cAMP__1_4_ & EX [10<=cAMP__3_1_]]]]]]]]]]]]
abstracting: (10<=cAMP__3_1_)
states: 1
.abstracting: (5<=cAMP__1_4_)
states: 118,755 (5)
abstracting: (1<=cAMP__3_5_)
states: 38,567,100 (7)
.abstracting: (cAMP__1_3_<=0)
states: 92,561,040 (7)
abstracting: (10<=cAMP__3_1_)
states: 1
.abstracting: (5<=cAMP__1_4_)
states: 118,755 (5)
abstracting: (10<=cAMP__3_1_)
states: 1
.abstracting: (5<=cAMP__1_4_)
states: 118,755 (5)
EG iterations: 0
abstracting: (cAMP__4_3_<=cAMP__2_1_)
states: 100,942,636 (8)
abstracting: (cAMP__1_1_<=6)
states: 131,125,215 (8)
abstracting: (cAMP__3_4_<=cAMP__3_3_)
states: 100,942,636 (8)
abstracting: (7<=cAMP__2_2_)
states: 2,925 (3)
abstracting: (cAMP__3_4_<=8)
states: 131,128,115 (8)
abstracting: (1<=cAMP__5_2_)
states: 38,567,100 (7)
.
EG iterations: 1
abstracting: (8<=cAMP__5_5_)
states: 325
abstracting: (cAMP__4_1_<=cAMP__3_3_)
states: 100,942,636 (8)
.
EG iterations: 1
abstracting: (cAMP__1_1_<=6)
states: 131,125,215 (8)
.abstracting: (cAMP__3_4_<=5)
states: 131,107,665 (8)
abstracting: (7<=cAMP__5_5_)
states: 2,925 (3)
abstracting: (10<=cAMP__2_3_)
states: 1
.-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.249sec
checking: A [~ [[[6<=cAMP__3_4_ | ~ [AX [cAMP__1_1_<=6]]] | [[[cAMP__1_4_<=8 & cAMP__3_4_<=5] | [[cAMP__3_5_<=6 & cAMP__2_3_<=cAMP__5_3_] & cAMP__3_5_<=6]] & [cAMP__3_3_<=4 & cAMP__3_3_<=10]]]] U [EF [E [[~ [cAMP__4_1_<=cAMP__4_1_] & [cAMP__5_4_<=cAMP__1_5_ | 5<=cAMP__4_4_]] U ~ [cAMP__5_1_<=3]]] & ~ [AX [[~ [AF [cAMP__3_4_<=cAMP__1_4_]] & A [7<=cAMP__4_4_ U cAMP__3_3_<=cAMP__4_2_]]]]]]
normalized: [~ [EG [~ [[EX [~ [[[~ [EG [~ [cAMP__3_3_<=cAMP__4_2_]]] & ~ [E [~ [cAMP__3_3_<=cAMP__4_2_] U [~ [7<=cAMP__4_4_] & ~ [cAMP__3_3_<=cAMP__4_2_]]]]] & EG [~ [cAMP__3_4_<=cAMP__1_4_]]]]] & E [true U E [[[cAMP__5_4_<=cAMP__1_5_ | 5<=cAMP__4_4_] & ~ [cAMP__4_1_<=cAMP__4_1_]] U ~ [cAMP__5_1_<=3]]]]]]] & ~ [E [~ [[EX [~ [[[~ [EG [~ [cAMP__3_3_<=cAMP__4_2_]]] & ~ [E [~ [cAMP__3_3_<=cAMP__4_2_] U [~ [7<=cAMP__4_4_] & ~ [cAMP__3_3_<=cAMP__4_2_]]]]] & EG [~ [cAMP__3_4_<=cAMP__1_4_]]]]] & E [true U E [[[cAMP__5_4_<=cAMP__1_5_ | 5<=cAMP__4_4_] & ~ [cAMP__4_1_<=cAMP__4_1_]] U ~ [cAMP__5_1_<=3]]]]] U [[[[cAMP__3_3_<=4 & cAMP__3_3_<=10] & [[cAMP__3_5_<=6 & [cAMP__3_5_<=6 & cAMP__2_3_<=cAMP__5_3_]] | [cAMP__1_4_<=8 & cAMP__3_4_<=5]]] | [6<=cAMP__3_4_ | EX [~ [cAMP__1_1_<=6]]]] & ~ [[EX [~ [[[~ [EG [~ [cAMP__3_3_<=cAMP__4_2_]]] & ~ [E [~ [cAMP__3_3_<=cAMP__4_2_] U [~ [7<=cAMP__4_4_] & ~ [cAMP__3_3_<=cAMP__4_2_]]]]] & EG [~ [cAMP__3_4_<=cAMP__1_4_]]]]] & E [true U E [[[cAMP__5_4_<=cAMP__1_5_ | 5<=cAMP__4_4_] & ~ [cAMP__4_1_<=cAMP__4_1_]] U ~ [cAMP__5_1_<=3]]]]]]]]]
abstracting: (cAMP__5_1_<=3)
states: 130,534,365 (8)
abstracting: (cAMP__4_1_<=cAMP__4_1_)
states: 131,128,140 (8)
abstracting: (5<=cAMP__4_4_)
states: 118,755 (5)
abstracting: (cAMP__5_4_<=cAMP__1_5_)
states: 100,942,636 (8)
abstracting: (cAMP__3_4_<=cAMP__1_4_)
states: 100,942,636 (8)
.
EG iterations: 1
abstracting: (cAMP__3_3_<=cAMP__4_2_)
states: 100,942,636 (8)
abstracting: (7<=cAMP__4_4_)
states: 2,925 (3)
abstracting: (cAMP__3_3_<=cAMP__4_2_)
states: 100,942,636 (8)
abstracting: (cAMP__3_3_<=cAMP__4_2_)
states: 100,942,636 (8)
.
EG iterations: 1
.abstracting: (cAMP__1_1_<=6)
states: 131,125,215 (8)
.abstracting: (6<=cAMP__3_4_)
states: 20,475 (4)
abstracting: (cAMP__3_4_<=5)
states: 131,107,665 (8)
abstracting: (cAMP__1_4_<=8)
states: 131,128,115 (8)
abstracting: (cAMP__2_3_<=cAMP__5_3_)
states: 100,942,636 (8)
abstracting: (cAMP__3_5_<=6)
states: 131,125,215 (8)
abstracting: (cAMP__3_5_<=6)
states: 131,125,215 (8)
abstracting: (cAMP__3_3_<=10)
states: 131,128,140 (8)
abstracting: (cAMP__3_3_<=4)
states: 131,009,385 (8)
abstracting: (cAMP__5_1_<=3)
states: 130,534,365 (8)
abstracting: (cAMP__4_1_<=cAMP__4_1_)
states: 131,128,140 (8)
abstracting: (5<=cAMP__4_4_)
states: 118,755 (5)
abstracting: (cAMP__5_4_<=cAMP__1_5_)
states: 100,942,636 (8)
abstracting: (cAMP__3_4_<=cAMP__1_4_)
states: 100,942,636 (8)
.
EG iterations: 1
abstracting: (cAMP__3_3_<=cAMP__4_2_)
states: 100,942,636 (8)
abstracting: (7<=cAMP__4_4_)
states: 2,925 (3)
abstracting: (cAMP__3_3_<=cAMP__4_2_)
states: 100,942,636 (8)
abstracting: (cAMP__3_3_<=cAMP__4_2_)
states: 100,942,636 (8)
.
EG iterations: 1
.abstracting: (cAMP__5_1_<=3)
states: 130,534,365 (8)
abstracting: (cAMP__4_1_<=cAMP__4_1_)
states: 131,128,140 (8)
abstracting: (5<=cAMP__4_4_)
states: 118,755 (5)
abstracting: (cAMP__5_4_<=cAMP__1_5_)
states: 100,942,636 (8)
abstracting: (cAMP__3_4_<=cAMP__1_4_)
states: 100,942,636 (8)
.
EG iterations: 1
abstracting: (cAMP__3_3_<=cAMP__4_2_)
states: 100,942,636 (8)
abstracting: (7<=cAMP__4_4_)
states: 2,925 (3)
abstracting: (cAMP__3_3_<=cAMP__4_2_)
states: 100,942,636 (8)
abstracting: (cAMP__3_3_<=cAMP__4_2_)
states: 100,942,636 (8)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.150sec
totally nodes used: 235020 (2.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 12194749 3443769 15638518
used/not used/entry size/cache size: 3542230 63566634 16 1024MB
basic ops cache: hits/miss/sum: 804256 191766 996022
used/not used/entry size/cache size: 355701 16421515 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: 46100 10093 56193
used/not used/entry size/cache size: 10088 8378520 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 66879989
1 224887
2 3465
3 206
4 126
5 75
6 13
7 12
8 6
9 7
>= 10 78
Total processing time: 0m 7.365sec
BK_STOP 1678271481001
--------------------
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:7924 (55), effective:240 (1)
initing FirstDep: 0m 0.000sec
iterations count:2535 (17), effective:72 (0)
iterations count:2535 (17), effective:72 (0)
iterations count:6528 (45), effective:192 (1)
iterations count:7317 (50), effective:216 (1)
iterations count:6536 (45), effective:192 (1)
iterations count:368 (2), effective:7 (0)
iterations count:5723 (39), effective:168 (1)
iterations count:4244 (29), effective:130 (0)
iterations count:4932 (34), effective:144 (1)
iterations count:1201 (8), effective:57 (0)
iterations count:3074 (21), effective:103 (0)
iterations count:2765 (19), effective:131 (0)
iterations count:144 (1), effective:0 (0)
iterations count:200 (1), effective:4 (0)
iterations count:1157 (8), effective:33 (0)
iterations count:4129 (28), effective:120 (0)
iterations count:1157 (8), effective:33 (0)
iterations count:1157 (8), effective:33 (0)
iterations count:359 (2), effective:25 (0)
iterations count:846 (5), effective:73 (0)
iterations count:384 (2), effective:10 (0)
iterations count:168 (1), effective:1 (0)
iterations count:176 (1), effective:4 (0)
iterations count:144 (1), effective:0 (0)
iterations count:242 (1), effective:7 (0)
iterations count:4139 (28), effective:120 (0)
iterations count:144 (1), effective:0 (0)
iterations count:354 (2), effective:7 (0)
iterations count:3328 (23), effective:96 (0)
iterations count:942 (6), effective:24 (0)
iterations count:3099 (21), effective:95 (0)
iterations count:1429 (9), effective:35 (0)
iterations count:384 (2), effective:5 (0)
iterations count:248 (1), effective:4 (0)
iterations count:144 (1), effective:0 (0)
iterations count:3328 (23), effective:96 (0)
iterations count:318 (2), effective:3 (0)
iterations count:144 (1), effective:0 (0)
iterations count:3328 (23), effective:96 (0)
iterations count:318 (2), effective:3 (0)
iterations count:144 (1), effective:0 (0)
iterations count:144 (1), effective:0 (0)
iterations count:3328 (23), effective:96 (0)
iterations count:318 (2), effective:3 (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="Diffusion2D-PT-D05N010"
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 Diffusion2D-PT-D05N010, 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 r129-smll-167819403300049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D05N010.tgz
mv Diffusion2D-PT-D05N010 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 ;