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.r481-tall-167912692300713.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 TriangularGrid-PT-1500, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692300713
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 01:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 01:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 01:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 01:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 9.7K 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 TriangularGrid-PT-1500-CTLCardinality-00
FORMULA_NAME TriangularGrid-PT-1500-CTLCardinality-01
FORMULA_NAME TriangularGrid-PT-1500-CTLCardinality-02
FORMULA_NAME TriangularGrid-PT-1500-CTLCardinality-03
FORMULA_NAME TriangularGrid-PT-1500-CTLCardinality-04
FORMULA_NAME TriangularGrid-PT-1500-CTLCardinality-05
FORMULA_NAME TriangularGrid-PT-1500-CTLCardinality-06
FORMULA_NAME TriangularGrid-PT-1500-CTLCardinality-07
FORMULA_NAME TriangularGrid-PT-1500-CTLCardinality-08
FORMULA_NAME TriangularGrid-PT-1500-CTLCardinality-09
FORMULA_NAME TriangularGrid-PT-1500-CTLCardinality-10
FORMULA_NAME TriangularGrid-PT-1500-CTLCardinality-11
FORMULA_NAME TriangularGrid-PT-1500-CTLCardinality-12
FORMULA_NAME TriangularGrid-PT-1500-CTLCardinality-13
FORMULA_NAME TriangularGrid-PT-1500-CTLCardinality-14
FORMULA_NAME TriangularGrid-PT-1500-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679864090598

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=TriangularGrid-PT-1500
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: TriangularGrid_PT_1500
(NrP: 16 NrTr: 12 NrArc: 48)

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

net check time: 0m 0.000sec

init dd package: 0m 2.856sec


RS generation: 0m 1.261sec


-> reachability set: #nodes 1551 (1.6e+03) #states 705,712 (5)



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

checking: ~ [AX [[14<=pil3_1_1 | EF [AG [[10<=pil1_1_1 & 1<=pi2_1_1]]]]]]
normalized: EX [~ [[E [true U ~ [E [true U ~ [[10<=pil1_1_1 & 1<=pi2_1_1]]]]] | 14<=pil3_1_1]]]

abstracting: (14<=pil3_1_1)
states: 0
abstracting: (1<=pi2_1_1)
states: 350,480 (5)
abstracting: (10<=pil1_1_1)
states: 0
.-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.071sec

checking: AG [A [pi2_1_1<=43 U ~ [[EG [31<=po2_1_1] & pbl_1_1<=pbl_1_1]]]]
normalized: ~ [E [true U ~ [[~ [E [[EG [31<=po2_1_1] & pbl_1_1<=pbl_1_1] U [[EG [31<=po2_1_1] & pbl_1_1<=pbl_1_1] & ~ [pi2_1_1<=43]]]] & ~ [EG [[EG [31<=po2_1_1] & pbl_1_1<=pbl_1_1]]]]]]]

abstracting: (pbl_1_1<=pbl_1_1)
states: 705,712 (5)
abstracting: (31<=po2_1_1)
states: 0
.
EG iterations: 1
.
EG iterations: 1
abstracting: (pi2_1_1<=43)
states: 705,712 (5)
abstracting: (pbl_1_1<=pbl_1_1)
states: 705,712 (5)
abstracting: (31<=po2_1_1)
states: 0
.
EG iterations: 1
abstracting: (pbl_1_1<=pbl_1_1)
states: 705,712 (5)
abstracting: (31<=po2_1_1)
states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [pi3_1_1<=1 U [~ [EX [EF [A [pol1_1_1<=pil1_1_1 U 28<=pol2_1_1]]]] & AX [pil1_1_1<=13]]]
normalized: E [pi3_1_1<=1 U [~ [EX [~ [pil1_1_1<=13]]] & ~ [EX [E [true U [~ [EG [~ [28<=pol2_1_1]]] & ~ [E [~ [28<=pol2_1_1] U [~ [pol1_1_1<=pil1_1_1] & ~ [28<=pol2_1_1]]]]]]]]]]

abstracting: (28<=pol2_1_1)
states: 0
abstracting: (pol1_1_1<=pil1_1_1)
states: 529,288 (5)
abstracting: (28<=pol2_1_1)
states: 0
abstracting: (28<=pol2_1_1)
states: 0

EG iterations: 0
.abstracting: (pil1_1_1<=13)
states: 705,712 (5)
.abstracting: (pi3_1_1<=1)
states: 705,712 (5)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.056sec

checking: EF [[[EX [AG [42<=pi2_1_1]] & [35<=pil1_1_1 & E [EF [3<=po3_1_1] U ~ [pb2_1_1<=32]]]] & [A [48<=pbl_1_1 U ~ [pb3_1_1<=39]] & ~ [pol3_1_1<=po3_1_1]]]]
normalized: E [true U [[~ [pol3_1_1<=po3_1_1] & [~ [EG [pb3_1_1<=39]] & ~ [E [pb3_1_1<=39 U [~ [48<=pbl_1_1] & pb3_1_1<=39]]]]] & [[E [E [true U 3<=po3_1_1] U ~ [pb2_1_1<=32]] & 35<=pil1_1_1] & EX [~ [E [true U ~ [42<=pi2_1_1]]]]]]]

abstracting: (42<=pi2_1_1)
states: 0
.abstracting: (35<=pil1_1_1)
states: 0
abstracting: (pb2_1_1<=32)
states: 278,784 (5)
abstracting: (3<=po3_1_1)
states: 0
abstracting: (pb3_1_1<=39)
states: 328,960 (5)
abstracting: (48<=pbl_1_1)
states: 0
abstracting: (pb3_1_1<=39)
states: 328,960 (5)
abstracting: (pb3_1_1<=39)
states: 328,960 (5)
.
EG iterations: 1
abstracting: (pol3_1_1<=po3_1_1)
states: 350,480 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.070sec

checking: EF [[[pb2_1_1<=37 | AG [AX [EG [40<=pi1_1_1]]]] | [~ [E [pi1_1_1<=35 U EF [pol2_1_1<=31]]] & [3<=pb2_1_1 | EX [[EG [pil3_1_1<=po3_1_1] | AF [pi1_1_1<=34]]]]]]]
normalized: E [true U [[[EX [[~ [EG [~ [pi1_1_1<=34]]] | EG [pil3_1_1<=po3_1_1]]] | 3<=pb2_1_1] & ~ [E [pi1_1_1<=35 U E [true U pol2_1_1<=31]]]] | [~ [E [true U EX [~ [EG [40<=pi1_1_1]]]]] | pb2_1_1<=37]]]

abstracting: (pb2_1_1<=37)
states: 314,944 (5)
abstracting: (40<=pi1_1_1)
states: 0
.
EG iterations: 1
.abstracting: (pol2_1_1<=31)
states: 705,712 (5)
abstracting: (pi1_1_1<=35)
states: 705,712 (5)
abstracting: (3<=pb2_1_1)
states: 677,488 (5)
abstracting: (pil3_1_1<=po3_1_1)
states: 526,904 (5)
.
EG iterations: 1
abstracting: (pi1_1_1<=34)
states: 705,712 (5)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.124sec

checking: EG [AG [[AX [[[11<=po3_1_1 & pb1_1_1<=0] | [pi2_1_1<=pil3_1_1 | 8<=pb1_1_1]]] & ~ [A [~ [pb1_1_1<=pi2_1_1] U E [43<=pol2_1_1 U 14<=pi1_1_1]]]]]]
normalized: EG [~ [E [true U ~ [[~ [EX [~ [[[pi2_1_1<=pil3_1_1 | 8<=pb1_1_1] | [11<=po3_1_1 & pb1_1_1<=0]]]]] & ~ [[~ [EG [~ [E [43<=pol2_1_1 U 14<=pi1_1_1]]]] & ~ [E [~ [E [43<=pol2_1_1 U 14<=pi1_1_1]] U [~ [E [43<=pol2_1_1 U 14<=pi1_1_1]] & pb1_1_1<=pi2_1_1]]]]]]]]]]

abstracting: (pb1_1_1<=pi2_1_1)
states: 14,160 (4)
abstracting: (14<=pi1_1_1)
states: 0
abstracting: (43<=pol2_1_1)
states: 0
abstracting: (14<=pi1_1_1)
states: 0
abstracting: (43<=pol2_1_1)
states: 0
abstracting: (14<=pi1_1_1)
states: 0
abstracting: (43<=pol2_1_1)
states: 0

EG iterations: 0
abstracting: (pb1_1_1<=0)
states: 9,472 (3)
abstracting: (11<=po3_1_1)
states: 0
abstracting: (8<=pb1_1_1)
states: 631,728 (5)
abstracting: (pi2_1_1<=pil3_1_1)
states: 531,656 (5)
..
EG iterations: 1
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.163sec

checking: AG [~ [[po1_1_1<=pol3_1_1 & [~ [E [[pil2_1_1<=pb1_1_1 | 30<=pol3_1_1] U [pb3_1_1<=9 & 23<=pi2_1_1]]] | AX [~ [pil3_1_1<=pb3_1_1]]]]]]
normalized: ~ [E [true U [po1_1_1<=pol3_1_1 & [~ [EX [pil3_1_1<=pb3_1_1]] | ~ [E [[pil2_1_1<=pb1_1_1 | 30<=pol3_1_1] U [pb3_1_1<=9 & 23<=pi2_1_1]]]]]]]

abstracting: (23<=pi2_1_1)
states: 0
abstracting: (pb3_1_1<=9)
states: 91,840 (4)
abstracting: (30<=pol3_1_1)
states: 0
abstracting: (pil2_1_1<=pb1_1_1)
states: 700,960 (5)
abstracting: (pil3_1_1<=pb3_1_1)
states: 700,960 (5)
.abstracting: (po1_1_1<=pol3_1_1)
states: 531,656 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.093sec

checking: E [~ [AX [[E [pbl_1_1<=pb1_1_1 U 24<=pol1_1_1] | AG [pol3_1_1<=pol3_1_1]]]] U EF [E [pol2_1_1<=pil1_1_1 U [[2<=pi2_1_1 & [13<=pb1_1_1 & 5<=po3_1_1]] | ~ [16<=pb2_1_1]]]]]
normalized: E [EX [~ [[~ [E [true U ~ [pol3_1_1<=pol3_1_1]]] | E [pbl_1_1<=pb1_1_1 U 24<=pol1_1_1]]]] U E [true U E [pol2_1_1<=pil1_1_1 U [~ [16<=pb2_1_1] | [2<=pi2_1_1 & [13<=pb1_1_1 & 5<=po3_1_1]]]]]]

abstracting: (5<=po3_1_1)
states: 0
abstracting: (13<=pb1_1_1)
states: 587,568 (5)
abstracting: (2<=pi2_1_1)
states: 0
abstracting: (16<=pb2_1_1)
states: 561,840 (5)
abstracting: (pol2_1_1<=pil1_1_1)
states: 529,288 (5)
abstracting: (24<=pol1_1_1)
states: 0
abstracting: (pbl_1_1<=pb1_1_1)
states: 677,632 (5)
abstracting: (pol3_1_1<=pol3_1_1)
states: 705,712 (5)
.-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.449sec

checking: E [A [[pbl_1_1<=pi1_1_1 | AX [A [pi3_1_1<=7 U pb3_1_1<=37]]] U [[AX [47<=pi1_1_1] | pb1_1_1<=pil2_1_1] | pb3_1_1<=50]] U [[pi3_1_1<=12 | pb1_1_1<=9] & ~ [AX [pi2_1_1<=26]]]]
normalized: E [[~ [EG [~ [[pb3_1_1<=50 | [pb1_1_1<=pil2_1_1 | ~ [EX [~ [47<=pi1_1_1]]]]]]]] & ~ [E [~ [[pb3_1_1<=50 | [pb1_1_1<=pil2_1_1 | ~ [EX [~ [47<=pi1_1_1]]]]]] U [~ [[pbl_1_1<=pi1_1_1 | ~ [EX [~ [[~ [EG [~ [pb3_1_1<=37]]] & ~ [E [~ [pb3_1_1<=37] U [~ [pi3_1_1<=7] & ~ [pb3_1_1<=37]]]]]]]]]] & ~ [[pb3_1_1<=50 | [pb1_1_1<=pil2_1_1 | ~ [EX [~ [47<=pi1_1_1]]]]]]]]]] U [EX [~ [pi2_1_1<=26]] & [pi3_1_1<=12 | pb1_1_1<=9]]]

abstracting: (pb1_1_1<=9)
states: 91,840 (4)
abstracting: (pi3_1_1<=12)
states: 705,712 (5)
abstracting: (pi2_1_1<=26)
states: 705,712 (5)
.abstracting: (47<=pi1_1_1)
states: 0
.abstracting: (pb1_1_1<=pil2_1_1)
states: 14,192 (4)
abstracting: (pb3_1_1<=50)
states: 401,472 (5)
abstracting: (pb3_1_1<=37)
states: 314,944 (5)
abstracting: (pi3_1_1<=7)
states: 705,712 (5)
abstracting: (pb3_1_1<=37)
states: 314,944 (5)
abstracting: (pb3_1_1<=37)
states: 314,944 (5)
.
EG iterations: 1
.abstracting: (pbl_1_1<=pi1_1_1)
states: 22,801 (4)
abstracting: (47<=pi1_1_1)
states: 0
.abstracting: (pb1_1_1<=pil2_1_1)
states: 14,192 (4)
abstracting: (pb3_1_1<=50)
states: 401,472 (5)
abstracting: (47<=pi1_1_1)
states: 0
.abstracting: (pb1_1_1<=pil2_1_1)
states: 14,192 (4)
abstracting: (pb3_1_1<=50)
states: 401,472 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.148sec

checking: A [[~ [35<=pol2_1_1] | [EG [pb3_1_1<=pi3_1_1] | EF [[3<=pol2_1_1 & po3_1_1<=pi2_1_1]]]] U [po1_1_1<=45 & EF [~ [[EF [pil3_1_1<=pb2_1_1] | E [pol1_1_1<=30 U pil2_1_1<=pbl_1_1]]]]]]
normalized: [~ [EG [~ [[po1_1_1<=45 & E [true U ~ [[E [pol1_1_1<=30 U pil2_1_1<=pbl_1_1] | E [true U pil3_1_1<=pb2_1_1]]]]]]]] & ~ [E [~ [[po1_1_1<=45 & E [true U ~ [[E [pol1_1_1<=30 U pil2_1_1<=pbl_1_1] | E [true U pil3_1_1<=pb2_1_1]]]]]] U [~ [[[E [true U [3<=pol2_1_1 & po3_1_1<=pi2_1_1]] | EG [pb3_1_1<=pi3_1_1]] | ~ [35<=pol2_1_1]]] & ~ [[po1_1_1<=45 & E [true U ~ [[E [pol1_1_1<=30 U pil2_1_1<=pbl_1_1] | E [true U pil3_1_1<=pb2_1_1]]]]]]]]]]

abstracting: (pil3_1_1<=pb2_1_1)
states: 700,960 (5)
abstracting: (pil2_1_1<=pbl_1_1)
states: 694,236 (5)
abstracting: (pol1_1_1<=30)
states: 705,712 (5)
abstracting: (po1_1_1<=45)
states: 705,712 (5)
abstracting: (35<=pol2_1_1)
states: 0
abstracting: (pb3_1_1<=pi3_1_1)
states: 14,160 (4)
.
EG iterations: 1
abstracting: (po3_1_1<=pi2_1_1)
states: 529,288 (5)
abstracting: (3<=pol2_1_1)
states: 0
abstracting: (pil3_1_1<=pb2_1_1)
states: 700,960 (5)
abstracting: (pil2_1_1<=pbl_1_1)
states: 694,236 (5)
abstracting: (pol1_1_1<=30)
states: 705,712 (5)
abstracting: (po1_1_1<=45)
states: 705,712 (5)
abstracting: (pil3_1_1<=pb2_1_1)
states: 700,960 (5)
abstracting: (pil2_1_1<=pbl_1_1)
states: 694,236 (5)
abstracting: (pol1_1_1<=30)
states: 705,712 (5)
abstracting: (po1_1_1<=45)
states: 705,712 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.083sec

checking: EF [E [[~ [pi3_1_1<=pi2_1_1] | [AG [[25<=po3_1_1 & pil2_1_1<=40]] | [[AX [po3_1_1<=pil1_1_1] & A [17<=pol3_1_1 U pol3_1_1<=pol3_1_1]] & pi2_1_1<=pil3_1_1]]] U ~ [EX [[~ [pi3_1_1<=pol3_1_1] | ~ [pbl_1_1<=pi1_1_1]]]]]]
normalized: E [true U E [[[[pi2_1_1<=pil3_1_1 & [[~ [EG [~ [pol3_1_1<=pol3_1_1]]] & ~ [E [~ [pol3_1_1<=pol3_1_1] U [~ [pol3_1_1<=pol3_1_1] & ~ [17<=pol3_1_1]]]]] & ~ [EX [~ [po3_1_1<=pil1_1_1]]]]] | ~ [E [true U ~ [[25<=po3_1_1 & pil2_1_1<=40]]]]] | ~ [pi3_1_1<=pi2_1_1]] U ~ [EX [[~ [pi3_1_1<=pol3_1_1] | ~ [pbl_1_1<=pi1_1_1]]]]]]

abstracting: (pbl_1_1<=pi1_1_1)
states: 22,801 (4)
abstracting: (pi3_1_1<=pol3_1_1)
states: 531,656 (5)
.abstracting: (pi3_1_1<=pi2_1_1)
states: 529,288 (5)
abstracting: (pil2_1_1<=40)
states: 705,712 (5)
abstracting: (25<=po3_1_1)
states: 0
abstracting: (po3_1_1<=pil1_1_1)
states: 531,656 (5)
.abstracting: (17<=pol3_1_1)
states: 0
abstracting: (pol3_1_1<=pol3_1_1)
states: 705,712 (5)
abstracting: (pol3_1_1<=pol3_1_1)
states: 705,712 (5)
abstracting: (pol3_1_1<=pol3_1_1)
states: 705,712 (5)
.
EG iterations: 1
abstracting: (pi2_1_1<=pil3_1_1)
states: 531,656 (5)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.559sec

checking: E [AG [AF [~ [[[46<=po2_1_1 | 22<=pil3_1_1] | [15<=pb1_1_1 | pol3_1_1<=po2_1_1]]]]] U [AF [E [[[12<=pbl_1_1 & pbl_1_1<=pol3_1_1] & po2_1_1<=po1_1_1] U E [po1_1_1<=27 U pb1_1_1<=pi3_1_1]]] & EX [AG [E [pbl_1_1<=pi1_1_1 U pi2_1_1<=9]]]]]
normalized: E [~ [E [true U EG [[[15<=pb1_1_1 | pol3_1_1<=po2_1_1] | [46<=po2_1_1 | 22<=pil3_1_1]]]]] U [~ [EG [~ [E [[po2_1_1<=po1_1_1 & [12<=pbl_1_1 & pbl_1_1<=pol3_1_1]] U E [po1_1_1<=27 U pb1_1_1<=pi3_1_1]]]]] & EX [~ [E [true U ~ [E [pbl_1_1<=pi1_1_1 U pi2_1_1<=9]]]]]]]

abstracting: (pi2_1_1<=9)
states: 705,712 (5)
abstracting: (pbl_1_1<=pi1_1_1)
states: 22,801 (4)
.abstracting: (pb1_1_1<=pi3_1_1)
states: 14,160 (4)
abstracting: (po1_1_1<=27)
states: 705,712 (5)
abstracting: (pbl_1_1<=pol3_1_1)
states: 68,101 (4)
abstracting: (12<=pbl_1_1)
states: 0
abstracting: (po2_1_1<=po1_1_1)
states: 529,288 (5)
.
EG iterations: 1
abstracting: (22<=pil3_1_1)
states: 0
abstracting: (46<=po2_1_1)
states: 0
abstracting: (pol3_1_1<=po2_1_1)
states: 526,904 (5)
abstracting: (15<=pb1_1_1)
states: 570,352 (5)
..
EG iterations: 2
-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.060sec

checking: AG [[[po2_1_1<=18 | [[[[AX [pbl_1_1<=9] & ~ [pb3_1_1<=13]] | EX [pi2_1_1<=3]] & [[pil2_1_1<=29 | [15<=pi1_1_1 | pb2_1_1<=po2_1_1]] & 42<=pb2_1_1]] & [[~ [[pol3_1_1<=44 | pol2_1_1<=4]] & [AX [pol1_1_1<=33] & [pil3_1_1<=pil1_1_1 & pil1_1_1<=45]]] | po3_1_1<=44]]] | EX [AF [AF [pol2_1_1<=0]]]]]
normalized: ~ [E [true U ~ [[EX [~ [EG [EG [~ [pol2_1_1<=0]]]]] | [po2_1_1<=18 | [[po3_1_1<=44 | [[[pil3_1_1<=pil1_1_1 & pil1_1_1<=45] & ~ [EX [~ [pol1_1_1<=33]]]] & ~ [[pol3_1_1<=44 | pol2_1_1<=4]]]] & [[42<=pb2_1_1 & [pil2_1_1<=29 | [15<=pi1_1_1 | pb2_1_1<=po2_1_1]]] & [EX [pi2_1_1<=3] | [~ [pb3_1_1<=13] & ~ [EX [~ [pbl_1_1<=9]]]]]]]]]]]]

abstracting: (pbl_1_1<=9)
states: 705,712 (5)
.abstracting: (pb3_1_1<=13)
states: 126,784 (5)
abstracting: (pi2_1_1<=3)
states: 705,712 (5)
.abstracting: (pb2_1_1<=po2_1_1)
states: 14,160 (4)
abstracting: (15<=pi1_1_1)
states: 0
abstracting: (pil2_1_1<=29)
states: 705,712 (5)
abstracting: (42<=pb2_1_1)
states: 362,992 (5)
abstracting: (pol2_1_1<=4)
states: 705,712 (5)
abstracting: (pol3_1_1<=44)
states: 705,712 (5)
abstracting: (pol1_1_1<=33)
states: 705,712 (5)
.abstracting: (pil1_1_1<=45)
states: 705,712 (5)
abstracting: (pil3_1_1<=pil1_1_1)
states: 529,288 (5)
abstracting: (po3_1_1<=44)
states: 705,712 (5)
abstracting: (po2_1_1<=18)
states: 705,712 (5)
abstracting: (pol2_1_1<=0)
states: 350,480 (5)
..
EG iterations: 2
.
EG iterations: 1
.-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.091sec

checking: AX [[[[[[AF [22<=pil1_1_1] & pol1_1_1<=pb3_1_1] & EX [~ [1<=pi3_1_1]]] & pb1_1_1<=pb3_1_1] | [[~ [E [pb1_1_1<=6 U 46<=pol3_1_1]] | ~ [[~ [po3_1_1<=4] | [pi1_1_1<=49 & 30<=pi1_1_1]]]] & ~ [po2_1_1<=8]]] | E [EX [[[45<=pol1_1_1 | pil2_1_1<=pb3_1_1] | [pb1_1_1<=pil2_1_1 | po1_1_1<=20]]] U EX [~ [EF [39<=po1_1_1]]]]]]
normalized: ~ [EX [~ [[E [EX [[[pb1_1_1<=pil2_1_1 | po1_1_1<=20] | [45<=pol1_1_1 | pil2_1_1<=pb3_1_1]]] U EX [~ [E [true U 39<=po1_1_1]]]] | [[~ [po2_1_1<=8] & [~ [[[pi1_1_1<=49 & 30<=pi1_1_1] | ~ [po3_1_1<=4]]] | ~ [E [pb1_1_1<=6 U 46<=pol3_1_1]]]] | [pb1_1_1<=pb3_1_1 & [EX [~ [1<=pi3_1_1]] & [pol1_1_1<=pb3_1_1 & ~ [EG [~ [22<=pil1_1_1]]]]]]]]]]]

abstracting: (22<=pil1_1_1)
states: 0

EG iterations: 0
abstracting: (pol1_1_1<=pb3_1_1)
states: 700,960 (5)
abstracting: (1<=pi3_1_1)
states: 350,480 (5)
.abstracting: (pb1_1_1<=pb3_1_1)
states: 355,232 (5)
abstracting: (46<=pol3_1_1)
states: 0
abstracting: (pb1_1_1<=6)
states: 64,960 (4)
abstracting: (po3_1_1<=4)
states: 705,712 (5)
abstracting: (30<=pi1_1_1)
states: 0
abstracting: (pi1_1_1<=49)
states: 705,712 (5)
abstracting: (po2_1_1<=8)
states: 705,712 (5)
abstracting: (39<=po1_1_1)
states: 0
.abstracting: (pil2_1_1<=pb3_1_1)
states: 700,960 (5)
abstracting: (45<=pol1_1_1)
states: 0
abstracting: (po1_1_1<=20)
states: 705,712 (5)
abstracting: (pb1_1_1<=pil2_1_1)
states: 14,192 (4)
..-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.084sec

checking: [A [A [E [[~ [28<=po3_1_1] | [34<=pbl_1_1 | pb2_1_1<=pil3_1_1]] U [pil1_1_1<=43 & [pol1_1_1<=8 & po2_1_1<=35]]] U [~ [E [1<=pi2_1_1 U pil1_1_1<=pil3_1_1]] & EF [~ [pb2_1_1<=7]]]] U [[po3_1_1<=38 & [[[pi1_1_1<=pb1_1_1 & [45<=pbl_1_1 | 35<=pb1_1_1]] & ~ [pi2_1_1<=pil3_1_1]] | EF [[pil1_1_1<=pb2_1_1 | pb2_1_1<=pi2_1_1]]]] | EX [EF [EG [pil2_1_1<=pi1_1_1]]]]] & AX [EG [[~ [[~ [33<=pb2_1_1] | pil2_1_1<=pi1_1_1]] & [[[pil3_1_1<=40 & pi3_1_1<=pi2_1_1] | [pi1_1_1<=41 | 40<=pb2_1_1]] | pi3_1_1<=24]]]]]
normalized: [~ [EX [~ [EG [[[pi3_1_1<=24 | [[pi1_1_1<=41 | 40<=pb2_1_1] | [pil3_1_1<=40 & pi3_1_1<=pi2_1_1]]] & ~ [[pil2_1_1<=pi1_1_1 | ~ [33<=pb2_1_1]]]]]]]] & [~ [EG [~ [[EX [E [true U EG [pil2_1_1<=pi1_1_1]]] | [po3_1_1<=38 & [E [true U [pil1_1_1<=pb2_1_1 | pb2_1_1<=pi2_1_1]] | [~ [pi2_1_1<=pil3_1_1] & [pi1_1_1<=pb1_1_1 & [45<=pbl_1_1 | 35<=pb1_1_1]]]]]]]]] & ~ [E [~ [[EX [E [true U EG [pil2_1_1<=pi1_1_1]]] | [po3_1_1<=38 & [E [true U [pil1_1_1<=pb2_1_1 | pb2_1_1<=pi2_1_1]] | [~ [pi2_1_1<=pil3_1_1] & [pi1_1_1<=pb1_1_1 & [45<=pbl_1_1 | 35<=pb1_1_1]]]]]]] U [~ [[~ [EG [~ [[E [true U ~ [pb2_1_1<=7]] & ~ [E [1<=pi2_1_1 U pil1_1_1<=pil3_1_1]]]]]] & ~ [E [~ [[E [true U ~ [pb2_1_1<=7]] & ~ [E [1<=pi2_1_1 U pil1_1_1<=pil3_1_1]]]] U [~ [E [[[34<=pbl_1_1 | pb2_1_1<=pil3_1_1] | ~ [28<=po3_1_1]] U [pil1_1_1<=43 & [pol1_1_1<=8 & po2_1_1<=35]]]] & ~ [[E [true U ~ [pb2_1_1<=7]] & ~ [E [1<=pi2_1_1 U pil1_1_1<=pil3_1_1]]]]]]]]] & ~ [[EX [E [true U EG [pil2_1_1<=pi1_1_1]]] | [po3_1_1<=38 & [E [true U [pil1_1_1<=pb2_1_1 | pb2_1_1<=pi2_1_1]] | [~ [pi2_1_1<=pil3_1_1] & [pi1_1_1<=pb1_1_1 & [45<=pbl_1_1 | 35<=pb1_1_1]]]]]]]]]]]]

abstracting: (35<=pb1_1_1)
states: 412,272 (5)
abstracting: (45<=pbl_1_1)
states: 0
abstracting: (pi1_1_1<=pb1_1_1)
states: 700,992 (5)
abstracting: (pi2_1_1<=pil3_1_1)
states: 531,656 (5)
abstracting: (pb2_1_1<=pi2_1_1)
states: 14,160 (4)
abstracting: (pil1_1_1<=pb2_1_1)
states: 700,960 (5)
abstracting: (po3_1_1<=38)
states: 705,712 (5)
abstracting: (pil2_1_1<=pi1_1_1)
states: 526,904 (5)
...
EG iterations: 3
.abstracting: (pil1_1_1<=pil3_1_1)
states: 529,288 (5)
abstracting: (1<=pi2_1_1)
states: 350,480 (5)
abstracting: (pb2_1_1<=7)
states: 73,984 (4)
abstracting: (po2_1_1<=35)
states: 705,712 (5)
abstracting: (pol1_1_1<=8)
states: 705,712 (5)
abstracting: (pil1_1_1<=43)
states: 705,712 (5)
abstracting: (28<=po3_1_1)
states: 0
abstracting: (pb2_1_1<=pil3_1_1)
states: 14,192 (4)
abstracting: (34<=pbl_1_1)
states: 0
abstracting: (pil1_1_1<=pil3_1_1)
states: 529,288 (5)
abstracting: (1<=pi2_1_1)
states: 350,480 (5)
abstracting: (pb2_1_1<=7)
states: 73,984 (4)
abstracting: (pil1_1_1<=pil3_1_1)
states: 529,288 (5)
abstracting: (1<=pi2_1_1)
states: 350,480 (5)
abstracting: (pb2_1_1<=7)
states: 73,984 (4)
...
EG iterations: 3
abstracting: (35<=pb1_1_1)
states: 412,272 (5)
abstracting: (45<=pbl_1_1)
states: 0
abstracting: (pi1_1_1<=pb1_1_1)
states: 700,992 (5)
abstracting: (pi2_1_1<=pil3_1_1)
states: 531,656 (5)
abstracting: (pb2_1_1<=pi2_1_1)
states: 14,160 (4)
abstracting: (pil1_1_1<=pb2_1_1)
states: 700,960 (5)
abstracting: (po3_1_1<=38)
states: 705,712 (5)
abstracting: (pil2_1_1<=pi1_1_1)
states: 526,904 (5)
...
EG iterations: 3
.abstracting: (35<=pb1_1_1)
states: 412,272 (5)
abstracting: (45<=pbl_1_1)
states: 0
abstracting: (pi1_1_1<=pb1_1_1)
states: 700,992 (5)
abstracting: (pi2_1_1<=pil3_1_1)
states: 531,656 (5)
abstracting: (pb2_1_1<=pi2_1_1)
states: 14,160 (4)
abstracting: (pil1_1_1<=pb2_1_1)
states: 700,960 (5)
abstracting: (po3_1_1<=38)
states: 705,712 (5)
abstracting: (pil2_1_1<=pi1_1_1)
states: 526,904 (5)
...
EG iterations: 3
..
EG iterations: 1
abstracting: (33<=pb2_1_1)
states: 426,928 (5)
abstracting: (pil2_1_1<=pi1_1_1)
states: 526,904 (5)
abstracting: (pi3_1_1<=pi2_1_1)
states: 529,288 (5)
abstracting: (pil3_1_1<=40)
states: 705,712 (5)
abstracting: (40<=pb2_1_1)
states: 376,752 (5)
abstracting: (pi1_1_1<=41)
states: 705,712 (5)
abstracting: (pi3_1_1<=24)
states: 705,712 (5)
...................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 355
.-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.839sec

checking: [A [[EF [50<=po3_1_1] | A [~ [pil2_1_1<=32] U [[[pol2_1_1<=6 & pol2_1_1<=po2_1_1] & EX [31<=pil1_1_1]] | E [45<=po3_1_1 U pi3_1_1<=9]]]] U [A [AX [~ [1<=pil3_1_1]] U ~ [A [34<=pil1_1_1 U pil1_1_1<=pol1_1_1]]] | [~ [[EF [pi2_1_1<=1] & po3_1_1<=21]] | ~ [[~ [11<=pil2_1_1] & ~ [[21<=pol3_1_1 & pb3_1_1<=19]]]]]]] | [[~ [AF [[po2_1_1<=19 & [[pol3_1_1<=pb2_1_1 & pb2_1_1<=11] | [pb3_1_1<=pbl_1_1 | pol2_1_1<=38]]]]] | AG [EX [EF [pil1_1_1<=43]]]] & E [[pb1_1_1<=po2_1_1 & [[[~ [pol1_1_1<=pb1_1_1] & EF [1<=pb2_1_1]] & [AF [11<=pol3_1_1] | A [42<=pil2_1_1 U pol1_1_1<=12]]] | [~ [31<=pi3_1_1] | [36<=po2_1_1 | ~ [pol1_1_1<=pil3_1_1]]]]] U AX [EF [~ [pi1_1_1<=32]]]]]]
normalized: [[E [[pb1_1_1<=po2_1_1 & [[[36<=po2_1_1 | ~ [pol1_1_1<=pil3_1_1]] | ~ [31<=pi3_1_1]] | [[[~ [EG [~ [pol1_1_1<=12]]] & ~ [E [~ [pol1_1_1<=12] U [~ [42<=pil2_1_1] & ~ [pol1_1_1<=12]]]]] | ~ [EG [~ [11<=pol3_1_1]]]] & [E [true U 1<=pb2_1_1] & ~ [pol1_1_1<=pb1_1_1]]]]] U ~ [EX [~ [E [true U ~ [pi1_1_1<=32]]]]]] & [~ [E [true U ~ [EX [E [true U pil1_1_1<=43]]]]] | EG [~ [[po2_1_1<=19 & [[pb3_1_1<=pbl_1_1 | pol2_1_1<=38] | [pol3_1_1<=pb2_1_1 & pb2_1_1<=11]]]]]]] | [~ [EG [~ [[[~ [[~ [[21<=pol3_1_1 & pb3_1_1<=19]] & ~ [11<=pil2_1_1]]] | ~ [[po3_1_1<=21 & E [true U pi2_1_1<=1]]]] | [~ [EG [[~ [EG [~ [pil1_1_1<=pol1_1_1]]] & ~ [E [~ [pil1_1_1<=pol1_1_1] U [~ [34<=pil1_1_1] & ~ [pil1_1_1<=pol1_1_1]]]]]]] & ~ [E [[~ [EG [~ [pil1_1_1<=pol1_1_1]]] & ~ [E [~ [pil1_1_1<=pol1_1_1] U [~ [34<=pil1_1_1] & ~ [pil1_1_1<=pol1_1_1]]]]] U [EX [1<=pil3_1_1] & [~ [EG [~ [pil1_1_1<=pol1_1_1]]] & ~ [E [~ [pil1_1_1<=pol1_1_1] U [~ [34<=pil1_1_1] & ~ [pil1_1_1<=pol1_1_1]]]]]]]]]]]]] & ~ [E [~ [[[~ [[~ [[21<=pol3_1_1 & pb3_1_1<=19]] & ~ [11<=pil2_1_1]]] | ~ [[po3_1_1<=21 & E [true U pi2_1_1<=1]]]] | [~ [EG [[~ [EG [~ [pil1_1_1<=pol1_1_1]]] & ~ [E [~ [pil1_1_1<=pol1_1_1] U [~ [34<=pil1_1_1] & ~ [pil1_1_1<=pol1_1_1]]]]]]] & ~ [E [[~ [EG [~ [pil1_1_1<=pol1_1_1]]] & ~ [E [~ [pil1_1_1<=pol1_1_1] U [~ [34<=pil1_1_1] & ~ [pil1_1_1<=pol1_1_1]]]]] U [EX [1<=pil3_1_1] & [~ [EG [~ [pil1_1_1<=pol1_1_1]]] & ~ [E [~ [pil1_1_1<=pol1_1_1] U [~ [34<=pil1_1_1] & ~ [pil1_1_1<=pol1_1_1]]]]]]]]]]] U [~ [[[~ [EG [~ [[E [45<=po3_1_1 U pi3_1_1<=9] | [EX [31<=pil1_1_1] & [pol2_1_1<=6 & pol2_1_1<=po2_1_1]]]]]] & ~ [E [~ [[E [45<=po3_1_1 U pi3_1_1<=9] | [EX [31<=pil1_1_1] & [pol2_1_1<=6 & pol2_1_1<=po2_1_1]]]] U [pil2_1_1<=32 & ~ [[E [45<=po3_1_1 U pi3_1_1<=9] | [EX [31<=pil1_1_1] & [pol2_1_1<=6 & pol2_1_1<=po2_1_1]]]]]]]] | E [true U 50<=po3_1_1]]] & ~ [[[~ [[~ [[21<=pol3_1_1 & pb3_1_1<=19]] & ~ [11<=pil2_1_1]]] | ~ [[po3_1_1<=21 & E [true U pi2_1_1<=1]]]] | [~ [EG [[~ [EG [~ [pil1_1_1<=pol1_1_1]]] & ~ [E [~ [pil1_1_1<=pol1_1_1] U [~ [34<=pil1_1_1] & ~ [pil1_1_1<=pol1_1_1]]]]]]] & ~ [E [[~ [EG [~ [pil1_1_1<=pol1_1_1]]] & ~ [E [~ [pil1_1_1<=pol1_1_1] U [~ [34<=pil1_1_1] & ~ [pil1_1_1<=pol1_1_1]]]]] U [EX [1<=pil3_1_1] & [~ [EG [~ [pil1_1_1<=pol1_1_1]]] & ~ [E [~ [pil1_1_1<=pol1_1_1] U [~ [34<=pil1_1_1] & ~ [pil1_1_1<=pol1_1_1]]]]]]]]]]]]]]]]

abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (34<=pil1_1_1)
states: 0
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
..
EG iterations: 2
abstracting: (1<=pil3_1_1)
states: 355,232 (5)
.abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (34<=pil1_1_1)
states: 0
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
..
EG iterations: 2
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (34<=pil1_1_1)
states: 0
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
..
EG iterations: 2
..
EG iterations: 2
abstracting: (pi2_1_1<=1)
states: 705,712 (5)
abstracting: (po3_1_1<=21)
states: 705,712 (5)
abstracting: (11<=pil2_1_1)
states: 0
abstracting: (pb3_1_1<=19)
states: 177,280 (5)
abstracting: (21<=pol3_1_1)
states: 0
abstracting: (50<=po3_1_1)
states: 0
abstracting: (pol2_1_1<=po2_1_1)
states: 350,480 (5)
abstracting: (pol2_1_1<=6)
states: 705,712 (5)
abstracting: (31<=pil1_1_1)
states: 0
.abstracting: (pi3_1_1<=9)
states: 705,712 (5)
abstracting: (45<=po3_1_1)
states: 0
abstracting: (pil2_1_1<=32)
states: 705,712 (5)
abstracting: (pol2_1_1<=po2_1_1)
states: 350,480 (5)
abstracting: (pol2_1_1<=6)
states: 705,712 (5)
abstracting: (31<=pil1_1_1)
states: 0
.abstracting: (pi3_1_1<=9)
states: 705,712 (5)
abstracting: (45<=po3_1_1)
states: 0
abstracting: (pol2_1_1<=po2_1_1)
states: 350,480 (5)
abstracting: (pol2_1_1<=6)
states: 705,712 (5)
abstracting: (31<=pil1_1_1)
states: 0
.abstracting: (pi3_1_1<=9)
states: 705,712 (5)
abstracting: (45<=po3_1_1)
states: 0
.
EG iterations: 1
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (34<=pil1_1_1)
states: 0
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
..
EG iterations: 2
abstracting: (1<=pil3_1_1)
states: 355,232 (5)
.abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (34<=pil1_1_1)
states: 0
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
..
EG iterations: 2
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (34<=pil1_1_1)
states: 0
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
..
EG iterations: 2
..
EG iterations: 2
abstracting: (pi2_1_1<=1)
states: 705,712 (5)
abstracting: (po3_1_1<=21)
states: 705,712 (5)
abstracting: (11<=pil2_1_1)
states: 0
abstracting: (pb3_1_1<=19)
states: 177,280 (5)
abstracting: (21<=pol3_1_1)
states: 0
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (34<=pil1_1_1)
states: 0
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
..
EG iterations: 2
abstracting: (1<=pil3_1_1)
states: 355,232 (5)
.abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (34<=pil1_1_1)
states: 0
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
..
EG iterations: 2
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (34<=pil1_1_1)
states: 0
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (pil1_1_1<=pol1_1_1)
states: 529,288 (5)
..
EG iterations: 2
..
EG iterations: 2
abstracting: (pi2_1_1<=1)
states: 705,712 (5)
abstracting: (po3_1_1<=21)
states: 705,712 (5)
abstracting: (11<=pil2_1_1)
states: 0
abstracting: (pb3_1_1<=19)
states: 177,280 (5)
abstracting: (21<=pol3_1_1)
states: 0
..
EG iterations: 2
abstracting: (pb2_1_1<=11)
states: 109,440 (5)
abstracting: (pol3_1_1<=pb2_1_1)
states: 700,960 (5)
abstracting: (pol2_1_1<=38)
states: 705,712 (5)
abstracting: (pb3_1_1<=pbl_1_1)
states: 37,360 (4)
abstracting: (po2_1_1<=19)
states: 705,712 (5)
.
EG iterations: 1
abstracting: (pil1_1_1<=43)
states: 705,712 (5)
.abstracting: (pi1_1_1<=32)
states: 705,712 (5)
.abstracting: (pol1_1_1<=pb1_1_1)
states: 700,960 (5)
abstracting: (1<=pb2_1_1)
states: 696,240 (5)
abstracting: (11<=pol3_1_1)
states: 0

EG iterations: 0
abstracting: (pol1_1_1<=12)
states: 705,712 (5)
abstracting: (42<=pil2_1_1)
states: 0
abstracting: (pol1_1_1<=12)
states: 705,712 (5)
abstracting: (pol1_1_1<=12)
states: 705,712 (5)
.
EG iterations: 1
abstracting: (31<=pi3_1_1)
states: 0
abstracting: (pol1_1_1<=pil3_1_1)
states: 529,288 (5)
abstracting: (36<=po2_1_1)
states: 0
abstracting: (pb1_1_1<=po2_1_1)
states: 14,160 (4)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.376sec

totally nodes used: 1181220 (1.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 146388677 3422191 149810868
used/not used/entry size/cache size: 4200646 62908218 16 1024MB
basic ops cache: hits/miss/sum: 30755289 1508810 32264099
used/not used/entry size/cache size: 2502838 14274378 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: 1025199 31066 1056265
used/not used/entry size/cache size: 31031 8357577 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 66429967
1 480057
2 122710
3 9135
4 27678
5 5235
6 16052
7 2263
8 10655
9 2037
>= 10 3075

Total processing time: 0m24.217sec


BK_STOP 1679864114868

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


iterations count:3062 (255), effective:800 (66)

initing FirstDep: 0m 0.005sec


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

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

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

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

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

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

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

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

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

iterations count:1582 (131), effective:336 (28)

iterations count:1057 (88), effective:447 (37)

iterations count:1089 (90), effective:443 (36)

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

iterations count:2289 (190), effective:535 (44)

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

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

iterations count:34 (2), effective:4 (0)

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

iterations count:32 (2), effective:3 (0)

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

iterations count:32 (2), effective:3 (0)

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

iterations count:32 (2), effective:3 (0)

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

iterations count:6750 (562), effective:1493 (124)

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

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

iterations count:1057 (88), effective:447 (37)

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

iterations count:65 (5), effective:11 (0)

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

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

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

iterations count:60 (5), effective:11 (0)

iterations count:25 (2), effective:3 (0)

iterations count:256 (21), effective:51 (4)

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

iterations count:25 (2), effective:3 (0)

iterations count:256 (21), effective:51 (4)

iterations count:25 (2), effective:3 (0)

iterations count:256 (21), effective:51 (4)

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

iterations count:60 (5), effective:11 (0)

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

iterations count:60 (5), effective:11 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:49 (4), effective:8 (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="TriangularGrid-PT-1500"
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 TriangularGrid-PT-1500, 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 r481-tall-167912692300713"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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