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

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

=== Now, execution of the tool begins

BK_START 1433633291952

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=CTLCardinality.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: [~ [1<=task_s00000727_inputCriterion_s00000257_used] & [1<=task_s00000724_output_s00000264 | AF [[1<=task_s00000736_output_s00000264 & task_s00000710_input_s00000263<=task_s00000758_output_s00000264]]]]
normalized: [~ [1<=task_s00000727_inputCriterion_s00000257_used] & [1<=task_s00000724_output_s00000264 | ~ [EG [~ [[1<=task_s00000736_output_s00000264 & task_s00000710_input_s00000263<=task_s00000758_output_s00000264]]]]]]

abstracting: (task_s00000710_input_s00000263<=task_s00000758_output_s00000264) states: 8,369 (3)
abstracting: (1<=task_s00000736_output_s00000264) states: 270
...............................................................
EG iterations: 63
abstracting: (1<=task_s00000724_output_s00000264) states: 25
abstracting: (1<=task_s00000727_inputCriterion_s00000257_used) states: 25
-> the formula is FALSE

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

MC time: 0m1sec

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

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

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

MC time: 0m0sec

checking: AF [AG [~ [task_s00000761_input_s00000263<=merge_s00000458_input_s00000263]]]
normalized: ~ [EG [E [true U task_s00000761_input_s00000263<=merge_s00000458_input_s00000263]]]

abstracting: (task_s00000761_input_s00000263<=merge_s00000458_input_s00000263) states: 8,365 (3)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: ~ [EX [EF [2<=task_s00000739_output_s00000264]]]
normalized: ~ [EX [E [true U 2<=task_s00000739_output_s00000264]]]

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

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

MC time: 0m0sec

checking: [~ [AF [[2<=decision_s00000801_activated & 2<=task_s00000755_input_s00000263]]] | 2<=decision_s00000773_input_s00000263]
normalized: [2<=decision_s00000773_input_s00000263 | EG [~ [[2<=decision_s00000801_activated & 2<=task_s00000755_input_s00000263]]]]

abstracting: (2<=task_s00000755_input_s00000263) states: 0
abstracting: (2<=decision_s00000801_activated) states: 0

EG iterations: 0
abstracting: (2<=decision_s00000773_input_s00000263) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: [AX [[1<=decision_s00000774_activated & ~ [3<=decision_s00000775_input_s00000263]]] | AG [EF [merge_s00000449_activated<=task_s00000707_input_s00000263]]]
normalized: [~ [EX [~ [[1<=decision_s00000774_activated & ~ [3<=decision_s00000775_input_s00000263]]]]] | ~ [E [true U ~ [E [true U merge_s00000449_activated<=task_s00000707_input_s00000263]]]]]

abstracting: (merge_s00000449_activated<=task_s00000707_input_s00000263) states: 8,365 (3)
abstracting: (3<=decision_s00000775_input_s00000263) states: 0
abstracting: (1<=decision_s00000774_activated) states: 145
.-> the formula is TRUE

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

MC time: 0m0sec

checking: AF [AG [~ [task_s00000760_input_s00000263<=decision_s00000775_activated]]]
normalized: ~ [EG [E [true U task_s00000760_input_s00000263<=decision_s00000775_activated]]]

abstracting: (task_s00000760_input_s00000263<=decision_s00000775_activated) states: 8,365 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [EX [[task_s00000729_output_s00000264<=merge_s00000456_activated & task_s00000762_inputCriterion_s00000257_used<=task_s00000762_input_s00000263]]]
normalized: EG [EX [[task_s00000729_output_s00000264<=merge_s00000456_activated & task_s00000762_inputCriterion_s00000257_used<=task_s00000762_input_s00000263]]]

abstracting: (task_s00000762_inputCriterion_s00000257_used<=task_s00000762_input_s00000263) states: 8,345 (3)
abstracting: (task_s00000729_output_s00000264<=merge_s00000456_activated) states: 8,365 (3)
...
EG iterations: 2
-> the formula is TRUE

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

MC time: 0m0sec

checking: [~ [[EG [1<=task_s00000718_output_s00000264] | [[task_s00000755_inputCriterion_s00000257_used<=task_s00000743_inputCriterion_s00000257_used & task_s00000731_inputCriterion_s00000257_used<=decision_s00000784_input_s00000263] & 3<=task_s00000762_output_s00000264]]] & [AG [~ [3<=decision_s00000776_activated]] | ~ [EG [task_s00000719_input_s00000263<=merge_s00000449_activated]]]]
normalized: [[~ [E [true U 3<=decision_s00000776_activated]] | ~ [EG [task_s00000719_input_s00000263<=merge_s00000449_activated]]] & ~ [[[3<=task_s00000762_output_s00000264 & [task_s00000755_inputCriterion_s00000257_used<=task_s00000743_inputCriterion_s00000257_used & task_s00000731_inputCriterion_s00000257_used<=decision_s00000784_input_s00000263]] | EG [1<=task_s00000718_output_s00000264]]]]

abstracting: (1<=task_s00000718_output_s00000264) states: 5
.....
EG iterations: 5
abstracting: (task_s00000731_inputCriterion_s00000257_used<=decision_s00000784_input_s00000263) states: 8,365 (3)
abstracting: (task_s00000755_inputCriterion_s00000257_used<=task_s00000743_inputCriterion_s00000257_used) states: 8,225 (3)
abstracting: (3<=task_s00000762_output_s00000264) states: 0
abstracting: (task_s00000719_input_s00000263<=merge_s00000449_activated) states: 8,365 (3)
............
EG iterations: 12
abstracting: (3<=decision_s00000776_activated) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: [[AX [[1<=merge_s00000453_input_s00000290 & 2<=fork_s00000465_input_s00000263]] | [[[1<=task_s00000740_input_s00000263 & 1<=task_s00000732_output_s00000264] | [3<=task_s00000752_output_s00000264 | 3<=task_s00000707_output_s00000264]] & AX [2<=task_s00000756_inputCriterion_s00000257_used]]] | ~ [EG [[3<=fork_s00000464_activated_s00000274 | decision_s00000788_activated<=stopNode_s00000597_input_default]]]]
normalized: [[~ [EX [~ [[1<=merge_s00000453_input_s00000290 & 2<=fork_s00000465_input_s00000263]]]] | [~ [EX [~ [2<=task_s00000756_inputCriterion_s00000257_used]]] & [[1<=task_s00000740_input_s00000263 & 1<=task_s00000732_output_s00000264] | [3<=task_s00000752_output_s00000264 | 3<=task_s00000707_output_s00000264]]]] | ~ [EG [[3<=fork_s00000464_activated_s00000274 | decision_s00000788_activated<=stopNode_s00000597_input_default]]]]

abstracting: (decision_s00000788_activated<=stopNode_s00000597_input_default) states: 8,365 (3)
abstracting: (3<=fork_s00000464_activated_s00000274) states: 0
...........
EG iterations: 11
abstracting: (3<=task_s00000707_output_s00000264) states: 0
abstracting: (3<=task_s00000752_output_s00000264) states: 0
abstracting: (1<=task_s00000732_output_s00000264) states: 270
abstracting: (1<=task_s00000740_input_s00000263) states: 145
abstracting: (2<=task_s00000756_inputCriterion_s00000257_used) states: 0
.abstracting: (2<=fork_s00000465_input_s00000263) states: 0
abstracting: (1<=merge_s00000453_input_s00000290) states: 5
.-> the formula is FALSE

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

MC time: 0m0sec

checking: AF [3<=merge_s00000446_activated]
normalized: ~ [EG [~ [3<=merge_s00000446_activated]]]

abstracting: (3<=merge_s00000446_activated) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AX [AG [[fork_s00000464_activated_s00000272<=task_s00000736_output_s00000264 | decision_s00000805_activated<=decision_s00000764_input_s00000263]]]
normalized: ~ [EX [E [true U ~ [[fork_s00000464_activated_s00000272<=task_s00000736_output_s00000264 | decision_s00000805_activated<=decision_s00000764_input_s00000263]]]]]

abstracting: (decision_s00000805_activated<=decision_s00000764_input_s00000263) states: 8,365 (3)
abstracting: (fork_s00000464_activated_s00000272<=task_s00000736_output_s00000264) states: 8,315 (3)
.-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [1<=task_s00000722_input_s00000263 | EG [[[task_s00000757_input_s00000263<=task_s00000728_input_s00000263 & task_s00000753_output_s00000264<=decision_s00000768_activated] & [task_s00000709_input_s00000263<=merge_s00000320_input_s00000263 | task_s00000748_inputCriterion_s00000257_used<=merge_s00000461_input_s00000263]]]]
normalized: [1<=task_s00000722_input_s00000263 | EG [[[task_s00000757_input_s00000263<=task_s00000728_input_s00000263 & task_s00000753_output_s00000264<=decision_s00000768_activated] & [task_s00000709_input_s00000263<=merge_s00000320_input_s00000263 | task_s00000748_inputCriterion_s00000257_used<=merge_s00000461_input_s00000263]]]]

abstracting: (task_s00000748_inputCriterion_s00000257_used<=merge_s00000461_input_s00000263) states: 8,105 (3)
abstracting: (task_s00000709_input_s00000263<=merge_s00000320_input_s00000263) states: 8,365 (3)
abstracting: (task_s00000753_output_s00000264<=decision_s00000768_activated) states: 8,369 (3)
abstracting: (task_s00000757_input_s00000263<=task_s00000728_input_s00000263) states: 8,245 (3)
.................
EG iterations: 17
abstracting: (1<=task_s00000722_input_s00000263) states: 5
-> the formula is TRUE

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

MC time: 0m0sec

checking: AF [EG [[1<=task_s00000735_inputCriterion_s00000257_used & task_s00000737_output_s00000264<=task_s00000742_output_s00000264]]]
normalized: ~ [EG [~ [EG [[1<=task_s00000735_inputCriterion_s00000257_used & task_s00000737_output_s00000264<=task_s00000742_output_s00000264]]]]]

abstracting: (task_s00000737_output_s00000264<=task_s00000742_output_s00000264) states: 8,365 (3)
abstracting: (1<=task_s00000735_inputCriterion_s00000257_used) states: 270
....................................................
EG iterations: 52

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: EG [AX [[task_s00000721_input_s00000263<=task_s00000763_output_s00000264 | 1<=decision_s00000801_activated]]]
normalized: EG [~ [EX [~ [[task_s00000721_input_s00000263<=task_s00000763_output_s00000264 | 1<=decision_s00000801_activated]]]]]

abstracting: (1<=decision_s00000801_activated) states: 1
abstracting: (task_s00000721_input_s00000263<=task_s00000763_output_s00000264) states: 8,225 (3)
.........................................................
EG iterations: 56
-> the formula is TRUE

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

MC time: 0m1sec


Total processing time: 0m10sec


BK_STOP 1433633302404

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


iterations count:284 (1), effective:0 (0)

iterations count:287 (1), effective:1 (0)

iterations count:287 (1), effective:1 (0)

iterations count:287 (1), effective:1 (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="CTLCardinality"
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 CTLCardinality"
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-143354324700067"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;