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

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

=== Now, execution of the tool begins

BK_START 1465039092631


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_C0010N0000000100
(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.848sec


RS generation: 0m 0.333sec


-> reachability set: #nodes 22693 (2.3e+04) #states 176,894,515,156 (11)



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

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

abstracting: (1<=NADPplus) states: 176,894,515,156 (11)
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

abstracting: (NADPplus<=_1_3_BPG) states: 0
-> the formula is FALSE

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

MC time: 0m 0.799sec

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

abstracting: (E4P<=GSSG) states: 176,894,515,156 (11)
-> the formula is TRUE

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

MC time: 0m 0.320sec

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

abstracting: (NADPplus<=GAP) states: 0
-> the formula is FALSE

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

MC time: 0m 0.192sec

checking: AG [[1<=ADP | ~ [b1<=Gluc]]]
normalized: ~ [E [true U ~ [[1<=ADP | ~ [b1<=Gluc]]]]]

abstracting: (b1<=Gluc) states: 62,477,700,049 (10)
abstracting: (1<=ADP) states: 176,894,515,155 (11)
-> the formula is TRUE

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

MC time: 0m 0.095sec

checking: EF [[a2<=NADH & [1<=E4P & [1<=Lac & 2<=R5P]]]]
normalized: E [true U [a2<=NADH & [1<=E4P & [1<=Lac & 2<=R5P]]]]

abstracting: (2<=R5P) states: 21,307,716 (7)
abstracting: (1<=Lac) states: 88,737,764,562 (10)
abstracting: (1<=E4P) states: 18,278,637,408 (10)
abstracting: (a2<=NADH) states: 21,930,726,577 (10)
-> the formula is FALSE

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

MC time: 0m 0.314sec

checking: AG [[_1_3_BPG<=DHAP & [[b2<=ADP & 2<=Gluc] | ~ [2<=NADH]]]]
normalized: ~ [E [true U ~ [[_1_3_BPG<=DHAP & [~ [2<=NADH] | [b2<=ADP & 2<=Gluc]]]]]]

abstracting: (2<=Gluc) states: 115,433,700,053 (11)
abstracting: (b2<=ADP) states: 176,894,515,156 (11)
abstracting: (2<=NADH) states: 164,563,543,449 (11)
abstracting: (_1_3_BPG<=DHAP) states: 117,153,484,818 (11)
-> the formula is FALSE

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

MC time: 0m 3.755sec

checking: AG [[~ [b1<=start] | [[Xu5P<=GSH & 3<=b2] | 3<=start]]]
normalized: ~ [E [true U ~ [[[3<=start | [Xu5P<=GSH & 3<=b2]] | ~ [b1<=start]]]]]

abstracting: (b1<=start) states: 18,148,483,154 (10)
abstracting: (3<=b2) states: 162,108,269,774 (11)
abstracting: (Xu5P<=GSH) states: 133,514,351,182 (11)
abstracting: (3<=start) states: 0
-> the formula is FALSE

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

MC time: 0m 0.612sec

checking: AG [[[[GAP<=a1 | S7P<=GSH] | [3<=b2 & 3<=ATP]] | 2<=NADPH]]
normalized: ~ [E [true U ~ [[2<=NADPH | [[3<=b2 & 3<=ATP] | [GAP<=a1 | S7P<=GSH]]]]]]

abstracting: (S7P<=GSH) states: 174,946,729,576 (11)
abstracting: (GAP<=a1) states: 166,946,718,271 (11)
abstracting: (3<=ATP) states: 176,894,515,156 (11)
abstracting: (3<=b2) states: 162,108,269,774 (11)
abstracting: (2<=NADPH) states: 165,281,509,554 (11)
-> the formula is FALSE

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

MC time: 0m 0.640sec

checking: AG [[[[FBP<=R5P | 3<=F6P] & [NADPplus<=GSH | 2<=G6P]] | E4P<=Gluc]]
normalized: ~ [E [true U ~ [[E4P<=Gluc | [[NADPplus<=GSH | 2<=G6P] & [FBP<=R5P | 3<=F6P]]]]]]

abstracting: (3<=F6P) states: 1,007,382,725 (9)
abstracting: (FBP<=R5P) states: 141,142,373,118 (11)
abstracting: (2<=G6P) states: 115,433,700,053 (11)
abstracting: (NADPplus<=GSH) states: 0
abstracting: (E4P<=Gluc) states: 173,243,788,711 (11)
-> the formula is FALSE

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

MC time: 0m 1.142sec

checking: EF [[~ [GSH<=FBP] & [[2<=NADH & 1<=NADH] & [b2<=G6P & NADPH<=c1]]]]
normalized: E [true U [[[b2<=G6P & NADPH<=c1] & [2<=NADH & 1<=NADH]] & ~ [GSH<=FBP]]]

abstracting: (GSH<=FBP) states: 6,105,219,806 (9)
abstracting: (1<=NADH) states: 173,895,183,134 (11)
abstracting: (2<=NADH) states: 164,563,543,449 (11)
abstracting: (NADPH<=c1) states: 35,664,723,046 (10)
abstracting: (b2<=G6P) states: 33,210,459,172 (10)
-> the formula is TRUE

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

MC time: 0m 3.183sec

checking: AG [[[[R5P<=GSH | Pyr<=a1] | [3<=Gluc & 2<=_2PG]] & Lac<=R5P]]
normalized: ~ [E [true U ~ [[Lac<=R5P & [[3<=Gluc & 2<=_2PG] | [R5P<=GSH | Pyr<=a1]]]]]]

abstracting: (Pyr<=a1) states: 166,966,169,583 (11)
abstracting: (R5P<=GSH) states: 175,873,276,671 (11)
abstracting: (2<=_2PG) states: 42,253,162,933 (10)
abstracting: (3<=Gluc) states: 91,520,899,515 (10)
abstracting: (Lac<=R5P) states: 97,049,725,825 (10)
-> the formula is FALSE

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

MC time: 0m 1.588sec

checking: EF [[[[E4P<=NADH & 1<=Ru5P] & Pi<=E4P] & [3<=GSH & ~ [NADH<=NADPH]]]]
normalized: E [true U [[3<=GSH & ~ [NADH<=NADPH]] & [Pi<=E4P & [E4P<=NADH & 1<=Ru5P]]]]

abstracting: (1<=Ru5P) states: 165,852,883,910 (11)
abstracting: (E4P<=NADH) states: 176,240,701,096 (11)
abstracting: (Pi<=E4P) states: 1
abstracting: (NADH<=NADPH) states: 151,617,434,456 (11)
abstracting: (3<=GSH) states: 165,281,509,554 (11)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.376sec

checking: EF [[[~ [_3PG<=G6P] | [2<=S7P & 1<=_1_3_BPG]] & [[ADP<=_2PG & a1<=GSSG] | 2<=E4P]]]
normalized: E [true U [[2<=E4P | [ADP<=_2PG & a1<=GSSG]] & [[2<=S7P & 1<=_1_3_BPG] | ~ [_3PG<=G6P]]]]

abstracting: (_3PG<=G6P) states: 148,802,176,185 (11)
abstracting: (1<=_1_3_BPG) states: 88,737,764,562 (10)
abstracting: (2<=S7P) states: 41,080,788 (7)
abstracting: (a1<=GSSG) states: 176,894,515,156 (11)
abstracting: (ADP<=_2PG) states: 1
abstracting: (2<=E4P) states: 0
-> the formula is FALSE

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

MC time: 0m 0.313sec

checking: AG [[[Pyr<=c2 & [1<=b1 | DHAP<=_3PG]] | [[FBP<=c2 & Pyr<=F6P] & _3PG<=S7P]]]
normalized: ~ [E [true U ~ [[[Pyr<=c2 & [1<=b1 | DHAP<=_3PG]] | [_3PG<=S7P & [FBP<=c2 & Pyr<=F6P]]]]]]

abstracting: (Pyr<=F6P) states: 99,933,137,541 (10)
abstracting: (FBP<=c2) states: 176,814,257,332 (11)
abstracting: (_3PG<=S7P) states: 105,003,303,034 (11)
abstracting: (DHAP<=_3PG) states: 117,000,039,124 (11)
abstracting: (1<=b1) states: 158,746,032,002 (11)
abstracting: (Pyr<=c2) states: 176,894,515,156 (11)
-> the formula is FALSE

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

MC time: 0m 0.744sec

checking: EF [[[[3<=PEP | b2<=start] & [2<=F6P | a2<=Pi]] & [~ [Pyr<=FBP] | [b1<=Xu5P | 3<=E4P]]]]
normalized: E [true U [[[b1<=Xu5P | 3<=E4P] | ~ [Pyr<=FBP]] & [[2<=F6P | a2<=Pi] & [3<=PEP | b2<=start]]]]

abstracting: (b2<=start) states: 5,146,696,922 (9)
abstracting: (3<=PEP) states: 18,901,419,205 (10)
abstracting: (a2<=Pi) states: 176,894,515,156 (11)
abstracting: (2<=F6P) states: 7,857,629,358 (9)
abstracting: (Pyr<=FBP) states: 99,933,137,541 (10)
abstracting: (3<=E4P) states: 0
abstracting: (b1<=Xu5P) states: 120,913,583,186 (11)
-> the formula is TRUE

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

MC time: 0m 2.386sec


Total processing time: 0m23.719sec


BK_STOP 1465039116399

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

16448
iterations count:1481 (67), effective:355 (16)

initing FirstDep: 0m 0.000sec


iterations count:726 (33), effective:115 (5)

iterations count:819 (37), effective:154 (7)

iterations count:981 (44), effective:227 (10)

iterations count:798 (36), effective:108 (4)

iterations count:922 (41), effective:185 (8)

iterations count:190 (8), effective:39 (1)

iterations count:780 (35), effective:120 (5)

iterations count:809 (36), effective:133 (6)

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