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-C0001N0000000001, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101-blw3-149441599100511
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494883455890

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=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: GPPP_PT_C0001N0000000001
(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.204sec

parse successfull
net created successfully

Net: GPPP_PT_C0001N0000000001
(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.688sec


RS generation: 0m 0.017sec


-> reachability set: #nodes 561 (5.6e+02) #states 10,380 (4)



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

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

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

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [~ [[start<=R5P & 3<=NADPplus]]]]
normalized: E [true U [start<=R5P & 3<=NADPplus]]

abstracting: (3<=NADPplus)
states: 0
abstracting: (start<=R5P)
states: 10,374 (4)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[3<=NADPplus | 2<=GSH] & 3<=_2PG]]
normalized: E [true U [[3<=NADPplus | 2<=GSH] & 3<=_2PG]]

abstracting: (3<=_2PG)
states: 0
abstracting: (2<=GSH)
states: 5,190 (3)
abstracting: (3<=NADPplus)
states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[GAP<=a1 & 1<=NADPplus] | ~ [2<=FBP]]]]
normalized: E [true U ~ [[~ [2<=FBP] | [GAP<=a1 & 1<=NADPplus]]]]

abstracting: (1<=NADPplus)
states: 6,920 (3)
abstracting: (GAP<=a1)
states: 9,168 (3)
abstracting: (2<=FBP)
states: 240
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [[NADPplus<=ADP | FBP<=ATP]]
normalized: ~ [E [true U ~ [[NADPplus<=ADP | FBP<=ATP]]]]

abstracting: (FBP<=ATP)
states: 9,516 (3)
abstracting: (NADPplus<=ADP)
states: 10,352 (4)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[E4P<=c2 | a2<=ADP]]
normalized: ~ [E [true U ~ [[E4P<=c2 | a2<=ADP]]]]

abstracting: (a2<=ADP)
states: 10,380 (4)
abstracting: (E4P<=c2)
states: 10,380 (4)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[start<=c1 | ~ [G6P<=Pyr]]]]
normalized: E [true U ~ [[~ [G6P<=Pyr] | start<=c1]]]

abstracting: (start<=c1)
states: 10,380 (4)
abstracting: (G6P<=Pyr)
states: 9,480 (3)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[[Gluc<=_3PG & 2<=c2] & 2<=Ru5P]]]
normalized: ~ [E [true U [[Gluc<=_3PG & 2<=c2] & 2<=Ru5P]]]

abstracting: (2<=Ru5P)
states: 48
abstracting: (2<=c2)
states: 9,522 (3)
abstracting: (Gluc<=_3PG)
states: 9,078 (3)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [[[NADplus<=Lac & Ru5P<=b1] | ~ [3<=NADplus]]]]
normalized: E [true U ~ [[~ [3<=NADplus] | [NADplus<=Lac & Ru5P<=b1]]]]

abstracting: (Ru5P<=b1)
states: 10,380 (4)
abstracting: (NADplus<=Lac)
states: 8,928 (3)
abstracting: (3<=NADplus)
states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[[c2<=GSSG & 2<=R5P] & ~ [2<=Xu5P]] & 3<=G6P]]
normalized: E [true U [3<=G6P & [~ [2<=Xu5P] & [c2<=GSSG & 2<=R5P]]]]

abstracting: (2<=R5P)
states: 0
abstracting: (c2<=GSSG)
states: 732
abstracting: (2<=Xu5P)
states: 6
abstracting: (3<=G6P)
states: 18
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[2<=E4P | ~ [GAP<=NADH]] & ~ [[_2PG<=Pi | 1<=_3PG]]]]
normalized: E [true U [[2<=E4P | ~ [GAP<=NADH]] & ~ [[_2PG<=Pi | 1<=_3PG]]]]

abstracting: (1<=_3PG)
states: 2,670 (3)
abstracting: (_2PG<=Pi)
states: 10,332 (4)
abstracting: (GAP<=NADH)
states: 8,658 (3)
abstracting: (2<=E4P)
states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[~ [[2<=start & F6P<=Pi]] | [~ [DHAP<=DHAP] & [3<=a2 & 1<=a2]]]]
normalized: ~ [E [true U ~ [[~ [[2<=start & F6P<=Pi]] | [[3<=a2 & 1<=a2] & ~ [DHAP<=DHAP]]]]]]

abstracting: (DHAP<=DHAP)
states: 10,380 (4)
abstracting: (1<=a2)
states: 3,576 (3)
abstracting: (3<=a2)
states: 0
abstracting: (F6P<=Pi)
states: 10,380 (4)
abstracting: (2<=start)
states: 0
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[~ [R5P<=GSH] | b2<=c2] & [[3<=start & 2<=NADplus] & [1<=F6P & 1<=c1]]]]
normalized: E [true U [[[3<=start & 2<=NADplus] & [1<=F6P & 1<=c1]] & [b2<=c2 | ~ [R5P<=GSH]]]]

abstracting: (R5P<=GSH)
states: 10,302 (4)
abstracting: (b2<=c2)
states: 9,984 (3)
abstracting: (1<=c1)
states: 10,320 (4)
abstracting: (1<=F6P)
states: 3,090 (3)
abstracting: (2<=NADplus)
states: 1,308 (3)
abstracting: (3<=start)
states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[[2<=start | 3<=GSH] & [2<=NADPH & 1<=c1]] & [[2<=PEP | 2<=c2] & ~ [c1<=_1_3_BPG]]]]
normalized: E [true U [[~ [c1<=_1_3_BPG] & [2<=PEP | 2<=c2]] & [[2<=NADPH & 1<=c1] & [2<=start | 3<=GSH]]]]

abstracting: (3<=GSH)
states: 0
abstracting: (2<=start)
states: 0
abstracting: (1<=c1)
states: 10,320 (4)
abstracting: (2<=NADPH)
states: 3,460 (3)
abstracting: (2<=c2)
states: 9,522 (3)
abstracting: (2<=PEP)
states: 420
abstracting: (c1<=_1_3_BPG)
states: 84
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[[2<=a2 | 1<=GAP] & [2<=ADP & 3<=b2]] & [[G6P<=_3PG & 1<=G6P] & b2<=Lac]]]
normalized: E [true U [[b2<=Lac & [G6P<=_3PG & 1<=G6P]] & [[2<=ADP & 3<=b2] & [2<=a2 | 1<=GAP]]]]

abstracting: (1<=GAP)
states: 5,058 (3)
abstracting: (2<=a2)
states: 108
abstracting: (3<=b2)
states: 96
abstracting: (2<=ADP)
states: 10,320 (4)
abstracting: (1<=G6P)
states: 1,236 (3)
abstracting: (G6P<=_3PG)
states: 9,420 (3)
abstracting: (b2<=Lac)
states: 8,886 (3)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 9695 (9.7e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 14298 30297 44595
used/not used/entry size/cache size: 34817 67074047 16 1024MB
basic ops cache: hits/miss/sum: 6213 22247 28460
used/not used/entry size/cache size: 34276 16742940 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: 1470 3284 4754
used/not used/entry size/cache size: 3284 8385324 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 67100110
1 8590
2 66
3 20
4 10
5 10
6 10
7 3
8 13
9 3
>= 10 29

Total processing time: 0m 6.765sec


BK_STOP 1494883462753

--------------------
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:446 (20), effective:99 (4)

initing FirstDep: 0m 0.000sec


iterations count:509 (23), effective:124 (5)

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-C0001N0000000001"
export BK_EXAMINATION="ReachabilityCardinality"
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-C0001N0000000001.tgz
mv S_GPPP-PT-C0001N0000000001 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-C0001N0000000001, examination is ReachabilityCardinality"
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-149441599100511"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;