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

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

=== Now, execution of the tool begins

BK_START 1494883530912

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_C0001N0000000100
(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.210sec

parse successfull
net created successfully

Net: GPPP_PT_C0001N0000000100
(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 4.061sec


RS generation: 0m 0.223sec


-> reachability set: #nodes 1358 (1.4e+03) #states 145,476,966 (8)



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

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

abstracting: (Lac<=c1)
states: 145,476,966 (8)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EF [~ [~ [[1<=Lac & 1<=a1]]]]
normalized: E [true U [1<=Lac & 1<=a1]]

abstracting: (1<=a1)
states: 144,867,936 (8)
abstracting: (1<=Lac)
states: 61,552,632 (7)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000100-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

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

abstracting: (Lac<=c1)
states: 145,476,966 (8)
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

abstracting: (_2PG<=_2PG)
states: 145,476,966 (8)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [[G6P<=NADH | DHAP<=GSSG]]
normalized: ~ [E [true U ~ [[G6P<=NADH | DHAP<=GSSG]]]]

abstracting: (DHAP<=GSSG)
states: 144,480,810 (8)
abstracting: (G6P<=NADH)
states: 143,609,274 (8)
-> the formula is FALSE

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

MC time: 0m 0.891sec

checking: AG [~ [[~ [GSH<=NADPplus] & ~ [GAP<=NADPH]]]]
normalized: ~ [E [true U [~ [GAP<=NADPH] & ~ [GSH<=NADPplus]]]]

abstracting: (GSH<=NADPplus)
states: 73,100,366 (7)
abstracting: (GAP<=NADPH)
states: 144,976,410 (8)
-> the formula is FALSE

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

MC time: 0m 1.195sec

checking: AG [~ [[~ [3<=GSH] & [R5P<=Xu5P & 1<=Pyr]]]]
normalized: ~ [E [true U [[R5P<=Xu5P & 1<=Pyr] & ~ [3<=GSH]]]]

abstracting: (3<=GSH)
states: 142,596,234 (8)
abstracting: (1<=Pyr)
states: 61,552,632 (7)
abstracting: (R5P<=Xu5P)
states: 144,867,936 (8)
-> the formula is FALSE

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

MC time: 0m 0.050sec

checking: EF [[[3<=_1_3_BPG | [1<=_3PG & 1<=ATP]] & 2<=Lac]]
normalized: E [true U [2<=Lac & [3<=_1_3_BPG | [1<=_3PG & 1<=ATP]]]]

abstracting: (1<=ATP)
states: 145,476,966 (8)
abstracting: (1<=_3PG)
states: 61,552,632 (7)
abstracting: (3<=_1_3_BPG)
states: 8,871,537 (6)
abstracting: (2<=Lac)
states: 24,523,608 (7)
-> the formula is TRUE

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

MC time: 0m 0.103sec

checking: EF [~ [[~ [GSSG<=E4P] | [NADPH<=DHAP | 3<=NADplus]]]]
normalized: E [true U ~ [[[NADPH<=DHAP | 3<=NADplus] | ~ [GSSG<=E4P]]]]

abstracting: (GSSG<=E4P)
states: 1,765,986 (6)
abstracting: (3<=NADplus)
states: 145,476,966 (8)
abstracting: (NADPH<=DHAP)
states: 1,224,322 (6)
-> the formula is FALSE

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

MC time: 0m 0.091sec

checking: AG [[~ [~ [Pi<=ATP]] & [~ [3<=E4P] & [2<=S7P | NADPH<=GSSG]]]]
normalized: ~ [E [true U ~ [[Pi<=ATP & [[2<=S7P | NADPH<=GSSG] & ~ [3<=E4P]]]]]]

abstracting: (3<=E4P)
states: 0
abstracting: (NADPH<=GSSG)
states: 36,912,066 (7)
abstracting: (2<=S7P)
states: 0
abstracting: (Pi<=ATP)
states: 145,476,966 (8)
-> the formula is FALSE

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

MC time: 0m 2.363sec

checking: EF [[[Pi<=G6P | [NADplus<=Ru5P | GAP<=GSSG]] & 2<=E4P]]
normalized: E [true U [2<=E4P & [Pi<=G6P | [NADplus<=Ru5P | GAP<=GSSG]]]]

abstracting: (GAP<=GSSG)
states: 144,480,810 (8)
abstracting: (NADplus<=Ru5P)
states: 0
abstracting: (Pi<=G6P)
states: 16,098,693 (7)
abstracting: (2<=E4P)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.042sec

checking: AG [[[[2<=_3PG | _1_3_BPG<=c2] | [Xu5P<=GSH & 2<=Gluc]] | ~ [[2<=FBP & 3<=GSSG]]]]
normalized: ~ [E [true U ~ [[~ [[2<=FBP & 3<=GSSG]] | [[2<=_3PG | _1_3_BPG<=c2] | [Xu5P<=GSH & 2<=Gluc]]]]]]

abstracting: (2<=Gluc)
states: 466,923 (5)
abstracting: (Xu5P<=GSH)
states: 145,389,933 (8)
abstracting: (_1_3_BPG<=c2)
states: 128,606,835 (8)
abstracting: (2<=_3PG)
states: 24,523,608 (7)
abstracting: (3<=GSSG)
states: 141,155,868 (8)
abstracting: (2<=FBP)
states: 2,842,140 (6)
-> the formula is TRUE

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

MC time: 0m 0.048sec

checking: AG [[[[1<=NADPplus & Lac<=GSSG] | _3PG<=ADP] | [[S7P<=Ru5P | 3<=start] | 1<=S7P]]]
normalized: ~ [E [true U ~ [[[1<=S7P | [S7P<=Ru5P | 3<=start]] | [_3PG<=ADP | [1<=NADPplus & Lac<=GSSG]]]]]]

abstracting: (Lac<=GSSG)
states: 144,499,302 (8)
abstracting: (1<=NADPplus)
states: 144,753,200 (8)
abstracting: (_3PG<=ADP)
states: 145,476,966 (8)
abstracting: (3<=start)
states: 0
abstracting: (S7P<=Ru5P)
states: 144,989,742 (8)
abstracting: (1<=S7P)
states: 649,632 (5)
-> the formula is TRUE

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

MC time: 0m 0.098sec

checking: EF [[[c1<=S7P & [3<=PEP | G6P<=GSH]] & ~ [[Ru5P<=a2 & Ru5P<=a2]]]]
normalized: E [true U [~ [[Ru5P<=a2 & Ru5P<=a2]] & [c1<=S7P & [3<=PEP | G6P<=GSH]]]]

abstracting: (G6P<=GSH)
states: 145,381,692 (8)
abstracting: (3<=PEP)
states: 8,871,537 (6)
abstracting: (c1<=S7P)
states: 1,948,896 (6)
abstracting: (Ru5P<=a2)
states: 144,867,936 (8)
abstracting: (Ru5P<=a2)
states: 144,867,936 (8)
-> the formula is FALSE

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

MC time: 0m 0.065sec

checking: EF [[[2<=_2PG & [3<=ATP & 2<=E4P]] & [[2<=Pyr & PEP<=c2] | [2<=F6P & Ru5P<=FBP]]]]
normalized: E [true U [[[2<=F6P & Ru5P<=FBP] | [2<=Pyr & PEP<=c2]] & [2<=_2PG & [3<=ATP & 2<=E4P]]]]

abstracting: (2<=E4P)
states: 0
abstracting: (3<=ATP)
states: 145,476,966 (8)
abstracting: (2<=_2PG)
states: 24,523,608 (7)
abstracting: (PEP<=c2)
states: 128,606,835 (8)
abstracting: (2<=Pyr)
states: 24,523,608 (7)
abstracting: (Ru5P<=FBP)
states: 137,011,449 (8)
abstracting: (2<=F6P)
states: 2,842,140 (6)
-> the formula is FALSE

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

MC time: 0m 0.012sec

checking: EF [[~ [[PEP<=c1 & NADH<=c2]] & [[1<=c1 | PEP<=GSSG] | [2<=E4P & 1<=GAP]]]]
normalized: E [true U [[[1<=c1 | PEP<=GSSG] | [2<=E4P & 1<=GAP]] & ~ [[PEP<=c1 & NADH<=c2]]]]

abstracting: (NADH<=c2)
states: 70,403,868 (7)
abstracting: (PEP<=c1)
states: 145,476,966 (8)
abstracting: (1<=GAP)
states: 62,770,692 (7)
abstracting: (2<=E4P)
states: 0
abstracting: (PEP<=GSSG)
states: 144,499,302 (8)
abstracting: (1<=c1)
states: 143,528,070 (8)
-> the formula is TRUE

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

MC time: 0m 0.342sec

totally nodes used: 590182 (5.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 12341739 1702346 14044085
used/not used/entry size/cache size: 2087349 65021515 16 1024MB
basic ops cache: hits/miss/sum: 1506113 1026641 2532754
used/not used/entry size/cache size: 1572902 15204314 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: 34608 24543 59151
used/not used/entry size/cache size: 24519 8364089 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 66678558
1 422152
2 6730
3 217
4 36
5 13
6 49
7 109
8 73
9 23
>= 10 904

Total processing time: 0m12.733sec


BK_STOP 1494883543742

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


iterations count:15790 (717), effective:3705 (168)

initing FirstDep: 0m 0.000sec


iterations count:158 (7), effective:31 (1)

iterations count:28191 (1281), effective:7067 (321)

iterations count:20549 (934), effective:5232 (237)

iterations count:366 (16), effective:131 (5)

iterations count:275 (12), effective:67 (3)

iterations count:14353 (652), effective:3570 (162)

iterations count:220 (10), effective:39 (1)

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-C0001N0000000100"
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-C0001N0000000100.tgz
mv S_GPPP-PT-C0001N0000000100 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-C0001N0000000100, 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-149441599100529"
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 ;