About the Execution of Marcie for IBM5964-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3963.720 | 5366.00 | 5000.00 | 30.00 | TTTTTTFTTFTFTFTF | 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-2270
Executing tool marcie
Input is IBM5964-PT-none, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324700060
=====================================================================
--------------------
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 IBM5964-PT-none-ReachabilityBounds-0
FORMULA_NAME IBM5964-PT-none-ReachabilityBounds-1
FORMULA_NAME IBM5964-PT-none-ReachabilityBounds-10
FORMULA_NAME IBM5964-PT-none-ReachabilityBounds-11
FORMULA_NAME IBM5964-PT-none-ReachabilityBounds-12
FORMULA_NAME IBM5964-PT-none-ReachabilityBounds-13
FORMULA_NAME IBM5964-PT-none-ReachabilityBounds-14
FORMULA_NAME IBM5964-PT-none-ReachabilityBounds-15
FORMULA_NAME IBM5964-PT-none-ReachabilityBounds-2
FORMULA_NAME IBM5964-PT-none-ReachabilityBounds-3
FORMULA_NAME IBM5964-PT-none-ReachabilityBounds-4
FORMULA_NAME IBM5964-PT-none-ReachabilityBounds-5
FORMULA_NAME IBM5964-PT-none-ReachabilityBounds-6
FORMULA_NAME IBM5964-PT-none-ReachabilityBounds-7
FORMULA_NAME IBM5964-PT-none-ReachabilityBounds-8
FORMULA_NAME IBM5964-PT-none-ReachabilityBounds-9
=== Now, execution of the tool begins
BK_START 1433633243298
Model: IBM5964-PT-none
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=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
(NrP: 263 NrTr: 139 NrArc: 541)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m3sec
RS generation: 0m0sec
-> reachability set: #nodes 1027 (1.0e+03) #states 15,546 (4)
starting MCC model checker
--------------------------
checking: maxVal(callToTask_s00002186_input_s00001011)<=2
normalized: maxVal(callToTask_s00002186_input_s00001011)<=2
abstracting: (0<=2) states: 15,546 (4)
-> the formula is TRUE
FORMULA IBM5964-PT-none-ReachabilityBounds-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(merge_s00001369_activated)<=3
normalized: maxVal(merge_s00001369_activated)<=3
abstracting: (0<=3) states: 15,546 (4)
-> the formula is TRUE
FORMULA IBM5964-PT-none-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [maxVal(callToTask_s00001305_input_s00000950)<=1 & maxVal(callToTask_s00005849_output_s00000960)<=2]
normalized: [maxVal(callToTask_s00001305_input_s00000950)<=1 & maxVal(callToTask_s00005849_output_s00000960)<=2]
abstracting: (0<=2) states: 15,546 (4)
abstracting: (0<=1) states: 15,546 (4)
-> the formula is TRUE
FORMULA IBM5964-PT-none-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(callToTask_s00005897_inputCriterion_s00000937_used)<=1
normalized: maxVal(callToTask_s00005897_inputCriterion_s00000937_used)<=1
abstracting: (5<=1) states: 0
-> the formula is FALSE
FORMULA IBM5964-PT-none-ReachabilityBounds-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [maxVal(callToProcess_s00001273_inputCriterion_s00000937_used)<=1 & maxVal(callToTask_s00002181_output_s00000979)<=3]
normalized: [maxVal(callToProcess_s00001273_inputCriterion_s00000937_used)<=1 & maxVal(callToTask_s00002181_output_s00000979)<=3]
abstracting: (0<=3) states: 15,546 (4)
abstracting: (0<=1) states: 15,546 (4)
-> the formula is TRUE
FORMULA IBM5964-PT-none-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(merge_s00001290_activated)<=1
normalized: maxVal(merge_s00001290_activated)<=1
abstracting: (3<=1) states: 0
-> the formula is FALSE
FORMULA IBM5964-PT-none-ReachabilityBounds-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(callToTask_s00002741_output_s00000981)<=3
normalized: maxVal(callToTask_s00002741_output_s00000981)<=3
abstracting: (0<=3) states: 15,546 (4)
-> the formula is TRUE
FORMULA IBM5964-PT-none-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[maxVal(callToTask_s00001746_input_s00000952)<=3 & maxVal(merge_s00000945_input_s00000952)<=3] & [[maxVal(merge_s00000945_input_s00000987)<=1 & [[maxVal(merge_s00001120_input_s00000952)<=2 & [maxVal(callToTask_s00005897_output_s00000979)<=1 & maxVal(callToTask_s00005965_output_s00000938)<=1]] & [[maxVal(callToTask_s00005971_output_s00000959)<=2 & maxVal(callToProcess_s00002538_input_s00000950)<=2] & [maxVal(callToTask_s00005970_output_s00000979)<=3 & maxVal(callToTask_s00002186_input_s00000950)<=2]]]] & maxVal(fork_s00001293_activated_s00000991)<=2]]
normalized: [[maxVal(callToTask_s00001746_input_s00000952)<=3 & maxVal(merge_s00000945_input_s00000952)<=3] & [maxVal(fork_s00001293_activated_s00000991)<=2 & [maxVal(merge_s00000945_input_s00000987)<=1 & [[[maxVal(callToTask_s00005971_output_s00000959)<=2 & maxVal(callToProcess_s00002538_input_s00000950)<=2] & [maxVal(callToTask_s00005970_output_s00000979)<=3 & maxVal(callToTask_s00002186_input_s00000950)<=2]] & [maxVal(merge_s00001120_input_s00000952)<=2 & [maxVal(callToTask_s00005897_output_s00000979)<=1 & maxVal(callToTask_s00005965_output_s00000938)<=1]]]]]]
abstracting: (0<=1) states: 15,546 (4)
abstracting: (5<=1) states: 0
abstracting: (0<=2) states: 15,546 (4)
abstracting: (0<=2) states: 15,546 (4)
abstracting: (0<=3) states: 15,546 (4)
abstracting: (3<=2) states: 0
abstracting: (0<=2) states: 15,546 (4)
abstracting: (0<=1) states: 15,546 (4)
abstracting: (0<=2) states: 15,546 (4)
abstracting: (0<=3) states: 15,546 (4)
abstracting: (0<=3) states: 15,546 (4)
-> the formula is FALSE
FORMULA IBM5964-PT-none-ReachabilityBounds-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(callToTask_s00002181_output_s00000979)<=2
normalized: maxVal(callToTask_s00002181_output_s00000979)<=2
abstracting: (0<=2) states: 15,546 (4)
-> the formula is TRUE
FORMULA IBM5964-PT-none-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [maxVal(merge_s00001292_activated)<=2 & [[[[maxVal(merge_s00001120_input_s00000987)<=3 & maxVal(merge_s00000945_activated)<=3] & [maxVal(endNode_s00000942_input_default)<=3 & [maxVal(callToProcess_s00004075_input_s00000935)<=1 & maxVal(callToProcess_s00005925_input_s00000986)<=1]]] & [[maxVal(callToTask_s00005849_output_s00000938)<=1 & [maxVal(merge_s00001120_input_s00001011)<=2 & maxVal(fork_s00001293_input_s00000935)<=3]] & [maxVal(callToTask_s00005897_inputCriterion_s00000937_used)<=2 & maxVal(callToTask_s00002526_input_s00000950)<=3]]] & maxVal(callToTask_s00002427_output_s00000938)<=2]]
normalized: [maxVal(merge_s00001292_activated)<=2 & [maxVal(callToTask_s00002427_output_s00000938)<=2 & [[[maxVal(callToTask_s00005897_inputCriterion_s00000937_used)<=2 & maxVal(callToTask_s00002526_input_s00000950)<=3] & [maxVal(callToTask_s00005849_output_s00000938)<=1 & [maxVal(merge_s00001120_input_s00001011)<=2 & maxVal(fork_s00001293_input_s00000935)<=3]]] & [[maxVal(endNode_s00000942_input_default)<=3 & [maxVal(callToProcess_s00004075_input_s00000935)<=1 & maxVal(callToProcess_s00005925_input_s00000986)<=1]] & [maxVal(merge_s00001120_input_s00000987)<=3 & maxVal(merge_s00000945_activated)<=3]]]]]
abstracting: (0<=3) states: 15,546 (4)
abstracting: (0<=3) states: 15,546 (4)
abstracting: (3<=1) states: 0
abstracting: (0<=1) states: 15,546 (4)
abstracting: (1<=3) states: 15,546 (4)
abstracting: (0<=3) states: 15,546 (4)
abstracting: (0<=2) states: 15,546 (4)
abstracting: (0<=1) states: 15,546 (4)
abstracting: (0<=3) states: 15,546 (4)
abstracting: (5<=2) states: 0
abstracting: (0<=2) states: 15,546 (4)
abstracting: (5<=2) states: 0
-> the formula is FALSE
FORMULA IBM5964-PT-none-ReachabilityBounds-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(callToTask_s00005969_input_s00000952)<=3
normalized: maxVal(callToTask_s00005969_input_s00000952)<=3
abstracting: (0<=3) states: 15,546 (4)
-> the formula is TRUE
FORMULA IBM5964-PT-none-ReachabilityBounds-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(callToProcess_s00002411_input_s00000950)<=3
normalized: maxVal(callToProcess_s00002411_input_s00000950)<=3
abstracting: (0<=3) states: 15,546 (4)
-> the formula is TRUE
FORMULA IBM5964-PT-none-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(merge_s00001291_input_s00000935)<=3
normalized: maxVal(merge_s00001291_input_s00000935)<=3
abstracting: (0<=3) states: 15,546 (4)
-> the formula is TRUE
FORMULA IBM5964-PT-none-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(callToTask_s00005971_output_s00000959)<=1
normalized: maxVal(callToTask_s00005971_output_s00000959)<=1
abstracting: (0<=1) states: 15,546 (4)
-> the formula is TRUE
FORMULA IBM5964-PT-none-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(callToProcess_s00005925_output_s00000956)<=2
normalized: maxVal(callToProcess_s00005925_output_s00000956)<=2
abstracting: (3<=2) states: 0
-> the formula is FALSE
FORMULA IBM5964-PT-none-ReachabilityBounds-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(callToTask_s00005970_input_s00000950)<=3
normalized: maxVal(callToTask_s00005970_input_s00000950)<=3
abstracting: (0<=3) states: 15,546 (4)
-> the formula is TRUE
FORMULA IBM5964-PT-none-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m5sec
BK_STOP 1433633248664
--------------------
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
iterations count:390 (2), effective:51 (0)
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="IBM5964-PT-none"
export BK_EXAMINATION="ReachabilityBounds"
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/IBM5964-PT-none.tgz
mv IBM5964-PT-none 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 IBM5964-PT-none, examination is ReachabilityBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r232su-smll-143354324700060"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityBounds" != "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 "ReachabilityBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityBounds.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 ;