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-167912709000726.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-2011, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709000726
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.7K Feb 26 01:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:37 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.0K Feb 25 17:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 13K Feb 26 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 01:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:38 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 33K 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-2011-ReachabilityCardinality-00
FORMULA_NAME TriangularGrid-PT-2011-ReachabilityCardinality-01
FORMULA_NAME TriangularGrid-PT-2011-ReachabilityCardinality-02
FORMULA_NAME TriangularGrid-PT-2011-ReachabilityCardinality-03
FORMULA_NAME TriangularGrid-PT-2011-ReachabilityCardinality-04
FORMULA_NAME TriangularGrid-PT-2011-ReachabilityCardinality-05
FORMULA_NAME TriangularGrid-PT-2011-ReachabilityCardinality-06
FORMULA_NAME TriangularGrid-PT-2011-ReachabilityCardinality-07
FORMULA_NAME TriangularGrid-PT-2011-ReachabilityCardinality-08
FORMULA_NAME TriangularGrid-PT-2011-ReachabilityCardinality-09
FORMULA_NAME TriangularGrid-PT-2011-ReachabilityCardinality-10
FORMULA_NAME TriangularGrid-PT-2011-ReachabilityCardinality-11
FORMULA_NAME TriangularGrid-PT-2011-ReachabilityCardinality-12
FORMULA_NAME TriangularGrid-PT-2011-ReachabilityCardinality-13
FORMULA_NAME TriangularGrid-PT-2011-ReachabilityCardinality-14
FORMULA_NAME TriangularGrid-PT-2011-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679326435019

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-2011
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 15:33:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 15:33:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 15:33:56] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-20 15:33:56] [INFO ] Transformed 52 places.
[2023-03-20 15:33:56] [INFO ] Transformed 42 transitions.
[2023-03-20 15:33:56] [INFO ] Parsed PT model containing 52 places and 42 transitions and 168 arcs in 104 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 10 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 12) seen :4
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 42 rows 52 cols
[2023-03-20 15:33:57] [INFO ] Computed 23 place invariants in 12 ms
[2023-03-20 15:33:57] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 15:33:57] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-20 15:33:57] [INFO ] [Nat]Absence check using 22 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 15:33:57] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 1421 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_2011
(NrP: 52 NrTr: 42 NrArc: 168)

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

net check time: 0m 0.000sec

init dd package: 0m 2.695sec


RS generation: 0m 0.057sec


-> reachability set: #nodes 968 (9.7e+02) #states 940,096,149 (8)



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

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

abstracting: (pil1_2_1<=1)
states: 940,096,149 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (pi3_2_3<=1)
states: 940,096,149 (8)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [pi3_2_3<=1]
normalized: E [true U pi3_2_3<=1]

abstracting: (pi3_2_3<=1)
states: 940,096,149 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

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

abstracting: (pol2_1_1<=1)
states: 940,096,149 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (pol1_2_3<=pi1_2_3)
states: 480,159,639 (8)
-> the formula is FALSE

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

MC time: 0m 0.024sec

checking: EF [~ [po1_2_1<=pb1_2_2]]
normalized: E [true U ~ [po1_2_1<=pb1_2_2]]

abstracting: (po1_2_1<=pb1_2_2)
states: 762,408,057 (8)
-> the formula is TRUE

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

MC time: 0m 0.094sec

checking: EF [[pb2_2_3<=1 & ~ [[[[[~ [[~ [pol1_2_3<=po1_2_1] & [pol1_2_1<=0 & pb1_2_1<=0]]] | ~ [pb1_2_2<=1]] | [~ [pbl_2_2<=1] & pb1_2_1<=1]] & [pi3_2_3<=0 & pil3_2_1<=po2_1_1]] | pol3_1_1<=1]]]]
normalized: E [true U [~ [[[[pi3_2_3<=0 & pil3_2_1<=po2_1_1] & [[~ [pbl_2_2<=1] & pb1_2_1<=1] | [~ [pb1_2_2<=1] | ~ [[[pol1_2_1<=0 & pb1_2_1<=0] & ~ [pol1_2_3<=po1_2_1]]]]]] | pol3_1_1<=1]] & pb2_2_3<=1]]

abstracting: (pb2_2_3<=1)
states: 819,204,983 (8)
abstracting: (pol3_1_1<=1)
states: 940,096,149 (8)
abstracting: (pol1_2_3<=po1_2_1)
states: 480,151,719 (8)
abstracting: (pb1_2_1<=0)
states: 578,585,747 (8)
abstracting: (pol1_2_1<=0)
states: 279,738,317 (8)
abstracting: (pb1_2_2<=1)
states: 819,205,245 (8)
abstracting: (pb1_2_1<=1)
states: 819,204,983 (8)
abstracting: (pbl_2_2<=1)
states: 241,707,975 (8)
abstracting: (pil3_2_1<=po2_1_1)
states: 480,143,799 (8)
abstracting: (pi3_2_3<=0)
states: 660,357,832 (8)
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [[[[~ [[1<=po2_2_1 & ~ [pol1_1_1<=1]]] | ~ [[[[~ [po2_2_1<=1] & [~ [pil1_2_1<=0] & po3_1_1<=pol1_2_1]] & ~ [[[pi2_1_1<=1 & pol3_2_3<=0] & pb3_2_2<=po3_2_1]]] | ~ [1<=pb3_1_1]]]] | pi3_2_3<=pil3_2_3] & pi2_1_1<=1]]
normalized: ~ [E [true U ~ [[[[~ [[~ [1<=pb3_1_1] | [~ [[[pi2_1_1<=1 & pol3_2_3<=0] & pb3_2_2<=po3_2_1]] & [[~ [pil1_2_1<=0] & po3_1_1<=pol1_2_1] & ~ [po2_2_1<=1]]]]] | ~ [[~ [pol1_1_1<=1] & 1<=po2_2_1]]] | pi3_2_3<=pil3_2_3] & pi2_1_1<=1]]]]

abstracting: (pi2_1_1<=1)
states: 940,096,149 (8)
abstracting: (pi3_2_3<=pil3_2_3)
states: 660,357,832 (8)
abstracting: (1<=po2_2_1)
states: 279,747,756 (8)
abstracting: (pol1_1_1<=1)
states: 940,096,149 (8)
abstracting: (po2_2_1<=1)
states: 940,096,149 (8)
abstracting: (po3_1_1<=pol1_2_1)
states: 860,761,795 (8)
abstracting: (pil1_2_1<=0)
states: 279,738,317 (8)
abstracting: (pb3_2_2<=po3_2_1)
states: 648,271,719 (8)
abstracting: (pol3_2_3<=0)
states: 279,738,317 (8)
abstracting: (pi2_1_1<=1)
states: 940,096,149 (8)
abstracting: (1<=pb3_1_1)
states: 361,499,225 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [~ [[~ [[[1<=po2_2_3 | ~ [[pb2_1_1<=1 & [pil1_1_1<=pb2_2_3 | pil1_2_3<=pol1_1_1]]]] & ~ [[[pb2_2_1<=1 | ~ [1<=pi3_1_1]] & [~ [1<=pi1_1_1] | [pol2_1_1<=pol2_2_1 & pb1_2_2<=1]]]]]] | [pol1_2_3<=1 | [pi1_1_1<=1 | ~ [pi2_2_1<=po3_2_1]]]]]]
normalized: E [true U ~ [[[pol1_2_3<=1 | [pi1_1_1<=1 | ~ [pi2_2_1<=po3_2_1]]] | ~ [[~ [[[[pol2_1_1<=pol2_2_1 & pb1_2_2<=1] | ~ [1<=pi1_1_1]] & [pb2_2_1<=1 | ~ [1<=pi3_1_1]]]] & [1<=po2_2_3 | ~ [[pb2_1_1<=1 & [pil1_1_1<=pb2_2_3 | pil1_2_3<=pol1_1_1]]]]]]]]]

abstracting: (pil1_2_3<=pol1_1_1)
states: 739,692,186 (8)
abstracting: (pil1_1_1<=pb2_2_3)
states: 539,198,254 (8)
abstracting: (pb2_1_1<=1)
states: 819,204,983 (8)
abstracting: (1<=po2_2_3)
states: 279,738,317 (8)
abstracting: (1<=pi3_1_1)
states: 279,747,756 (8)
abstracting: (pb2_2_1<=1)
states: 819,216,160 (8)
abstracting: (1<=pi1_1_1)
states: 279,738,317 (8)
abstracting: (pb1_2_2<=1)
states: 819,205,245 (8)
abstracting: (pol2_1_1<=pol2_2_1)
states: 739,682,747 (8)
abstracting: (pi2_2_1<=po3_2_1)
states: 739,682,747 (8)
abstracting: (pi1_1_1<=1)
states: 940,096,149 (8)
abstracting: (pol1_2_3<=1)
states: 940,096,149 (8)
-> the formula is FALSE

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

MC time: 0m 0.014sec

checking: EF [[~ [pil2_2_1<=1] & [pi1_2_3<=0 & [[[pbl_2_2<=1 & [[[[1<=pb1_1_1 & pol3_2_3<=pil1_1_1] | 1<=pil2_1_1] | [[1<=pi1_2_1 & pi1_1_1<=pil3_2_1] & pb1_1_1<=1]] | ~ [[pb3_2_1<=0 & [pil3_1_1<=1 & 1<=pi2_1_1]]]]] | ~ [[[[~ [po1_1_1<=1] | pb2_2_1<=0] | ~ [pol2_2_1<=1]] | ~ [pil3_2_3<=1]]]] & 1<=pi3_1_1]]]]
normalized: E [true U [[pi1_2_3<=0 & [1<=pi3_1_1 & [~ [[~ [pil3_2_3<=1] | [~ [pol2_2_1<=1] | [pb2_2_1<=0 | ~ [po1_1_1<=1]]]]] | [pbl_2_2<=1 & [~ [[pb3_2_1<=0 & [pil3_1_1<=1 & 1<=pi2_1_1]]] | [[pb1_1_1<=1 & [1<=pi1_2_1 & pi1_1_1<=pil3_2_1]] | [1<=pil2_1_1 | [1<=pb1_1_1 & pol3_2_3<=pil1_1_1]]]]]]]] & ~ [pil2_2_1<=1]]]

abstracting: (pil2_2_1<=1)
states: 940,096,149 (8)
abstracting: (pol3_2_3<=pil1_1_1)
states: 739,690,667 (8)
abstracting: (1<=pb1_1_1)
states: 361,510,402 (8)
abstracting: (1<=pil2_1_1)
states: 660,357,832 (8)
abstracting: (pi1_1_1<=pil3_2_1)
states: 860,763,314 (8)
abstracting: (1<=pi1_2_1)
states: 279,738,317 (8)
abstracting: (pb1_1_1<=1)
states: 819,204,983 (8)
abstracting: (1<=pi2_1_1)
states: 279,738,317 (8)
abstracting: (pil3_1_1<=1)
states: 940,096,149 (8)
abstracting: (pb3_2_1<=0)
states: 578,585,747 (8)
abstracting: (pbl_2_2<=1)
states: 241,707,975 (8)
abstracting: (po1_1_1<=1)
states: 940,096,149 (8)
abstracting: (pb2_2_1<=0)
states: 578,596,924 (8)
abstracting: (pol2_2_1<=1)
states: 940,096,149 (8)
abstracting: (pil3_2_3<=1)
states: 940,096,149 (8)
abstracting: (1<=pi3_1_1)
states: 279,747,756 (8)
abstracting: (pi1_2_3<=0)
states: 660,348,393 (8)
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [~ [[~ [1<=pol3_1_1] & [~ [[~ [[[[pb2_2_2<=1 & 1<=pol1_2_3] | pb1_2_2<=0] & [1<=pol2_1_1 & po3_2_3<=po1_2_3]]] & ~ [[~ [po3_2_1<=0] | ~ [[pi2_1_1<=0 & 1<=pil1_2_1]]]]]] & [[pb1_2_1<=po1_2_3 & ~ [[~ [[1<=po2_1_1 & pi2_2_3<=pol1_2_3]] & pil1_2_3<=pb1_2_1]]] & pol3_2_3<=pbl_2_1]]]]]
normalized: E [true U ~ [[[[pol3_2_3<=pbl_2_1 & [pb1_2_1<=po1_2_3 & ~ [[pil1_2_3<=pb1_2_1 & ~ [[1<=po2_1_1 & pi2_2_3<=pol1_2_3]]]]]] & ~ [[~ [[~ [[pi2_1_1<=0 & 1<=pil1_2_1]] | ~ [po3_2_1<=0]]] & ~ [[[1<=pol2_1_1 & po3_2_3<=po1_2_3] & [pb1_2_2<=0 | [pb2_2_2<=1 & 1<=pol1_2_3]]]]]]] & ~ [1<=pol3_1_1]]]]

abstracting: (1<=pol3_1_1)
states: 660,348,393 (8)
abstracting: (1<=pol1_2_3)
states: 660,348,393 (8)
abstracting: (pb2_2_2<=1)
states: 819,205,245 (8)
abstracting: (pb1_2_2<=0)
states: 578,587,725 (8)
abstracting: (po3_2_3<=po1_2_3)
states: 739,692,186 (8)
abstracting: (1<=pol2_1_1)
states: 660,357,832 (8)
abstracting: (po3_2_1<=0)
states: 660,357,832 (8)
abstracting: (1<=pil1_2_1)
states: 660,357,832 (8)
abstracting: (pi2_1_1<=0)
states: 660,357,832 (8)
abstracting: (pi2_2_3<=pol1_2_3)
states: 860,761,795 (8)
abstracting: (1<=po2_1_1)
states: 279,738,317 (8)
abstracting: (pil1_2_3<=pb1_2_1)
states: 539,205,955 (8)
abstracting: (pb1_2_1<=po1_2_3)
states: 648,271,457 (8)
abstracting: (pol3_2_3<=pbl_2_1)
states: 876,857,008 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.064sec

checking: AG [[[~ [[[~ [[[[po3_2_3<=1 & 1<=pb1_2_1] | [po2_2_3<=pb1_2_3 | 1<=pil1_2_3]] | 1<=pi1_2_3]] & [[[~ [1<=pbl_2_2] | [1<=pol2_2_3 & pol1_2_1<=pbl_2_2]] & [pb2_2_2<=pol3_2_3 & pi1_2_1<=pol3_1_1]] | [[[po2_2_3<=pol1_1_1 & pb1_2_3<=1] & po2_1_1<=pi1_2_3] & pbl_2_3<=1]]] & pb1_2_3<=pb3_1_1]] | pi1_1_1<=1] | [pol1_1_1<=0 | pb2_2_2<=1]]]
normalized: ~ [E [true U ~ [[[pol1_1_1<=0 | pb2_2_2<=1] | [pi1_1_1<=1 | ~ [[pb1_2_3<=pb3_1_1 & [[[pbl_2_3<=1 & [po2_1_1<=pi1_2_3 & [po2_2_3<=pol1_1_1 & pb1_2_3<=1]]] | [[pb2_2_2<=pol3_2_3 & pi1_2_1<=pol3_1_1] & [[1<=pol2_2_3 & pol1_2_1<=pbl_2_2] | ~ [1<=pbl_2_2]]]] & ~ [[1<=pi1_2_3 | [[po2_2_3<=pb1_2_3 | 1<=pil1_2_3] | [po3_2_3<=1 & 1<=pb1_2_1]]]]]]]]]]]]

abstracting: (1<=pb1_2_1)
states: 361,510,402 (8)
abstracting: (po3_2_3<=1)
states: 940,096,149 (8)
abstracting: (1<=pil1_2_3)
states: 660,348,393 (8)
abstracting: (po2_2_3<=pb1_2_3)
states: 762,398,858 (8)
abstracting: (1<=pi1_2_3)
states: 279,747,756 (8)
abstracting: (1<=pbl_2_2)
states: 856,556,304 (8)
abstracting: (pol1_2_1<=pbl_2_2)
states: 876,847,584 (8)
abstracting: (1<=pol2_2_3)
states: 660,357,832 (8)
abstracting: (pi1_2_1<=pol3_1_1)
states: 860,761,795 (8)
abstracting: (pb2_2_2<=pol3_2_3)
states: 749,521,251 (8)
abstracting: (pb1_2_3<=1)
states: 819,216,160 (8)
abstracting: (po2_2_3<=pol1_1_1)
states: 860,763,314 (8)
abstracting: (po2_1_1<=pi1_2_3)
states: 739,692,186 (8)
abstracting: (pbl_2_3<=1)
states: 241,697,013 (8)
abstracting: (pb1_2_3<=pb3_1_1)
states: 678,375,039 (8)
abstracting: (pi1_1_1<=1)
states: 940,096,149 (8)
abstracting: (pb2_2_2<=1)
states: 819,205,245 (8)
abstracting: (pol1_1_1<=0)
states: 279,738,317 (8)
-> the formula is TRUE

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

MC time: 0m 0.012sec

checking: EF [[[~ [[[~ [pil2_2_3<=0] | pi3_2_3<=pol3_1_1] | [[~ [[[1<=po2_2_3 | pi2_1_1<=0] & [po2_2_3<=1 | pil2_2_3<=1]]] & [[[pi3_2_3<=pol2_2_1 & pi1_2_1<=pb3_1_1] | [pol2_2_1<=pol3_1_1 & pi2_2_3<=pol2_2_3]] & [pil1_2_1<=0 & [1<=pol2_2_1 | pil2_2_3<=0]]]] | pol1_2_3<=0]]] | ~ [pil3_1_1<=1]] | [~ [[[~ [[~ [1<=pol3_1_1] & ~ [1<=pil3_1_1]]] | [[[~ [pb3_2_1<=0] | 1<=pol2_2_3] | pb1_2_2<=1] & ~ [pi1_2_1<=pil1_2_3]]] | pol3_1_1<=pil2_1_1]] & ~ [[~ [1<=pol3_2_1] | 1<=pol2_2_1]]]]]
normalized: E [true U [[~ [[pol3_1_1<=pil2_1_1 | [~ [[~ [1<=pol3_1_1] & ~ [1<=pil3_1_1]]] | [~ [pi1_2_1<=pil1_2_3] & [pb1_2_2<=1 | [1<=pol2_2_3 | ~ [pb3_2_1<=0]]]]]]] & ~ [[1<=pol2_2_1 | ~ [1<=pol3_2_1]]]] | [~ [[[pi3_2_3<=pol3_1_1 | ~ [pil2_2_3<=0]] | [pol1_2_3<=0 | [[[[pi3_2_3<=pol2_2_1 & pi1_2_1<=pb3_1_1] | [pol2_2_1<=pol3_1_1 & pi2_2_3<=pol2_2_3]] & [pil1_2_1<=0 & [1<=pol2_2_1 | pil2_2_3<=0]]] & ~ [[[1<=po2_2_3 | pi2_1_1<=0] & [po2_2_3<=1 | pil2_2_3<=1]]]]]]] | ~ [pil3_1_1<=1]]]]

abstracting: (pil3_1_1<=1)
states: 940,096,149 (8)
abstracting: (pil2_2_3<=1)
states: 940,096,149 (8)
abstracting: (po2_2_3<=1)
states: 940,096,149 (8)
abstracting: (pi2_1_1<=0)
states: 660,357,832 (8)
abstracting: (1<=po2_2_3)
states: 279,738,317 (8)
abstracting: (pil2_2_3<=0)
states: 279,738,317 (8)
abstracting: (1<=pol2_2_1)
states: 660,348,393 (8)
abstracting: (pil1_2_1<=0)
states: 279,738,317 (8)
abstracting: (pi2_2_3<=pol2_2_3)
states: 860,771,234 (8)
abstracting: (pol2_2_1<=pol3_1_1)
states: 739,684,266 (8)
abstracting: (pi1_2_1<=pb3_1_1)
states: 762,406,559 (8)
abstracting: (pi3_2_3<=pol2_2_1)
states: 860,761,795 (8)
abstracting: (pol1_2_3<=0)
states: 279,747,756 (8)
abstracting: (pil2_2_3<=0)
states: 279,738,317 (8)
abstracting: (pi3_2_3<=pol3_1_1)
states: 860,761,795 (8)
abstracting: (1<=pol3_2_1)
states: 660,357,832 (8)
abstracting: (1<=pol2_2_1)
states: 660,348,393 (8)
abstracting: (pb3_2_1<=0)
states: 578,585,747 (8)
abstracting: (1<=pol2_2_3)
states: 660,357,832 (8)
abstracting: (pb1_2_2<=1)
states: 819,205,245 (8)
abstracting: (pi1_2_1<=pil1_2_3)
states: 860,761,795 (8)
abstracting: (1<=pil3_1_1)
states: 660,348,393 (8)
abstracting: (1<=pol3_1_1)
states: 660,348,393 (8)
abstracting: (pol3_1_1<=pil2_1_1)
states: 739,692,186 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.104sec

checking: EF [~ [[[[[~ [[[[pbl_2_2<=pi2_1_1 | pbl_1_1<=pbl_2_3] | [pi3_2_1<=1 & pb1_1_1<=pol2_1_1]] | [[pb1_1_1<=1 | pb3_2_3<=1] | pol3_2_1<=1]]] & [~ [pol2_1_1<=pil1_1_1] & [[[pil3_1_1<=po1_1_1 & po1_2_3<=pil1_2_3] | [1<=pil3_2_3 | 1<=pb3_2_3]] | pb1_2_1<=1]]] & ~ [1<=pbl_1_1]] | [[1<=pi1_1_1 | ~ [[[1<=pbl_2_1 | ~ [pol1_2_1<=pi1_2_1]] & ~ [1<=pil2_1_1]]]] & pi3_2_3<=0]] & [pil2_2_3<=1 | [1<=pbl_2_2 | [[[1<=pi1_2_1 | [[1<=pbl_1_1 | pb3_2_2<=pb1_2_3] & [pb2_2_3<=pol3_2_1 & pil3_1_1<=0]]] | pi3_1_1<=1] | ~ [[[1<=po1_1_1 & po1_1_1<=pi1_1_1] & pil1_2_1<=pb3_2_2]]]]]]]]
normalized: E [true U ~ [[[pil2_2_3<=1 | [1<=pbl_2_2 | [~ [[pil1_2_1<=pb3_2_2 & [1<=po1_1_1 & po1_1_1<=pi1_1_1]]] | [pi3_1_1<=1 | [1<=pi1_2_1 | [[pb2_2_3<=pol3_2_1 & pil3_1_1<=0] & [1<=pbl_1_1 | pb3_2_2<=pb1_2_3]]]]]]] & [[pi3_2_3<=0 & [1<=pi1_1_1 | ~ [[~ [1<=pil2_1_1] & [1<=pbl_2_1 | ~ [pol1_2_1<=pi1_2_1]]]]]] | [~ [1<=pbl_1_1] & [[[pb1_2_1<=1 | [[1<=pil3_2_3 | 1<=pb3_2_3] | [pil3_1_1<=po1_1_1 & po1_2_3<=pil1_2_3]]] & ~ [pol2_1_1<=pil1_1_1]] & ~ [[[pol3_2_1<=1 | [pb1_1_1<=1 | pb3_2_3<=1]] | [[pi3_2_1<=1 & pb1_1_1<=pol2_1_1] | [pbl_2_2<=pi2_1_1 | pbl_1_1<=pbl_2_3]]]]]]]]]]

abstracting: (pbl_1_1<=pbl_2_3)
states: 562,020,056 (8)
abstracting: (pbl_2_2<=pi2_1_1)
states: 125,705,355 (8)
abstracting: (pb1_1_1<=pol2_1_1)
states: 749,519,273 (8)
abstracting: (pi3_2_1<=1)
states: 940,096,149 (8)
abstracting: (pb3_2_3<=1)
states: 819,204,983 (8)
abstracting: (pb1_1_1<=1)
states: 819,204,983 (8)
abstracting: (pol3_2_1<=1)
states: 940,096,149 (8)
abstracting: (pol2_1_1<=pil1_1_1)
states: 739,682,747 (8)
abstracting: (po1_2_3<=pil1_2_3)
states: 860,760,276 (8)
abstracting: (pil3_1_1<=po1_1_1)
states: 480,151,719 (8)
abstracting: (1<=pb3_2_3)
states: 361,510,402 (8)
abstracting: (1<=pil3_2_3)
states: 660,357,832 (8)
abstracting: (pb1_2_1<=1)
states: 819,204,983 (8)
abstracting: (1<=pbl_1_1)
states: 856,567,466 (8)
abstracting: (pol1_2_1<=pi1_2_1)
states: 480,151,719 (8)
abstracting: (1<=pbl_2_1)
states: 856,567,466 (8)
abstracting: (1<=pil2_1_1)
states: 660,357,832 (8)
abstracting: (1<=pi1_1_1)
states: 279,738,317 (8)
abstracting: (pi3_2_3<=0)
states: 660,357,832 (8)
abstracting: (pb3_2_2<=pb1_2_3)
states: 678,365,601 (8)
abstracting: (1<=pbl_1_1)
states: 856,567,466 (8)
abstracting: (pil3_1_1<=0)
states: 279,747,756 (8)
abstracting: (pb2_2_3<=pol3_2_1)
states: 749,520,771 (8)
abstracting: (1<=pi1_2_1)
states: 279,738,317 (8)
abstracting: (pi3_1_1<=1)
states: 940,096,149 (8)
abstracting: (po1_1_1<=pi1_1_1)
states: 739,682,747 (8)
abstracting: (1<=po1_1_1)
states: 279,738,317 (8)
abstracting: (pil1_2_1<=pb3_2_2)
states: 539,196,516 (8)
abstracting: (1<=pbl_2_2)
states: 856,556,304 (8)
abstracting: (pil2_2_3<=1)
states: 940,096,149 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.091sec

checking: AG [[[[[1<=pb3_1_1 & ~ [[[[[pb3_2_3<=pi1_2_1 & po1_1_1<=1] & [1<=pol2_2_3 | 1<=pbl_2_1]] | ~ [po2_1_1<=0]] & pb1_2_3<=1]]] & [[pi3_2_1<=pol2_2_1 & [po3_2_1<=0 | [~ [pi3_2_3<=1] | [1<=po2_2_3 | [pol1_2_3<=pb2_2_2 & pb1_2_2<=1]]]]] & [~ [[[~ [pol3_2_3<=pil3_1_1] | [pi2_1_1<=pbl_2_1 & 1<=pi2_2_1]] & pbl_2_1<=pb3_2_2]] & [~ [pil1_1_1<=pbl_1_1] | [[po3_2_1<=pi2_2_1 & [1<=pol3_2_3 & pol1_2_1<=pil2_2_3]] | [1<=pb3_1_1 & 1<=po1_2_1]]]]]] | [[[~ [[[[po3_2_1<=pol2_2_3 & pil1_1_1<=1] & [1<=pi2_1_1 | pi1_2_1<=pil2_1_1]] | ~ [pi2_2_3<=0]]] & ~ [[[pol2_2_1<=pbl_2_3 & pi3_2_3<=pol1_2_1] & po3_1_1<=1]]] | [~ [1<=pi1_2_3] & [~ [1<=pb2_2_2] & [[[pil2_1_1<=pi3_2_1 | pbl_1_1<=0] | 1<=pi1_1_1] & [1<=pb1_2_2 & pb1_2_1<=pil1_2_1]]]]] | [[[pbl_2_1<=0 & [[pol3_2_3<=0 & ~ [1<=po2_1_1]] | pi2_1_1<=pil2_2_1]] & [[[[pb3_2_2<=pb1_2_1 | po2_2_1<=0] | [pil1_1_1<=1 | po2_2_3<=pbl_1_1]] & ~ [pb3_2_3<=0]] | ~ [pb2_2_2<=po1_1_1]]] & pil2_2_3<=1]]] | pb1_2_3<=pb2_2_3]]
normalized: ~ [E [true U ~ [[pb1_2_3<=pb2_2_3 | [[[pil2_2_3<=1 & [[~ [pb2_2_2<=po1_1_1] | [~ [pb3_2_3<=0] & [[pil1_1_1<=1 | po2_2_3<=pbl_1_1] | [pb3_2_2<=pb1_2_1 | po2_2_1<=0]]]] & [pbl_2_1<=0 & [pi2_1_1<=pil2_2_1 | [pol3_2_3<=0 & ~ [1<=po2_1_1]]]]]] | [[[[[1<=pb1_2_2 & pb1_2_1<=pil1_2_1] & [1<=pi1_1_1 | [pil2_1_1<=pi3_2_1 | pbl_1_1<=0]]] & ~ [1<=pb2_2_2]] & ~ [1<=pi1_2_3]] | [~ [[po3_1_1<=1 & [pol2_2_1<=pbl_2_3 & pi3_2_3<=pol1_2_1]]] & ~ [[~ [pi2_2_3<=0] | [[1<=pi2_1_1 | pi1_2_1<=pil2_1_1] & [po3_2_1<=pol2_2_3 & pil1_1_1<=1]]]]]]] | [[[[[[1<=pb3_1_1 & 1<=po1_2_1] | [po3_2_1<=pi2_2_1 & [1<=pol3_2_3 & pol1_2_1<=pil2_2_3]]] | ~ [pil1_1_1<=pbl_1_1]] & ~ [[pbl_2_1<=pb3_2_2 & [[pi2_1_1<=pbl_2_1 & 1<=pi2_2_1] | ~ [pol3_2_3<=pil3_1_1]]]]] & [pi3_2_1<=pol2_2_1 & [po3_2_1<=0 | [[1<=po2_2_3 | [pol1_2_3<=pb2_2_2 & pb1_2_2<=1]] | ~ [pi3_2_3<=1]]]]] & [1<=pb3_1_1 & ~ [[pb1_2_3<=1 & [~ [po2_1_1<=0] | [[1<=pol2_2_3 | 1<=pbl_2_1] & [pb3_2_3<=pi1_2_1 & po1_1_1<=1]]]]]]]]]]]]

abstracting: (po1_1_1<=1)
states: 940,096,149 (8)
abstracting: (pb3_2_3<=pi1_2_1)
states: 648,269,959 (8)
abstracting: (1<=pbl_2_1)
states: 856,567,466 (8)
abstracting: (1<=pol2_2_3)
states: 660,357,832 (8)
abstracting: (po2_1_1<=0)
states: 660,357,832 (8)
abstracting: (pb1_2_3<=1)
states: 819,216,160 (8)
abstracting: (1<=pb3_1_1)
states: 361,499,225 (8)
abstracting: (pi3_2_3<=1)
states: 940,096,149 (8)
abstracting: (pb1_2_2<=1)
states: 819,205,245 (8)
abstracting: (pol1_2_3<=pb2_2_2)
states: 539,204,217 (8)
abstracting: (1<=po2_2_3)
states: 279,738,317 (8)
abstracting: (po3_2_1<=0)
states: 660,357,832 (8)
abstracting: (pi3_2_1<=pol2_2_1)
states: 860,761,795 (8)
abstracting: (pol3_2_3<=pil3_1_1)
states: 739,682,747 (8)
abstracting: (1<=pi2_2_1)
states: 279,747,756 (8)
abstracting: (pi2_1_1<=pbl_2_1)
states: 919,806,607 (8)
abstracting: (pbl_2_1<=pb3_2_2)
states: 178,930,533 (8)
abstracting: (pil1_1_1<=pbl_1_1)
states: 876,847,584 (8)
abstracting: (pol1_2_1<=pil2_2_3)
states: 739,690,667 (8)
abstracting: (1<=pol3_2_3)
states: 660,357,832 (8)
abstracting: (po3_2_1<=pi2_2_1)
states: 739,692,186 (8)
abstracting: (1<=po1_2_1)
states: 279,738,317 (8)
abstracting: (1<=pb3_1_1)
states: 361,499,225 (8)
abstracting: (pil1_1_1<=1)
states: 940,096,149 (8)
abstracting: (po3_2_1<=pol2_2_3)
states: 860,763,314 (8)
abstracting: (pi1_2_1<=pil2_1_1)
states: 860,763,314 (8)
abstracting: (1<=pi2_1_1)
states: 279,738,317 (8)
abstracting: (pi2_2_3<=0)
states: 660,357,832 (8)
abstracting: (pi3_2_3<=pol1_2_1)
states: 860,763,314 (8)
abstracting: (pol2_2_1<=pbl_2_3)
states: 876,857,023 (8)
abstracting: (po3_1_1<=1)
states: 940,096,149 (8)
abstracting: (1<=pi1_2_3)
states: 279,747,756 (8)
abstracting: (1<=pb2_2_2)
states: 361,508,424 (8)
abstracting: (pbl_1_1<=0)
states: 83,528,683 (7)
abstracting: (pil2_1_1<=pi3_2_1)
states: 480,143,799 (8)
abstracting: (1<=pi1_1_1)
states: 279,738,317 (8)
abstracting: (pb1_2_1<=pil1_2_1)
states: 749,519,273 (8)
abstracting: (1<=pb1_2_2)
states: 361,508,424 (8)
abstracting: (1<=po2_1_1)
states: 279,738,317 (8)
abstracting: (pol3_2_3<=0)
states: 279,738,317 (8)
abstracting: (pi2_1_1<=pil2_2_1)
states: 860,761,795 (8)
abstracting: (pbl_2_1<=0)
states: 83,528,683 (7)
abstracting: (po2_2_1<=0)
states: 660,348,393 (8)
abstracting: (pb3_2_2<=pb1_2_1)
states: 678,367,579 (8)
abstracting: (po2_2_3<=pbl_1_1)
states: 919,806,607 (8)
abstracting: (pil1_1_1<=1)
states: 940,096,149 (8)
abstracting: (pb3_2_3<=0)
states: 578,585,747 (8)
abstracting: (pb2_2_2<=po1_1_1)
states: 648,271,719 (8)
abstracting: (pil2_2_3<=1)
states: 940,096,149 (8)
abstracting: (pb1_2_3<=pb2_2_3)
states: 672,532,609 (8)
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.735sec

checking: AG [[~ [[pil1_2_1<=1 & [[[po1_1_1<=0 | [[pol1_1_1<=pol1_1_1 & pil1_2_1<=pb3_2_2] | [1<=pi1_1_1 | 1<=pi1_1_1]]] | [~ [pol2_2_3<=0] | ~ [[pi3_2_1<=pi2_2_3 & pol2_2_1<=pil3_1_1]]]] | [[~ [pb1_2_3<=0] & [[1<=pi1_1_1 | pi1_1_1<=0] | ~ [pb2_2_2<=0]]] | [[~ [pol3_2_1<=pb2_2_2] & [po3_2_1<=pb1_2_3 | 1<=po1_2_1]] | ~ [1<=pb2_1_1]]]]]] & [~ [[~ [[pi2_1_1<=0 | ~ [[~ [1<=pb1_2_1] | ~ [pil1_1_1<=pbl_1_1]]]]] & [[~ [[pbl_2_2<=0 & 1<=pi1_1_1]] & ~ [[pb1_2_1<=pb2_2_3 | pil1_2_1<=pil3_2_3]]] & [~ [[[pil1_2_3<=pol3_1_1 & pbl_2_1<=0] | ~ [1<=pil3_2_1]]] | ~ [[pi2_2_1<=0 & pi3_2_1<=pol3_2_1]]]]]] & [[[1<=pb1_1_1 | [[[1<=pol3_2_3 | [1<=pb1_2_3 | 1<=pbl_2_1]] | [[pil3_2_1<=0 | 1<=pi1_2_3] | [1<=pol3_2_1 & pi2_1_1<=0]]] | [[~ [1<=pil1_2_3] | ~ [1<=pb2_2_2]] & ~ [pi3_2_3<=0]]]] & [~ [[pil3_1_1<=0 & [~ [1<=pol2_2_1] & ~ [1<=pi1_2_3]]]] & pb3_2_1<=pbl_2_2]] & [[[~ [[~ [pb2_2_3<=1] & [pil1_2_1<=po2_2_3 & pil3_2_1<=pbl_2_2]]] | [pil2_2_1<=1 & [~ [1<=po1_2_1] & 1<=pil1_2_3]]] & [[~ [[1<=pb2_2_3 | pol3_1_1<=po2_2_1]] & ~ [po1_2_3<=1]] & po3_2_1<=pi3_2_3]] & [pi3_1_1<=0 & [po3_2_1<=pbl_1_1 & ~ [[po3_1_1<=1 | pb1_2_3<=1]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[pil2_2_1<=1 & [1<=pil1_2_3 & ~ [1<=po1_2_1]]] | ~ [[[pil1_2_1<=po2_2_3 & pil3_2_1<=pbl_2_2] & ~ [pb2_2_3<=1]]]] & [po3_2_1<=pi3_2_3 & [~ [po1_2_3<=1] & ~ [[1<=pb2_2_3 | pol3_1_1<=po2_2_1]]]]] & [pi3_1_1<=0 & [po3_2_1<=pbl_1_1 & ~ [[po3_1_1<=1 | pb1_2_3<=1]]]]] & [[1<=pb1_1_1 | [[[[1<=pol3_2_1 & pi2_1_1<=0] | [pil3_2_1<=0 | 1<=pi1_2_3]] | [1<=pol3_2_3 | [1<=pb1_2_3 | 1<=pbl_2_1]]] | [~ [pi3_2_3<=0] & [~ [1<=pb2_2_2] | ~ [1<=pil1_2_3]]]]] & [pb3_2_1<=pbl_2_2 & ~ [[pil3_1_1<=0 & [~ [1<=pi1_2_3] & ~ [1<=pol2_2_1]]]]]]] & ~ [[~ [[pi2_1_1<=0 | ~ [[~ [pil1_1_1<=pbl_1_1] | ~ [1<=pb1_2_1]]]]] & [[~ [[pi2_2_1<=0 & pi3_2_1<=pol3_2_1]] | ~ [[~ [1<=pil3_2_1] | [pil1_2_3<=pol3_1_1 & pbl_2_1<=0]]]] & [~ [[pb1_2_1<=pb2_2_3 | pil1_2_1<=pil3_2_3]] & ~ [[pbl_2_2<=0 & 1<=pi1_1_1]]]]]]] & ~ [[pil1_2_1<=1 & [[[~ [1<=pb2_1_1] | [[po3_2_1<=pb1_2_3 | 1<=po1_2_1] & ~ [pol3_2_1<=pb2_2_2]]] | [[~ [pb2_2_2<=0] | [1<=pi1_1_1 | pi1_1_1<=0]] & ~ [pb1_2_3<=0]]] | [[~ [[pi3_2_1<=pi2_2_3 & pol2_2_1<=pil3_1_1]] | ~ [pol2_2_3<=0]] | [po1_1_1<=0 | [[1<=pi1_1_1 | 1<=pi1_1_1] | [pol1_1_1<=pol1_1_1 & pil1_2_1<=pb3_2_2]]]]]]]]]]]

abstracting: (pil1_2_1<=pb3_2_2)
states: 539,196,516 (8)
abstracting: (pol1_1_1<=pol1_1_1)
states: 940,096,149 (8)
abstracting: (1<=pi1_1_1)
states: 279,738,317 (8)
abstracting: (1<=pi1_1_1)
states: 279,738,317 (8)
abstracting: (po1_1_1<=0)
states: 660,357,832 (8)
abstracting: (pol2_2_3<=0)
states: 279,738,317 (8)
abstracting: (pol2_2_1<=pil3_1_1)
states: 739,684,266 (8)
abstracting: (pi3_2_1<=pi2_2_3)
states: 739,690,667 (8)
abstracting: (pb1_2_3<=0)
states: 578,596,924 (8)
abstracting: (pi1_1_1<=0)
states: 660,357,832 (8)
abstracting: (1<=pi1_1_1)
states: 279,738,317 (8)
abstracting: (pb2_2_2<=0)
states: 578,587,725 (8)
abstracting: (pol3_2_1<=pb2_2_2)
states: 539,196,516 (8)
abstracting: (1<=po1_2_1)
states: 279,738,317 (8)
abstracting: (po3_2_1<=pb1_2_3)
states: 762,406,559 (8)
abstracting: (1<=pb2_1_1)
states: 361,510,402 (8)
abstracting: (pil1_2_1<=1)
states: 940,096,149 (8)
abstracting: (1<=pi1_1_1)
states: 279,738,317 (8)
abstracting: (pbl_2_2<=0)
states: 83,539,845 (7)
abstracting: (pil1_2_1<=pil3_2_3)
states: 739,690,667 (8)
abstracting: (pb1_2_1<=pb2_2_3)
states: 678,365,841 (8)
abstracting: (pbl_2_1<=0)
states: 83,528,683 (7)
abstracting: (pil1_2_3<=pol3_1_1)
states: 739,684,266 (8)
abstracting: (1<=pil3_2_1)
states: 660,357,832 (8)
abstracting: (pi3_2_1<=pol3_2_1)
states: 860,771,234 (8)
abstracting: (pi2_2_1<=0)
states: 660,348,393 (8)
abstracting: (1<=pb1_2_1)
states: 361,510,402 (8)
abstracting: (pil1_1_1<=pbl_1_1)
states: 876,847,584 (8)
abstracting: (pi2_1_1<=0)
states: 660,357,832 (8)
abstracting: (1<=pol2_2_1)
states: 660,348,393 (8)
abstracting: (1<=pi1_2_3)
states: 279,747,756 (8)
abstracting: (pil3_1_1<=0)
states: 279,747,756 (8)
abstracting: (pb3_2_1<=pbl_2_2)
states: 889,497,873 (8)
abstracting: (1<=pil1_2_3)
states: 660,348,393 (8)
abstracting: (1<=pb2_2_2)
states: 361,508,424 (8)
abstracting: (pi3_2_3<=0)
states: 660,357,832 (8)
abstracting: (1<=pbl_2_1)
states: 856,567,466 (8)
abstracting: (1<=pb1_2_3)
states: 361,499,225 (8)
abstracting: (1<=pol3_2_3)
states: 660,357,832 (8)
abstracting: (1<=pi1_2_3)
states: 279,747,756 (8)
abstracting: (pil3_2_1<=0)
states: 279,738,317 (8)
abstracting: (pi2_1_1<=0)
states: 660,357,832 (8)
abstracting: (1<=pol3_2_1)
states: 660,357,832 (8)
abstracting: (1<=pb1_1_1)
states: 361,510,402 (8)
abstracting: (pb1_2_3<=1)
states: 819,216,160 (8)
abstracting: (po3_1_1<=1)
states: 940,096,149 (8)
abstracting: (po3_2_1<=pbl_1_1)
states: 919,806,607 (8)
abstracting: (pi3_1_1<=0)
states: 660,348,393 (8)
abstracting: (pol3_1_1<=po2_2_1)
states: 480,159,639 (8)
abstracting: (1<=pb2_2_3)
states: 361,510,402 (8)
abstracting: (po1_2_3<=1)
states: 940,096,149 (8)
abstracting: (po3_2_1<=pi3_2_3)
states: 739,690,667 (8)
abstracting: (pb2_2_3<=1)
states: 819,204,983 (8)
abstracting: (pil3_2_1<=pbl_2_2)
states: 876,847,584 (8)
abstracting: (pil1_2_1<=po2_2_3)
states: 480,143,799 (8)
abstracting: (1<=po1_2_1)
states: 279,738,317 (8)
abstracting: (1<=pil1_2_3)
states: 660,348,393 (8)
abstracting: (pil2_2_1<=1)
states: 940,096,149 (8)
-> the formula is FALSE

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

MC time: 0m 0.027sec

totally nodes used: 661176 (6.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3048703 2828753 5877456
used/not used/entry size/cache size: 3200017 63908847 16 1024MB
basic ops cache: hits/miss/sum: 780035 848590 1628625
used/not used/entry size/cache size: 1499258 15277958 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: 47594 51372 98966
used/not used/entry size/cache size: 51251 8337357 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 66485889
1 600027
2 18340
3 2058
4 1015
5 327
6 400
7 191
8 156
9 102
>= 10 359

Total processing time: 0m 5.572sec


BK_STOP 1679326444337

--------------------
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:2962 (70), effective:503 (11)

initing FirstDep: 0m 0.000sec


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

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

iterations count:1144 (27), effective:141 (3)

iterations count:240 (5), effective:38 (0)

iterations count:1051 (25), effective:168 (4)

iterations count:666 (15), effective:100 (2)

iterations count:1709 (40), effective:279 (6)

iterations count:42 (1), effective:0 (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-2011"
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-2011, 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-167912709000726"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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