Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r321-tall-167889192500705.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is ResAllocation-PT-R003C020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192500705
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 25 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 203K Feb 25 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 143K Mar 5 18:23 model.pnml

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

=== Now, execution of the tool begins

BK_START 1678940795691

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C020
Not applying reductions.
Model is PT
CTLCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

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


RS generation: 0m 0.009sec


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



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

checking: EG [1<=r_18_1]
normalized: EG [1<=r_18_1]

abstracting: (1<=r_18_1)
states: 176,000,909,312 (11)
...............................
EG iterations: 31
-> the formula is TRUE

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

MC time: 0m 0.376sec

checking: AF [~ [EF [r_5_0<=0]]]
normalized: ~ [EG [E [true U r_5_0<=0]]]

abstracting: (r_5_0<=0)
states: 209,915,723,776 (11)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.030sec

checking: ~ [AG [~ [EG [[~ [1<=r_6_2] & AF [r_17_1<=0]]]]]]
normalized: E [true U EG [[~ [EG [~ [r_17_1<=0]]] & ~ [1<=r_6_2]]]]

abstracting: (1<=r_6_2)
states: 194,882,977,792 (11)
abstracting: (r_17_1<=0)
states: 192,814,096,384 (11)
..............................
EG iterations: 30
...............................
EG iterations: 31
-> the formula is TRUE

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

MC time: 0m 0.802sec

checking: EF [EF [[~ [EX [~ [r_18_2<=p_13_1]]] | EX [AG [r_1_2<=0]]]]]
normalized: E [true U E [true U [~ [EX [~ [r_18_2<=p_13_1]]] | EX [~ [E [true U ~ [r_1_2<=0]]]]]]]

abstracting: (r_1_2<=0)
states: 195,674,144,768 (11)
.abstracting: (r_18_2<=p_13_1)
states: 268,452,438,016 (11)
.-> the formula is TRUE

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

MC time: 0m 0.066sec

checking: EG [EF [EX [[p_4_0<=1 | [[1<=r_19_2 | r_0_2<=1] & AG [p_13_1<=0]]]]]]
normalized: EG [E [true U EX [[[~ [E [true U ~ [p_13_1<=0]]] & [1<=r_19_2 | r_0_2<=1]] | p_4_0<=1]]]]

abstracting: (p_4_0<=1)
states: 406,454,747,136 (11)
abstracting: (r_0_2<=1)
states: 406,454,747,136 (11)
abstracting: (1<=r_19_2)
states: 219,156,119,552 (11)
abstracting: (p_13_1<=0)
states: 300,465,332,224 (11)
................................
EG iterations: 31
-> the formula is TRUE

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

MC time: 0m 0.115sec

checking: ~ [AG [~ [[AF [~ [EF [p_8_0<=1]]] & E [p_19_2<=0 U [~ [p_2_0<=0] & p_9_1<=0]]]]]]
normalized: E [true U [E [p_19_2<=0 U [~ [p_2_0<=0] & p_9_1<=0]] & ~ [EG [E [true U p_8_0<=1]]]]]

abstracting: (p_8_0<=1)
states: 406,454,747,136 (11)

EG iterations: 0
abstracting: (p_9_1<=0)
states: 302,127,325,184 (11)
abstracting: (p_2_0<=0)
states: 237,680,230,400 (11)
abstracting: (p_19_2<=0)
states: 219,156,119,552 (11)
-> the formula is FALSE

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

MC time: 0m 0.025sec

checking: [AG [~ [EG [AF [EF [p_3_0<=0]]]]] | AG [A [p_9_0<=0 U EX [[EX [1<=r_14_1] & [1<=r_15_1 | 1<=r_5_1]]]]]]
normalized: [~ [E [true U ~ [[~ [EG [~ [EX [[[1<=r_15_1 | 1<=r_5_1] & EX [1<=r_14_1]]]]]] & ~ [E [~ [EX [[[1<=r_15_1 | 1<=r_5_1] & EX [1<=r_14_1]]]] U [~ [p_9_0<=0] & ~ [EX [[[1<=r_15_1 | 1<=r_5_1] & EX [1<=r_14_1]]]]]]]]]]] | ~ [E [true U EG [~ [EG [~ [E [true U p_3_0<=0]]]]]]]]

abstracting: (p_3_0<=0)
states: 360,144,470,016 (11)
.
EG iterations: 1

EG iterations: 0
abstracting: (1<=r_14_1)
states: 195,127,943,168 (11)
.abstracting: (1<=r_5_1)
states: 198,935,748,608 (11)
abstracting: (1<=r_15_1)
states: 202,262,413,312 (11)
.abstracting: (p_9_0<=0)
states: 353,273,806,848 (11)
abstracting: (1<=r_14_1)
states: 195,127,943,168 (11)
.abstracting: (1<=r_5_1)
states: 198,935,748,608 (11)
abstracting: (1<=r_15_1)
states: 202,262,413,312 (11)
.abstracting: (1<=r_14_1)
states: 195,127,943,168 (11)
.abstracting: (1<=r_5_1)
states: 198,935,748,608 (11)
abstracting: (1<=r_15_1)
states: 202,262,413,312 (11)
..............................
EG iterations: 29
-> the formula is FALSE

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

MC time: 0m 0.979sec

checking: AF [AG [A [[~ [[p_19_1<=1 & p_15_1<=1]] & AX [p_2_0<=1]] U [EF [p_2_0<=r_0_2] | ~ [1<=r_18_1]]]]]
normalized: ~ [EG [E [true U ~ [[~ [EG [~ [[~ [1<=r_18_1] | E [true U p_2_0<=r_0_2]]]]] & ~ [E [~ [[~ [1<=r_18_1] | E [true U p_2_0<=r_0_2]]] U [~ [[~ [1<=r_18_1] | E [true U p_2_0<=r_0_2]]] & ~ [[~ [[p_19_1<=1 & p_15_1<=1]] & ~ [EX [~ [p_2_0<=1]]]]]]]]]]]]]

abstracting: (p_2_0<=1)
states: 406,454,747,136 (11)
.abstracting: (p_15_1<=1)
states: 406,454,747,136 (11)
abstracting: (p_19_1<=1)
states: 406,454,747,136 (11)
abstracting: (p_2_0<=r_0_2)
states: 303,429,828,608 (11)
abstracting: (1<=r_18_1)
states: 176,000,909,312 (11)
abstracting: (p_2_0<=r_0_2)
states: 303,429,828,608 (11)
abstracting: (1<=r_18_1)
states: 176,000,909,312 (11)
abstracting: (p_2_0<=r_0_2)
states: 303,429,828,608 (11)
abstracting: (1<=r_18_1)
states: 176,000,909,312 (11)
.............................
EG iterations: 29
..............................
EG iterations: 30
-> the formula is FALSE

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

MC time: 0m 0.400sec

checking: EF [~ [[AX [AF [AX [p_15_2<=p_12_0]]] & ~ [[AG [AF [p_8_1<=r_4_0]] & ~ [EX [r_1_1<=r_4_0]]]]]]]
normalized: E [true U ~ [[~ [EX [EG [EX [~ [p_15_2<=p_12_0]]]]] & ~ [[~ [EX [r_1_1<=r_4_0]] & ~ [E [true U EG [~ [p_8_1<=r_4_0]]]]]]]]]

abstracting: (p_8_1<=r_4_0)
states: 353,823,817,728 (11)
.............................
EG iterations: 29
abstracting: (r_1_1<=r_4_0)
states: 296,318,730,240 (11)
.abstracting: (p_15_2<=p_12_0)
states: 305,501,896,704 (11)
...............................
EG iterations: 30
.-> the formula is TRUE

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

MC time: 0m 0.847sec

checking: EG [[AF [AF [[AG [1<=r_0_2] & [r_19_0<=p_16_0 | r_12_2<=0]]]] & p_15_0<=r_17_1]]
normalized: EG [[p_15_0<=r_17_1 & ~ [EG [EG [~ [[[r_19_0<=p_16_0 | r_12_2<=0] & ~ [E [true U ~ [1<=r_0_2]]]]]]]]]]

abstracting: (1<=r_0_2)
states: 161,321,025,536 (11)
abstracting: (r_12_2<=0)
states: 211,420,217,344 (11)
abstracting: (r_19_0<=p_16_0)
states: 231,402,004,480 (11)

EG iterations: 0

EG iterations: 0
abstracting: (p_15_0<=r_17_1)
states: 375,246,299,136 (11)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.007sec

checking: [~ [AF [[~ [[1<=p_10_2 & p_19_2<=r_4_2]] & ~ [EF [1<=p_14_2]]]]] & EX [EF [A [p_18_0<=r_0_2 U 1<=r_13_2]]]]
normalized: [EX [E [true U [~ [EG [~ [1<=r_13_2]]] & ~ [E [~ [1<=r_13_2] U [~ [p_18_0<=r_0_2] & ~ [1<=r_13_2]]]]]]] & EG [~ [[~ [E [true U 1<=p_14_2]] & ~ [[1<=p_10_2 & p_19_2<=r_4_2]]]]]]

abstracting: (p_19_2<=r_4_2)
states: 308,268,482,560 (11)
abstracting: (1<=p_10_2)
states: 53,180,940,288 (10)
abstracting: (1<=p_14_2)
states: 51,167,100,928 (10)
................................
EG iterations: 32
abstracting: (1<=r_13_2)
states: 196,539,023,360 (11)
abstracting: (p_18_0<=r_0_2)
states: 329,880,203,264 (11)
abstracting: (1<=r_13_2)
states: 196,539,023,360 (11)
abstracting: (1<=r_13_2)
states: 196,539,023,360 (11)
...............................
EG iterations: 31
.-> the formula is TRUE

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

MC time: 0m 1.300sec

checking: [EG [r_3_2<=r_17_0] & [~ [AG [~ [[[1<=p_18_2 & 1<=p_16_1] | [r_8_0<=r_3_2 | 1<=r_19_1]]]]] & AF [[1<=p_8_0 | ~ [[[p_10_2<=1 & 1<=p_12_0] & AF [1<=r_0_2]]]]]]]
normalized: [[~ [EG [~ [[1<=p_8_0 | ~ [[~ [EG [~ [1<=r_0_2]]] & [p_10_2<=1 & 1<=p_12_0]]]]]]] & E [true U [[r_8_0<=r_3_2 | 1<=r_19_1] | [1<=p_18_2 & 1<=p_16_1]]]] & EG [r_3_2<=r_17_0]]

abstracting: (r_3_2<=r_17_0)
states: 310,707,159,040 (11)
.............................
EG iterations: 29
abstracting: (1<=p_16_1)
states: 94,395,113,472 (10)
abstracting: (1<=p_18_2)
states: 31,857,491,968 (10)
abstracting: (1<=r_19_1)
states: 246,382,583,808 (11)
abstracting: (r_8_0<=r_3_2)
states: 306,984,026,112 (11)
abstracting: (1<=p_12_0)
states: 157,144,530,944 (11)
abstracting: (p_10_2<=1)
states: 406,454,747,136 (11)
abstracting: (1<=r_0_2)
states: 161,321,025,536 (11)
...............................
EG iterations: 31
abstracting: (1<=p_8_0)
states: 157,967,597,568 (11)
...............................
EG iterations: 31
-> the formula is TRUE

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

MC time: 0m 1.269sec

checking: [AG [EF [[[AF [p_3_2<=1] & [AG [1<=p_5_0] & ~ [p_9_0<=0]]] & A [~ [p_6_2<=0] U EX [r_15_0<=0]]]]] & ~ [AX [[[1<=p_8_2 & [[EF [1<=r_2_1] & [r_7_1<=1 & 1<=r_18_0]] & r_15_2<=p_8_2]] & AF [AX [r_5_1<=1]]]]]]
normalized: [EX [~ [[~ [EG [EX [~ [r_5_1<=1]]]] & [1<=p_8_2 & [r_15_2<=p_8_2 & [[r_7_1<=1 & 1<=r_18_0] & E [true U 1<=r_2_1]]]]]]] & ~ [E [true U ~ [E [true U [[~ [EG [~ [p_3_2<=1]]] & [~ [p_9_0<=0] & ~ [E [true U ~ [1<=p_5_0]]]]] & [~ [E [~ [EX [r_15_0<=0]] U [p_6_2<=0 & ~ [EX [r_15_0<=0]]]]] & ~ [EG [~ [EX [r_15_0<=0]]]]]]]]]]]

abstracting: (r_15_0<=0)
states: 207,572,729,856 (11)
...
EG iterations: 2
abstracting: (r_15_0<=0)
states: 207,572,729,856 (11)
.abstracting: (p_6_2<=0)
states: 352,027,508,736 (11)
abstracting: (r_15_0<=0)
states: 207,572,729,856 (11)
.abstracting: (1<=p_5_0)
states: 51,167,100,928 (10)
abstracting: (p_9_0<=0)
states: 353,273,806,848 (11)
abstracting: (p_3_2<=1)
states: 406,454,747,136 (11)
.
EG iterations: 1
abstracting: (1<=r_2_1)
states: 189,627,211,776 (11)
abstracting: (1<=r_18_0)
states: 161,321,025,536 (11)
abstracting: (r_7_1<=1)
states: 406,454,747,136 (11)
abstracting: (r_15_2<=p_8_2)
states: 233,865,674,752 (11)
abstracting: (1<=p_8_2)
states: 53,550,645,248 (10)
abstracting: (r_5_1<=1)
states: 406,454,747,136 (11)
..
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.066sec

checking: [EG [[AX [A [AX [1<=p_10_1] U AX [p_18_1<=r_1_2]]] & [EX [A [1<=r_7_1 U r_19_1<=r_9_2]] & A [[[p_15_1<=r_7_1 & r_4_1<=p_11_0] & r_11_1<=1] U p_16_0<=0]]]] | AF [r_4_0<=0]]
normalized: [~ [EG [~ [r_4_0<=0]]] | EG [[[[~ [EG [~ [p_16_0<=0]]] & ~ [E [~ [p_16_0<=0] U [~ [[[p_15_1<=r_7_1 & r_4_1<=p_11_0] & r_11_1<=1]] & ~ [p_16_0<=0]]]]] & EX [[~ [EG [~ [r_19_1<=r_9_2]]] & ~ [E [~ [r_19_1<=r_9_2] U [~ [1<=r_7_1] & ~ [r_19_1<=r_9_2]]]]]]] & ~ [EX [~ [[~ [EG [EX [~ [p_18_1<=r_1_2]]]] & ~ [E [EX [~ [p_18_1<=r_1_2]] U [EX [~ [1<=p_10_1]] & EX [~ [p_18_1<=r_1_2]]]]]]]]]]]]

abstracting: (p_18_1<=r_1_2)
states: 372,571,037,696 (11)
.abstracting: (1<=p_10_1)
states: 104,327,421,952 (11)
.abstracting: (p_18_1<=r_1_2)
states: 372,571,037,696 (11)
.abstracting: (p_18_1<=r_1_2)
states: 372,571,037,696 (11)
................................
EG iterations: 31
.abstracting: (r_19_1<=r_9_2)
states: 278,613,016,576 (11)
abstracting: (1<=r_7_1)
states: 197,997,436,928 (11)
abstracting: (r_19_1<=r_9_2)
states: 278,613,016,576 (11)
abstracting: (r_19_1<=r_9_2)
states: 278,613,016,576 (11)
..................................
EG iterations: 34
.abstracting: (p_16_0<=0)
states: 256,305,561,600 (11)
abstracting: (r_11_1<=1)
states: 406,454,747,136 (11)
abstracting: (r_4_1<=p_11_0)
states: 236,728,819,712 (11)
abstracting: (p_15_1<=r_7_1)
states: 350,388,809,728 (11)
abstracting: (p_16_0<=0)
states: 256,305,561,600 (11)
abstracting: (p_16_0<=0)
states: 256,305,561,600 (11)
............................
EG iterations: 28
.................................
EG iterations: 33
abstracting: (r_4_0<=0)
states: 212,388,298,752 (11)
..................................
EG iterations: 34
-> the formula is TRUE

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

MC time: 0m 3.010sec

checking: EG [[[[EG [AF [p_18_0<=1]] | [1<=p_4_2 | [[A [r_13_0<=0 U r_4_2<=1] & ~ [r_11_0<=r_7_0]] & [AG [r_0_2<=p_2_2] & [p_16_1<=1 | p_12_2<=1]]]]] & EG [AG [[p_8_2<=1 | r_2_2<=0]]]] & [p_11_0<=0 | EF [p_13_1<=r_1_2]]]]
normalized: EG [[[[EG [~ [EG [~ [p_18_0<=1]]]] | [1<=p_4_2 | [[~ [E [true U ~ [r_0_2<=p_2_2]]] & [p_16_1<=1 | p_12_2<=1]] & [~ [r_11_0<=r_7_0] & [~ [EG [~ [r_4_2<=1]]] & ~ [E [~ [r_4_2<=1] U [~ [r_13_0<=0] & ~ [r_4_2<=1]]]]]]]]] & EG [~ [E [true U ~ [[p_8_2<=1 | r_2_2<=0]]]]]] & [p_11_0<=0 | E [true U p_13_1<=r_1_2]]]]

abstracting: (p_13_1<=r_1_2)
states: 355,451,023,360 (11)
abstracting: (p_11_0<=0)
states: 352,904,101,888 (11)
abstracting: (r_2_2<=0)
states: 218,855,424,000 (11)
abstracting: (p_8_2<=1)
states: 406,454,747,136 (11)

EG iterations: 0
abstracting: (r_4_2<=1)
states: 406,454,747,136 (11)
abstracting: (r_13_0<=0)
states: 210,074,730,496 (11)
abstracting: (r_4_2<=1)
states: 406,454,747,136 (11)
abstracting: (r_4_2<=1)
states: 406,454,747,136 (11)
.
EG iterations: 1
abstracting: (r_11_0<=r_7_0)
states: 303,921,070,080 (11)
abstracting: (p_12_2<=1)
states: 406,454,747,136 (11)
abstracting: (p_16_1<=1)
states: 406,454,747,136 (11)
abstracting: (r_0_2<=p_2_2)
states: 279,486,840,832 (11)
abstracting: (1<=p_4_2)
states: 57,423,544,320 (10)
abstracting: (p_18_0<=1)
states: 406,454,747,136 (11)
.
EG iterations: 1

EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.029sec

checking: [~ [[EF [[AX [[p_13_0<=p_3_2 & p_12_2<=1]] & 1<=r_14_0]] & EG [1<=r_16_0]]] | [AG [EF [[~ [1<=p_18_1] | [AF [r_0_2<=p_5_0] | [p_6_2<=r_8_2 & 1<=r_10_2]]]]] & EX [[~ [[[EF [p_5_0<=1] & r_14_1<=0] | [E [r_18_0<=0 U r_3_0<=r_18_2] & 1<=p_17_0]]] | ~ [p_3_0<=1]]]]]
normalized: [[EX [[~ [p_3_0<=1] | ~ [[[E [r_18_0<=0 U r_3_0<=r_18_2] & 1<=p_17_0] | [E [true U p_5_0<=1] & r_14_1<=0]]]]] & ~ [E [true U ~ [E [true U [[[p_6_2<=r_8_2 & 1<=r_10_2] | ~ [EG [~ [r_0_2<=p_5_0]]]] | ~ [1<=p_18_1]]]]]]] | ~ [[EG [1<=r_16_0] & E [true U [1<=r_14_0 & ~ [EX [~ [[p_13_0<=p_3_2 & p_12_2<=1]]]]]]]]]

abstracting: (p_12_2<=1)
states: 406,454,747,136 (11)
abstracting: (p_13_0<=p_3_2)
states: 372,176,142,336 (11)
.abstracting: (1<=r_14_0)
states: 193,383,710,720 (11)
abstracting: (1<=r_16_0)
states: 187,599,323,136 (11)
..................................
EG iterations: 34
abstracting: (1<=p_18_1)
states: 70,381,674,496 (10)
abstracting: (r_0_2<=p_5_0)
states: 265,331,261,440 (11)
..................................
EG iterations: 34
abstracting: (1<=r_10_2)
states: 195,306,209,280 (11)
abstracting: (p_6_2<=r_8_2)
states: 373,627,969,536 (11)
abstracting: (r_14_1<=0)
states: 211,326,803,968 (11)
abstracting: (p_5_0<=1)
states: 406,454,747,136 (11)
abstracting: (1<=p_17_0)
states: 68,706,238,464 (10)
abstracting: (r_3_0<=r_18_2)
states: 299,197,956,096 (11)
abstracting: (r_18_0<=0)
states: 245,133,721,600 (11)
abstracting: (p_3_0<=1)
states: 406,454,747,136 (11)
.-> the formula is TRUE

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

MC time: 0m 0.671sec

totally nodes used: 15001543 (1.5e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4769136 19148664 23917800
used/not used/entry size/cache size: 26135225 40973639 16 1024MB
basic ops cache: hits/miss/sum: 967104 3443379 4410483
used/not used/entry size/cache size: 5542293 11234923 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: 4429 24384 28813
used/not used/entry size/cache size: 24350 8364258 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 54669584
1 10295289
2 1784077
3 308370
4 45387
5 5558
6 543
7 54
8 2
9 0
>= 10 0

Total processing time: 0m15.753sec


BK_STOP 1678940811494

--------------------
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:149 (1), effective:11 (0)

iterations count:501 (6), effective:72 (0)

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

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

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

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

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

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

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

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

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

iterations count:182 (2), effective:15 (0)

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

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

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

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

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

iterations count:155 (1), effective:17 (0)

iterations count:157 (1), effective:13 (0)

iterations count:948 (11), effective:150 (1)

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

iterations count:179 (2), effective:15 (0)

iterations count:106 (1), effective:7 (0)

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

iterations count:118 (1), effective:6 (0)

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

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

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

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

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

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

iterations count:232 (2), effective:23 (0)

iterations count:119 (1), effective:6 (0)

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

iterations count:200 (2), effective:27 (0)

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

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

iterations count:161 (2), effective:11 (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="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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is 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 r321-tall-167889192500705"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C020.tgz
mv ResAllocation-PT-R003C020 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;