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-3254
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 r021-blw3-149440255300516
=====================================================================

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

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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

parse successfull
net created successfully

Net: GPPP_PT_C0001N0000000010
(NrP: 33 NrTr: 22 NrArc: 83)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 1.199sec

parse successfull
net created successfully

Net: GPPP_PT_C0001N0000000010
(NrP: 33 NrTr: 22 NrArc: 83)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 3.911sec


RS generation: 0m 0.061sec


-> reachability set: #nodes 1088 (1.1e+03) #states 1,655,346 (6)



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

checking: AG [~ [EG [1<=_3PG]]]
normalized: ~ [E [true U EG [1<=_3PG]]]

abstracting: (1<=_3PG)
states: 700,392 (5)
..................................................................................
EG iterations: 82
-> the formula is FALSE

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

MC time: 0m 0.124sec

checking: AF [AF [1<=GAP]]
normalized: ~ [EG [EG [~ [1<=GAP]]]]

abstracting: (1<=GAP)
states: 714,252 (5)
.................................................................................................................
EG iterations: 113
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.165sec

checking: 3<=ATP
normalized: 3<=ATP

abstracting: (3<=ATP)
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.001sec

checking: AG [~ [AG [E4P<=NADPplus]]]
normalized: ~ [E [true U ~ [E [true U ~ [E4P<=NADPplus]]]]]

abstracting: (E4P<=NADPplus)
states: 1,637,526 (6)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

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

abstracting: (Pyr<=Lac)
states: 1,158,234 (6)
-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: b2<=Gluc
normalized: b2<=Gluc

abstracting: (b2<=Gluc)
states: 1,548,393 (6)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [[EF [ADP<=FBP] | 2<=DHAP]]
normalized: EG [[2<=DHAP | E [true U ADP<=FBP]]]

abstracting: (ADP<=FBP)
states: 2,079 (3)
abstracting: (2<=DHAP)
states: 285,516 (5)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.014sec

checking: AG [~ [[3<=Xu5P & [3<=PEP & 1<=_2PG]]]]
normalized: ~ [E [true U [3<=Xu5P & [3<=PEP & 1<=_2PG]]]]

abstracting: (1<=_2PG)
states: 700,392 (5)
abstracting: (3<=PEP)
states: 100,947 (5)
abstracting: (3<=Xu5P)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: AG [EF [[NADH<=GSH & F6P<=R5P]]]
normalized: ~ [E [true U ~ [E [true U [NADH<=GSH & F6P<=R5P]]]]]

abstracting: (F6P<=R5P)
states: 1,372,140 (6)
abstracting: (NADH<=GSH)
states: 1,362,942 (6)
-> the formula is TRUE

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

MC time: 0m 0.036sec

checking: AX [EF [[Pi<=PEP & GSSG<=G6P]]]
normalized: ~ [EX [~ [E [true U [Pi<=PEP & GSSG<=G6P]]]]]

abstracting: (GSSG<=G6P)
states: 160,944 (5)
abstracting: (Pi<=PEP)
states: 380,919 (5)
.-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: [1<=F6P | [AG [~ [2<=R5P]] & ~ [[~ [_1_3_BPG<=Pyr] & ~ [2<=E4P]]]]]
normalized: [1<=F6P | [~ [E [true U 2<=R5P]] & ~ [[~ [_1_3_BPG<=Pyr] & ~ [2<=E4P]]]]]

abstracting: (2<=E4P)
states: 0
abstracting: (_1_3_BPG<=Pyr)
states: 1,158,234 (6)
abstracting: (2<=R5P)
states: 0
abstracting: (1<=F6P)
states: 285,516 (5)
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: EF [[[[c1<=GSSG & G6P<=PEP] & [2<=c2 & 2<=FBP]] & 2<=Pyr]]
normalized: E [true U [2<=Pyr & [[2<=c2 & 2<=FBP] & [c1<=GSSG & G6P<=PEP]]]]

abstracting: (G6P<=PEP)
states: 1,578,885 (6)
abstracting: (c1<=GSSG)
states: 1,022,196 (6)
abstracting: (2<=FBP)
states: 32,340 (4)
abstracting: (2<=c2)
states: 1,227,072 (6)
abstracting: (2<=Pyr)
states: 279,048 (5)
-> the formula is TRUE

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

MC time: 0m 0.047sec

checking: [EG [[~ [a1<=Gluc] | [ADP<=GSH | Lac<=Gluc]]] & AX [AG [NADH<=ATP]]]
normalized: [~ [EX [E [true U ~ [NADH<=ATP]]]] & EG [[[ADP<=GSH | Lac<=Gluc] | ~ [a1<=Gluc]]]]

abstracting: (a1<=Gluc)
states: 107,646 (5)
abstracting: (Lac<=Gluc)
states: 977,592 (5)
abstracting: (ADP<=GSH)
states: 962,010 (5)
.
EG iterations: 1
abstracting: (NADH<=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.031sec

checking: [AG [[[E4P<=GAP & 3<=NADPH] | _3PG<=b2]] | E [[3<=Pi | 1<=G6P] U 2<=a1]]
normalized: [E [[3<=Pi | 1<=G6P] U 2<=a1] | ~ [E [true U ~ [[_3PG<=b2 | [E4P<=GAP & 3<=NADPH]]]]]]

abstracting: (3<=NADPH)
states: 1,418,868 (6)
abstracting: (E4P<=GAP)
states: 1,406,790 (6)
abstracting: (_3PG<=b2)
states: 1,000,230 (6)
abstracting: (2<=a1)
states: 1,358,742 (6)
abstracting: (1<=G6P)
states: 107,877 (5)
abstracting: (3<=Pi)
states: 967,659 (5)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: [EG [[[2<=_1_3_BPG & 1<=Pyr] & [3<=c2 & a1<=Ru5P]]] | E [[2<=a2 | 2<=NADplus] U [3<=R5P & _2PG<=c2]]]
normalized: [E [[2<=a2 | 2<=NADplus] U [3<=R5P & _2PG<=c2]] | EG [[[3<=c2 & a1<=Ru5P] & [2<=_1_3_BPG & 1<=Pyr]]]]

abstracting: (1<=Pyr)
states: 700,392 (5)
abstracting: (2<=_1_3_BPG)
states: 279,048 (5)
abstracting: (a1<=Ru5P)
states: 106,953 (5)
abstracting: (3<=c2)
states: 936,012 (5)
.........................................................
EG iterations: 57
abstracting: (_2PG<=c2)
states: 1,463,385 (6)
abstracting: (3<=R5P)
states: 0
abstracting: (2<=NADplus)
states: 1,655,346 (6)
abstracting: (2<=a2)
states: 6,930 (3)
-> the formula is FALSE

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

MC time: 0m 0.031sec

checking: [[AG [[1<=b2 | c1<=Pyr]] | AX [[1<=ADP & 2<=PEP]]] & [~ [[~ [3<=DHAP] | ~ [a1<=Ru5P]]] | ~ [[[F6P<=Ru5P & b2<=DHAP] & _3PG<=_3PG]]]]
normalized: [[~ [[_3PG<=_3PG & [F6P<=Ru5P & b2<=DHAP]]] | ~ [[~ [a1<=Ru5P] | ~ [3<=DHAP]]]] & [~ [EX [~ [[1<=ADP & 2<=PEP]]]] | ~ [E [true U ~ [[1<=b2 | c1<=Pyr]]]]]]

abstracting: (c1<=Pyr)
states: 55,440 (4)
abstracting: (1<=b2)
states: 209,286 (5)
abstracting: (2<=PEP)
states: 279,048 (5)
abstracting: (1<=ADP)
states: 1,653,267 (6)
.abstracting: (3<=DHAP)
states: 101,871 (5)
abstracting: (a1<=Ru5P)
states: 106,953 (5)
abstracting: (b2<=DHAP)
states: 1,515,360 (6)
abstracting: (F6P<=Ru5P)
states: 1,381,149 (6)
abstracting: (_3PG<=_3PG)
states: 1,655,346 (6)
-> the formula is FALSE

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

MC time: 0m 0.019sec

totally nodes used: 159542 (1.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 436642 419968 856610
used/not used/entry size/cache size: 548797 66560067 16 1024MB
basic ops cache: hits/miss/sum: 104691 143287 247978
used/not used/entry size/cache size: 256083 16521133 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 7527 12088 19615
used/not used/entry size/cache size: 12078 8376530 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66959233
1 146393
2 2441
3 429
4 82
5 34
6 45
7 19
8 20
9 9
>= 10 159

Total processing time: 0m 7.885sec


BK_STOP 1494464502688

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

check for maximal unmarked siphon
ok
check for constant places
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:1795 (81), effective:420 (19)

initing FirstDep: 0m 0.000sec


iterations count:257 (11), effective:66 (3)

iterations count:2107 (95), effective:513 (23)

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

iterations count:348 (15), effective:77 (3)

iterations count:124 (5), effective:38 (1)

iterations count:3041 (138), effective:750 (34)

iterations count:481 (21), effective:114 (5)

iterations count:437 (19), effective:99 (4)

iterations count:80 (3), effective:14 (0)

iterations count:123 (5), effective:23 (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="/tmp/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-3254"
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 r021-blw3-149440255300516"
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 ;