About the Execution of Marcie for Railroad-PT-005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.552 | 5126.00 | 5080.00 | 0.00 | FFTTFTFTTTTTFTTT | 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.r321-tall-167889192100361.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 Railroad-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192100361
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.5K Feb 25 22:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 22:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 22:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 22:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 22:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 22:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 22:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 32K Mar 5 18:23 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 Railroad-PT-005-CTLCardinality-00
FORMULA_NAME Railroad-PT-005-CTLCardinality-01
FORMULA_NAME Railroad-PT-005-CTLCardinality-02
FORMULA_NAME Railroad-PT-005-CTLCardinality-03
FORMULA_NAME Railroad-PT-005-CTLCardinality-04
FORMULA_NAME Railroad-PT-005-CTLCardinality-05
FORMULA_NAME Railroad-PT-005-CTLCardinality-06
FORMULA_NAME Railroad-PT-005-CTLCardinality-07
FORMULA_NAME Railroad-PT-005-CTLCardinality-08
FORMULA_NAME Railroad-PT-005-CTLCardinality-09
FORMULA_NAME Railroad-PT-005-CTLCardinality-10
FORMULA_NAME Railroad-PT-005-CTLCardinality-11
FORMULA_NAME Railroad-PT-005-CTLCardinality-12
FORMULA_NAME Railroad-PT-005-CTLCardinality-13
FORMULA_NAME Railroad-PT-005-CTLCardinality-14
FORMULA_NAME Railroad-PT-005-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678930939185
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=Railroad-PT-005
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: Railroad_PT_005
(NrP: 68 NrTr: 56 NrArc: 313)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.879sec
RS generation: 0m 0.040sec
-> reachability set: #nodes 2009 (2.0e+03) #states 1,838 (3)
starting MCC model checker
--------------------------
checking: EX [AF [[1<=pl_P16_1 | 1<=pl_P21_1]]]
normalized: EX [~ [EG [~ [[1<=pl_P16_1 | 1<=pl_P21_1]]]]]
abstracting: (1<=pl_P21_1)
states: 431
abstracting: (1<=pl_P16_1)
states: 431
.
EG iterations: 1
.-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.032sec
checking: EG [[~ [AF [pl_P5_1<=1]] & EG [AG [EF [pl_P7_6<=0]]]]]
normalized: EG [[EG [~ [E [true U ~ [E [true U pl_P7_6<=0]]]]] & EG [~ [pl_P5_1<=1]]]]
abstracting: (pl_P5_1<=1)
states: 1,838 (3)
.
EG iterations: 1
abstracting: (pl_P7_6<=0)
states: 1,838 (3)
EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: AX [~ [[AG [1<=pl_P38_1] | AF [~ [EG [pl_P11_1<=1]]]]]]
normalized: ~ [EX [[~ [EG [EG [pl_P11_1<=1]]] | ~ [E [true U ~ [1<=pl_P38_1]]]]]]
abstracting: (1<=pl_P38_1)
states: 0
abstracting: (pl_P11_1<=1)
states: 1,838 (3)
EG iterations: 0
EG iterations: 0
.-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [AG [AG [A [EX [1<=pl_P34_4] U ~ [pl_P40_3<=pl_P7_4]]]]]
normalized: E [true U E [true U ~ [[~ [EG [pl_P40_3<=pl_P7_4]] & ~ [E [pl_P40_3<=pl_P7_4 U [pl_P40_3<=pl_P7_4 & ~ [EX [1<=pl_P34_4]]]]]]]]]
abstracting: (1<=pl_P34_4)
states: 595
.abstracting: (pl_P40_3<=pl_P7_4)
states: 1,407 (3)
abstracting: (pl_P40_3<=pl_P7_4)
states: 1,407 (3)
abstracting: (pl_P40_3<=pl_P7_4)
states: 1,407 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.083sec
checking: E [pl_P42_1<=1 U ~ [EX [AX [EF [pl_P8_1<=pl_P5_1]]]]]
normalized: E [pl_P42_1<=1 U ~ [EX [~ [EX [~ [E [true U pl_P8_1<=pl_P5_1]]]]]]]
abstracting: (pl_P8_1<=pl_P5_1)
states: 1,407 (3)
..abstracting: (pl_P42_1<=1)
states: 1,838 (3)
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AX [[A [pl_P20_1<=pl_P28_1 U pl_P7_3<=1] | pl_P41_1<=pl_P7_1]]
normalized: ~ [EX [~ [[pl_P41_1<=pl_P7_1 | [~ [EG [~ [pl_P7_3<=1]]] & ~ [E [~ [pl_P7_3<=1] U [~ [pl_P20_1<=pl_P28_1] & ~ [pl_P7_3<=1]]]]]]]]]
abstracting: (pl_P7_3<=1)
states: 1,838 (3)
abstracting: (pl_P20_1<=pl_P28_1)
states: 1,448 (3)
abstracting: (pl_P7_3<=1)
states: 1,838 (3)
abstracting: (pl_P7_3<=1)
states: 1,838 (3)
.
EG iterations: 1
abstracting: (pl_P41_1<=pl_P7_1)
states: 1,407 (3)
.-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [[~ [EF [AX [pl_P18_1<=0]]] & AX [[~ [pl_P29_6<=pl_P7_1] & ~ [EX [E [pl_P0_4<=pl_P12_1 U pl_P29_1<=1]]]]]]]
normalized: ~ [[~ [EX [~ [[~ [EX [E [pl_P0_4<=pl_P12_1 U pl_P29_1<=1]]] & ~ [pl_P29_6<=pl_P7_1]]]]] & ~ [E [true U ~ [EX [~ [pl_P18_1<=0]]]]]]]
abstracting: (pl_P18_1<=0)
states: 1,320 (3)
.abstracting: (pl_P29_6<=pl_P7_1)
states: 1,838 (3)
abstracting: (pl_P29_1<=1)
states: 1,838 (3)
abstracting: (pl_P0_4<=pl_P12_1)
states: 1,481 (3)
..-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: AX [[EX [[[AF [pl_P1_1<=pl_P13_1] & [EX [pl_P0_4<=pl_P40_3] | E [pl_P0_4<=1 U 1<=pl_P39_1]]] & ~ [EG [pl_P29_4<=0]]]] & pl_P34_5<=pl_P39_1]]
normalized: ~ [EX [~ [[pl_P34_5<=pl_P39_1 & EX [[~ [EG [pl_P29_4<=0]] & [[E [pl_P0_4<=1 U 1<=pl_P39_1] | EX [pl_P0_4<=pl_P40_3]] & ~ [EG [~ [pl_P1_1<=pl_P13_1]]]]]]]]]]
abstracting: (pl_P1_1<=pl_P13_1)
states: 1,838 (3)
.
EG iterations: 1
abstracting: (pl_P0_4<=pl_P40_3)
states: 1,481 (3)
.abstracting: (1<=pl_P39_1)
states: 6
abstracting: (pl_P0_4<=1)
states: 1,838 (3)
abstracting: (pl_P29_4<=0)
states: 1,838 (3)
EG iterations: 0
.abstracting: (pl_P34_5<=pl_P39_1)
states: 1,222 (3)
.-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.037sec
checking: [EF [[~ [pl_P40_1<=pl_P29_3] | ~ [pl_P27_1<=pl_P34_1]]] & ~ [AF [[AF [1<=pl_P34_1] & ~ [[AX [pl_P31_1<=pl_P34_5] | pl_P24_1<=pl_P0_4]]]]]]
normalized: [EG [~ [[~ [[pl_P24_1<=pl_P0_4 | ~ [EX [~ [pl_P31_1<=pl_P34_5]]]]] & ~ [EG [~ [1<=pl_P34_1]]]]]] & E [true U [~ [pl_P27_1<=pl_P34_1] | ~ [pl_P40_1<=pl_P29_3]]]]
abstracting: (pl_P40_1<=pl_P29_3)
states: 1,407 (3)
abstracting: (pl_P27_1<=pl_P34_1)
states: 969
abstracting: (1<=pl_P34_1)
states: 24
.
EG iterations: 1
abstracting: (pl_P31_1<=pl_P34_5)
states: 1,203 (3)
.abstracting: (pl_P24_1<=pl_P0_4)
states: 1,838 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.034sec
checking: EF [EG [[[~ [[[pl_P34_3<=0 | 1<=pl_P0_4] | EG [1<=pl_P29_5]]] | [AX [pl_P34_2<=pl_P22_1] & [AX [1<=pl_P19_1] | [1<=pl_P25_1 & pl_P17_1<=0]]]] | 1<=pl_P35_1]]]
normalized: E [true U EG [[1<=pl_P35_1 | [[[[1<=pl_P25_1 & pl_P17_1<=0] | ~ [EX [~ [1<=pl_P19_1]]]] & ~ [EX [~ [pl_P34_2<=pl_P22_1]]]] | ~ [[EG [1<=pl_P29_5] | [pl_P34_3<=0 | 1<=pl_P0_4]]]]]]]
abstracting: (1<=pl_P0_4)
states: 458
abstracting: (pl_P34_3<=0)
states: 1,558 (3)
abstracting: (1<=pl_P29_5)
states: 0
.
EG iterations: 1
abstracting: (pl_P34_2<=pl_P22_1)
states: 1,763 (3)
.abstracting: (1<=pl_P19_1)
states: 431
.abstracting: (pl_P17_1<=0)
states: 1,320 (3)
abstracting: (1<=pl_P25_1)
states: 431
abstracting: (1<=pl_P35_1)
states: 5
.......
EG iterations: 7
-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.063sec
checking: E [[EF [[EX [1<=pl_P25_1] & [AF [1<=pl_P40_5] & AG [pl_P29_1<=0]]]] | AG [AF [E [pl_P29_4<=1 U pl_P29_2<=pl_P40_6]]]] U E [pl_P29_1<=pl_P16_1 U ~ [[~ [AF [pl_P34_3<=1]] | AG [1<=pl_P7_1]]]]]
normalized: E [[~ [E [true U EG [~ [E [pl_P29_4<=1 U pl_P29_2<=pl_P40_6]]]]] | E [true U [[~ [E [true U ~ [pl_P29_1<=0]]] & ~ [EG [~ [1<=pl_P40_5]]]] & EX [1<=pl_P25_1]]]] U E [pl_P29_1<=pl_P16_1 U ~ [[~ [E [true U ~ [1<=pl_P7_1]]] | EG [~ [pl_P34_3<=1]]]]]]
abstracting: (pl_P34_3<=1)
states: 1,838 (3)
.
EG iterations: 1
abstracting: (1<=pl_P7_1)
states: 5
abstracting: (pl_P29_1<=pl_P16_1)
states: 459
abstracting: (1<=pl_P25_1)
states: 431
.abstracting: (1<=pl_P40_5)
states: 431
.
EG iterations: 1
abstracting: (pl_P29_1<=0)
states: 28
abstracting: (pl_P29_2<=pl_P40_6)
states: 1,827 (3)
abstracting: (pl_P29_4<=1)
states: 1,838 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: AX [E [[~ [[pl_P7_1<=1 & AX [pl_P40_1<=pl_P0_4]]] | [EX [AF [pl_P34_5<=pl_P40_1]] | EX [~ [pl_P34_4<=0]]]] U E [[pl_P37_1<=pl_P21_1 | pl_P18_1<=pl_P40_3] U 1<=pl_P7_4]]]
normalized: ~ [EX [~ [E [[[EX [~ [pl_P34_4<=0]] | EX [~ [EG [~ [pl_P34_5<=pl_P40_1]]]]] | ~ [[pl_P7_1<=1 & ~ [EX [~ [pl_P40_1<=pl_P0_4]]]]]] U E [[pl_P37_1<=pl_P21_1 | pl_P18_1<=pl_P40_3] U 1<=pl_P7_4]]]]]
abstracting: (1<=pl_P7_4)
states: 0
abstracting: (pl_P18_1<=pl_P40_3)
states: 1,448 (3)
abstracting: (pl_P37_1<=pl_P21_1)
states: 1,838 (3)
abstracting: (pl_P40_1<=pl_P0_4)
states: 1,508 (3)
.abstracting: (pl_P7_1<=1)
states: 1,838 (3)
abstracting: (pl_P34_5<=pl_P40_1)
states: 1,395 (3)
...........
EG iterations: 11
.abstracting: (pl_P34_4<=0)
states: 1,243 (3)
..-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.043sec
checking: ~ [E [AF [[[pl_P29_2<=pl_P4_1 | AG [pl_P7_6<=1]] & [[EF [1<=pl_P27_1] | ~ [1<=pl_P40_2]] | ~ [EG [pl_P0_4<=0]]]]] U ~ [[AX [[EG [pl_P34_2<=pl_P20_1] & [pl_P16_1<=pl_P3_1 & 1<=pl_P0_4]]] | pl_P29_3<=1]]]]
normalized: ~ [E [~ [EG [~ [[[~ [EG [pl_P0_4<=0]] | [~ [1<=pl_P40_2] | E [true U 1<=pl_P27_1]]] & [pl_P29_2<=pl_P4_1 | ~ [E [true U ~ [pl_P7_6<=1]]]]]]]] U ~ [[pl_P29_3<=1 | ~ [EX [~ [[[pl_P16_1<=pl_P3_1 & 1<=pl_P0_4] & EG [pl_P34_2<=pl_P20_1]]]]]]]]]
abstracting: (pl_P34_2<=pl_P20_1)
states: 1,774 (3)
.....
EG iterations: 5
abstracting: (1<=pl_P0_4)
states: 458
abstracting: (pl_P16_1<=pl_P3_1)
states: 1,407 (3)
.abstracting: (pl_P29_3<=1)
states: 1,838 (3)
abstracting: (pl_P7_6<=1)
states: 1,838 (3)
abstracting: (pl_P29_2<=pl_P4_1)
states: 1,827 (3)
abstracting: (1<=pl_P27_1)
states: 889
abstracting: (1<=pl_P40_2)
states: 431
abstracting: (pl_P0_4<=0)
states: 1,380 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.031sec
checking: AX [[EG [[EX [~ [pl_P41_1<=0]] | [~ [[pl_P13_1<=pl_P8_1 & 1<=pl_P27_1]] & [[1<=pl_P18_1 | 1<=pl_P40_2] | [pl_P40_4<=1 & 1<=pl_P20_1]]]]] | EF [[pl_P34_4<=pl_P42_1 | [[~ [pl_P7_6<=pl_P29_6] & 1<=pl_P34_6] & AG [1<=pl_P40_3]]]]]]
normalized: ~ [EX [~ [[E [true U [pl_P34_4<=pl_P42_1 | [~ [E [true U ~ [1<=pl_P40_3]]] & [1<=pl_P34_6 & ~ [pl_P7_6<=pl_P29_6]]]]] | EG [[[[[pl_P40_4<=1 & 1<=pl_P20_1] | [1<=pl_P18_1 | 1<=pl_P40_2]] & ~ [[pl_P13_1<=pl_P8_1 & 1<=pl_P27_1]]] | EX [~ [pl_P41_1<=0]]]]]]]]
abstracting: (pl_P41_1<=0)
states: 1,407 (3)
.abstracting: (1<=pl_P27_1)
states: 889
abstracting: (pl_P13_1<=pl_P8_1)
states: 1,448 (3)
abstracting: (1<=pl_P40_2)
states: 431
abstracting: (1<=pl_P18_1)
states: 518
abstracting: (1<=pl_P20_1)
states: 518
abstracting: (pl_P40_4<=1)
states: 1,838 (3)
.
EG iterations: 1
abstracting: (pl_P7_6<=pl_P29_6)
states: 1,838 (3)
abstracting: (1<=pl_P34_6)
states: 243
abstracting: (1<=pl_P40_3)
states: 431
abstracting: (pl_P34_4<=pl_P42_1)
states: 1,568 (3)
.-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: EX [A [[[[[pl_P29_6<=1 & A [pl_P40_5<=1 U pl_P29_6<=pl_P39_1]] | EG [pl_P7_1<=1]] | ~ [pl_P19_1<=0]] | [pl_P7_4<=0 | AG [~ [pl_P34_1<=pl_P40_3]]]] U A [1<=pl_P40_2 U [EX [pl_P40_4<=pl_P36_1] & [EG [pl_P40_1<=0] | pl_P4_1<=pl_P0_5]]]]]
normalized: EX [[~ [EG [~ [[~ [EG [~ [[[pl_P4_1<=pl_P0_5 | EG [pl_P40_1<=0]] & EX [pl_P40_4<=pl_P36_1]]]]] & ~ [E [~ [[[pl_P4_1<=pl_P0_5 | EG [pl_P40_1<=0]] & EX [pl_P40_4<=pl_P36_1]]] U [~ [1<=pl_P40_2] & ~ [[[pl_P4_1<=pl_P0_5 | EG [pl_P40_1<=0]] & EX [pl_P40_4<=pl_P36_1]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[pl_P4_1<=pl_P0_5 | EG [pl_P40_1<=0]] & EX [pl_P40_4<=pl_P36_1]]]]] & ~ [E [~ [[[pl_P4_1<=pl_P0_5 | EG [pl_P40_1<=0]] & EX [pl_P40_4<=pl_P36_1]]] U [~ [1<=pl_P40_2] & ~ [[[pl_P4_1<=pl_P0_5 | EG [pl_P40_1<=0]] & EX [pl_P40_4<=pl_P36_1]]]]]]]] U [~ [[[pl_P7_4<=0 | ~ [E [true U pl_P34_1<=pl_P40_3]]] | [~ [pl_P19_1<=0] | [EG [pl_P7_1<=1] | [pl_P29_6<=1 & [~ [EG [~ [pl_P29_6<=pl_P39_1]]] & ~ [E [~ [pl_P29_6<=pl_P39_1] U [~ [pl_P40_5<=1] & ~ [pl_P29_6<=pl_P39_1]]]]]]]]]] & ~ [[~ [EG [~ [[[pl_P4_1<=pl_P0_5 | EG [pl_P40_1<=0]] & EX [pl_P40_4<=pl_P36_1]]]]] & ~ [E [~ [[[pl_P4_1<=pl_P0_5 | EG [pl_P40_1<=0]] & EX [pl_P40_4<=pl_P36_1]]] U [~ [1<=pl_P40_2] & ~ [[[pl_P4_1<=pl_P0_5 | EG [pl_P40_1<=0]] & EX [pl_P40_4<=pl_P36_1]]]]]]]]]]]]]
abstracting: (pl_P40_4<=pl_P36_1)
states: 1,407 (3)
.abstracting: (pl_P40_1<=0)
states: 1,407 (3)
.
EG iterations: 1
abstracting: (pl_P4_1<=pl_P0_5)
states: 1,508 (3)
abstracting: (1<=pl_P40_2)
states: 431
abstracting: (pl_P40_4<=pl_P36_1)
states: 1,407 (3)
.abstracting: (pl_P40_1<=0)
states: 1,407 (3)
.
EG iterations: 1
abstracting: (pl_P4_1<=pl_P0_5)
states: 1,508 (3)
abstracting: (pl_P40_4<=pl_P36_1)
states: 1,407 (3)
.abstracting: (pl_P40_1<=0)
states: 1,407 (3)
.
EG iterations: 1
abstracting: (pl_P4_1<=pl_P0_5)
states: 1,508 (3)
.
EG iterations: 1
abstracting: (pl_P29_6<=pl_P39_1)
states: 1,838 (3)
abstracting: (pl_P40_5<=1)
states: 1,838 (3)
abstracting: (pl_P29_6<=pl_P39_1)
states: 1,838 (3)
abstracting: (pl_P29_6<=pl_P39_1)
states: 1,838 (3)
.
EG iterations: 1
abstracting: (pl_P29_6<=1)
states: 1,838 (3)
abstracting: (pl_P7_1<=1)
states: 1,838 (3)
EG iterations: 0
abstracting: (pl_P19_1<=0)
states: 1,407 (3)
abstracting: (pl_P34_1<=pl_P40_3)
states: 1,814 (3)
abstracting: (pl_P7_4<=0)
states: 1,838 (3)
abstracting: (pl_P40_4<=pl_P36_1)
states: 1,407 (3)
.abstracting: (pl_P40_1<=0)
states: 1,407 (3)
.
EG iterations: 1
abstracting: (pl_P4_1<=pl_P0_5)
states: 1,508 (3)
abstracting: (1<=pl_P40_2)
states: 431
abstracting: (pl_P40_4<=pl_P36_1)
states: 1,407 (3)
.abstracting: (pl_P40_1<=0)
states: 1,407 (3)
.
EG iterations: 1
abstracting: (pl_P4_1<=pl_P0_5)
states: 1,508 (3)
abstracting: (pl_P40_4<=pl_P36_1)
states: 1,407 (3)
.abstracting: (pl_P40_1<=0)
states: 1,407 (3)
.
EG iterations: 1
abstracting: (pl_P4_1<=pl_P0_5)
states: 1,508 (3)
.
EG iterations: 1
abstracting: (pl_P40_4<=pl_P36_1)
states: 1,407 (3)
.abstracting: (pl_P40_1<=0)
states: 1,407 (3)
.
EG iterations: 1
abstracting: (pl_P4_1<=pl_P0_5)
states: 1,508 (3)
abstracting: (1<=pl_P40_2)
states: 431
abstracting: (pl_P40_4<=pl_P36_1)
states: 1,407 (3)
.abstracting: (pl_P40_1<=0)
states: 1,407 (3)
.
EG iterations: 1
abstracting: (pl_P4_1<=pl_P0_5)
states: 1,508 (3)
abstracting: (pl_P40_4<=pl_P36_1)
states: 1,407 (3)
.abstracting: (pl_P40_1<=0)
states: 1,407 (3)
.
EG iterations: 1
abstracting: (pl_P4_1<=pl_P0_5)
states: 1,508 (3)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
checking: E [[EX [A [[[pl_P34_5<=pl_P6_1 | pl_P9_1<=pl_P40_6] & 1<=pl_P0_6] U ~ [EF [pl_P1_1<=pl_P22_1]]]] | AX [pl_P29_6<=pl_P6_1]] U EX [[pl_P41_1<=pl_P30_1 & [[[EX [pl_P0_6<=0] | ~ [1<=pl_P34_3]] & A [pl_P22_1<=0 U pl_P12_1<=pl_P15_1]] & pl_P27_1<=pl_P3_1]]]]
normalized: E [[~ [EX [~ [pl_P29_6<=pl_P6_1]]] | EX [[~ [EG [E [true U pl_P1_1<=pl_P22_1]]] & ~ [E [E [true U pl_P1_1<=pl_P22_1] U [~ [[1<=pl_P0_6 & [pl_P34_5<=pl_P6_1 | pl_P9_1<=pl_P40_6]]] & E [true U pl_P1_1<=pl_P22_1]]]]]]] U EX [[pl_P41_1<=pl_P30_1 & [pl_P27_1<=pl_P3_1 & [[~ [EG [~ [pl_P12_1<=pl_P15_1]]] & ~ [E [~ [pl_P12_1<=pl_P15_1] U [~ [pl_P22_1<=0] & ~ [pl_P12_1<=pl_P15_1]]]]] & [~ [1<=pl_P34_3] | EX [pl_P0_6<=0]]]]]]]
abstracting: (pl_P0_6<=0)
states: 1,838 (3)
.abstracting: (1<=pl_P34_3)
states: 280
abstracting: (pl_P12_1<=pl_P15_1)
states: 1,407 (3)
abstracting: (pl_P22_1<=0)
states: 1,407 (3)
abstracting: (pl_P12_1<=pl_P15_1)
states: 1,407 (3)
abstracting: (pl_P12_1<=pl_P15_1)
states: 1,407 (3)
.
EG iterations: 1
abstracting: (pl_P27_1<=pl_P3_1)
states: 949
abstracting: (pl_P41_1<=pl_P30_1)
states: 1,407 (3)
.abstracting: (pl_P1_1<=pl_P22_1)
states: 1,838 (3)
abstracting: (pl_P9_1<=pl_P40_6)
states: 1,838 (3)
abstracting: (pl_P34_5<=pl_P6_1)
states: 1,476 (3)
abstracting: (1<=pl_P0_6)
states: 0
abstracting: (pl_P1_1<=pl_P22_1)
states: 1,838 (3)
abstracting: (pl_P1_1<=pl_P22_1)
states: 1,838 (3)
EG iterations: 0
.abstracting: (pl_P29_6<=pl_P6_1)
states: 1,838 (3)
.-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.031sec
totally nodes used: 164389 (1.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 266702 1312034 1578736
used/not used/entry size/cache size: 1440213 65668651 16 1024MB
basic ops cache: hits/miss/sum: 42557 218572 261129
used/not used/entry size/cache size: 328903 16448313 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: 3345 16732 20077
used/not used/entry size/cache size: 16726 8371882 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 66951844
1 150111
2 6472
3 414
4 23
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.080sec
BK_STOP 1678930944311
--------------------
content from stderr:
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
pl_P37_1
pl_P38_1
pl_P3_1
pl_P40_6
pl_P7_2
pl_P7_4
pl_P7_5
pl_P7_6
pl_P9_1
pl_P1_1
pl_P29_6
pl_P24_1
pl_P14_1
pl_P0_6
pl_P29_5
pl_P29_4
The net has transition(s) that can never fire:
tr_T23_18
tr_T23_30
tr_T23_24
tr_T23_36
tr_T9_12
check for constant places
pl_P14_1
pl_P1_1
pl_P24_1
pl_P29_4
pl_P29_5
pl_P29_6
pl_P37_1
pl_P38_1
pl_P3_1
pl_P7_2
pl_P7_4
pl_P7_5
pl_P7_6
pl_P9_1
found 14 constant places
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:1384 (24), effective:57 (1)
initing FirstDep: 0m 0.000sec
iterations count:56 (1), effective:0 (0)
iterations count:56 (1), effective:0 (0)
iterations count:601 (10), effective:31 (0)
iterations count:112 (2), effective:5 (0)
iterations count:56 (1), effective:0 (0)
iterations count:77 (1), effective:1 (0)
iterations count:564 (10), effective:24 (0)
iterations count:56 (1), effective:0 (0)
iterations count:1467 (26), effective:72 (1)
iterations count:810 (14), effective:30 (0)
iterations count:1774 (31), effective:84 (1)
iterations count:103 (1), effective:1 (0)
iterations count:56 (1), effective:0 (0)
iterations count:187 (3), effective:6 (0)
iterations count:85 (1), effective:2 (0)
iterations count:56 (1), effective:0 (0)
iterations count:491 (8), effective:18 (0)
iterations count:112 (2), effective:5 (0)
iterations count:170 (3), effective:8 (0)
iterations count:194 (3), effective:5 (0)
iterations count:481 (8), effective:21 (0)
iterations count:56 (1), effective:0 (0)
iterations count:56 (1), effective:0 (0)
iterations count:56 (1), effective:0 (0)
iterations count:56 (1), effective:0 (0)
iterations count:603 (10), effective:27 (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="Railroad-PT-005"
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 Railroad-PT-005, 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 r321-tall-167889192100361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Railroad-PT-005.tgz
mv Railroad-PT-005 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 ;