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

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

=== Now, execution of the tool begins

BK_START 1465033903747


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

parse successfull
net created successfully

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


RS generation: 0m 0.153sec


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



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

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

abstracting: (3<=R5P) states: 0
.-> the formula is FALSE

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

MC time: 0m 0.000sec

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

abstracting: (NADPH<=c1) states: 3,768,916 (6)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.139sec

checking: EF [AF [GSSG<=E4P]]
normalized: E [true U ~ [EG [~ [GSSG<=E4P]]]]

abstracting: (GSSG<=E4P) states: 1,765,986 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.384sec

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

abstracting: (_3PG<=_3PG) states: 145,476,966 (8)
.-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (a1<=GSSG) states: 142,860,348 (8)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.342sec

checking: EF [~ [[1<=start | [1<=a2 | 1<=ATP]]]]
normalized: E [true U ~ [[1<=start | [1<=a2 | 1<=ATP]]]]

abstracting: (1<=ATP) states: 145,476,966 (8)
abstracting: (1<=a2) states: 26,066,484 (7)
abstracting: (1<=start) states: 20,301 (4)
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: EF [AG [[PEP<=R5P & 1<=NADplus]]]
normalized: E [true U ~ [E [true U ~ [[PEP<=R5P & 1<=NADplus]]]]]

abstracting: (1<=NADplus) states: 145,476,966 (8)
abstracting: (PEP<=R5P) states: 83,924,334 (7)
-> the formula is FALSE

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

MC time: 0m 0.043sec

checking: E [AX [_3PG<=NADPplus] U 3<=R5P]
normalized: E [~ [EX [~ [_3PG<=NADPplus]]] U 3<=R5P]

abstracting: (3<=R5P) states: 0
abstracting: (_3PG<=NADPplus) states: 144,985,702 (8)
.-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.134sec

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

abstracting: (FBP<=_2PG) states: 128,647,437 (8)
abstracting: (3<=Lac) states: 8,871,537 (6)
-> the formula is FALSE

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

MC time: 0m 0.069sec

checking: [Pyr<=Xu5P & AG [EG [PEP<=ATP]]]
normalized: [Pyr<=Xu5P & ~ [E [true U ~ [EG [PEP<=ATP]]]]]

abstracting: (PEP<=ATP) states: 145,476,966 (8)

EG iterations: 0
abstracting: (Pyr<=Xu5P) states: 85,913,832 (7)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [EG [[G6P<=F6P | NADPplus<=ATP]]]
normalized: ~ [E [true U ~ [EG [[G6P<=F6P | NADPplus<=ATP]]]]]

abstracting: (NADPplus<=ATP) states: 145,476,966 (8)
abstracting: (G6P<=F6P) states: 136,930,245 (8)

EG iterations: 0
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.278sec

checking: AG [[c2<=Ru5P | [3<=c2 & [1<=FBP | 2<=c2]]]]
normalized: ~ [E [true U ~ [[c2<=Ru5P | [3<=c2 & [1<=FBP | 2<=c2]]]]]]

abstracting: (2<=c2) states: 107,838,912 (8)
abstracting: (1<=FBP) states: 25,092,036 (7)
abstracting: (3<=c2) states: 82,259,652 (7)
abstracting: (c2<=Ru5P) states: 18,879,930 (7)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: E [[~ [ADP<=b1] | ~ [3<=R5P]] U [3<=NADH | ~ [1<=ATP]]]
normalized: E [[~ [3<=R5P] | ~ [ADP<=b1]] U [3<=NADH | ~ [1<=ATP]]]

abstracting: (1<=ATP) states: 145,476,966 (8)
abstracting: (3<=NADH) states: 98,216,238 (7)
abstracting: (ADP<=b1) states: 3,999,297 (6)
abstracting: (3<=R5P) states: 0
-> the formula is TRUE

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

MC time: 0m 0.090sec

checking: [EG [[~ [3<=_1_3_BPG] & ~ [1<=DHAP]]] & [Pyr<=Ru5P | A [3<=ATP U 3<=R5P]]]
normalized: [[Pyr<=Ru5P | [~ [EG [~ [3<=R5P]]] & ~ [E [~ [3<=R5P] U [~ [3<=R5P] & ~ [3<=ATP]]]]]] & EG [[~ [1<=DHAP] & ~ [3<=_1_3_BPG]]]]

abstracting: (3<=_1_3_BPG) states: 8,871,537 (6)
abstracting: (1<=DHAP) states: 62,770,692 (7)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 581
abstracting: (3<=ATP) states: 145,476,966 (8)
abstracting: (3<=R5P) states: 0
abstracting: (3<=R5P) states: 0
abstracting: (3<=R5P) states: 0

EG iterations: 0
abstracting: (Pyr<=Ru5P) states: 85,913,832 (7)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.601sec

checking: [EF [[3<=Pi & [GSH<=E4P | NADPH<=FBP]]] & EF [AF [GSSG<=Lac]]]
normalized: [E [true U ~ [EG [~ [GSSG<=Lac]]]] & E [true U [3<=Pi & [GSH<=E4P | NADPH<=FBP]]]]

abstracting: (NADPH<=FBP) states: 863,550 (5)
abstracting: (GSH<=E4P) states: 1,440,366 (6)
abstracting: (3<=Pi) states: 85,040,889 (7)
abstracting: (GSSG<=Lac) states: 2,418,030 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.627sec

checking: [[EF [[Pyr<=Ru5P & NADplus<=b1]] | ~ [~ [[2<=b1 & 2<=NADPH]]]] & 1<=start]
normalized: [1<=start & [[2<=b1 & 2<=NADPH] | E [true U [Pyr<=Ru5P & NADplus<=b1]]]]

abstracting: (NADplus<=b1) states: 0
abstracting: (Pyr<=Ru5P) states: 85,913,832 (7)
abstracting: (2<=NADPH) states: 144,029,434 (8)
abstracting: (2<=b1) states: 144,461,916 (8)
abstracting: (1<=start) states: 20,301 (4)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec


Total processing time: 0m 9.753sec


BK_STOP 1465033913544

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

1092 1181 1384 1145 1128 1217 1330 1177 1171 1200 1709 1811 1769 1769 1783
iterations count:15790 (717), effective:3705 (168)

initing FirstDep: 0m 0.000sec


iterations count:490 (22), effective:122 (5)
1287 1270 1295 1276 1305 1304 1322 1316 1330 1334 1318 1343 1320 1330 1319 1332 1323 1348 1329 1358 1357 1375 1369 1383 1433 1371 1396 1373
iterations count:28328 (1287), effective:7099 (322)
1312 1289 1299 1288 1304 1287 1317 1298 1327 1326 1344 1338 1352 1406 1340 1365 1340 1344 1341 1357 1340 1370 1351 1380 1377 1397 1391 1405
iterations count:28085 (1276), effective:7037 (319)

iterations count:171 (7), effective:38 (1)

iterations count:310 (14), effective:77 (3)

iterations count:339 (15), effective:82 (3)

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

iterations count:800 (36), effective:308 (14)
1316 1308 1357 1309 1324 1295 1329 1304 1310 1304 1326 1310 1339 1333 1346 1343 1361 1362 1362 1377 1348 1382 1357 1363 1357 1379
iterations count:26714 (1214), effective:6688 (304)

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-C0001N0000000100"
export BK_EXAMINATION="CTLCardinality"
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-C0001N0000000100.tgz
mv GPPP-PT-C0001N0000000100 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-C0001N0000000100, examination is CTLCardinality"
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-146468027600453"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;