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_PermAdmissibility-PT-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r111-blw7-149441637300399
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494790343983

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: PermAdmissibility_PT_01
(NrP: 168 NrTr: 592 NrArc: 3456)

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

net check time: 0m 0.001sec

init dd package: 0m 0.971sec

parse successfull
net created successfully

Net: PermAdmissibility_PT_01
(NrP: 168 NrTr: 592 NrArc: 3456)

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

net check time: 0m 0.000sec

init dd package: 0m 3.344sec


RS generation: 0m26.536sec


-> reachability set: #nodes 57487 (5.7e+04) #states 52,537 (4)



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

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

abstracting: (1<=c5)
states: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.685sec

checking: A [~ [3<=c18] U AF [2<=c12]]
normalized: [~ [EG [EG [~ [2<=c12]]]] & ~ [E [EG [~ [2<=c12]] U [EG [~ [2<=c12]] & 3<=c18]]]]

abstracting: (3<=c18)
states: 0
abstracting: (2<=c12)
states: 0

EG iterations: 0
abstracting: (2<=c12)
states: 0

EG iterations: 0
abstracting: (2<=c12)
states: 0

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: ~ [[[EG [1<=c15] | AF [3<=c19]] | 2<=c17]]
normalized: ~ [[[~ [EG [~ [3<=c19]]] | EG [1<=c15]] | 2<=c17]]

abstracting: (2<=c17)
states: 0
abstracting: (1<=c15)
states: 736
..
EG iterations: 2
abstracting: (3<=c19)
states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.185sec

checking: EG [[EX [c5<=c19] | 1<=c11]]
normalized: EG [[1<=c11 | EX [c5<=c19]]]

abstracting: (c5<=c19)
states: 52,536 (4)
.abstracting: (1<=c11)
states: 64
.................
EG iterations: 17
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.761sec

checking: EG [AG [~ [3<=sum(aux5_4, aux5_5, aux5_0, aux5_1)]]]
normalized: EG [~ [E [true U 3<=sum(aux5_4, aux5_5, aux5_0, aux5_1)]]]

abstracting: (3<=sum(aux5_4, aux5_5, aux5_0, aux5_1))
states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.063sec

checking: AG [~ [EG [sum(aux8_2, aux8_6, aux8_3, aux8_7)<=sum(in4_7, in4_6)]]]
normalized: ~ [E [true U EG [sum(aux8_2, aux8_6, aux8_3, aux8_7)<=sum(in4_7, in4_6)]]]

abstracting: (sum(aux8_2, aux8_6, aux8_3, aux8_7)<=sum(in4_7, in4_6))
states: 52,137 (4)
.....
EG iterations: 5
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.441sec

checking: AF [1<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1)]
normalized: ~ [EG [~ [1<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1)]]]

abstracting: (1<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1))
states: 37,376 (4)
................
EG iterations: 16
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: AF [~ [[c18<=c7 & [c17<=c19 | c6<=sum(aux7_2, aux7_3, aux7_6, aux7_7)]]]]
normalized: ~ [EG [[c18<=c7 & [c17<=c19 | c6<=sum(aux7_2, aux7_3, aux7_6, aux7_7)]]]]

abstracting: (c6<=sum(aux7_2, aux7_3, aux7_6, aux7_7))
states: 52,533 (4)
abstracting: (c17<=c19)
states: 51,369 (4)
abstracting: (c18<=c7)
states: 47,865 (4)
..............
EG iterations: 14
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.463sec

checking: E [EF [sum(aux13_6, aux13_5, aux13_4, aux13_3, aux13_7, aux13_0, aux13_1, aux13_2)<=c19] U 2<=c7]
normalized: E [E [true U sum(aux13_6, aux13_5, aux13_4, aux13_3, aux13_7, aux13_0, aux13_1, aux13_2)<=c19] U 2<=c7]

abstracting: (2<=c7)
states: 0
abstracting: (sum(aux13_6, aux13_5, aux13_4, aux13_3, aux13_7, aux13_0, aux13_1, aux13_2)<=c19)
states: 42,729 (4)
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.904sec

checking: A [[~ [1<=c17] | [1<=sum(aux8_2, aux8_6, aux8_3, aux8_7) | 2<=sum(aux5_4, aux5_5, aux5_0, aux5_1)]] U 3<=sum(in2_3, in2_2)]
normalized: [~ [EG [~ [3<=sum(in2_3, in2_2)]]] & ~ [E [~ [3<=sum(in2_3, in2_2)] U [~ [[[1<=sum(aux8_2, aux8_6, aux8_3, aux8_7) | 2<=sum(aux5_4, aux5_5, aux5_0, aux5_1)] | ~ [1<=c17]]] & ~ [3<=sum(in2_3, in2_2)]]]]]

abstracting: (3<=sum(in2_3, in2_2))
states: 0
abstracting: (1<=c17)
states: 1,168 (3)
abstracting: (2<=sum(aux5_4, aux5_5, aux5_0, aux5_1))
states: 40
abstracting: (1<=sum(aux8_2, aux8_6, aux8_3, aux8_7))
states: 400
abstracting: (3<=sum(in2_3, in2_2))
states: 0
abstracting: (3<=sum(in2_3, in2_2))
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.075sec

checking: ~ [[AX [[c13<=c20 & sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4)<=c15]] & [AG [sum(in3_4, in3_5)<=c6] | AF [3<=c19]]]]
normalized: ~ [[[~ [EG [~ [3<=c19]]] | ~ [E [true U ~ [sum(in3_4, in3_5)<=c6]]]] & ~ [EX [~ [[c13<=c20 & sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4)<=c15]]]]]]

abstracting: (sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4)<=c15)
states: 51,001 (4)
abstracting: (c13<=c20)
states: 52,281 (4)
.abstracting: (sum(in3_4, in3_5)<=c6)
states: 52,536 (4)
abstracting: (3<=c19)
states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.284sec

checking: EG [E [sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2)<=sum(aux13_6, aux13_5, aux13_4, aux13_3, aux13_7, aux13_0, aux13_1, aux13_2) U 3<=c15]]
normalized: EG [E [sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2)<=sum(aux13_6, aux13_5, aux13_4, aux13_3, aux13_7, aux13_0, aux13_1, aux13_2) U 3<=c15]]

abstracting: (3<=c15)
states: 0
abstracting: (sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2)<=sum(aux13_6, aux13_5, aux13_4, aux13_3, aux13_7, aux13_0, aux13_1, aux13_2))
states: 52,537 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.170sec

checking: AF [[[[c5<=c7 | 2<=c17] & ~ [3<=c14]] & [[3<=c6 & sum(aux10_7, aux10_6, aux10_5, aux10_3, aux10_4, aux10_1, aux10_2, aux10_0)<=c14] & 1<=sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1)]]]
normalized: ~ [EG [~ [[[1<=sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1) & [3<=c6 & sum(aux10_7, aux10_6, aux10_5, aux10_3, aux10_4, aux10_1, aux10_2, aux10_0)<=c14]] & [~ [3<=c14] & [c5<=c7 | 2<=c17]]]]]]

abstracting: (2<=c17)
states: 0
abstracting: (c5<=c7)
states: 52,536 (4)
abstracting: (3<=c14)
states: 0
abstracting: (sum(aux10_7, aux10_6, aux10_5, aux10_3, aux10_4, aux10_1, aux10_2, aux10_0)<=c14)
states: 47,993 (4)
abstracting: (3<=c6)
states: 0
abstracting: (1<=sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1))
states: 18,688 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.255sec

checking: [[1<=sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0) & 3<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1)] | [~ [EF [1<=sum(out6_7, out6_3, out6_4, out6_5, out6_6, out6_0, out6_2, out6_1)]] | 3<=sum(in4_7, in4_6)]]
normalized: [[3<=sum(in4_7, in4_6) | ~ [E [true U 1<=sum(out6_7, out6_3, out6_4, out6_5, out6_6, out6_0, out6_2, out6_1)]]] | [1<=sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0) & 3<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1)]]

abstracting: (3<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1))
states: 0
abstracting: (1<=sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0))
states: 32,272 (4)
abstracting: (1<=sum(out6_7, out6_3, out6_4, out6_5, out6_6, out6_0, out6_2, out6_1))
states: 37,376 (4)
abstracting: (3<=sum(in4_7, in4_6))
states: 0
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m11.728sec

checking: A [[[sum(aux7_2, aux7_3, aux7_6, aux7_7)<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1) | sum(aux11_6, aux11_7, aux11_0, aux11_1, aux11_2, aux11_3, aux11_4, aux11_5)<=sum(aux5_4, aux5_5, aux5_0, aux5_1)] & [sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0)<=sum(aux8_2, aux8_6, aux8_3, aux8_7) & c19<=sum(aux6_4, aux6_1, aux6_5, aux6_0)]] U AG [sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0)<=sum(in4_7, in4_6)]]
normalized: [~ [EG [E [true U ~ [sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0)<=sum(in4_7, in4_6)]]]] & ~ [E [E [true U ~ [sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0)<=sum(in4_7, in4_6)]] U [E [true U ~ [sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0)<=sum(in4_7, in4_6)]] & ~ [[[sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0)<=sum(aux8_2, aux8_6, aux8_3, aux8_7) & c19<=sum(aux6_4, aux6_1, aux6_5, aux6_0)] & [sum(aux7_2, aux7_3, aux7_6, aux7_7)<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1) | sum(aux11_6, aux11_7, aux11_0, aux11_1, aux11_2, aux11_3, aux11_4, aux11_5)<=sum(aux5_4, aux5_5, aux5_0, aux5_1)]]]]]]]

abstracting: (sum(aux11_6, aux11_7, aux11_0, aux11_1, aux11_2, aux11_3, aux11_4, aux11_5)<=sum(aux5_4, aux5_5, aux5_0, aux5_1))
states: 51,129 (4)
abstracting: (sum(aux7_2, aux7_3, aux7_6, aux7_7)<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1))
states: 52,441 (4)
abstracting: (c19<=sum(aux6_4, aux6_1, aux6_5, aux6_0))
states: 47,865 (4)
abstracting: (sum(out3_5, out3_4, out3_3, out3_2, out3_7, out3_6, out3_1, out3_0)<=sum(aux8_2, aux8_6, aux8_3, aux8_7))
states: 10,489 (4)
abstracting: (sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0)<=sum(in4_7, in4_6))
states: 20,265 (4)
abstracting: (sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0)<=sum(in4_7, in4_6))
states: 20,265 (4)
abstracting: (sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0)<=sum(in4_7, in4_6))
states: 20,265 (4)
.................
EG iterations: 17
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.943sec

checking: [[[[[sum(in1_0, in1_1)<=sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1) & 1<=c8] & ~ [sum(aux5_4, aux5_5, aux5_0, aux5_1)<=c7]] | [~ [c16<=sum(out1_3, out1_4, out1_1, out1_2, out1_7, out1_5, out1_6, out1_0)] & 2<=c12]] | ~ [AG [sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0)<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0)]]] & [E [3<=sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2) U sum(out1_3, out1_4, out1_1, out1_2, out1_7, out1_5, out1_6, out1_0)<=sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0)] & [AF [sum(in3_4, in3_5)<=c13] | ~ [[c16<=c9 & 1<=sum(out1_3, out1_4, out1_1, out1_2, out1_7, out1_5, out1_6, out1_0)]]]]]
normalized: [[[~ [EG [~ [sum(in3_4, in3_5)<=c13]]] | ~ [[c16<=c9 & 1<=sum(out1_3, out1_4, out1_1, out1_2, out1_7, out1_5, out1_6, out1_0)]]] & E [3<=sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2) U sum(out1_3, out1_4, out1_1, out1_2, out1_7, out1_5, out1_6, out1_0)<=sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0)]] & [E [true U ~ [sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0)<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0)]] | [[2<=c12 & ~ [c16<=sum(out1_3, out1_4, out1_1, out1_2, out1_7, out1_5, out1_6, out1_0)]] | [~ [sum(aux5_4, aux5_5, aux5_0, aux5_1)<=c7] & [sum(in1_0, in1_1)<=sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1) & 1<=c8]]]]]

abstracting: (1<=c8)
states: 16
abstracting: (sum(in1_0, in1_1)<=sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1))
states: 52,532 (4)
abstracting: (sum(aux5_4, aux5_5, aux5_0, aux5_1)<=c7)
states: 52,433 (4)
abstracting: (c16<=sum(out1_3, out1_4, out1_1, out1_2, out1_7, out1_5, out1_6, out1_0))
states: 50,201 (4)
abstracting: (2<=c12)
states: 0
abstracting: (sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0)<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0))
states: 38,953 (4)
abstracting: (sum(out1_3, out1_4, out1_1, out1_2, out1_7, out1_5, out1_6, out1_0)<=sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0))
states: 33,849 (4)
abstracting: (3<=sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2))
states: 0
abstracting: (1<=sum(out1_3, out1_4, out1_1, out1_2, out1_7, out1_5, out1_6, out1_0))
states: 46,720 (4)
abstracting: (c16<=c9)
states: 50,201 (4)
abstracting: (sum(in3_4, in3_5)<=c13)
states: 52,532 (4)
...
EG iterations: 3
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.324sec

totally nodes used: 35539884 (3.6e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 65868375 296684821 362553196
used/not used/entry size/cache size: 66393094 715770 16 1024MB
basic ops cache: hits/miss/sum: 6453967 38847297 45301264
used/not used/entry size/cache size: 16533018 244198 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 214986 214986
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 11303 69223 80526
used/not used/entry size/cache size: 69031 8319577 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 41662687
1 17679077
2 5885283
3 1508959
4 311109
5 52908
6 7667
7 1020
8 140
9 14
>= 10 0

Total processing time: 3m29.145sec


BK_STOP 1494790553291

--------------------
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:66: Boundedness exception: net maybe 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.003sec

6024 13526 21978 25981 29790 45194
iterations count:624986 (1055), effective:3528 (5)

initing FirstDep: 0m 0.002sec


iterations count:602 (1), effective:1 (0)

iterations count:7588 (12), effective:89 (0)
52544 56452
iterations count:263309 (444), effective:1572 (2)
9395
iterations count:199917 (337), effective:1651 (2)

iterations count:592 (1), effective:0 (0)
36452 43069 47969 52888 54231 55025 56805 57378
iterations count:849425 (1434), effective:4185 (7)

iterations count:23796 (40), effective:289 (0)

iterations count:23796 (40), effective:289 (0)
34693 41434 44847
iterations count:317785 (536), effective:2127 (3)

iterations count:23796 (40), effective:289 (0)

iterations count:23796 (40), effective:289 (0)

iterations count:592 (1), effective:0 (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_PermAdmissibility-PT-01"
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_PermAdmissibility-PT-01.tgz
mv S_PermAdmissibility-PT-01 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_PermAdmissibility-PT-01, 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 r111-blw7-149441637300399"
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 ;