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 |
1807.950 | 1809.00 | 1000.00 | 30.00 | FTFFTTFFFTFTTFTT | 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 Railroad-PT-005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r061-csrt-149440955100043
=====================================================================
--------------------
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-ReachabilityCardinality-0
FORMULA_NAME Railroad-PT-005-ReachabilityCardinality-1
FORMULA_NAME Railroad-PT-005-ReachabilityCardinality-10
FORMULA_NAME Railroad-PT-005-ReachabilityCardinality-11
FORMULA_NAME Railroad-PT-005-ReachabilityCardinality-12
FORMULA_NAME Railroad-PT-005-ReachabilityCardinality-13
FORMULA_NAME Railroad-PT-005-ReachabilityCardinality-14
FORMULA_NAME Railroad-PT-005-ReachabilityCardinality-15
FORMULA_NAME Railroad-PT-005-ReachabilityCardinality-2
FORMULA_NAME Railroad-PT-005-ReachabilityCardinality-3
FORMULA_NAME Railroad-PT-005-ReachabilityCardinality-4
FORMULA_NAME Railroad-PT-005-ReachabilityCardinality-5
FORMULA_NAME Railroad-PT-005-ReachabilityCardinality-6
FORMULA_NAME Railroad-PT-005-ReachabilityCardinality-7
FORMULA_NAME Railroad-PT-005-ReachabilityCardinality-8
FORMULA_NAME Railroad-PT-005-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1494705798725
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=ReachabilityCardinality.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.000sec
net check time: 0m 0.000sec
init dd package: 0m 1.210sec
RS generation: 0m 0.011sec
-> reachability set: #nodes 520 (5.2e+02) #states 1,838 (3)
starting MCC model checker
--------------------------
checking: EF [3<=pl_P31_1]
normalized: E [true U 3<=pl_P31_1]
abstracting: (3<=pl_P31_1)
states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [3<=pl_P4_1]
normalized: E [true U 3<=pl_P4_1]
abstracting: (3<=pl_P4_1)
states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [2<=pl_P24_1]
normalized: E [true U 2<=pl_P24_1]
abstracting: (2<=pl_P24_1)
states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [2<=pl_P31_1]]
normalized: ~ [E [true U 2<=pl_P31_1]]
abstracting: (2<=pl_P31_1)
states: 0
-> the formula is TRUE
FORMULA Railroad-PT-005-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [2<=pl_P40_1]
normalized: E [true U 2<=pl_P40_1]
abstracting: (2<=pl_P40_1)
states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [pl_P7_5<=pl_P30_1]
normalized: ~ [E [true U ~ [pl_P7_5<=pl_P30_1]]]
abstracting: (pl_P7_5<=pl_P30_1)
states: 1,838 (3)
-> the formula is TRUE
FORMULA Railroad-PT-005-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [pl_P37_1<=pl_P34_4]
normalized: ~ [E [true U ~ [pl_P37_1<=pl_P34_4]]]
abstracting: (pl_P37_1<=pl_P34_4)
states: 1,838 (3)
-> the formula is TRUE
FORMULA Railroad-PT-005-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[[~ [1<=pl_P0_5] & 1<=pl_P33_1] & 2<=pl_P7_3]]
normalized: E [true U [2<=pl_P7_3 & [~ [1<=pl_P0_5] & 1<=pl_P33_1]]]
abstracting: (1<=pl_P33_1)
states: 6
abstracting: (1<=pl_P0_5)
states: 458
abstracting: (2<=pl_P7_3)
states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[pl_P13_1<=pl_P29_4 & 3<=pl_P26_1]]
normalized: E [true U [pl_P13_1<=pl_P29_4 & 3<=pl_P26_1]]
abstracting: (3<=pl_P26_1)
states: 0
abstracting: (pl_P13_1<=pl_P29_4)
states: 1,320 (3)
-> the formula is FALSE
FORMULA Railroad-PT-005-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[~ [~ [pl_P3_1<=pl_P40_2]] | ~ [~ [pl_P38_1<=pl_P40_3]]]]
normalized: ~ [E [true U ~ [[pl_P3_1<=pl_P40_2 | pl_P38_1<=pl_P40_3]]]]
abstracting: (pl_P38_1<=pl_P40_3)
states: 1,838 (3)
abstracting: (pl_P3_1<=pl_P40_2)
states: 1,838 (3)
-> the formula is TRUE
FORMULA Railroad-PT-005-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [[[1<=pl_P34_5 & pl_P0_1<=pl_P38_1] & ~ [pl_P1_1<=pl_P10_1]]]]
normalized: ~ [E [true U [~ [pl_P1_1<=pl_P10_1] & [1<=pl_P34_5 & pl_P0_1<=pl_P38_1]]]]
abstracting: (pl_P0_1<=pl_P38_1)
states: 1,380 (3)
abstracting: (1<=pl_P34_5)
states: 616
abstracting: (pl_P1_1<=pl_P10_1)
states: 1,838 (3)
-> the formula is TRUE
FORMULA Railroad-PT-005-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [~ [[[pl_P34_1<=pl_P5_1 & 2<=pl_P40_6] & pl_P7_2<=pl_P29_3]]]
normalized: ~ [E [true U [pl_P7_2<=pl_P29_3 & [pl_P34_1<=pl_P5_1 & 2<=pl_P40_6]]]]
abstracting: (2<=pl_P40_6)
states: 0
abstracting: (pl_P34_1<=pl_P5_1)
states: 1,834 (3)
abstracting: (pl_P7_2<=pl_P29_3)
states: 1,838 (3)
-> the formula is TRUE
FORMULA Railroad-PT-005-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[[[2<=pl_P29_3 & 2<=pl_P34_5] | ~ [3<=pl_P0_3]] | ~ [[3<=pl_P21_1 & pl_P27_1<=pl_P15_1]]]]
normalized: ~ [E [true U ~ [[~ [[3<=pl_P21_1 & pl_P27_1<=pl_P15_1]] | [~ [3<=pl_P0_3] | [2<=pl_P29_3 & 2<=pl_P34_5]]]]]]
abstracting: (2<=pl_P34_5)
states: 0
abstracting: (2<=pl_P29_3)
states: 0
abstracting: (3<=pl_P0_3)
states: 0
abstracting: (pl_P27_1<=pl_P15_1)
states: 1,211 (3)
abstracting: (3<=pl_P21_1)
states: 0
-> the formula is TRUE
FORMULA Railroad-PT-005-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[[~ [pl_P7_5<=pl_P13_1] | [2<=pl_P23_1 | pl_P7_6<=pl_P15_1]] | [~ [pl_P0_6<=pl_P26_1] & ~ [2<=pl_P34_2]]]]
normalized: ~ [E [true U ~ [[[~ [2<=pl_P34_2] & ~ [pl_P0_6<=pl_P26_1]] | [~ [pl_P7_5<=pl_P13_1] | [2<=pl_P23_1 | pl_P7_6<=pl_P15_1]]]]]]
abstracting: (pl_P7_6<=pl_P15_1)
states: 1,838 (3)
abstracting: (2<=pl_P23_1)
states: 0
abstracting: (pl_P7_5<=pl_P13_1)
states: 1,838 (3)
abstracting: (pl_P0_6<=pl_P26_1)
states: 1,838 (3)
abstracting: (2<=pl_P34_2)
states: 0
-> the formula is TRUE
FORMULA Railroad-PT-005-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[[~ [pl_P34_4<=pl_P7_6] | ~ [pl_P40_1<=pl_P34_6]] & [~ [pl_P17_1<=pl_P8_1] & [pl_P40_2<=pl_P26_1 & 3<=pl_P29_4]]]]
normalized: E [true U [[~ [pl_P17_1<=pl_P8_1] & [pl_P40_2<=pl_P26_1 & 3<=pl_P29_4]] & [~ [pl_P40_1<=pl_P34_6] | ~ [pl_P34_4<=pl_P7_6]]]]
abstracting: (pl_P34_4<=pl_P7_6)
states: 1,243 (3)
abstracting: (pl_P40_1<=pl_P34_6)
states: 1,488 (3)
abstracting: (3<=pl_P29_4)
states: 0
abstracting: (pl_P40_2<=pl_P26_1)
states: 1,407 (3)
abstracting: (pl_P17_1<=pl_P8_1)
states: 1,448 (3)
-> the formula is FALSE
FORMULA Railroad-PT-005-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[[[1<=pl_P7_6 & 1<=pl_P7_1] & ~ [pl_P22_1<=pl_P40_5]] & [[3<=pl_P0_3 | 1<=pl_P33_1] & [2<=pl_P0_3 & pl_P21_1<=pl_P32_1]]]]
normalized: E [true U [[[2<=pl_P0_3 & pl_P21_1<=pl_P32_1] & [3<=pl_P0_3 | 1<=pl_P33_1]] & [~ [pl_P22_1<=pl_P40_5] & [1<=pl_P7_6 & 1<=pl_P7_1]]]]
abstracting: (1<=pl_P7_1)
states: 5
abstracting: (1<=pl_P7_6)
states: 0
abstracting: (pl_P22_1<=pl_P40_5)
states: 1,508 (3)
abstracting: (1<=pl_P33_1)
states: 6
abstracting: (3<=pl_P0_3)
states: 0
abstracting: (pl_P21_1<=pl_P32_1)
states: 1,609 (3)
abstracting: (2<=pl_P0_3)
states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
totally nodes used: 12889(1.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 16575 53164 69739
used/not used/entry size/cache size: 44989 67063875 16 1024MB
basic ops cache: hits/miss/sum: 10964 37307 48271
used/not used/entry size/cache size: 50970 16726246 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: 1307 2563 3870
used/not used/entry size/cache size: 2563 2094589 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 67095975
1 12889
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 1.781sec
BK_STOP 1494705800534
--------------------
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
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="ReachabilityCardinality"
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/Railroad-PT-005.tgz
mv 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 Railroad-PT-005, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r061-csrt-149440955100043"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 ;