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-C0010N0000000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468027700498
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465039032988


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_C0010N0000000100
(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 4.313sec


RS generation: 0m 0.342sec


-> reachability set: #nodes 22693 (2.3e+04) #states 176,894,515,156 (11)



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

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

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

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

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

abstracting: (3<=Lac) states: 18,901,419,205 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.352sec

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

abstracting: (2<=Lac) states: 42,253,162,933 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.472sec

checking: [EX [3<=E4P] | EF [AX [2<=Lac]]]
normalized: [E [true U ~ [EX [~ [2<=Lac]]]] | EX [3<=E4P]]

abstracting: (3<=E4P) states: 0
.abstracting: (2<=Lac) states: 42,253,162,933 (10)
.-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.270sec

checking: ~ [EF [AG [Pi<=b1]]]
normalized: ~ [E [true U ~ [E [true U ~ [Pi<=b1]]]]]

abstracting: (Pi<=b1) states: 1
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.051sec

checking: AG [AX [[3<=ATP | 2<=R5P]]]
normalized: ~ [E [true U EX [~ [[3<=ATP | 2<=R5P]]]]]

abstracting: (2<=R5P) states: 21,307,716 (7)
abstracting: (3<=ATP) states: 176,894,515,156 (11)
.-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: AG [~ [AG [a2<=a1]]]
normalized: ~ [E [true U ~ [E [true U ~ [a2<=a1]]]]]

abstracting: (a2<=a1) states: 58,005,307,942 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.577sec

checking: [EX [~ [[2<=start & 1<=FBP]]] & AG [PEP<=GSSG]]
normalized: [~ [E [true U ~ [PEP<=GSSG]]] & EX [~ [[2<=start & 1<=FBP]]]]

abstracting: (1<=FBP) states: 42,323,861,326 (10)
abstracting: (2<=start) states: 0
.abstracting: (PEP<=GSSG) states: 176,894,515,156 (11)
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.882sec

checking: [E [~ [3<=_3PG] U ATP<=Pyr] | 2<=NADPH]
normalized: [2<=NADPH | E [~ [3<=_3PG] U ATP<=Pyr]]

abstracting: (ATP<=Pyr) states: 0
abstracting: (3<=_3PG) states: 18,901,419,205 (10)
abstracting: (2<=NADPH) states: 165,281,509,554 (11)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.375sec

checking: ~ [[E [2<=_1_3_BPG U 1<=ATP] & ~ [AG [S7P<=b2]]]]
normalized: ~ [[E [true U ~ [S7P<=b2]] & E [2<=_1_3_BPG U 1<=ATP]]]

abstracting: (1<=ATP) states: 176,894,515,156 (11)
abstracting: (2<=_1_3_BPG) states: 42,253,162,933 (10)
abstracting: (S7P<=b2) states: 174,834,561,756 (11)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.404sec

checking: [[A [1<=NADPH U 1<=a1] & AG [~ [2<=_3PG]]] & AX [EG [b2<=_1_3_BPG]]]
normalized: [~ [EX [~ [EG [b2<=_1_3_BPG]]]] & [~ [E [true U 2<=_3PG]] & [~ [EG [~ [1<=a1]]] & ~ [E [~ [1<=a1] U [~ [1<=NADPH] & ~ [1<=a1]]]]]]]

abstracting: (1<=a1) states: 166,873,869,392 (11)
abstracting: (1<=NADPH) states: 171,033,872,278 (11)
abstracting: (1<=a1) states: 166,873,869,392 (11)
abstracting: (1<=a1) states: 166,873,869,392 (11)
............................................................................................................................................................................................................................
EG iterations: 220
abstracting: (2<=_3PG) states: 42,253,162,933 (10)
abstracting: (b2<=_1_3_BPG) states: 8,843,740,580 (9)
...................................................................................................................................................................................................
EG iterations: 195
.-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.544sec

checking: EF [[~ [[3<=GSSG | c2<=start]] | [2<=R5P & S7P<=S7P]]]
normalized: E [true U [[2<=R5P & S7P<=S7P] | ~ [[3<=GSSG | c2<=start]]]]

abstracting: (c2<=start) states: 246,728,912 (8)
abstracting: (3<=GSSG) states: 176,894,515,156 (11)
abstracting: (S7P<=S7P) states: 176,894,515,156 (11)
abstracting: (2<=R5P) states: 21,307,716 (7)
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.373sec

checking: [AG [EF [b1<=ADP]] | ~ [E [b1<=ATP U S7P<=NADplus]]]
normalized: [~ [E [b1<=ATP U S7P<=NADplus]] | ~ [E [true U ~ [E [true U b1<=ADP]]]]]

abstracting: (b1<=ADP) states: 176,894,515,155 (11)
abstracting: (S7P<=NADplus) states: 176,894,515,156 (11)
abstracting: (b1<=ATP) states: 176,894,515,156 (11)
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.534sec

checking: [E [[3<=b1 & NADPH<=Pi] U ~ [F6P<=Pi]] | [3<=GAP | EX [[2<=R5P & Gluc<=Pyr]]]]
normalized: [[3<=GAP | EX [[2<=R5P & Gluc<=Pyr]]] | E [[3<=b1 & NADPH<=Pi] U ~ [F6P<=Pi]]]

abstracting: (F6P<=Pi) states: 176,894,515,156 (11)
abstracting: (NADPH<=Pi) states: 176,176,517,144 (11)
abstracting: (3<=b1) states: 122,391,574,088 (11)
abstracting: (Gluc<=Pyr) states: 56,837,208,372 (10)
abstracting: (2<=R5P) states: 21,307,716 (7)
.abstracting: (3<=GAP) states: 18,942,720,750 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.317sec

checking: EF [[[[1<=_2PG | 1<=R5P] & [ADP<=F6P & _1_3_BPG<=Xu5P]] & ~ [[F6P<=FBP | 1<=GSH]]]]
normalized: E [true U [~ [[F6P<=FBP | 1<=GSH]] & [[ADP<=F6P & _1_3_BPG<=Xu5P] & [1<=_2PG | 1<=R5P]]]]

abstracting: (1<=R5P) states: 33,836,146,722 (10)
abstracting: (1<=_2PG) states: 88,737,764,562 (10)
abstracting: (_1_3_BPG<=Xu5P) states: 173,142,036,818 (11)
abstracting: (ADP<=F6P) states: 1
abstracting: (1<=GSH) states: 171,033,872,278 (11)
abstracting: (F6P<=FBP) states: 141,489,374,299 (11)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.516sec

checking: AG [[[[NADPplus<=NADPH | 1<=start] & ~ [1<=_3PG]] | [[Lac<=Xu5P | _2PG<=G6P] & [3<=NADPplus | c2<=Pyr]]]]
normalized: ~ [E [true U ~ [[[[3<=NADPplus | c2<=Pyr] & [Lac<=Xu5P | _2PG<=G6P]] | [~ [1<=_3PG] & [NADPplus<=NADPH | 1<=start]]]]]]

abstracting: (1<=start) states: 1
abstracting: (NADPplus<=NADPH) states: 0
abstracting: (1<=_3PG) states: 88,737,764,562 (10)
abstracting: (_2PG<=G6P) states: 148,802,176,185 (11)
abstracting: (Lac<=Xu5P) states: 173,142,036,818 (11)
abstracting: (c2<=Pyr) states: 246,728,912 (8)
abstracting: (3<=NADPplus) states: 176,894,515,156 (11)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.240sec


Total processing time: 0m41.956sec


BK_STOP 1465039075014

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

16448
iterations count:1481 (67), effective:355 (16)

initing FirstDep: 0m 0.000sec


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

iterations count:210 (9), effective:41 (1)

iterations count:176 (8), effective:32 (1)

iterations count:176 (8), effective:32 (1)

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

iterations count:274 (12), effective:36 (1)

iterations count:732 (33), effective:101 (4)

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

iterations count:648 (29), effective:86 (3)

iterations count:174 (7), effective:76 (3)

iterations count:698 (31), effective:97 (4)

iterations count:505 (22), effective:69 (3)

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

iterations count:22 (1), effective:0 (0)
32435
iterations count:1370 (62), effective:198 (9)

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-C0010N0000000100"
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-C0010N0000000100.tgz
mv GPPP-PT-C0010N0000000100 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-C0010N0000000100, 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-146468027700498"
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 '' 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 ;