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-167889192500689.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-R003C010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192500689
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.8K Feb 25 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 15:31 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 4.1K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 16K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 25 15:33 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 71K 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-R003C010-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678940671266

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-R003C010
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_R003C010
(NrP: 60 NrTr: 40 NrArc: 174)

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

net check time: 0m 0.000sec

init dd package: 0m 2.862sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 376 (3.8e+02) #states 823,552 (5)



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

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

abstracting: (r_5_0<=0)
states: 418,304 (5)
...
EG iterations: 2
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.022sec

checking: ~ [EG [EX [~ [AX [AF [1<=p_2_0]]]]]]
normalized: ~ [EG [EX [EX [EG [~ [1<=p_2_0]]]]]]

abstracting: (1<=p_2_0)
states: 340,864 (5)
...............
EG iterations: 15
...
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.044sec

checking: AX [[1<=r_7_2 & EG [EF [AG [r_1_1<=1]]]]]
normalized: ~ [EX [~ [[EG [E [true U ~ [E [true U ~ [r_1_1<=1]]]]] & 1<=r_7_2]]]]

abstracting: (1<=r_7_2)
states: 417,664 (5)
abstracting: (r_1_1<=1)
states: 823,552 (5)

EG iterations: 0
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: ~ [AF [~ [E [EX [[r_8_2<=0 | 1<=r_0_2]] U p_3_0<=0]]]]
normalized: EG [E [EX [[r_8_2<=0 | 1<=r_0_2]] U p_3_0<=0]]

abstracting: (p_3_0<=0)
states: 727,552 (5)
abstracting: (1<=r_0_2)
states: 326,784 (5)
abstracting: (r_8_2<=0)
states: 444,288 (5)
.
EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AX [[EF [[~ [r_6_1<=r_0_2] & AF [~ [p_5_0<=p_7_0]]]] | AF [AG [p_4_2<=p_4_2]]]]
normalized: ~ [EX [~ [[~ [EG [E [true U ~ [p_4_2<=p_4_2]]]] | E [true U [~ [EG [p_5_0<=p_7_0]] & ~ [r_6_1<=r_0_2]]]]]]]

abstracting: (r_6_1<=r_0_2)
states: 592,448 (5)
abstracting: (p_5_0<=p_7_0)
states: 750,592 (5)
.
EG iterations: 1
abstracting: (p_4_2<=p_4_2)
states: 823,552 (5)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [AG [[1<=p_8_2 & [~ [[EX [r_8_0<=0] | [r_1_1<=0 | r_5_1<=p_8_0]]] & ~ [[1<=p_0_0 | ~ [1<=p_8_2]]]]]]]
normalized: E [true U ~ [E [true U ~ [[1<=p_8_2 & [~ [[1<=p_0_0 | ~ [1<=p_8_2]]] & ~ [[[r_1_1<=0 | r_5_1<=p_8_0] | EX [r_8_0<=0]]]]]]]]]

abstracting: (r_8_0<=0)
states: 496,768 (5)
.abstracting: (r_5_1<=p_8_0)
states: 532,736 (5)
abstracting: (r_1_1<=0)
states: 389,632 (5)
abstracting: (1<=p_8_2)
states: 65,024 (4)
abstracting: (1<=p_0_0)
states: 379,264 (5)
abstracting: (1<=p_8_2)
states: 65,024 (4)
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EG [~ [A [[EG [[p_2_1<=r_9_2 | r_1_1<=0]] | ~ [AX [p_0_2<=p_9_1]]] U ~ [p_1_1<=r_7_2]]]]
normalized: EG [~ [[~ [EG [p_1_1<=r_7_2]] & ~ [E [p_1_1<=r_7_2 U [~ [[EX [~ [p_0_2<=p_9_1]] | EG [[p_2_1<=r_9_2 | r_1_1<=0]]]] & p_1_1<=r_7_2]]]]]]

abstracting: (p_1_1<=r_7_2)
states: 752,320 (5)
abstracting: (r_1_1<=0)
states: 389,632 (5)
abstracting: (p_2_1<=r_9_2)
states: 710,656 (5)

EG iterations: 0
abstracting: (p_0_2<=p_9_1)
states: 678,272 (5)
.abstracting: (p_1_1<=r_7_2)
states: 752,320 (5)
abstracting: (p_1_1<=r_7_2)
states: 752,320 (5)
.............
EG iterations: 13
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.029sec

checking: EX [EF [[[1<=r_9_2 & r_5_0<=0] & [EF [A [r_5_1<=1 U 1<=p_5_1]] & ~ [[p_0_1<=0 | [r_9_1<=0 & r_4_1<=r_5_0]]]]]]]
normalized: EX [E [true U [[~ [[[r_9_1<=0 & r_4_1<=r_5_0] | p_0_1<=0]] & E [true U [~ [EG [~ [1<=p_5_1]]] & ~ [E [~ [1<=p_5_1] U [~ [r_5_1<=1] & ~ [1<=p_5_1]]]]]]] & [1<=r_9_2 & r_5_0<=0]]]]

abstracting: (r_5_0<=0)
states: 418,304 (5)
abstracting: (1<=r_9_2)
states: 444,288 (5)
abstracting: (1<=p_5_1)
states: 216,448 (5)
abstracting: (r_5_1<=1)
states: 823,552 (5)
abstracting: (1<=p_5_1)
states: 216,448 (5)
abstracting: (1<=p_5_1)
states: 216,448 (5)
..............
EG iterations: 14
abstracting: (p_0_1<=0)
states: 499,712 (5)
abstracting: (r_4_1<=r_5_0)
states: 620,096 (5)
abstracting: (r_9_1<=0)
states: 323,840 (5)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: ~ [A [AX [[~ [E [1<=r_6_2 U p_2_0<=0]] & ~ [[EG [p_2_2<=0] & ~ [p_8_0<=0]]]]] U EX [AF [[[1<=r_9_2 | p_8_0<=p_9_1] & ~ [p_3_0<=1]]]]]]
normalized: ~ [[~ [EG [~ [EX [~ [EG [~ [[~ [p_3_0<=1] & [1<=r_9_2 | p_8_0<=p_9_1]]]]]]]]] & ~ [E [~ [EX [~ [EG [~ [[~ [p_3_0<=1] & [1<=r_9_2 | p_8_0<=p_9_1]]]]]]] U [EX [~ [[~ [[~ [p_8_0<=0] & EG [p_2_2<=0]]] & ~ [E [1<=r_6_2 U p_2_0<=0]]]]] & ~ [EX [~ [EG [~ [[~ [p_3_0<=1] & [1<=r_9_2 | p_8_0<=p_9_1]]]]]]]]]]]]

abstracting: (p_8_0<=p_9_1)
states: 650,624 (5)
abstracting: (1<=r_9_2)
states: 444,288 (5)
abstracting: (p_3_0<=1)
states: 823,552 (5)

EG iterations: 0
.abstracting: (p_2_0<=0)
states: 482,688 (5)
abstracting: (1<=r_6_2)
states: 386,688 (5)
abstracting: (p_2_2<=0)
states: 685,824 (5)
.
EG iterations: 1
abstracting: (p_8_0<=0)
states: 565,632 (5)
.abstracting: (p_8_0<=p_9_1)
states: 650,624 (5)
abstracting: (1<=r_9_2)
states: 444,288 (5)
abstracting: (p_3_0<=1)
states: 823,552 (5)

EG iterations: 0
.abstracting: (p_8_0<=p_9_1)
states: 650,624 (5)
abstracting: (1<=r_9_2)
states: 444,288 (5)
abstracting: (p_3_0<=1)
states: 823,552 (5)

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

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

MC time: 0m 0.019sec

checking: AX [[[[~ [AG [1<=p_3_0]] & A [~ [1<=r_9_2] U [A [1<=r_2_2 U 1<=p_4_1] | [r_9_2<=p_7_0 & p_6_0<=r_4_1]]]] | AX [r_4_1<=r_5_0]] | EG [[1<=r_6_0 | ~ [p_9_2<=0]]]]]
normalized: ~ [EX [~ [[EG [[1<=r_6_0 | ~ [p_9_2<=0]]] | [~ [EX [~ [r_4_1<=r_5_0]]] | [[~ [EG [~ [[[r_9_2<=p_7_0 & p_6_0<=r_4_1] | [~ [EG [~ [1<=p_4_1]]] & ~ [E [~ [1<=p_4_1] U [~ [1<=r_2_2] & ~ [1<=p_4_1]]]]]]]]] & ~ [E [~ [[[r_9_2<=p_7_0 & p_6_0<=r_4_1] | [~ [EG [~ [1<=p_4_1]]] & ~ [E [~ [1<=p_4_1] U [~ [1<=r_2_2] & ~ [1<=p_4_1]]]]]]] U [1<=r_9_2 & ~ [[[r_9_2<=p_7_0 & p_6_0<=r_4_1] | [~ [EG [~ [1<=p_4_1]]] & ~ [E [~ [1<=p_4_1] U [~ [1<=r_2_2] & ~ [1<=p_4_1]]]]]]]]]]] & E [true U ~ [1<=p_3_0]]]]]]]]

abstracting: (1<=p_3_0)
states: 96,000 (4)
abstracting: (1<=p_4_1)
states: 216,448 (5)
abstracting: (1<=r_2_2)
states: 379,392 (5)
abstracting: (1<=p_4_1)
states: 216,448 (5)
abstracting: (1<=p_4_1)
states: 216,448 (5)
..............
EG iterations: 14
abstracting: (p_6_0<=r_4_1)
states: 664,640 (5)
abstracting: (r_9_2<=p_7_0)
states: 448,128 (5)
abstracting: (1<=r_9_2)
states: 444,288 (5)
abstracting: (1<=p_4_1)
states: 216,448 (5)
abstracting: (1<=r_2_2)
states: 379,392 (5)
abstracting: (1<=p_4_1)
states: 216,448 (5)
abstracting: (1<=p_4_1)
states: 216,448 (5)
..............
EG iterations: 14
abstracting: (p_6_0<=r_4_1)
states: 664,640 (5)
abstracting: (r_9_2<=p_7_0)
states: 448,128 (5)
abstracting: (1<=p_4_1)
states: 216,448 (5)
abstracting: (1<=r_2_2)
states: 379,392 (5)
abstracting: (1<=p_4_1)
states: 216,448 (5)
abstracting: (1<=p_4_1)
states: 216,448 (5)
..............
EG iterations: 14
abstracting: (p_6_0<=r_4_1)
states: 664,640 (5)
abstracting: (r_9_2<=p_7_0)
states: 448,128 (5)
..................
EG iterations: 18
abstracting: (r_4_1<=r_5_0)
states: 620,096 (5)
.abstracting: (p_9_2<=0)
states: 444,288 (5)
abstracting: (1<=r_6_0)
states: 379,392 (5)
..............
EG iterations: 14
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

checking: [[A [r_4_0<=p_1_0 U [[[[~ [p_0_1<=1] & [p_6_2<=1 | 1<=r_0_1]] & [~ [1<=p_1_2] | E [r_1_2<=p_9_2 U r_5_0<=1]]] | AG [p_5_2<=p_9_1]] | 1<=p_4_1]] | EX [AF [AF [AG [r_6_2<=1]]]]] | AF [AG [1<=r_9_1]]]
normalized: [~ [EG [E [true U ~ [1<=r_9_1]]]] | [EX [~ [EG [EG [E [true U ~ [r_6_2<=1]]]]]] | [~ [EG [~ [[[~ [E [true U ~ [p_5_2<=p_9_1]]] | [[E [r_1_2<=p_9_2 U r_5_0<=1] | ~ [1<=p_1_2]] & [[p_6_2<=1 | 1<=r_0_1] & ~ [p_0_1<=1]]]] | 1<=p_4_1]]]] & ~ [E [~ [[[~ [E [true U ~ [p_5_2<=p_9_1]]] | [[E [r_1_2<=p_9_2 U r_5_0<=1] | ~ [1<=p_1_2]] & [[p_6_2<=1 | 1<=r_0_1] & ~ [p_0_1<=1]]]] | 1<=p_4_1]] U [~ [r_4_0<=p_1_0] & ~ [[[~ [E [true U ~ [p_5_2<=p_9_1]]] | [[E [r_1_2<=p_9_2 U r_5_0<=1] | ~ [1<=p_1_2]] & [[p_6_2<=1 | 1<=r_0_1] & ~ [p_0_1<=1]]]] | 1<=p_4_1]]]]]]]]

abstracting: (1<=p_4_1)
states: 216,448 (5)
abstracting: (p_0_1<=1)
states: 823,552 (5)
abstracting: (1<=r_0_1)
states: 356,352 (5)
abstracting: (p_6_2<=1)
states: 823,552 (5)
abstracting: (1<=p_1_2)
states: 257,920 (5)
abstracting: (r_5_0<=1)
states: 823,552 (5)
abstracting: (r_1_2<=p_9_2)
states: 592,960 (5)
abstracting: (p_5_2<=p_9_1)
states: 632,320 (5)
abstracting: (r_4_0<=p_1_0)
states: 467,712 (5)
abstracting: (1<=p_4_1)
states: 216,448 (5)
abstracting: (p_0_1<=1)
states: 823,552 (5)
abstracting: (1<=r_0_1)
states: 356,352 (5)
abstracting: (p_6_2<=1)
states: 823,552 (5)
abstracting: (1<=p_1_2)
states: 257,920 (5)
abstracting: (r_5_0<=1)
states: 823,552 (5)
abstracting: (r_1_2<=p_9_2)
states: 592,960 (5)
abstracting: (p_5_2<=p_9_1)
states: 632,320 (5)
abstracting: (1<=p_4_1)
states: 216,448 (5)
abstracting: (p_0_1<=1)
states: 823,552 (5)
abstracting: (1<=r_0_1)
states: 356,352 (5)
abstracting: (p_6_2<=1)
states: 823,552 (5)
abstracting: (1<=p_1_2)
states: 257,920 (5)
abstracting: (r_5_0<=1)
states: 823,552 (5)
abstracting: (r_1_2<=p_9_2)
states: 592,960 (5)
abstracting: (p_5_2<=p_9_1)
states: 632,320 (5)
...............
EG iterations: 15
abstracting: (r_6_2<=1)
states: 823,552 (5)
.
EG iterations: 1
.
EG iterations: 1
.abstracting: (1<=r_9_1)
states: 499,712 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: [AF [~ [A [AF [AF [1<=r_3_1]] U [[[r_5_2<=p_6_2 | p_7_1<=r_1_2] | ~ [p_6_2<=1]] | [AX [p_2_2<=r_2_0] | [r_2_2<=r_3_1 & 1<=p_0_0]]]]]] | [AG [r_5_1<=r_8_1] | ~ [AX [1<=r_0_0]]]]
normalized: [[EX [~ [1<=r_0_0]] | ~ [E [true U ~ [r_5_1<=r_8_1]]]] | ~ [EG [[~ [EG [~ [[[[r_2_2<=r_3_1 & 1<=p_0_0] | ~ [EX [~ [p_2_2<=r_2_0]]]] | [~ [p_6_2<=1] | [r_5_2<=p_6_2 | p_7_1<=r_1_2]]]]]] & ~ [E [~ [[[[r_2_2<=r_3_1 & 1<=p_0_0] | ~ [EX [~ [p_2_2<=r_2_0]]]] | [~ [p_6_2<=1] | [r_5_2<=p_6_2 | p_7_1<=r_1_2]]]] U [EG [EG [~ [1<=r_3_1]]] & ~ [[[[r_2_2<=r_3_1 & 1<=p_0_0] | ~ [EX [~ [p_2_2<=r_2_0]]]] | [~ [p_6_2<=1] | [r_5_2<=p_6_2 | p_7_1<=r_1_2]]]]]]]]]]]

abstracting: (p_7_1<=r_1_2)
states: 707,072 (5)
abstracting: (r_5_2<=p_6_2)
states: 418,560 (5)
abstracting: (p_6_2<=1)
states: 823,552 (5)
abstracting: (p_2_2<=r_2_0)
states: 754,688 (5)
.abstracting: (1<=p_0_0)
states: 379,264 (5)
abstracting: (r_2_2<=r_3_1)
states: 626,560 (5)
abstracting: (1<=r_3_1)
states: 412,800 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p_7_1<=r_1_2)
states: 707,072 (5)
abstracting: (r_5_2<=p_6_2)
states: 418,560 (5)
abstracting: (p_6_2<=1)
states: 823,552 (5)
abstracting: (p_2_2<=r_2_0)
states: 754,688 (5)
.abstracting: (1<=p_0_0)
states: 379,264 (5)
abstracting: (r_2_2<=r_3_1)
states: 626,560 (5)
abstracting: (p_7_1<=r_1_2)
states: 707,072 (5)
abstracting: (r_5_2<=p_6_2)
states: 418,560 (5)
abstracting: (p_6_2<=1)
states: 823,552 (5)
abstracting: (p_2_2<=r_2_0)
states: 754,688 (5)
.abstracting: (1<=p_0_0)
states: 379,264 (5)
abstracting: (r_2_2<=r_3_1)
states: 626,560 (5)
.............
EG iterations: 13
.
EG iterations: 1
abstracting: (r_5_1<=r_8_1)
states: 593,664 (5)
abstracting: (1<=r_0_0)
states: 379,264 (5)
.-> the formula is TRUE

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

MC time: 0m 0.029sec

checking: E [[[E [EG [[r_8_1<=r_8_2 | 1<=p_8_2]] U [r_9_0<=0 & AG [1<=r_7_2]]] | ~ [p_2_0<=r_2_1]] & EF [~ [[[[1<=p_7_0 & 1<=p_4_0] | p_6_2<=p_5_2] & [~ [1<=r_1_0] & EG [1<=p_4_0]]]]]] U AG [AX [~ [EF [p_1_2<=r_5_0]]]]]
normalized: E [[E [true U ~ [[[EG [1<=p_4_0] & ~ [1<=r_1_0]] & [p_6_2<=p_5_2 | [1<=p_7_0 & 1<=p_4_0]]]]] & [~ [p_2_0<=r_2_1] | E [EG [[r_8_1<=r_8_2 | 1<=p_8_2]] U [r_9_0<=0 & ~ [E [true U ~ [1<=r_7_2]]]]]]] U ~ [E [true U EX [E [true U p_1_2<=r_5_0]]]]]

abstracting: (p_1_2<=r_5_0)
states: 690,944 (5)
.abstracting: (1<=r_7_2)
states: 417,664 (5)
abstracting: (r_9_0<=0)
states: 238,848 (5)
abstracting: (1<=p_8_2)
states: 65,024 (4)
abstracting: (r_8_1<=r_8_2)
states: 629,120 (5)
..............
EG iterations: 14
abstracting: (p_2_0<=r_2_1)
states: 635,392 (5)
abstracting: (1<=p_4_0)
states: 322,560 (5)
abstracting: (1<=p_7_0)
states: 137,728 (5)
abstracting: (p_6_2<=p_5_2)
states: 727,552 (5)
abstracting: (1<=r_1_0)
states: 417,664 (5)
abstracting: (1<=p_4_0)
states: 322,560 (5)
.............
EG iterations: 13
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.062sec

checking: AF [[EF [[AG [~ [r_7_1<=r_3_0]] & EX [~ [1<=r_8_2]]]] | [A [AG [[p_5_2<=1 | r_1_2<=0]] U A [1<=r_0_2 U ~ [p_0_2<=r_6_2]]] | ~ [[A [[1<=p_0_1 | 1<=r_4_0] U AF [p_1_1<=r_6_2]] | [1<=r_0_2 | [[r_2_1<=0 & r_6_0<=p_6_1] & [1<=r_9_0 | 1<=p_3_2]]]]]]]]
normalized: ~ [EG [~ [[[~ [[[1<=r_0_2 | [[1<=r_9_0 | 1<=p_3_2] & [r_2_1<=0 & r_6_0<=p_6_1]]] | [~ [EG [EG [~ [p_1_1<=r_6_2]]]] & ~ [E [EG [~ [p_1_1<=r_6_2]] U [~ [[1<=p_0_1 | 1<=r_4_0]] & EG [~ [p_1_1<=r_6_2]]]]]]]] | [~ [EG [~ [[~ [EG [p_0_2<=r_6_2]] & ~ [E [p_0_2<=r_6_2 U [p_0_2<=r_6_2 & ~ [1<=r_0_2]]]]]]]] & ~ [E [~ [[~ [EG [p_0_2<=r_6_2]] & ~ [E [p_0_2<=r_6_2 U [p_0_2<=r_6_2 & ~ [1<=r_0_2]]]]]] U [E [true U ~ [[p_5_2<=1 | r_1_2<=0]]] & ~ [[~ [EG [p_0_2<=r_6_2]] & ~ [E [p_0_2<=r_6_2 U [p_0_2<=r_6_2 & ~ [1<=r_0_2]]]]]]]]]]] | E [true U [EX [~ [1<=r_8_2]] & ~ [E [true U r_7_1<=r_3_0]]]]]]]]

abstracting: (r_7_1<=r_3_0)
states: 601,408 (5)
abstracting: (1<=r_8_2)
states: 379,264 (5)
.abstracting: (1<=r_0_2)
states: 326,784 (5)
abstracting: (p_0_2<=r_6_2)
states: 696,064 (5)
abstracting: (p_0_2<=r_6_2)
states: 696,064 (5)
abstracting: (p_0_2<=r_6_2)
states: 696,064 (5)
.
EG iterations: 1
abstracting: (r_1_2<=0)
states: 395,648 (5)
abstracting: (p_5_2<=1)
states: 823,552 (5)
abstracting: (1<=r_0_2)
states: 326,784 (5)
abstracting: (p_0_2<=r_6_2)
states: 696,064 (5)
abstracting: (p_0_2<=r_6_2)
states: 696,064 (5)
abstracting: (p_0_2<=r_6_2)
states: 696,064 (5)
.
EG iterations: 1
abstracting: (1<=r_0_2)
states: 326,784 (5)
abstracting: (p_0_2<=r_6_2)
states: 696,064 (5)
abstracting: (p_0_2<=r_6_2)
states: 696,064 (5)
abstracting: (p_0_2<=r_6_2)
states: 696,064 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p_1_1<=r_6_2)
states: 748,480 (5)
.............
EG iterations: 13
abstracting: (1<=r_4_0)
states: 389,120 (5)
abstracting: (1<=p_0_1)
states: 323,840 (5)
abstracting: (p_1_1<=r_6_2)
states: 748,480 (5)
.............
EG iterations: 13
abstracting: (p_1_1<=r_6_2)
states: 748,480 (5)
.............
EG iterations: 13
.
EG iterations: 1
abstracting: (r_6_0<=p_6_1)
states: 541,312 (5)
abstracting: (r_2_1<=0)
states: 440,576 (5)
abstracting: (1<=p_3_2)
states: 306,432 (5)
abstracting: (1<=r_9_0)
states: 584,704 (5)
abstracting: (1<=r_0_2)
states: 326,784 (5)
..........
EG iterations: 10
-> the formula is TRUE

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

MC time: 0m 0.092sec

checking: A [[[p_4_0<=r_5_0 & r_5_1<=p_4_2] & [[[E [AF [1<=p_7_0] U AX [r_4_0<=0]] & [AF [r_1_0<=r_5_0] & AG [r_1_2<=0]]] & [[1<=r_7_0 & AF [p_2_2<=p_8_0]] & AG [[1<=p_7_0 | 1<=p_0_0]]]] | AF [EG [AF [r_6_2<=r_2_2]]]]] U E [A [EG [r_0_1<=0] U [[1<=r_6_1 & [r_0_0<=1 | 1<=p_2_1]] & EX [p_3_2<=p_4_0]]] U EX [[[[p_4_1<=p_5_1 & r_8_2<=1] | [r_7_2<=1 & 1<=r_1_1]] & r_7_0<=1]]]]
normalized: [~ [EG [~ [E [[~ [EG [~ [[EX [p_3_2<=p_4_0] & [1<=r_6_1 & [r_0_0<=1 | 1<=p_2_1]]]]]] & ~ [E [~ [[EX [p_3_2<=p_4_0] & [1<=r_6_1 & [r_0_0<=1 | 1<=p_2_1]]]] U [~ [EG [r_0_1<=0]] & ~ [[EX [p_3_2<=p_4_0] & [1<=r_6_1 & [r_0_0<=1 | 1<=p_2_1]]]]]]]] U EX [[r_7_0<=1 & [[r_7_2<=1 & 1<=r_1_1] | [p_4_1<=p_5_1 & r_8_2<=1]]]]]]]] & ~ [E [~ [E [[~ [EG [~ [[EX [p_3_2<=p_4_0] & [1<=r_6_1 & [r_0_0<=1 | 1<=p_2_1]]]]]] & ~ [E [~ [[EX [p_3_2<=p_4_0] & [1<=r_6_1 & [r_0_0<=1 | 1<=p_2_1]]]] U [~ [EG [r_0_1<=0]] & ~ [[EX [p_3_2<=p_4_0] & [1<=r_6_1 & [r_0_0<=1 | 1<=p_2_1]]]]]]]] U EX [[r_7_0<=1 & [[r_7_2<=1 & 1<=r_1_1] | [p_4_1<=p_5_1 & r_8_2<=1]]]]]] U [~ [[[~ [EG [~ [EG [~ [EG [~ [r_6_2<=r_2_2]]]]]]] | [[~ [E [true U ~ [[1<=p_7_0 | 1<=p_0_0]]]] & [1<=r_7_0 & ~ [EG [~ [p_2_2<=p_8_0]]]]] & [[~ [E [true U ~ [r_1_2<=0]]] & ~ [EG [~ [r_1_0<=r_5_0]]]] & E [~ [EG [~ [1<=p_7_0]]] U ~ [EX [~ [r_4_0<=0]]]]]]] & [p_4_0<=r_5_0 & r_5_1<=p_4_2]]] & ~ [E [[~ [EG [~ [[EX [p_3_2<=p_4_0] & [1<=r_6_1 & [r_0_0<=1 | 1<=p_2_1]]]]]] & ~ [E [~ [[EX [p_3_2<=p_4_0] & [1<=r_6_1 & [r_0_0<=1 | 1<=p_2_1]]]] U [~ [EG [r_0_1<=0]] & ~ [[EX [p_3_2<=p_4_0] & [1<=r_6_1 & [r_0_0<=1 | 1<=p_2_1]]]]]]]] U EX [[r_7_0<=1 & [[r_7_2<=1 & 1<=r_1_1] | [p_4_1<=p_5_1 & r_8_2<=1]]]]]]]]]]

abstracting: (r_8_2<=1)
states: 823,552 (5)
abstracting: (p_4_1<=p_5_1)
states: 607,104 (5)
abstracting: (1<=r_1_1)
states: 433,920 (5)
abstracting: (r_7_2<=1)
states: 823,552 (5)
abstracting: (r_7_0<=1)
states: 823,552 (5)
.abstracting: (1<=p_2_1)
states: 246,272 (5)
abstracting: (r_0_0<=1)
states: 823,552 (5)
abstracting: (1<=r_6_1)
states: 382,976 (5)
abstracting: (p_3_2<=p_4_0)
states: 628,672 (5)
.abstracting: (r_0_1<=0)
states: 467,200 (5)
.
EG iterations: 1
abstracting: (1<=p_2_1)
states: 246,272 (5)
abstracting: (r_0_0<=1)
states: 823,552 (5)
abstracting: (1<=r_6_1)
states: 382,976 (5)
abstracting: (p_3_2<=p_4_0)
states: 628,672 (5)
.abstracting: (1<=p_2_1)
states: 246,272 (5)
abstracting: (r_0_0<=1)
states: 823,552 (5)
abstracting: (1<=r_6_1)
states: 382,976 (5)
abstracting: (p_3_2<=p_4_0)
states: 628,672 (5)
............
EG iterations: 11
abstracting: (r_5_1<=p_4_2)
states: 481,408 (5)
abstracting: (p_4_0<=r_5_0)
states: 684,416 (5)
abstracting: (r_4_0<=0)
states: 434,432 (5)
.abstracting: (1<=p_7_0)
states: 137,728 (5)
.
EG iterations: 1
abstracting: (r_1_0<=r_5_0)
states: 608,640 (5)
..................
EG iterations: 18
abstracting: (r_1_2<=0)
states: 395,648 (5)
abstracting: (p_2_2<=p_8_0)
states: 730,112 (5)
.
EG iterations: 1
abstracting: (1<=r_7_0)
states: 427,904 (5)
abstracting: (1<=p_0_0)
states: 379,264 (5)
abstracting: (1<=p_7_0)
states: 137,728 (5)
abstracting: (r_6_2<=r_2_2)
states: 613,376 (5)
..................
EG iterations: 18
.
EG iterations: 1
.
EG iterations: 1
abstracting: (r_8_2<=1)
states: 823,552 (5)
abstracting: (p_4_1<=p_5_1)
states: 607,104 (5)
abstracting: (1<=r_1_1)
states: 433,920 (5)
abstracting: (r_7_2<=1)
states: 823,552 (5)
abstracting: (r_7_0<=1)
states: 823,552 (5)
.abstracting: (1<=p_2_1)
states: 246,272 (5)
abstracting: (r_0_0<=1)
states: 823,552 (5)
abstracting: (1<=r_6_1)
states: 382,976 (5)
abstracting: (p_3_2<=p_4_0)
states: 628,672 (5)
.abstracting: (r_0_1<=0)
states: 467,200 (5)
.
EG iterations: 1
abstracting: (1<=p_2_1)
states: 246,272 (5)
abstracting: (r_0_0<=1)
states: 823,552 (5)
abstracting: (1<=r_6_1)
states: 382,976 (5)
abstracting: (p_3_2<=p_4_0)
states: 628,672 (5)
.abstracting: (1<=p_2_1)
states: 246,272 (5)
abstracting: (r_0_0<=1)
states: 823,552 (5)
abstracting: (1<=r_6_1)
states: 382,976 (5)
abstracting: (p_3_2<=p_4_0)
states: 628,672 (5)
............
EG iterations: 11
abstracting: (r_8_2<=1)
states: 823,552 (5)
abstracting: (p_4_1<=p_5_1)
states: 607,104 (5)
abstracting: (1<=r_1_1)
states: 433,920 (5)
abstracting: (r_7_2<=1)
states: 823,552 (5)
abstracting: (r_7_0<=1)
states: 823,552 (5)
.abstracting: (1<=p_2_1)
states: 246,272 (5)
abstracting: (r_0_0<=1)
states: 823,552 (5)
abstracting: (1<=r_6_1)
states: 382,976 (5)
abstracting: (p_3_2<=p_4_0)
states: 628,672 (5)
.abstracting: (r_0_1<=0)
states: 467,200 (5)
.
EG iterations: 1
abstracting: (1<=p_2_1)
states: 246,272 (5)
abstracting: (r_0_0<=1)
states: 823,552 (5)
abstracting: (1<=r_6_1)
states: 382,976 (5)
abstracting: (p_3_2<=p_4_0)
states: 628,672 (5)
.abstracting: (1<=p_2_1)
states: 246,272 (5)
abstracting: (r_0_0<=1)
states: 823,552 (5)
abstracting: (1<=r_6_1)
states: 382,976 (5)
abstracting: (p_3_2<=p_4_0)
states: 628,672 (5)
............
EG iterations: 11
............
EG iterations: 12
-> the formula is TRUE

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

MC time: 0m 0.168sec

checking: [~ [AG [p_0_2<=p_0_2]] & A [A [[[r_4_2<=r_1_2 & [[p_8_0<=1 | 1<=p_2_1] & [1<=r_8_1 & 1<=r_6_0]]] & AX [~ [r_9_1<=0]]] U EG [EF [1<=p_2_1]]] U [[A [r_9_2<=1 U EF [1<=p_3_2]] | [[EX [1<=p_2_2] & [[r_4_1<=r_1_2 & p_1_1<=0] | AG [1<=r_3_0]]] | p_9_0<=p_4_0]] & [EX [EG [r_9_0<=r_6_2]] | [[~ [AF [r_0_2<=r_8_2]] & ~ [r_5_0<=0]] & [p_6_0<=1 & [1<=p_2_1 | [p_9_1<=p_6_1 & 1<=p_0_1]]]]]]]]
normalized: [E [true U ~ [p_0_2<=p_0_2]] & [~ [EG [~ [[[[~ [E [~ [E [true U 1<=p_3_2]] U [~ [E [true U 1<=p_3_2]] & ~ [r_9_2<=1]]]] & ~ [EG [~ [E [true U 1<=p_3_2]]]]] | [p_9_0<=p_4_0 | [[[r_4_1<=r_1_2 & p_1_1<=0] | ~ [E [true U ~ [1<=r_3_0]]]] & EX [1<=p_2_2]]]] & [[[p_6_0<=1 & [1<=p_2_1 | [p_9_1<=p_6_1 & 1<=p_0_1]]] & [~ [r_5_0<=0] & EG [~ [r_0_2<=r_8_2]]]] | EX [EG [r_9_0<=r_6_2]]]]]]] & ~ [E [~ [[[[~ [E [~ [E [true U 1<=p_3_2]] U [~ [E [true U 1<=p_3_2]] & ~ [r_9_2<=1]]]] & ~ [EG [~ [E [true U 1<=p_3_2]]]]] | [p_9_0<=p_4_0 | [[[r_4_1<=r_1_2 & p_1_1<=0] | ~ [E [true U ~ [1<=r_3_0]]]] & EX [1<=p_2_2]]]] & [[[p_6_0<=1 & [1<=p_2_1 | [p_9_1<=p_6_1 & 1<=p_0_1]]] & [~ [r_5_0<=0] & EG [~ [r_0_2<=r_8_2]]]] | EX [EG [r_9_0<=r_6_2]]]]] U [~ [[[[~ [E [~ [E [true U 1<=p_3_2]] U [~ [E [true U 1<=p_3_2]] & ~ [r_9_2<=1]]]] & ~ [EG [~ [E [true U 1<=p_3_2]]]]] | [p_9_0<=p_4_0 | [[[r_4_1<=r_1_2 & p_1_1<=0] | ~ [E [true U ~ [1<=r_3_0]]]] & EX [1<=p_2_2]]]] & [[[p_6_0<=1 & [1<=p_2_1 | [p_9_1<=p_6_1 & 1<=p_0_1]]] & [~ [r_5_0<=0] & EG [~ [r_0_2<=r_8_2]]]] | EX [EG [r_9_0<=r_6_2]]]]] & ~ [[~ [EG [~ [EG [E [true U 1<=p_2_1]]]]] & ~ [E [~ [EG [E [true U 1<=p_2_1]]] U [~ [[~ [EX [r_9_1<=0]] & [r_4_2<=r_1_2 & [[1<=r_8_1 & 1<=r_6_0] & [p_8_0<=1 | 1<=p_2_1]]]]] & ~ [EG [E [true U 1<=p_2_1]]]]]]]]]]]]]

abstracting: (1<=p_2_1)
states: 246,272 (5)
.
EG iterations: 1
abstracting: (1<=p_2_1)
states: 246,272 (5)
abstracting: (p_8_0<=1)
states: 823,552 (5)
abstracting: (1<=r_6_0)
states: 379,392 (5)
abstracting: (1<=r_8_1)
states: 356,352 (5)
abstracting: (r_4_2<=r_1_2)
states: 642,880 (5)
abstracting: (r_9_1<=0)
states: 323,840 (5)
.abstracting: (1<=p_2_1)
states: 246,272 (5)
.
EG iterations: 1
abstracting: (1<=p_2_1)
states: 246,272 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (r_9_0<=r_6_2)
states: 515,712 (5)
...............
EG iterations: 15
.abstracting: (r_0_2<=r_8_2)
states: 647,232 (5)
......................
EG iterations: 22
abstracting: (r_5_0<=0)
states: 418,304 (5)
abstracting: (1<=p_0_1)
states: 323,840 (5)
abstracting: (p_9_1<=p_6_1)
states: 562,880 (5)
abstracting: (1<=p_2_1)
states: 246,272 (5)
abstracting: (p_6_0<=1)
states: 823,552 (5)
abstracting: (1<=p_2_2)
states: 137,728 (5)
.abstracting: (1<=r_3_0)
states: 404,992 (5)
abstracting: (p_1_1<=0)
states: 680,192 (5)
abstracting: (r_4_1<=r_1_2)
states: 638,976 (5)
abstracting: (p_9_0<=p_4_0)
states: 675,072 (5)
abstracting: (1<=p_3_2)
states: 306,432 (5)
.
EG iterations: 1
abstracting: (r_9_2<=1)
states: 823,552 (5)
abstracting: (1<=p_3_2)
states: 306,432 (5)
abstracting: (1<=p_3_2)
states: 306,432 (5)
abstracting: (r_9_0<=r_6_2)
states: 515,712 (5)
...............
EG iterations: 15
.abstracting: (r_0_2<=r_8_2)
states: 647,232 (5)
......................
EG iterations: 22
abstracting: (r_5_0<=0)
states: 418,304 (5)
abstracting: (1<=p_0_1)
states: 323,840 (5)
abstracting: (p_9_1<=p_6_1)
states: 562,880 (5)
abstracting: (1<=p_2_1)
states: 246,272 (5)
abstracting: (p_6_0<=1)
states: 823,552 (5)
abstracting: (1<=p_2_2)
states: 137,728 (5)
.abstracting: (1<=r_3_0)
states: 404,992 (5)
abstracting: (p_1_1<=0)
states: 680,192 (5)
abstracting: (r_4_1<=r_1_2)
states: 638,976 (5)
abstracting: (p_9_0<=p_4_0)
states: 675,072 (5)
abstracting: (1<=p_3_2)
states: 306,432 (5)
.
EG iterations: 1
abstracting: (r_9_2<=1)
states: 823,552 (5)
abstracting: (1<=p_3_2)
states: 306,432 (5)
abstracting: (1<=p_3_2)
states: 306,432 (5)
abstracting: (r_9_0<=r_6_2)
states: 515,712 (5)
...............
EG iterations: 15
.abstracting: (r_0_2<=r_8_2)
states: 647,232 (5)
......................
EG iterations: 22
abstracting: (r_5_0<=0)
states: 418,304 (5)
abstracting: (1<=p_0_1)
states: 323,840 (5)
abstracting: (p_9_1<=p_6_1)
states: 562,880 (5)
abstracting: (1<=p_2_1)
states: 246,272 (5)
abstracting: (p_6_0<=1)
states: 823,552 (5)
abstracting: (1<=p_2_2)
states: 137,728 (5)
.abstracting: (1<=r_3_0)
states: 404,992 (5)
abstracting: (p_1_1<=0)
states: 680,192 (5)
abstracting: (r_4_1<=r_1_2)
states: 638,976 (5)
abstracting: (p_9_0<=p_4_0)
states: 675,072 (5)
abstracting: (1<=p_3_2)
states: 306,432 (5)
.
EG iterations: 1
abstracting: (r_9_2<=1)
states: 823,552 (5)
abstracting: (1<=p_3_2)
states: 306,432 (5)
abstracting: (1<=p_3_2)
states: 306,432 (5)
.
EG iterations: 1
abstracting: (p_0_2<=p_0_2)
states: 823,552 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.179sec

totally nodes used: 946457 (9.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 331399 1493715 1825114
used/not used/entry size/cache size: 2271729 64837135 16 1024MB
basic ops cache: hits/miss/sum: 105289 425078 530367
used/not used/entry size/cache size: 831975 15945241 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: 2880 13554 16434
used/not used/entry size/cache size: 13540 8375068 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 66239677
1 801287
2 59439
3 7617
4 783
5 57
6 4
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.336sec


BK_STOP 1678940676647

--------------------
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:306 (7), effective:60 (1)

initing FirstDep: 0m 0.000sec


iterations count:436 (10), effective:73 (1)

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

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

iterations count:175 (4), effective:22 (0)

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

iterations count:178 (4), effective:23 (0)

iterations count:179 (4), effective:24 (0)

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

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

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

iterations count:98 (2), effective:11 (0)

iterations count:98 (2), effective:11 (0)

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

iterations count:98 (2), effective:11 (0)

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

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

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

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

iterations count:51 (1), effective:2 (0)

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

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

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

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

iterations count:117 (2), effective:12 (0)

iterations count:81 (2), effective:7 (0)

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

iterations count:51 (1), effective:2 (0)

iterations count:151 (3), effective:18 (0)

iterations count:206 (5), effective:31 (0)

iterations count:122 (3), effective:14 (0)

iterations count:241 (6), effective:32 (0)

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

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

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

iterations count:93 (2), effective:8 (0)

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

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

iterations count:102 (2), effective:10 (0)

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

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

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

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

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

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

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

iterations count:86 (2), effective:8 (0)

iterations count:86 (2), effective:8 (0)

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

iterations count:86 (2), effective:8 (0)

iterations count:121 (3), effective:11 (0)

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

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

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

iterations count:121 (3), effective:11 (0)

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

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

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

iterations count:198 (4), effective:26 (0)

iterations count:121 (3), effective:11 (0)

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

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

iterations count:61 (1), effective:3 (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-R003C010"
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-R003C010, 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-167889192500689"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C010.tgz
mv ResAllocation-PT-R003C010 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 ;