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-2979
Executing tool marcie
Input is S_IBM319-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161kn-blw3-146416418000034
=====================================================================

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


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

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

net check time: 0m 0.000sec

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

init dd package: 0m 4.065sec


RS generation: 0m 0.070sec


-> reachability set: #nodes 1068 (1.1e+03) #states 2,482 (3)



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

checking: AG [~ [1<=callToTask_s00002961_output_s00001077]]
normalized: ~ [E [true U 1<=callToTask_s00002961_output_s00001077]]

abstracting: (1<=callToTask_s00002961_output_s00001077) states: 3
-> the formula is FALSE

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

MC time: 0m 0.068sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

abstracting: (2<=callToTask_s00002063_output_s00001054) 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 [2<=merge_s00002239_input_s00001128]
normalized: E [true U 2<=merge_s00002239_input_s00001128]

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: AG [join_s00001164_input_s00001052<=merge_s00001160_activated]
normalized: ~ [E [true U ~ [join_s00001164_input_s00001052<=merge_s00001160_activated]]]

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

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

MC time: 0m 0.065sec

checking: AG [callToProcess_s00002121_inputCriterion_s00001053_used<=callToTask_s00002966_input_s00001066]
normalized: ~ [E [true U ~ [callToProcess_s00002121_inputCriterion_s00001053_used<=callToTask_s00002966_input_s00001066]]]

abstracting: (callToProcess_s00002121_inputCriterion_s00001053_used<=callToTask_s00002966_input_s00001066) 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.034sec

checking: AG [[[3<=callToTask_s00002949_output_s00001077 & [2<=endNode_s00001057_input_default & 3<=callToTask_s00002953_output_s00001077]] | ~ [2<=merge_s00002239_input_s00001129]]]
normalized: ~ [E [true U ~ [[~ [2<=merge_s00002239_input_s00001129] | [3<=callToTask_s00002949_output_s00001077 & [2<=endNode_s00001057_input_default & 3<=callToTask_s00002953_output_s00001077]]]]]]

abstracting: (3<=callToTask_s00002953_output_s00001077) states: 0
abstracting: (2<=endNode_s00001057_input_default) states: 0
abstracting: (3<=callToTask_s00002949_output_s00001077) states: 0
abstracting: (2<=merge_s00002239_input_s00001129) states: 0
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: AG [~ [~ [[fork_s00001071_activated_s00001073<=callToTask_s00002960_inputCriterion_s00001053_used | merge_s00002239_input_s00001066<=decision_s00001126_input_s00001066]]]]
normalized: ~ [E [true U ~ [[fork_s00001071_activated_s00001073<=callToTask_s00002960_inputCriterion_s00001053_used | merge_s00002239_input_s00001066<=decision_s00001126_input_s00001066]]]]

abstracting: (merge_s00002239_input_s00001066<=decision_s00001126_input_s00001066) states: 2,479 (3)
abstracting: (fork_s00001071_activated_s00001073<=callToTask_s00002960_inputCriterion_s00001053_used) states: 2,437 (3)
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: EF [~ [[[decision_s00001126_input_s00001066<=fork_s00001071_activated_s00001073 | 2<=callToTask_s00001406_input_s00001052] & [3<=callToTask_s00001168_input_s00001127 | decision_s00001840_activated<=merge_s00002239_activated]]]]
normalized: E [true U ~ [[[3<=callToTask_s00001168_input_s00001127 | decision_s00001840_activated<=merge_s00002239_activated] & [decision_s00001126_input_s00001066<=fork_s00001071_activated_s00001073 | 2<=callToTask_s00001406_input_s00001052]]]]

abstracting: (2<=callToTask_s00001406_input_s00001052) states: 0
abstracting: (decision_s00001126_input_s00001066<=fork_s00001071_activated_s00001073) states: 2,440 (3)
abstracting: (decision_s00001840_activated<=merge_s00002239_activated) states: 2,479 (3)
abstracting: (3<=callToTask_s00001168_input_s00001127) states: 0
-> the formula is TRUE

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

MC time: 0m 0.058sec

checking: EF [[[[2<=callToTask_s00002954_input_s00001066 & 2<=callToTask_s00002949_output_s00001077] & ~ [3<=process_s00000343__s00003019_output_s00001249]] | [[callToProcess_s00002944_inputCriterion_s00001053_used<=callToTask_s00001406_input_s00001066 | 1<=callToTask_s00002952_input_s00001052] & 2<=callToTask_s00002869_inputCriterion_s00001053_used]]]
normalized: E [true U [[2<=callToTask_s00002869_inputCriterion_s00001053_used & [callToProcess_s00002944_inputCriterion_s00001053_used<=callToTask_s00001406_input_s00001066 | 1<=callToTask_s00002952_input_s00001052]] | [[2<=callToTask_s00002954_input_s00001066 & 2<=callToTask_s00002949_output_s00001077] & ~ [3<=process_s00000343__s00003019_output_s00001249]]]]

abstracting: (3<=process_s00000343__s00003019_output_s00001249) states: 0
abstracting: (2<=callToTask_s00002949_output_s00001077) states: 0
abstracting: (2<=callToTask_s00002954_input_s00001066) states: 0
abstracting: (1<=callToTask_s00002952_input_s00001052) states: 3
abstracting: (callToProcess_s00002944_inputCriterion_s00001053_used<=callToTask_s00001406_input_s00001066) states: 2,480 (3)
abstracting: (2<=callToTask_s00002869_inputCriterion_s00001053_used) 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.005sec

checking: AG [[[~ [1<=decision_s00001840_activated] | [callToProcess_s00001108_input_s00001052<=callToTask_s00002964_output_s00001054 | merge_s00001161_activated<=callToTask_s00002667_output_s00001054]] | callToTask_s00002870_output_s00001077<=callToTask_s00001406_input_s00001052]]
normalized: ~ [E [true U ~ [[callToTask_s00002870_output_s00001077<=callToTask_s00001406_input_s00001052 | [[callToProcess_s00001108_input_s00001052<=callToTask_s00002964_output_s00001054 | merge_s00001161_activated<=callToTask_s00002667_output_s00001054] | ~ [1<=decision_s00001840_activated]]]]]]

abstracting: (1<=decision_s00001840_activated) states: 3
abstracting: (merge_s00001161_activated<=callToTask_s00002667_output_s00001054) states: 2,332 (3)
abstracting: (callToProcess_s00001108_input_s00001052<=callToTask_s00002964_output_s00001054) states: 2,482 (3)
abstracting: (callToTask_s00002870_output_s00001077<=callToTask_s00001406_input_s00001052) states: 2,479 (3)
-> the formula is TRUE

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

MC time: 0m 0.006sec

checking: AG [[~ [[1<=merge_s00002241_input_s00001066 | join_s00001163_input_s00001066<=callToTask_s00001852_output_s00001054]] | [decision_s00003022_activated<=callToTask_s00001852_output_s00001077 | [callToTask_s00002667_inputCriterion_s00001053_used<=callToTask_s00002966_output_s00001054 | callToTask_s00002965_inputCriterion_s00001053_used<=callToTask_s00002959_output_s00001054]]]]
normalized: ~ [E [true U ~ [[[decision_s00003022_activated<=callToTask_s00001852_output_s00001077 | [callToTask_s00002667_inputCriterion_s00001053_used<=callToTask_s00002966_output_s00001054 | callToTask_s00002965_inputCriterion_s00001053_used<=callToTask_s00002959_output_s00001054]] | ~ [[1<=merge_s00002241_input_s00001066 | join_s00001163_input_s00001066<=callToTask_s00001852_output_s00001054]]]]]]

abstracting: (join_s00001163_input_s00001066<=callToTask_s00001852_output_s00001054) states: 2,332 (3)
abstracting: (1<=merge_s00002241_input_s00001066) states: 45
abstracting: (callToTask_s00002965_inputCriterion_s00001053_used<=callToTask_s00002959_output_s00001054) states: 2,479 (3)
abstracting: (callToTask_s00002667_inputCriterion_s00001053_used<=callToTask_s00002966_output_s00001054) states: 2,479 (3)
abstracting: (decision_s00003022_activated<=callToTask_s00001852_output_s00001077) states: 2,482 (3)
-> the formula is TRUE

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

MC time: 0m 0.011sec

checking: AG [[[[callToTask_s00002964_input_s00001052<=alpha | callToTask_s00002954_inputCriterion_s00001053_used<=callToTask_s00002959_input_s00001052] | [callToTask_s00002952_output_s00001077<=callToTask_s00001168_inputCriterion_s00001053_used & callToTask_s00002965_input_s00001052<=callToTask_s00002929_output_s00001077]] & callToTask_s00002952_output_s00001054<=merge_s00002239_input_s00001068]]
normalized: ~ [E [true U ~ [[callToTask_s00002952_output_s00001054<=merge_s00002239_input_s00001068 & [[callToTask_s00002952_output_s00001077<=callToTask_s00001168_inputCriterion_s00001053_used & callToTask_s00002965_input_s00001052<=callToTask_s00002929_output_s00001077] | [callToTask_s00002964_input_s00001052<=alpha | callToTask_s00002954_inputCriterion_s00001053_used<=callToTask_s00002959_input_s00001052]]]]]]

abstracting: (callToTask_s00002954_inputCriterion_s00001053_used<=callToTask_s00002959_input_s00001052) states: 2,479 (3)
abstracting: (callToTask_s00002964_input_s00001052<=alpha) states: 2,437 (3)
abstracting: (callToTask_s00002965_input_s00001052<=callToTask_s00002929_output_s00001077) states: 2,479 (3)
abstracting: (callToTask_s00002952_output_s00001077<=callToTask_s00001168_inputCriterion_s00001053_used) states: 2,479 (3)
abstracting: (callToTask_s00002952_output_s00001054<=merge_s00002239_input_s00001068) 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.053sec

checking: AG [[[[3<=callToTask_s00002963_output_s00001054 & callToProcess_s00002499_input_s00001052<=callToTask_s00002254_output_s00001054] & [1<=merge_s00002238_input_s00001068 & 3<=decision_s00001123_input_s00001066]] | [callToTask_s00002957_input_s00001052<=join_s00001164_input_s00001127 & [decision_s00001126_input_s00001052<=decision_s00001840_activated & merge_s00002239_activated<=callToTask_s00002962_input_s00001066]]]]
normalized: ~ [E [true U ~ [[[[1<=merge_s00002238_input_s00001068 & 3<=decision_s00001123_input_s00001066] & [3<=callToTask_s00002963_output_s00001054 & callToProcess_s00002499_input_s00001052<=callToTask_s00002254_output_s00001054]] | [callToTask_s00002957_input_s00001052<=join_s00001164_input_s00001127 & [decision_s00001126_input_s00001052<=decision_s00001840_activated & merge_s00002239_activated<=callToTask_s00002962_input_s00001066]]]]]]

abstracting: (merge_s00002239_activated<=callToTask_s00002962_input_s00001066) states: 2,479 (3)
abstracting: (decision_s00001126_input_s00001052<=decision_s00001840_activated) states: 2,437 (3)
abstracting: (callToTask_s00002957_input_s00001052<=join_s00001164_input_s00001127) states: 2,479 (3)
abstracting: (callToProcess_s00002499_input_s00001052<=callToTask_s00002254_output_s00001054) states: 2,479 (3)
abstracting: (3<=callToTask_s00002963_output_s00001054) states: 0
abstracting: (3<=decision_s00001123_input_s00001066) states: 0
abstracting: (1<=merge_s00002238_input_s00001068) states: 3
-> the formula is FALSE

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

MC time: 0m 0.052sec


Total processing time: 0m 5.995sec


BK_STOP 1464330445225

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

check for maximal unmarked siphon
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

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

initing FirstDep: 0m 0.000sec


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

iterations count:501 (2), effective:101 (0)

iterations count:445 (2), effective:81 (0)

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

iterations count:589 (3), effective:124 (0)

iterations count:450 (2), effective:88 (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="S_IBM319-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/hulinhub/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/S_IBM319-PT-none.tgz
mv S_IBM319-PT-none execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is S_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 r161kn-blw3-146416418000034"
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 ;