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 S_GPPP-PT-C0001N0000000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101-blw3-149441599100525
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494883515658

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_C0001N0000000100
(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.246sec

parse successfull
net created successfully

Net: GPPP_PT_C0001N0000000100
(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.980sec


RS generation: 0m 0.204sec


-> reachability set: #nodes 1358 (1.4e+03) #states 145,476,966 (8)



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

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

abstracting: (3<=Lac)
states: 8,871,537 (6)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 532
-> the formula is FALSE

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

MC time: 0m 4.083sec

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

abstracting: (2<=_2PG)
states: 24,523,608 (7)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.097sec

checking: EF [AX [[1<=b2 & 3<=Lac]]]
normalized: E [true U ~ [EX [~ [[1<=b2 & 3<=Lac]]]]]

abstracting: (3<=Lac)
states: 8,871,537 (6)
abstracting: (1<=b2)
states: 18,392,706 (7)
.-> the formula is TRUE

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

MC time: 0m 0.141sec

checking: EG [[AX [3<=GSH] | AG [3<=GSSG]]]
normalized: EG [[~ [E [true U ~ [3<=GSSG]]] | ~ [EX [~ [3<=GSH]]]]]

abstracting: (3<=GSH)
states: 142,596,234 (8)
.abstracting: (3<=GSSG)
states: 141,155,868 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.389sec

checking: AG [EF [[c1<=FBP & 3<=_1_3_BPG]]]
normalized: ~ [E [true U ~ [E [true U [c1<=FBP & 3<=_1_3_BPG]]]]]

abstracting: (3<=_1_3_BPG)
states: 8,871,537 (6)
abstracting: (c1<=FBP)
states: 5,481,270 (6)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: ~ [[EX [~ [Lac<=NADPH]] | EF [3<=_1_3_BPG]]]
normalized: ~ [[EX [~ [Lac<=NADPH]] | E [true U 3<=_1_3_BPG]]]

abstracting: (3<=_1_3_BPG)
states: 8,871,537 (6)
abstracting: (Lac<=NADPH)
states: 144,985,702 (8)
.-> the formula is FALSE

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

MC time: 0m 0.199sec

checking: [~ [Lac<=Xu5P] | EF [3<=PEP]]
normalized: [E [true U 3<=PEP] | ~ [Lac<=Xu5P]]

abstracting: (Lac<=Xu5P)
states: 85,913,832 (7)
abstracting: (3<=PEP)
states: 8,871,537 (6)
-> the formula is TRUE

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

MC time: 0m 0.092sec

checking: AF [E [S7P<=Ru5P U 3<=start]]
normalized: ~ [EG [~ [E [S7P<=Ru5P U 3<=start]]]]

abstracting: (3<=start)
states: 0
abstracting: (S7P<=Ru5P)
states: 144,989,742 (8)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: [EF [AF [3<=R5P]] & ~ [[3<=_2PG & ~ [[1<=a1 | 1<=Ru5P]]]]]
normalized: [~ [[3<=_2PG & ~ [[1<=a1 | 1<=Ru5P]]]] & E [true U ~ [EG [~ [3<=R5P]]]]]

abstracting: (3<=R5P)
states: 0

EG iterations: 0
abstracting: (1<=Ru5P)
states: 9,399,363 (6)
abstracting: (1<=a1)
states: 144,867,936 (8)
abstracting: (3<=_2PG)
states: 8,871,537 (6)
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: AX [[AG [c1<=c1] & b2<=GSH]]
normalized: ~ [EX [~ [[b2<=GSH & ~ [E [true U ~ [c1<=c1]]]]]]]

abstracting: (c1<=c1)
states: 145,476,966 (8)
abstracting: (b2<=GSH)
states: 145,290,840 (8)
.-> the formula is TRUE

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

MC time: 0m 0.031sec

checking: AG [E [b1<=GSSG U NADplus<=FBP]]
normalized: ~ [E [true U ~ [E [b1<=GSSG U NADplus<=FBP]]]]

abstracting: (NADplus<=FBP)
states: 0
abstracting: (b1<=GSSG)
states: 141,352,044 (8)
-> the formula is FALSE

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

MC time: 0m 0.019sec

checking: [EF [[2<=Lac & [1<=a2 & 1<=start]]] | [3<=Pyr & 3<=_2PG]]
normalized: [[3<=Pyr & 3<=_2PG] | E [true U [2<=Lac & [1<=a2 & 1<=start]]]]

abstracting: (1<=start)
states: 20,301 (4)
abstracting: (1<=a2)
states: 26,066,484 (7)
abstracting: (2<=Lac)
states: 24,523,608 (7)
abstracting: (3<=_2PG)
states: 8,871,537 (6)
abstracting: (3<=Pyr)
states: 8,871,537 (6)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[EF [2<=Gluc] | [~ [NADplus<=a1] | [c2<=GSH | 1<=S7P]]]]
normalized: ~ [E [true U ~ [[[~ [NADplus<=a1] | [c2<=GSH | 1<=S7P]] | E [true U 2<=Gluc]]]]]

abstracting: (2<=Gluc)
states: 466,923 (5)
abstracting: (1<=S7P)
states: 649,632 (5)
abstracting: (c2<=GSH)
states: 143,126,874 (8)
abstracting: (NADplus<=a1)
states: 0
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.121sec

checking: AG [~ [[[Pi<=PEP & _1_3_BPG<=R5P] & [1<=ATP & ATP<=b2]]]]
normalized: ~ [E [true U [[1<=ATP & ATP<=b2] & [Pi<=PEP & _1_3_BPG<=R5P]]]]

abstracting: (_1_3_BPG<=R5P)
states: 83,924,334 (7)
abstracting: (Pi<=PEP)
states: 33,476,349 (7)
abstracting: (ATP<=b2)
states: 0
abstracting: (1<=ATP)
states: 145,476,966 (8)
-> the formula is TRUE

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

MC time: 0m 0.025sec

checking: E [[[2<=GSSG | _2PG<=b2] & [2<=a1 | 2<=S7P]] U [[1<=b1 & 3<=c2] & ~ [3<=ATP]]]
normalized: E [[[2<=a1 | 2<=S7P] & [2<=GSSG | _2PG<=b2]] U [[1<=b1 & 3<=c2] & ~ [3<=ATP]]]

abstracting: (3<=ATP)
states: 145,476,966 (8)
abstracting: (3<=c2)
states: 82,259,652 (7)
abstracting: (1<=b1)
states: 145,070,946 (8)
abstracting: (_2PG<=b2)
states: 87,903,330 (7)
abstracting: (2<=GSSG)
states: 142,596,234 (8)
abstracting: (2<=S7P)
states: 0
abstracting: (2<=a1)
states: 119,410,482 (8)
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: [[AF [NADPH<=c2] & AG [Gluc<=ATP]] | EG [[R5P<=S7P & [GSSG<=start | DHAP<=start]]]]
normalized: [EG [[R5P<=S7P & [GSSG<=start | DHAP<=start]]] | [~ [E [true U ~ [Gluc<=ATP]]] & ~ [EG [~ [NADPH<=c2]]]]]

abstracting: (NADPH<=c2)
states: 2,744,978 (6)
.
EG iterations: 1
abstracting: (Gluc<=ATP)
states: 145,476,966 (8)
abstracting: (DHAP<=start)
states: 82,706,274 (7)
abstracting: (GSSG<=start)
states: 1,440,567 (6)
abstracting: (R5P<=S7P)
states: 144,461,916 (8)
.............................................................................................................................................................................................................................................................
EG iterations: 253
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.366sec

totally nodes used: 2027049 (2.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 25146272 2797710 27943982
used/not used/entry size/cache size: 4331374 62777490 16 1024MB
basic ops cache: hits/miss/sum: 3703172 902842 4606014
used/not used/entry size/cache size: 1595881 15181335 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: 14251 16093 30344
used/not used/entry size/cache size: 16085 8372523 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 65327358
1 1761532
2 16720
3 611
4 95
5 41
6 39
7 23
8 22
9 19
>= 10 2404

Total processing time: 0m23.321sec


BK_STOP 1494883539117

--------------------
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.001sec


iterations count:15790 (717), effective:3705 (168)

initing FirstDep: 0m 0.000sec


iterations count:223 (10), effective:48 (2)

iterations count:243 (11), effective:55 (2)

iterations count:496 (22), effective:113 (5)

iterations count:27756 (1261), effective:6958 (316)

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

iterations count:296 (13), effective:71 (3)

iterations count:282 (12), effective:65 (2)

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

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

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_GPPP-PT-C0001N0000000100"
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/S_GPPP-PT-C0001N0000000100.tgz
mv S_GPPP-PT-C0001N0000000100 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 S_GPPP-PT-C0001N0000000100, 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 r101-blw3-149441599100525"
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 ;