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.r490-tall-167912709000718.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 marciexred
Input is TriangularGrid-PT-1500, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709000718
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME TriangularGrid-PT-1500-ReachabilityCardinality-01
FORMULA_NAME TriangularGrid-PT-1500-ReachabilityCardinality-02
FORMULA_NAME TriangularGrid-PT-1500-ReachabilityCardinality-03
FORMULA_NAME TriangularGrid-PT-1500-ReachabilityCardinality-04
FORMULA_NAME TriangularGrid-PT-1500-ReachabilityCardinality-05
FORMULA_NAME TriangularGrid-PT-1500-ReachabilityCardinality-06
FORMULA_NAME TriangularGrid-PT-1500-ReachabilityCardinality-07
FORMULA_NAME TriangularGrid-PT-1500-ReachabilityCardinality-08
FORMULA_NAME TriangularGrid-PT-1500-ReachabilityCardinality-09
FORMULA_NAME TriangularGrid-PT-1500-ReachabilityCardinality-10
FORMULA_NAME TriangularGrid-PT-1500-ReachabilityCardinality-11
FORMULA_NAME TriangularGrid-PT-1500-ReachabilityCardinality-12
FORMULA_NAME TriangularGrid-PT-1500-ReachabilityCardinality-13
FORMULA_NAME TriangularGrid-PT-1500-ReachabilityCardinality-14
FORMULA_NAME TriangularGrid-PT-1500-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679326255964

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TriangularGrid-PT-1500
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 15:30:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 15:30:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 15:30:57] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-20 15:30:57] [INFO ] Transformed 16 places.
[2023-03-20 15:30:57] [INFO ] Transformed 12 transitions.
[2023-03-20 15:30:57] [INFO ] Parsed PT model containing 16 places and 12 transitions and 48 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 16) seen :1
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 346839 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 346839 steps, saw 123844 distinct states, run finished after 3002 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 12 rows 16 cols
[2023-03-20 15:31:01] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-20 15:31:01] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-20 15:31:01] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 15:31:01] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:9
[2023-03-20 15:31:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-20 15:31:01] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 15:31:01] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :13 sat :2
[2023-03-20 15:31:01] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :13 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-20 15:31:01] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :2
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 2 different solutions.
Finished Parikh walk after 442 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=63 )
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 8 ms.
All properties solved without resorting to model-checking.
Total runtime 4126 ms.
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//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.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.724sec


RS generation: 0m 1.130sec


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



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

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

abstracting: (pbl_1_1<=10)
states: 705,712 (5)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [pol3_1_1<=44]]
normalized: E [true U ~ [pol3_1_1<=44]]

abstracting: (pol3_1_1<=44)
states: 705,712 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [22<=po2_1_1]
normalized: E [true U 22<=po2_1_1]

abstracting: (22<=po2_1_1)
states: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [30<=pi1_1_1]
normalized: E [true U 30<=pi1_1_1]

abstracting: (30<=pi1_1_1)
states: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [~ [20<=pb1_1_1]]
normalized: E [true U ~ [20<=pb1_1_1]]

abstracting: (20<=pb1_1_1)
states: 528,432 (5)
-> the formula is TRUE

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

MC time: 0m 0.096sec

checking: AG [[~ [44<=pil2_1_1] | pil1_1_1<=48]]
normalized: ~ [E [true U ~ [[~ [44<=pil2_1_1] | pil1_1_1<=48]]]]

abstracting: (pil1_1_1<=48)
states: 705,712 (5)
abstracting: (44<=pil2_1_1)
states: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[[~ [21<=po3_1_1] & 41<=po3_1_1] & [po2_1_1<=pil3_1_1 & 35<=pol3_1_1]] & 26<=pb2_1_1]]
normalized: E [true U [26<=pb2_1_1 & [[po2_1_1<=pil3_1_1 & 35<=pol3_1_1] & [~ [21<=po3_1_1] & 41<=po3_1_1]]]]

abstracting: (41<=po3_1_1)
states: 0
abstracting: (21<=po3_1_1)
states: 0
abstracting: (35<=pol3_1_1)
states: 0
abstracting: (po2_1_1<=pil3_1_1)
states: 531,656 (5)
abstracting: (26<=pb2_1_1)
states: 480,240 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [~ [[~ [pbl_1_1<=28] | [[[~ [po2_1_1<=pi2_1_1] & ~ [[[pil1_1_1<=14 & 30<=pb2_1_1] | po2_1_1<=po3_1_1]]] & ~ [pol2_1_1<=po2_1_1]] & [[[pi1_1_1<=34 | [~ [[pb1_1_1<=po2_1_1 | po2_1_1<=41]] & pb3_1_1<=12]] & pi1_1_1<=20] & pb3_1_1<=23]]]]]
normalized: ~ [E [true U [[[~ [pol2_1_1<=po2_1_1] & [~ [[[pil1_1_1<=14 & 30<=pb2_1_1] | po2_1_1<=po3_1_1]] & ~ [po2_1_1<=pi2_1_1]]] & [[[[~ [[pb1_1_1<=po2_1_1 | po2_1_1<=41]] & pb3_1_1<=12] | pi1_1_1<=34] & pi1_1_1<=20] & pb3_1_1<=23]] | ~ [pbl_1_1<=28]]]]

abstracting: (pbl_1_1<=28)
states: 705,712 (5)
abstracting: (pb3_1_1<=23)
states: 209,664 (5)
abstracting: (pi1_1_1<=20)
states: 705,712 (5)
abstracting: (pi1_1_1<=34)
states: 705,712 (5)
abstracting: (pb3_1_1<=12)
states: 118,144 (5)
abstracting: (po2_1_1<=41)
states: 705,712 (5)
abstracting: (pb1_1_1<=po2_1_1)
states: 14,160 (4)
abstracting: (po2_1_1<=pi2_1_1)
states: 529,288 (5)
abstracting: (po2_1_1<=po3_1_1)
states: 529,288 (5)
abstracting: (30<=pb2_1_1)
states: 449,392 (5)
abstracting: (pil1_1_1<=14)
states: 705,712 (5)
abstracting: (pol2_1_1<=po2_1_1)
states: 350,480 (5)
-> the formula is TRUE

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

MC time: 0m 0.034sec

checking: EF [[40<=pol1_1_1 & [~ [[[[[pbl_1_1<=pb1_1_1 | [~ [po3_1_1<=10] | ~ [pil1_1_1<=14]]] | ~ [31<=po3_1_1]] & ~ [28<=pil2_1_1]] | [~ [[[~ [po1_1_1<=21] | ~ [pil3_1_1<=11]] & 23<=po3_1_1]] & pil3_1_1<=po3_1_1]]] & ~ [[[pbl_1_1<=pi3_1_1 & [pi1_1_1<=3 & ~ [[po2_1_1<=36 | ~ [po2_1_1<=13]]]]] & [[~ [[pb2_1_1<=pb3_1_1 & 25<=pil2_1_1]] | pb1_1_1<=pol2_1_1] & ~ [25<=pi1_1_1]]]]]]]
normalized: E [true U [[~ [[[~ [25<=pi1_1_1] & [~ [[pb2_1_1<=pb3_1_1 & 25<=pil2_1_1]] | pb1_1_1<=pol2_1_1]] & [[~ [[~ [po2_1_1<=13] | po2_1_1<=36]] & pi1_1_1<=3] & pbl_1_1<=pi3_1_1]]] & ~ [[[~ [[[~ [pil3_1_1<=11] | ~ [po1_1_1<=21]] & 23<=po3_1_1]] & pil3_1_1<=po3_1_1] | [~ [28<=pil2_1_1] & [~ [31<=po3_1_1] | [[~ [pil1_1_1<=14] | ~ [po3_1_1<=10]] | pbl_1_1<=pb1_1_1]]]]]] & 40<=pol1_1_1]]

abstracting: (40<=pol1_1_1)
states: 0
abstracting: (pbl_1_1<=pb1_1_1)
states: 677,632 (5)
abstracting: (po3_1_1<=10)
states: 705,712 (5)
abstracting: (pil1_1_1<=14)
states: 705,712 (5)
abstracting: (31<=po3_1_1)
states: 0
abstracting: (28<=pil2_1_1)
states: 0
abstracting: (pil3_1_1<=po3_1_1)
states: 526,904 (5)
abstracting: (23<=po3_1_1)
states: 0
abstracting: (po1_1_1<=21)
states: 705,712 (5)
abstracting: (pil3_1_1<=11)
states: 705,712 (5)
abstracting: (pbl_1_1<=pi3_1_1)
states: 22,801 (4)
abstracting: (pi1_1_1<=3)
states: 705,712 (5)
abstracting: (po2_1_1<=36)
states: 705,712 (5)
abstracting: (po2_1_1<=13)
states: 705,712 (5)
abstracting: (pb1_1_1<=pol2_1_1)
states: 14,192 (4)
abstracting: (25<=pil2_1_1)
states: 0
abstracting: (pb2_1_1<=pb3_1_1)
states: 355,232 (5)
abstracting: (25<=pi1_1_1)
states: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.081sec

checking: AG [[[[[pbl_1_1<=po3_1_1 | [[~ [[[po2_1_1<=pil3_1_1 & 17<=pb1_1_1] | [36<=pol2_1_1 & pol3_1_1<=pol2_1_1]]] & ~ [[[12<=pi3_1_1 | pb1_1_1<=pi2_1_1] | [27<=pb3_1_1 | 3<=pol3_1_1]]]] & [[~ [pb1_1_1<=5] & [~ [pb3_1_1<=pil1_1_1] & ~ [pil2_1_1<=27]]] | ~ [13<=pbl_1_1]]]] & [23<=pi2_1_1 | [~ [[~ [pol2_1_1<=pb2_1_1] | ~ [39<=pi2_1_1]]] | 15<=pi1_1_1]]] & [[~ [26<=pol1_1_1] & [[[pi1_1_1<=pbl_1_1 & [[pbl_1_1<=pb3_1_1 | 39<=pi2_1_1] & pb1_1_1<=5]] & [~ [[7<=pi3_1_1 & 12<=pb1_1_1]] & 26<=pol3_1_1]] | pi3_1_1<=50]] & 47<=pi3_1_1]] | ~ [15<=pil2_1_1]]]
normalized: ~ [E [true U ~ [[~ [15<=pil2_1_1] | [[47<=pi3_1_1 & [[pi3_1_1<=50 | [[26<=pol3_1_1 & ~ [[7<=pi3_1_1 & 12<=pb1_1_1]]] & [pi1_1_1<=pbl_1_1 & [pb1_1_1<=5 & [pbl_1_1<=pb3_1_1 | 39<=pi2_1_1]]]]] & ~ [26<=pol1_1_1]]] & [[23<=pi2_1_1 | [15<=pi1_1_1 | ~ [[~ [39<=pi2_1_1] | ~ [pol2_1_1<=pb2_1_1]]]]] & [pbl_1_1<=po3_1_1 | [[~ [13<=pbl_1_1] | [[~ [pil2_1_1<=27] & ~ [pb3_1_1<=pil1_1_1]] & ~ [pb1_1_1<=5]]] & [~ [[[27<=pb3_1_1 | 3<=pol3_1_1] | [12<=pi3_1_1 | pb1_1_1<=pi2_1_1]]] & ~ [[[36<=pol2_1_1 & pol3_1_1<=pol2_1_1] | [po2_1_1<=pil3_1_1 & 17<=pb1_1_1]]]]]]]]]]]]

abstracting: (17<=pb1_1_1)
states: 553,392 (5)
abstracting: (po2_1_1<=pil3_1_1)
states: 531,656 (5)
abstracting: (pol3_1_1<=pol2_1_1)
states: 529,288 (5)
abstracting: (36<=pol2_1_1)
states: 0
abstracting: (pb1_1_1<=pi2_1_1)
states: 14,160 (4)
abstracting: (12<=pi3_1_1)
states: 0
abstracting: (3<=pol3_1_1)
states: 0
abstracting: (27<=pb3_1_1)
states: 472,432 (5)
abstracting: (pb1_1_1<=5)
states: 55,872 (4)
abstracting: (pb3_1_1<=pil1_1_1)
states: 14,192 (4)
abstracting: (pil2_1_1<=27)
states: 705,712 (5)
abstracting: (13<=pbl_1_1)
states: 0
abstracting: (pbl_1_1<=po3_1_1)
states: 22,801 (4)
abstracting: (pol2_1_1<=pb2_1_1)
states: 700,960 (5)
abstracting: (39<=pi2_1_1)
states: 0
abstracting: (15<=pi1_1_1)
states: 0
abstracting: (23<=pi2_1_1)
states: 0
abstracting: (26<=pol1_1_1)
states: 0
abstracting: (39<=pi2_1_1)
states: 0
abstracting: (pbl_1_1<=pb3_1_1)
states: 677,632 (5)
abstracting: (pb1_1_1<=5)
states: 55,872 (4)
abstracting: (pi1_1_1<=pbl_1_1)
states: 705,712 (5)
abstracting: (12<=pb1_1_1)
states: 596,272 (5)
abstracting: (7<=pi3_1_1)
states: 0
abstracting: (26<=pol3_1_1)
states: 0
abstracting: (pi3_1_1<=50)
states: 705,712 (5)
abstracting: (47<=pi3_1_1)
states: 0
abstracting: (15<=pil2_1_1)
states: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.139sec

checking: AG [[[pb3_1_1<=27 | ~ [28<=po1_1_1]] | [[[[1<=pi1_1_1 | 13<=pi1_1_1] | [pil3_1_1<=47 & [[~ [[42<=pi2_1_1 | pbl_1_1<=6]] | pbl_1_1<=pil2_1_1] | ~ [[[34<=pb1_1_1 & 46<=pil2_1_1] & [pb2_1_1<=30 & po2_1_1<=pil1_1_1]]]]]] | pi2_1_1<=10] & ~ [[~ [[[[~ [po3_1_1<=po1_1_1] & [14<=pil3_1_1 & 39<=pol3_1_1]] & [[po1_1_1<=pol2_1_1 & 32<=pb2_1_1] | pbl_1_1<=14]] & [[[pil2_1_1<=pi3_1_1 & pol2_1_1<=pi3_1_1] & po2_1_1<=40] & [pb1_1_1<=pi3_1_1 | 21<=pbl_1_1]]]] | [[[21<=pol1_1_1 | pil2_1_1<=pil1_1_1] | [[~ [28<=pil3_1_1] | 7<=pol1_1_1] & 29<=pol1_1_1]] | ~ [pb1_1_1<=pil1_1_1]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[~ [pb1_1_1<=pil1_1_1] | [[29<=pol1_1_1 & [7<=pol1_1_1 | ~ [28<=pil3_1_1]]] | [21<=pol1_1_1 | pil2_1_1<=pil1_1_1]]] | ~ [[[[pb1_1_1<=pi3_1_1 | 21<=pbl_1_1] & [po2_1_1<=40 & [pil2_1_1<=pi3_1_1 & pol2_1_1<=pi3_1_1]]] & [[pbl_1_1<=14 | [po1_1_1<=pol2_1_1 & 32<=pb2_1_1]] & [[14<=pil3_1_1 & 39<=pol3_1_1] & ~ [po3_1_1<=po1_1_1]]]]]]] & [pi2_1_1<=10 | [[pil3_1_1<=47 & [~ [[[pb2_1_1<=30 & po2_1_1<=pil1_1_1] & [34<=pb1_1_1 & 46<=pil2_1_1]]] | [pbl_1_1<=pil2_1_1 | ~ [[42<=pi2_1_1 | pbl_1_1<=6]]]]] | [1<=pi1_1_1 | 13<=pi1_1_1]]]] | [pb3_1_1<=27 | ~ [28<=po1_1_1]]]]]]

abstracting: (28<=po1_1_1)
states: 0
abstracting: (pb3_1_1<=27)
states: 241,024 (5)
abstracting: (13<=pi1_1_1)
states: 0
abstracting: (1<=pi1_1_1)
states: 350,480 (5)
abstracting: (pbl_1_1<=6)
states: 705,712 (5)
abstracting: (42<=pi2_1_1)
states: 0
abstracting: (pbl_1_1<=pil2_1_1)
states: 68,101 (4)
abstracting: (46<=pil2_1_1)
states: 0
abstracting: (34<=pb1_1_1)
states: 419,568 (5)
abstracting: (po2_1_1<=pil1_1_1)
states: 531,656 (5)
abstracting: (pb2_1_1<=30)
states: 263,872 (5)
abstracting: (pil3_1_1<=47)
states: 705,712 (5)
abstracting: (pi2_1_1<=10)
states: 705,712 (5)
abstracting: (po3_1_1<=po1_1_1)
states: 529,288 (5)
abstracting: (39<=pol3_1_1)
states: 0
abstracting: (14<=pil3_1_1)
states: 0
abstracting: (32<=pb2_1_1)
states: 434,352 (5)
abstracting: (po1_1_1<=pol2_1_1)
states: 531,656 (5)
abstracting: (pbl_1_1<=14)
states: 705,712 (5)
abstracting: (pol2_1_1<=pi3_1_1)
states: 526,904 (5)
abstracting: (pil2_1_1<=pi3_1_1)
states: 526,904 (5)
abstracting: (po2_1_1<=40)
states: 705,712 (5)
abstracting: (21<=pbl_1_1)
states: 0
abstracting: (pb1_1_1<=pi3_1_1)
states: 14,160 (4)
abstracting: (pil2_1_1<=pil1_1_1)
states: 529,288 (5)
abstracting: (21<=pol1_1_1)
states: 0
abstracting: (28<=pil3_1_1)
states: 0
abstracting: (7<=pol1_1_1)
states: 0
abstracting: (29<=pol1_1_1)
states: 0
abstracting: (pb1_1_1<=pil1_1_1)
states: 14,192 (4)
-> the formula is TRUE

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

MC time: 0m 0.123sec

checking: EF [[[[~ [5<=pi2_1_1] & [[[~ [[pb3_1_1<=po3_1_1 & 4<=pil3_1_1]] & po1_1_1<=pbl_1_1] | [pol1_1_1<=pol3_1_1 & 4<=pb1_1_1]] & [~ [[[[pb1_1_1<=29 | pi2_1_1<=2] | [pi2_1_1<=22 & 44<=pb2_1_1]] | [[pol2_1_1<=pb2_1_1 & 27<=pi2_1_1] | [po3_1_1<=14 & pol2_1_1<=pol3_1_1]]]] & [9<=pil1_1_1 | po2_1_1<=38]]]] | 10<=pi3_1_1] & ~ [[[[~ [[pol2_1_1<=pi2_1_1 & [pi2_1_1<=pbl_1_1 & pol2_1_1<=pbl_1_1]]] | 16<=pol1_1_1] | [[~ [[~ [po3_1_1<=po2_1_1] | ~ [3<=pi2_1_1]]] | 49<=pil1_1_1] & [pb1_1_1<=po1_1_1 | [[49<=pb3_1_1 | ~ [pil2_1_1<=pol1_1_1]] & 30<=pb2_1_1]]]] | [[7<=pbl_1_1 | ~ [22<=pol1_1_1]] | ~ [[[[[pb2_1_1<=22 | 40<=po3_1_1] | ~ [25<=po2_1_1]] & po1_1_1<=18] & 33<=po3_1_1]]]]]]]
normalized: E [true U [~ [[[~ [[33<=po3_1_1 & [po1_1_1<=18 & [~ [25<=po2_1_1] | [pb2_1_1<=22 | 40<=po3_1_1]]]]] | [7<=pbl_1_1 | ~ [22<=pol1_1_1]]] | [[[pb1_1_1<=po1_1_1 | [30<=pb2_1_1 & [49<=pb3_1_1 | ~ [pil2_1_1<=pol1_1_1]]]] & [49<=pil1_1_1 | ~ [[~ [3<=pi2_1_1] | ~ [po3_1_1<=po2_1_1]]]]] | [16<=pol1_1_1 | ~ [[pol2_1_1<=pi2_1_1 & [pi2_1_1<=pbl_1_1 & pol2_1_1<=pbl_1_1]]]]]]] & [10<=pi3_1_1 | [[[[9<=pil1_1_1 | po2_1_1<=38] & ~ [[[[po3_1_1<=14 & pol2_1_1<=pol3_1_1] | [pol2_1_1<=pb2_1_1 & 27<=pi2_1_1]] | [[pi2_1_1<=22 & 44<=pb2_1_1] | [pb1_1_1<=29 | pi2_1_1<=2]]]]] & [[pol1_1_1<=pol3_1_1 & 4<=pb1_1_1] | [po1_1_1<=pbl_1_1 & ~ [[pb3_1_1<=po3_1_1 & 4<=pil3_1_1]]]]] & ~ [5<=pi2_1_1]]]]]

abstracting: (5<=pi2_1_1)
states: 0
abstracting: (4<=pil3_1_1)
states: 0
abstracting: (pb3_1_1<=po3_1_1)
states: 14,160 (4)
abstracting: (po1_1_1<=pbl_1_1)
states: 705,712 (5)
abstracting: (4<=pb1_1_1)
states: 668,208 (5)
abstracting: (pol1_1_1<=pol3_1_1)
states: 529,288 (5)
abstracting: (pi2_1_1<=2)
states: 705,712 (5)
abstracting: (pb1_1_1<=29)
states: 256,320 (5)
abstracting: (44<=pb2_1_1)
states: 349,488 (5)
abstracting: (pi2_1_1<=22)
states: 705,712 (5)
abstracting: (27<=pi2_1_1)
states: 0
abstracting: (pol2_1_1<=pb2_1_1)
states: 700,960 (5)
abstracting: (pol2_1_1<=pol3_1_1)
states: 529,288 (5)
abstracting: (po3_1_1<=14)
states: 705,712 (5)
abstracting: (po2_1_1<=38)
states: 705,712 (5)
abstracting: (9<=pil1_1_1)
states: 0
abstracting: (10<=pi3_1_1)
states: 0
abstracting: (pol2_1_1<=pbl_1_1)
states: 694,236 (5)
abstracting: (pi2_1_1<=pbl_1_1)
states: 705,712 (5)
abstracting: (pol2_1_1<=pi2_1_1)
states: 526,904 (5)
abstracting: (16<=pol1_1_1)
states: 0
abstracting: (po3_1_1<=po2_1_1)
states: 529,288 (5)
abstracting: (3<=pi2_1_1)
states: 0
abstracting: (49<=pil1_1_1)
states: 0
abstracting: (pil2_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (49<=pb3_1_1)
states: 316,848 (5)
abstracting: (30<=pb2_1_1)
states: 449,392 (5)
abstracting: (pb1_1_1<=po1_1_1)
states: 14,160 (4)
abstracting: (22<=pol1_1_1)
states: 0
abstracting: (7<=pbl_1_1)
states: 0
abstracting: (40<=po3_1_1)
states: 0
abstracting: (pb2_1_1<=22)
states: 201,664 (5)
abstracting: (25<=po2_1_1)
states: 0
abstracting: (po1_1_1<=18)
states: 705,712 (5)
abstracting: (33<=po3_1_1)
states: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.141sec

checking: EF [[~ [[38<=pi2_1_1 | [[[[~ [[pil3_1_1<=43 | 35<=pol1_1_1]] | pi3_1_1<=22] | [~ [4<=pil3_1_1] | ~ [[29<=pil1_1_1 & pol3_1_1<=pil3_1_1]]]] | [[[[pb1_1_1<=pil2_1_1 | po2_1_1<=13] & [2<=po1_1_1 | pil3_1_1<=15]] & [[23<=po2_1_1 & pil2_1_1<=pil2_1_1] | [36<=po1_1_1 | 13<=pol1_1_1]]] | ~ [[pi1_1_1<=pbl_1_1 & ~ [pb1_1_1<=18]]]]] | [[po3_1_1<=24 & [[50<=pol3_1_1 | po2_1_1<=pol2_1_1] | 35<=pb1_1_1]] & [21<=po3_1_1 | [[pol3_1_1<=pol2_1_1 & 21<=pb1_1_1] & pil2_1_1<=pi1_1_1]]]]]] & ~ [[~ [[[[po1_1_1<=44 & [~ [pil3_1_1<=pil1_1_1] & [pi2_1_1<=10 | pil3_1_1<=pi3_1_1]]] | pil2_1_1<=17] & ~ [[[~ [pb2_1_1<=3] | [23<=po2_1_1 | 40<=pb3_1_1]] | [[pil3_1_1<=21 | pol1_1_1<=pol1_1_1] | 29<=pi2_1_1]]]]] & pil2_1_1<=pi2_1_1]]]]
normalized: E [true U [~ [[pil2_1_1<=pi2_1_1 & ~ [[~ [[[29<=pi2_1_1 | [pil3_1_1<=21 | pol1_1_1<=pol1_1_1]] | [[23<=po2_1_1 | 40<=pb3_1_1] | ~ [pb2_1_1<=3]]]] & [pil2_1_1<=17 | [po1_1_1<=44 & [[pi2_1_1<=10 | pil3_1_1<=pi3_1_1] & ~ [pil3_1_1<=pil1_1_1]]]]]]]] & ~ [[38<=pi2_1_1 | [[[21<=po3_1_1 | [pil2_1_1<=pi1_1_1 & [pol3_1_1<=pol2_1_1 & 21<=pb1_1_1]]] & [po3_1_1<=24 & [35<=pb1_1_1 | [50<=pol3_1_1 | po2_1_1<=pol2_1_1]]]] | [[~ [[pi1_1_1<=pbl_1_1 & ~ [pb1_1_1<=18]]] | [[[36<=po1_1_1 | 13<=pol1_1_1] | [23<=po2_1_1 & pil2_1_1<=pil2_1_1]] & [[2<=po1_1_1 | pil3_1_1<=15] & [pb1_1_1<=pil2_1_1 | po2_1_1<=13]]]] | [[~ [[29<=pil1_1_1 & pol3_1_1<=pil3_1_1]] | ~ [4<=pil3_1_1]] | [pi3_1_1<=22 | ~ [[pil3_1_1<=43 | 35<=pol1_1_1]]]]]]]]]]

abstracting: (35<=pol1_1_1)
states: 0
abstracting: (pil3_1_1<=43)
states: 705,712 (5)
abstracting: (pi3_1_1<=22)
states: 705,712 (5)
abstracting: (4<=pil3_1_1)
states: 0
abstracting: (pol3_1_1<=pil3_1_1)
states: 529,288 (5)
abstracting: (29<=pil1_1_1)
states: 0
abstracting: (po2_1_1<=13)
states: 705,712 (5)
abstracting: (pb1_1_1<=pil2_1_1)
states: 14,192 (4)
abstracting: (pil3_1_1<=15)
states: 705,712 (5)
abstracting: (2<=po1_1_1)
states: 0
abstracting: (pil2_1_1<=pil2_1_1)
states: 705,712 (5)
abstracting: (23<=po2_1_1)
states: 0
abstracting: (13<=pol1_1_1)
states: 0
abstracting: (36<=po1_1_1)
states: 0
abstracting: (pb1_1_1<=18)
states: 169,024 (5)
abstracting: (pi1_1_1<=pbl_1_1)
states: 705,712 (5)
abstracting: (po2_1_1<=pol2_1_1)
states: 355,232 (5)
abstracting: (50<=pol3_1_1)
states: 0
abstracting: (35<=pb1_1_1)
states: 412,272 (5)
abstracting: (po3_1_1<=24)
states: 705,712 (5)
abstracting: (21<=pb1_1_1)
states: 520,240 (5)
abstracting: (pol3_1_1<=pol2_1_1)
states: 529,288 (5)
abstracting: (pil2_1_1<=pi1_1_1)
states: 526,904 (5)
abstracting: (21<=po3_1_1)
states: 0
abstracting: (38<=pi2_1_1)
states: 0
abstracting: (pil3_1_1<=pil1_1_1)
states: 529,288 (5)
abstracting: (pil3_1_1<=pi3_1_1)
states: 350,480 (5)
abstracting: (pi2_1_1<=10)
states: 705,712 (5)
abstracting: (po1_1_1<=44)
states: 705,712 (5)
abstracting: (pil2_1_1<=17)
states: 705,712 (5)
abstracting: (pb2_1_1<=3)
states: 37,504 (4)
abstracting: (40<=pb3_1_1)
states: 376,752 (5)
abstracting: (23<=po2_1_1)
states: 0
abstracting: (pol1_1_1<=pol1_1_1)
states: 705,712 (5)
abstracting: (pil3_1_1<=21)
states: 705,712 (5)
abstracting: (29<=pi2_1_1)
states: 0
abstracting: (pil2_1_1<=pi2_1_1)
states: 350,480 (5)
-> the formula is FALSE

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

MC time: 0m 0.048sec

checking: AG [[[[[pil2_1_1<=pb1_1_1 | [[[~ [45<=pil1_1_1] | [[pbl_1_1<=4 & pil1_1_1<=0] | [pi1_1_1<=42 & po3_1_1<=14]]] | [pol1_1_1<=pil2_1_1 & [[22<=pol3_1_1 & pi1_1_1<=pi1_1_1] & ~ [24<=pil1_1_1]]]] & [~ [pb2_1_1<=4] & ~ [[[pol1_1_1<=39 | pi1_1_1<=po3_1_1] | ~ [12<=pol2_1_1]]]]]] & ~ [[[pol3_1_1<=25 | 26<=pol1_1_1] & 19<=pil1_1_1]]] & [[[pi2_1_1<=pbl_1_1 | pi2_1_1<=32] | 25<=pbl_1_1] | [[~ [[[~ [pil3_1_1<=pol1_1_1] & [pi2_1_1<=50 | pol2_1_1<=11]] | [[pi1_1_1<=0 & po1_1_1<=35] | [pi3_1_1<=pi1_1_1 & pi3_1_1<=13]]]] & [[[[pi1_1_1<=pil3_1_1 & 32<=pb3_1_1] | ~ [pol1_1_1<=po1_1_1]] & [[6<=pb1_1_1 & 22<=pol2_1_1] & ~ [pol2_1_1<=21]]] | [pil3_1_1<=pil1_1_1 | [[pi2_1_1<=5 | po3_1_1<=pb3_1_1] | 48<=pb2_1_1]]]] | pil3_1_1<=pol3_1_1]]] & ~ [7<=po2_1_1]]]
normalized: ~ [E [true U ~ [[~ [7<=po2_1_1] & [[[pil3_1_1<=pol3_1_1 | [[[pil3_1_1<=pil1_1_1 | [48<=pb2_1_1 | [pi2_1_1<=5 | po3_1_1<=pb3_1_1]]] | [[~ [pol2_1_1<=21] & [6<=pb1_1_1 & 22<=pol2_1_1]] & [~ [pol1_1_1<=po1_1_1] | [pi1_1_1<=pil3_1_1 & 32<=pb3_1_1]]]] & ~ [[[[pi3_1_1<=pi1_1_1 & pi3_1_1<=13] | [pi1_1_1<=0 & po1_1_1<=35]] | [[pi2_1_1<=50 | pol2_1_1<=11] & ~ [pil3_1_1<=pol1_1_1]]]]]] | [25<=pbl_1_1 | [pi2_1_1<=pbl_1_1 | pi2_1_1<=32]]] & [~ [[19<=pil1_1_1 & [pol3_1_1<=25 | 26<=pol1_1_1]]] & [pil2_1_1<=pb1_1_1 | [[~ [[~ [12<=pol2_1_1] | [pol1_1_1<=39 | pi1_1_1<=po3_1_1]]] & ~ [pb2_1_1<=4]] & [[pol1_1_1<=pil2_1_1 & [~ [24<=pil1_1_1] & [22<=pol3_1_1 & pi1_1_1<=pi1_1_1]]] | [[[pi1_1_1<=42 & po3_1_1<=14] | [pbl_1_1<=4 & pil1_1_1<=0]] | ~ [45<=pil1_1_1]]]]]]]]]]]

abstracting: (45<=pil1_1_1)
states: 0
abstracting: (pil1_1_1<=0)
states: 350,480 (5)
abstracting: (pbl_1_1<=4)
states: 630,741 (5)
abstracting: (po3_1_1<=14)
states: 705,712 (5)
abstracting: (pi1_1_1<=42)
states: 705,712 (5)
abstracting: (pi1_1_1<=pi1_1_1)
states: 705,712 (5)
abstracting: (22<=pol3_1_1)
states: 0
abstracting: (24<=pil1_1_1)
states: 0
abstracting: (pol1_1_1<=pil2_1_1)
states: 529,288 (5)
abstracting: (pb2_1_1<=4)
states: 46,720 (4)
abstracting: (pi1_1_1<=po3_1_1)
states: 529,288 (5)
abstracting: (pol1_1_1<=39)
states: 705,712 (5)
abstracting: (12<=pol2_1_1)
states: 0
abstracting: (pil2_1_1<=pb1_1_1)
states: 700,960 (5)
abstracting: (26<=pol1_1_1)
states: 0
abstracting: (pol3_1_1<=25)
states: 705,712 (5)
abstracting: (19<=pil1_1_1)
states: 0
abstracting: (pi2_1_1<=32)
states: 705,712 (5)
abstracting: (pi2_1_1<=pbl_1_1)
states: 705,712 (5)
abstracting: (25<=pbl_1_1)
states: 0
abstracting: (pil3_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (pol2_1_1<=11)
states: 705,712 (5)
abstracting: (pi2_1_1<=50)
states: 705,712 (5)
abstracting: (po1_1_1<=35)
states: 705,712 (5)
abstracting: (pi1_1_1<=0)
states: 355,232 (5)
abstracting: (pi3_1_1<=13)
states: 705,712 (5)
abstracting: (pi3_1_1<=pi1_1_1)
states: 529,288 (5)
abstracting: (32<=pb3_1_1)
states: 434,352 (5)
abstracting: (pi1_1_1<=pil3_1_1)
states: 531,656 (5)
abstracting: (pol1_1_1<=po1_1_1)
states: 350,480 (5)
abstracting: (22<=pol2_1_1)
states: 0
abstracting: (6<=pb1_1_1)
states: 649,840 (5)
abstracting: (pol2_1_1<=21)
states: 705,712 (5)
abstracting: (po3_1_1<=pb3_1_1)
states: 700,992 (5)
abstracting: (pi2_1_1<=5)
states: 705,712 (5)
abstracting: (48<=pb2_1_1)
states: 323,248 (5)
abstracting: (pil3_1_1<=pil1_1_1)
states: 529,288 (5)
abstracting: (pil3_1_1<=pol3_1_1)
states: 529,288 (5)
abstracting: (7<=po2_1_1)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.161sec

checking: AG [[pi1_1_1<=pbl_1_1 & [[[[[17<=pi3_1_1 & [[~ [pb2_1_1<=28] & [pb3_1_1<=pol2_1_1 | 37<=pil1_1_1]] | 40<=pi3_1_1]] | [[[[4<=pi3_1_1 & pol3_1_1<=16] & pi3_1_1<=pb2_1_1] | po1_1_1<=pil3_1_1] | [pol1_1_1<=pol2_1_1 | [pi1_1_1<=46 & [pil2_1_1<=25 & pil3_1_1<=38]]]]] | [[~ [[~ [18<=po3_1_1] | [29<=pb2_1_1 | pi3_1_1<=32]]] | 41<=pil3_1_1] | [[[pil2_1_1<=pol1_1_1 & ~ [42<=pil3_1_1]] | [[pb3_1_1<=46 & pil1_1_1<=24] | [15<=pol1_1_1 | pi2_1_1<=pil3_1_1]]] & 4<=pil3_1_1]]] | [[[[~ [[5<=po2_1_1 & pil3_1_1<=21]] | [~ [14<=pi3_1_1] & pi1_1_1<=pol2_1_1]] & ~ [[~ [pil2_1_1<=pil3_1_1] | ~ [pbl_1_1<=15]]]] & ~ [pol1_1_1<=3]] & pb3_1_1<=po3_1_1]] & [~ [[~ [[po2_1_1<=pb2_1_1 | [pil3_1_1<=po3_1_1 | 47<=pil1_1_1]]] & [[pol1_1_1<=pb3_1_1 | 46<=pil1_1_1] | [[~ [4<=pil3_1_1] | [pi1_1_1<=pol3_1_1 | pi2_1_1<=43]] | ~ [po1_1_1<=0]]]]] | ~ [[pol2_1_1<=pil1_1_1 & [[[[pb2_1_1<=31 | pi2_1_1<=pb2_1_1] & ~ [5<=pol2_1_1]] | pi1_1_1<=24] & pb1_1_1<=47]]]]]]]
normalized: ~ [E [true U ~ [[pi1_1_1<=pbl_1_1 & [[~ [[pol2_1_1<=pil1_1_1 & [pb1_1_1<=47 & [pi1_1_1<=24 | [~ [5<=pol2_1_1] & [pb2_1_1<=31 | pi2_1_1<=pb2_1_1]]]]]] | ~ [[[[~ [po1_1_1<=0] | [[pi1_1_1<=pol3_1_1 | pi2_1_1<=43] | ~ [4<=pil3_1_1]]] | [pol1_1_1<=pb3_1_1 | 46<=pil1_1_1]] & ~ [[po2_1_1<=pb2_1_1 | [pil3_1_1<=po3_1_1 | 47<=pil1_1_1]]]]]] & [[pb3_1_1<=po3_1_1 & [~ [pol1_1_1<=3] & [~ [[~ [pbl_1_1<=15] | ~ [pil2_1_1<=pil3_1_1]]] & [[pi1_1_1<=pol2_1_1 & ~ [14<=pi3_1_1]] | ~ [[5<=po2_1_1 & pil3_1_1<=21]]]]]] | [[[4<=pil3_1_1 & [[[15<=pol1_1_1 | pi2_1_1<=pil3_1_1] | [pb3_1_1<=46 & pil1_1_1<=24]] | [pil2_1_1<=pol1_1_1 & ~ [42<=pil3_1_1]]]] | [41<=pil3_1_1 | ~ [[[29<=pb2_1_1 | pi3_1_1<=32] | ~ [18<=po3_1_1]]]]] | [[[pol1_1_1<=pol2_1_1 | [pi1_1_1<=46 & [pil2_1_1<=25 & pil3_1_1<=38]]] | [po1_1_1<=pil3_1_1 | [pi3_1_1<=pb2_1_1 & [4<=pi3_1_1 & pol3_1_1<=16]]]] | [17<=pi3_1_1 & [40<=pi3_1_1 | [[pb3_1_1<=pol2_1_1 | 37<=pil1_1_1] & ~ [pb2_1_1<=28]]]]]]]]]]]]

abstracting: (pb2_1_1<=28)
states: 248,704 (5)
abstracting: (37<=pil1_1_1)
states: 0
abstracting: (pb3_1_1<=pol2_1_1)
states: 14,192 (4)
abstracting: (40<=pi3_1_1)
states: 0
abstracting: (17<=pi3_1_1)
states: 0
abstracting: (pol3_1_1<=16)
states: 705,712 (5)
abstracting: (4<=pi3_1_1)
states: 0
abstracting: (pi3_1_1<=pb2_1_1)
states: 700,992 (5)
abstracting: (po1_1_1<=pil3_1_1)
states: 531,656 (5)
abstracting: (pil3_1_1<=38)
states: 705,712 (5)
abstracting: (pil2_1_1<=25)
states: 705,712 (5)
abstracting: (pi1_1_1<=46)
states: 705,712 (5)
abstracting: (pol1_1_1<=pol2_1_1)
states: 529,288 (5)
abstracting: (18<=po3_1_1)
states: 0
abstracting: (pi3_1_1<=32)
states: 705,712 (5)
abstracting: (29<=pb2_1_1)
states: 457,008 (5)
abstracting: (41<=pil3_1_1)
states: 0
abstracting: (42<=pil3_1_1)
states: 0
abstracting: (pil2_1_1<=pol1_1_1)
states: 529,288 (5)
abstracting: (pil1_1_1<=24)
states: 705,712 (5)
abstracting: (pb3_1_1<=46)
states: 376,000 (5)
abstracting: (pi2_1_1<=pil3_1_1)
states: 531,656 (5)
abstracting: (15<=pol1_1_1)
states: 0
abstracting: (4<=pil3_1_1)
states: 0
abstracting: (pil3_1_1<=21)
states: 705,712 (5)
abstracting: (5<=po2_1_1)
states: 0
abstracting: (14<=pi3_1_1)
states: 0
abstracting: (pi1_1_1<=pol2_1_1)
states: 531,656 (5)
abstracting: (pil2_1_1<=pil3_1_1)
states: 529,288 (5)
abstracting: (pbl_1_1<=15)
states: 705,712 (5)
abstracting: (pol1_1_1<=3)
states: 705,712 (5)
abstracting: (pb3_1_1<=po3_1_1)
states: 14,160 (4)
abstracting: (47<=pil1_1_1)
states: 0
abstracting: (pil3_1_1<=po3_1_1)
states: 526,904 (5)
abstracting: (po2_1_1<=pb2_1_1)
states: 700,992 (5)
abstracting: (46<=pil1_1_1)
states: 0
abstracting: (pol1_1_1<=pb3_1_1)
states: 700,960 (5)
abstracting: (4<=pil3_1_1)
states: 0
abstracting: (pi2_1_1<=43)
states: 705,712 (5)
abstracting: (pi1_1_1<=pol3_1_1)
states: 531,656 (5)
abstracting: (po1_1_1<=0)
states: 355,232 (5)
abstracting: (pi2_1_1<=pb2_1_1)
states: 700,992 (5)
abstracting: (pb2_1_1<=31)
states: 271,360 (5)
abstracting: (5<=pol2_1_1)
states: 0
abstracting: (pi1_1_1<=24)
states: 705,712 (5)
abstracting: (pb1_1_1<=47)
states: 382,464 (5)
abstracting: (pol2_1_1<=pil1_1_1)
states: 529,288 (5)
abstracting: (pi1_1_1<=pbl_1_1)
states: 705,712 (5)
-> the formula is FALSE

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

MC time: 0m 0.828sec

checking: EF [[[[[[[[[~ [pb3_1_1<=pil1_1_1] & [44<=po1_1_1 & pb3_1_1<=pb2_1_1]] | [[pil1_1_1<=pb2_1_1 | po3_1_1<=22] | ~ [po1_1_1<=7]]] | [pil1_1_1<=30 & [pi1_1_1<=48 & pi3_1_1<=7]]] | ~ [[~ [[pol1_1_1<=po1_1_1 | pol3_1_1<=8]] & [~ [pil2_1_1<=37] | ~ [pol1_1_1<=50]]]]] | ~ [28<=pol3_1_1]] | [~ [[~ [[po3_1_1<=11 & [10<=pil1_1_1 | 13<=pbl_1_1]]] | [~ [[pbl_1_1<=pb1_1_1 | pi1_1_1<=pol3_1_1]] & ~ [[pil3_1_1<=pi1_1_1 | po1_1_1<=25]]]]] | 13<=pol2_1_1]] & [[pb2_1_1<=17 | [[pol2_1_1<=pi3_1_1 & [~ [[pi2_1_1<=38 | 24<=po1_1_1]] | [[pb2_1_1<=33 & pil1_1_1<=pil2_1_1] & [pol2_1_1<=pil2_1_1 | pol1_1_1<=33]]]] & [7<=pbl_1_1 & ~ [[~ [pi2_1_1<=pil1_1_1] & ~ [pbl_1_1<=34]]]]]] | [pb2_1_1<=pb3_1_1 | [~ [[26<=pil1_1_1 & [~ [10<=pb1_1_1] & [29<=po2_1_1 & po2_1_1<=1]]]] | 37<=pbl_1_1]]]] & [[[[pil2_1_1<=pi3_1_1 & [[[~ [pb3_1_1<=41] & [18<=pil3_1_1 & pi1_1_1<=37]] & [29<=pb3_1_1 & 1<=pb3_1_1]] & ~ [15<=pol3_1_1]]] | [[[[41<=pbl_1_1 | ~ [25<=pol3_1_1]] | [22<=pbl_1_1 | ~ [pil3_1_1<=pol2_1_1]]] & 22<=pb1_1_1] | po3_1_1<=pb2_1_1]] & ~ [pil1_1_1<=pi2_1_1]] & 13<=po2_1_1]]]
normalized: E [true U [[13<=po2_1_1 & [[[pil2_1_1<=pi3_1_1 & [[[29<=pb3_1_1 & 1<=pb3_1_1] & [[18<=pil3_1_1 & pi1_1_1<=37] & ~ [pb3_1_1<=41]]] & ~ [15<=pol3_1_1]]] | [po3_1_1<=pb2_1_1 | [22<=pb1_1_1 & [[41<=pbl_1_1 | ~ [25<=pol3_1_1]] | [22<=pbl_1_1 | ~ [pil3_1_1<=pol2_1_1]]]]]] & ~ [pil1_1_1<=pi2_1_1]]] & [[[pb2_1_1<=pb3_1_1 | [37<=pbl_1_1 | ~ [[26<=pil1_1_1 & [[29<=po2_1_1 & po2_1_1<=1] & ~ [10<=pb1_1_1]]]]]] | [pb2_1_1<=17 | [[7<=pbl_1_1 & ~ [[~ [pbl_1_1<=34] & ~ [pi2_1_1<=pil1_1_1]]]] & [pol2_1_1<=pi3_1_1 & [[[pol2_1_1<=pil2_1_1 | pol1_1_1<=33] & [pb2_1_1<=33 & pil1_1_1<=pil2_1_1]] | ~ [[pi2_1_1<=38 | 24<=po1_1_1]]]]]]] & [[13<=pol2_1_1 | ~ [[[~ [[pil3_1_1<=pi1_1_1 | po1_1_1<=25]] & ~ [[pbl_1_1<=pb1_1_1 | pi1_1_1<=pol3_1_1]]] | ~ [[po3_1_1<=11 & [10<=pil1_1_1 | 13<=pbl_1_1]]]]]] | [~ [28<=pol3_1_1] | [~ [[[~ [pol1_1_1<=50] | ~ [pil2_1_1<=37]] & ~ [[pol1_1_1<=po1_1_1 | pol3_1_1<=8]]]] | [[pil1_1_1<=30 & [pi1_1_1<=48 & pi3_1_1<=7]] | [[~ [po1_1_1<=7] | [pil1_1_1<=pb2_1_1 | po3_1_1<=22]] | [[44<=po1_1_1 & pb3_1_1<=pb2_1_1] & ~ [pb3_1_1<=pil1_1_1]]]]]]]]]]

abstracting: (pb3_1_1<=pil1_1_1)
states: 14,192 (4)
abstracting: (pb3_1_1<=pb2_1_1)
states: 355,232 (5)
abstracting: (44<=po1_1_1)
states: 0
abstracting: (po3_1_1<=22)
states: 705,712 (5)
abstracting: (pil1_1_1<=pb2_1_1)
states: 700,960 (5)
abstracting: (po1_1_1<=7)
states: 705,712 (5)
abstracting: (pi3_1_1<=7)
states: 705,712 (5)
abstracting: (pi1_1_1<=48)
states: 705,712 (5)
abstracting: (pil1_1_1<=30)
states: 705,712 (5)
abstracting: (pol3_1_1<=8)
states: 705,712 (5)
abstracting: (pol1_1_1<=po1_1_1)
states: 350,480 (5)
abstracting: (pil2_1_1<=37)
states: 705,712 (5)
abstracting: (pol1_1_1<=50)
states: 705,712 (5)
abstracting: (28<=pol3_1_1)
states: 0
abstracting: (13<=pbl_1_1)
states: 0
abstracting: (10<=pil1_1_1)
states: 0
abstracting: (po3_1_1<=11)
states: 705,712 (5)
abstracting: (pi1_1_1<=pol3_1_1)
states: 531,656 (5)
abstracting: (pbl_1_1<=pb1_1_1)
states: 677,632 (5)
abstracting: (po1_1_1<=25)
states: 705,712 (5)
abstracting: (pil3_1_1<=pi1_1_1)
states: 526,904 (5)
abstracting: (13<=pol2_1_1)
states: 0
abstracting: (24<=po1_1_1)
states: 0
abstracting: (pi2_1_1<=38)
states: 705,712 (5)
abstracting: (pil1_1_1<=pil2_1_1)
states: 529,288 (5)
abstracting: (pb2_1_1<=33)
states: 286,144 (5)
abstracting: (pol1_1_1<=33)
states: 705,712 (5)
abstracting: (pol2_1_1<=pil2_1_1)
states: 529,288 (5)
abstracting: (pol2_1_1<=pi3_1_1)
states: 526,904 (5)
abstracting: (pi2_1_1<=pil1_1_1)
states: 531,656 (5)
abstracting: (pbl_1_1<=34)
states: 705,712 (5)
abstracting: (7<=pbl_1_1)
states: 0
abstracting: (pb2_1_1<=17)
states: 160,704 (5)
abstracting: (10<=pb1_1_1)
states: 613,872 (5)
abstracting: (po2_1_1<=1)
states: 705,712 (5)
abstracting: (29<=po2_1_1)
states: 0
abstracting: (26<=pil1_1_1)
states: 0
abstracting: (37<=pbl_1_1)
states: 0
abstracting: (pb2_1_1<=pb3_1_1)
states: 355,232 (5)
abstracting: (pil1_1_1<=pi2_1_1)
states: 526,904 (5)
abstracting: (pil3_1_1<=pol2_1_1)
states: 529,288 (5)
abstracting: (22<=pbl_1_1)
states: 0
abstracting: (25<=pol3_1_1)
states: 0
abstracting: (41<=pbl_1_1)
states: 0
abstracting: (22<=pb1_1_1)
states: 512,112 (5)
abstracting: (po3_1_1<=pb2_1_1)
states: 700,992 (5)
abstracting: (15<=pol3_1_1)
states: 0
abstracting: (pb3_1_1<=41)
states: 342,720 (5)
abstracting: (pi1_1_1<=37)
states: 705,712 (5)
abstracting: (18<=pil3_1_1)
states: 0
abstracting: (1<=pb3_1_1)
states: 696,240 (5)
abstracting: (29<=pb3_1_1)
states: 457,008 (5)
abstracting: (pil2_1_1<=pi3_1_1)
states: 526,904 (5)
abstracting: (13<=po2_1_1)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.165sec

totally nodes used: 221564 (2.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 31340966 748335 32089301
used/not used/entry size/cache size: 802371 66306493 16 1024MB
basic ops cache: hits/miss/sum: 7638869 721392 8360261
used/not used/entry size/cache size: 1003899 15773317 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: 1264839 34871 1299710
used/not used/entry size/cache size: 34819 8353789 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 66964237
1 130703
2 10131
3 2595
4 790
5 4
6 4
7 5
8 6
9 3
>= 10 386

Total processing time: 0m 7.298sec


BK_STOP 1679326269669

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


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

initing FirstDep: 0m 0.000sec


iterations count:924 (77), effective:390 (32)

iterations count:1061 (88), effective:448 (37)

iterations count:2950 (245), effective:758 (63)

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="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is TriangularGrid-PT-1500, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r490-tall-167912709000718"
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 [ "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 ;