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_ResAllocation-PT-R003C020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r141-csrt-149443423900093
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495085050489

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

parse successfull
net created successfully

Net: ResAllocation_PT_R003C020
(NrP: 120 NrTr: 80 NrArc: 354)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 1.369sec


RS generation: 0m 0.009sec


-> reachability set: #nodes 436 (4.4e+02) #states 406,454,747,136 (11)



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

checking: EF [~ [AF [1<=r_12_1]]]
normalized: E [true U EG [~ [1<=r_12_1]]]

abstracting: (1<=r_12_1)
states: 196,834,525,184 (11)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: EF [~ [p_19_0<=r_12_2]]
normalized: E [true U ~ [p_19_0<=r_12_2]]

abstracting: (p_19_0<=r_12_2)
states: 344,705,703,936 (11)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: AG [EF [~ [p_17_2<=p_10_2]]]
normalized: ~ [E [true U ~ [E [true U ~ [p_17_2<=p_10_2]]]]]

abstracting: (p_17_2<=p_10_2)
states: 259,511,205,888 (11)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AX [[AX [p_3_1<=p_19_2] | AF [3<=r_14_2]]]
normalized: ~ [EX [~ [[~ [EG [~ [3<=r_14_2]]] | ~ [EX [~ [p_3_1<=p_19_2]]]]]]]

abstracting: (p_3_1<=p_19_2)
states: 355,558,801,408 (11)
.abstracting: (3<=r_14_2)
states: 0

EG iterations: 0
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: [A [~ [2<=p_17_1] U 1<=r_10_2] & EX [AG [p_15_2<=r_19_1]]]
normalized: [EX [~ [E [true U ~ [p_15_2<=r_19_1]]]] & [~ [EG [~ [1<=r_10_2]]] & ~ [E [~ [1<=r_10_2] U [2<=p_17_1 & ~ [1<=r_10_2]]]]]]

abstracting: (1<=r_10_2)
states: 195,306,209,280 (11)
abstracting: (2<=p_17_1)
states: 0
abstracting: (1<=r_10_2)
states: 195,306,209,280 (11)
abstracting: (1<=r_10_2)
states: 195,306,209,280 (11)
...............................
EG iterations: 31
abstracting: (p_15_2<=r_19_1)
states: 340,770,971,648 (11)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.249sec

checking: EG [[[3<=p_1_2 | 1<=p_17_2] | p_17_2<=p_2_0]]
normalized: EG [[p_17_2<=p_2_0 | [3<=p_1_2 | 1<=p_17_2]]]

abstracting: (1<=p_17_2)
states: 168,774,516,736 (11)
abstracting: (3<=p_1_2)
states: 0
abstracting: (p_17_2<=p_2_0)
states: 307,759,939,584 (11)

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [[EG [2<=r_1_2] & [[1<=p_9_2 | 2<=r_12_1] | ~ [2<=r_18_1]]]]
normalized: ~ [EG [~ [[EG [2<=r_1_2] & [~ [2<=r_18_1] | [1<=p_9_2 | 2<=r_12_1]]]]]]

abstracting: (2<=r_12_1)
states: 0
abstracting: (1<=p_9_2)
states: 157,627,006,976 (11)
abstracting: (2<=r_18_1)
states: 0
abstracting: (2<=r_1_2)
states: 0
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[EF [r_13_1<=p_8_0] | ~ [~ [p_2_1<=p_16_1]]]]
normalized: ~ [E [true U ~ [[p_2_1<=p_16_1 | E [true U r_13_1<=p_8_0]]]]]

abstracting: (r_13_1<=p_8_0)
states: 285,377,019,904 (11)
abstracting: (p_2_1<=p_16_1)
states: 312,462,934,016 (11)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: [EX [EG [r_9_2<=p_4_1]] & [EF [3<=p_1_0] | EX [2<=r_7_2]]]
normalized: [[EX [2<=r_7_2] | E [true U 3<=p_1_0]] & EX [EG [r_9_2<=p_4_1]]]

abstracting: (r_9_2<=p_4_1)
states: 264,153,972,736 (11)
............................
EG iterations: 28
.abstracting: (3<=p_1_0)
states: 0
abstracting: (2<=r_7_2)
states: 0
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.229sec

checking: A [[1<=r_9_1 | r_15_2<=p_18_0] U EG [r_10_1<=r_12_1]]
normalized: [~ [E [~ [EG [r_10_1<=r_12_1]] U [~ [[1<=r_9_1 | r_15_2<=p_18_0]] & ~ [EG [r_10_1<=r_12_1]]]]] & ~ [EG [~ [EG [r_10_1<=r_12_1]]]]]

abstracting: (r_10_1<=r_12_1)
states: 297,289,064,448 (11)
.
EG iterations: 1
...............................
EG iterations: 31
abstracting: (r_10_1<=r_12_1)
states: 297,289,064,448 (11)
.
EG iterations: 1
abstracting: (r_15_2<=p_18_0)
states: 267,812,634,624 (11)
abstracting: (1<=r_9_1)
states: 197,799,903,232 (11)
abstracting: (r_10_1<=r_12_1)
states: 297,289,064,448 (11)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.252sec

checking: ~ [[~ [[~ [3<=p_11_2] & p_13_0<=r_19_0]] | EF [[r_7_2<=r_13_1 & 3<=r_2_2]]]]
normalized: ~ [[~ [[p_13_0<=r_19_0 & ~ [3<=p_11_2]]] | E [true U [r_7_2<=r_13_1 & 3<=r_2_2]]]]

abstracting: (3<=r_2_2)
states: 0
abstracting: (r_7_2<=r_13_1)
states: 306,190,954,496 (11)
abstracting: (3<=p_11_2)
states: 0
abstracting: (p_13_0<=r_19_0)
states: 389,763,727,360 (11)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [[[1<=r_8_0 | p_19_0<=r_18_2] & ~ [p_10_2<=r_15_1]] U AF [2<=r_12_1]]
normalized: E [[[1<=r_8_0 | p_19_0<=r_18_2] & ~ [p_10_2<=r_15_1]] U ~ [EG [~ [2<=r_12_1]]]]

abstracting: (2<=r_12_1)
states: 0

EG iterations: 0
abstracting: (p_10_2<=r_15_1)
states: 380,405,776,384 (11)
abstracting: (p_19_0<=r_18_2)
states: 347,371,839,488 (11)
abstracting: (1<=r_8_0)
states: 195,306,209,280 (11)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [AF [r_2_1<=p_0_1] U [[1<=p_11_0 & p_8_2<=r_1_0] & [r_5_1<=p_8_0 & 3<=r_9_1]]]
normalized: [~ [EG [~ [[[r_5_1<=p_8_0 & 3<=r_9_1] & [1<=p_11_0 & p_8_2<=r_1_0]]]]] & ~ [E [~ [[[r_5_1<=p_8_0 & 3<=r_9_1] & [1<=p_11_0 & p_8_2<=r_1_0]]] U [EG [~ [r_2_1<=p_0_1]] & ~ [[[r_5_1<=p_8_0 & 3<=r_9_1] & [1<=p_11_0 & p_8_2<=r_1_0]]]]]]]

abstracting: (p_8_2<=r_1_0)
states: 379,784,839,168 (11)
abstracting: (1<=p_11_0)
states: 53,550,645,248 (10)
abstracting: (3<=r_9_1)
states: 0
abstracting: (r_5_1<=p_8_0)
states: 281,442,205,696 (11)
abstracting: (r_2_1<=p_0_1)
states: 284,990,287,872 (11)
................................
EG iterations: 32
abstracting: (p_8_2<=r_1_0)
states: 379,784,839,168 (11)
abstracting: (1<=p_11_0)
states: 53,550,645,248 (10)
abstracting: (3<=r_9_1)
states: 0
abstracting: (r_5_1<=p_8_0)
states: 281,442,205,696 (11)
abstracting: (p_8_2<=r_1_0)
states: 379,784,839,168 (11)
abstracting: (1<=p_11_0)
states: 53,550,645,248 (10)
abstracting: (3<=r_9_1)
states: 0
abstracting: (r_5_1<=p_8_0)
states: 281,442,205,696 (11)

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.452sec

checking: E [[[1<=r_8_2 | p_16_1<=r_18_1] | [r_9_2<=p_10_2 & r_9_2<=p_19_2]] U EG [2<=r_5_2]]
normalized: E [[[r_9_2<=p_10_2 & r_9_2<=p_19_2] | [1<=r_8_2 | p_16_1<=r_18_1]] U EG [2<=r_5_2]]

abstracting: (2<=r_5_2)
states: 0
.
EG iterations: 1
abstracting: (p_16_1<=r_18_1)
states: 349,026,123,776 (11)
abstracting: (1<=r_8_2)
states: 195,277,094,912 (11)
abstracting: (r_9_2<=p_19_2)
states: 300,990,808,064 (11)
abstracting: (r_9_2<=p_10_2)
states: 210,807,947,264 (11)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [AG [~ [[3<=p_10_0 & p_2_1<=r_19_0]]] & [AG [~ [p_17_0<=r_4_2]] | [AF [r_11_2<=p_2_2] | AF [p_3_1<=p_18_1]]]]
normalized: [[~ [E [true U p_17_0<=r_4_2]] | [~ [EG [~ [p_3_1<=p_18_1]]] | ~ [EG [~ [r_11_2<=p_2_2]]]]] & ~ [E [true U [3<=p_10_0 & p_2_1<=r_19_0]]]]

abstracting: (p_2_1<=r_19_0)
states: 370,862,112,768 (11)
abstracting: (3<=p_10_0)
states: 0
abstracting: (r_11_2<=p_2_2)
states: 243,778,191,360 (11)
..................................
EG iterations: 34
abstracting: (p_3_1<=p_18_1)
states: 328,402,194,432 (11)
.
EG iterations: 1
abstracting: (p_17_0<=r_4_2)
states: 370,432,098,304 (11)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.450sec

checking: [[p_0_2<=r_2_2 & [[2<=p_3_2 & p_6_2<=r_14_2] & [1<=p_4_2 | [p_11_0<=p_15_0 & 2<=r_1_0]]]] | ~ [EF [[3<=p_13_0 | 3<=p_15_1]]]]
normalized: [~ [E [true U [3<=p_13_0 | 3<=p_15_1]]] | [p_0_2<=r_2_2 & [[2<=p_3_2 & p_6_2<=r_14_2] & [1<=p_4_2 | [p_11_0<=p_15_0 & 2<=r_1_0]]]]]

abstracting: (2<=r_1_0)
states: 0
abstracting: (p_11_0<=p_15_0)
states: 362,602,250,240 (11)
abstracting: (1<=p_4_2)
states: 57,423,544,320 (10)
abstracting: (p_6_2<=r_14_2)
states: 377,938,599,936 (11)
abstracting: (2<=p_3_2)
states: 0
abstracting: (p_0_2<=r_2_2)
states: 335,188,631,552 (11)
abstracting: (3<=p_15_1)
states: 0
abstracting: (3<=p_13_0)
states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C020-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

totally nodes used: 3085423(3.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 963385 1926714 2890099
used/not used/entry size/cache size: 1874852 65234012 16 1024MB
basic ops cache: hits/miss/sum: 1129560 2463605 3593165
used/not used/entry size/cache size: 4970375 11806841 12 192MB
unary ops cache: hits/miss/sum: 0 1770 1770
used/not used/entry size/cache size: 1770 8386838 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 2485 7518 10003
used/not used/entry size/cache size: 7508 2089644 32 64MB
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 64087659
1 2957851
2 62499
3 846
4 9
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.292sec


BK_STOP 1495085054809

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


initing FirstDep: 0m 0.000sec


iterations count:611 (7), effective:120 (1)

initing FirstDep: 0m 0.000sec


iterations count:141 (1), effective:10 (0)

iterations count:209 (2), effective:20 (0)

iterations count:107 (1), effective:4 (0)

iterations count:134 (1), effective:8 (0)

iterations count:97 (1), effective:3 (0)

iterations count:167 (2), effective:13 (0)

iterations count:150 (1), effective:12 (0)

iterations count:115 (1), effective:5 (0)

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_ResAllocation-PT-R003C020"
export BK_EXAMINATION="CTLCardinality"
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_ResAllocation-PT-R003C020.tgz
mv S_ResAllocation-PT-R003C020 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_ResAllocation-PT-R003C020, 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 r141-csrt-149443423900093"
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 ;