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

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

=== Now, execution of the tool begins

BK_START 1465038983185


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_C0010N0000000010
(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.086sec


RS generation: 0m 0.316sec


-> reachability set: #nodes 20770 (2.1e+04) #states 23,537,012,497 (10)



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

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

abstracting: (1<=Pyr) states: 11,749,328,724 (10)
-> the formula is FALSE

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

MC time: 0m 0.802sec

checking: AG [~ [[2<=F6P & 3<=GAP]]]
normalized: ~ [E [true U [2<=F6P & 3<=GAP]]]

abstracting: (3<=GAP) states: 2,188,180,872 (9)
abstracting: (2<=F6P) states: 929,022,765 (8)
-> the formula is FALSE

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

MC time: 0m 0.531sec

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

abstracting: (_3PG<=Pyr) states: 15,685,898,062 (10)
-> the formula is FALSE

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

MC time: 0m 0.789sec

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

abstracting: (Lac<=NADPH) states: 22,507,862,619 (10)
-> the formula is FALSE

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

MC time: 0m 5.742sec

checking: EF [~ [~ [NADPplus<=NADH]]]
normalized: E [true U NADPplus<=NADH]

abstracting: (NADPplus<=NADH) states: 5,828,594,991 (9)
-> the formula is TRUE

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

MC time: 0m 7.593sec

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

abstracting: (2<=E4P) states: 0
abstracting: (start<=NADPplus) states: 23,537,012,497 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.614sec

checking: EF [~ [[Pi<=Pyr | 2<=ADP]]]
normalized: E [true U ~ [[Pi<=Pyr | 2<=ADP]]]

abstracting: (2<=ADP) states: 23,537,012,496 (10)
abstracting: (Pi<=Pyr) states: 1
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: EF [~ [[~ [2<=E4P] | ~ [a2<=Gluc]]]]
normalized: E [true U ~ [[~ [a2<=Gluc] | ~ [2<=E4P]]]]

abstracting: (2<=E4P) states: 0
abstracting: (a2<=Gluc) states: 5,094,683,182 (9)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.531sec

checking: EF [~ [[[DHAP<=Pi & 3<=Pi] | [3<=a1 | 2<=G6P]]]]
normalized: E [true U ~ [[[3<=a1 | 2<=G6P] | [DHAP<=Pi & 3<=Pi]]]]

abstracting: (3<=Pi) states: 23,537,012,496 (10)
abstracting: (DHAP<=Pi) states: 23,537,012,497 (10)
abstracting: (2<=G6P) states: 17,181,791,883 (10)
abstracting: (3<=a1) states: 19,187,138,296 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.133sec

checking: AG [[~ [[c1<=NADPH | c1<=G6P]] | ~ [[2<=GAP & 2<=S7P]]]]
normalized: ~ [E [true U ~ [[~ [[c1<=NADPH | c1<=G6P]] | ~ [[2<=GAP & 2<=S7P]]]]]]

abstracting: (2<=S7P) states: 3,550,239 (6)
abstracting: (2<=GAP) states: 5,187,013,974 (9)
abstracting: (c1<=G6P) states: 10,145,768,382 (10)
abstracting: (c1<=NADPH) states: 17,412,060,630 (10)
-> the formula is TRUE

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

MC time: 0m 0.412sec

checking: AG [[[[c2<=Pyr | 2<=b2] | _1_3_BPG<=R5P] | Pyr<=Lac]]
normalized: ~ [E [true U ~ [[Pyr<=Lac | [_1_3_BPG<=R5P | [c2<=Pyr | 2<=b2]]]]]]

abstracting: (2<=b2) states: 22,281,685,228 (10)
abstracting: (c2<=Pyr) states: 34,476,052 (7)
abstracting: (_1_3_BPG<=R5P) states: 13,082,586,286 (10)
abstracting: (Pyr<=Lac) states: 15,572,014,597 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.398sec

checking: AG [[~ [~ [3<=ADP]] | [[Pyr<=Ru5P | FBP<=F6P] | [3<=NADH | 2<=GSH]]]]
normalized: ~ [E [true U ~ [[3<=ADP | [[3<=NADH | 2<=GSH] | [Pyr<=Ru5P | FBP<=F6P]]]]]]

abstracting: (FBP<=F6P) states: 19,156,844,692 (10)
abstracting: (Pyr<=Ru5P) states: 22,076,383,461 (10)
abstracting: (2<=GSH) states: 21,352,933,308 (10)
abstracting: (3<=NADH) states: 19,134,497,139 (10)
abstracting: (3<=ADP) states: 23,537,012,496 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.530sec

checking: AG [[[~ [Pi<=NADPplus] | [2<=_1_3_BPG | 1<=F6P]] | ~ [[Xu5P<=DHAP & 2<=G6P]]]]
normalized: ~ [E [true U ~ [[~ [[Xu5P<=DHAP & 2<=G6P]] | [[2<=_1_3_BPG | 1<=F6P] | ~ [Pi<=NADPplus]]]]]]

abstracting: (Pi<=NADPplus) states: 1
abstracting: (1<=F6P) states: 5,348,036,185 (9)
abstracting: (2<=_1_3_BPG) states: 5,177,216,316 (9)
abstracting: (2<=G6P) states: 17,181,791,883 (10)
abstracting: (Xu5P<=DHAP) states: 1,584,552,090 (9)
-> the formula is TRUE

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

MC time: 0m 0.401sec

checking: AG [[Ru5P<=NADplus | [~ [NADH<=c2] | [2<=FBP & b2<=Xu5P]]]]
normalized: ~ [E [true U ~ [[Ru5P<=NADplus | [[2<=FBP & b2<=Xu5P] | ~ [NADH<=c2]]]]]]

abstracting: (NADH<=c2) states: 23,537,012,497 (10)
abstracting: (b2<=Xu5P) states: 7,453,888,869 (9)
abstracting: (2<=FBP) states: 840,206,706 (8)
abstracting: (Ru5P<=NADplus) states: 18,885,120,175 (10)
-> the formula is FALSE

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

MC time: 0m 0.980sec

checking: EF [[[~ [FBP<=start] & [2<=FBP & 1<=Pyr]] | [[Gluc<=_2PG & 2<=S7P] & [2<=_3PG | a2<=_3PG]]]]
normalized: E [true U [[[2<=_3PG | a2<=_3PG] & [Gluc<=_2PG & 2<=S7P]] | [[2<=FBP & 1<=Pyr] & ~ [FBP<=start]]]]

abstracting: (FBP<=start) states: 18,351,376,669 (10)
abstracting: (1<=Pyr) states: 11,749,328,724 (10)
abstracting: (2<=FBP) states: 840,206,706 (8)
abstracting: (2<=S7P) states: 3,550,239 (6)
abstracting: (Gluc<=_2PG) states: 5,572,904,250 (9)
abstracting: (a2<=_3PG) states: 836,317,510 (8)
abstracting: (2<=_3PG) states: 5,421,202,446 (9)
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.047sec

checking: EF [[[[c1<=a1 | PEP<=GSSG] & [1<=F6P & Ru5P<=R5P]] & [[1<=Pi & 3<=b2] & ~ [NADH<=c1]]]]
normalized: E [true U [[~ [NADH<=c1] & [1<=Pi & 3<=b2]] & [[1<=F6P & Ru5P<=R5P] & [c1<=a1 | PEP<=GSSG]]]]

abstracting: (PEP<=GSSG) states: 21,677,152,894 (10)
abstracting: (c1<=a1) states: 15,006,847,236 (10)
abstracting: (Ru5P<=R5P) states: 2,071,601,665 (9)
abstracting: (1<=F6P) states: 5,348,036,185 (9)
abstracting: (3<=b2) states: 21,635,291,788 (10)
abstracting: (1<=Pi) states: 23,537,012,496 (10)
abstracting: (NADH<=c1) states: 23,537,012,497 (10)
-> the formula is FALSE

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

MC time: 0m 0.728sec


Total processing time: 0m27.820sec


BK_STOP 1465039011056

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

12435
iterations count:1541 (70), effective:367 (16)

initing FirstDep: 0m 0.000sec


iterations count:631 (28), effective:122 (5)

iterations count:910 (41), effective:182 (8)

iterations count:639 (29), effective:130 (5)

iterations count:759 (34), effective:197 (8)

iterations count:981 (44), effective:186 (8)

iterations count:975 (44), effective:198 (9)
70834
iterations count:1270 (57), effective:260 (11)

iterations count:879 (39), effective:181 (8)

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-C0010N0000000010"
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-C0010N0000000010.tgz
mv GPPP-PT-C0010N0000000010 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-C0010N0000000010, 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-146468027700493"
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 ;