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-2270
Executing tool marcie
Input is Raft-PT-05, examination is ReachabilityComputeBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r246su-smll-143368767200179
=====================================================================

--------------------
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 Raft-PT-05-ReachabilityComputeBounds-0
FORMULA_NAME Raft-PT-05-ReachabilityComputeBounds-1
FORMULA_NAME Raft-PT-05-ReachabilityComputeBounds-10
FORMULA_NAME Raft-PT-05-ReachabilityComputeBounds-11
FORMULA_NAME Raft-PT-05-ReachabilityComputeBounds-12
FORMULA_NAME Raft-PT-05-ReachabilityComputeBounds-13
FORMULA_NAME Raft-PT-05-ReachabilityComputeBounds-14
FORMULA_NAME Raft-PT-05-ReachabilityComputeBounds-15
FORMULA_NAME Raft-PT-05-ReachabilityComputeBounds-2
FORMULA_NAME Raft-PT-05-ReachabilityComputeBounds-3
FORMULA_NAME Raft-PT-05-ReachabilityComputeBounds-4
FORMULA_NAME Raft-PT-05-ReachabilityComputeBounds-5
FORMULA_NAME Raft-PT-05-ReachabilityComputeBounds-6
FORMULA_NAME Raft-PT-05-ReachabilityComputeBounds-7
FORMULA_NAME Raft-PT-05-ReachabilityComputeBounds-8
FORMULA_NAME Raft-PT-05-ReachabilityComputeBounds-9

=== Now, execution of the tool begins

BK_START 1433898627395

Model: Raft-PT-05
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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=ReachabilityComputeBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 133 NrTr: 238 NrArc: 864)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m3sec


RS generation: 0m9sec


-> reachability set: #nodes 4398 (4.4e+03) #states 5,937,946,479,402,210,021 (18)



starting MCC model checker
--------------------------

checking: maxVal(p121)
normalized: maxVal(p121)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p44)
normalized: maxVal(p44)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-1 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p10)
normalized: maxVal(p10)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p58)
normalized: maxVal(p58)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-3 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p75)
normalized: maxVal(p75)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p130)
normalized: maxVal(p130)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-5 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p16)
normalized: maxVal(p16)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p63)
normalized: maxVal(p63)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p115)
normalized: maxVal(p115)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p76)
normalized: maxVal(p76)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-9 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p58)
normalized: maxVal(p58)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p130)
normalized: maxVal(p130)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p110)
normalized: maxVal(p110)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p29)
normalized: maxVal(p29)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p3)
normalized: maxVal(p3)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(p26)
normalized: maxVal(p26)

-> the formula is 1

FORMULA Raft-PT-05-ReachabilityComputeBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m14sec


BK_STOP 1433898641594

--------------------
content from stderr:

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: 0m0sec

292 380 570 583 575 575 586 588 588 582 596 582 554 587 556 564 564 564 612 606 606 565 661 1084 1168 1148 1147 1184 1198 1171 1068 1108 1088 1169 1257 1295 1257 1156 1179 1217 1257 1276 1314 1143 1131 1304 1222 1262 1226 1196 1174 1192 1192 1260 1272 1090 1198 1214 1195 1267 1267 1105 1176 1084 1286 2280 2188 2149 1989 2309 2435 2179 2427 2188 2085 2639 2407 2577 2537 2224 2505 2869 2525 2456 2069 2367 2459 2449 2379 2203 2294 2442 2410 2575 2531 2144 2388 2668 2345 2489 2406 2251 2423 2888 2472 2548 2322 2415 2535 2422 2576 2552 2254 2486 2541 2209 2656 3037 2467 2615 2541 2402 2572 2683 2287 2614 3039 2749 2647 2526 2329 2486 2482 2214 2802 2713 2699 2619 2541 2195 2590 2484 2590 2812 2581 2745 2681 2521 2197 2490 2416 2441 2177 2664 3792 4190 4581 3990 4782 4574 4408 4344 4898 5026 5012 4520 4531 4594 4944 4896 5914 5184 5213 5558 5174 5168 5487 5002 5138 5274 5232 5024 4779 4816 5264 5564 5920 5694 5278 6062 5706 5478 5344 5542 5702 5824 5316 5240 5138 5472 5696 6458 5694 5613 5966 5634 5428 5687 5027 5762 5246 5130 4836 4582 4440 5440 5352 5266 5134 5446 5566 5624 5166 4996 5470 5306 5130 5339 4783 4826 5299 5271 5483 6018 5322 5749 5277 5317 5536 4852 5573 5277 5221 5079 4749 4847 5863 6051 6575 5785 5710 5977 5725 5653 5924 5365 5929 5673 5593 5848 5293 5421 5093 5397 6325 5533 5460 5903 5415 5403 5678 5115 5775 5303 5343 5602 5043 5171 4971 5275 6203 5411 5338 5781 5293 5281 5556 4993 5573 5181 5221 5480 4921 5049 5498 5702 6210 6041 5345 5684 5388 5340 5559 4875 5700 5308 5244 5483 4772 4870 4709 5742 5902 5988 5752 5336 6024 5616 5540 5386 5752 5944 5680 5592 5270 5346 4726 5324 5044 6244 5452 5294 5302 5550 5746 5597 5052 5702 5282 5210 5521 5083 5090 4560 5528 5440 5678 5442 5026 5810 5454 5370 5076 4590 5650 5378 5118 4960 5036 4446
iterations count:360652 (1515), effective:10218 (42)

initing FirstDep: 0m0sec

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="Raft-PT-05"
export BK_EXAMINATION="ReachabilityComputeBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/Raft-PT-05.tgz
mv Raft-PT-05 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is Raft-PT-05, examination is ReachabilityComputeBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r246su-smll-143368767200179"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityComputeBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityComputeBounds" != "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 "ReachabilityComputeBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityComputeBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityComputeBounds.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 '' ReachabilityComputeBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;