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

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

=== Now, execution of the tool begins

BK_START 1465059656018


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

parse successfull
net created successfully

Net: GPPP_PT_C1000N0000000010
(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.901sec


RS generation: 0m 0.207sec


-> reachability set: #nodes 19855 (2.0e+04) #states 14,184,612,091 (10)



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

checking: AG [2<=NADplus]
normalized: ~ [E [true U ~ [2<=NADplus]]]

abstracting: (2<=NADplus) states: 14,184,612,091 (10)
-> the formula is TRUE

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

MC time: 0m 0.016sec

checking: EF [GSSG<=Ru5P]
normalized: E [true U GSSG<=Ru5P]

abstracting: (GSSG<=Ru5P) states: 10,068,648,848 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.845sec

checking: EF [~ [[~ [2<=NADH] | 3<=a2]]]
normalized: E [true U ~ [[3<=a2 | ~ [2<=NADH]]]]

abstracting: (2<=NADH) states: 12,779,341,311 (10)
abstracting: (3<=a2) states: 14,184,015,774 (10)
-> the formula is FALSE

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

MC time: 0m 0.061sec

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

abstracting: (a2<=b2) states: 14,184,612,091 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.387sec

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

abstracting: (Pyr<=a2) states: 14,184,612,091 (10)
-> the formula is FALSE

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

MC time: 0m 0.670sec

checking: AG [[[start<=E4P | 3<=E4P] | 2<=b1]]
normalized: ~ [E [true U ~ [[2<=b1 | [start<=E4P | 3<=E4P]]]]]

abstracting: (3<=E4P) states: 0
abstracting: (start<=E4P) states: 14,184,612,090 (10)
abstracting: (2<=b1) states: 14,184,609,603 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: AG [[[2<=a2 | [NADPH<=Pyr & 3<=_1_3_BPG]] | ~ [2<=NADH]]]
normalized: ~ [E [true U ~ [[~ [2<=NADH] | [2<=a2 | [NADPH<=Pyr & 3<=_1_3_BPG]]]]]]

abstracting: (3<=_1_3_BPG) states: 834,149,406 (8)
abstracting: (NADPH<=Pyr) states: 1,327,809,215 (9)
abstracting: (2<=a2) states: 14,184,015,774 (10)
abstracting: (2<=NADH) states: 12,779,341,311 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.427sec

checking: AG [~ [[[2<=NADplus & 2<=FBP] & [3<=GSH | NADPH<=c1]]]]
normalized: ~ [E [true U [[2<=NADplus & 2<=FBP] & [3<=GSH | NADPH<=c1]]]]

abstracting: (NADPH<=c1) states: 4,060,533,758 (9)
abstracting: (3<=GSH) states: 11,516,811,781 (10)
abstracting: (2<=FBP) states: 259,021,446 (8)
abstracting: (2<=NADplus) states: 14,184,612,091 (10)
-> the formula is FALSE

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

MC time: 11m23.417sec

checking: EF [~ [[[2<=GSH | c2<=FBP] | [2<=NADplus & _3PG<=S7P]]]]
normalized: E [true U ~ [[[2<=NADplus & _3PG<=S7P] | [2<=GSH | c2<=FBP]]]]

abstracting: (c2<=FBP) states: 26,713,066 (7)
abstracting: (2<=GSH) states: 12,846,993,996 (10)
abstracting: (_3PG<=S7P) states: 7,689,563,938 (9)
abstracting: (2<=NADplus) states: 14,184,612,091 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 20m16.764sec

checking: AG [[1<=FBP | [[FBP<=Gluc | _2PG<=GAP] & ~ [NADPplus<=_3PG]]]]
normalized: ~ [E [true U ~ [[1<=FBP | [~ [NADPplus<=_3PG] & [FBP<=Gluc | _2PG<=GAP]]]]]]

abstracting: (_2PG<=GAP) states: 9,494,143,882 (9)
abstracting: (FBP<=Gluc) states: 14,184,612,091 (10)
abstracting: (NADPplus<=_3PG) states: 1,075,044,778 (9)
abstracting: (1<=FBP) states: 2,361,709,584 (9)
-> the formula is FALSE

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

MC time: 2m24.037sec

checking: AG [[~ [[3<=b2 & 2<=R5P]] | [G6P<=NADPplus & [GSH<=c2 | 2<=Ru5P]]]]
normalized: ~ [E [true U ~ [[[G6P<=NADPplus & [GSH<=c2 | 2<=Ru5P]] | ~ [[3<=b2 & 2<=R5P]]]]]]

abstracting: (2<=R5P) states: 0
abstracting: (3<=b2) states: 14,184,612,049 (10)
abstracting: (2<=Ru5P) states: 12,506,821,809 (10)

before gc: list nodes free: 617805

after gc: idd nodes used:23292, unused:63976708; list nodes free:398271955
abstracting: (GSH<=c2) states: 14,160,460,921 (10)
abstracting: (G6P<=NADPplus) states: 8,318,917,968 (9)
-> the formula is TRUE

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

MC time: 12m29.281sec

checking: AG [[GSSG<=a1 | [[Ru5P<=Ru5P & GSSG<=b2] & ~ [ATP<=F6P]]]]
normalized: ~ [E [true U ~ [[GSSG<=a1 | [~ [ATP<=F6P] & [Ru5P<=Ru5P & GSSG<=b2]]]]]]

abstracting: (GSSG<=b2) states: 14,184,612,049 (10)
abstracting: (Ru5P<=Ru5P) states: 14,184,612,091 (10)
abstracting: (ATP<=F6P) states: 1,262,157,028 (9)
abstracting: (GSSG<=a1) states: 11,348,885,257 (10)

BK_TIME_CONFINEMENT_REACHED

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

12422
iterations count:1727 (78), effective:414 (18)

initing FirstDep: 0m 0.000sec

21988
iterations count:1293 (58), effective:282 (12)

iterations count:290 (13), effective:53 (2)

iterations count:206 (9), effective:38 (1)
65041
iterations count:1335 (60), effective:296 (13)

iterations count:319 (14), effective:63 (2)

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-C1000N0000000010"
export BK_EXAMINATION="ReachabilityCardinality"
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-C1000N0000000010.tgz
mv GPPP-PT-C1000N0000000010 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-C1000N0000000010, 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 r221su-smll-146468027900565"
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 ;