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

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

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=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: IBM319_PT_none
(NrP: 253 NrTr: 178 NrArc: 526)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.005sec

net check time: 0m 0.000sec

init dd package: 0m 1.043sec


RS generation: 0m 0.003sec


-> reachability set: #nodes 401 (4.0e+02) #states 2,482 (3)



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

checking: EF [3<=callToTask_s00002869_output_s00001077]
normalized: E [true U 3<=callToTask_s00002869_output_s00001077]

abstracting: (3<=callToTask_s00002869_output_s00001077)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [3<=callToTask_s00001406_input_s00001066]
normalized: E [true U 3<=callToTask_s00001406_input_s00001066]

abstracting: (3<=callToTask_s00001406_input_s00001066)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [3<=callToTask_s00002956_input_s00001066]
normalized: E [true U 3<=callToTask_s00002956_input_s00001066]

abstracting: (3<=callToTask_s00002956_input_s00001066)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: EF [~ [~ [[1<=callToTask_s00002954_output_s00001077 | 2<=callToTask_s00002932_output_s00001077]]]]
normalized: E [true U [1<=callToTask_s00002954_output_s00001077 | 2<=callToTask_s00002932_output_s00001077]]

abstracting: (2<=callToTask_s00002932_output_s00001077)
states: 0
abstracting: (1<=callToTask_s00002954_output_s00001077)
states: 3
-> the formula is TRUE

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

MC time: 0m 0.015sec

checking: EF [~ [~ [[3<=callToTask_s00002958_inputCriterion_s00001053_used | 1<=merge_s00001160_input_s00001129]]]]
normalized: E [true U [3<=callToTask_s00002958_inputCriterion_s00001053_used | 1<=merge_s00001160_input_s00001129]]

abstracting: (1<=merge_s00001160_input_s00001129)
states: 3
abstracting: (3<=callToTask_s00002958_inputCriterion_s00001053_used)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.018sec

checking: AG [decision_s00001123_input_s00001052<=join_s00001163_activated_s00001065]
normalized: ~ [E [true U ~ [decision_s00001123_input_s00001052<=join_s00001163_activated_s00001065]]]

abstracting: (decision_s00001123_input_s00001052<=join_s00001163_activated_s00001065)
states: 2,437 (3)
-> the formula is FALSE

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

MC time: 0m 0.008sec

checking: AG [callToProcess_s00002038_inputCriterion_s00001053_used<=callToTask_s00002952_input_s00001066]
normalized: ~ [E [true U ~ [callToProcess_s00002038_inputCriterion_s00001053_used<=callToTask_s00002952_input_s00001066]]]

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

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

MC time: 0m 0.006sec

checking: EF [[[~ [callToProcess_s00002499_inputCriterion_s00001053_used<=decision_s00001123_activated] | ~ [2<=callToTask_s00002896_output_s00001077]] & 3<=callToProcess_s00002121_inputCriterion_s00001053_used]]
normalized: E [true U [[~ [2<=callToTask_s00002896_output_s00001077] | ~ [callToProcess_s00002499_inputCriterion_s00001053_used<=decision_s00001123_activated]] & 3<=callToProcess_s00002121_inputCriterion_s00001053_used]]

abstracting: (3<=callToProcess_s00002121_inputCriterion_s00001053_used)
states: 0
abstracting: (callToProcess_s00002499_inputCriterion_s00001053_used<=decision_s00001123_activated)
states: 2,479 (3)
abstracting: (2<=callToTask_s00002896_output_s00001077)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AG [[~ [[1<=callToTask_s00002962_output_s00001054 & 1<=process_s00000343__s00003019_output_s00001249]] & ~ [[3<=callToTask_s00002966_inputCriterion_s00001053_used & merge_s00001061_activated<=merge_s00001161_activated]]]]
normalized: ~ [E [true U ~ [[~ [[3<=callToTask_s00002966_inputCriterion_s00001053_used & merge_s00001061_activated<=merge_s00001161_activated]] & ~ [[1<=callToTask_s00002962_output_s00001054 & 1<=process_s00000343__s00003019_output_s00001249]]]]]]

abstracting: (1<=process_s00000343__s00003019_output_s00001249)
states: 3
abstracting: (1<=callToTask_s00002962_output_s00001054)
states: 3
abstracting: (merge_s00001061_activated<=merge_s00001161_activated)
states: 2,479 (3)
abstracting: (3<=callToTask_s00002966_inputCriterion_s00001053_used)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: EF [[2<=callToTask_s00002952_output_s00001054 & [3<=merge_s00002240_activated | [merge_s00002238_activated<=fork_s00001298_activated_s00001073 & join_s00001163_input_s00001066<=merge_s00002241_input_s00001127]]]]
normalized: E [true U [[[merge_s00002238_activated<=fork_s00001298_activated_s00001073 & join_s00001163_input_s00001066<=merge_s00002241_input_s00001127] | 3<=merge_s00002240_activated] & 2<=callToTask_s00002952_output_s00001054]]

abstracting: (2<=callToTask_s00002952_output_s00001054)
states: 0
abstracting: (3<=merge_s00002240_activated)
states: 0
abstracting: (join_s00001163_input_s00001066<=merge_s00002241_input_s00001127)
states: 2,332 (3)
abstracting: (merge_s00002238_activated<=fork_s00001298_activated_s00001073)
states: 2,479 (3)
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: AG [[[[callToTask_s00002956_output_s00001077<=endNode_s00001401_input_default & 1<=callToTask_s00002667_inputCriterion_s00001053_used] | ~ [3<=callToTask_s00002962_input_s00001066]] & decision_s00001123_input_s00001052<=callToTask_s00002958_output_s00001054]]
normalized: ~ [E [true U ~ [[[[callToTask_s00002956_output_s00001077<=endNode_s00001401_input_default & 1<=callToTask_s00002667_inputCriterion_s00001053_used] | ~ [3<=callToTask_s00002962_input_s00001066]] & decision_s00001123_input_s00001052<=callToTask_s00002958_output_s00001054]]]]

abstracting: (decision_s00001123_input_s00001052<=callToTask_s00002958_output_s00001054)
states: 2,437 (3)
abstracting: (3<=callToTask_s00002962_input_s00001066)
states: 0
abstracting: (1<=callToTask_s00002667_inputCriterion_s00001053_used)
states: 3
abstracting: (callToTask_s00002956_output_s00001077<=endNode_s00001401_input_default)
states: 2,479 (3)
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: AG [[[[2<=callToTask_s00002966_inputCriterion_s00001053_used | callToTask_s00002962_inputCriterion_s00001053_used<=callToTask_s00002960_inputCriterion_s00001053_used] & ~ [1<=merge_s00001160_activated]] & ~ [~ [callToTask_s00002963_input_s00001052<=decision_s00001123_input_s00001052]]]]
normalized: ~ [E [true U ~ [[[~ [1<=merge_s00001160_activated] & [2<=callToTask_s00002966_inputCriterion_s00001053_used | callToTask_s00002962_inputCriterion_s00001053_used<=callToTask_s00002960_inputCriterion_s00001053_used]] & callToTask_s00002963_input_s00001052<=decision_s00001123_input_s00001052]]]]

abstracting: (callToTask_s00002963_input_s00001052<=decision_s00001123_input_s00001052)
states: 2,479 (3)
abstracting: (callToTask_s00002962_inputCriterion_s00001053_used<=callToTask_s00002960_inputCriterion_s00001053_used)
states: 2,479 (3)
abstracting: (2<=callToTask_s00002966_inputCriterion_s00001053_used)
states: 0
abstracting: (1<=merge_s00001160_activated)
states: 3
-> the formula is FALSE

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

MC time: 0m 0.010sec

checking: AG [[[[callToTask_s00002966_input_s00001066<=callToTask_s00002962_output_s00001054 & alpha<=callToProcess_s00002943_output_s00001054] & [callToTask_s00002964_output_s00001077<=callToTask_s00002932_input_s00001052 & 1<=decision_s00001158_activated]] | ~ [3<=fork_s00001403_activated_s00001075]]]
normalized: ~ [E [true U ~ [[~ [3<=fork_s00001403_activated_s00001075] | [[callToTask_s00002964_output_s00001077<=callToTask_s00002932_input_s00001052 & 1<=decision_s00001158_activated] & [callToTask_s00002966_input_s00001066<=callToTask_s00002962_output_s00001054 & alpha<=callToProcess_s00002943_output_s00001054]]]]]]

abstracting: (alpha<=callToProcess_s00002943_output_s00001054)
states: 2,481 (3)
abstracting: (callToTask_s00002966_input_s00001066<=callToTask_s00002962_output_s00001054)
states: 2,479 (3)
abstracting: (1<=decision_s00001158_activated)
states: 45
abstracting: (callToTask_s00002964_output_s00001077<=callToTask_s00002932_input_s00001052)
states: 2,437 (3)
abstracting: (3<=fork_s00001403_activated_s00001075)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: EF [[~ [[3<=callToTask_s00002960_output_s00001077 | callToProcess_s00002038_inputCriterion_s00001053_used<=callToTask_s00002958_output_s00001077]] & [[1<=callToTask_s00002954_input_s00001066 | callToProcess_s00001108_inputCriterion_s00001053_used<=join_s00001164_activated_s00001062] & [1<=callToTask_s00002953_inputCriterion_s00001053_used | 3<=decision_s00003021_activated]]]]
normalized: E [true U [~ [[3<=callToTask_s00002960_output_s00001077 | callToProcess_s00002038_inputCriterion_s00001053_used<=callToTask_s00002958_output_s00001077]] & [[1<=callToTask_s00002954_input_s00001066 | callToProcess_s00001108_inputCriterion_s00001053_used<=join_s00001164_activated_s00001062] & [1<=callToTask_s00002953_inputCriterion_s00001053_used | 3<=decision_s00003021_activated]]]]

abstracting: (3<=decision_s00003021_activated)
states: 0
abstracting: (1<=callToTask_s00002953_inputCriterion_s00001053_used)
states: 3
abstracting: (callToProcess_s00001108_inputCriterion_s00001053_used<=join_s00001164_activated_s00001062)
states: 2,482 (3)
abstracting: (1<=callToTask_s00002954_input_s00001066)
states: 3
abstracting: (callToProcess_s00002038_inputCriterion_s00001053_used<=callToTask_s00002958_output_s00001077)
states: 2,479 (3)
abstracting: (3<=callToTask_s00002960_output_s00001077)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: AG [[[[callToTask_s00002966_output_s00001077<=callToTask_s00002960_output_s00001054 | 1<=decision_s00001841_activated] | 3<=fork_s00001298_activated_s00001075] | [[merge_s00002238_input_s00001068<=process_s00000343__s00003019_outputCriterion_s00001055_omega & 3<=callToTask_s00001168_input_s00001127] | [1<=callToTask_s00002896_output_s00001054 | 2<=decision_s00001841_input_s00001066]]]]
normalized: ~ [E [true U ~ [[[3<=fork_s00001298_activated_s00001075 | [callToTask_s00002966_output_s00001077<=callToTask_s00002960_output_s00001054 | 1<=decision_s00001841_activated]] | [[1<=callToTask_s00002896_output_s00001054 | 2<=decision_s00001841_input_s00001066] | [merge_s00002238_input_s00001068<=process_s00000343__s00003019_outputCriterion_s00001055_omega & 3<=callToTask_s00001168_input_s00001127]]]]]]

abstracting: (3<=callToTask_s00001168_input_s00001127)
states: 0
abstracting: (merge_s00002238_input_s00001068<=process_s00000343__s00003019_outputCriterion_s00001055_omega)
states: 2,479 (3)
abstracting: (2<=decision_s00001841_input_s00001066)
states: 0
abstracting: (1<=callToTask_s00002896_output_s00001054)
states: 3
abstracting: (1<=decision_s00001841_activated)
states: 150
abstracting: (callToTask_s00002966_output_s00001077<=callToTask_s00002960_output_s00001054)
states: 2,479 (3)
abstracting: (3<=fork_s00001298_activated_s00001075)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.011sec

totally nodes used: 51740(5.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 33789 78875 112664
used/not used/entry size/cache size: 61940 67046924 16 1024MB
basic ops cache: hits/miss/sum: 22385 170401 192786
used/not used/entry size/cache size: 306774 16470442 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 1437 1602 3039
used/not used/entry size/cache size: 1602 2095550 32 64MB
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 67057203
1 51582
2 79
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 1.664sec


BK_STOP 1494452210032

--------------------
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.000sec


iterations count:1019 (5), effective:161 (0)

initing FirstDep: 0m 0.000sec


iterations count:424 (2), effective:74 (0)

iterations count:593 (3), effective:126 (0)

iterations count:463 (2), effective:90 (0)

iterations count:432 (2), effective:75 (0)

iterations count:463 (2), effective:90 (0)

iterations count:611 (3), effective:133 (0)

iterations count:639 (3), effective:132 (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="/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/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-3254"
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 r031-blw7-149440473700070"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; 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 ;