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 IBM703-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-143354324700073
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433633345950

Model: IBM703-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: 262 NrTr: 284 NrArc: 572)

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 773 (7.7e+02) #states 8,370 (3)



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

checking: maxVal(merge_s00000458_input_s00000285)<=1
normalized: maxVal(merge_s00000458_input_s00000285)<=1

abstracting: (1<=1) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(task_s00000744_input_s00000263)<=1
normalized: maxVal(task_s00000744_input_s00000263)<=1

abstracting: (1<=1) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(task_s00000706_output_s00000264)<=3 & maxVal(merge_s00000319_activated)<=3]
normalized: [maxVal(task_s00000706_output_s00000264)<=3 & maxVal(merge_s00000319_activated)<=3]

abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(decision_s00000802_input_s00000263)<=3 & [maxVal(task_s00000732_input_s00000263)<=3 & maxVal(task_s00000743_output_s00000264)<=3]]
normalized: [maxVal(decision_s00000802_input_s00000263)<=3 & [maxVal(task_s00000732_input_s00000263)<=3 & maxVal(task_s00000743_output_s00000264)<=3]]

abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(task_s00000740_output_s00000264)<=3
normalized: maxVal(task_s00000740_output_s00000264)<=3

abstracting: (1<=3) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(task_s00000748_output_s00000264)<=2 & maxVal(task_s00000760_input_s00000263)<=3]
normalized: [maxVal(task_s00000748_output_s00000264)<=2 & maxVal(task_s00000760_input_s00000263)<=3]

abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=2) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(task_s00000723_inputCriterion_s00000257_used)<=3 & [[[maxVal(task_s00000710_input_s00000263)<=1 & maxVal(decision_s00000783_activated)<=3] & maxVal(callToProcess_s00000807_output_s00000264)<=2] & [maxVal(merge_s00000458_input_s00000285)<=3 & [[maxVal(merge_s00000283_input_s00000263)<=2 & maxVal(decision_s00000772_activated)<=3] & maxVal(callToProcess_s00000808_inputCriterion_s00000257_used)<=1]]]] & [[[[maxVal(merge_s00000456_input_s00000263)<=2 & maxVal(fork_s00000465_activated_s00000274)<=3] & maxVal(task_s00000704_output_s00000264)<=2] & [maxVal(merge_s00000456_input_s00000290)<=3 & maxVal(task_s00000762_output_s00000264)<=3]] & maxVal(fork_s00000465_activated_s00000272)<=1]]
normalized: [[maxVal(fork_s00000465_activated_s00000272)<=1 & [[maxVal(task_s00000704_output_s00000264)<=2 & [maxVal(merge_s00000456_input_s00000263)<=2 & maxVal(fork_s00000465_activated_s00000274)<=3]] & [maxVal(merge_s00000456_input_s00000290)<=3 & maxVal(task_s00000762_output_s00000264)<=3]]] & [maxVal(task_s00000723_inputCriterion_s00000257_used)<=3 & [[maxVal(callToProcess_s00000807_output_s00000264)<=2 & [maxVal(task_s00000710_input_s00000263)<=1 & maxVal(decision_s00000783_activated)<=3]] & [maxVal(merge_s00000458_input_s00000285)<=3 & [maxVal(callToProcess_s00000808_inputCriterion_s00000257_used)<=1 & [maxVal(merge_s00000283_input_s00000263)<=2 & maxVal(decision_s00000772_activated)<=3]]]]]]

abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=2) states: 8,370 (3)
abstracting: (1<=1) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=1) states: 8,370 (3)
abstracting: (1<=2) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=2) states: 8,370 (3)
abstracting: (1<=2) states: 8,370 (3)
abstracting: (1<=1) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(task_s00000737_output_s00000264)<=1 & maxVal(stopNode_s00000597_input_default)<=3]
normalized: [maxVal(task_s00000737_output_s00000264)<=1 & maxVal(stopNode_s00000597_input_default)<=3]

abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=1) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(task_s00000743_output_s00000264)<=3 & [maxVal(merge_s00000288_activated)<=3 & [[[[maxVal(merge_s00000446_input_s00000447)<=2 & maxVal(task_s00000715_input_s00000263)<=1] & [maxVal(decision_s00000772_activated)<=2 & maxVal(merge_s00000341_input_s00000263)<=1]] & [[maxVal(callToProcess_s00000596_output_s00000264)<=1 & maxVal(merge_s00000458_activated)<=3] & [maxVal(task_s00000729_input_s00000263)<=2 & maxVal(merge_s00000451_input_s00000285)<=3]]] & maxVal(task_s00000718_inputCriterion_s00000257_used)<=2]]]
normalized: [maxVal(task_s00000743_output_s00000264)<=3 & [maxVal(merge_s00000288_activated)<=3 & [maxVal(task_s00000718_inputCriterion_s00000257_used)<=2 & [[[maxVal(decision_s00000772_activated)<=2 & maxVal(merge_s00000341_input_s00000263)<=1] & [maxVal(merge_s00000446_input_s00000447)<=2 & maxVal(task_s00000715_input_s00000263)<=1]] & [[maxVal(callToProcess_s00000596_output_s00000264)<=1 & maxVal(merge_s00000458_activated)<=3] & [maxVal(task_s00000729_input_s00000263)<=2 & maxVal(merge_s00000451_input_s00000285)<=3]]]]]]

abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=2) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=1) states: 8,370 (3)
abstracting: (1<=1) states: 8,370 (3)
abstracting: (1<=2) states: 8,370 (3)
abstracting: (1<=1) states: 8,370 (3)
abstracting: (1<=2) states: 8,370 (3)
abstracting: (1<=2) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(merge_s00000283_input_s00000263)<=1
normalized: maxVal(merge_s00000283_input_s00000263)<=1

abstracting: (1<=1) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(merge_s00000446_input_s00000447)<=3 & [[[maxVal(task_s00000760_output_s00000264)<=1 & [[maxVal(decision_s00000784_input_s00000263)<=1 & maxVal(task_s00000763_output_s00000264)<=1] & [maxVal(task_s00000728_output_s00000264)<=3 & maxVal(task_s00000749_output_s00000264)<=1]]] & maxVal(decision_s00000775_activated)<=2] & [maxVal(task_s00000734_output_s00000264)<=3 & maxVal(merge_s00000462_input_s00000285)<=3]]]
normalized: [maxVal(merge_s00000446_input_s00000447)<=3 & [[maxVal(task_s00000734_output_s00000264)<=3 & maxVal(merge_s00000462_input_s00000285)<=3] & [maxVal(decision_s00000775_activated)<=2 & [maxVal(task_s00000760_output_s00000264)<=1 & [[maxVal(decision_s00000784_input_s00000263)<=1 & maxVal(task_s00000763_output_s00000264)<=1] & [maxVal(task_s00000728_output_s00000264)<=3 & maxVal(task_s00000749_output_s00000264)<=1]]]]]]

abstracting: (1<=1) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=1) states: 8,370 (3)
abstracting: (1<=1) states: 8,370 (3)
abstracting: (1<=1) states: 8,370 (3)
abstracting: (1<=2) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(task_s00000718_output_s00000264)<=3
normalized: maxVal(task_s00000718_output_s00000264)<=3

abstracting: (1<=3) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(merge_s00000453_input_s00000263)<=3 & [maxVal(decision_s00000780_activated)<=1 & maxVal(decision_s00000774_activated)<=1]]
normalized: [maxVal(merge_s00000453_input_s00000263)<=3 & [maxVal(decision_s00000780_activated)<=1 & maxVal(decision_s00000774_activated)<=1]]

abstracting: (1<=1) states: 8,370 (3)
abstracting: (1<=1) states: 8,370 (3)
abstracting: (1<=3) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(task_s00000715_inputCriterion_s00000257_used)<=3
normalized: maxVal(task_s00000715_inputCriterion_s00000257_used)<=3

abstracting: (1<=3) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(task_s00000743_output_s00000264)<=3
normalized: maxVal(task_s00000743_output_s00000264)<=3

abstracting: (1<=3) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(merge_s00000453_input_s00000263)<=1 & maxVal(callToProcess_s00000808_inputCriterion_s00000257_used)<=2]
normalized: [maxVal(merge_s00000453_input_s00000263)<=1 & maxVal(callToProcess_s00000808_inputCriterion_s00000257_used)<=2]

abstracting: (1<=2) states: 8,370 (3)
abstracting: (1<=1) states: 8,370 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m5sec


BK_STOP 1433633351626

--------------------
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

580
iterations count:1777 (6), effective:266 (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="IBM703-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/IBM703-PT-none.tgz
mv IBM703-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 IBM703-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-143354324700073"
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 '' ReachabilityBounds.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 ;