About the Execution of Marcie for S_Kanban-PT-0010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5416.660 | 5616.00 | 5048.00 | 30.30 | TFTTFTFFTTFTFTFF | normal |
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_Kanban-PT-0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161kn-blw3-146416418200111
=====================================================================
--------------------
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 Kanban-PT-0010-CTLCardinality-0
FORMULA_NAME Kanban-PT-0010-CTLCardinality-1
FORMULA_NAME Kanban-PT-0010-CTLCardinality-10
FORMULA_NAME Kanban-PT-0010-CTLCardinality-11
FORMULA_NAME Kanban-PT-0010-CTLCardinality-12
FORMULA_NAME Kanban-PT-0010-CTLCardinality-13
FORMULA_NAME Kanban-PT-0010-CTLCardinality-14
FORMULA_NAME Kanban-PT-0010-CTLCardinality-15
FORMULA_NAME Kanban-PT-0010-CTLCardinality-2
FORMULA_NAME Kanban-PT-0010-CTLCardinality-3
FORMULA_NAME Kanban-PT-0010-CTLCardinality-4
FORMULA_NAME Kanban-PT-0010-CTLCardinality-5
FORMULA_NAME Kanban-PT-0010-CTLCardinality-6
FORMULA_NAME Kanban-PT-0010-CTLCardinality-7
FORMULA_NAME Kanban-PT-0010-CTLCardinality-8
FORMULA_NAME Kanban-PT-0010-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1464331792025
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=CTLCardinality.xml --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Net: Kanban_PT_0010
(NrP: 16 NrTr: 16 NrArc: 40)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
init dd package: 0m 3.885sec
RS generation: 0m 0.007sec
-> reachability set: #nodes 256 (2.6e+02) #states 1,005,927,208 (9)
starting MCC model checker
--------------------------
checking: AG [EF [3<=P2]]
normalized: ~ [E [true U ~ [E [true U 3<=P2]]]]
abstracting: (3<=P2) states: 236,554,032 (8)
-> the formula is TRUE
FORMULA Kanban-PT-0010-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EF [AG [~ [3<=P1]]]
normalized: E [true U ~ [E [true U 3<=P1]]]
abstracting: (3<=P1) states: 422,067,360 (8)
-> the formula is FALSE
FORMULA Kanban-PT-0010-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [2<=Pback1]
normalized: ~ [E [true U ~ [2<=Pback1]]]
abstracting: (2<=Pback1) states: 580,342,620 (8)
-> the formula is FALSE
FORMULA Kanban-PT-0010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [EG [Pm1<=P4]]
normalized: ~ [E [true U ~ [EG [Pm1<=P4]]]]
abstracting: (Pm1<=P4) states: 578,584,006 (8)
............
EG iterations: 12
-> the formula is FALSE
FORMULA Kanban-PT-0010-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.063sec
checking: EF [[~ [~ [3<=Pm1]] & AF [3<=Pback2]]]
normalized: E [true U [3<=Pm1 & ~ [EG [~ [3<=Pback2]]]]]
abstracting: (3<=Pback2) states: 479,488,152 (8)
.
EG iterations: 1
abstracting: (3<=Pm1) states: 422,067,360 (8)
-> the formula is TRUE
FORMULA Kanban-PT-0010-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: AG [EF [P1<=Pout1]]
normalized: ~ [E [true U ~ [E [true U P1<=Pout1]]]]
abstracting: (P1<=Pout1) states: 566,273,708 (8)
-> the formula is TRUE
FORMULA Kanban-PT-0010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: ~ [[AG [~ [2<=Pm1]] & ~ [AX [1<=Pout3]]]]
normalized: ~ [[EX [~ [1<=Pout3]] & ~ [E [true U 2<=Pm1]]]]
abstracting: (2<=Pm1) states: 580,342,620 (8)
abstracting: (1<=Pout3) states: 807,081,132 (8)
.-> the formula is TRUE
FORMULA Kanban-PT-0010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EX [E [Pback1<=Pback3 U 3<=Pm1]]
normalized: EX [E [Pback1<=Pback3 U 3<=Pm1]]
abstracting: (3<=Pm1) states: 422,067,360 (8)
abstracting: (Pback1<=Pback3) states: 612,243,060 (8)
.-> the formula is TRUE
FORMULA Kanban-PT-0010-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.041sec
checking: E [P3<=Pback2 U AG [1<=P2]]
normalized: E [P3<=Pback2 U ~ [E [true U ~ [1<=P2]]]]
abstracting: (1<=P2) states: 649,623,832 (8)
abstracting: (P3<=Pback2) states: 721,440,720 (8)
-> the formula is FALSE
FORMULA Kanban-PT-0010-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EX [EF [[P1<=P2 & P1<=Pm2]]]
normalized: EX [E [true U [P1<=P2 & P1<=Pm2]]]
abstracting: (P1<=Pm2) states: 612,243,060 (8)
abstracting: (P1<=P2) states: 469,877,122 (8)
.-> the formula is TRUE
FORMULA Kanban-PT-0010-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: [EF [AG [Pout4<=P1]] & P2<=P2]
normalized: [P2<=P2 & E [true U ~ [E [true U ~ [Pout4<=P1]]]]]
abstracting: (Pout4<=P1) states: 578,584,006 (8)
abstracting: (P2<=P2) states: 1,005,927,208 (9)
-> the formula is FALSE
FORMULA Kanban-PT-0010-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.025sec
checking: EF [[1<=Pout4 & [[1<=Pm4 & 3<=Pback3] & [Pm1<=P3 & 1<=P1]]]]
normalized: E [true U [1<=Pout4 & [[Pm1<=P3 & 1<=P1] & [1<=Pm4 & 3<=Pback3]]]]
abstracting: (3<=Pback3) states: 479,488,152 (8)
abstracting: (1<=Pm4) states: 773,790,160 (8)
abstracting: (1<=P1) states: 773,790,160 (8)
abstracting: (Pm1<=P3) states: 469,877,122 (8)
abstracting: (1<=Pout4) states: 773,790,160 (8)
-> the formula is TRUE
FORMULA Kanban-PT-0010-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.036sec
checking: ~ [AG [[[2<=P4 | Pback4<=P1] | [P3<=Pm2 | 2<=P1]]]]
normalized: E [true U ~ [[[P3<=Pm2 | 2<=P1] | [2<=P4 | Pback4<=P1]]]]
abstracting: (Pback4<=P1) states: 578,584,006 (8)
abstracting: (2<=P4) states: 580,342,620 (8)
abstracting: (2<=P1) states: 580,342,620 (8)
abstracting: (P3<=Pm2) states: 721,440,720 (8)
-> the formula is TRUE
FORMULA Kanban-PT-0010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.035sec
checking: [A [[Pm3<=P2 & 3<=Pm2] U ~ [2<=P4]] | AG [~ [~ [Pback3<=P2]]]]
normalized: [~ [E [true U ~ [Pback3<=P2]]] | [~ [EG [2<=P4]] & ~ [E [2<=P4 U [2<=P4 & ~ [[Pm3<=P2 & 3<=Pm2]]]]]]]
abstracting: (3<=Pm2) states: 479,488,152 (8)
abstracting: (Pm3<=P2) states: 433,437,004 (8)
abstracting: (2<=P4) states: 580,342,620 (8)
abstracting: (2<=P4) states: 580,342,620 (8)
abstracting: (2<=P4) states: 580,342,620 (8)
.
EG iterations: 1
abstracting: (Pback3<=P2) states: 433,437,004 (8)
-> the formula is FALSE
FORMULA Kanban-PT-0010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: [AG [[[Pm4<=Pback4 | 3<=Pout3] | [Pout2<=P2 | 3<=Pm1]]] & Pm3<=Pm4]
normalized: [Pm3<=Pm4 & ~ [E [true U ~ [[[Pout2<=P2 | 3<=Pm1] | [Pm4<=Pback4 | 3<=Pout3]]]]]]
abstracting: (3<=Pout3) states: 479,488,152 (8)
abstracting: (Pm4<=Pback4) states: 566,273,708 (8)
abstracting: (3<=Pm1) states: 422,067,360 (8)
abstracting: (Pout2<=P2) states: 433,437,004 (8)
abstracting: (Pm3<=Pm4) states: 535,886,494 (8)
-> the formula is FALSE
FORMULA Kanban-PT-0010-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
checking: [AF [AG [Pback3<=P3]] & [~ [[~ [P3<=P4] | P2<=Pback1]] | EG [[Pm4<=Pback1 | 2<=Pback2]]]]
normalized: [[EG [[Pm4<=Pback1 | 2<=Pback2]] | ~ [[P2<=Pback1 | ~ [P3<=P4]]]] & ~ [EG [E [true U ~ [Pback3<=P3]]]]]
abstracting: (Pback3<=P3) states: 433,437,004 (8)
EG iterations: 0
abstracting: (P3<=P4) states: 715,510,510 (8)
abstracting: (P2<=Pback1) states: 715,510,510 (8)
abstracting: (2<=Pback2) states: 631,628,712 (8)
abstracting: (Pm4<=Pback1) states: 578,584,006 (8)
............
EG iterations: 12
-> the formula is FALSE
FORMULA Kanban-PT-0010-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.045sec
Total processing time: 0m 5.564sec
BK_STOP 1464331797641
--------------------
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
iterations count:726 (45), effective:220 (13)
initing FirstDep: 0m 0.000sec
iterations count:124 (7), effective:34 (2)
iterations count:40 (2), effective:9 (0)
iterations count:52 (3), effective:9 (0)
iterations count:396 (24), effective:120 (7)
iterations count:190 (11), effective:51 (3)
iterations count:346 (21), effective:90 (5)
iterations count:92 (5), effective:22 (1)
iterations count:175 (10), effective:45 (2)
iterations count:166 (10), effective:40 (2)
iterations count:293 (18), effective:76 (4)
iterations count:139 (8), effective:39 (2)
iterations count:204 (12), effective:57 (3)
iterations count:415 (25), effective:116 (7)
iterations count:97 (6), effective:29 (1)
iterations count:138 (8), effective:35 (2)
iterations count:499 (31), effective:136 (8)
iterations count:138 (8), effective:35 (2)
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_Kanban-PT-0010"
export BK_EXAMINATION="CTLCardinality"
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_Kanban-PT-0010.tgz
mv S_Kanban-PT-0010 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_Kanban-PT-0010, 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 r161kn-blw3-146416418200111"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; 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 '
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 ;