About the Execution of Marcie for GPPP-PT-C0001N0000000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5414.500 | 5694.00 | 4920.00 | 120.20 | TFTFTFFFFTFTFFTT | 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 GPPP-PT-C0001N0000000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468027600444
=====================================================================
--------------------
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 GPPP-PT-C0001N0000000010-CTLCardinality-0
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-1
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-15
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-3
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-4
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-5
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-6
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-7
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-8
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1465033796095
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: GPPP_PT_C0001N0000000010
(NrP: 33 NrTr: 22 NrArc: 83)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
init dd package: 0m 3.748sec
RS generation: 0m 0.017sec
-> reachability set: #nodes 1088 (1.1e+03) #states 1,655,346 (6)
starting MCC model checker
--------------------------
checking: AG [~ [EG [2<=S7P]]]
normalized: ~ [E [true U EG [2<=S7P]]]
abstracting: (2<=S7P) states: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [ATP<=F6P]
normalized: E [true U ATP<=F6P]
abstracting: (ATP<=F6P) states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EX [[AF [1<=c2] | AG [2<=Pi]]]
normalized: EX [[~ [E [true U ~ [2<=Pi]]] | ~ [EG [~ [1<=c2]]]]]
abstracting: (1<=c2) states: 1,440,516 (6)
.
EG iterations: 1
abstracting: (2<=Pi) states: 1,258,719 (6)
.-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: AG [_2PG<=F6P]
normalized: ~ [E [true U ~ [_2PG<=F6P]]]
abstracting: (_2PG<=F6P) states: 1,025,178 (6)
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: AG [AX [start<=NADplus]]
normalized: ~ [E [true U EX [~ [start<=NADplus]]]]
abstracting: (start<=NADplus) states: 1,655,346 (6)
.-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[EG [3<=Lac] & 2<=start]]
normalized: E [true U [2<=start & EG [3<=Lac]]]
abstracting: (3<=Lac) states: 100,947 (5)
........................................................................
EG iterations: 72
abstracting: (2<=start) states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.037sec
checking: E [EG [1<=FBP] U AG [_2PG<=c1]]
normalized: E [EG [1<=FBP] U ~ [E [true U ~ [_2PG<=c1]]]]
abstracting: (_2PG<=c1) states: 1,655,346 (6)
abstracting: (1<=FBP) states: 285,516 (5)
.............................................................................
EG iterations: 77
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.060sec
checking: ~ [EF [~ [[3<=GSSG & _3PG<=E4P]]]]
normalized: ~ [E [true U ~ [[3<=GSSG & _3PG<=E4P]]]]
abstracting: (_3PG<=E4P) states: 1,045,506 (6)
abstracting: (3<=GSSG) states: 1,203,888 (6)
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.041sec
checking: [2<=R5P | EF [[~ [1<=GAP] & [1<=GAP | 3<=Lac]]]]
normalized: [2<=R5P | E [true U [[1<=GAP | 3<=Lac] & ~ [1<=GAP]]]]
abstracting: (1<=GAP) states: 714,252 (5)
abstracting: (3<=Lac) states: 100,947 (5)
abstracting: (1<=GAP) states: 714,252 (5)
abstracting: (2<=R5P) states: 0
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: ~ [EF [[[G6P<=Lac | 1<=Ru5P] & ~ [2<=NADplus]]]]
normalized: ~ [E [true U [~ [2<=NADplus] & [G6P<=Lac | 1<=Ru5P]]]]
abstracting: (1<=Ru5P) states: 106,953 (5)
abstracting: (G6P<=Lac) states: 1,578,885 (6)
abstracting: (2<=NADplus) states: 1,655,346 (6)
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: ~ [EF [[[3<=NADH & 1<=NADplus] | [Lac<=E4P & 3<=_2PG]]]]
normalized: ~ [E [true U [[3<=NADH & 1<=NADplus] | [Lac<=E4P & 3<=_2PG]]]]
abstracting: (3<=_2PG) states: 100,947 (5)
abstracting: (Lac<=E4P) states: 1,045,506 (6)
abstracting: (1<=NADplus) states: 1,655,346 (6)
abstracting: (3<=NADH) states: 1,117,578 (6)
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.022sec
checking: EF [[[~ [1<=NADPplus] & NADplus<=S7P] & [2<=c1 & ~ [R5P<=b2]]]]
normalized: E [true U [[2<=c1 & ~ [R5P<=b2]] & [NADplus<=S7P & ~ [1<=NADPplus]]]]
abstracting: (1<=NADPplus) states: 1,576,520 (6)
abstracting: (NADplus<=S7P) states: 0
abstracting: (R5P<=b2) states: 1,651,881 (6)
abstracting: (2<=c1) states: 1,547,238 (6)
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[[~ [c2<=NADPplus] & ~ [2<=GAP]] | [[1<=Lac & c1<=FBP] | 3<=ATP]]]
normalized: ~ [E [true U ~ [[[3<=ATP | [1<=Lac & c1<=FBP]] | [~ [2<=GAP] & ~ [c2<=NADPplus]]]]]]
abstracting: (c2<=NADPplus) states: 1,435,214 (6)
abstracting: (2<=GAP) states: 285,516 (5)
abstracting: (c1<=FBP) states: 62,370 (4)
abstracting: (1<=Lac) states: 700,392 (5)
abstracting: (3<=ATP) states: 1,655,346 (6)
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: E [[[1<=ATP | 2<=R5P] | [3<=a2 | GSH<=b2]] U ~ [Pyr<=a2]]
normalized: E [[[3<=a2 | GSH<=b2] | [1<=ATP | 2<=R5P]] U ~ [Pyr<=a2]]
abstracting: (Pyr<=a2) states: 1,022,868 (6)
abstracting: (2<=R5P) states: 0
abstracting: (1<=ATP) states: 1,655,346 (6)
abstracting: (GSH<=b2) states: 151,536 (5)
abstracting: (3<=a2) states: 0
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: EF [[AF [1<=Xu5P] & [[Ru5P<=start & ATP<=b2] & _1_3_BPG<=GSH]]]
normalized: E [true U [[_1_3_BPG<=GSH & [Ru5P<=start & ATP<=b2]] & ~ [EG [~ [1<=Xu5P]]]]]
abstracting: (1<=Xu5P) states: 100,023 (5)
..............................................................................
EG iterations: 78
abstracting: (ATP<=b2) states: 0
abstracting: (Ru5P<=start) states: 1,548,393 (6)
abstracting: (_1_3_BPG<=GSH) states: 1,581,678 (6)
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.068sec
checking: E [[[R5P<=R5P | 2<=S7P] | NADplus<=F6P] U [[ATP<=c2 & 2<=_2PG] | [NADPplus<=Pi & NADPH<=b1]]]
normalized: E [[NADplus<=F6P | [R5P<=R5P | 2<=S7P]] U [[NADPplus<=Pi & NADPH<=b1] | [ATP<=c2 & 2<=_2PG]]]
abstracting: (2<=_2PG) states: 279,048 (5)
abstracting: (ATP<=c2) states: 0
abstracting: (NADPH<=b1) states: 304,568 (5)
abstracting: (NADPplus<=Pi) states: 309,507 (5)
abstracting: (2<=S7P) states: 0
abstracting: (R5P<=R5P) states: 1,655,346 (6)
abstracting: (NADplus<=F6P) states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
Total processing time: 0m 5.660sec
BK_STOP 1465033801789
--------------------
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.001sec
1092
iterations count:1795 (81), effective:420 (19)
initing FirstDep: 0m 0.000sec
iterations count:259 (11), effective:47 (2)
iterations count:225 (10), effective:51 (2)
iterations count:22 (1), effective:0 (0)
iterations count:228 (10), effective:51 (2)
iterations count:255 (11), effective:52 (2)
iterations count:256 (11), effective:51 (2)
iterations count:201 (9), effective:40 (1)
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="GPPP-PT-C0001N0000000010"
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/GPPP-PT-C0001N0000000010.tgz
mv GPPP-PT-C0001N0000000010 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 GPPP-PT-C0001N0000000010, 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 r221su-smll-146468027600444"
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 ;