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

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

=== Now, execution of the tool begins

BK_START 1465039456923


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_C0100N0000000010
(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.739sec


RS generation: 0m 0.234sec


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



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

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

abstracting: (3<=Pyr) states: 1,311,646,473 (9)
-> the formula is TRUE

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

MC time: 0m 1.677sec

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

abstracting: (2<=NADPplus) states: 12,967,632,465 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.484sec

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

abstracting: (2<=ATP) states: 12,124,876,903 (10)
-> the formula is FALSE

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

MC time: 0m 1.600sec

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

abstracting: (S7P<=ATP) states: 14,183,342,071 (10)
-> the formula is TRUE

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

MC time: 0m 0.293sec

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

abstracting: (2<=F6P) states: 304,702,569 (8)
abstracting: (3<=GAP) states: 836,074,380 (8)
-> the formula is TRUE

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

MC time: 0m 0.226sec

checking: AG [PEP<=a1]
normalized: ~ [E [true U ~ [PEP<=a1]]]

abstracting: (PEP<=a1) states: 14,089,499,985 (10)
-> the formula is FALSE

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

MC time: 0m 2.191sec

checking: AG [S7P<=a1]
normalized: ~ [E [true U ~ [S7P<=a1]]]

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

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

MC time: 0m 0.024sec

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

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

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

MC time: 0m 1.109sec

checking: EF [[[[2<=_2PG & 3<=GSSG] & ~ [3<=Xu5P]] & ~ [~ [1<=FBP]]]]
normalized: E [true U [1<=FBP & [~ [3<=Xu5P] & [2<=_2PG & 3<=GSSG]]]]

abstracting: (3<=GSSG) states: 10,455,225,550 (10)
abstracting: (2<=_2PG) states: 2,751,593,763 (9)
abstracting: (3<=Xu5P) states: 11,680,281,659 (10)
abstracting: (1<=FBP) states: 2,361,709,584 (9)
-> the formula is TRUE

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

MC time: 0m 0.574sec

checking: AG [[~ [[3<=Pyr & NADH<=c2]] | ~ [3<=Gluc]]]
normalized: ~ [E [true U ~ [[~ [3<=Gluc] | ~ [[3<=Pyr & NADH<=c2]]]]]]

abstracting: (NADH<=c2) states: 14,184,612,091 (10)
abstracting: (3<=Pyr) states: 1,311,646,473 (9)
abstracting: (3<=Gluc) states: 14,184,612,090 (10)
-> the formula is FALSE

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

MC time: 0m 0.189sec

checking: EF [[3<=_1_3_BPG & [Ru5P<=GAP | ~ [2<=c2]]]]
normalized: E [true U [3<=_1_3_BPG & [Ru5P<=GAP | ~ [2<=c2]]]]

abstracting: (2<=c2) states: 14,157,899,025 (10)
abstracting: (Ru5P<=GAP) states: 1,416,210,475 (9)
abstracting: (3<=_1_3_BPG) states: 834,149,406 (8)
-> the formula is TRUE

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

MC time: 0m 1.478sec

checking: EF [~ [[[1<=a1 | 2<=Lac] | [1<=NADH | PEP<=_1_3_BPG]]]]
normalized: E [true U ~ [[[1<=NADH | PEP<=_1_3_BPG] | [1<=a1 | 2<=Lac]]]]

abstracting: (2<=Lac) states: 3,188,955,627 (9)
abstracting: (1<=a1) states: 14,184,016,012 (10)
abstracting: (PEP<=_1_3_BPG) states: 9,494,143,882 (9)
abstracting: (1<=NADH) states: 13,838,382,921 (10)
-> the formula is FALSE

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

MC time: 0m 0.187sec

checking: EF [[3<=start & [[b2<=F6P | DHAP<=b1] & [3<=FBP | 1<=a2]]]]
normalized: E [true U [3<=start & [[3<=FBP | 1<=a2] & [b2<=F6P | DHAP<=b1]]]]

abstracting: (DHAP<=b1) states: 14,184,284,103 (10)
abstracting: (b2<=F6P) states: 42
abstracting: (1<=a2) states: 14,184,015,774 (10)
abstracting: (3<=FBP) states: 13,140,642 (7)
abstracting: (3<=start) states: 0
-> the formula is FALSE

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

MC time: 0m 0.163sec

checking: AG [[[[2<=PEP | 2<=_3PG] | Lac<=a1] | ~ [[NADH<=Xu5P | Lac<=PEP]]]]
normalized: ~ [E [true U ~ [[[Lac<=a1 | [2<=PEP | 2<=_3PG]] | ~ [[NADH<=Xu5P | Lac<=PEP]]]]]]

abstracting: (Lac<=PEP) states: 9,236,428,843 (9)
abstracting: (NADH<=Xu5P) states: 11,066,176,783 (10)
abstracting: (2<=_3PG) states: 2,751,593,763 (9)
abstracting: (2<=PEP) states: 2,751,593,763 (9)
abstracting: (Lac<=a1) states: 14,071,181,171 (10)
-> the formula is FALSE

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

MC time: 0m 2.141sec

checking: AG [[[[b2<=start | Pyr<=b2] | [2<=R5P | 1<=Gluc]] | [[3<=F6P | 3<=c2] | R5P<=Ru5P]]]
normalized: ~ [E [true U ~ [[[R5P<=Ru5P | [3<=F6P | 3<=c2]] | [[2<=R5P | 1<=Gluc] | [b2<=start | Pyr<=b2]]]]]]

abstracting: (Pyr<=b2) states: 14,184,612,091 (10)
abstracting: (b2<=start) states: 42
abstracting: (1<=Gluc) states: 14,184,612,090 (10)
abstracting: (2<=R5P) states: 0
abstracting: (3<=c2) states: 14,157,899,025 (10)
abstracting: (3<=F6P) states: 16,907,667 (7)
abstracting: (R5P<=Ru5P) states: 14,184,016,012 (10)
-> the formula is TRUE

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

MC time: 0m 0.352sec

checking: EF [[[[2<=S7P & _3PG<=a1] & _3PG<=G6P] & [[3<=NADPplus | DHAP<=FBP] | [ADP<=Pi | _1_3_BPG<=S7P]]]]
normalized: E [true U [[[ADP<=Pi | _1_3_BPG<=S7P] | [3<=NADPplus | DHAP<=FBP]] & [_3PG<=G6P & [2<=S7P & _3PG<=a1]]]]

abstracting: (_3PG<=a1) states: 14,089,499,985 (10)
abstracting: (2<=S7P) states: 0
abstracting: (_3PG<=G6P) states: 13,410,921,259 (10)
abstracting: (DHAP<=FBP) states: 8,745,564,727 (9)
abstracting: (3<=NADPplus) states: 12,344,443,070 (10)
abstracting: (_1_3_BPG<=S7P) states: 8,170,999,387 (9)
abstracting: (ADP<=Pi) states: 226
-> the formula is FALSE

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

MC time: 0m 0.537sec


Total processing time: 0m19.100sec


BK_STOP 1465039476066

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

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

initing FirstDep: 0m 0.000sec


iterations count:303 (13), effective:58 (2)

iterations count:980 (44), effective:219 (9)

iterations count:256 (11), effective:47 (2)

iterations count:277 (12), effective:47 (2)

iterations count:159 (7), effective:23 (1)

iterations count:453 (20), effective:95 (4)

iterations count:271 (12), effective:53 (2)

iterations count:303 (13), effective:58 (2)

iterations count:469 (21), effective:106 (4)

iterations count:496 (22), effective:113 (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="GPPP-PT-C0100N0000000010"
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-C0100N0000000010.tgz
mv GPPP-PT-C0100N0000000010 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-C0100N0000000010, 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-146468027800520"
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 ;