About the Execution of Marcie for TriangularGrid-PT-1200
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.892 | 5077.00 | 5051.00 | 0.00 | TFFFFTFTTFTFTTTF | normal |
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-167912692300710.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-1200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692300710
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.3K Feb 26 01:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 01:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:38 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 3.7K Feb 25 17:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 01:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Feb 26 01:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:43 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-1200-ReachabilityCardinality-00
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityCardinality-01
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityCardinality-02
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityCardinality-03
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityCardinality-04
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityCardinality-05
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityCardinality-06
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityCardinality-07
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityCardinality-08
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityCardinality-09
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityCardinality-10
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityCardinality-11
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityCardinality-12
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityCardinality-13
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityCardinality-14
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679864040591
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=TriangularGrid-PT-1200
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: TriangularGrid_PT_1200
(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.858sec
RS generation: 0m 0.100sec
-> reachability set: #nodes 651 (6.5e+02) #states 109,552 (5)
starting MCC model checker
--------------------------
checking: EF [~ [pol2_1_1<=1]]
normalized: E [true U ~ [pol2_1_1<=1]]
abstracting: (pol2_1_1<=1)
states: 109,552 (5)
-> the formula is FALSE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [19<=pol3_1_1]
normalized: E [true U 19<=pol3_1_1]
abstracting: (19<=pol3_1_1)
states: 0
-> the formula is FALSE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [pi3_1_1<=4]
normalized: ~ [E [true U ~ [pi3_1_1<=4]]]
abstracting: (pi3_1_1<=4)
states: 109,552 (5)
-> the formula is TRUE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [po3_1_1<=pb2_1_1]]
normalized: E [true U ~ [po3_1_1<=pb2_1_1]]
abstracting: (po3_1_1<=pb2_1_1)
states: 107,712 (5)
-> the formula is TRUE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.096sec
checking: AG [[pil1_1_1<=pi1_1_1 | pol1_1_1<=pb1_1_1]]
normalized: ~ [E [true U ~ [[pil1_1_1<=pi1_1_1 | pol1_1_1<=pb1_1_1]]]]
abstracting: (pol1_1_1<=pb1_1_1)
states: 107,680 (5)
abstracting: (pil1_1_1<=pi1_1_1)
states: 53,840 (4)
-> the formula is FALSE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: AG [~ [[[19<=pil1_1_1 & [[~ [[[19<=pb3_1_1 | [pb2_1_1<=po3_1_1 | pbl_1_1<=3]] & pil3_1_1<=13]] & pol3_1_1<=pb1_1_1] | [~ [pil1_1_1<=10] & pb2_1_1<=pol2_1_1]]] | 7<=po1_1_1]]]
normalized: ~ [E [true U [[[[~ [pil1_1_1<=10] & pb2_1_1<=pol2_1_1] | [~ [[[[pb2_1_1<=po3_1_1 | pbl_1_1<=3] | 19<=pb3_1_1] & pil3_1_1<=13]] & pol3_1_1<=pb1_1_1]] & 19<=pil1_1_1] | 7<=po1_1_1]]]
abstracting: (7<=po1_1_1)
states: 0
abstracting: (19<=pil1_1_1)
states: 0
abstracting: (pol3_1_1<=pb1_1_1)
states: 107,680 (5)
abstracting: (pil3_1_1<=13)
states: 109,552 (5)
abstracting: (19<=pb3_1_1)
states: 49,968 (4)
abstracting: (pbl_1_1<=3)
states: 73,641 (4)
abstracting: (pb2_1_1<=po3_1_1)
states: 5,520 (3)
abstracting: (pb2_1_1<=pol2_1_1)
states: 5,552 (3)
abstracting: (pil1_1_1<=10)
states: 109,552 (5)
-> the formula is TRUE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: AG [[4<=pol3_1_1 | [1<=pol3_1_1 | ~ [[~ [[[[pbl_1_1<=0 | [13<=pil2_1_1 & 12<=pol2_1_1]] & [[pil2_1_1<=3 & pil1_1_1<=pbl_1_1] | [13<=pi1_1_1 & 12<=pb3_1_1]]] | [~ [[4<=pi2_1_1 & po1_1_1<=15]] & ~ [7<=pbl_1_1]]]] & [[19<=pb2_1_1 | [[2<=pil1_1_1 & [pi1_1_1<=pil1_1_1 & po2_1_1<=pil1_1_1]] & ~ [[3<=pb1_1_1 | 8<=po3_1_1]]]] | 20<=pol1_1_1]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[[[~ [[3<=pb1_1_1 | 8<=po3_1_1]] & [[pi1_1_1<=pil1_1_1 & po2_1_1<=pil1_1_1] & 2<=pil1_1_1]] | 19<=pb2_1_1] | 20<=pol1_1_1] & ~ [[[~ [7<=pbl_1_1] & ~ [[4<=pi2_1_1 & po1_1_1<=15]]] | [[[13<=pi1_1_1 & 12<=pb3_1_1] | [pil2_1_1<=3 & pil1_1_1<=pbl_1_1]] & [[13<=pil2_1_1 & 12<=pol2_1_1] | pbl_1_1<=0]]]]]] | 1<=pol3_1_1] | 4<=pol3_1_1]]]]
abstracting: (4<=pol3_1_1)
states: 0
abstracting: (1<=pol3_1_1)
states: 55,712 (4)
abstracting: (pbl_1_1<=0)
states: 1,891 (3)
abstracting: (12<=pol2_1_1)
states: 0
abstracting: (13<=pil2_1_1)
states: 0
abstracting: (pil1_1_1<=pbl_1_1)
states: 107,661 (5)
abstracting: (pil2_1_1<=3)
states: 109,552 (5)
abstracting: (12<=pb3_1_1)
states: 69,232 (4)
abstracting: (13<=pi1_1_1)
states: 0
abstracting: (po1_1_1<=15)
states: 109,552 (5)
abstracting: (4<=pi2_1_1)
states: 0
abstracting: (7<=pbl_1_1)
states: 0
abstracting: (20<=pol1_1_1)
states: 0
abstracting: (19<=pb2_1_1)
states: 49,968 (4)
abstracting: (2<=pil1_1_1)
states: 0
abstracting: (po2_1_1<=pil1_1_1)
states: 83,096 (4)
abstracting: (pi1_1_1<=pil1_1_1)
states: 55,712 (4)
abstracting: (8<=po3_1_1)
states: 0
abstracting: (3<=pb1_1_1)
states: 98,608 (4)
-> the formula is TRUE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: EF [[[pb1_1_1<=pbl_1_1 & [[pi1_1_1<=pol2_1_1 | ~ [[[pi1_1_1<=7 | 17<=po3_1_1] | ~ [pol1_1_1<=pol1_1_1]]]] & [~ [[[~ [[pil1_1_1<=8 & 11<=pol2_1_1]] | [[po1_1_1<=pbl_1_1 | pil2_1_1<=pb1_1_1] & 11<=pbl_1_1]] & [pbl_1_1<=1 | [[pi1_1_1<=14 | 11<=pbl_1_1] | [pol3_1_1<=pi1_1_1 | pil1_1_1<=pol3_1_1]]]]] & [po3_1_1<=po2_1_1 | pil3_1_1<=pol3_1_1]]]] & pil1_1_1<=pb2_1_1]]
normalized: E [true U [[[[[po3_1_1<=po2_1_1 | pil3_1_1<=pol3_1_1] & ~ [[[[[pol3_1_1<=pi1_1_1 | pil1_1_1<=pol3_1_1] | [pi1_1_1<=14 | 11<=pbl_1_1]] | pbl_1_1<=1] & [[[po1_1_1<=pbl_1_1 | pil2_1_1<=pb1_1_1] & 11<=pbl_1_1] | ~ [[pil1_1_1<=8 & 11<=pol2_1_1]]]]]] & [~ [[~ [pol1_1_1<=pol1_1_1] | [pi1_1_1<=7 | 17<=po3_1_1]]] | pi1_1_1<=pol2_1_1]] & pb1_1_1<=pbl_1_1] & pil1_1_1<=pb2_1_1]]
abstracting: (pil1_1_1<=pb2_1_1)
states: 107,680 (5)
abstracting: (pb1_1_1<=pbl_1_1)
states: 14,320 (4)
abstracting: (pi1_1_1<=pol2_1_1)
states: 83,096 (4)
abstracting: (17<=po3_1_1)
states: 0
abstracting: (pi1_1_1<=7)
states: 109,552 (5)
abstracting: (pol1_1_1<=pol1_1_1)
states: 109,552 (5)
abstracting: (11<=pol2_1_1)
states: 0
abstracting: (pil1_1_1<=8)
states: 109,552 (5)
abstracting: (11<=pbl_1_1)
states: 0
abstracting: (pil2_1_1<=pb1_1_1)
states: 107,680 (5)
abstracting: (po1_1_1<=pbl_1_1)
states: 109,552 (5)
abstracting: (pbl_1_1<=1)
states: 12,871 (4)
abstracting: (11<=pbl_1_1)
states: 0
abstracting: (pi1_1_1<=14)
states: 109,552 (5)
abstracting: (pil1_1_1<=pol3_1_1)
states: 82,168 (4)
abstracting: (pol3_1_1<=pi1_1_1)
states: 81,224 (4)
abstracting: (pil3_1_1<=pol3_1_1)
states: 82,168 (4)
abstracting: (po3_1_1<=po2_1_1)
states: 82,168 (4)
-> the formula is FALSE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: EF [[[[[~ [[[[[pi3_1_1<=3 & 18<=pbl_1_1] & [1<=po3_1_1 & pb3_1_1<=po1_1_1]] & [~ [po1_1_1<=pi3_1_1] & [15<=pb2_1_1 | pi1_1_1<=pol2_1_1]]] & ~ [[pol1_1_1<=pil2_1_1 | [pil1_1_1<=14 | pol1_1_1<=18]]]]] | ~ [[~ [[pil1_1_1<=pb1_1_1 | pil3_1_1<=pol3_1_1]] | [[7<=po2_1_1 & pbl_1_1<=pbl_1_1] | ~ [pil1_1_1<=pi2_1_1]]]]] | pi2_1_1<=13] | [pb3_1_1<=12 & 15<=pol2_1_1]] & ~ [[20<=pb1_1_1 | ~ [[~ [po3_1_1<=pb2_1_1] & [[~ [pi3_1_1<=pi2_1_1] | [pi3_1_1<=8 | 15<=pil3_1_1]] | ~ [pb1_1_1<=18]]]]]]]]
normalized: E [true U [~ [[~ [[[~ [pb1_1_1<=18] | [[pi3_1_1<=8 | 15<=pil3_1_1] | ~ [pi3_1_1<=pi2_1_1]]] & ~ [po3_1_1<=pb2_1_1]]] | 20<=pb1_1_1]] & [[pb3_1_1<=12 & 15<=pol2_1_1] | [[~ [[[~ [pil1_1_1<=pi2_1_1] | [7<=po2_1_1 & pbl_1_1<=pbl_1_1]] | ~ [[pil1_1_1<=pb1_1_1 | pil3_1_1<=pol3_1_1]]]] | ~ [[~ [[[pil1_1_1<=14 | pol1_1_1<=18] | pol1_1_1<=pil2_1_1]] & [[[15<=pb2_1_1 | pi1_1_1<=pol2_1_1] & ~ [po1_1_1<=pi3_1_1]] & [[1<=po3_1_1 & pb3_1_1<=po1_1_1] & [pi3_1_1<=3 & 18<=pbl_1_1]]]]]] | pi2_1_1<=13]]]]
abstracting: (pi2_1_1<=13)
states: 109,552 (5)
abstracting: (18<=pbl_1_1)
states: 0
abstracting: (pi3_1_1<=3)
states: 109,552 (5)
abstracting: (pb3_1_1<=po1_1_1)
states: 5,520 (3)
abstracting: (1<=po3_1_1)
states: 53,840 (4)
abstracting: (po1_1_1<=pi3_1_1)
states: 82,168 (4)
abstracting: (pi1_1_1<=pol2_1_1)
states: 83,096 (4)
abstracting: (15<=pb2_1_1)
states: 60,592 (4)
abstracting: (pol1_1_1<=pil2_1_1)
states: 82,168 (4)
abstracting: (pol1_1_1<=18)
states: 109,552 (5)
abstracting: (pil1_1_1<=14)
states: 109,552 (5)
abstracting: (pil3_1_1<=pol3_1_1)
states: 82,168 (4)
abstracting: (pil1_1_1<=pb1_1_1)
states: 107,680 (5)
abstracting: (pbl_1_1<=pbl_1_1)
states: 109,552 (5)
abstracting: (7<=po2_1_1)
states: 0
abstracting: (pil1_1_1<=pi2_1_1)
states: 81,224 (4)
abstracting: (15<=pol2_1_1)
states: 0
abstracting: (pb3_1_1<=12)
states: 43,264 (4)
abstracting: (20<=pb1_1_1)
states: 47,472 (4)
abstracting: (po3_1_1<=pb2_1_1)
states: 107,712 (5)
abstracting: (pi3_1_1<=pi2_1_1)
states: 82,168 (4)
abstracting: (15<=pil3_1_1)
states: 0
abstracting: (pi3_1_1<=8)
states: 109,552 (5)
abstracting: (pb1_1_1<=18)
states: 59,584 (4)
-> the formula is TRUE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.034sec
checking: AG [[~ [[~ [[po3_1_1<=pi3_1_1 & [[~ [[pol1_1_1<=17 | 5<=pol3_1_1]] & [[6<=pb2_1_1 | 1<=pil3_1_1] & [pil3_1_1<=15 & 18<=pi2_1_1]]] | [[[19<=po2_1_1 | 20<=pil2_1_1] | [20<=pol3_1_1 & 3<=pil2_1_1]] | ~ [8<=pil2_1_1]]]]] | [[[2<=pi2_1_1 & [pol2_1_1<=pi3_1_1 & ~ [[pol3_1_1<=18 | pbl_1_1<=po2_1_1]]]] | [[pb3_1_1<=18 & ~ [6<=po1_1_1]] & [po2_1_1<=17 | [[pbl_1_1<=pil2_1_1 | 15<=pol2_1_1] | [pil1_1_1<=pi2_1_1 & po3_1_1<=pb2_1_1]]]]] & [9<=pil2_1_1 | [pol1_1_1<=po3_1_1 | ~ [pil3_1_1<=1]]]]]] | pi3_1_1<=5]]
normalized: ~ [E [true U ~ [[pi3_1_1<=5 | ~ [[[[9<=pil2_1_1 | [pol1_1_1<=po3_1_1 | ~ [pil3_1_1<=1]]] & [[[po2_1_1<=17 | [[pil1_1_1<=pi2_1_1 & po3_1_1<=pb2_1_1] | [pbl_1_1<=pil2_1_1 | 15<=pol2_1_1]]] & [pb3_1_1<=18 & ~ [6<=po1_1_1]]] | [2<=pi2_1_1 & [pol2_1_1<=pi3_1_1 & ~ [[pol3_1_1<=18 | pbl_1_1<=po2_1_1]]]]]] | ~ [[po3_1_1<=pi3_1_1 & [[~ [8<=pil2_1_1] | [[20<=pol3_1_1 & 3<=pil2_1_1] | [19<=po2_1_1 | 20<=pil2_1_1]]] | [[[pil3_1_1<=15 & 18<=pi2_1_1] & [6<=pb2_1_1 | 1<=pil3_1_1]] & ~ [[pol1_1_1<=17 | 5<=pol3_1_1]]]]]]]]]]]]
abstracting: (5<=pol3_1_1)
states: 0
abstracting: (pol1_1_1<=17)
states: 109,552 (5)
abstracting: (1<=pil3_1_1)
states: 55,712 (4)
abstracting: (6<=pb2_1_1)
states: 88,240 (4)
abstracting: (18<=pi2_1_1)
states: 0
abstracting: (pil3_1_1<=15)
states: 109,552 (5)
abstracting: (20<=pil2_1_1)
states: 0
abstracting: (19<=po2_1_1)
states: 0
abstracting: (3<=pil2_1_1)
states: 0
abstracting: (20<=pol3_1_1)
states: 0
abstracting: (8<=pil2_1_1)
states: 0
abstracting: (po3_1_1<=pi3_1_1)
states: 82,168 (4)
abstracting: (pbl_1_1<=po2_1_1)
states: 3,721 (3)
abstracting: (pol3_1_1<=18)
states: 109,552 (5)
abstracting: (pol2_1_1<=pi3_1_1)
states: 81,224 (4)
abstracting: (2<=pi2_1_1)
states: 0
abstracting: (6<=po1_1_1)
states: 0
abstracting: (pb3_1_1<=18)
states: 59,584 (4)
abstracting: (15<=pol2_1_1)
states: 0
abstracting: (pbl_1_1<=pil2_1_1)
states: 11,041 (4)
abstracting: (po3_1_1<=pb2_1_1)
states: 107,712 (5)
abstracting: (pil1_1_1<=pi2_1_1)
states: 81,224 (4)
abstracting: (po2_1_1<=17)
states: 109,552 (5)
abstracting: (pil3_1_1<=1)
states: 109,552 (5)
abstracting: (pol1_1_1<=po3_1_1)
states: 81,224 (4)
abstracting: (9<=pil2_1_1)
states: 0
abstracting: (pi3_1_1<=5)
states: 109,552 (5)
-> the formula is TRUE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: EF [[[17<=pol1_1_1 & [~ [po3_1_1<=1] & [[[[[~ [pol2_1_1<=pol1_1_1] | [pb2_1_1<=12 & pol1_1_1<=pi2_1_1]] & pil1_1_1<=7] & ~ [[[9<=po3_1_1 | pbl_1_1<=pil1_1_1] & [po3_1_1<=po1_1_1 | pi2_1_1<=18]]]] & [~ [[8<=pil1_1_1 | ~ [pil3_1_1<=pbl_1_1]]] | [~ [[17<=po2_1_1 & pol2_1_1<=0]] | [[14<=pi3_1_1 & pol1_1_1<=pol2_1_1] & pil1_1_1<=10]]]] | [[18<=pil2_1_1 & ~ [[[pol1_1_1<=pi3_1_1 & pi3_1_1<=17] | ~ [pol3_1_1<=19]]]] & [[12<=pb1_1_1 | ~ [[pol3_1_1<=pbl_1_1 & pbl_1_1<=17]]] | [~ [pbl_1_1<=9] & [[1<=po3_1_1 | po3_1_1<=pb1_1_1] & [pil2_1_1<=pol1_1_1 & pb3_1_1<=8]]]]]]]] | [7<=pb2_1_1 & ~ [pi1_1_1<=pbl_1_1]]]]
normalized: E [true U [[7<=pb2_1_1 & ~ [pi1_1_1<=pbl_1_1]] | [17<=pol1_1_1 & [[[[[[[pil2_1_1<=pol1_1_1 & pb3_1_1<=8] & [1<=po3_1_1 | po3_1_1<=pb1_1_1]] & ~ [pbl_1_1<=9]] | [12<=pb1_1_1 | ~ [[pol3_1_1<=pbl_1_1 & pbl_1_1<=17]]]] & [18<=pil2_1_1 & ~ [[~ [pol3_1_1<=19] | [pol1_1_1<=pi3_1_1 & pi3_1_1<=17]]]]] | [[[[pil1_1_1<=10 & [14<=pi3_1_1 & pol1_1_1<=pol2_1_1]] | ~ [[17<=po2_1_1 & pol2_1_1<=0]]] | ~ [[8<=pil1_1_1 | ~ [pil3_1_1<=pbl_1_1]]]] & [~ [[[po3_1_1<=po1_1_1 | pi2_1_1<=18] & [9<=po3_1_1 | pbl_1_1<=pil1_1_1]]] & [pil1_1_1<=7 & [[pb2_1_1<=12 & pol1_1_1<=pi2_1_1] | ~ [pol2_1_1<=pol1_1_1]]]]]] & ~ [po3_1_1<=1]]]]]
abstracting: (po3_1_1<=1)
states: 109,552 (5)
abstracting: (pol2_1_1<=pol1_1_1)
states: 82,168 (4)
abstracting: (pol1_1_1<=pi2_1_1)
states: 81,224 (4)
abstracting: (pb2_1_1<=12)
states: 43,264 (4)
abstracting: (pil1_1_1<=7)
states: 109,552 (5)
abstracting: (pbl_1_1<=pil1_1_1)
states: 11,041 (4)
abstracting: (9<=po3_1_1)
states: 0
abstracting: (pi2_1_1<=18)
states: 109,552 (5)
abstracting: (po3_1_1<=po1_1_1)
states: 82,168 (4)
abstracting: (pil3_1_1<=pbl_1_1)
states: 107,661 (5)
abstracting: (8<=pil1_1_1)
states: 0
abstracting: (pol2_1_1<=0)
states: 53,840 (4)
abstracting: (17<=po2_1_1)
states: 0
abstracting: (pol1_1_1<=pol2_1_1)
states: 82,168 (4)
abstracting: (14<=pi3_1_1)
states: 0
abstracting: (pil1_1_1<=10)
states: 109,552 (5)
abstracting: (pi3_1_1<=17)
states: 109,552 (5)
abstracting: (pol1_1_1<=pi3_1_1)
states: 81,224 (4)
abstracting: (pol3_1_1<=19)
states: 109,552 (5)
abstracting: (18<=pil2_1_1)
states: 0
abstracting: (pbl_1_1<=17)
states: 109,552 (5)
abstracting: (pol3_1_1<=pbl_1_1)
states: 107,661 (5)
abstracting: (12<=pb1_1_1)
states: 69,232 (4)
abstracting: (pbl_1_1<=9)
states: 109,552 (5)
abstracting: (po3_1_1<=pb1_1_1)
states: 107,712 (5)
abstracting: (1<=po3_1_1)
states: 53,840 (4)
abstracting: (pb3_1_1<=8)
states: 31,104 (4)
abstracting: (pil2_1_1<=pol1_1_1)
states: 82,168 (4)
abstracting: (17<=pol1_1_1)
states: 0
abstracting: (pi1_1_1<=pbl_1_1)
states: 109,552 (5)
abstracting: (7<=pb2_1_1)
states: 84,912 (4)
-> the formula is FALSE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: EF [[[~ [[~ [[~ [[8<=po1_1_1 | [14<=po2_1_1 | pi3_1_1<=20]]] & [po2_1_1<=8 & 17<=pil3_1_1]]] | [~ [[[pol3_1_1<=4 | pil3_1_1<=6] | po1_1_1<=15]] | [[[20<=po2_1_1 | ~ [pol1_1_1<=pi3_1_1]] | [[pbl_1_1<=7 | 10<=pi3_1_1] & ~ [pb3_1_1<=16]]] | [~ [[15<=pil2_1_1 | pol1_1_1<=pi1_1_1]] & [[16<=pol1_1_1 & pb2_1_1<=pi3_1_1] & ~ [14<=pi3_1_1]]]]]]] & [10<=pb1_1_1 | 16<=po1_1_1]] & ~ [[[[pil2_1_1<=10 | [~ [[[pil2_1_1<=pol2_1_1 | 9<=pi1_1_1] | [pb3_1_1<=pil1_1_1 & 10<=pol2_1_1]]] | pb2_1_1<=9]] & [[[[~ [po3_1_1<=18] & [pi1_1_1<=20 & pil1_1_1<=11]] & 10<=pol3_1_1] | [pil1_1_1<=pil2_1_1 & [[pil3_1_1<=pi1_1_1 | po1_1_1<=pb1_1_1] | ~ [pil2_1_1<=8]]]] | ~ [[~ [pi2_1_1<=18] | [[po3_1_1<=po1_1_1 & 7<=pi1_1_1] & po3_1_1<=14]]]]] | pi3_1_1<=4]]]]
normalized: E [true U [~ [[pi3_1_1<=4 | [[~ [[[po3_1_1<=14 & [po3_1_1<=po1_1_1 & 7<=pi1_1_1]] | ~ [pi2_1_1<=18]]] | [[pil1_1_1<=pil2_1_1 & [~ [pil2_1_1<=8] | [pil3_1_1<=pi1_1_1 | po1_1_1<=pb1_1_1]]] | [10<=pol3_1_1 & [[pi1_1_1<=20 & pil1_1_1<=11] & ~ [po3_1_1<=18]]]]] & [pil2_1_1<=10 | [pb2_1_1<=9 | ~ [[[pb3_1_1<=pil1_1_1 & 10<=pol2_1_1] | [pil2_1_1<=pol2_1_1 | 9<=pi1_1_1]]]]]]]] & [[10<=pb1_1_1 | 16<=po1_1_1] & ~ [[[[[~ [[15<=pil2_1_1 | pol1_1_1<=pi1_1_1]] & [~ [14<=pi3_1_1] & [16<=pol1_1_1 & pb2_1_1<=pi3_1_1]]] | [[[pbl_1_1<=7 | 10<=pi3_1_1] & ~ [pb3_1_1<=16]] | [20<=po2_1_1 | ~ [pol1_1_1<=pi3_1_1]]]] | ~ [[po1_1_1<=15 | [pol3_1_1<=4 | pil3_1_1<=6]]]] | ~ [[[po2_1_1<=8 & 17<=pil3_1_1] & ~ [[8<=po1_1_1 | [14<=po2_1_1 | pi3_1_1<=20]]]]]]]]]]
abstracting: (pi3_1_1<=20)
states: 109,552 (5)
abstracting: (14<=po2_1_1)
states: 0
abstracting: (8<=po1_1_1)
states: 0
abstracting: (17<=pil3_1_1)
states: 0
abstracting: (po2_1_1<=8)
states: 109,552 (5)
abstracting: (pil3_1_1<=6)
states: 109,552 (5)
abstracting: (pol3_1_1<=4)
states: 109,552 (5)
abstracting: (po1_1_1<=15)
states: 109,552 (5)
abstracting: (pol1_1_1<=pi3_1_1)
states: 81,224 (4)
abstracting: (20<=po2_1_1)
states: 0
abstracting: (pb3_1_1<=16)
states: 54,400 (4)
abstracting: (10<=pi3_1_1)
states: 0
abstracting: (pbl_1_1<=7)
states: 109,552 (5)
abstracting: (pb2_1_1<=pi3_1_1)
states: 5,520 (3)
abstracting: (16<=pol1_1_1)
states: 0
abstracting: (14<=pi3_1_1)
states: 0
abstracting: (pol1_1_1<=pi1_1_1)
states: 81,224 (4)
abstracting: (15<=pil2_1_1)
states: 0
abstracting: (16<=po1_1_1)
states: 0
abstracting: (10<=pb1_1_1)
states: 75,312 (4)
abstracting: (9<=pi1_1_1)
states: 0
abstracting: (pil2_1_1<=pol2_1_1)
states: 82,168 (4)
abstracting: (10<=pol2_1_1)
states: 0
abstracting: (pb3_1_1<=pil1_1_1)
states: 5,552 (3)
abstracting: (pb2_1_1<=9)
states: 34,240 (4)
abstracting: (pil2_1_1<=10)
states: 109,552 (5)
abstracting: (po3_1_1<=18)
states: 109,552 (5)
abstracting: (pil1_1_1<=11)
states: 109,552 (5)
abstracting: (pi1_1_1<=20)
states: 109,552 (5)
abstracting: (10<=pol3_1_1)
states: 0
abstracting: (po1_1_1<=pb1_1_1)
states: 107,712 (5)
abstracting: (pil3_1_1<=pi1_1_1)
states: 81,224 (4)
abstracting: (pil2_1_1<=8)
states: 109,552 (5)
abstracting: (pil1_1_1<=pil2_1_1)
states: 82,168 (4)
abstracting: (pi2_1_1<=18)
states: 109,552 (5)
abstracting: (7<=pi1_1_1)
states: 0
abstracting: (po3_1_1<=po1_1_1)
states: 82,168 (4)
abstracting: (po3_1_1<=14)
states: 109,552 (5)
abstracting: (pi3_1_1<=4)
states: 109,552 (5)
-> the formula is FALSE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.026sec
checking: EF [[[[[[[[~ [pol2_1_1<=pil2_1_1] & pol3_1_1<=4] | 9<=pol3_1_1] | pb2_1_1<=16] | ~ [[~ [[[pi1_1_1<=po2_1_1 | 3<=po2_1_1] & 20<=pb1_1_1]] & [pb3_1_1<=5 & pbl_1_1<=pol3_1_1]]]] & pb1_1_1<=5] & ~ [[pol3_1_1<=pi1_1_1 & ~ [[[pol1_1_1<=pb1_1_1 | [11<=po2_1_1 & 14<=po3_1_1]] | [[14<=pi2_1_1 | pi3_1_1<=16] | ~ [pb1_1_1<=3]]]]]]] | [5<=po2_1_1 & ~ [[[[[[5<=pb2_1_1 | [pol1_1_1<=4 | pol3_1_1<=2]] & [[5<=pb1_1_1 | pil3_1_1<=0] & [20<=pil1_1_1 | po3_1_1<=po2_1_1]]] | [~ [[po2_1_1<=pbl_1_1 | po2_1_1<=pil3_1_1]] | po1_1_1<=pol3_1_1]] & [[~ [[17<=pil2_1_1 & po2_1_1<=7]] | [pol3_1_1<=pol3_1_1 & pi2_1_1<=pil1_1_1]] | ~ [[pil1_1_1<=11 & pb3_1_1<=10]]]] | [~ [[pi2_1_1<=pil2_1_1 & pil2_1_1<=13]] & 13<=pb1_1_1]]]]]]
normalized: E [true U [[5<=po2_1_1 & ~ [[[13<=pb1_1_1 & ~ [[pi2_1_1<=pil2_1_1 & pil2_1_1<=13]]] | [[~ [[pil1_1_1<=11 & pb3_1_1<=10]] | [[pol3_1_1<=pol3_1_1 & pi2_1_1<=pil1_1_1] | ~ [[17<=pil2_1_1 & po2_1_1<=7]]]] & [[po1_1_1<=pol3_1_1 | ~ [[po2_1_1<=pbl_1_1 | po2_1_1<=pil3_1_1]]] | [[[20<=pil1_1_1 | po3_1_1<=po2_1_1] & [5<=pb1_1_1 | pil3_1_1<=0]] & [5<=pb2_1_1 | [pol1_1_1<=4 | pol3_1_1<=2]]]]]]]] | [~ [[pol3_1_1<=pi1_1_1 & ~ [[[~ [pb1_1_1<=3] | [14<=pi2_1_1 | pi3_1_1<=16]] | [pol1_1_1<=pb1_1_1 | [11<=po2_1_1 & 14<=po3_1_1]]]]]] & [pb1_1_1<=5 & [~ [[[pb3_1_1<=5 & pbl_1_1<=pol3_1_1] & ~ [[20<=pb1_1_1 & [pi1_1_1<=po2_1_1 | 3<=po2_1_1]]]]] | [pb2_1_1<=16 | [9<=pol3_1_1 | [pol3_1_1<=4 & ~ [pol2_1_1<=pil2_1_1]]]]]]]]]
abstracting: (pol2_1_1<=pil2_1_1)
states: 82,168 (4)
abstracting: (pol3_1_1<=4)
states: 109,552 (5)
abstracting: (9<=pol3_1_1)
states: 0
abstracting: (pb2_1_1<=16)
states: 54,400 (4)
abstracting: (3<=po2_1_1)
states: 0
abstracting: (pi1_1_1<=po2_1_1)
states: 82,168 (4)
abstracting: (20<=pb1_1_1)
states: 47,472 (4)
abstracting: (pbl_1_1<=pol3_1_1)
states: 11,041 (4)
abstracting: (pb3_1_1<=5)
states: 21,312 (4)
abstracting: (pb1_1_1<=5)
states: 21,312 (4)
abstracting: (14<=po3_1_1)
states: 0
abstracting: (11<=po2_1_1)
states: 0
abstracting: (pol1_1_1<=pb1_1_1)
states: 107,680 (5)
abstracting: (pi3_1_1<=16)
states: 109,552 (5)
abstracting: (14<=pi2_1_1)
states: 0
abstracting: (pb1_1_1<=3)
states: 14,464 (4)
abstracting: (pol3_1_1<=pi1_1_1)
states: 81,224 (4)
abstracting: (pol3_1_1<=2)
states: 109,552 (5)
abstracting: (pol1_1_1<=4)
states: 109,552 (5)
abstracting: (5<=pb2_1_1)
states: 91,632 (4)
abstracting: (pil3_1_1<=0)
states: 53,840 (4)
abstracting: (5<=pb1_1_1)
states: 91,632 (4)
abstracting: (po3_1_1<=po2_1_1)
states: 82,168 (4)
abstracting: (20<=pil1_1_1)
states: 0
abstracting: (po2_1_1<=pil3_1_1)
states: 83,096 (4)
abstracting: (po2_1_1<=pbl_1_1)
states: 109,552 (5)
abstracting: (po1_1_1<=pol3_1_1)
states: 83,096 (4)
abstracting: (po2_1_1<=7)
states: 109,552 (5)
abstracting: (17<=pil2_1_1)
states: 0
abstracting: (pi2_1_1<=pil1_1_1)
states: 83,096 (4)
abstracting: (pol3_1_1<=pol3_1_1)
states: 109,552 (5)
abstracting: (pb3_1_1<=10)
states: 37,312 (4)
abstracting: (pil1_1_1<=11)
states: 109,552 (5)
abstracting: (pil2_1_1<=13)
states: 109,552 (5)
abstracting: (pi2_1_1<=pil2_1_1)
states: 55,712 (4)
abstracting: (13<=pb1_1_1)
states: 66,288 (4)
abstracting: (5<=po2_1_1)
states: 0
-> the formula is TRUE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: EF [[[[[[[~ [[[pil2_1_1<=14 | pbl_1_1<=po3_1_1] & [pbl_1_1<=pb2_1_1 & 14<=pi2_1_1]]] | [[~ [po3_1_1<=10] & [pb2_1_1<=pi3_1_1 | 16<=pi2_1_1]] | ~ [[po3_1_1<=pi2_1_1 & pb1_1_1<=pb2_1_1]]]] & [~ [[pi2_1_1<=14 | [2<=pil3_1_1 | 20<=po3_1_1]]] & [[[3<=po1_1_1 & pb3_1_1<=20] & ~ [19<=po1_1_1]] | ~ [[po1_1_1<=pil2_1_1 & 17<=pb1_1_1]]]]] & [~ [[[pol1_1_1<=10 | po3_1_1<=pil1_1_1] & pb2_1_1<=3]] & pil3_1_1<=7]] | [[[[11<=pol2_1_1 & ~ [[pil2_1_1<=po3_1_1 & pil2_1_1<=pil3_1_1]]] | pb1_1_1<=5] & [~ [[13<=pi3_1_1 | 10<=pil3_1_1]] & pil3_1_1<=pil1_1_1]] | [[po1_1_1<=pol1_1_1 & [~ [pi2_1_1<=pi1_1_1] | 5<=pil2_1_1]] & po2_1_1<=11]]] & 4<=po3_1_1] & [[9<=pi2_1_1 | pol3_1_1<=18] | ~ [[~ [[15<=pb2_1_1 & ~ [5<=po2_1_1]]] | ~ [[~ [po1_1_1<=pol3_1_1] & 11<=pil1_1_1]]]]]]]
normalized: E [true U [[~ [[~ [[11<=pil1_1_1 & ~ [po1_1_1<=pol3_1_1]]] | ~ [[15<=pb2_1_1 & ~ [5<=po2_1_1]]]]] | [9<=pi2_1_1 | pol3_1_1<=18]] & [4<=po3_1_1 & [[[po2_1_1<=11 & [po1_1_1<=pol1_1_1 & [5<=pil2_1_1 | ~ [pi2_1_1<=pi1_1_1]]]] | [[pil3_1_1<=pil1_1_1 & ~ [[13<=pi3_1_1 | 10<=pil3_1_1]]] & [pb1_1_1<=5 | [11<=pol2_1_1 & ~ [[pil2_1_1<=po3_1_1 & pil2_1_1<=pil3_1_1]]]]]] | [[pil3_1_1<=7 & ~ [[pb2_1_1<=3 & [pol1_1_1<=10 | po3_1_1<=pil1_1_1]]]] & [[[~ [[po1_1_1<=pil2_1_1 & 17<=pb1_1_1]] | [~ [19<=po1_1_1] & [3<=po1_1_1 & pb3_1_1<=20]]] & ~ [[pi2_1_1<=14 | [2<=pil3_1_1 | 20<=po3_1_1]]]] & [[~ [[po3_1_1<=pi2_1_1 & pb1_1_1<=pb2_1_1]] | [[pb2_1_1<=pi3_1_1 | 16<=pi2_1_1] & ~ [po3_1_1<=10]]] | ~ [[[pbl_1_1<=pb2_1_1 & 14<=pi2_1_1] & [pil2_1_1<=14 | pbl_1_1<=po3_1_1]]]]]]]]]]
abstracting: (pbl_1_1<=po3_1_1)
states: 3,721 (3)
abstracting: (pil2_1_1<=14)
states: 109,552 (5)
abstracting: (14<=pi2_1_1)
states: 0
abstracting: (pbl_1_1<=pb2_1_1)
states: 98,752 (4)
abstracting: (po3_1_1<=10)
states: 109,552 (5)
abstracting: (16<=pi2_1_1)
states: 0
abstracting: (pb2_1_1<=pi3_1_1)
states: 5,520 (3)
abstracting: (pb1_1_1<=pb2_1_1)
states: 55,712 (4)
abstracting: (po3_1_1<=pi2_1_1)
states: 82,168 (4)
abstracting: (20<=po3_1_1)
states: 0
abstracting: (2<=pil3_1_1)
states: 0
abstracting: (pi2_1_1<=14)
states: 109,552 (5)
abstracting: (pb3_1_1<=20)
states: 64,512 (4)
abstracting: (3<=po1_1_1)
states: 0
abstracting: (19<=po1_1_1)
states: 0
abstracting: (17<=pb1_1_1)
states: 55,152 (4)
abstracting: (po1_1_1<=pil2_1_1)
states: 83,096 (4)
abstracting: (po3_1_1<=pil1_1_1)
states: 83,096 (4)
abstracting: (pol1_1_1<=10)
states: 109,552 (5)
abstracting: (pb2_1_1<=3)
states: 14,464 (4)
abstracting: (pil3_1_1<=7)
states: 109,552 (5)
abstracting: (pil2_1_1<=pil3_1_1)
states: 82,168 (4)
abstracting: (pil2_1_1<=po3_1_1)
states: 81,224 (4)
abstracting: (11<=pol2_1_1)
states: 0
abstracting: (pb1_1_1<=5)
states: 21,312 (4)
abstracting: (10<=pil3_1_1)
states: 0
abstracting: (13<=pi3_1_1)
states: 0
abstracting: (pil3_1_1<=pil1_1_1)
states: 82,168 (4)
abstracting: (pi2_1_1<=pi1_1_1)
states: 82,168 (4)
abstracting: (5<=pil2_1_1)
states: 0
abstracting: (po1_1_1<=pol1_1_1)
states: 55,712 (4)
abstracting: (po2_1_1<=11)
states: 109,552 (5)
abstracting: (4<=po3_1_1)
states: 0
abstracting: (pol3_1_1<=18)
states: 109,552 (5)
abstracting: (9<=pi2_1_1)
states: 0
abstracting: (5<=po2_1_1)
states: 0
abstracting: (15<=pb2_1_1)
states: 60,592 (4)
abstracting: (po1_1_1<=pol3_1_1)
states: 83,096 (4)
abstracting: (11<=pil1_1_1)
states: 0
-> the formula is FALSE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: EF [[[[[[[[~ [[11<=pil3_1_1 | pi1_1_1<=pbl_1_1]] | [[9<=pol2_1_1 | 6<=pb2_1_1] & [5<=pi3_1_1 & pil3_1_1<=17]]] | [~ [[pb3_1_1<=pil3_1_1 & pi3_1_1<=pil1_1_1]] & [~ [pi1_1_1<=8] | [pol2_1_1<=12 & pb1_1_1<=pbl_1_1]]]] & [[[pb1_1_1<=pol1_1_1 | 12<=pb3_1_1] | [~ [pi3_1_1<=pol1_1_1] | pol3_1_1<=16]] & [pil3_1_1<=po3_1_1 & [[pol2_1_1<=12 & 4<=pi2_1_1] & pil1_1_1<=11]]]] & [~ [[11<=pil3_1_1 & 8<=po3_1_1]] | pb1_1_1<=pil1_1_1]] | ~ [9<=pb2_1_1]] | [3<=pi1_1_1 | [pil3_1_1<=2 & [~ [pol1_1_1<=pb2_1_1] & po1_1_1<=8]]]] & [po3_1_1<=14 & [[~ [[pb1_1_1<=10 & [~ [[pbl_1_1<=2 | po2_1_1<=17]] & ~ [[pi2_1_1<=5 & pbl_1_1<=pb3_1_1]]]]] | ~ [6<=pb2_1_1]] & [[po3_1_1<=pi2_1_1 & [pol2_1_1<=pb1_1_1 & ~ [[pi2_1_1<=pi3_1_1 | [pol1_1_1<=po1_1_1 & 14<=pi3_1_1]]]]] & pbl_1_1<=7]]]]]
normalized: E [true U [[po3_1_1<=14 & [[pbl_1_1<=7 & [po3_1_1<=pi2_1_1 & [pol2_1_1<=pb1_1_1 & ~ [[pi2_1_1<=pi3_1_1 | [pol1_1_1<=po1_1_1 & 14<=pi3_1_1]]]]]] & [~ [6<=pb2_1_1] | ~ [[pb1_1_1<=10 & [~ [[pi2_1_1<=5 & pbl_1_1<=pb3_1_1]] & ~ [[pbl_1_1<=2 | po2_1_1<=17]]]]]]]] & [[3<=pi1_1_1 | [pil3_1_1<=2 & [po1_1_1<=8 & ~ [pol1_1_1<=pb2_1_1]]]] | [~ [9<=pb2_1_1] | [[pb1_1_1<=pil1_1_1 | ~ [[11<=pil3_1_1 & 8<=po3_1_1]]] & [[[pil3_1_1<=po3_1_1 & [pil1_1_1<=11 & [pol2_1_1<=12 & 4<=pi2_1_1]]] & [[pol3_1_1<=16 | ~ [pi3_1_1<=pol1_1_1]] | [pb1_1_1<=pol1_1_1 | 12<=pb3_1_1]]] & [[[[pol2_1_1<=12 & pb1_1_1<=pbl_1_1] | ~ [pi1_1_1<=8]] & ~ [[pb3_1_1<=pil3_1_1 & pi3_1_1<=pil1_1_1]]] | [[[5<=pi3_1_1 & pil3_1_1<=17] & [9<=pol2_1_1 | 6<=pb2_1_1]] | ~ [[11<=pil3_1_1 | pi1_1_1<=pbl_1_1]]]]]]]]]]
abstracting: (pi1_1_1<=pbl_1_1)
states: 109,552 (5)
abstracting: (11<=pil3_1_1)
states: 0
abstracting: (6<=pb2_1_1)
states: 88,240 (4)
abstracting: (9<=pol2_1_1)
states: 0
abstracting: (pil3_1_1<=17)
states: 109,552 (5)
abstracting: (5<=pi3_1_1)
states: 0
abstracting: (pi3_1_1<=pil1_1_1)
states: 83,096 (4)
abstracting: (pb3_1_1<=pil3_1_1)
states: 5,552 (3)
abstracting: (pi1_1_1<=8)
states: 109,552 (5)
abstracting: (pb1_1_1<=pbl_1_1)
states: 14,320 (4)
abstracting: (pol2_1_1<=12)
states: 109,552 (5)
abstracting: (12<=pb3_1_1)
states: 69,232 (4)
abstracting: (pb1_1_1<=pol1_1_1)
states: 5,552 (3)
abstracting: (pi3_1_1<=pol1_1_1)
states: 83,096 (4)
abstracting: (pol3_1_1<=16)
states: 109,552 (5)
abstracting: (4<=pi2_1_1)
states: 0
abstracting: (pol2_1_1<=12)
states: 109,552 (5)
abstracting: (pil1_1_1<=11)
states: 109,552 (5)
abstracting: (pil3_1_1<=po3_1_1)
states: 81,224 (4)
abstracting: (8<=po3_1_1)
states: 0
abstracting: (11<=pil3_1_1)
states: 0
abstracting: (pb1_1_1<=pil1_1_1)
states: 5,552 (3)
abstracting: (9<=pb2_1_1)
states: 78,448 (4)
abstracting: (pol1_1_1<=pb2_1_1)
states: 107,680 (5)
abstracting: (po1_1_1<=8)
states: 109,552 (5)
abstracting: (pil3_1_1<=2)
states: 109,552 (5)
abstracting: (3<=pi1_1_1)
states: 0
abstracting: (po2_1_1<=17)
states: 109,552 (5)
abstracting: (pbl_1_1<=2)
states: 39,421 (4)
abstracting: (pbl_1_1<=pb3_1_1)
states: 98,752 (4)
abstracting: (pi2_1_1<=5)
states: 109,552 (5)
abstracting: (pb1_1_1<=10)
states: 37,312 (4)
abstracting: (6<=pb2_1_1)
states: 88,240 (4)
abstracting: (14<=pi3_1_1)
states: 0
abstracting: (pol1_1_1<=po1_1_1)
states: 53,840 (4)
abstracting: (pi2_1_1<=pi3_1_1)
states: 82,168 (4)
abstracting: (pol2_1_1<=pb1_1_1)
states: 107,680 (5)
abstracting: (po3_1_1<=pi2_1_1)
states: 82,168 (4)
abstracting: (pbl_1_1<=7)
states: 109,552 (5)
abstracting: (po3_1_1<=14)
states: 109,552 (5)
-> the formula is TRUE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.075sec
checking: EF [[[pil2_1_1<=19 & [[16<=pol1_1_1 | [~ [[~ [pi1_1_1<=6] | [[po3_1_1<=11 & 1<=pi2_1_1] & [pi3_1_1<=6 | pbl_1_1<=pil2_1_1]]]] & [[[~ [7<=pbl_1_1] | [pi3_1_1<=7 | pil3_1_1<=pi3_1_1]] & [~ [pbl_1_1<=6] | ~ [pbl_1_1<=20]]] | [pil3_1_1<=pil3_1_1 & ~ [12<=pb1_1_1]]]]] & ~ [[[~ [7<=pb2_1_1] | ~ [[pbl_1_1<=13 | ~ [pi2_1_1<=pb1_1_1]]]] & [pil1_1_1<=po2_1_1 & 20<=po2_1_1]]]]] & [[7<=pi1_1_1 & [[pbl_1_1<=13 | ~ [15<=pb2_1_1]] & ~ [7<=pi2_1_1]]] & [~ [[pol1_1_1<=13 | ~ [[~ [[10<=pb1_1_1 & pil3_1_1<=pbl_1_1]] & [[pil1_1_1<=11 | po3_1_1<=17] | ~ [pol2_1_1<=pi1_1_1]]]]]] & [[[[[[pi2_1_1<=pil2_1_1 & po3_1_1<=15] | [pi1_1_1<=pil3_1_1 | pb1_1_1<=pil2_1_1]] & 5<=pi3_1_1] & [~ [9<=pol1_1_1] & ~ [10<=pil3_1_1]]] | [[~ [18<=pol1_1_1] | [pb1_1_1<=9 | ~ [pi3_1_1<=pbl_1_1]]] & [~ [6<=pil1_1_1] | [pb1_1_1<=17 & [pol3_1_1<=pb3_1_1 | po3_1_1<=po2_1_1]]]]] & [[pol3_1_1<=pb3_1_1 | [[~ [po2_1_1<=pi1_1_1] & ~ [pi1_1_1<=13]] | [[8<=po3_1_1 & pb2_1_1<=pol1_1_1] | [20<=pb2_1_1 & 8<=pil1_1_1]]]] & [~ [pb1_1_1<=19] | [~ [po3_1_1<=8] & pi3_1_1<=12]]]]]]]]
normalized: E [true U [[[[[[pol3_1_1<=pb3_1_1 | [[~ [pi1_1_1<=13] & ~ [po2_1_1<=pi1_1_1]] | [[20<=pb2_1_1 & 8<=pil1_1_1] | [8<=po3_1_1 & pb2_1_1<=pol1_1_1]]]] & [~ [pb1_1_1<=19] | [pi3_1_1<=12 & ~ [po3_1_1<=8]]]] & [[[[pb1_1_1<=17 & [pol3_1_1<=pb3_1_1 | po3_1_1<=po2_1_1]] | ~ [6<=pil1_1_1]] & [[pb1_1_1<=9 | ~ [pi3_1_1<=pbl_1_1]] | ~ [18<=pol1_1_1]]] | [[~ [10<=pil3_1_1] & ~ [9<=pol1_1_1]] & [5<=pi3_1_1 & [[pi1_1_1<=pil3_1_1 | pb1_1_1<=pil2_1_1] | [pi2_1_1<=pil2_1_1 & po3_1_1<=15]]]]]] & ~ [[pol1_1_1<=13 | ~ [[[~ [pol2_1_1<=pi1_1_1] | [pil1_1_1<=11 | po3_1_1<=17]] & ~ [[10<=pb1_1_1 & pil3_1_1<=pbl_1_1]]]]]]] & [7<=pi1_1_1 & [~ [7<=pi2_1_1] & [pbl_1_1<=13 | ~ [15<=pb2_1_1]]]]] & [pil2_1_1<=19 & [~ [[[pil1_1_1<=po2_1_1 & 20<=po2_1_1] & [~ [[pbl_1_1<=13 | ~ [pi2_1_1<=pb1_1_1]]] | ~ [7<=pb2_1_1]]]] & [16<=pol1_1_1 | [[[pil3_1_1<=pil3_1_1 & ~ [12<=pb1_1_1]] | [[~ [pbl_1_1<=20] | ~ [pbl_1_1<=6]] & [[pi3_1_1<=7 | pil3_1_1<=pi3_1_1] | ~ [7<=pbl_1_1]]]] & ~ [[[[pi3_1_1<=6 | pbl_1_1<=pil2_1_1] & [po3_1_1<=11 & 1<=pi2_1_1]] | ~ [pi1_1_1<=6]]]]]]]]]
abstracting: (pi1_1_1<=6)
states: 109,552 (5)
abstracting: (1<=pi2_1_1)
states: 53,840 (4)
abstracting: (po3_1_1<=11)
states: 109,552 (5)
abstracting: (pbl_1_1<=pil2_1_1)
states: 11,041 (4)
abstracting: (pi3_1_1<=6)
states: 109,552 (5)
abstracting: (7<=pbl_1_1)
states: 0
abstracting: (pil3_1_1<=pi3_1_1)
states: 53,840 (4)
abstracting: (pi3_1_1<=7)
states: 109,552 (5)
abstracting: (pbl_1_1<=6)
states: 109,552 (5)
abstracting: (pbl_1_1<=20)
states: 109,552 (5)
abstracting: (12<=pb1_1_1)
states: 69,232 (4)
abstracting: (pil3_1_1<=pil3_1_1)
states: 109,552 (5)
abstracting: (16<=pol1_1_1)
states: 0
abstracting: (7<=pb2_1_1)
states: 84,912 (4)
abstracting: (pi2_1_1<=pb1_1_1)
states: 107,712 (5)
abstracting: (pbl_1_1<=13)
states: 109,552 (5)
abstracting: (20<=po2_1_1)
states: 0
abstracting: (pil1_1_1<=po2_1_1)
states: 81,224 (4)
abstracting: (pil2_1_1<=19)
states: 109,552 (5)
abstracting: (15<=pb2_1_1)
states: 60,592 (4)
abstracting: (pbl_1_1<=13)
states: 109,552 (5)
abstracting: (7<=pi2_1_1)
states: 0
abstracting: (7<=pi1_1_1)
states: 0
abstracting: (pil3_1_1<=pbl_1_1)
states: 107,661 (5)
abstracting: (10<=pb1_1_1)
states: 75,312 (4)
abstracting: (po3_1_1<=17)
states: 109,552 (5)
abstracting: (pil1_1_1<=11)
states: 109,552 (5)
abstracting: (pol2_1_1<=pi1_1_1)
states: 81,224 (4)
abstracting: (pol1_1_1<=13)
states: 109,552 (5)
abstracting: (po3_1_1<=15)
states: 109,552 (5)
abstracting: (pi2_1_1<=pil2_1_1)
states: 55,712 (4)
abstracting: (pb1_1_1<=pil2_1_1)
states: 5,552 (3)
abstracting: (pi1_1_1<=pil3_1_1)
states: 83,096 (4)
abstracting: (5<=pi3_1_1)
states: 0
abstracting: (9<=pol1_1_1)
states: 0
abstracting: (10<=pil3_1_1)
states: 0
abstracting: (18<=pol1_1_1)
states: 0
abstracting: (pi3_1_1<=pbl_1_1)
states: 109,552 (5)
abstracting: (pb1_1_1<=9)
states: 34,240 (4)
abstracting: (6<=pil1_1_1)
states: 0
abstracting: (po3_1_1<=po2_1_1)
states: 82,168 (4)
abstracting: (pol3_1_1<=pb3_1_1)
states: 107,680 (5)
abstracting: (pb1_1_1<=17)
states: 57,024 (4)
abstracting: (po3_1_1<=8)
states: 109,552 (5)
abstracting: (pi3_1_1<=12)
states: 109,552 (5)
abstracting: (pb1_1_1<=19)
states: 62,080 (4)
abstracting: (pb2_1_1<=pol1_1_1)
states: 5,552 (3)
abstracting: (8<=po3_1_1)
states: 0
abstracting: (8<=pil1_1_1)
states: 0
abstracting: (20<=pb2_1_1)
states: 47,472 (4)
abstracting: (po2_1_1<=pi1_1_1)
states: 82,168 (4)
abstracting: (pi1_1_1<=13)
states: 109,552 (5)
abstracting: (pol3_1_1<=pb3_1_1)
states: 107,680 (5)
-> the formula is FALSE
FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.032sec
totally nodes used: 72420 (7.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2899075 208777 3107852
used/not used/entry size/cache size: 232422 66876442 16 1024MB
basic ops cache: hits/miss/sum: 1334966 229834 1564800
used/not used/entry size/cache size: 340412 16436804 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: 210607 15690 226297
used/not used/entry size/cache size: 15690 8372918 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 67056180
1 48824
2 2084
3 1084
4 375
5 117
6 23
7 6
8 5
9 3
>= 10 163
Total processing time: 0m 5.030sec
BK_STOP 1679864045668
--------------------
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.003sec
iterations count:1232 (102), effective:320 (26)
initing FirstDep: 0m 0.000sec
iterations count:858 (71), effective:181 (15)
iterations count:432 (36), effective:180 (15)
iterations count:1171 (97), effective:298 (24)
iterations count:412 (34), effective:167 (13)
iterations count:782 (65), effective:164 (13)
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-1200"
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 TriangularGrid-PT-1200, 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 r481-tall-167912692300710"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-1200.tgz
mv TriangularGrid-PT-1200 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 '
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 ;