About the Execution of MARCIE for S_CircularTrains-PT-384
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
12059.690 | 1549717.00 | 1549020.00 | 20.00 | 1 1 1 1 1 1 1 1 1 2 1 1 2 1 1 1 | 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_CircularTrains-PT-384, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r081-csrt-149441064700623
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CircularTrains-PT-384-UpperBounds-0
FORMULA_NAME CircularTrains-PT-384-UpperBounds-1
FORMULA_NAME CircularTrains-PT-384-UpperBounds-10
FORMULA_NAME CircularTrains-PT-384-UpperBounds-11
FORMULA_NAME CircularTrains-PT-384-UpperBounds-12
FORMULA_NAME CircularTrains-PT-384-UpperBounds-13
FORMULA_NAME CircularTrains-PT-384-UpperBounds-14
FORMULA_NAME CircularTrains-PT-384-UpperBounds-15
FORMULA_NAME CircularTrains-PT-384-UpperBounds-2
FORMULA_NAME CircularTrains-PT-384-UpperBounds-3
FORMULA_NAME CircularTrains-PT-384-UpperBounds-4
FORMULA_NAME CircularTrains-PT-384-UpperBounds-5
FORMULA_NAME CircularTrains-PT-384-UpperBounds-6
FORMULA_NAME CircularTrains-PT-384-UpperBounds-7
FORMULA_NAME CircularTrains-PT-384-UpperBounds-8
FORMULA_NAME CircularTrains-PT-384-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1494901495642
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=UpperBounds.xml --memory=6
parse successfull
net created successfully
Net: CircularTrains_PT_384
(NrP: 768 NrTr: 384 NrArc: 1536)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.049sec
net check time: 0m 0.000sec
init dd package: 0m 1.264sec
RS generation: 0m 0.013sec
-> last computed set: #nodes 384 (3.8e+02) #states 1
parse successfull
net created successfully
Net: CircularTrains_PT_384
(NrP: 768 NrTr: 384 NrArc: 1536)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.042sec
net check time: 0m 0.000sec
init dd package: 0m 4.113sec
before gc: list nodes free: 1648174
after gc: idd nodes used:182206, unused:63817794; list nodes free:298930020
before gc: list nodes free: 1216307
after gc: idd nodes used:145676, unused:63854324; list nodes free:299142874
before gc: list nodes free: 1249569
after gc: idd nodes used:233718, unused:63766282; list nodes free:298749036
RS generation: 25m38.819sec
-> reachability set: #nodes 196619 (2.0e+05) #states 16,376,641,351,227,849,741,077,397,217,895,636,582,218,158,650,060,650,984,502,471,241,967,517,991,687,943,434,910,035 (88)
starting MCC model checker
--------------------------
checking: place_bound(Section_189)
normalized: place_bound(Section_189)
-> the formula is 1
FORMULA CircularTrains-PT-384-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: place_bound(Section_36)
normalized: place_bound(Section_36)
-> the formula is 1
FORMULA CircularTrains-PT-384-UpperBounds-1 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(F49)
normalized: place_bound(F49)
-> the formula is 1
FORMULA CircularTrains-PT-384-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(F347)
normalized: place_bound(F347)
-> the formula is 2
FORMULA CircularTrains-PT-384-UpperBounds-3 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(F60)
normalized: place_bound(F60)
-> the formula is 1
FORMULA CircularTrains-PT-384-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Section_92)
normalized: place_bound(Section_92)
-> the formula is 1
FORMULA CircularTrains-PT-384-UpperBounds-5 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(F209)
normalized: place_bound(F209)
-> the formula is 2
FORMULA CircularTrains-PT-384-UpperBounds-6 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Section_129)
normalized: place_bound(Section_129)
-> the formula is 1
FORMULA CircularTrains-PT-384-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Section_65)
normalized: place_bound(Section_65)
-> the formula is 1
FORMULA CircularTrains-PT-384-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(F367)
normalized: place_bound(F367)
-> the formula is 1
FORMULA CircularTrains-PT-384-UpperBounds-9 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Section_340)
normalized: place_bound(Section_340)
-> the formula is 1
FORMULA CircularTrains-PT-384-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Section_313)
normalized: place_bound(Section_313)
-> the formula is 1
FORMULA CircularTrains-PT-384-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Section_252)
normalized: place_bound(Section_252)
-> the formula is 1
FORMULA CircularTrains-PT-384-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Section_8)
normalized: place_bound(Section_8)
-> the formula is 1
FORMULA CircularTrains-PT-384-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Section_24)
normalized: place_bound(Section_24)
-> the formula is 1
FORMULA CircularTrains-PT-384-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Section_1)
normalized: place_bound(Section_1)
-> the formula is 1
FORMULA CircularTrains-PT-384-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
totally nodes used: 210518337 (2.1e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 632701809 1925920222 2558622031
used/not used/entry size/cache size: 66972203 136661 16 1024MB
basic ops cache: hits/miss/sum: 1323629 4331315 5654944
used/not used/entry size/cache size: 1595468 15181748 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: 64772 196622 261394
used/not used/entry size/cache size: 194371 8194237 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 51343334
1 12965173
2 2354649
3 385483
4 53077
5 6298
6 744
7 94
8 11
9 1
>= 10 0
Total processing time: 25m49.496sec
BK_STOP 1494903045359
--------------------
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.002sec
zbdd.cc:1122: Boundedness exception: net is not 1-bounded!
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.002sec
217201
iterations count:122624 (319), effective:24576 (64)
initing FirstDep: 0m 0.003sec
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_CircularTrains-PT-384"
export BK_EXAMINATION="UpperBounds"
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_CircularTrains-PT-384.tgz
mv S_CircularTrains-PT-384 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_CircularTrains-PT-384, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r081-csrt-149441064700623"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 ;