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 IBM319-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324700048
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433633155554

Model: IBM319-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=ReachabilityCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 253 NrTr: 178 NrArc: 526)

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 1063 (1.1e+03) #states 2,482 (3)



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

checking: AG [[2<=callToProcess_s00002943_inputCriterion_s00001053_used | [~ [2<=callToTask_s00001168_input_s00001066] | [callToTask_s00002958_output_s00001054<=callToTask_s00002959_input_s00001052 & decision_s00001126_input_s00001066<=callToTask_s00002964_output_s00001077]]]]
normalized: ~ [E [true U ~ [[2<=callToProcess_s00002943_inputCriterion_s00001053_used | [[callToTask_s00002958_output_s00001054<=callToTask_s00002959_input_s00001052 & decision_s00001126_input_s00001066<=callToTask_s00002964_output_s00001077] | ~ [2<=callToTask_s00001168_input_s00001066]]]]]]

abstracting: (2<=callToTask_s00001168_input_s00001066) states: 0
abstracting: (decision_s00001126_input_s00001066<=callToTask_s00002964_output_s00001077) states: 2,437 (3)
abstracting: (callToTask_s00002958_output_s00001054<=callToTask_s00002959_input_s00001052) states: 2,479 (3)
abstracting: (2<=callToProcess_s00002943_inputCriterion_s00001053_used) states: 0
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[merge_s00001061_activated<=callToTask_s00002954_output_s00001054 | 2<=callToTask_s00001852_inputCriterion_s00001053_used] | callToTask_s00002869_output_s00001054<=callToTask_s00002954_input_s00001066] | [2<=callToTask_s00002870_output_s00001054 | [callToTask_s00002950_input_s00001066<=callToTask_s00002963_output_s00001077 & 1<=callToTask_s00002966_output_s00001054]]]]
normalized: ~ [E [true U ~ [[[callToTask_s00002869_output_s00001054<=callToTask_s00002954_input_s00001066 | [merge_s00001061_activated<=callToTask_s00002954_output_s00001054 | 2<=callToTask_s00001852_inputCriterion_s00001053_used]] | [2<=callToTask_s00002870_output_s00001054 | [callToTask_s00002950_input_s00001066<=callToTask_s00002963_output_s00001077 & 1<=callToTask_s00002966_output_s00001054]]]]]]

abstracting: (1<=callToTask_s00002966_output_s00001054) states: 3
abstracting: (callToTask_s00002950_input_s00001066<=callToTask_s00002963_output_s00001077) states: 2,479 (3)
abstracting: (2<=callToTask_s00002870_output_s00001054) states: 0
abstracting: (2<=callToTask_s00001852_inputCriterion_s00001053_used) states: 0
abstracting: (merge_s00001061_activated<=callToTask_s00002954_output_s00001054) states: 2,479 (3)
abstracting: (callToTask_s00002869_output_s00001054<=callToTask_s00002954_input_s00001066) states: 2,481 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [2<=callToTask_s00002870_inputCriterion_s00001053_used]
normalized: E [true U 2<=callToTask_s00002870_inputCriterion_s00001053_used]

abstracting: (2<=callToTask_s00002870_inputCriterion_s00001053_used) states: 0
-> the formula is FALSE

FORMULA IBM319-PT-none-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [~ [[merge_s00002239_input_s00001068<=merge_s00002241_input_s00001052 & 3<=fork_s00001403_activated_s00001073]]]]
normalized: E [true U [merge_s00002239_input_s00001068<=merge_s00002241_input_s00001052 & 3<=fork_s00001403_activated_s00001073]]

abstracting: (3<=fork_s00001403_activated_s00001073) states: 0
abstracting: (merge_s00002239_input_s00001068<=merge_s00002241_input_s00001052) states: 2,479 (3)
-> the formula is FALSE

FORMULA IBM319-PT-none-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[~ [[merge_s00002239_input_s00001129<=decision_s00002762_activated & callToTask_s00002959_input_s00001052<=callToTask_s00002955_inputCriterion_s00001053_used]] | 2<=decision_s00002762_activated]]
normalized: E [true U [2<=decision_s00002762_activated | ~ [[merge_s00002239_input_s00001129<=decision_s00002762_activated & callToTask_s00002959_input_s00001052<=callToTask_s00002955_inputCriterion_s00001053_used]]]]

abstracting: (callToTask_s00002959_input_s00001052<=callToTask_s00002955_inputCriterion_s00001053_used) states: 2,479 (3)
abstracting: (merge_s00002239_input_s00001129<=decision_s00002762_activated) states: 2,479 (3)
abstracting: (2<=decision_s00002762_activated) states: 0
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[callToTask_s00002960_output_s00001077<=callToTask_s00002964_input_s00001052 & 2<=merge_s00002239_input_s00001128] | callToTask_s00002950_output_s00001077<=callToTask_s00002964_output_s00001077] | ~ [[2<=merge_s00001160_input_s00001068 & callToProcess_s00002121_output_s00001054<=callToTask_s00002956_input_s00001066]]]]
normalized: ~ [E [true U ~ [[[callToTask_s00002950_output_s00001077<=callToTask_s00002964_output_s00001077 | [callToTask_s00002960_output_s00001077<=callToTask_s00002964_input_s00001052 & 2<=merge_s00002239_input_s00001128]] | ~ [[2<=merge_s00001160_input_s00001068 & callToProcess_s00002121_output_s00001054<=callToTask_s00002956_input_s00001066]]]]]]

abstracting: (callToProcess_s00002121_output_s00001054<=callToTask_s00002956_input_s00001066) states: 2,479 (3)
abstracting: (2<=merge_s00001160_input_s00001068) states: 0
abstracting: (2<=merge_s00002239_input_s00001128) states: 0
abstracting: (callToTask_s00002960_output_s00001077<=callToTask_s00002964_input_s00001052) states: 2,480 (3)
abstracting: (callToTask_s00002950_output_s00001077<=callToTask_s00002964_output_s00001077) states: 2,479 (3)
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [2<=callToProcess_s00002944_output_s00001054]]
normalized: ~ [E [true U 2<=callToProcess_s00002944_output_s00001054]]

abstracting: (2<=callToProcess_s00002944_output_s00001054) states: 0
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [[[3<=callToTask_s00002962_input_s00001066 | callToTask_s00001406_output_s00001054<=merge_s00001162_input_s00001052] | ~ [1<=callToTask_s00001168_input_s00001052]]]]
normalized: E [true U ~ [[[3<=callToTask_s00002962_input_s00001066 | callToTask_s00001406_output_s00001054<=merge_s00001162_input_s00001052] | ~ [1<=callToTask_s00001168_input_s00001052]]]]

abstracting: (1<=callToTask_s00001168_input_s00001052) states: 45
abstracting: (callToTask_s00001406_output_s00001054<=merge_s00001162_input_s00001052) states: 2,437 (3)
abstracting: (3<=callToTask_s00002962_input_s00001066) states: 0
-> the formula is FALSE

FORMULA IBM319-PT-none-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [decision_s00002761_activated<=merge_s00002238_input_s00001068]
normalized: ~ [E [true U ~ [decision_s00002761_activated<=merge_s00002238_input_s00001068]]]

abstracting: (decision_s00002761_activated<=merge_s00002238_input_s00001068) states: 2,479 (3)
-> the formula is FALSE

FORMULA IBM319-PT-none-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [1<=callToTask_s00002951_inputCriterion_s00001053_used]
normalized: E [true U 1<=callToTask_s00002951_inputCriterion_s00001053_used]

abstracting: (1<=callToTask_s00002951_inputCriterion_s00001053_used) states: 3
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [~ [~ [3<=callToTask_s00002964_input_s00001066]]]]
normalized: ~ [E [true U 3<=callToTask_s00002964_input_s00001066]]

abstracting: (3<=callToTask_s00002964_input_s00001066) states: 0
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[callToTask_s00001168_input_s00001066<=callToTask_s00002044_inputCriterion_s00001053_used & merge_s00002240_input_s00001066<=callToProcess_s00002038_inputCriterion_s00001053_used] & [2<=callToTask_s00002966_output_s00001077 | 3<=join_s00001164_input_s00001127]] | [2<=merge_s00001161_activated | [2<=merge_s00002238_activated | 2<=merge_s00002240_input_s00001127]]]]
normalized: E [true U [[[callToTask_s00001168_input_s00001066<=callToTask_s00002044_inputCriterion_s00001053_used & merge_s00002240_input_s00001066<=callToProcess_s00002038_inputCriterion_s00001053_used] & [2<=callToTask_s00002966_output_s00001077 | 3<=join_s00001164_input_s00001127]] | [2<=merge_s00001161_activated | [2<=merge_s00002238_activated | 2<=merge_s00002240_input_s00001127]]]]

abstracting: (2<=merge_s00002240_input_s00001127) states: 0
abstracting: (2<=merge_s00002238_activated) states: 0
abstracting: (2<=merge_s00001161_activated) states: 0
abstracting: (3<=join_s00001164_input_s00001127) states: 0
abstracting: (2<=callToTask_s00002966_output_s00001077) states: 0
abstracting: (merge_s00002240_input_s00001066<=callToProcess_s00002038_inputCriterion_s00001053_used) states: 2,437 (3)
abstracting: (callToTask_s00001168_input_s00001066<=callToTask_s00002044_inputCriterion_s00001053_used) states: 2,440 (3)
-> the formula is FALSE

FORMULA IBM319-PT-none-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[merge_s00002240_input_s00001066<=callToTask_s00002667_inputCriterion_s00001053_used | 1<=callToTask_s00002063_input_s00001052] & 3<=merge_s00002238_activated] | [~ [callToTask_s00002959_output_s00001054<=callToTask_s00001406_output_s00001077] & ~ [3<=callToProcess_s00001108_output_s00001054]]]]
normalized: E [true U [[3<=merge_s00002238_activated & [merge_s00002240_input_s00001066<=callToTask_s00002667_inputCriterion_s00001053_used | 1<=callToTask_s00002063_input_s00001052]] | [~ [3<=callToProcess_s00001108_output_s00001054] & ~ [callToTask_s00002959_output_s00001054<=callToTask_s00001406_output_s00001077]]]]

abstracting: (callToTask_s00002959_output_s00001054<=callToTask_s00001406_output_s00001077) states: 2,479 (3)
abstracting: (3<=callToProcess_s00001108_output_s00001054) states: 0
abstracting: (1<=callToTask_s00002063_input_s00001052) states: 3
abstracting: (merge_s00002240_input_s00001066<=callToTask_s00002667_inputCriterion_s00001053_used) states: 2,437 (3)
abstracting: (3<=merge_s00002238_activated) states: 0
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[2<=callToTask_s00002950_output_s00001054 & [3<=decision_s00002948_activated | 2<=callToTask_s00002869_input_s00001052]] & [[decision_s00001159_activated<=merge_s00002241_input_s00001127 | callToTask_s00002870_inputCriterion_s00001053_used<=callToTask_s00001168_input_s00001127] & ~ [callToTask_s00002954_input_s00001066<=callToProcess_s00001108_output_s00001054]]]]
normalized: E [true U [[~ [callToTask_s00002954_input_s00001066<=callToProcess_s00001108_output_s00001054] & [decision_s00001159_activated<=merge_s00002241_input_s00001127 | callToTask_s00002870_inputCriterion_s00001053_used<=callToTask_s00001168_input_s00001127]] & [2<=callToTask_s00002950_output_s00001054 & [3<=decision_s00002948_activated | 2<=callToTask_s00002869_input_s00001052]]]]

abstracting: (2<=callToTask_s00002869_input_s00001052) states: 0
abstracting: (3<=decision_s00002948_activated) states: 0
abstracting: (2<=callToTask_s00002950_output_s00001054) states: 0
abstracting: (callToTask_s00002870_inputCriterion_s00001053_used<=callToTask_s00001168_input_s00001127) states: 2,479 (3)
abstracting: (decision_s00001159_activated<=merge_s00002241_input_s00001127) states: 2,437 (3)
abstracting: (callToTask_s00002954_input_s00001066<=callToProcess_s00001108_output_s00001054) states: 2,479 (3)
-> the formula is FALSE

FORMULA IBM319-PT-none-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[~ [callToProcess_s00001108_output_s00001054<=callToTask_s00002954_output_s00001077] & callToTask_s00002962_inputCriterion_s00001053_used<=callToProcess_s00002944_output_s00001077] & [[1<=process_s00000343__s00003019_output_s00001249 & merge_s00001162_input_s00001068<=callToTask_s00002950_output_s00001054] & ~ [3<=callToTask_s00002957_output_s00001054]]]]
normalized: E [true U [[~ [3<=callToTask_s00002957_output_s00001054] & [1<=process_s00000343__s00003019_output_s00001249 & merge_s00001162_input_s00001068<=callToTask_s00002950_output_s00001054]] & [callToTask_s00002962_inputCriterion_s00001053_used<=callToProcess_s00002944_output_s00001077 & ~ [callToProcess_s00001108_output_s00001054<=callToTask_s00002954_output_s00001077]]]]

abstracting: (callToProcess_s00001108_output_s00001054<=callToTask_s00002954_output_s00001077) states: 2,482 (3)
abstracting: (callToTask_s00002962_inputCriterion_s00001053_used<=callToProcess_s00002944_output_s00001077) states: 2,479 (3)
abstracting: (merge_s00001162_input_s00001068<=callToTask_s00002950_output_s00001054) states: 2,332 (3)
abstracting: (1<=process_s00000343__s00003019_output_s00001249) states: 3
abstracting: (3<=callToTask_s00002957_output_s00001054) states: 0
-> the formula is FALSE

FORMULA IBM319-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[1<=callToProcess_s00002499_input_s00001066 & 3<=decision_s00001159_activated] & ~ [2<=callToProcess_s00002882_output_s00001077]] | [2<=fork_s00001298_activated_s00001073 | ~ [2<=join_s00001163_activated_s00001064]]]]
normalized: ~ [E [true U ~ [[[2<=fork_s00001298_activated_s00001073 | ~ [2<=join_s00001163_activated_s00001064]] | [~ [2<=callToProcess_s00002882_output_s00001077] & [1<=callToProcess_s00002499_input_s00001066 & 3<=decision_s00001159_activated]]]]]]

abstracting: (3<=decision_s00001159_activated) states: 0
abstracting: (1<=callToProcess_s00002499_input_s00001066) states: 3
abstracting: (2<=callToProcess_s00002882_output_s00001077) states: 0
abstracting: (2<=join_s00001163_activated_s00001064) states: 0
abstracting: (2<=fork_s00001298_activated_s00001073) states: 0
-> the formula is TRUE

FORMULA IBM319-PT-none-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m5sec


BK_STOP 1433633161555

--------------------
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:981 (5), effective:161 (0)

initing FirstDep: 0m0sec


iterations count:454 (2), effective:83 (0)

iterations count:466 (2), effective:83 (0)

iterations count:590 (3), effective:117 (0)

iterations count:472 (2), effective:86 (0)

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="IBM319-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
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/IBM319-PT-none.tgz
mv IBM319-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 IBM319-PT-none, 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 r232su-smll-143354324700048"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 '' ReachabilityCardinality.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 ;