About the Execution of MARCIE for S_Railroad-PT-005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1785.790 | 1869.00 | 990.00 | 30.00 | FTFTFFTTFTFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool marcie
Input is S_Railroad-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r141-csrt-149443423800039
=====================================================================
--------------------
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-0
FORMULA_NAME Railroad-PT-005-CTLCardinality-1
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
FORMULA_NAME Railroad-PT-005-CTLCardinality-2
FORMULA_NAME Railroad-PT-005-CTLCardinality-3
FORMULA_NAME Railroad-PT-005-CTLCardinality-4
FORMULA_NAME Railroad-PT-005-CTLCardinality-5
FORMULA_NAME Railroad-PT-005-CTLCardinality-6
FORMULA_NAME Railroad-PT-005-CTLCardinality-7
FORMULA_NAME Railroad-PT-005-CTLCardinality-8
FORMULA_NAME Railroad-PT-005-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1495084993741
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie rev. 8852M (built: crohr on 2017-05-03)
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: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6
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.001sec
net check time: 0m 0.000sec
init dd package: 0m 1.243sec
RS generation: 0m 0.011sec
-> reachability set: #nodes 520 (5.2e+02) #states 1,838 (3)
starting MCC model checker
--------------------------
checking: ~ [~ [~ [EF [3<=pl_P25_1]]]]
normalized: ~ [E [true U 3<=pl_P25_1]]
abstracting: (3<=pl_P25_1)
states: 0
-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [3<=pl_P15_1]
normalized: E [true U 3<=pl_P15_1]
abstracting: (3<=pl_P15_1)
states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [AG [EF [3<=pl_P8_1]]]
normalized: E [true U ~ [E [true U 3<=pl_P8_1]]]
abstracting: (3<=pl_P8_1)
states: 0
-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EF [3<=pl_P29_6]
normalized: E [true U 3<=pl_P29_6]
abstracting: (3<=pl_P29_6)
states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [2<=pl_P25_1]
normalized: E [true U 2<=pl_P25_1]
abstracting: (2<=pl_P25_1)
states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [~ [EF [3<=pl_P34_1]]]
normalized: ~ [EG [E [true U 3<=pl_P34_1]]]
abstracting: (3<=pl_P34_1)
states: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: ~ [AG [EF [pl_P40_3<=pl_P7_2]]]
normalized: E [true U ~ [E [true U pl_P40_3<=pl_P7_2]]]
abstracting: (pl_P40_3<=pl_P7_2)
states: 1,407 (3)
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: EF [~ [~ [[3<=pl_P0_4 & pl_P3_1<=pl_P9_1]]]]
normalized: E [true U [3<=pl_P0_4 & pl_P3_1<=pl_P9_1]]
abstracting: (pl_P3_1<=pl_P9_1)
states: 1,838 (3)
abstracting: (3<=pl_P0_4)
states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [EX [~ [~ [pl_P28_1<=pl_P31_1]]] & EF [AX [2<=pl_P34_4]]]
normalized: [E [true U ~ [EX [~ [2<=pl_P34_4]]]] & EX [pl_P28_1<=pl_P31_1]]
abstracting: (pl_P28_1<=pl_P31_1)
states: 1,609 (3)
.abstracting: (2<=pl_P34_4)
states: 0
.-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [A [pl_P40_4<=pl_P7_4 U pl_P7_1<=pl_P7_2]]
normalized: ~ [E [true U ~ [[~ [EG [~ [pl_P7_1<=pl_P7_2]]] & ~ [E [~ [pl_P7_1<=pl_P7_2] U [~ [pl_P7_1<=pl_P7_2] & ~ [pl_P40_4<=pl_P7_4]]]]]]]]
abstracting: (pl_P40_4<=pl_P7_4)
states: 1,407 (3)
abstracting: (pl_P7_1<=pl_P7_2)
states: 1,833 (3)
abstracting: (pl_P7_1<=pl_P7_2)
states: 1,833 (3)
abstracting: (pl_P7_1<=pl_P7_2)
states: 1,833 (3)
..
EG iterations: 2
-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [EF [[pl_P10_1<=pl_P34_4 | pl_P29_5<=pl_P38_1]]]
normalized: ~ [E [true U ~ [E [true U [pl_P10_1<=pl_P34_4 | pl_P29_5<=pl_P38_1]]]]]
abstracting: (pl_P29_5<=pl_P38_1)
states: 1,838 (3)
abstracting: (pl_P10_1<=pl_P34_4)
states: 1,833 (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: AG [[EF [pl_P4_1<=pl_P37_1] | ~ [~ [pl_P3_1<=pl_P40_5]]]]
normalized: ~ [E [true U ~ [[pl_P3_1<=pl_P40_5 | E [true U pl_P4_1<=pl_P37_1]]]]]
abstracting: (pl_P4_1<=pl_P37_1)
states: 1,407 (3)
abstracting: (pl_P3_1<=pl_P40_5)
states: 1,838 (3)
-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: A [[[1<=pl_P9_1 & 3<=pl_P15_1] & [1<=pl_P40_3 & 2<=pl_P40_5]] U EF [3<=pl_P26_1]]
normalized: [~ [EG [~ [E [true U 3<=pl_P26_1]]]] & ~ [E [~ [E [true U 3<=pl_P26_1]] U [~ [E [true U 3<=pl_P26_1]] & ~ [[[1<=pl_P40_3 & 2<=pl_P40_5] & [1<=pl_P9_1 & 3<=pl_P15_1]]]]]]]
abstracting: (3<=pl_P15_1)
states: 0
abstracting: (1<=pl_P9_1)
states: 0
abstracting: (2<=pl_P40_5)
states: 0
abstracting: (1<=pl_P40_3)
states: 431
abstracting: (3<=pl_P26_1)
states: 0
abstracting: (3<=pl_P26_1)
states: 0
abstracting: (3<=pl_P26_1)
states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [[AG [pl_P37_1<=pl_P39_1] & EF [~ [pl_P14_1<=pl_P21_1]]] & AX [pl_P34_4<=pl_P14_1]]
normalized: [~ [EX [~ [pl_P34_4<=pl_P14_1]]] & [E [true U ~ [pl_P14_1<=pl_P21_1]] & ~ [E [true U ~ [pl_P37_1<=pl_P39_1]]]]]
abstracting: (pl_P37_1<=pl_P39_1)
states: 1,838 (3)
abstracting: (pl_P14_1<=pl_P21_1)
states: 1,838 (3)
abstracting: (pl_P34_4<=pl_P14_1)
states: 1,243 (3)
.-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EF [[[[pl_P13_1<=pl_P0_1 & 3<=pl_P30_1] & [2<=pl_P34_5 & pl_P40_2<=pl_P8_1]] & ~ [pl_P10_1<=pl_P42_1]]]
normalized: E [true U [~ [pl_P10_1<=pl_P42_1] & [[2<=pl_P34_5 & pl_P40_2<=pl_P8_1] & [pl_P13_1<=pl_P0_1 & 3<=pl_P30_1]]]]
abstracting: (3<=pl_P30_1)
states: 0
abstracting: (pl_P13_1<=pl_P0_1)
states: 1,454 (3)
abstracting: (pl_P40_2<=pl_P8_1)
states: 1,508 (3)
abstracting: (2<=pl_P34_5)
states: 0
abstracting: (pl_P10_1<=pl_P42_1)
states: 1,833 (3)
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: [~ [[EF [pl_P29_4<=pl_P39_1] | EF [3<=pl_P32_1]]] | [~ [[pl_P34_1<=pl_P29_6 | [1<=pl_P26_1 | pl_P2_1<=pl_P0_2]]] | [EG [3<=pl_P39_1] | EF [3<=pl_P25_1]]]]
normalized: [[[E [true U 3<=pl_P25_1] | EG [3<=pl_P39_1]] | ~ [[pl_P34_1<=pl_P29_6 | [1<=pl_P26_1 | pl_P2_1<=pl_P0_2]]]] | ~ [[E [true U 3<=pl_P32_1] | E [true U pl_P29_4<=pl_P39_1]]]]
abstracting: (pl_P29_4<=pl_P39_1)
states: 1,838 (3)
abstracting: (3<=pl_P32_1)
states: 0
abstracting: (pl_P2_1<=pl_P0_2)
states: 1,070 (3)
abstracting: (1<=pl_P26_1)
states: 17
abstracting: (pl_P34_1<=pl_P29_6)
states: 1,814 (3)
abstracting: (3<=pl_P39_1)
states: 0
.
EG iterations: 1
abstracting: (3<=pl_P25_1)
states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
totally nodes used: 62857(6.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 42884 116317 159201
used/not used/entry size/cache size: 103372 67005492 16 1024MB
basic ops cache: hits/miss/sum: 35210 106156 141366
used/not used/entry size/cache size: 206054 16571162 12 192MB
unary ops cache: hits/miss/sum: 0 105 105
used/not used/entry size/cache size: 105 8388503 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 1316 2436 3752
used/not used/entry size/cache size: 2435 2094717 32 64MB
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 67046043
1 62785
2 36
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 1.839sec
BK_STOP 1495084995610
--------------------
content from stderr:
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
pl_P37_1
pl_P38_1
pl_P29_6
pl_P29_4
pl_P29_5
pl_P24_1
pl_P1_1
pl_P14_1
pl_P0_6
pl_P3_1
pl_P40_6
pl_P7_2
pl_P7_4
pl_P7_5
pl_P7_6
pl_P9_1
The net has transition(s) that can never fire:
tr_T23_30
tr_T23_36
tr_T23_18
tr_T23_24
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:1263 (22), effective:59 (1)
initing FirstDep: 0m 0.000sec
iterations count:56 (1), effective:0 (0)
iterations count:208 (3), effective:16 (0)
iterations count:56 (1), effective:0 (0)
iterations count:98 (1), effective:1 (0)
iterations count:56 (1), effective:0 (0)
iterations count:56 (1), effective:0 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_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"
# 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
tar xzf /home/mcc/BenchKit/INPUTS/S_Railroad-PT-005.tgz
mv S_Railroad-PT-005 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is S_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 r141-csrt-149443423800039"
echo "====================================================================="
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
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 ;