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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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 3.8K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 15:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 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 64K 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-R015C002-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678942489627

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R015C002
Not applying reductions.
Model is PT
ReachabilityCardinality 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ResAllocation_PT_R015C002
(NrP: 60 NrTr: 32 NrArc: 150)

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

net check time: 0m 0.000sec

init dd package: 0m 2.898sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 171 (1.7e+02) #states 278,528 (5)



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

checking: AG [r_1_0<=1]
normalized: ~ [E [true U ~ [r_1_0<=1]]]

abstracting: (r_1_0<=1)
states: 278,528 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

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

abstracting: (p_1_2<=1)
states: 278,528 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [p_1_6<=1]
normalized: E [true U p_1_6<=1]

abstracting: (p_1_6<=1)
states: 278,528 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [r_1_13<=0]
normalized: ~ [E [true U ~ [r_1_13<=0]]]

abstracting: (r_1_13<=0)
states: 122,880 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [p_0_6<=r_1_6]
normalized: ~ [E [true U ~ [p_0_6<=r_1_6]]]

abstracting: (p_0_6<=r_1_6)
states: 278,528 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [p_1_12<=1] & 1<=r_1_11]]
normalized: E [true U [1<=r_1_11 & ~ [p_1_12<=1]]]

abstracting: (p_1_12<=1)
states: 278,528 (5)
abstracting: (1<=r_1_11)
states: 172,032 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[1<=r_0_14 | 1<=r_1_9]]
normalized: ~ [E [true U ~ [[1<=r_0_14 | 1<=r_1_9]]]]

abstracting: (1<=r_1_9)
states: 188,416 (5)
abstracting: (1<=r_0_14)
states: 131,072 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [~ [p_0_1<=p_0_0]]
normalized: E [true U ~ [p_0_1<=p_0_0]]

abstracting: (p_0_1<=p_0_0)
states: 217,088 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[[[[~ [1<=p_1_10] & 1<=r_0_4] & [1<=r_0_10 | [[r_0_4<=p_1_14 | 1<=p_0_0] | ~ [1<=r_0_1]]]] & ~ [[r_1_3<=1 & r_0_8<=r_1_3]]] & [1<=r_1_2 & [~ [r_1_6<=r_1_4] & [[r_1_11<=1 & ~ [r_1_13<=0]] & ~ [p_0_7<=1]]]]]]]
normalized: ~ [E [true U [[[[~ [p_0_7<=1] & [~ [r_1_13<=0] & r_1_11<=1]] & ~ [r_1_6<=r_1_4]] & 1<=r_1_2] & [~ [[r_1_3<=1 & r_0_8<=r_1_3]] & [[[~ [1<=r_0_1] | [r_0_4<=p_1_14 | 1<=p_0_0]] | 1<=r_0_10] & [~ [1<=p_1_10] & 1<=r_0_4]]]]]]

abstracting: (1<=r_0_4)
states: 131,072 (5)
abstracting: (1<=p_1_10)
states: 98,304 (4)
abstracting: (1<=r_0_10)
states: 131,072 (5)
abstracting: (1<=p_0_0)
states: 131,072 (5)
abstracting: (r_0_4<=p_1_14)
states: 208,896 (5)
abstracting: (1<=r_0_1)
states: 131,072 (5)
abstracting: (r_0_8<=r_1_3)
states: 258,048 (5)
abstracting: (r_1_3<=1)
states: 278,528 (5)
abstracting: (1<=r_1_2)
states: 245,760 (5)
abstracting: (r_1_6<=r_1_4)
states: 253,952 (5)
abstracting: (r_1_11<=1)
states: 278,528 (5)
abstracting: (r_1_13<=0)
states: 122,880 (5)
abstracting: (p_0_7<=1)
states: 278,528 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[[[[1<=p_0_9 | [[~ [r_1_5<=0] | 1<=r_1_8] | [[1<=r_1_7 & 1<=r_1_9] | p_1_5<=r_1_5]]] & ~ [[[r_1_12<=r_0_10 & p_1_10<=1] & [r_1_7<=0 | r_1_2<=r_0_1]]]] & r_1_4<=p_0_3] & [r_1_10<=p_1_9 & [r_1_0<=0 & [~ [[[1<=r_1_5 | 1<=p_0_10] & [1<=p_1_11 | r_1_5<=1]]] & [1<=r_0_1 | ~ [p_1_0<=p_0_3]]]]]]]]
normalized: ~ [E [true U [[[[[~ [p_1_0<=p_0_3] | 1<=r_0_1] & ~ [[[1<=p_1_11 | r_1_5<=1] & [1<=r_1_5 | 1<=p_0_10]]]] & r_1_0<=0] & r_1_10<=p_1_9] & [[~ [[[r_1_7<=0 | r_1_2<=r_0_1] & [r_1_12<=r_0_10 & p_1_10<=1]]] & [[[[1<=r_1_7 & 1<=r_1_9] | p_1_5<=r_1_5] | [~ [r_1_5<=0] | 1<=r_1_8]] | 1<=p_0_9]] & r_1_4<=p_0_3]]]]

abstracting: (r_1_4<=p_0_3)
states: 147,456 (5)
abstracting: (1<=p_0_9)
states: 57,344 (4)
abstracting: (1<=r_1_8)
states: 196,608 (5)
abstracting: (r_1_5<=0)
states: 57,344 (4)
abstracting: (p_1_5<=r_1_5)
states: 221,184 (5)
abstracting: (1<=r_1_9)
states: 188,416 (5)
abstracting: (1<=r_1_7)
states: 204,800 (5)
abstracting: (p_1_10<=1)
states: 278,528 (5)
abstracting: (r_1_12<=r_0_10)
states: 192,512 (5)
abstracting: (r_1_2<=r_0_1)
states: 151,552 (5)
abstracting: (r_1_7<=0)
states: 73,728 (4)
abstracting: (r_1_10<=p_1_9)
states: 143,360 (5)
abstracting: (r_1_0<=0)
states: 16,384 (4)
abstracting: (1<=p_0_10)
states: 49,152 (4)
abstracting: (1<=r_1_5)
states: 221,184 (5)
abstracting: (r_1_5<=1)
states: 278,528 (5)
abstracting: (1<=p_1_11)
states: 106,496 (5)
abstracting: (1<=r_0_1)
states: 131,072 (5)
abstracting: (p_1_0<=p_0_3)
states: 262,144 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [[~ [[~ [[p_1_10<=r_0_3 & ~ [r_0_10<=r_1_0]]] & [[[~ [[p_1_0<=r_1_8 & r_1_8<=p_0_0]] | r_0_10<=r_1_10] & [[r_1_6<=r_1_4 & ~ [p_0_13<=1]] & ~ [[1<=p_0_7 | r_0_12<=p_1_4]]]] & [~ [[p_0_9<=r_1_10 & p_1_2<=p_0_13]] & [[[r_0_2<=1 & r_0_4<=p_0_9] | p_1_1<=r_1_4] | 1<=r_0_9]]]]] | ~ [p_1_6<=1]]]
normalized: ~ [E [true U ~ [[~ [p_1_6<=1] | ~ [[[[[[[r_0_2<=1 & r_0_4<=p_0_9] | p_1_1<=r_1_4] | 1<=r_0_9] & ~ [[p_0_9<=r_1_10 & p_1_2<=p_0_13]]] & [[~ [[1<=p_0_7 | r_0_12<=p_1_4]] & [~ [p_0_13<=1] & r_1_6<=r_1_4]] & [~ [[p_1_0<=r_1_8 & r_1_8<=p_0_0]] | r_0_10<=r_1_10]]] & ~ [[~ [r_0_10<=r_1_0] & p_1_10<=r_0_3]]]]]]]]

abstracting: (p_1_10<=r_0_3)
states: 225,280 (5)
abstracting: (r_0_10<=r_1_0)
states: 270,336 (5)
abstracting: (r_0_10<=r_1_10)
states: 278,528 (5)
abstracting: (r_1_8<=p_0_0)
states: 176,128 (5)
abstracting: (p_1_0<=r_1_8)
states: 270,336 (5)
abstracting: (r_1_6<=r_1_4)
states: 253,952 (5)
abstracting: (p_0_13<=1)
states: 278,528 (5)
abstracting: (r_0_12<=p_1_4)
states: 172,032 (5)
abstracting: (1<=p_0_7)
states: 73,728 (4)
abstracting: (p_1_2<=p_0_13)
states: 245,760 (5)
abstracting: (p_0_9<=r_1_10)
states: 270,336 (5)
abstracting: (1<=r_0_9)
states: 131,072 (5)
abstracting: (p_1_1<=r_1_4)
states: 266,240 (5)
abstracting: (r_0_4<=p_0_9)
states: 176,128 (5)
abstracting: (r_0_2<=1)
states: 278,528 (5)
abstracting: (p_1_6<=1)
states: 278,528 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[~ [[[p_0_2<=1 | [p_1_1<=p_1_1 | ~ [p_0_5<=r_0_0]]] | [[[[[~ [1<=r_1_2] | ~ [p_1_10<=1]] & [[1<=p_0_12 | 1<=r_1_6] | r_0_13<=1]] & p_1_8<=0] & ~ [r_0_6<=p_0_10]] & [r_0_5<=1 & [1<=r_1_9 & ~ [1<=p_0_14]]]]]] & ~ [[p_0_14<=r_1_9 | ~ [[r_0_10<=0 | [[~ [[r_0_7<=r_0_11 & 1<=p_0_7]] & [[1<=r_1_10 | 1<=r_1_0] & p_1_11<=r_1_13]] | ~ [p_1_8<=p_1_3]]]]]]]]
normalized: E [true U [~ [[~ [[[~ [p_1_8<=p_1_3] | [[[1<=r_1_10 | 1<=r_1_0] & p_1_11<=r_1_13] & ~ [[r_0_7<=r_0_11 & 1<=p_0_7]]]] | r_0_10<=0]] | p_0_14<=r_1_9]] & ~ [[[[[~ [1<=p_0_14] & 1<=r_1_9] & r_0_5<=1] & [~ [r_0_6<=p_0_10] & [[[[1<=p_0_12 | 1<=r_1_6] | r_0_13<=1] & [~ [p_1_10<=1] | ~ [1<=r_1_2]]] & p_1_8<=0]]] | [[~ [p_0_5<=r_0_0] | p_1_1<=p_1_1] | p_0_2<=1]]]]]

abstracting: (p_0_2<=1)
states: 278,528 (5)
abstracting: (p_1_1<=p_1_1)
states: 278,528 (5)
abstracting: (p_0_5<=r_0_0)
states: 233,472 (5)
abstracting: (p_1_8<=0)
states: 196,608 (5)
abstracting: (1<=r_1_2)
states: 245,760 (5)
abstracting: (p_1_10<=1)
states: 278,528 (5)
abstracting: (r_0_13<=1)
states: 278,528 (5)
abstracting: (1<=r_1_6)
states: 212,992 (5)
abstracting: (1<=p_0_12)
states: 32,768 (4)
abstracting: (r_0_6<=p_0_10)
states: 172,032 (5)
abstracting: (r_0_5<=1)
states: 278,528 (5)
abstracting: (1<=r_1_9)
states: 188,416 (5)
abstracting: (1<=p_0_14)
states: 16,384 (4)
abstracting: (p_0_14<=r_1_9)
states: 278,528 (5)
abstracting: (r_0_10<=0)
states: 147,456 (5)
abstracting: (1<=p_0_7)
states: 73,728 (4)
abstracting: (r_0_7<=r_0_11)
states: 208,896 (5)
abstracting: (p_1_11<=r_1_13)
states: 225,280 (5)
abstracting: (1<=r_1_0)
states: 262,144 (5)
abstracting: (1<=r_1_10)
states: 180,224 (5)
abstracting: (p_1_8<=p_1_3)
states: 217,088 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[[~ [p_1_0<=1] & ~ [[~ [[r_1_11<=0 | [~ [1<=r_0_8] & ~ [1<=p_0_7]]]] & [[[1<=p_1_7 & ~ [1<=r_0_0]] & [~ [1<=r_1_8] | [1<=p_1_14 | 1<=r_1_5]]] | ~ [p_1_14<=1]]]]] & p_0_10<=p_1_11] | ~ [[[[[[p_0_7<=0 & 1<=p_1_7] & 1<=p_1_5] & [[p_0_12<=1 & 1<=r_1_2] & ~ [r_1_12<=0]]] & ~ [[~ [r_1_2<=r_1_12] & 1<=r_1_8]]] & ~ [[~ [r_0_0<=r_0_4] & [[p_0_7<=r_0_4 & p_1_3<=p_0_4] & [p_0_9<=0 & r_1_6<=r_1_10]]]]]]]]
normalized: E [true U [~ [[~ [[[[p_0_9<=0 & r_1_6<=r_1_10] & [p_0_7<=r_0_4 & p_1_3<=p_0_4]] & ~ [r_0_0<=r_0_4]]] & [~ [[~ [r_1_2<=r_1_12] & 1<=r_1_8]] & [[~ [r_1_12<=0] & [p_0_12<=1 & 1<=r_1_2]] & [[p_0_7<=0 & 1<=p_1_7] & 1<=p_1_5]]]]] | [[~ [[[~ [p_1_14<=1] | [[[1<=p_1_14 | 1<=r_1_5] | ~ [1<=r_1_8]] & [~ [1<=r_0_0] & 1<=p_1_7]]] & ~ [[[~ [1<=p_0_7] & ~ [1<=r_0_8]] | r_1_11<=0]]]] & ~ [p_1_0<=1]] & p_0_10<=p_1_11]]]

abstracting: (p_0_10<=p_1_11)
states: 237,568 (5)
abstracting: (p_1_0<=1)
states: 278,528 (5)
abstracting: (r_1_11<=0)
states: 106,496 (5)
abstracting: (1<=r_0_8)
states: 131,072 (5)
abstracting: (1<=p_0_7)
states: 73,728 (4)
abstracting: (1<=p_1_7)
states: 73,728 (4)
abstracting: (1<=r_0_0)
states: 131,072 (5)
abstracting: (1<=r_1_8)
states: 196,608 (5)
abstracting: (1<=r_1_5)
states: 221,184 (5)
abstracting: (1<=p_1_14)
states: 131,072 (5)
abstracting: (p_1_14<=1)
states: 278,528 (5)
abstracting: (1<=p_1_5)
states: 57,344 (4)
abstracting: (1<=p_1_7)
states: 73,728 (4)
abstracting: (p_0_7<=0)
states: 204,800 (5)
abstracting: (1<=r_1_2)
states: 245,760 (5)
abstracting: (p_0_12<=1)
states: 278,528 (5)
abstracting: (r_1_12<=0)
states: 114,688 (5)
abstracting: (1<=r_1_8)
states: 196,608 (5)
abstracting: (r_1_2<=r_1_12)
states: 180,224 (5)
abstracting: (r_0_0<=r_0_4)
states: 208,896 (5)
abstracting: (p_1_3<=p_0_4)
states: 237,568 (5)
abstracting: (p_0_7<=r_0_4)
states: 241,664 (5)
abstracting: (r_1_6<=r_1_10)
states: 212,992 (5)
abstracting: (p_0_9<=0)
states: 221,184 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[~ [[p_0_9<=r_1_13 | [~ [[[r_1_9<=p_0_0 & r_1_7<=1] & [1<=p_1_1 & 1<=p_0_6]]] | 1<=r_1_0]]] | [~ [[[[[~ [r_1_9<=0] | [[1<=p_1_12 & 1<=p_0_6] | ~ [r_1_9<=r_0_11]]] & [[[p_0_6<=1 & 1<=p_1_0] | [1<=r_0_4 & r_0_13<=p_0_0]] & [[p_0_8<=r_1_7 | p_0_2<=1] | [1<=p_0_1 | 1<=r_0_2]]]] & [~ [[p_0_2<=1 & [p_0_10<=0 & 1<=r_1_1]]] & [~ [[1<=p_0_5 & r_1_0<=1]] | [r_0_10<=r_1_12 | ~ [r_1_9<=p_0_12]]]]] | r_1_14<=r_0_4]] | [p_0_11<=r_0_3 | [[[[1<=r_1_7 | [[r_0_6<=1 & r_0_11<=1] | ~ [r_1_10<=p_1_10]]] & ~ [[1<=r_0_11 | [p_1_5<=p_0_7 & r_1_4<=p_1_1]]]] & ~ [[[~ [1<=p_0_0] & ~ [p_1_2<=p_0_13]] & ~ [1<=p_1_10]]]] | [~ [[[p_1_14<=0 & p_0_12<=0] | r_1_4<=1]] | ~ [r_0_4<=p_0_1]]]]]]]
normalized: ~ [E [true U ~ [[[[[[~ [r_0_4<=p_0_1] | ~ [[[p_1_14<=0 & p_0_12<=0] | r_1_4<=1]]] | [~ [[~ [1<=p_1_10] & [~ [p_1_2<=p_0_13] & ~ [1<=p_0_0]]]] & [~ [[[p_1_5<=p_0_7 & r_1_4<=p_1_1] | 1<=r_0_11]] & [[~ [r_1_10<=p_1_10] | [r_0_6<=1 & r_0_11<=1]] | 1<=r_1_7]]]] | p_0_11<=r_0_3] | ~ [[[[[[~ [r_1_9<=p_0_12] | r_0_10<=r_1_12] | ~ [[1<=p_0_5 & r_1_0<=1]]] & ~ [[[p_0_10<=0 & 1<=r_1_1] & p_0_2<=1]]] & [[[[1<=p_0_1 | 1<=r_0_2] | [p_0_8<=r_1_7 | p_0_2<=1]] & [[1<=r_0_4 & r_0_13<=p_0_0] | [p_0_6<=1 & 1<=p_1_0]]] & [[~ [r_1_9<=r_0_11] | [1<=p_1_12 & 1<=p_0_6]] | ~ [r_1_9<=0]]]] | r_1_14<=r_0_4]]] | ~ [[[~ [[[1<=p_1_1 & 1<=p_0_6] & [r_1_9<=p_0_0 & r_1_7<=1]]] | 1<=r_1_0] | p_0_9<=r_1_13]]]]]]

abstracting: (p_0_9<=r_1_13)
states: 258,048 (5)
abstracting: (1<=r_1_0)
states: 262,144 (5)
abstracting: (r_1_7<=1)
states: 278,528 (5)
abstracting: (r_1_9<=p_0_0)
states: 180,224 (5)
abstracting: (1<=p_0_6)
states: 81,920 (4)
abstracting: (1<=p_1_1)
states: 24,576 (4)
abstracting: (r_1_14<=r_0_4)
states: 200,704 (5)
abstracting: (r_1_9<=0)
states: 90,112 (4)
abstracting: (1<=p_0_6)
states: 81,920 (4)
abstracting: (1<=p_1_12)
states: 114,688 (5)
abstracting: (r_1_9<=r_0_11)
states: 176,128 (5)
abstracting: (1<=p_1_0)
states: 16,384 (4)
abstracting: (p_0_6<=1)
states: 278,528 (5)
abstracting: (r_0_13<=p_0_0)
states: 208,896 (5)
abstracting: (1<=r_0_4)
states: 131,072 (5)
abstracting: (p_0_2<=1)
states: 278,528 (5)
abstracting: (p_0_8<=r_1_7)
states: 278,528 (5)
abstracting: (1<=r_0_2)
states: 131,072 (5)
abstracting: (1<=p_0_1)
states: 122,880 (5)
abstracting: (p_0_2<=1)
states: 278,528 (5)
abstracting: (1<=r_1_1)
states: 253,952 (5)
abstracting: (p_0_10<=0)
states: 229,376 (5)
abstracting: (r_1_0<=1)
states: 278,528 (5)
abstracting: (1<=p_0_5)
states: 90,112 (4)
abstracting: (r_0_10<=r_1_12)
states: 225,280 (5)
abstracting: (r_1_9<=p_0_12)
states: 122,880 (5)
abstracting: (p_0_11<=r_0_3)
states: 258,048 (5)
abstracting: (1<=r_1_7)
states: 204,800 (5)
abstracting: (r_0_11<=1)
states: 278,528 (5)
abstracting: (r_0_6<=1)
states: 278,528 (5)
abstracting: (r_1_10<=p_1_10)
states: 98,304 (4)
abstracting: (1<=r_0_11)
states: 131,072 (5)
abstracting: (r_1_4<=p_1_1)
states: 61,440 (4)
abstracting: (p_1_5<=p_0_7)
states: 221,184 (5)
abstracting: (1<=p_0_0)
states: 131,072 (5)
abstracting: (p_1_2<=p_0_13)
states: 245,760 (5)
abstracting: (1<=p_1_10)
states: 98,304 (4)
abstracting: (r_1_4<=1)
states: 278,528 (5)
abstracting: (p_0_12<=0)
states: 245,760 (5)
abstracting: (p_1_14<=0)
states: 147,456 (5)
abstracting: (r_0_4<=p_0_1)
states: 204,800 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[[p_0_8<=p_0_8 | [[p_0_4<=r_1_5 | ~ [[r_0_10<=p_0_11 & [p_1_6<=0 & p_1_1<=r_0_10]]]] | [[1<=r_1_8 & [1<=p_0_4 | [[r_1_1<=0 & p_1_11<=1] | ~ [r_0_7<=p_0_4]]]] | 1<=r_1_7]]] | ~ [[[p_0_14<=r_0_6 | ~ [[[r_1_0<=1 | p_0_13<=0] | [~ [p_1_13<=0] | [1<=p_0_1 | p_0_5<=0]]]]] & [[[[[r_0_5<=1 | p_0_3<=1] | ~ [r_0_8<=0]] | ~ [r_0_6<=r_0_0]] & ~ [[[1<=r_0_1 | r_1_6<=p_1_5] & 1<=p_1_2]]] & [~ [[[1<=r_0_8 | 1<=p_1_1] & [p_0_8<=p_1_1 & r_1_12<=p_0_12]]] & [~ [[1<=r_0_4 & r_1_5<=0]] | ~ [r_1_8<=1]]]]]]] | ~ [[~ [[1<=r_0_3 | [[~ [1<=r_1_10] | p_1_6<=r_1_9] | [[r_0_12<=r_0_5 & p_1_11<=r_1_1] | [[p_1_14<=r_1_11 | p_1_7<=0] & ~ [1<=r_1_4]]]]]] & ~ [r_1_14<=p_1_3]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [r_1_14<=p_1_3] & ~ [[1<=r_0_3 | [[[~ [1<=r_1_4] & [p_1_14<=r_1_11 | p_1_7<=0]] | [r_0_12<=r_0_5 & p_1_11<=r_1_1]] | [p_1_6<=r_1_9 | ~ [1<=r_1_10]]]]]]] | [~ [[[[[~ [r_1_8<=1] | ~ [[1<=r_0_4 & r_1_5<=0]]] & ~ [[[p_0_8<=p_1_1 & r_1_12<=p_0_12] & [1<=r_0_8 | 1<=p_1_1]]]] & [~ [[1<=p_1_2 & [1<=r_0_1 | r_1_6<=p_1_5]]] & [~ [r_0_6<=r_0_0] | [~ [r_0_8<=0] | [r_0_5<=1 | p_0_3<=1]]]]] & [p_0_14<=r_0_6 | ~ [[[[1<=p_0_1 | p_0_5<=0] | ~ [p_1_13<=0]] | [r_1_0<=1 | p_0_13<=0]]]]]] | [p_0_8<=p_0_8 | [[1<=r_1_7 | [1<=r_1_8 & [1<=p_0_4 | [~ [r_0_7<=p_0_4] | [r_1_1<=0 & p_1_11<=1]]]]] | [p_0_4<=r_1_5 | ~ [[r_0_10<=p_0_11 & [p_1_6<=0 & p_1_1<=r_0_10]]]]]]]]]]]

abstracting: (p_1_1<=r_0_10)
states: 266,240 (5)
abstracting: (p_1_6<=0)
states: 212,992 (5)
abstracting: (r_0_10<=p_0_11)
states: 167,936 (5)
abstracting: (p_0_4<=r_1_5)
states: 270,336 (5)
abstracting: (p_1_11<=1)
states: 278,528 (5)
abstracting: (r_1_1<=0)
states: 24,576 (4)
abstracting: (r_0_7<=p_0_4)
states: 192,512 (5)
abstracting: (1<=p_0_4)
states: 98,304 (4)
abstracting: (1<=r_1_8)
states: 196,608 (5)
abstracting: (1<=r_1_7)
states: 204,800 (5)
abstracting: (p_0_8<=p_0_8)
states: 278,528 (5)
abstracting: (p_0_13<=0)
states: 253,952 (5)
abstracting: (r_1_0<=1)
states: 278,528 (5)
abstracting: (p_1_13<=0)
states: 155,648 (5)
abstracting: (p_0_5<=0)
states: 188,416 (5)
abstracting: (1<=p_0_1)
states: 122,880 (5)
abstracting: (p_0_14<=r_0_6)
states: 270,336 (5)
abstracting: (p_0_3<=1)
states: 278,528 (5)
abstracting: (r_0_5<=1)
states: 278,528 (5)
abstracting: (r_0_8<=0)
states: 147,456 (5)
abstracting: (r_0_6<=r_0_0)
states: 208,896 (5)
abstracting: (r_1_6<=p_1_5)
states: 94,208 (4)
abstracting: (1<=r_0_1)
states: 131,072 (5)
abstracting: (1<=p_1_2)
states: 32,768 (4)
abstracting: (1<=p_1_1)
states: 24,576 (4)
abstracting: (1<=r_0_8)
states: 131,072 (5)
abstracting: (r_1_12<=p_0_12)
states: 147,456 (5)
abstracting: (p_0_8<=p_1_1)
states: 212,992 (5)
abstracting: (r_1_5<=0)
states: 57,344 (4)
abstracting: (1<=r_0_4)
states: 131,072 (5)
abstracting: (r_1_8<=1)
states: 278,528 (5)
abstracting: (1<=r_1_10)
states: 180,224 (5)
abstracting: (p_1_6<=r_1_9)
states: 245,760 (5)
abstracting: (p_1_11<=r_1_1)
states: 266,240 (5)
abstracting: (r_0_12<=r_0_5)
states: 208,896 (5)
abstracting: (p_1_7<=0)
states: 204,800 (5)
abstracting: (p_1_14<=r_1_11)
states: 225,280 (5)
abstracting: (1<=r_1_4)
states: 229,376 (5)
abstracting: (1<=r_0_3)
states: 131,072 (5)
abstracting: (r_1_14<=p_1_3)
states: 151,552 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[[[~ [[[~ [[r_0_14<=0 & p_0_14<=p_1_10]] & [1<=p_0_14 & ~ [r_0_12<=r_1_12]]] | [[[p_1_8<=r_1_0 & r_1_9<=p_1_10] | 1<=r_0_13] & [[p_1_7<=r_1_9 & p_0_11<=1] & p_1_2<=0]]]] | [~ [[[[r_0_2<=r_0_6 | 1<=p_1_7] | p_0_14<=1] | [[p_1_12<=p_0_9 | 1<=p_0_0] & ~ [1<=r_0_1]]]] & [[[[1<=p_0_4 & p_1_4<=0] & ~ [r_0_1<=p_0_13]] | [[p_1_14<=0 & 1<=r_0_10] & [p_0_1<=p_0_3 & r_1_3<=r_1_5]]] | [~ [[p_0_8<=1 | r_0_11<=r_1_0]] & [p_0_10<=r_0_10 & r_1_10<=1]]]]] & p_1_7<=0] & 1<=r_1_13] | ~ [[~ [[r_0_1<=r_1_2 | [[r_0_10<=r_0_3 | ~ [r_1_10<=0]] | [1<=p_1_8 & 1<=p_1_7]]]] & [[[[~ [p_1_4<=0] | [r_0_10<=p_0_2 | 1<=p_0_0]] & [r_1_10<=0 & 1<=p_0_13]] | ~ [[[p_0_14<=1 & p_1_7<=1] & [p_1_2<=r_1_11 & p_1_1<=r_0_8]]]] | [r_0_3<=0 | ~ [[[r_1_12<=0 & r_0_0<=r_0_9] & [1<=r_1_2 & p_0_14<=r_0_8]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[[r_0_3<=0 | ~ [[[1<=r_1_2 & p_0_14<=r_0_8] & [r_1_12<=0 & r_0_0<=r_0_9]]]] | [~ [[[p_1_2<=r_1_11 & p_1_1<=r_0_8] & [p_0_14<=1 & p_1_7<=1]]] | [[r_1_10<=0 & 1<=p_0_13] & [[r_0_10<=p_0_2 | 1<=p_0_0] | ~ [p_1_4<=0]]]]] & ~ [[r_0_1<=r_1_2 | [[1<=p_1_8 & 1<=p_1_7] | [r_0_10<=r_0_3 | ~ [r_1_10<=0]]]]]]] | [1<=r_1_13 & [p_1_7<=0 & [[[[[p_0_10<=r_0_10 & r_1_10<=1] & ~ [[p_0_8<=1 | r_0_11<=r_1_0]]] | [[[p_0_1<=p_0_3 & r_1_3<=r_1_5] & [p_1_14<=0 & 1<=r_0_10]] | [~ [r_0_1<=p_0_13] & [1<=p_0_4 & p_1_4<=0]]]] & ~ [[[~ [1<=r_0_1] & [p_1_12<=p_0_9 | 1<=p_0_0]] | [p_0_14<=1 | [r_0_2<=r_0_6 | 1<=p_1_7]]]]] | ~ [[[[p_1_2<=0 & [p_1_7<=r_1_9 & p_0_11<=1]] & [1<=r_0_13 | [p_1_8<=r_1_0 & r_1_9<=p_1_10]]] | [[1<=p_0_14 & ~ [r_0_12<=r_1_12]] & ~ [[r_0_14<=0 & p_0_14<=p_1_10]]]]]]]]]]]]

abstracting: (p_0_14<=p_1_10)
states: 262,144 (5)
abstracting: (r_0_14<=0)
states: 147,456 (5)
abstracting: (r_0_12<=r_1_12)
states: 278,528 (5)
abstracting: (1<=p_0_14)
states: 16,384 (4)
abstracting: (r_1_9<=p_1_10)
states: 143,360 (5)
abstracting: (p_1_8<=r_1_0)
states: 270,336 (5)
abstracting: (1<=r_0_13)
states: 131,072 (5)
abstracting: (p_0_11<=1)
states: 278,528 (5)
abstracting: (p_1_7<=r_1_9)
states: 241,664 (5)
abstracting: (p_1_2<=0)
states: 245,760 (5)
abstracting: (1<=p_1_7)
states: 73,728 (4)
abstracting: (r_0_2<=r_0_6)
states: 208,896 (5)
abstracting: (p_0_14<=1)
states: 278,528 (5)
abstracting: (1<=p_0_0)
states: 131,072 (5)
abstracting: (p_1_12<=p_0_9)
states: 180,224 (5)
abstracting: (1<=r_0_1)
states: 131,072 (5)
abstracting: (p_1_4<=0)
states: 229,376 (5)
abstracting: (1<=p_0_4)
states: 98,304 (4)
abstracting: (r_0_1<=p_0_13)
states: 159,744 (5)
abstracting: (1<=r_0_10)
states: 131,072 (5)
abstracting: (p_1_14<=0)
states: 147,456 (5)
abstracting: (r_1_3<=r_1_5)
states: 241,664 (5)
abstracting: (p_0_1<=p_0_3)
states: 208,896 (5)
abstracting: (r_0_11<=r_1_0)
states: 270,336 (5)
abstracting: (p_0_8<=1)
states: 278,528 (5)
abstracting: (r_1_10<=1)
states: 278,528 (5)
abstracting: (p_0_10<=r_0_10)
states: 229,376 (5)
abstracting: (p_1_7<=0)
states: 204,800 (5)
abstracting: (1<=r_1_13)
states: 155,648 (5)
abstracting: (r_1_10<=0)
states: 98,304 (4)
abstracting: (r_0_10<=r_0_3)
states: 208,896 (5)
abstracting: (1<=p_1_7)
states: 73,728 (4)
abstracting: (1<=p_1_8)
states: 81,920 (4)
abstracting: (r_0_1<=r_1_2)
states: 266,240 (5)
abstracting: (p_1_4<=0)
states: 229,376 (5)
abstracting: (1<=p_0_0)
states: 131,072 (5)
abstracting: (r_0_10<=p_0_2)
states: 200,704 (5)
abstracting: (1<=p_0_13)
states: 24,576 (4)
abstracting: (r_1_10<=0)
states: 98,304 (4)
abstracting: (p_1_7<=1)
states: 278,528 (5)
abstracting: (p_0_14<=1)
states: 278,528 (5)
abstracting: (p_1_1<=r_0_8)
states: 266,240 (5)
abstracting: (p_1_2<=r_1_11)
states: 262,144 (5)
abstracting: (r_0_0<=r_0_9)
states: 208,896 (5)
abstracting: (r_1_12<=0)
states: 114,688 (5)
abstracting: (p_0_14<=r_0_8)
states: 270,336 (5)
abstracting: (1<=r_1_2)
states: 245,760 (5)
abstracting: (r_0_3<=0)
states: 147,456 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

totally nodes used: 31679 (3.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 15030 59057 74087
used/not used/entry size/cache size: 73952 67034912 16 1024MB
basic ops cache: hits/miss/sum: 11628 47637 59265
used/not used/entry size/cache size: 92237 16684979 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: 2150 6120 8270
used/not used/entry size/cache size: 6120 8382488 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 67077458
1 31134
2 271
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.637sec


BK_STOP 1678942494315

--------------------
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:914 (28), effective:240 (7)

initing FirstDep: 0m 0.000sec


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

iterations count:74 (2), effective:14 (0)

iterations count:116 (3), effective:28 (0)

iterations count:100 (3), effective:19 (0)

iterations count:627 (19), effective:176 (5)

iterations count:43 (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-R015C002"
export BK_EXAMINATION="ReachabilityCardinality"
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-R015C002, examination is ReachabilityCardinality"
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-167889192600750"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R015C002.tgz
mv ResAllocation-PT-R015C002 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;