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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324700074
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433633355660

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=ReachabilityCardinality.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: 0m4sec


RS generation: 0m0sec


-> reachability set: #nodes 773 (7.7e+02) #states 8,370 (3)



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

checking: EF [[~ [[3<=task_s00000754_input_s00000263 | fork_s00000464_activated_s00000272<=merge_s00000457_input_s00000285]] & ~ [decision_s00000803_activated<=decision_s00000796_input_s00000263]]]
normalized: E [true U [~ [decision_s00000803_activated<=decision_s00000796_input_s00000263] & ~ [[3<=task_s00000754_input_s00000263 | fork_s00000464_activated_s00000272<=merge_s00000457_input_s00000285]]]]

abstracting: (fork_s00000464_activated_s00000272<=merge_s00000457_input_s00000285) states: 8,310 (3)
abstracting: (3<=task_s00000754_input_s00000263) states: 0
abstracting: (decision_s00000803_activated<=decision_s00000796_input_s00000263) states: 8,365 (3)
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: EF [[[[1<=task_s00000756_output_s00000264 & 2<=task_s00000708_inputCriterion_s00000257_used] & ~ [2<=task_s00000756_inputCriterion_s00000257_used]] & [1<=callToProcess_s00000807_input_s00000263 | [task_s00000742_inputCriterion_s00000257_used<=task_s00000706_input_s00000263 | task_s00000745_inputCriterion_s00000257_used<=task_s00000722_output_s00000264]]]]
normalized: E [true U [[~ [2<=task_s00000756_inputCriterion_s00000257_used] & [1<=task_s00000756_output_s00000264 & 2<=task_s00000708_inputCriterion_s00000257_used]] & [1<=callToProcess_s00000807_input_s00000263 | [task_s00000742_inputCriterion_s00000257_used<=task_s00000706_input_s00000263 | task_s00000745_inputCriterion_s00000257_used<=task_s00000722_output_s00000264]]]]

abstracting: (task_s00000745_inputCriterion_s00000257_used<=task_s00000722_output_s00000264) states: 8,345 (3)
abstracting: (task_s00000742_inputCriterion_s00000257_used<=task_s00000706_input_s00000263) states: 8,225 (3)
abstracting: (1<=callToProcess_s00000807_input_s00000263) states: 145
abstracting: (2<=task_s00000708_inputCriterion_s00000257_used) states: 0
abstracting: (1<=task_s00000756_output_s00000264) states: 145
abstracting: (2<=task_s00000756_inputCriterion_s00000257_used) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[~ [task_s00000746_output_s00000264<=decision_s00000804_activated] & 3<=task_s00000731_inputCriterion_s00000257_used]]
normalized: E [true U [3<=task_s00000731_inputCriterion_s00000257_used & ~ [task_s00000746_output_s00000264<=decision_s00000804_activated]]]

abstracting: (task_s00000746_output_s00000264<=decision_s00000804_activated) states: 8,245 (3)
abstracting: (3<=task_s00000731_inputCriterion_s00000257_used) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[[[1<=task_s00000735_output_s00000264 | task_s00000753_output_s00000264<=task_s00000752_inputCriterion_s00000257_used] & 2<=callToProcess_s00000807_input_s00000263] & task_s00000707_inputCriterion_s00000257_used<=task_s00000709_output_s00000264]]
normalized: E [true U [task_s00000707_inputCriterion_s00000257_used<=task_s00000709_output_s00000264 & [2<=callToProcess_s00000807_input_s00000263 & [1<=task_s00000735_output_s00000264 | task_s00000753_output_s00000264<=task_s00000752_inputCriterion_s00000257_used]]]]

abstracting: (task_s00000753_output_s00000264<=task_s00000752_inputCriterion_s00000257_used) states: 8,369 (3)
abstracting: (1<=task_s00000735_output_s00000264) states: 270
abstracting: (2<=callToProcess_s00000807_input_s00000263) states: 0
abstracting: (task_s00000707_inputCriterion_s00000257_used<=task_s00000709_output_s00000264) states: 8,365 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[merge_s00000451_input_s00000285<=merge_s00000451_input_s00000285 | [[merge_s00000446_activated<=decision_s00000774_activated | task_s00000736_inputCriterion_s00000257_used<=task_s00000731_inputCriterion_s00000257_used] & decision_s00000792_activated<=task_s00000714_input_s00000263]]]
normalized: ~ [E [true U ~ [[merge_s00000451_input_s00000285<=merge_s00000451_input_s00000285 | [decision_s00000792_activated<=task_s00000714_input_s00000263 & [merge_s00000446_activated<=decision_s00000774_activated | task_s00000736_inputCriterion_s00000257_used<=task_s00000731_inputCriterion_s00000257_used]]]]]]

abstracting: (task_s00000736_inputCriterion_s00000257_used<=task_s00000731_inputCriterion_s00000257_used) states: 8,100 (3)
abstracting: (merge_s00000446_activated<=decision_s00000774_activated) states: 8,245 (3)
abstracting: (decision_s00000792_activated<=task_s00000714_input_s00000263) states: 8,365 (3)
abstracting: (merge_s00000451_input_s00000285<=merge_s00000451_input_s00000285) states: 8,370 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [~ [[~ [task_s00000743_output_s00000264<=decision_s00000796_activated] & [3<=task_s00000725_inputCriterion_s00000257_used | 2<=fork_s00000464_activated_s00000274]]]]
normalized: ~ [E [true U [~ [task_s00000743_output_s00000264<=decision_s00000796_activated] & [3<=task_s00000725_inputCriterion_s00000257_used | 2<=fork_s00000464_activated_s00000274]]]]

abstracting: (2<=fork_s00000464_activated_s00000274) states: 0
abstracting: (3<=task_s00000725_inputCriterion_s00000257_used) states: 0
abstracting: (task_s00000743_output_s00000264<=decision_s00000796_activated) states: 8,225 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[[[task_s00000708_output_s00000264<=task_s00000723_output_s00000264 & decision_s00000802_activated<=decision_s00000805_activated] & merge_s00000450_activated<=merge_s00000451_activated] & 2<=task_s00000717_inputCriterion_s00000257_used]]
normalized: E [true U [2<=task_s00000717_inputCriterion_s00000257_used & [merge_s00000450_activated<=merge_s00000451_activated & [task_s00000708_output_s00000264<=task_s00000723_output_s00000264 & decision_s00000802_activated<=decision_s00000805_activated]]]]

abstracting: (decision_s00000802_activated<=decision_s00000805_activated) states: 8,365 (3)
abstracting: (task_s00000708_output_s00000264<=task_s00000723_output_s00000264) states: 8,369 (3)
abstracting: (merge_s00000450_activated<=merge_s00000451_activated) states: 8,225 (3)
abstracting: (2<=task_s00000717_inputCriterion_s00000257_used) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: EF [[1<=decision_s00000764_activated & [~ [fork_s00000463_activated_s00000274<=task_s00000712_output_s00000264] | ~ [task_s00000711_output_s00000264<=merge_s00000462_input_s00000285]]]]
normalized: E [true U [1<=decision_s00000764_activated & [~ [task_s00000711_output_s00000264<=merge_s00000462_input_s00000285] | ~ [fork_s00000463_activated_s00000274<=task_s00000712_output_s00000264]]]]

abstracting: (fork_s00000463_activated_s00000274<=task_s00000712_output_s00000264) states: 8,366 (3)
abstracting: (task_s00000711_output_s00000264<=merge_s00000462_input_s00000285) states: 8,369 (3)
abstracting: (1<=decision_s00000764_activated) states: 5
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[[[3<=merge_s00000457_activated & 1<=task_s00000751_output_s00000264] | task_s00000741_output_s00000264<=decision_s00000764_input_s00000263] & 3<=task_s00000722_inputCriterion_s00000257_used]]
normalized: E [true U [3<=task_s00000722_inputCriterion_s00000257_used & [task_s00000741_output_s00000264<=decision_s00000764_input_s00000263 | [3<=merge_s00000457_activated & 1<=task_s00000751_output_s00000264]]]]

abstracting: (1<=task_s00000751_output_s00000264) states: 270
abstracting: (3<=merge_s00000457_activated) states: 0
abstracting: (task_s00000741_output_s00000264<=decision_s00000764_input_s00000263) states: 8,245 (3)
abstracting: (3<=task_s00000722_inputCriterion_s00000257_used) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [[[[task_s00000711_output_s00000264<=task_s00000754_input_s00000263 | task_s00000722_inputCriterion_s00000257_used<=task_s00000705_inputCriterion_s00000257_used] & [3<=callToProcess_s00000807_input_s00000263 & 2<=task_s00000708_inputCriterion_s00000257_used]] | [task_s00000721_output_s00000264<=decision_s00000802_activated | [decision_s00000787_activated<=decision_s00000775_activated | 2<=task_s00000722_inputCriterion_s00000257_used]]]]
normalized: ~ [E [true U ~ [[[task_s00000721_output_s00000264<=decision_s00000802_activated | [decision_s00000787_activated<=decision_s00000775_activated | 2<=task_s00000722_inputCriterion_s00000257_used]] | [[3<=callToProcess_s00000807_input_s00000263 & 2<=task_s00000708_inputCriterion_s00000257_used] & [task_s00000711_output_s00000264<=task_s00000754_input_s00000263 | task_s00000722_inputCriterion_s00000257_used<=task_s00000705_inputCriterion_s00000257_used]]]]]]

abstracting: (task_s00000722_inputCriterion_s00000257_used<=task_s00000705_inputCriterion_s00000257_used) states: 8,365 (3)
abstracting: (task_s00000711_output_s00000264<=task_s00000754_input_s00000263) states: 8,369 (3)
abstracting: (2<=task_s00000708_inputCriterion_s00000257_used) states: 0
abstracting: (3<=callToProcess_s00000807_input_s00000263) states: 0
abstracting: (2<=task_s00000722_inputCriterion_s00000257_used) states: 0
abstracting: (decision_s00000787_activated<=decision_s00000775_activated) states: 8,365 (3)
abstracting: (task_s00000721_output_s00000264<=decision_s00000802_activated) states: 8,225 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[task_s00000741_input_s00000263<=task_s00000725_input_s00000263 | task_s00000731_inputCriterion_s00000257_used<=task_s00000735_inputCriterion_s00000257_used]]
normalized: ~ [E [true U ~ [[task_s00000741_input_s00000263<=task_s00000725_input_s00000263 | task_s00000731_inputCriterion_s00000257_used<=task_s00000735_inputCriterion_s00000257_used]]]]

abstracting: (task_s00000731_inputCriterion_s00000257_used<=task_s00000735_inputCriterion_s00000257_used) states: 8,365 (3)
abstracting: (task_s00000741_input_s00000263<=task_s00000725_input_s00000263) states: 8,245 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[[[1<=task_s00000754_inputCriterion_s00000257_used | 1<=task_s00000723_output_s00000264] & ~ [merge_s00000452_activated<=task_s00000722_inputCriterion_s00000257_used]] | [[2<=callToProcess_s00000807_input_s00000263 | task_s00000721_output_s00000264<=task_s00000706_inputCriterion_s00000257_used] | [task_s00000713_output_s00000264<=task_s00000747_output_s00000264 & task_s00000759_inputCriterion_s00000257_used<=merge_s00000446_input_s00000290]]]]
normalized: ~ [E [true U ~ [[[[task_s00000713_output_s00000264<=task_s00000747_output_s00000264 & task_s00000759_inputCriterion_s00000257_used<=merge_s00000446_input_s00000290] | [2<=callToProcess_s00000807_input_s00000263 | task_s00000721_output_s00000264<=task_s00000706_inputCriterion_s00000257_used]] | [~ [merge_s00000452_activated<=task_s00000722_inputCriterion_s00000257_used] & [1<=task_s00000754_inputCriterion_s00000257_used | 1<=task_s00000723_output_s00000264]]]]]]

abstracting: (1<=task_s00000723_output_s00000264) states: 5
abstracting: (1<=task_s00000754_inputCriterion_s00000257_used) states: 225
abstracting: (merge_s00000452_activated<=task_s00000722_inputCriterion_s00000257_used) states: 8,365 (3)
abstracting: (task_s00000721_output_s00000264<=task_s00000706_inputCriterion_s00000257_used) states: 8,225 (3)
abstracting: (2<=callToProcess_s00000807_input_s00000263) states: 0
abstracting: (task_s00000759_inputCriterion_s00000257_used<=merge_s00000446_input_s00000290) states: 8,365 (3)
abstracting: (task_s00000713_output_s00000264<=task_s00000747_output_s00000264) states: 6,756 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[~ [~ [task_s00000720_inputCriterion_s00000257_used<=task_s00000733_output_s00000264]] | task_s00000711_inputCriterion_s00000257_used<=decision_s00000796_input_s00000263]]
normalized: ~ [E [true U ~ [[task_s00000720_inputCriterion_s00000257_used<=task_s00000733_output_s00000264 | task_s00000711_inputCriterion_s00000257_used<=decision_s00000796_input_s00000263]]]]

abstracting: (task_s00000711_inputCriterion_s00000257_used<=decision_s00000796_input_s00000263) states: 8,369 (3)
abstracting: (task_s00000720_inputCriterion_s00000257_used<=task_s00000733_output_s00000264) states: 8,365 (3)
-> the formula is TRUE

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

MC time: 0m0sec


Total processing time: 0m6sec


BK_STOP 1433633362708

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

683
iterations count:1393 (4), effective:186 (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="IBM703-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/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 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-143354324700074"
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 ;