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.r257-smll-167863532200073.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 NeighborGrid-PT-d2n3m1c12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r257-smll-167863532200073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.0K Feb 26 09:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 09:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 09:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 09:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 09:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Feb 26 09:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 11K 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 NeighborGrid-PT-d2n3m1c12-CTLCardinality-00
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLCardinality-01
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLCardinality-02
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLCardinality-03
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLCardinality-04
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLCardinality-05
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLCardinality-06
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLCardinality-07
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLCardinality-08
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLCardinality-09
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678681739141

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=NeighborGrid-PT-d2n3m1c12
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: NeighborGrid_PT_d2n3m1c12
(NrP: 9 NrTr: 40 NrArc: 80)

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

net check time: 0m 0.000sec

init dd package: 0m 3.571sec


RS generation: 0m 0.003sec


-> reachability set: #nodes 81 (8.1e+01) #states 24,310 (4)



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

checking: EG [EX [AF [EG [EG [p_1_2<=0]]]]]
normalized: EG [EX [~ [EG [~ [EG [EG [p_1_2<=0]]]]]]]

abstracting: (p_1_2<=0)
states: 11,440 (4)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: ~ [EX [EX [A [1<=p_2_1 U 1<=p_2_0]]]]
normalized: ~ [EX [EX [[~ [EG [~ [1<=p_2_0]]] & ~ [E [~ [1<=p_2_0] U [~ [1<=p_2_0] & ~ [1<=p_2_1]]]]]]]]

abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
.
EG iterations: 1
..-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: ~ [AX [AG [A [AG [p_0_2<=1] U 1<=p_1_1]]]]
normalized: EX [E [true U ~ [[~ [EG [~ [1<=p_1_1]]] & ~ [E [~ [1<=p_1_1] U [E [true U ~ [p_0_2<=1]] & ~ [1<=p_1_1]]]]]]]]

abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (p_0_2<=1)
states: 17,875 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: ~ [A [~ [p_0_1<=p_0_0] U A [p_2_2<=1 U ~ [p_1_2<=1]]]]
normalized: ~ [[~ [EG [~ [[~ [EG [p_1_2<=1]] & ~ [E [p_1_2<=1 U [~ [p_2_2<=1] & p_1_2<=1]]]]]]] & ~ [E [~ [[~ [EG [p_1_2<=1]] & ~ [E [p_1_2<=1 U [~ [p_2_2<=1] & p_1_2<=1]]]]] U [~ [[~ [EG [p_1_2<=1]] & ~ [E [p_1_2<=1 U [~ [p_2_2<=1] & p_1_2<=1]]]]] & p_0_1<=p_0_0]]]]]

abstracting: (p_0_1<=p_0_0)
states: 15,792 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_2_2<=1)
states: 17,875 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_2_2<=1)
states: 17,875 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_2_2<=1)
states: 17,875 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EX [E [EF [EG [[p_2_1<=0 & 1<=p_1_2]]] U EX [[~ [[1<=p_1_2 & 1<=p_2_1]] & AG [p_1_1<=0]]]]]
normalized: EX [E [E [true U EG [[p_2_1<=0 & 1<=p_1_2]]] U EX [[~ [E [true U ~ [p_1_1<=0]]] & ~ [[1<=p_1_2 & 1<=p_2_1]]]]]]

abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (p_1_1<=0)
states: 11,440 (4)
.abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (p_2_1<=0)
states: 11,440 (4)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: A [[~ [[EF [~ [p_0_1<=0]] | AF [A [p_2_0<=0 U p_0_1<=0]]]] & ~ [p_1_2<=1]] U 1<=p_2_0]
normalized: [~ [E [~ [1<=p_2_0] U [~ [[~ [[E [true U ~ [p_0_1<=0]] | ~ [EG [~ [[~ [EG [~ [p_0_1<=0]]] & ~ [E [~ [p_0_1<=0] U [~ [p_2_0<=0] & ~ [p_0_1<=0]]]]]]]]]] & ~ [p_1_2<=1]]] & ~ [1<=p_2_0]]]] & ~ [EG [~ [1<=p_2_0]]]]

abstracting: (1<=p_2_0)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_0_1<=0)
states: 11,440 (4)
abstracting: (p_2_0<=0)
states: 11,440 (4)
abstracting: (p_0_1<=0)
states: 11,440 (4)
abstracting: (p_0_1<=0)
states: 11,440 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p_0_1<=0)
states: 11,440 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EX [EX [A [[AF [p_0_0<=0] | AX [1<=p_2_2]] U [E [1<=p_0_1 U 1<=p_1_2] | EX [p_1_2<=p_2_2]]]]]
normalized: EX [EX [[~ [EG [~ [[EX [p_1_2<=p_2_2] | E [1<=p_0_1 U 1<=p_1_2]]]]] & ~ [E [~ [[EX [p_1_2<=p_2_2] | E [1<=p_0_1 U 1<=p_1_2]]] U [~ [[~ [EX [~ [1<=p_2_2]]] | ~ [EG [~ [p_0_0<=0]]]]] & ~ [[EX [p_1_2<=p_2_2] | E [1<=p_0_1 U 1<=p_1_2]]]]]]]]]

abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (p_1_2<=p_2_2)
states: 15,792 (4)
.abstracting: (p_0_0<=0)
states: 11,440 (4)
.
EG iterations: 1
abstracting: (1<=p_2_2)
states: 12,870 (4)
.abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (p_1_2<=p_2_2)
states: 15,792 (4)
.abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (p_1_2<=p_2_2)
states: 15,792 (4)
..
EG iterations: 1
..-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AF [AF [~ [[AF [~ [p_1_0<=0]] & [~ [[1<=p_0_1 & 1<=p_1_2]] | [[p_1_0<=0 & 1<=p_1_2] | p_0_2<=0]]]]]]
normalized: ~ [EG [EG [[[[[p_1_0<=0 & 1<=p_1_2] | p_0_2<=0] | ~ [[1<=p_0_1 & 1<=p_1_2]]] & ~ [EG [p_1_0<=0]]]]]]

abstracting: (p_1_0<=0)
states: 11,440 (4)
.
EG iterations: 1
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (p_0_2<=0)
states: 11,440 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (p_1_0<=0)
states: 11,440 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: ~ [E [~ [p_0_1<=p_1_1] U AG [[[A [p_2_2<=0 U p_0_1<=p_0_1] | EF [p_0_2<=0]] | EG [AG [p_1_1<=p_0_2]]]]]]
normalized: ~ [E [~ [p_0_1<=p_1_1] U ~ [E [true U ~ [[EG [~ [E [true U ~ [p_1_1<=p_0_2]]]] | [E [true U p_0_2<=0] | [~ [EG [~ [p_0_1<=p_0_1]]] & ~ [E [~ [p_0_1<=p_0_1] U [~ [p_2_2<=0] & ~ [p_0_1<=p_0_1]]]]]]]]]]]]

abstracting: (p_0_1<=p_0_1)
states: 24,310 (4)
abstracting: (p_2_2<=0)
states: 11,440 (4)
abstracting: (p_0_1<=p_0_1)
states: 24,310 (4)
abstracting: (p_0_1<=p_0_1)
states: 24,310 (4)
.
EG iterations: 1
abstracting: (p_0_2<=0)
states: 11,440 (4)
abstracting: (p_1_1<=p_0_2)
states: 15,792 (4)
.
EG iterations: 1
abstracting: (p_0_1<=p_1_1)
states: 15,792 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: [~ [AG [[1<=p_2_1 & ~ [p_0_1<=0]]]] | AF [[[[[AF [p_0_2<=0] | EX [p_1_0<=0]] & ~ [AF [p_1_1<=1]]] & AX [EG [p_2_1<=1]]] | AF [p_2_0<=p_0_2]]]]
normalized: [~ [EG [~ [[~ [EG [~ [p_2_0<=p_0_2]]] | [~ [EX [~ [EG [p_2_1<=1]]]] & [EG [~ [p_1_1<=1]] & [EX [p_1_0<=0] | ~ [EG [~ [p_0_2<=0]]]]]]]]]] | E [true U ~ [[~ [p_0_1<=0] & 1<=p_2_1]]]]

abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_0_1<=0)
states: 11,440 (4)
abstracting: (p_0_2<=0)
states: 11,440 (4)
.
EG iterations: 1
abstracting: (p_1_0<=0)
states: 11,440 (4)
.abstracting: (p_1_1<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p_2_1<=1)
states: 17,875 (4)
.
EG iterations: 1
.abstracting: (p_2_0<=p_0_2)
states: 15,792 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EF [[E [p_2_1<=p_0_0 U ~ [A [EG [1<=p_2_0] U E [p_0_1<=0 U 1<=p_1_0]]]] | [EX [A [~ [1<=p_2_2] U p_1_1<=0]] | EG [[E [p_2_2<=p_1_2 U p_2_1<=p_1_0] & 1<=p_2_0]]]]]
normalized: E [true U [[EG [[E [p_2_2<=p_1_2 U p_2_1<=p_1_0] & 1<=p_2_0]] | EX [[~ [EG [~ [p_1_1<=0]]] & ~ [E [~ [p_1_1<=0] U [~ [p_1_1<=0] & 1<=p_2_2]]]]]] | E [p_2_1<=p_0_0 U ~ [[~ [EG [~ [E [p_0_1<=0 U 1<=p_1_0]]]] & ~ [E [~ [E [p_0_1<=0 U 1<=p_1_0]] U [~ [EG [1<=p_2_0]] & ~ [E [p_0_1<=0 U 1<=p_1_0]]]]]]]]]]

abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (p_0_1<=0)
states: 11,440 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (p_0_1<=0)
states: 11,440 (4)
abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (p_0_1<=0)
states: 11,440 (4)
.
EG iterations: 1
abstracting: (p_2_1<=p_0_0)
states: 15,792 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (p_1_1<=0)
states: 11,440 (4)
abstracting: (p_1_1<=0)
states: 11,440 (4)
abstracting: (p_1_1<=0)
states: 11,440 (4)
.
EG iterations: 1
.abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (p_2_1<=p_1_0)
states: 15,792 (4)
abstracting: (p_2_2<=p_1_2)
states: 15,792 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: E [AG [[AX [p_0_1<=p_1_1] & [EF [p_2_0<=p_2_0] & ~ [[[1<=p_1_0 & p_2_2<=1] & [p_2_1<=0 & p_2_2<=p_0_2]]]]]] U ~ [AF [EX [[~ [p_0_1<=1] | ~ [p_2_0<=p_1_0]]]]]]
normalized: E [~ [E [true U ~ [[[~ [[[p_2_1<=0 & p_2_2<=p_0_2] & [1<=p_1_0 & p_2_2<=1]]] & E [true U p_2_0<=p_2_0]] & ~ [EX [~ [p_0_1<=p_1_1]]]]]]] U EG [~ [EX [[~ [p_2_0<=p_1_0] | ~ [p_0_1<=1]]]]]]

abstracting: (p_0_1<=1)
states: 17,875 (4)
abstracting: (p_2_0<=p_1_0)
states: 15,792 (4)
...
EG iterations: 2
abstracting: (p_0_1<=p_1_1)
states: 15,792 (4)
.abstracting: (p_2_0<=p_2_0)
states: 24,310 (4)
abstracting: (p_2_2<=1)
states: 17,875 (4)
abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (p_2_2<=p_0_2)
states: 15,792 (4)
abstracting: (p_2_1<=0)
states: 11,440 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: ~ [[~ [[A [[[~ [p_2_1<=1] & AG [p_0_1<=1]] & p_1_1<=0] U [AX [p_0_0<=p_2_2] | [p_0_1<=p_1_1 & AF [1<=p_2_0]]]] & AG [~ [E [1<=p_1_0 U 1<=p_2_1]]]]] | ~ [E [~ [EF [1<=p_2_1]] U [p_0_2<=1 & ~ [1<=p_2_0]]]]]]
normalized: ~ [[~ [[[~ [EG [~ [[~ [EX [~ [p_0_0<=p_2_2]]] | [~ [EG [~ [1<=p_2_0]]] & p_0_1<=p_1_1]]]]] & ~ [E [~ [[~ [EX [~ [p_0_0<=p_2_2]]] | [~ [EG [~ [1<=p_2_0]]] & p_0_1<=p_1_1]]] U [~ [[~ [EX [~ [p_0_0<=p_2_2]]] | [~ [EG [~ [1<=p_2_0]]] & p_0_1<=p_1_1]]] & ~ [[[~ [E [true U ~ [p_0_1<=1]]] & ~ [p_2_1<=1]] & p_1_1<=0]]]]]] & ~ [E [true U E [1<=p_1_0 U 1<=p_2_1]]]]] | ~ [E [~ [E [true U 1<=p_2_1]] U [~ [1<=p_2_0] & p_0_2<=1]]]]]

abstracting: (p_0_2<=1)
states: 17,875 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (p_1_1<=0)
states: 11,440 (4)
abstracting: (p_2_1<=1)
states: 17,875 (4)
abstracting: (p_0_1<=1)
states: 17,875 (4)
abstracting: (p_0_1<=p_1_1)
states: 15,792 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (p_0_0<=p_2_2)
states: 15,792 (4)
.abstracting: (p_0_1<=p_1_1)
states: 15,792 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (p_0_0<=p_2_2)
states: 15,792 (4)
.abstracting: (p_0_1<=p_1_1)
states: 15,792 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (p_0_0<=p_2_2)
states: 15,792 (4)
..
EG iterations: 1
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: E [p_0_1<=p_2_0 U ~ [[[p_2_0<=0 & p_0_1<=p_1_2] & [EF [[p_1_1<=0 | ~ [p_2_0<=p_2_0]]] | [EF [[1<=p_1_1 | p_0_1<=0]] & ~ [E [p_1_0<=0 U p_2_1<=p_1_0]]]]]]]
normalized: E [p_0_1<=p_2_0 U ~ [[[[~ [E [p_1_0<=0 U p_2_1<=p_1_0]] & E [true U [1<=p_1_1 | p_0_1<=0]]] | E [true U [~ [p_2_0<=p_2_0] | p_1_1<=0]]] & [p_2_0<=0 & p_0_1<=p_1_2]]]]

abstracting: (p_0_1<=p_1_2)
states: 15,792 (4)
abstracting: (p_2_0<=0)
states: 11,440 (4)
abstracting: (p_1_1<=0)
states: 11,440 (4)
abstracting: (p_2_0<=p_2_0)
states: 24,310 (4)
abstracting: (p_0_1<=0)
states: 11,440 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (p_2_1<=p_1_0)
states: 15,792 (4)
abstracting: (p_1_0<=0)
states: 11,440 (4)
abstracting: (p_0_1<=p_2_0)
states: 15,792 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: [[EF [[[EX [[p_0_0<=1 | p_1_0<=0]] & AG [AX [p_0_0<=p_1_1]]] | [[AG [p_1_1<=p_2_2] | AG [p_1_2<=p_2_2]] | [~ [p_2_0<=1] | EX [p_2_1<=0]]]]] | AX [[~ [[A [1<=p_2_1 U 1<=p_0_2] & [~ [p_0_0<=0] | A [1<=p_1_1 U p_2_0<=p_1_2]]]] & AX [~ [[p_0_1<=0 | 1<=p_2_0]]]]]] & AF [~ [AG [~ [AG [p_1_2<=1]]]]]]
normalized: [~ [EG [~ [E [true U ~ [E [true U ~ [p_1_2<=1]]]]]]] & [~ [EX [~ [[~ [EX [[p_0_1<=0 | 1<=p_2_0]]] & ~ [[[[~ [EG [~ [p_2_0<=p_1_2]]] & ~ [E [~ [p_2_0<=p_1_2] U [~ [1<=p_1_1] & ~ [p_2_0<=p_1_2]]]]] | ~ [p_0_0<=0]] & [~ [EG [~ [1<=p_0_2]]] & ~ [E [~ [1<=p_0_2] U [~ [1<=p_2_1] & ~ [1<=p_0_2]]]]]]]]]]] | E [true U [[[EX [p_2_1<=0] | ~ [p_2_0<=1]] | [~ [E [true U ~ [p_1_2<=p_2_2]]] | ~ [E [true U ~ [p_1_1<=p_2_2]]]]] | [~ [E [true U EX [~ [p_0_0<=p_1_1]]]] & EX [[p_0_0<=1 | p_1_0<=0]]]]]]]

abstracting: (p_1_0<=0)
states: 11,440 (4)
abstracting: (p_0_0<=1)
states: 17,875 (4)
.abstracting: (p_0_0<=p_1_1)
states: 15,792 (4)
.abstracting: (p_1_1<=p_2_2)
states: 15,792 (4)
abstracting: (p_1_2<=p_2_2)
states: 15,792 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_2_1<=0)
states: 11,440 (4)
.abstracting: (1<=p_0_2)
states: 12,870 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (p_0_0<=0)
states: 11,440 (4)
abstracting: (p_2_0<=p_1_2)
states: 15,792 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (p_2_0<=p_1_2)
states: 15,792 (4)
abstracting: (p_2_0<=p_1_2)
states: 15,792 (4)
.
EG iterations: 1
abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (p_0_1<=0)
states: 11,440 (4)
..abstracting: (p_1_2<=1)
states: 17,875 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: [[E [p_1_0<=p_1_0 U [[[~ [AX [p_2_0<=0]] | [p_0_2<=p_1_0 | 1<=p_1_0]] | EF [EX [1<=p_1_2]]] | 1<=p_2_0]] & [~ [[EF [[[1<=p_2_0 | p_2_2<=0] | [1<=p_2_2 | 1<=p_0_2]]] & [A [~ [p_2_1<=p_1_1] U [1<=p_2_2 & p_2_2<=p_2_1]] & AX [EF [p_2_0<=0]]]]] | E [[~ [[AG [p_1_1<=1] & ~ [p_2_1<=0]]] & AG [AF [p_0_2<=p_1_0]]] U [p_2_1<=p_0_1 & EG [AF [p_0_0<=1]]]]]] | ~ [EG [~ [AG [~ [[1<=p_1_0 | p_1_2<=0]]]]]]]
normalized: [~ [EG [E [true U [1<=p_1_0 | p_1_2<=0]]]] | [[E [[~ [E [true U EG [~ [p_0_2<=p_1_0]]]] & ~ [[~ [p_2_1<=0] & ~ [E [true U ~ [p_1_1<=1]]]]]] U [p_2_1<=p_0_1 & EG [~ [EG [~ [p_0_0<=1]]]]]] | ~ [[[~ [EX [~ [E [true U p_2_0<=0]]]] & [~ [EG [~ [[1<=p_2_2 & p_2_2<=p_2_1]]]] & ~ [E [~ [[1<=p_2_2 & p_2_2<=p_2_1]] U [p_2_1<=p_1_1 & ~ [[1<=p_2_2 & p_2_2<=p_2_1]]]]]]] & E [true U [[1<=p_2_2 | 1<=p_0_2] | [1<=p_2_0 | p_2_2<=0]]]]]] & E [p_1_0<=p_1_0 U [1<=p_2_0 | [E [true U EX [1<=p_1_2]] | [[p_0_2<=p_1_0 | 1<=p_1_0] | EX [~ [p_2_0<=0]]]]]]]]

abstracting: (p_2_0<=0)
states: 11,440 (4)
.abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (p_0_2<=p_1_0)
states: 15,792 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
.abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (p_1_0<=p_1_0)
states: 24,310 (4)
abstracting: (p_2_2<=0)
states: 11,440 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (p_2_2<=p_2_1)
states: 15,792 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (p_2_1<=p_1_1)
states: 15,792 (4)
abstracting: (p_2_2<=p_2_1)
states: 15,792 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (p_2_2<=p_2_1)
states: 15,792 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (p_2_0<=0)
states: 11,440 (4)
.abstracting: (p_0_0<=1)
states: 17,875 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p_2_1<=p_0_1)
states: 15,792 (4)
abstracting: (p_1_1<=1)
states: 17,875 (4)
abstracting: (p_2_1<=0)
states: 11,440 (4)
abstracting: (p_0_2<=p_1_0)
states: 15,792 (4)
.
EG iterations: 1
abstracting: (p_1_2<=0)
states: 11,440 (4)
abstracting: (1<=p_1_0)
states: 12,870 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

totally nodes used: 30000 (3.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 555785 181120 736905
used/not used/entry size/cache size: 199449 66909415 16 1024MB
basic ops cache: hits/miss/sum: 121905 34793 156698
used/not used/entry size/cache size: 59121 16718095 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: 7142 1745 8887
used/not used/entry size/cache size: 1745 8386863 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 67081602
1 25923
2 1018
3 129
4 42
5 28
6 26
7 20
8 8
9 6
>= 10 62

Total processing time: 0m 5.399sec


BK_STOP 1678681744608

--------------------
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:1125 (28), effective:72 (1)

initing FirstDep: 0m 0.000sec


iterations count:265 (6), effective:9 (0)

iterations count:272 (6), effective:16 (0)

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

iterations count:103 (2), effective:9 (0)

iterations count:272 (6), effective:16 (0)

iterations count:272 (6), effective:16 (0)

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

iterations count:272 (6), effective:16 (0)

iterations count:155 (3), effective:8 (0)

iterations count:356 (8), effective:16 (0)

iterations count:156 (3), effective:8 (0)

iterations count:155 (3), effective:8 (0)

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

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

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

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

iterations count:157 (3), effective:9 (0)

iterations count:255 (6), effective:24 (0)

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

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

iterations count:147 (3), effective:7 (0)

iterations count:147 (3), effective:7 (0)

iterations count:144 (3), effective:8 (0)

iterations count:147 (3), effective:7 (0)

iterations count:154 (3), effective:15 (0)

iterations count:156 (3), effective:8 (0)

iterations count:409 (10), effective:29 (0)

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

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

iterations count:159 (3), effective:16 (0)

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

iterations count:156 (3), effective:8 (0)

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

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

iterations count:130 (3), effective:7 (0)

iterations count:270 (6), effective:16 (0)

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

iterations count:103 (2), effective:9 (0)

iterations count:49 (1), effective:9 (0)

iterations count:287 (7), effective:14 (0)

iterations count:194 (4), effective:12 (0)

iterations count:187 (4), effective:17 (0)

iterations count:615 (15), effective:40 (1)

iterations count:620 (15), effective:40 (1)

iterations count:214 (5), effective:14 (0)

iterations count:265 (6), effective:9 (0)

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

iterations count:272 (6), effective:16 (0)

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

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

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

iterations count:409 (10), effective:29 (0)

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

iterations count:270 (6), effective:16 (0)

iterations count:180 (4), effective:16 (0)

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

iterations count:101 (2), effective:6 (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="NeighborGrid-PT-d2n3m1c12"
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 NeighborGrid-PT-d2n3m1c12, 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 r257-smll-167863532200073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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