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.r513-tall-167987241100438.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 PGCD-PT-D02N005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r513-tall-167987241100438
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.2K Mar 23 15:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 23 15:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 23 15:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 19K Mar 23 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 220K Mar 23 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 23 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Mar 23 15:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 6.7K Mar 26 22:42 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 PGCD-PT-D02N005-ReachabilityCardinality-00
FORMULA_NAME PGCD-PT-D02N005-ReachabilityCardinality-01
FORMULA_NAME PGCD-PT-D02N005-ReachabilityCardinality-02
FORMULA_NAME PGCD-PT-D02N005-ReachabilityCardinality-03
FORMULA_NAME PGCD-PT-D02N005-ReachabilityCardinality-04
FORMULA_NAME PGCD-PT-D02N005-ReachabilityCardinality-05
FORMULA_NAME PGCD-PT-D02N005-ReachabilityCardinality-06
FORMULA_NAME PGCD-PT-D02N005-ReachabilityCardinality-07
FORMULA_NAME PGCD-PT-D02N005-ReachabilityCardinality-08
FORMULA_NAME PGCD-PT-D02N005-ReachabilityCardinality-09
FORMULA_NAME PGCD-PT-D02N005-ReachabilityCardinality-10
FORMULA_NAME PGCD-PT-D02N005-ReachabilityCardinality-11
FORMULA_NAME PGCD-PT-D02N005-ReachabilityCardinality-12
FORMULA_NAME PGCD-PT-D02N005-ReachabilityCardinality-13
FORMULA_NAME PGCD-PT-D02N005-ReachabilityCardinality-14
FORMULA_NAME PGCD-PT-D02N005-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679896343123

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=PGCD-PT-D02N005
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: PGCD_COL_D2_N5
(NrP: 9 NrTr: 9 NrArc: 42)

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

net check time: 0m 0.000sec

init dd package: 0m 2.830sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 377 (3.8e+02) #states 8,484 (3)



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

checking: AG [~ [p1_3<=4]]
normalized: ~ [E [true U p1_3<=4]]

abstracting: (p1_3<=4)
states: 6,410 (3)
-> the formula is FALSE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

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

abstracting: (p0_1<=0)
states: 1,872 (3)
-> the formula is FALSE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EF [p1_1<=0]
normalized: E [true U p1_1<=0]

abstracting: (p1_1<=0)
states: 1,996 (3)
-> the formula is TRUE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

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

abstracting: (p1_3<=p1_3)
states: 8,484 (3)
-> the formula is TRUE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[p0_2<=0 & [[~ [[p1_3<=1 & [p0_1<=p1_3 & [[2<=p2_3 | ~ [p0_1<=p2_3]] | p0_1<=p2_2]]]] | 4<=p2_2] | p0_1<=p2_2]]]
normalized: ~ [E [true U ~ [[[[~ [[[[[~ [p0_1<=p2_3] | 2<=p2_3] | p0_1<=p2_2] & p0_1<=p1_3] & p1_3<=1]] | 4<=p2_2] | p0_1<=p2_2] & p0_2<=0]]]]

abstracting: (p0_2<=0)
states: 1,872 (3)
abstracting: (p0_1<=p2_2)
states: 4,710 (3)
abstracting: (4<=p2_2)
states: 3,060 (3)
abstracting: (p1_3<=1)
states: 3,352 (3)
abstracting: (p0_1<=p1_3)
states: 4,666 (3)
abstracting: (p0_1<=p2_2)
states: 4,710 (3)
abstracting: (2<=p2_3)
states: 5,292 (3)
abstracting: (p0_1<=p2_3)
states: 4,710 (3)
-> the formula is FALSE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[~ [[[~ [[~ [5<=p0_1] & [3<=p2_3 & p2_1<=p0_2]]] & ~ [4<=p2_3]] & p1_1<=4]] & [4<=p1_3 & [~ [[5<=p1_1 | [~ [[~ [p2_1<=p2_2] | [p2_2<=p2_2 | 3<=p0_1]]] | [p2_1<=0 | ~ [[p1_2<=p1_2 & 1<=p0_1]]]]]] & [5<=p0_3 & ~ [2<=p0_3]]]]]]
normalized: E [true U [[[[~ [2<=p0_3] & 5<=p0_3] & ~ [[[[~ [[p1_2<=p1_2 & 1<=p0_1]] | p2_1<=0] | ~ [[[p2_2<=p2_2 | 3<=p0_1] | ~ [p2_1<=p2_2]]]] | 5<=p1_1]]] & 4<=p1_3] & ~ [[[~ [4<=p2_3] & ~ [[[3<=p2_3 & p2_1<=p0_2] & ~ [5<=p0_1]]]] & p1_1<=4]]]]

abstracting: (p1_1<=4)
states: 6,410 (3)
abstracting: (5<=p0_1)
states: 2,184 (3)
abstracting: (p2_1<=p0_2)
states: 4,710 (3)
abstracting: (3<=p2_3)
states: 3,936 (3)
abstracting: (4<=p2_3)
states: 3,060 (3)
abstracting: (4<=p1_3)
states: 2,926 (3)
abstracting: (5<=p1_1)
states: 2,074 (3)
abstracting: (p2_1<=p2_2)
states: 4,710 (3)
abstracting: (3<=p0_1)
states: 3,936 (3)
abstracting: (p2_2<=p2_2)
states: 8,484 (3)
abstracting: (p2_1<=0)
states: 1,872 (3)
abstracting: (1<=p0_1)
states: 6,612 (3)
abstracting: (p1_2<=p1_2)
states: 8,484 (3)
abstracting: (5<=p0_3)
states: 2,184 (3)
abstracting: (2<=p0_3)
states: 5,292 (3)
-> the formula is FALSE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [~ [[[[p2_2<=0 & [[[~ [[p0_2<=0 & p2_1<=p1_1]] | p0_3<=p1_3] | p1_1<=p0_3] & p2_1<=1]] & [[~ [p2_1<=3] & [2<=p0_3 & [~ [2<=p0_3] | p2_3<=p1_1]]] | ~ [[p2_3<=p1_2 | p1_1<=p1_3]]]] & p1_1<=5]]]
normalized: E [true U ~ [[[[~ [[p2_3<=p1_2 | p1_1<=p1_3]] | [[[~ [2<=p0_3] | p2_3<=p1_1] & 2<=p0_3] & ~ [p2_1<=3]]] & [[[[~ [[p0_2<=0 & p2_1<=p1_1]] | p0_3<=p1_3] | p1_1<=p0_3] & p2_1<=1] & p2_2<=0]] & p1_1<=5]]]

abstracting: (p1_1<=5)
states: 6,935 (3)
abstracting: (p2_2<=0)
states: 1,872 (3)
abstracting: (p2_1<=1)
states: 3,192 (3)
abstracting: (p1_1<=p0_3)
states: 4,833 (3)
abstracting: (p0_3<=p1_3)
states: 5,160 (3)
abstracting: (p2_1<=p1_1)
states: 5,160 (3)
abstracting: (p0_2<=0)
states: 1,872 (3)
abstracting: (p2_1<=3)
states: 5,424 (3)
abstracting: (2<=p0_3)
states: 5,292 (3)
abstracting: (p2_3<=p1_1)
states: 4,666 (3)
abstracting: (2<=p0_3)
states: 5,292 (3)
abstracting: (p1_1<=p1_3)
states: 4,758 (3)
abstracting: (p2_3<=p1_2)
states: 4,666 (3)
-> the formula is TRUE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [~ [[[p0_1<=0 & p1_1<=p0_3] | ~ [[p2_3<=p2_1 | [[[p1_3<=p0_1 & [2<=p2_3 & ~ [p1_3<=4]]] | [[~ [p0_2<=p0_2] | [p0_1<=p0_1 & 1<=p1_1]] & ~ [p2_2<=4]]] & ~ [[[[4<=p2_3 | p0_1<=p2_2] | ~ [p1_2<=1]] & ~ [[3<=p1_3 | 2<=p1_1]]]]]]]]]]
normalized: ~ [E [true U [~ [[[~ [[~ [[3<=p1_3 | 2<=p1_1]] & [~ [p1_2<=1] | [4<=p2_3 | p0_1<=p2_2]]]] & [[~ [p2_2<=4] & [[p0_1<=p0_1 & 1<=p1_1] | ~ [p0_2<=p0_2]]] | [[~ [p1_3<=4] & 2<=p2_3] & p1_3<=p0_1]]] | p2_3<=p2_1]] | [p0_1<=0 & p1_1<=p0_3]]]]

abstracting: (p1_1<=p0_3)
states: 4,833 (3)
abstracting: (p0_1<=0)
states: 1,872 (3)
abstracting: (p2_3<=p2_1)
states: 4,710 (3)
abstracting: (p1_3<=p0_1)
states: 4,833 (3)
abstracting: (2<=p2_3)
states: 5,292 (3)
abstracting: (p1_3<=4)
states: 6,410 (3)
abstracting: (p0_2<=p0_2)
states: 8,484 (3)
abstracting: (1<=p1_1)
states: 6,488 (3)
abstracting: (p0_1<=p0_1)
states: 8,484 (3)
abstracting: (p2_2<=4)
states: 6,300 (3)
abstracting: (p0_1<=p2_2)
states: 4,710 (3)
abstracting: (4<=p2_3)
states: 3,060 (3)
abstracting: (p1_2<=1)
states: 3,352 (3)
abstracting: (2<=p1_1)
states: 5,132 (3)
abstracting: (3<=p1_3)
states: 3,794 (3)
-> the formula is FALSE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EF [[~ [[[[[[[~ [p2_1<=p1_1] & 5<=p1_3] | ~ [p1_1<=p1_1]] | p2_1<=p2_1] | p2_3<=2] | p2_2<=p1_1] | [~ [3<=p0_3] | [p2_3<=1 | [[[~ [p1_1<=4] & ~ [4<=p0_1]] | [[p2_1<=p0_1 | 2<=p1_2] & p1_3<=0]] & ~ [[[4<=p0_1 & p1_1<=0] & [p0_2<=p0_2 & p0_2<=2]]]]]]]] & [~ [[5<=p0_3 & [p2_3<=p0_3 & p2_3<=p1_3]]] | p2_1<=4]]]
normalized: E [true U [[~ [[[p2_3<=p0_3 & p2_3<=p1_3] & 5<=p0_3]] | p2_1<=4] & ~ [[[[[~ [[[p0_2<=p0_2 & p0_2<=2] & [4<=p0_1 & p1_1<=0]]] & [[[p2_1<=p0_1 | 2<=p1_2] & p1_3<=0] | [~ [4<=p0_1] & ~ [p1_1<=4]]]] | p2_3<=1] | ~ [3<=p0_3]] | [[p2_3<=2 | [p2_1<=p2_1 | [~ [p1_1<=p1_1] | [5<=p1_3 & ~ [p2_1<=p1_1]]]]] | p2_2<=p1_1]]]]]

abstracting: (p2_2<=p1_1)
states: 4,666 (3)
abstracting: (p2_1<=p1_1)
states: 5,160 (3)
abstracting: (5<=p1_3)
states: 2,074 (3)
abstracting: (p1_1<=p1_1)
states: 8,484 (3)
abstracting: (p2_1<=p2_1)
states: 8,484 (3)
abstracting: (p2_3<=2)
states: 4,548 (3)
abstracting: (3<=p0_3)
states: 3,936 (3)
abstracting: (p2_3<=1)
states: 3,192 (3)
abstracting: (p1_1<=4)
states: 6,410 (3)
abstracting: (4<=p0_1)
states: 3,060 (3)
abstracting: (p1_3<=0)
states: 1,996 (3)
abstracting: (2<=p1_2)
states: 5,132 (3)
abstracting: (p2_1<=p0_1)
states: 8,484 (3)
abstracting: (p1_1<=0)
states: 1,996 (3)
abstracting: (4<=p0_1)
states: 3,060 (3)
abstracting: (p0_2<=2)
states: 4,548 (3)
abstracting: (p0_2<=p0_2)
states: 8,484 (3)
abstracting: (p2_1<=4)
states: 6,300 (3)
abstracting: (5<=p0_3)
states: 2,184 (3)
abstracting: (p2_3<=p1_3)
states: 5,160 (3)
abstracting: (p2_3<=p0_3)
states: 8,484 (3)
-> the formula is FALSE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [[[[p2_2<=p2_3 | [p2_3<=p2_1 | [p0_1<=p1_3 & [p0_1<=4 & [p2_3<=2 & [[4<=p2_3 & 5<=p2_3] | ~ [2<=p1_2]]]]]]] | p2_1<=p1_3] | ~ [[~ [[[[p0_2<=p0_3 | p0_3<=3] | p2_2<=1] | ~ [[3<=p2_3 & 4<=p2_1]]]] | ~ [[[[5<=p2_1 | ~ [p2_3<=p1_3]] | ~ [[2<=p0_1 & p0_1<=0]]] & [~ [[[p2_1<=p2_2 & p2_2<=p0_2] & 5<=p2_1]] | [p0_2<=4 & p0_1<=p0_3]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [[[[p0_2<=4 & p0_1<=p0_3] | ~ [[[p2_1<=p2_2 & p2_2<=p0_2] & 5<=p2_1]]] & [~ [[2<=p0_1 & p0_1<=0]] | [~ [p2_3<=p1_3] | 5<=p2_1]]]] | ~ [[~ [[3<=p2_3 & 4<=p2_1]] | [[p0_2<=p0_3 | p0_3<=3] | p2_2<=1]]]]] | [[[[[[[~ [2<=p1_2] | [4<=p2_3 & 5<=p2_3]] & p2_3<=2] & p0_1<=4] & p0_1<=p1_3] | p2_3<=p2_1] | p2_2<=p2_3] | p2_1<=p1_3]]]]]

abstracting: (p2_1<=p1_3)
states: 4,666 (3)
abstracting: (p2_2<=p2_3)
states: 4,710 (3)
abstracting: (p2_3<=p2_1)
states: 4,710 (3)
abstracting: (p0_1<=p1_3)
states: 4,666 (3)
abstracting: (p0_1<=4)
states: 6,300 (3)
abstracting: (p2_3<=2)
states: 4,548 (3)
abstracting: (5<=p2_3)
states: 2,184 (3)
abstracting: (4<=p2_3)
states: 3,060 (3)
abstracting: (2<=p1_2)
states: 5,132 (3)
abstracting: (p2_2<=1)
states: 3,192 (3)
abstracting: (p0_3<=3)
states: 5,424 (3)
abstracting: (p0_2<=p0_3)
states: 4,710 (3)
abstracting: (4<=p2_1)
states: 3,060 (3)
abstracting: (3<=p2_3)
states: 3,936 (3)
abstracting: (5<=p2_1)
states: 2,184 (3)
abstracting: (p2_3<=p1_3)
states: 5,160 (3)
abstracting: (p0_1<=0)
states: 1,872 (3)
abstracting: (2<=p0_1)
states: 5,292 (3)
abstracting: (5<=p2_1)
states: 2,184 (3)
abstracting: (p2_2<=p0_2)
states: 8,484 (3)
abstracting: (p2_1<=p2_2)
states: 4,710 (3)
abstracting: (p0_1<=p0_3)
states: 4,710 (3)
abstracting: (p0_2<=4)
states: 6,300 (3)
-> the formula is FALSE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [[[[[[[~ [[1<=p1_3 & ~ [4<=p2_1]]] | p0_1<=5] & 2<=p2_3] & ~ [p0_3<=1]] & [~ [3<=p1_3] & p1_3<=p2_3]] | [p0_3<=4 & p0_2<=0]] | [[~ [[[[[3<=p2_2 | 3<=p1_1] | [p0_2<=p1_2 & p2_3<=p2_2]] | [[p0_3<=p0_2 | p0_2<=3] | p0_3<=2]] | [1<=p1_1 | [p1_2<=p1_3 | [4<=p2_1 | p2_3<=1]]]]] & p2_2<=p2_3] & ~ [[~ [[[~ [p1_2<=1] | [[1<=p0_3 & 2<=p1_1] | [p0_1<=3 & 2<=p1_3]]] | [[5<=p1_3 & [p1_3<=0 | p0_3<=p2_2]] & [~ [p2_2<=p0_3] | ~ [p2_1<=2]]]]] | [p2_2<=3 | p2_2<=p0_1]]]]]]
normalized: E [true U [[~ [[[p2_2<=3 | p2_2<=p0_1] | ~ [[[[~ [p2_1<=2] | ~ [p2_2<=p0_3]] & [[p1_3<=0 | p0_3<=p2_2] & 5<=p1_3]] | [[[p0_1<=3 & 2<=p1_3] | [1<=p0_3 & 2<=p1_1]] | ~ [p1_2<=1]]]]]] & [~ [[[[[4<=p2_1 | p2_3<=1] | p1_2<=p1_3] | 1<=p1_1] | [[[p0_3<=p0_2 | p0_2<=3] | p0_3<=2] | [[p0_2<=p1_2 & p2_3<=p2_2] | [3<=p2_2 | 3<=p1_1]]]]] & p2_2<=p2_3]] | [[p0_3<=4 & p0_2<=0] | [[~ [3<=p1_3] & p1_3<=p2_3] & [~ [p0_3<=1] & [[~ [[~ [4<=p2_1] & 1<=p1_3]] | p0_1<=5] & 2<=p2_3]]]]]]

abstracting: (2<=p2_3)
states: 5,292 (3)
abstracting: (p0_1<=5)
states: 6,832 (3)
abstracting: (1<=p1_3)
states: 6,488 (3)
abstracting: (4<=p2_1)
states: 3,060 (3)
abstracting: (p0_3<=1)
states: 3,192 (3)
abstracting: (p1_3<=p2_3)
states: 5,320 (3)
abstracting: (3<=p1_3)
states: 3,794 (3)
abstracting: (p0_2<=0)
states: 1,872 (3)
abstracting: (p0_3<=4)
states: 6,300 (3)
abstracting: (p2_2<=p2_3)
states: 4,710 (3)
abstracting: (3<=p1_1)
states: 3,794 (3)
abstracting: (3<=p2_2)
states: 3,936 (3)
abstracting: (p2_3<=p2_2)
states: 4,710 (3)
abstracting: (p0_2<=p1_2)
states: 5,160 (3)
abstracting: (p0_3<=2)
states: 4,548 (3)
abstracting: (p0_2<=3)
states: 5,424 (3)
abstracting: (p0_3<=p0_2)
states: 4,710 (3)
abstracting: (1<=p1_1)
states: 6,488 (3)
abstracting: (p1_2<=p1_3)
states: 4,758 (3)
abstracting: (p2_3<=1)
states: 3,192 (3)
abstracting: (4<=p2_1)
states: 3,060 (3)
abstracting: (p1_2<=1)
states: 3,352 (3)
abstracting: (2<=p1_1)
states: 5,132 (3)
abstracting: (1<=p0_3)
states: 6,612 (3)
abstracting: (2<=p1_3)
states: 5,132 (3)
abstracting: (p0_1<=3)
states: 5,424 (3)
abstracting: (5<=p1_3)
states: 2,074 (3)
abstracting: (p0_3<=p2_2)
states: 4,710 (3)
abstracting: (p1_3<=0)
states: 1,996 (3)
abstracting: (p2_2<=p0_3)
states: 4,710 (3)
abstracting: (p2_1<=2)
states: 4,548 (3)
abstracting: (p2_2<=p0_1)
states: 4,710 (3)
abstracting: (p2_2<=3)
states: 5,424 (3)
-> the formula is TRUE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AG [[2<=p0_1 | [[[[5<=p0_2 & ~ [[[p2_2<=0 & [5<=p2_3 & p1_1<=0]] & ~ [[p2_3<=2 & p0_3<=5]]]]] | ~ [[~ [[5<=p2_2 & 4<=p0_1]] & p0_2<=p0_1]]] | [p2_2<=p2_3 & [~ [[[2<=p1_1 & p1_2<=3] & [p2_1<=0 | 2<=p2_2]]] & ~ [[[p2_3<=1 | p0_1<=p0_1] | 2<=p1_1]]]]] | [[~ [[p2_1<=p1_1 | [[[3<=p1_1 & 5<=p0_3] | ~ [p1_1<=p1_1]] | ~ [[p1_3<=p1_3 & 2<=p1_3]]]]] | [[[~ [[p1_3<=p2_2 & p0_3<=0]] | ~ [[p2_2<=p2_2 | p2_1<=4]]] | ~ [[[p0_2<=4 | 1<=p2_1] | 2<=p0_2]]] | [~ [1<=p1_2] | 3<=p1_1]]] | [p0_3<=3 | [~ [4<=p2_3] & p2_3<=p1_2]]]]]]
normalized: ~ [E [true U ~ [[[[[[~ [4<=p2_3] & p2_3<=p1_2] | p0_3<=3] | [[[~ [1<=p1_2] | 3<=p1_1] | [~ [[[p0_2<=4 | 1<=p2_1] | 2<=p0_2]] | [~ [[p2_2<=p2_2 | p2_1<=4]] | ~ [[p1_3<=p2_2 & p0_3<=0]]]]] | ~ [[[~ [[p1_3<=p1_3 & 2<=p1_3]] | [~ [p1_1<=p1_1] | [3<=p1_1 & 5<=p0_3]]] | p2_1<=p1_1]]]] | [[[~ [[[p2_3<=1 | p0_1<=p0_1] | 2<=p1_1]] & ~ [[[p2_1<=0 | 2<=p2_2] & [2<=p1_1 & p1_2<=3]]]] & p2_2<=p2_3] | [~ [[~ [[5<=p2_2 & 4<=p0_1]] & p0_2<=p0_1]] | [~ [[~ [[p2_3<=2 & p0_3<=5]] & [[5<=p2_3 & p1_1<=0] & p2_2<=0]]] & 5<=p0_2]]]] | 2<=p0_1]]]]

abstracting: (2<=p0_1)
states: 5,292 (3)
abstracting: (5<=p0_2)
states: 2,184 (3)
abstracting: (p2_2<=0)
states: 1,872 (3)
abstracting: (p1_1<=0)
states: 1,996 (3)
abstracting: (5<=p2_3)
states: 2,184 (3)
abstracting: (p0_3<=5)
states: 6,832 (3)
abstracting: (p2_3<=2)
states: 4,548 (3)
abstracting: (p0_2<=p0_1)
states: 4,710 (3)
abstracting: (4<=p0_1)
states: 3,060 (3)
abstracting: (5<=p2_2)
states: 2,184 (3)
abstracting: (p2_2<=p2_3)
states: 4,710 (3)
abstracting: (p1_2<=3)
states: 5,558 (3)
abstracting: (2<=p1_1)
states: 5,132 (3)
abstracting: (2<=p2_2)
states: 5,292 (3)
abstracting: (p2_1<=0)
states: 1,872 (3)
abstracting: (2<=p1_1)
states: 5,132 (3)
abstracting: (p0_1<=p0_1)
states: 8,484 (3)
abstracting: (p2_3<=1)
states: 3,192 (3)
abstracting: (p2_1<=p1_1)
states: 5,160 (3)
abstracting: (5<=p0_3)
states: 2,184 (3)
abstracting: (3<=p1_1)
states: 3,794 (3)
abstracting: (p1_1<=p1_1)
states: 8,484 (3)
abstracting: (2<=p1_3)
states: 5,132 (3)
abstracting: (p1_3<=p1_3)
states: 8,484 (3)
abstracting: (p0_3<=0)
states: 1,872 (3)
abstracting: (p1_3<=p2_2)
states: 4,833 (3)
abstracting: (p2_1<=4)
states: 6,300 (3)
abstracting: (p2_2<=p2_2)
states: 8,484 (3)
abstracting: (2<=p0_2)
states: 5,292 (3)
abstracting: (1<=p2_1)
states: 6,612 (3)
abstracting: (p0_2<=4)
states: 6,300 (3)
abstracting: (3<=p1_1)
states: 3,794 (3)
abstracting: (1<=p1_2)
states: 6,488 (3)
abstracting: (p0_3<=3)
states: 5,424 (3)
abstracting: (p2_3<=p1_2)
states: 4,666 (3)
abstracting: (4<=p2_3)
states: 3,060 (3)
-> the formula is TRUE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[[[~ [[~ [[2<=p0_2 & [p2_3<=p1_1 & p2_3<=5]]] & 4<=p2_2]] | p0_3<=p1_1] & 4<=p1_1] & [p0_1<=p2_2 & ~ [1<=p0_1]]] & [[[p1_1<=p2_2 | 2<=p2_2] | [[3<=p2_1 | ~ [[p1_1<=2 & p1_1<=2]]] | [p2_1<=p0_2 & ~ [[~ [[p0_1<=p2_2 & 3<=p2_3]] | [[p1_3<=1 | 1<=p1_1] | [2<=p1_3 & 1<=p0_3]]]]]]] & [[[[~ [[~ [p1_2<=p2_2] | [4<=p0_1 & p0_1<=p2_2]]] & ~ [[5<=p1_3 & p1_3<=4]]] & [~ [[[p0_1<=p2_1 & p2_3<=0] | p1_2<=2]] & ~ [[[p0_3<=p0_1 | p2_2<=p2_1] & [p0_1<=p2_3 | p0_3<=1]]]]] | p0_3<=0] | [p2_3<=p0_3 | [[[~ [[p2_3<=2 | 2<=p2_2]] & [p2_3<=p2_2 & [4<=p2_3 | p0_1<=1]]] | [~ [5<=p1_3] | ~ [p1_1<=p1_3]]] & [[~ [p0_1<=p2_3] | [[p0_2<=5 & p0_1<=5] & [p0_3<=p0_1 & p2_3<=p1_3]]] | [p2_3<=5 | [[p1_3<=p1_2 & p2_2<=2] | [3<=p0_1 | p1_2<=p0_1]]]]]]]]]]
normalized: E [true U [[[[[[[[[3<=p0_1 | p1_2<=p0_1] | [p1_3<=p1_2 & p2_2<=2]] | p2_3<=5] | [[[p0_3<=p0_1 & p2_3<=p1_3] & [p0_2<=5 & p0_1<=5]] | ~ [p0_1<=p2_3]]] & [[~ [p1_1<=p1_3] | ~ [5<=p1_3]] | [[[4<=p2_3 | p0_1<=1] & p2_3<=p2_2] & ~ [[p2_3<=2 | 2<=p2_2]]]]] | p2_3<=p0_3] | [[[~ [[[p0_1<=p2_3 | p0_3<=1] & [p0_3<=p0_1 | p2_2<=p2_1]]] & ~ [[[p0_1<=p2_1 & p2_3<=0] | p1_2<=2]]] & [~ [[5<=p1_3 & p1_3<=4]] & ~ [[[4<=p0_1 & p0_1<=p2_2] | ~ [p1_2<=p2_2]]]]] | p0_3<=0]] & [[[~ [[[[2<=p1_3 & 1<=p0_3] | [p1_3<=1 | 1<=p1_1]] | ~ [[p0_1<=p2_2 & 3<=p2_3]]]] & p2_1<=p0_2] | [~ [[p1_1<=2 & p1_1<=2]] | 3<=p2_1]] | [p1_1<=p2_2 | 2<=p2_2]]] & [[~ [1<=p0_1] & p0_1<=p2_2] & [[~ [[~ [[[p2_3<=p1_1 & p2_3<=5] & 2<=p0_2]] & 4<=p2_2]] | p0_3<=p1_1] & 4<=p1_1]]]]

abstracting: (4<=p1_1)
states: 2,926 (3)
abstracting: (p0_3<=p1_1)
states: 4,666 (3)
abstracting: (4<=p2_2)
states: 3,060 (3)
abstracting: (2<=p0_2)
states: 5,292 (3)
abstracting: (p2_3<=5)
states: 6,832 (3)
abstracting: (p2_3<=p1_1)
states: 4,666 (3)
abstracting: (p0_1<=p2_2)
states: 4,710 (3)
abstracting: (1<=p0_1)
states: 6,612 (3)
abstracting: (2<=p2_2)
states: 5,292 (3)
abstracting: (p1_1<=p2_2)
states: 4,833 (3)
abstracting: (3<=p2_1)
states: 3,936 (3)
abstracting: (p1_1<=2)
states: 4,690 (3)
abstracting: (p1_1<=2)
states: 4,690 (3)
abstracting: (p2_1<=p0_2)
states: 4,710 (3)
abstracting: (3<=p2_3)
states: 3,936 (3)
abstracting: (p0_1<=p2_2)
states: 4,710 (3)
abstracting: (1<=p1_1)
states: 6,488 (3)
abstracting: (p1_3<=1)
states: 3,352 (3)
abstracting: (1<=p0_3)
states: 6,612 (3)
abstracting: (2<=p1_3)
states: 5,132 (3)
abstracting: (p0_3<=0)
states: 1,872 (3)
abstracting: (p1_2<=p2_2)
states: 5,320 (3)
abstracting: (p0_1<=p2_2)
states: 4,710 (3)
abstracting: (4<=p0_1)
states: 3,060 (3)
abstracting: (p1_3<=4)
states: 6,410 (3)
abstracting: (5<=p1_3)
states: 2,074 (3)
abstracting: (p1_2<=2)
states: 4,690 (3)
abstracting: (p2_3<=0)
states: 1,872 (3)
abstracting: (p0_1<=p2_1)
states: 8,484 (3)
abstracting: (p2_2<=p2_1)
states: 4,710 (3)
abstracting: (p0_3<=p0_1)
states: 4,710 (3)
abstracting: (p0_3<=1)
states: 3,192 (3)
abstracting: (p0_1<=p2_3)
states: 4,710 (3)
abstracting: (p2_3<=p0_3)
states: 8,484 (3)
abstracting: (2<=p2_2)
states: 5,292 (3)
abstracting: (p2_3<=2)
states: 4,548 (3)
abstracting: (p2_3<=p2_2)
states: 4,710 (3)
abstracting: (p0_1<=1)
states: 3,192 (3)
abstracting: (4<=p2_3)
states: 3,060 (3)
abstracting: (5<=p1_3)
states: 2,074 (3)
abstracting: (p1_1<=p1_3)
states: 4,758 (3)
abstracting: (p0_1<=p2_3)
states: 4,710 (3)
abstracting: (p0_1<=5)
states: 6,832 (3)
abstracting: (p0_2<=5)
states: 6,832 (3)
abstracting: (p2_3<=p1_3)
states: 5,160 (3)
abstracting: (p0_3<=p0_1)
states: 4,710 (3)
abstracting: (p2_3<=5)
states: 6,832 (3)
abstracting: (p2_2<=2)
states: 4,548 (3)
abstracting: (p1_3<=p1_2)
states: 4,758 (3)
abstracting: (p1_2<=p0_1)
states: 4,833 (3)
abstracting: (3<=p0_1)
states: 3,936 (3)
-> the formula is TRUE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: AG [[[p2_1<=2 & [[[p2_3<=3 & [~ [[p1_2<=p2_1 | p1_1<=p0_2]] | ~ [[p1_2<=p1_2 & [p1_2<=p2_2 & p0_3<=p1_2]]]]] & [p2_3<=2 & p0_2<=3]] & [4<=p0_1 | ~ [[[[[p2_2<=p1_3 & p2_2<=p1_1] & [p1_1<=3 & 2<=p2_1]] & [~ [p1_1<=p2_2] & [p2_2<=1 & 2<=p1_3]]] | ~ [5<=p1_2]]]]]] | [~ [[~ [p2_1<=p2_2] & [p2_2<=p2_3 | [[[[5<=p0_2 | 5<=p2_2] & [p2_3<=p1_2 & 4<=p2_3]] & ~ [p2_2<=5]] & ~ [[[p1_1<=p1_3 & p1_3<=p0_3] | ~ [5<=p1_2]]]]]]] | [[~ [[[p2_2<=0 | p0_2<=p0_2] | p0_1<=p1_1]] | [[[[p0_3<=5 | p1_3<=p2_1] & [p0_2<=p1_2 & p1_3<=p0_3]] | [[[p0_3<=4 & p0_1<=p2_3] & [p1_1<=0 & p2_1<=4]] & ~ [[2<=p0_1 | 4<=p1_1]]]] & [[p2_1<=p1_2 | [~ [2<=p2_2] & [p2_1<=p0_2 | 4<=p0_1]]] & [[[p2_2<=1 & p2_3<=p2_2] | [p1_3<=p2_1 | p0_3<=p0_2]] | p1_3<=p0_2]]]] | 5<=p2_3]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[p1_3<=p2_1 | p0_3<=p0_2] | [p2_2<=1 & p2_3<=p2_2]] | p1_3<=p0_2] & [[[p2_1<=p0_2 | 4<=p0_1] & ~ [2<=p2_2]] | p2_1<=p1_2]] & [[~ [[2<=p0_1 | 4<=p1_1]] & [[p1_1<=0 & p2_1<=4] & [p0_3<=4 & p0_1<=p2_3]]] | [[p0_2<=p1_2 & p1_3<=p0_3] & [p0_3<=5 | p1_3<=p2_1]]]] | ~ [[[p2_2<=0 | p0_2<=p0_2] | p0_1<=p1_1]]] | 5<=p2_3] | ~ [[[[~ [[~ [5<=p1_2] | [p1_1<=p1_3 & p1_3<=p0_3]]] & [~ [p2_2<=5] & [[p2_3<=p1_2 & 4<=p2_3] & [5<=p0_2 | 5<=p2_2]]]] | p2_2<=p2_3] & ~ [p2_1<=p2_2]]]] | [[[~ [[~ [5<=p1_2] | [[[p2_2<=1 & 2<=p1_3] & ~ [p1_1<=p2_2]] & [[p1_1<=3 & 2<=p2_1] & [p2_2<=p1_3 & p2_2<=p1_1]]]]] | 4<=p0_1] & [[p2_3<=2 & p0_2<=3] & [[~ [[[p1_2<=p2_2 & p0_3<=p1_2] & p1_2<=p1_2]] | ~ [[p1_2<=p2_1 | p1_1<=p0_2]]] & p2_3<=3]]] & p2_1<=2]]]]]

abstracting: (p2_1<=2)
states: 4,548 (3)
abstracting: (p2_3<=3)
states: 5,424 (3)
abstracting: (p1_1<=p0_2)
states: 4,833 (3)
abstracting: (p1_2<=p2_1)
states: 4,833 (3)
abstracting: (p1_2<=p1_2)
states: 8,484 (3)
abstracting: (p0_3<=p1_2)
states: 4,666 (3)
abstracting: (p1_2<=p2_2)
states: 5,320 (3)
abstracting: (p0_2<=3)
states: 5,424 (3)
abstracting: (p2_3<=2)
states: 4,548 (3)
abstracting: (4<=p0_1)
states: 3,060 (3)
abstracting: (p2_2<=p1_1)
states: 4,666 (3)
abstracting: (p2_2<=p1_3)
states: 4,666 (3)
abstracting: (2<=p2_1)
states: 5,292 (3)
abstracting: (p1_1<=3)
states: 5,558 (3)
abstracting: (p1_1<=p2_2)
states: 4,833 (3)
abstracting: (2<=p1_3)
states: 5,132 (3)
abstracting: (p2_2<=1)
states: 3,192 (3)
abstracting: (5<=p1_2)
states: 2,074 (3)
abstracting: (p2_1<=p2_2)
states: 4,710 (3)
abstracting: (p2_2<=p2_3)
states: 4,710 (3)
abstracting: (5<=p2_2)
states: 2,184 (3)
abstracting: (5<=p0_2)
states: 2,184 (3)
abstracting: (4<=p2_3)
states: 3,060 (3)
abstracting: (p2_3<=p1_2)
states: 4,666 (3)
abstracting: (p2_2<=5)
states: 6,832 (3)
abstracting: (p1_3<=p0_3)
states: 5,320 (3)
abstracting: (p1_1<=p1_3)
states: 4,758 (3)
abstracting: (5<=p1_2)
states: 2,074 (3)
abstracting: (5<=p2_3)
states: 2,184 (3)
abstracting: (p0_1<=p1_1)
states: 5,160 (3)
abstracting: (p0_2<=p0_2)
states: 8,484 (3)
abstracting: (p2_2<=0)
states: 1,872 (3)
abstracting: (p1_3<=p2_1)
states: 4,833 (3)
abstracting: (p0_3<=5)
states: 6,832 (3)
abstracting: (p1_3<=p0_3)
states: 5,320 (3)
abstracting: (p0_2<=p1_2)
states: 5,160 (3)
abstracting: (p0_1<=p2_3)
states: 4,710 (3)
abstracting: (p0_3<=4)
states: 6,300 (3)
abstracting: (p2_1<=4)
states: 6,300 (3)
abstracting: (p1_1<=0)
states: 1,996 (3)
abstracting: (4<=p1_1)
states: 2,926 (3)
abstracting: (2<=p0_1)
states: 5,292 (3)
abstracting: (p2_1<=p1_2)
states: 4,666 (3)
abstracting: (2<=p2_2)
states: 5,292 (3)
abstracting: (4<=p0_1)
states: 3,060 (3)
abstracting: (p2_1<=p0_2)
states: 4,710 (3)
abstracting: (p1_3<=p0_2)
states: 4,833 (3)
abstracting: (p2_3<=p2_2)
states: 4,710 (3)
abstracting: (p2_2<=1)
states: 3,192 (3)
abstracting: (p0_3<=p0_2)
states: 4,710 (3)
abstracting: (p1_3<=p2_1)
states: 4,833 (3)
-> the formula is FALSE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: EF [[[[[[~ [[p0_3<=p0_3 | [p1_1<=5 & [p1_2<=3 | 5<=p2_2]]]] | p1_2<=4] & [1<=p1_1 & 5<=p1_2]] & [[[[[[p2_1<=0 & p1_2<=p2_3] & p2_1<=0] & ~ [4<=p0_3]] | p1_3<=4] & [p1_2<=3 | p1_3<=5]] | [~ [[4<=p1_2 | [~ [2<=p2_1] & [4<=p2_3 | p2_2<=p0_3]]]] | [[[3<=p2_2 | [p2_1<=3 | 1<=p0_3]] & ~ [[4<=p1_2 | p2_3<=p0_2]]] & [~ [[p1_1<=5 & 4<=p2_1]] | [p2_1<=p2_2 | [p1_2<=p0_2 | p1_2<=p2_1]]]]]]] & [[[[[[[1<=p0_3 & 1<=p2_3] | [p1_1<=p0_3 | p0_3<=p0_2]] | [~ [p2_2<=p2_2] | ~ [p1_1<=p2_3]]] | [p0_3<=3 & ~ [p1_3<=p1_1]]] | [[[[3<=p0_3 | 2<=p2_1] | [p0_2<=p2_2 & p1_1<=5]] & [[p0_2<=3 | p2_3<=p1_1] & [p1_3<=p0_1 | p2_2<=p0_3]]] | p1_2<=p0_2]] | [p2_1<=1 | p1_1<=p1_1]] | [~ [p2_1<=3] | [[~ [3<=p0_2] & [[~ [p0_1<=p1_1] | ~ [p0_3<=2]] | p1_1<=2]] | ~ [[p2_2<=p0_2 | p2_2<=p0_1]]]]]] & ~ [p2_1<=p0_1]]]
normalized: E [true U [~ [p2_1<=p0_1] & [[[[~ [[p2_2<=p0_2 | p2_2<=p0_1]] | [[p1_1<=2 | [~ [p0_3<=2] | ~ [p0_1<=p1_1]]] & ~ [3<=p0_2]]] | ~ [p2_1<=3]] | [[p2_1<=1 | p1_1<=p1_1] | [[p1_2<=p0_2 | [[[p1_3<=p0_1 | p2_2<=p0_3] & [p0_2<=3 | p2_3<=p1_1]] & [[p0_2<=p2_2 & p1_1<=5] | [3<=p0_3 | 2<=p2_1]]]] | [[p0_3<=3 & ~ [p1_3<=p1_1]] | [[~ [p1_1<=p2_3] | ~ [p2_2<=p2_2]] | [[p1_1<=p0_3 | p0_3<=p0_2] | [1<=p0_3 & 1<=p2_3]]]]]]] & [[[[[[p2_1<=p2_2 | [p1_2<=p0_2 | p1_2<=p2_1]] | ~ [[p1_1<=5 & 4<=p2_1]]] & [~ [[4<=p1_2 | p2_3<=p0_2]] & [3<=p2_2 | [p2_1<=3 | 1<=p0_3]]]] | ~ [[4<=p1_2 | [[4<=p2_3 | p2_2<=p0_3] & ~ [2<=p2_1]]]]] | [[p1_2<=3 | p1_3<=5] & [p1_3<=4 | [~ [4<=p0_3] & [p2_1<=0 & [p2_1<=0 & p1_2<=p2_3]]]]]] & [[1<=p1_1 & 5<=p1_2] & [p1_2<=4 | ~ [[p0_3<=p0_3 | [p1_1<=5 & [p1_2<=3 | 5<=p2_2]]]]]]]]]]

abstracting: (5<=p2_2)
states: 2,184 (3)
abstracting: (p1_2<=3)
states: 5,558 (3)
abstracting: (p1_1<=5)
states: 6,935 (3)
abstracting: (p0_3<=p0_3)
states: 8,484 (3)
abstracting: (p1_2<=4)
states: 6,410 (3)
abstracting: (5<=p1_2)
states: 2,074 (3)
abstracting: (1<=p1_1)
states: 6,488 (3)
abstracting: (p1_2<=p2_3)
states: 4,833 (3)
abstracting: (p2_1<=0)
states: 1,872 (3)
abstracting: (p2_1<=0)
states: 1,872 (3)
abstracting: (4<=p0_3)
states: 3,060 (3)
abstracting: (p1_3<=4)
states: 6,410 (3)
abstracting: (p1_3<=5)
states: 6,935 (3)
abstracting: (p1_2<=3)
states: 5,558 (3)
abstracting: (2<=p2_1)
states: 5,292 (3)
abstracting: (p2_2<=p0_3)
states: 4,710 (3)
abstracting: (4<=p2_3)
states: 3,060 (3)
abstracting: (4<=p1_2)
states: 2,926 (3)
abstracting: (1<=p0_3)
states: 6,612 (3)
abstracting: (p2_1<=3)
states: 5,424 (3)
abstracting: (3<=p2_2)
states: 3,936 (3)
abstracting: (p2_3<=p0_2)
states: 4,710 (3)
abstracting: (4<=p1_2)
states: 2,926 (3)
abstracting: (4<=p2_1)
states: 3,060 (3)
abstracting: (p1_1<=5)
states: 6,935 (3)
abstracting: (p1_2<=p2_1)
states: 4,833 (3)
abstracting: (p1_2<=p0_2)
states: 5,320 (3)
abstracting: (p2_1<=p2_2)
states: 4,710 (3)
abstracting: (1<=p2_3)
states: 6,612 (3)
abstracting: (1<=p0_3)
states: 6,612 (3)
abstracting: (p0_3<=p0_2)
states: 4,710 (3)
abstracting: (p1_1<=p0_3)
states: 4,833 (3)
abstracting: (p2_2<=p2_2)
states: 8,484 (3)
abstracting: (p1_1<=p2_3)
states: 4,833 (3)
abstracting: (p1_3<=p1_1)
states: 4,758 (3)
abstracting: (p0_3<=3)
states: 5,424 (3)
abstracting: (2<=p2_1)
states: 5,292 (3)
abstracting: (3<=p0_3)
states: 3,936 (3)
abstracting: (p1_1<=5)
states: 6,935 (3)
abstracting: (p0_2<=p2_2)
states: 8,484 (3)
abstracting: (p2_3<=p1_1)
states: 4,666 (3)
abstracting: (p0_2<=3)
states: 5,424 (3)
abstracting: (p2_2<=p0_3)
states: 4,710 (3)
abstracting: (p1_3<=p0_1)
states: 4,833 (3)
abstracting: (p1_2<=p0_2)
states: 5,320 (3)
abstracting: (p1_1<=p1_1)
states: 8,484 (3)
abstracting: (p2_1<=1)
states: 3,192 (3)
abstracting: (p2_1<=3)
states: 5,424 (3)
abstracting: (3<=p0_2)
states: 3,936 (3)
abstracting: (p0_1<=p1_1)
states: 5,160 (3)
abstracting: (p0_3<=2)
states: 4,548 (3)
abstracting: (p1_1<=2)
states: 4,690 (3)
abstracting: (p2_2<=p0_1)
states: 4,710 (3)
abstracting: (p2_2<=p0_2)
states: 8,484 (3)
abstracting: (p2_1<=p0_1)
states: 8,484 (3)
-> the formula is FALSE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [[~ [[[[~ [p2_2<=p1_2] & [5<=p0_2 & [[[p0_3<=p0_1 | 2<=p0_1] | [2<=p1_2 | p2_1<=p2_2]] & [[p1_3<=5 & p1_1<=1] | ~ [p0_1<=0]]]]] | [4<=p2_2 | [[[p1_1<=2 | [p0_1<=p1_3 | p1_1<=p2_2]] | [~ [4<=p0_3] | p2_3<=3]] | [[~ [1<=p0_3] | p0_2<=3] & [[p2_3<=p2_1 & 3<=p0_1] | [p0_1<=p2_2 & 5<=p1_2]]]]]] | ~ [p2_3<=5]]] | [[[[p1_2<=3 | 2<=p2_2] | [~ [[~ [[p0_1<=p0_1 | p2_3<=p0_2]] & [[p2_2<=p2_2 & p2_2<=2] | [4<=p2_3 & p0_3<=1]]]] | [[~ [[p0_3<=p2_1 & p1_3<=p2_2]] | ~ [[p2_2<=4 & 5<=p1_2]]] | p1_1<=3]]] | [[[~ [p0_2<=2] & [[p0_3<=p1_2 & ~ [p2_1<=p0_3]] | [2<=p0_2 | [p1_1<=p2_1 | p1_1<=p2_1]]]] & [[[~ [p1_1<=5] | [1<=p0_1 & p1_3<=3]] & [p2_1<=p1_2 & [p1_3<=p1_2 & p1_1<=p2_3]]] | [p1_3<=2 | [p1_3<=p2_2 & [p0_2<=p2_3 | p2_3<=p2_3]]]]] & [[3<=p1_1 | p0_3<=3] & [~ [[p2_3<=2 & p2_3<=p2_2]] & [p1_1<=2 | [[1<=p2_1 | p2_1<=4] & ~ [5<=p2_1]]]]]]] | [[[p1_2<=p2_3 | [~ [[p0_3<=p1_1 & p2_2<=4]] | ~ [[[p2_2<=4 | p0_3<=5] | [p0_2<=p1_3 & p2_3<=3]]]]] & [[[[p2_2<=5 | [5<=p0_2 | 5<=p1_2]] | ~ [1<=p0_2]] | p0_2<=p1_1] | [[[[3<=p0_2 & p1_1<=p2_3] & p1_3<=5] & [p2_2<=2 & [2<=p0_1 & 5<=p1_3]]] | [[[1<=p1_3 & p1_3<=0] & ~ [p1_3<=p0_1]] & ~ [[3<=p0_1 & p2_1<=p0_1]]]]]] & [[[[[~ [p1_1<=2] & [p2_3<=2 & 3<=p0_1]] & [p0_1<=p1_2 | [p0_1<=1 & 1<=p1_2]]] & [[p2_3<=0 | p0_3<=3] & ~ [[3<=p1_2 & p0_3<=p2_3]]]] | [[[[5<=p2_1 | p1_2<=p1_3] | [p0_1<=4 | 1<=p1_2]] | ~ [5<=p0_3]] & ~ [[1<=p2_2 | [p0_1<=5 & 2<=p2_1]]]]] | [[~ [1<=p0_3] | [~ [4<=p1_1] | ~ [5<=p0_1]]] | [[~ [p2_2<=3] | p0_2<=0] | [2<=p0_3 | ~ [p1_3<=p2_3]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[2<=p0_3 | ~ [p1_3<=p2_3]] | [p0_2<=0 | ~ [p2_2<=3]]] | [[~ [5<=p0_1] | ~ [4<=p1_1]] | ~ [1<=p0_3]]] | [[~ [[1<=p2_2 | [p0_1<=5 & 2<=p2_1]]] & [~ [5<=p0_3] | [[p0_1<=4 | 1<=p1_2] | [5<=p2_1 | p1_2<=p1_3]]]] | [[~ [[3<=p1_2 & p0_3<=p2_3]] & [p2_3<=0 | p0_3<=3]] & [[p0_1<=p1_2 | [p0_1<=1 & 1<=p1_2]] & [[p2_3<=2 & 3<=p0_1] & ~ [p1_1<=2]]]]]] & [[[[~ [[3<=p0_1 & p2_1<=p0_1]] & [~ [p1_3<=p0_1] & [1<=p1_3 & p1_3<=0]]] | [[p2_2<=2 & [2<=p0_1 & 5<=p1_3]] & [p1_3<=5 & [3<=p0_2 & p1_1<=p2_3]]]] | [p0_2<=p1_1 | [~ [1<=p0_2] | [p2_2<=5 | [5<=p0_2 | 5<=p1_2]]]]] & [p1_2<=p2_3 | [~ [[[p0_2<=p1_3 & p2_3<=3] | [p2_2<=4 | p0_3<=5]]] | ~ [[p0_3<=p1_1 & p2_2<=4]]]]]] | [[[[[p1_1<=2 | [~ [5<=p2_1] & [1<=p2_1 | p2_1<=4]]] & ~ [[p2_3<=2 & p2_3<=p2_2]]] & [3<=p1_1 | p0_3<=3]] & [[[p1_3<=2 | [p1_3<=p2_2 & [p0_2<=p2_3 | p2_3<=p2_3]]] | [[p2_1<=p1_2 & [p1_3<=p1_2 & p1_1<=p2_3]] & [[1<=p0_1 & p1_3<=3] | ~ [p1_1<=5]]]] & [[[2<=p0_2 | [p1_1<=p2_1 | p1_1<=p2_1]] | [p0_3<=p1_2 & ~ [p2_1<=p0_3]]] & ~ [p0_2<=2]]]] | [[[p1_1<=3 | [~ [[p2_2<=4 & 5<=p1_2]] | ~ [[p0_3<=p2_1 & p1_3<=p2_2]]]] | ~ [[[[4<=p2_3 & p0_3<=1] | [p2_2<=p2_2 & p2_2<=2]] & ~ [[p0_1<=p0_1 | p2_3<=p0_2]]]]] | [p1_2<=3 | 2<=p2_2]]]] | ~ [[~ [p2_3<=5] | [[4<=p2_2 | [[[[p0_1<=p2_2 & 5<=p1_2] | [p2_3<=p2_1 & 3<=p0_1]] & [p0_2<=3 | ~ [1<=p0_3]]] | [[p2_3<=3 | ~ [4<=p0_3]] | [p1_1<=2 | [p0_1<=p1_3 | p1_1<=p2_2]]]]] | [[5<=p0_2 & [[~ [p0_1<=0] | [p1_3<=5 & p1_1<=1]] & [[2<=p1_2 | p2_1<=p2_2] | [p0_3<=p0_1 | 2<=p0_1]]]] & ~ [p2_2<=p1_2]]]]]]]]]

abstracting: (p2_2<=p1_2)
states: 5,160 (3)
abstracting: (2<=p0_1)
states: 5,292 (3)
abstracting: (p0_3<=p0_1)
states: 4,710 (3)
abstracting: (p2_1<=p2_2)
states: 4,710 (3)
abstracting: (2<=p1_2)
states: 5,132 (3)
abstracting: (p1_1<=1)
states: 3,352 (3)
abstracting: (p1_3<=5)
states: 6,935 (3)
abstracting: (p0_1<=0)
states: 1,872 (3)
abstracting: (5<=p0_2)
states: 2,184 (3)
abstracting: (p1_1<=p2_2)
states: 4,833 (3)
abstracting: (p0_1<=p1_3)
states: 4,666 (3)
abstracting: (p1_1<=2)
states: 4,690 (3)
abstracting: (4<=p0_3)
states: 3,060 (3)
abstracting: (p2_3<=3)
states: 5,424 (3)
abstracting: (1<=p0_3)
states: 6,612 (3)
abstracting: (p0_2<=3)
states: 5,424 (3)
abstracting: (3<=p0_1)
states: 3,936 (3)
abstracting: (p2_3<=p2_1)
states: 4,710 (3)
abstracting: (5<=p1_2)
states: 2,074 (3)
abstracting: (p0_1<=p2_2)
states: 4,710 (3)
abstracting: (4<=p2_2)
states: 3,060 (3)
abstracting: (p2_3<=5)
states: 6,832 (3)
abstracting: (2<=p2_2)
states: 5,292 (3)
abstracting: (p1_2<=3)
states: 5,558 (3)
abstracting: (p2_3<=p0_2)
states: 4,710 (3)
abstracting: (p0_1<=p0_1)
states: 8,484 (3)
abstracting: (p2_2<=2)
states: 4,548 (3)
abstracting: (p2_2<=p2_2)
states: 8,484 (3)
abstracting: (p0_3<=1)
states: 3,192 (3)
abstracting: (4<=p2_3)
states: 3,060 (3)
abstracting: (p1_3<=p2_2)
states: 4,833 (3)
abstracting: (p0_3<=p2_1)
states: 4,710 (3)
abstracting: (5<=p1_2)
states: 2,074 (3)
abstracting: (p2_2<=4)
states: 6,300 (3)
abstracting: (p1_1<=3)
states: 5,558 (3)
abstracting: (p0_2<=2)
states: 4,548 (3)
abstracting: (p2_1<=p0_3)
states: 4,710 (3)
abstracting: (p0_3<=p1_2)
states: 4,666 (3)
abstracting: (p1_1<=p2_1)
states: 5,320 (3)
abstracting: (p1_1<=p2_1)
states: 5,320 (3)
abstracting: (2<=p0_2)
states: 5,292 (3)
abstracting: (p1_1<=5)
states: 6,935 (3)
abstracting: (p1_3<=3)
states: 5,558 (3)
abstracting: (1<=p0_1)
states: 6,612 (3)
abstracting: (p1_1<=p2_3)
states: 4,833 (3)
abstracting: (p1_3<=p1_2)
states: 4,758 (3)
abstracting: (p2_1<=p1_2)
states: 4,666 (3)
abstracting: (p2_3<=p2_3)
states: 8,484 (3)
abstracting: (p0_2<=p2_3)
states: 4,710 (3)
abstracting: (p1_3<=p2_2)
states: 4,833 (3)
abstracting: (p1_3<=2)
states: 4,690 (3)
abstracting: (p0_3<=3)
states: 5,424 (3)
abstracting: (3<=p1_1)
states: 3,794 (3)
abstracting: (p2_3<=p2_2)
states: 4,710 (3)
abstracting: (p2_3<=2)
states: 4,548 (3)
abstracting: (p2_1<=4)
states: 6,300 (3)
abstracting: (1<=p2_1)
states: 6,612 (3)
abstracting: (5<=p2_1)
states: 2,184 (3)
abstracting: (p1_1<=2)
states: 4,690 (3)
abstracting: (p2_2<=4)
states: 6,300 (3)
abstracting: (p0_3<=p1_1)
states: 4,666 (3)
abstracting: (p0_3<=5)
states: 6,832 (3)
abstracting: (p2_2<=4)
states: 6,300 (3)
abstracting: (p2_3<=3)
states: 5,424 (3)
abstracting: (p0_2<=p1_3)
states: 4,666 (3)
abstracting: (p1_2<=p2_3)
states: 4,833 (3)
abstracting: (5<=p1_2)
states: 2,074 (3)
abstracting: (5<=p0_2)
states: 2,184 (3)
abstracting: (p2_2<=5)
states: 6,832 (3)
abstracting: (1<=p0_2)
states: 6,612 (3)
abstracting: (p0_2<=p1_1)
states: 4,666 (3)
abstracting: (p1_1<=p2_3)
states: 4,833 (3)
abstracting: (3<=p0_2)
states: 3,936 (3)
abstracting: (p1_3<=5)
states: 6,935 (3)
abstracting: (5<=p1_3)
states: 2,074 (3)
abstracting: (2<=p0_1)
states: 5,292 (3)
abstracting: (p2_2<=2)
states: 4,548 (3)
abstracting: (p1_3<=0)
states: 1,996 (3)
abstracting: (1<=p1_3)
states: 6,488 (3)
abstracting: (p1_3<=p0_1)
states: 4,833 (3)
abstracting: (p2_1<=p0_1)
states: 8,484 (3)
abstracting: (3<=p0_1)
states: 3,936 (3)
abstracting: (p1_1<=2)
states: 4,690 (3)
abstracting: (3<=p0_1)
states: 3,936 (3)
abstracting: (p2_3<=2)
states: 4,548 (3)
abstracting: (1<=p1_2)
states: 6,488 (3)
abstracting: (p0_1<=1)
states: 3,192 (3)
abstracting: (p0_1<=p1_2)
states: 4,666 (3)
abstracting: (p0_3<=3)
states: 5,424 (3)
abstracting: (p2_3<=0)
states: 1,872 (3)
abstracting: (p0_3<=p2_3)
states: 8,484 (3)
abstracting: (3<=p1_2)
states: 3,794 (3)
abstracting: (p1_2<=p1_3)
states: 4,758 (3)
abstracting: (5<=p2_1)
states: 2,184 (3)
abstracting: (1<=p1_2)
states: 6,488 (3)
abstracting: (p0_1<=4)
states: 6,300 (3)
abstracting: (5<=p0_3)
states: 2,184 (3)
abstracting: (2<=p2_1)
states: 5,292 (3)
abstracting: (p0_1<=5)
states: 6,832 (3)
abstracting: (1<=p2_2)
states: 6,612 (3)
abstracting: (1<=p0_3)
states: 6,612 (3)
abstracting: (4<=p1_1)
states: 2,926 (3)
abstracting: (5<=p0_1)
states: 2,184 (3)
abstracting: (p2_2<=3)
states: 5,424 (3)
abstracting: (p0_2<=0)
states: 1,872 (3)
abstracting: (p1_3<=p2_3)
states: 5,320 (3)
abstracting: (2<=p0_3)
states: 5,292 (3)
-> the formula is TRUE

FORMULA PGCD-PT-D02N005-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

totally nodes used: 43664 (4.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 142895 56242 199137
used/not used/entry size/cache size: 67781 67041083 16 1024MB
basic ops cache: hits/miss/sum: 154762 102618 257380
used/not used/entry size/cache size: 183111 16594105 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: 20321 7892 28213
used/not used/entry size/cache size: 7892 8380716 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 67072634
1 33492
2 1550
3 517
4 256
5 133
6 54
7 51
8 24
9 22
>= 10 131

Total processing time: 0m 4.641sec


BK_STOP 1679896347809

--------------------
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.002sec


iterations count:486 (54), effective:159 (17)

initing FirstDep: 0m 0.000sec


iterations count:57 (6), effective:16 (1)

iterations count:68 (7), effective:22 (2)

iterations count:40 (4), effective:20 (2)

iterations count:60 (6), effective:21 (2)

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

iterations count:188 (20), effective:71 (7)

iterations count:347 (38), effective:107 (11)

iterations count:58 (6), effective:17 (1)

iterations count:179 (19), effective:55 (6)

iterations count:251 (27), effective:84 (9)

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="PGCD-PT-D02N005"
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 PGCD-PT-D02N005, 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 r513-tall-167987241100438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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