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)
...................................
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is GPPP-PT-C0001N0000000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r090-blw7-152650001200255
=====================================================================

--------------------
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-00
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-09
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

=== Now, execution of the tool begins

BK_START 1527066406094


BK_STOP 1527066423765

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using GPPP-PT-C0001N0000000100 as instance name.
Using GPPP as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 23404, 'Memory': 8125.26, 'Tool': 'marcie'}, {'Time': 23459, 'Memory': 8125.51, 'Tool': 'marcie'}, {'Time': 102257, 'Memory': 192.61, 'Tool': 'gspn'}, {'Time': 105949, 'Memory': 220.61, 'Tool': 'gspn'}, {'Time': 383668, 'Memory': 7434.19, 'Tool': 'lola'}, {'Time': 416044, 'Memory': 7434.3, 'Tool': 'lola'}, {'Time': 590841, 'Memory': 2732.16, 'Tool': 'itstools'}, {'Time': 637746, 'Memory': 2697.03, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'gspn'}].
Learned tool gspn is 4.369210391386088x far from the best tool marcie.
CTLCardinality marcie GPPP-PT-C0001N0000000100...
timeout --kill-after=10s --signal=SIGINT 1m for testing only
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


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=CTLCardinality.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.392sec

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

check for maximal unmarked siphon
parse successfull
net created successfully

Net: GPPP_PT_C0001N0000000100
(NrP: 33 NrTr: 22 NrArc: 83)

ok
check for constant places
ok
check if there are places and transitions
ok
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

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

net check time: 0m 0.000sec

init dd package: 0m 4.040sec


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

RS generation: 0m 0.092sec


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



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


initing FirstDep: 0m 0.000sec


iterations count:372 (16), effective:88 (4)
checking: AG [EF [[1<=E4P & 1<=G6P]]]
normalized: ~ [E [true U ~ [E [true U [1<=E4P & 1<=G6P]]]]]

abstracting: (1<=G6P)
states: 9,480,567 (6)
abstracting: (1<=E4P)
states: 32,887,620 (7)
-> the formula is TRUE

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

MC time: 0m 0.101sec

checking: AX [[EF [3<=_1_3_BPG] | EG [2<=S7P]]]
normalized: ~ [EX [~ [[EG [2<=S7P] | E [true U 3<=_1_3_BPG]]]]]

abstracting: (3<=_1_3_BPG)
states: 8,871,537 (6)

iterations count:296 (13), effective:71 (3)
abstracting: (2<=S7P)
states: 0
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 0.076sec

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

abstracting: (NADPplus<=b1)
states: 2,796,488 (6)

iterations count:19184 (872), effective:4690 (213)
-> the formula is TRUE

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

MC time: 0m 1.475sec

checking: _1_3_BPG<=GSH
normalized: _1_3_BPG<=GSH


iterations count:202 (9), effective:43 (1)
abstracting: (_1_3_BPG<=GSH)
states: 144,771,858 (8)
-> the formula is TRUE

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

MC time: 0m 0.042sec

checking: AX [E [_1_3_BPG<=b2 U 2<=Pyr]]
normalized: ~ [EX [~ [E [_1_3_BPG<=b2 U 2<=Pyr]]]]

abstracting: (2<=Pyr)
states: 24,523,608 (7)
abstracting: (_1_3_BPG<=b2)
states: 87,903,330 (7)

iterations count:19579 (889), effective:4790 (217)
.-> the formula is TRUE

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

MC time: 0m 0.054sec

checking: AF [AG [[Pyr<=Xu5P | 1<=NADPplus]]]
normalized: ~ [EG [E [true U ~ [[Pyr<=Xu5P | 1<=NADPplus]]]]]

abstracting: (1<=NADPplus)
states: 144,753,200 (8)
abstracting: (Pyr<=Xu5P)
states: 85,913,832 (7)

iterations count:242 (11), effective:65 (2)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 1.407sec

checking: EF [AG [[c2<=DHAP | 1<=a2]]]
normalized: E [true U ~ [E [true U ~ [[c2<=DHAP | 1<=a2]]]]]

abstracting: (1<=a2)
states: 26,066,484 (7)
abstracting: (c2<=DHAP)
states: 37,638,054 (7)

iterations count:14072 (639), effective:3500 (159)

iterations count:22 (1), effective:0 (0)
-> the formula is FALSE

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

MC time: 0m 0.037sec

checking: AG [[G6P<=ATP | ~ [~ [3<=PEP]]]]
normalized: ~ [E [true U ~ [[G6P<=ATP | 3<=PEP]]]]

abstracting: (3<=PEP)
states: 8,871,537 (6)
abstracting: (G6P<=ATP)
states: 145,476,966 (8)
-> the formula is TRUE

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

MC time: 0m 0.253sec

checking: [EF [AX [GSSG<=NADPH]] | ~ [~ [AX [2<=GSH]]]]
normalized: [~ [EX [~ [2<=GSH]]] | E [true U ~ [EX [~ [GSSG<=NADPH]]]]]

abstracting: (GSSG<=NADPH)
states: 109,288,666 (8)
.abstracting: (2<=GSH)
states: 144,036,600 (8)
.-> the formula is TRUE

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

MC time: 0m 1.066sec

checking: E [EG [_2PG<=NADplus] U AG [G6P<=ADP]]
normalized: E [EG [_2PG<=NADplus] U ~ [E [true U ~ [G6P<=ADP]]]]

abstracting: (G6P<=ADP)
states: 145,476,966 (8)
abstracting: (_2PG<=NADplus)
states: 145,476,966 (8)

EG iterations: 0

iterations count:19204 (872), effective:4695 (213)
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: AG [[EX [a1<=start] | EF [NADPplus<=Pyr]]]
normalized: ~ [E [true U ~ [[E [true U NADPplus<=Pyr] | EX [a1<=start]]]]]

abstracting: (a1<=start)
states: 609,030 (5)
.abstracting: (NADPplus<=Pyr)
states: 1,215,030 (6)

iterations count:28122 (1278), effective:7000 (318)
-> the formula is TRUE

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

MC time: 0m 1.512sec

checking: EF [~ [[[2<=R5P | 2<=NADPplus] | ~ [F6P<=ADP]]]]
normalized: E [true U ~ [[[2<=R5P | 2<=NADPplus] | ~ [F6P<=ADP]]]]

abstracting: (F6P<=ADP)
states: 145,476,966 (8)
abstracting: (2<=NADPplus)
states: 144,029,434 (8)
abstracting: (2<=R5P)
states: 0

iterations count:172 (7), effective:28 (1)
-> the formula is TRUE

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

MC time: 0m 1.941sec

checking: AG [~ [[[NADPH<=F6P & Pi<=Xu5P] & ~ [a2<=Ru5P]]]]
normalized: ~ [E [true U [~ [a2<=Ru5P] & [NADPH<=F6P & Pi<=Xu5P]]]]

abstracting: (Pi<=Xu5P)
states: 16,098,693 (7)
abstracting: (NADPH<=F6P)
states: 863,550 (5)
abstracting: (a2<=Ru5P)
states: 127,997,805 (8)
-> the formula is TRUE

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

MC time: 0m 0.048sec

checking: [1<=_2PG | [~ [AG [3<=NADplus]] & [AG [1<=c2] | [DHAP<=b1 & ~ [GSSG<=NADPH]]]]]
normalized: [1<=_2PG | [[[DHAP<=b1 & ~ [GSSG<=NADPH]] | ~ [E [true U ~ [1<=c2]]]] & E [true U ~ [3<=NADplus]]]]

abstracting: (3<=NADplus)
states: 145,476,966 (8)
abstracting: (1<=c2)
states: 126,597,036 (8)
abstracting: (GSSG<=NADPH)
states: 109,288,666 (8)
abstracting: (DHAP<=b1)
states: 142,025,796 (8)
abstracting: (1<=_2PG)
states: 61,552,632 (7)
-> the formula is FALSE

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

MC time: 0m 0.029sec

checking: EF [~ [[[Pyr<=c1 | NADplus<=E4P] & [_2PG<=c1 | S7P<=F6P]]]]
normalized: E [true U ~ [[[Pyr<=c1 | NADplus<=E4P] & [_2PG<=c1 | S7P<=F6P]]]]

abstracting: (S7P<=F6P)
states: 144,989,742 (8)
abstracting: (_2PG<=c1)
states: 145,476,966 (8)
abstracting: (NADplus<=E4P)
states: 0
abstracting: (Pyr<=c1)
states: 145,476,966 (8)
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: [~ [2<=GSSG] | [[[[Pi<=Pi & 1<=DHAP] | 2<=Pyr] | [[b1<=S7P & start<=Xu5P] | Pyr<=_1_3_BPG]] | EG [[2<=Gluc | Pi<=_1_3_BPG]]]]
normalized: [[EG [[2<=Gluc | Pi<=_1_3_BPG]] | [[Pyr<=_1_3_BPG | [b1<=S7P & start<=Xu5P]] | [2<=Pyr | [Pi<=Pi & 1<=DHAP]]]] | ~ [2<=GSSG]]

abstracting: (2<=GSSG)
states: 142,596,234 (8)
abstracting: (1<=DHAP)
states: 62,770,692 (7)
abstracting: (Pi<=Pi)
states: 145,476,966 (8)
abstracting: (2<=Pyr)
states: 24,523,608 (7)
abstracting: (start<=Xu5P)
states: 145,456,665 (8)
abstracting: (b1<=S7P)
states: 406,020 (5)
abstracting: (Pyr<=_1_3_BPG)
states: 101,789,214 (8)
abstracting: (Pi<=_1_3_BPG)
states: 33,476,349 (7)
abstracting: (2<=Gluc)
states: 466,923 (5)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.011sec

totally nodes used: 2858247 (2.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 22177415 10012421 32189836
used/not used/entry size/cache size: 11477373 55631491 16 1024MB
basic ops cache: hits/miss/sum: 3431128 3176517 6607645
used/not used/entry size/cache size: 3778291 12998925 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: 27267 14386 41653
used/not used/entry size/cache size: 14372 8374236 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 64550633
1 2454597
2 99536
3 2446
4 73
5 34
6 255
7 125
8 11
9 12
>= 10 1142

Total processing time: 0m15.051sec

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="irma4mcc-full"
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/GPPP-PT-C0001N0000000100.tgz
mv GPPP-PT-C0001N0000000100 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
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 4"
echo " Run identifier is r090-blw7-152650001200255"
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 ;