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.r458-smll-167912650200358.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 SquareGrid-PT-020102, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650200358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.6K Feb 25 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 12:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 55K 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 SquareGrid-PT-020102-ReachabilityCardinality-00
FORMULA_NAME SquareGrid-PT-020102-ReachabilityCardinality-01
FORMULA_NAME SquareGrid-PT-020102-ReachabilityCardinality-02
FORMULA_NAME SquareGrid-PT-020102-ReachabilityCardinality-03
FORMULA_NAME SquareGrid-PT-020102-ReachabilityCardinality-04
FORMULA_NAME SquareGrid-PT-020102-ReachabilityCardinality-05
FORMULA_NAME SquareGrid-PT-020102-ReachabilityCardinality-06
FORMULA_NAME SquareGrid-PT-020102-ReachabilityCardinality-07
FORMULA_NAME SquareGrid-PT-020102-ReachabilityCardinality-08
FORMULA_NAME SquareGrid-PT-020102-ReachabilityCardinality-09
FORMULA_NAME SquareGrid-PT-020102-ReachabilityCardinality-10
FORMULA_NAME SquareGrid-PT-020102-ReachabilityCardinality-11
FORMULA_NAME SquareGrid-PT-020102-ReachabilityCardinality-12
FORMULA_NAME SquareGrid-PT-020102-ReachabilityCardinality-13
FORMULA_NAME SquareGrid-PT-020102-ReachabilityCardinality-14
FORMULA_NAME SquareGrid-PT-020102-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679400119324

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=SquareGrid-PT-020102
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 12:02:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 12:02:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 12:02:03] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-21 12:02:03] [INFO ] Transformed 68 places.
[2023-03-21 12:02:03] [INFO ] Transformed 72 transitions.
[2023-03-21 12:02:03] [INFO ] Parsed PT model containing 68 places and 72 transitions and 288 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 898 ms. (steps per millisecond=11 ) properties (out of 13) seen :8
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 72 rows 68 cols
[2023-03-21 12:02:04] [INFO ] Computed 29 place invariants in 10 ms
[2023-03-21 12:02:05] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 12:02:05] [INFO ] [Nat]Absence check using 28 positive place invariants in 10 ms returned sat
[2023-03-21 12:02:05] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 12:02:05] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SquareGrid-PT-020102-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 2283 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: SquareGrid_PT_020102
(NrP: 68 NrTr: 72 NrArc: 288)

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

net check time: 0m 0.000sec

init dd package: 0m 3.760sec


RS generation: 0m 0.706sec


-> reachability set: #nodes 2034 (2.0e+03) #states 2,085,423,232,578 (12)



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

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

abstracting: (pb4_1_2<=2)
states: 1,995,286,086,146 (12)
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.567sec

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

abstracting: (p3il_2_2<=2)
states: 2,085,423,232,578 (12)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (pb2_2_2<=p2i_2_2)
states: 1,434,418,752,922 (12)
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.074sec

checking: AG [[p1o_1_2<=0 & ~ [pb4_2_2<=0]]]
normalized: ~ [E [true U ~ [[~ [pb4_2_2<=0] & p1o_1_2<=0]]]]

abstracting: (p1o_1_2<=0)
states: 1,493,062,557,126 (12)
abstracting: (pb4_2_2<=0)
states: 1,291,079,626,146 (12)
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.278sec

checking: AG [[p4i_2_2<=pb1_1_2 | p1il_2_1<=p4il_2_1]]
normalized: ~ [E [true U ~ [[p4i_2_2<=pb1_1_2 | p1il_2_1<=p4il_2_1]]]]

abstracting: (p1il_2_1<=p4il_2_1)
states: 1,656,051,315,618 (12)
abstracting: (p4i_2_2<=pb1_1_2)
states: 1,710,070,304,850 (12)
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.093sec

checking: EF [[~ [[pb3_2_2<=2 & p3o_2_1<=p4o_2_1]] | pb1_2_2<=p4i_2_2]]
normalized: E [true U [~ [[pb3_2_2<=2 & p3o_2_1<=p4o_2_1]] | pb1_2_2<=p4i_2_2]]

abstracting: (pb1_2_2<=p4i_2_2)
states: 1,434,418,752,922 (12)
abstracting: (p3o_2_1<=p4o_2_1)
states: 1,656,051,315,618 (12)
abstracting: (pb3_2_2<=2)
states: 1,995,286,086,146 (12)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.540sec

checking: AG [[2<=pb2_1_2 | ~ [[[[~ [[2<=p1ol_2_1 & p1i_2_1<=p4i_2_1]] & ~ [p1il_1_2<=2]] | p1ol_2_1<=1] & 2<=p2il_2_2]]]]
normalized: ~ [E [true U ~ [[2<=pb2_1_2 | ~ [[2<=p2il_2_2 & [p1ol_2_1<=1 | [~ [p1il_1_2<=2] & ~ [[2<=p1ol_2_1 & p1i_2_1<=p4i_2_1]]]]]]]]]]

abstracting: (p1i_2_1<=p4i_2_1)
states: 1,656,051,315,618 (12)
abstracting: (2<=p1ol_2_1)
states: 0
abstracting: (p1il_1_2<=2)
states: 2,085,423,232,578 (12)
abstracting: (p1ol_2_1<=1)
states: 2,085,423,232,578 (12)
abstracting: (2<=p2il_2_2)
states: 0
abstracting: (2<=pb2_1_2)
states: 280,659,824,176 (11)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [[[1<=p3o_2_2 & p2il_1_2<=1] & [pb1_2_2<=p1il_2_2 & [2<=p3i_2_2 | p1il_2_1<=p4il_1_1]]]]
normalized: E [true U [[pb1_2_2<=p1il_2_2 & [2<=p3i_2_2 | p1il_2_1<=p4il_1_1]] & [1<=p3o_2_2 & p2il_1_2<=1]]]

abstracting: (p2il_1_2<=1)
states: 2,085,423,232,578 (12)
abstracting: (1<=p3o_2_2)
states: 592,360,675,452 (11)
abstracting: (p1il_2_1<=p4il_1_1)
states: 1,656,051,315,618 (12)
abstracting: (2<=p3i_2_2)
states: 0
abstracting: (pb1_2_2<=p1il_2_2)
states: 1,661,424,281,626 (12)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.684sec

checking: AG [~ [[[~ [p4il_1_2<=pbl_1_2] & [~ [p1o_2_1<=p4il_2_2] & pb4_2_2<=2]] | ~ [[pb2_2_2<=pb3_2_2 | [p1o_1_2<=2 | p1o_1_2<=0]]]]]]
normalized: ~ [E [true U [~ [[pb2_2_2<=pb3_2_2 | [p1o_1_2<=2 | p1o_1_2<=0]]] | [[pb4_2_2<=2 & ~ [p1o_2_1<=p4il_2_2]] & ~ [p4il_1_2<=pbl_1_2]]]]]

abstracting: (p4il_1_2<=pbl_1_2)
states: 2,034,138,849,834 (12)
abstracting: (p1o_2_1<=p4il_2_2)
states: 1,922,434,474,086 (12)
abstracting: (pb4_2_2<=2)
states: 1,995,286,086,146 (12)
abstracting: (p1o_1_2<=0)
states: 1,493,062,557,126 (12)
abstracting: (p1o_1_2<=2)
states: 2,085,423,232,578 (12)
abstracting: (pb2_2_2<=pb3_2_2)
states: 1,502,005,900,426 (12)
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.068sec

checking: AG [[p1ol_2_2<=2 | [[p4o_2_2<=0 & ~ [[[p1i_2_2<=0 & pb4_1_1<=0] & ~ [[[p2ol_1_2<=p4o_1_2 | p3il_2_1<=0] & 2<=p2ol_2_2]]]]] & p1ol_1_2<=pbl_2_2]]]
normalized: ~ [E [true U ~ [[p1ol_2_2<=2 | [p1ol_1_2<=pbl_2_2 & [p4o_2_2<=0 & ~ [[~ [[2<=p2ol_2_2 & [p2ol_1_2<=p4o_1_2 | p3il_2_1<=0]]] & [p1i_2_2<=0 & pb4_1_1<=0]]]]]]]]]

abstracting: (pb4_1_1<=0)
states: 1,291,079,626,146 (12)
abstracting: (p1i_2_2<=0)
states: 1,493,062,557,126 (12)
abstracting: (p3il_2_1<=0)
states: 592,360,675,452 (11)
abstracting: (p2ol_1_2<=p4o_1_2)
states: 1,021,732,592,412 (12)
abstracting: (2<=p2ol_2_2)
states: 0
abstracting: (p4o_2_2<=0)
states: 1,493,062,557,126 (12)
abstracting: (p1ol_1_2<=pbl_2_2)
states: 2,034,138,849,834 (12)
abstracting: (p1ol_2_2<=2)
states: 2,085,423,232,578 (12)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: EF [~ [[[~ [2<=p1i_1_2] | ~ [[[[2<=p1il_2_2 & [[p1ol_2_2<=0 | pb3_2_2<=pb4_1_2] & [p1il_2_1<=1 | p4ol_1_1<=1]]] & [[p1i_2_1<=p1ol_1_2 | 2<=p1i_2_1] | [[p1ol_2_2<=1 | 2<=pb3_1_2] & [p4ol_2_1<=0 | 1<=p2ol_2_2]]]] | [[p4o_1_2<=p4il_1_2 & [~ [p4o_1_1<=pb2_2_2] | [pb4_1_1<=1 | p1o_1_2<=1]]] | [~ [p4il_2_1<=p3i_2_1] | [~ [2<=pb4_1_1] & ~ [pb4_1_2<=p4il_1_2]]]]]]] & p2ol_1_2<=pb4_1_1]]]
normalized: E [true U ~ [[p2ol_1_2<=pb4_1_1 & [~ [[[[[~ [pb4_1_2<=p4il_1_2] & ~ [2<=pb4_1_1]] | ~ [p4il_2_1<=p3i_2_1]] | [p4o_1_2<=p4il_1_2 & [[pb4_1_1<=1 | p1o_1_2<=1] | ~ [p4o_1_1<=pb2_2_2]]]] | [[[[p4ol_2_1<=0 | 1<=p2ol_2_2] & [p1ol_2_2<=1 | 2<=pb3_1_2]] | [p1i_2_1<=p1ol_1_2 | 2<=p1i_2_1]] & [2<=p1il_2_2 & [[p1il_2_1<=1 | p4ol_1_1<=1] & [p1ol_2_2<=0 | pb3_2_2<=pb4_1_2]]]]]] | ~ [2<=p1i_1_2]]]]]

abstracting: (2<=p1i_1_2)
states: 0
abstracting: (pb3_2_2<=pb4_1_2)
states: 1,506,492,088,762 (12)
abstracting: (p1ol_2_2<=0)
states: 592,360,675,452 (11)
abstracting: (p4ol_1_1<=1)
states: 2,085,423,232,578 (12)
abstracting: (p1il_2_1<=1)
states: 2,085,423,232,578 (12)
abstracting: (2<=p1il_2_2)
states: 0
abstracting: (2<=p1i_2_1)
states: 0
abstracting: (p1i_2_1<=p1ol_1_2)
states: 1,922,434,474,086 (12)
abstracting: (2<=pb3_1_2)
states: 280,659,824,176 (11)
abstracting: (p1ol_2_2<=1)
states: 2,085,423,232,578 (12)
abstracting: (1<=p2ol_2_2)
states: 1,493,062,557,126 (12)
abstracting: (p4ol_2_1<=0)
states: 592,360,675,452 (11)
abstracting: (p4o_1_1<=pb2_2_2)
states: 1,710,070,304,850 (12)
abstracting: (p1o_1_2<=1)
states: 2,085,423,232,578 (12)
abstracting: (pb4_1_1<=1)
states: 1,804,763,408,402 (12)
abstracting: (p4o_1_2<=p4il_1_2)
states: 1,922,434,474,086 (12)
abstracting: (p4il_2_1<=p3i_2_1)
states: 1,021,732,592,412 (12)
abstracting: (2<=pb4_1_1)
states: 280,659,824,176 (11)
abstracting: (pb4_1_2<=p4il_1_2)
states: 1,661,424,281,626 (12)
abstracting: (p2ol_1_2<=pb4_1_1)
states: 1,169,696,534,160 (12)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.298sec

checking: EF [[[p1il_0<=0 & [[[[[~ [[p3i_2_1<=0 | 2<=p3ol_2_2]] & pb2_2_2<=1] & [p1il_2_1<=0 | p3il_2_1<=p1i_0]] & [[[pb4_2_2<=2 | ~ [pbl_1_1<=p1il_2_2]] | [1<=p3il_2_2 & p2il_1_2<=pbl_1_1]] & 2<=p4il_1_2]] & [pb2_1_1<=2 & 1<=pb2_2_2]] & [p2ol_2_2<=pbl_1_1 & [~ [[[[p1il_0<=pb4_1_1 | 1<=p1o_1_1] & ~ [pb2_2_2<=0]] & [pb2_1_1<=p4ol_2_1 | [2<=p4o_2_2 & p1il_0<=2]]]] | 2<=p2ol_1_2]]]] & p2o_1_2<=0]]
normalized: E [true U [p2o_1_2<=0 & [p1il_0<=0 & [[p2ol_2_2<=pbl_1_1 & [2<=p2ol_1_2 | ~ [[[pb2_1_1<=p4ol_2_1 | [2<=p4o_2_2 & p1il_0<=2]] & [~ [pb2_2_2<=0] & [p1il_0<=pb4_1_1 | 1<=p1o_1_1]]]]]] & [[pb2_1_1<=2 & 1<=pb2_2_2] & [[2<=p4il_1_2 & [[1<=p3il_2_2 & p2il_1_2<=pbl_1_1] | [pb4_2_2<=2 | ~ [pbl_1_1<=p1il_2_2]]]] & [[p1il_2_1<=0 | p3il_2_1<=p1i_0] & [pb2_2_2<=1 & ~ [[p3i_2_1<=0 | 2<=p3ol_2_2]]]]]]]]]]

abstracting: (2<=p3ol_2_2)
states: 0
abstracting: (p3i_2_1<=0)
states: 1,493,062,557,126 (12)
abstracting: (pb2_2_2<=1)
states: 1,804,763,408,402 (12)
abstracting: (p3il_2_1<=p1i_0)
states: 1,021,732,592,412 (12)
abstracting: (p1il_2_1<=0)
states: 592,360,675,452 (11)
abstracting: (pbl_1_1<=p1il_2_2)
states: 172,760,362,096 (11)
abstracting: (pb4_2_2<=2)
states: 1,995,286,086,146 (12)
abstracting: (p2il_1_2<=pbl_1_1)
states: 2,034,138,849,834 (12)
abstracting: (1<=p3il_2_2)
states: 1,493,062,557,126 (12)
abstracting: (2<=p4il_1_2)
states: 0
abstracting: (1<=pb2_2_2)
states: 794,343,606,432 (11)
abstracting: (pb2_1_1<=2)
states: 1,995,286,086,146 (12)
abstracting: (1<=p1o_1_1)
states: 592,360,675,452 (11)
abstracting: (p1il_0<=pb4_1_1)
states: 1,169,696,534,160 (12)
abstracting: (pb2_2_2<=0)
states: 1,291,079,626,146 (12)
abstracting: (p1il_0<=2)
states: 2,085,423,232,578 (12)
abstracting: (2<=p4o_2_2)
states: 0
abstracting: (pb2_1_1<=p4ol_2_1)
states: 1,661,424,281,626 (12)
abstracting: (2<=p2ol_1_2)
states: 0
abstracting: (p2ol_2_2<=pbl_1_1)
states: 2,034,138,849,834 (12)
abstracting: (p1il_0<=0)
states: 592,360,675,452 (11)
abstracting: (p2o_1_2<=0)
states: 1,493,062,557,126 (12)
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.051sec

checking: EF [[[p4i_1_2<=0 | [~ [[[~ [2<=p4i_2_1] | [[1<=p4il_2_2 | 1<=p4o_2_2] | [[pb2_2_2<=2 | p4ol_1_2<=1] & [p4o_1_1<=1 & pb3_2_2<=0]]]] & p1ol_1_2<=pb2_1_2]] | [[[[1<=p4ol_1_2 | 2<=pb2_1_1] & [~ [[1<=p4o_1_1 | pb2_2_1<=1]] & ~ [p3o_2_2<=2]]] & [~ [[[1<=p4il_2_2 | pb3_1_2<=0] & [p1o_2_2<=2 & p1ol_2_1<=pbl_1_2]]] & [~ [[2<=p3o_2_2 | 1<=p4ol_1_1]] & [~ [2<=p1il_0] & [p4i_2_1<=p4i_1_2 | p1il_0<=2]]]]] | [1<=p4i_1_1 | [2<=p1i_0 & [~ [[p4i_2_1<=0 | 2<=p1i_0]] & ~ [2<=p1i_0]]]]]]] & [1<=p1il_2_2 & ~ [1<=p4i_1_2]]]]
normalized: E [true U [[1<=p1il_2_2 & ~ [1<=p4i_1_2]] & [p4i_1_2<=0 | [[[1<=p4i_1_1 | [2<=p1i_0 & [~ [2<=p1i_0] & ~ [[p4i_2_1<=0 | 2<=p1i_0]]]]] | [[[[[p4i_2_1<=p4i_1_2 | p1il_0<=2] & ~ [2<=p1il_0]] & ~ [[2<=p3o_2_2 | 1<=p4ol_1_1]]] & ~ [[[p1o_2_2<=2 & p1ol_2_1<=pbl_1_2] & [1<=p4il_2_2 | pb3_1_2<=0]]]] & [[~ [p3o_2_2<=2] & ~ [[1<=p4o_1_1 | pb2_2_1<=1]]] & [1<=p4ol_1_2 | 2<=pb2_1_1]]]] | ~ [[p1ol_1_2<=pb2_1_2 & [[[[p4o_1_1<=1 & pb3_2_2<=0] & [pb2_2_2<=2 | p4ol_1_2<=1]] | [1<=p4il_2_2 | 1<=p4o_2_2]] | ~ [2<=p4i_2_1]]]]]]]]

abstracting: (2<=p4i_2_1)
states: 0
abstracting: (1<=p4o_2_2)
states: 592,360,675,452 (11)
abstracting: (1<=p4il_2_2)
states: 1,493,062,557,126 (12)
abstracting: (p4ol_1_2<=1)
states: 2,085,423,232,578 (12)
abstracting: (pb2_2_2<=2)
states: 1,995,286,086,146 (12)
abstracting: (pb3_2_2<=0)
states: 1,291,079,626,146 (12)
abstracting: (p4o_1_1<=1)
states: 2,085,423,232,578 (12)
abstracting: (p1ol_1_2<=pb2_1_2)
states: 1,169,696,534,160 (12)
abstracting: (2<=pb2_1_1)
states: 280,659,824,176 (11)
abstracting: (1<=p4ol_1_2)
states: 1,493,062,557,126 (12)
abstracting: (pb2_2_1<=1)
states: 1,804,763,408,402 (12)
abstracting: (1<=p4o_1_1)
states: 592,360,675,452 (11)
abstracting: (p3o_2_2<=2)
states: 2,085,423,232,578 (12)
abstracting: (pb3_1_2<=0)
states: 1,291,079,626,146 (12)
abstracting: (1<=p4il_2_2)
states: 1,493,062,557,126 (12)
abstracting: (p1ol_2_1<=pbl_1_2)
states: 2,034,138,849,834 (12)
abstracting: (p1o_2_2<=2)
states: 2,085,423,232,578 (12)
abstracting: (1<=p4ol_1_1)
states: 1,493,062,557,126 (12)
abstracting: (2<=p3o_2_2)
states: 0
abstracting: (2<=p1il_0)
states: 0
abstracting: (p1il_0<=2)
states: 2,085,423,232,578 (12)
abstracting: (p4i_2_1<=p4i_1_2)
states: 1,656,051,315,618 (12)
abstracting: (2<=p1i_0)
states: 0
abstracting: (p4i_2_1<=0)
states: 1,493,062,557,126 (12)
abstracting: (2<=p1i_0)
states: 0
abstracting: (2<=p1i_0)
states: 0
abstracting: (1<=p4i_1_1)
states: 592,360,675,452 (11)
abstracting: (p4i_1_2<=0)
states: 1,493,062,557,126 (12)
abstracting: (1<=p4i_1_2)
states: 592,360,675,452 (11)
abstracting: (1<=p1il_2_2)
states: 1,493,062,557,126 (12)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.208sec

checking: AG [[[~ [[[~ [pb4_1_2<=p1ol_2_2] | 2<=pb2_1_2] & 1<=p4ol_1_1]] & [[[~ [[[[pbl_2_2<=2 | 2<=pb3_1_1] & [2<=p3ol_2_1 & pbl_1_1<=2]] & ~ [p1il_2_1<=pbl_2_1]]] & [~ [[[p4il_2_1<=p4o_2_2 & p4i_1_2<=p2ol_2_2] & [1<=p4ol_1_2 & 1<=pb4_1_2]]] & [[~ [p4ol_2_1<=2] & ~ [p3ol_2_2<=p4i_1_2]] & [p4ol_1_1<=0 & [1<=p4i_2_2 & p2il_1_2<=0]]]]] & [1<=p1o_1_1 & [~ [[[p2ol_1_2<=2 | p2o_1_2<=pbl_1_1] | [pb3_2_2<=2 & p2il_1_2<=1]]] | [2<=p2il_2_2 | [[2<=p1i_0 | 1<=pb2_2_2] | pb2_1_2<=p2ol_2_2]]]]] | ~ [pb2_1_2<=0]]] | ~ [pbl_2_2<=p1o_1_2]]]
normalized: ~ [E [true U ~ [[~ [pbl_2_2<=p1o_1_2] | [[~ [pb2_1_2<=0] | [[1<=p1o_1_1 & [[2<=p2il_2_2 | [pb2_1_2<=p2ol_2_2 | [2<=p1i_0 | 1<=pb2_2_2]]] | ~ [[[pb3_2_2<=2 & p2il_1_2<=1] | [p2ol_1_2<=2 | p2o_1_2<=pbl_1_1]]]]] & [[[[p4ol_1_1<=0 & [1<=p4i_2_2 & p2il_1_2<=0]] & [~ [p3ol_2_2<=p4i_1_2] & ~ [p4ol_2_1<=2]]] & ~ [[[1<=p4ol_1_2 & 1<=pb4_1_2] & [p4il_2_1<=p4o_2_2 & p4i_1_2<=p2ol_2_2]]]] & ~ [[~ [p1il_2_1<=pbl_2_1] & [[2<=p3ol_2_1 & pbl_1_1<=2] & [pbl_2_2<=2 | 2<=pb3_1_1]]]]]]] & ~ [[1<=p4ol_1_1 & [2<=pb2_1_2 | ~ [pb4_1_2<=p1ol_2_2]]]]]]]]]

abstracting: (pb4_1_2<=p1ol_2_2)
states: 1,661,424,281,626 (12)
abstracting: (2<=pb2_1_2)
states: 280,659,824,176 (11)
abstracting: (1<=p4ol_1_1)
states: 1,493,062,557,126 (12)
abstracting: (2<=pb3_1_1)
states: 280,659,824,176 (11)
abstracting: (pbl_2_2<=2)
states: 463,972,589,192 (11)
abstracting: (pbl_1_1<=2)
states: 463,972,589,192 (11)
abstracting: (2<=p3ol_2_1)
states: 0
abstracting: (p1il_2_1<=pbl_2_1)
states: 2,034,138,849,834 (12)
abstracting: (p4i_1_2<=p2ol_2_2)
states: 1,922,434,474,086 (12)
abstracting: (p4il_2_1<=p4o_2_2)
states: 1,021,732,592,412 (12)
abstracting: (1<=pb4_1_2)
states: 794,343,606,432 (11)
abstracting: (1<=p4ol_1_2)
states: 1,493,062,557,126 (12)
abstracting: (p4ol_2_1<=2)
states: 2,085,423,232,578 (12)
abstracting: (p3ol_2_2<=p4i_1_2)
states: 1,021,732,592,412 (12)
abstracting: (p2il_1_2<=0)
states: 592,360,675,452 (11)
abstracting: (1<=p4i_2_2)
states: 592,360,675,452 (11)
abstracting: (p4ol_1_1<=0)
states: 592,360,675,452 (11)
abstracting: (p2o_1_2<=pbl_1_1)
states: 2,070,398,415,834 (12)
abstracting: (p2ol_1_2<=2)
states: 2,085,423,232,578 (12)
abstracting: (p2il_1_2<=1)
states: 2,085,423,232,578 (12)
abstracting: (pb3_2_2<=2)
states: 1,995,286,086,146 (12)
abstracting: (1<=pb2_2_2)
states: 794,343,606,432 (11)
abstracting: (2<=p1i_0)
states: 0
abstracting: (pb2_1_2<=p2ol_2_2)
states: 1,661,424,281,626 (12)
abstracting: (2<=p2il_2_2)
states: 0
abstracting: (1<=p1o_1_1)
states: 592,360,675,452 (11)
abstracting: (pb2_1_2<=0)
states: 1,291,079,626,146 (12)
abstracting: (pbl_2_2<=p1o_1_2)
states: 100,498,787,984 (11)
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.146sec

checking: EF [[[p1i_2_1<=pb1_2_1 & [[~ [pb2_1_1<=p3i_2_2] | 1<=p4i_1_2] | ~ [[~ [p4ol_1_1<=1] & ~ [p4ol_1_2<=0]]]]] | [[p1o_1_2<=p2il_2_2 & ~ [[[[1<=pb4_2_2 | p1ol_2_1<=0] | ~ [[p3ol_2_2<=0 | p4o_1_1<=p3il_2_1]]] & pb4_2_1<=p1i_2_1]]] | [[~ [[[~ [[pb1_1_1<=1 | 1<=p4o_1_1]] | [~ [p2o_1_2<=p1i_2_1] | ~ [2<=p1ol_1_1]]] & [[~ [p4i_1_2<=2] & [2<=p1o_2_1 | p1ol_2_1<=2]] | [[2<=p3i_2_2 & p1il_2_1<=pb4_1_2] & [1<=pb2_1_1 & 2<=pb2_2_1]]]]] | [[[[p4o_1_1<=p2i_2_2 | [p1i_2_2<=0 | p4i_2_1<=1]] & p1ol_1_1<=0] | [[[2<=p4i_1_1 & p3il_2_2<=p4o_1_1] | ~ [p2o_2_2<=1]] & [[p1il_0<=pb3_2_2 & 1<=p4o_1_2] | p4o_2_1<=1]]] | ~ [[[~ [p3i_2_1<=pb2_2_1] | [p1ol_1_1<=pb1_1_2 | pb3_1_1<=p1o_1_2]] & [p3i_2_2<=pb3_2_2 & ~ [p1i_2_2<=p2ol_2_2]]]]]] & [[p4i_1_2<=1 | [~ [pb2_1_1<=p2o_1_2] & ~ [p1o_1_1<=1]]] | [[[p2il_1_2<=2 | p3ol_2_1<=1] & [pb2_1_1<=p3o_2_1 & [[2<=p4ol_2_1 | p3o_2_2<=p4i_2_2] | [pb2_2_2<=p4il_2_1 | pbl_1_2<=0]]]] | ~ [[~ [2<=p3ol_2_1] & ~ [[p2i_2_2<=2 | p4o_2_2<=p2o_2_2]]]]]]]]]]
normalized: E [true U [[[[[~ [[~ [[p2i_2_2<=2 | p4o_2_2<=p2o_2_2]] & ~ [2<=p3ol_2_1]]] | [[pb2_1_1<=p3o_2_1 & [[pb2_2_2<=p4il_2_1 | pbl_1_2<=0] | [2<=p4ol_2_1 | p3o_2_2<=p4i_2_2]]] & [p2il_1_2<=2 | p3ol_2_1<=1]]] | [p4i_1_2<=1 | [~ [p1o_1_1<=1] & ~ [pb2_1_1<=p2o_1_2]]]] & [[~ [[[p3i_2_2<=pb3_2_2 & ~ [p1i_2_2<=p2ol_2_2]] & [[p1ol_1_1<=pb1_1_2 | pb3_1_1<=p1o_1_2] | ~ [p3i_2_1<=pb2_2_1]]]] | [[[p4o_2_1<=1 | [p1il_0<=pb3_2_2 & 1<=p4o_1_2]] & [~ [p2o_2_2<=1] | [2<=p4i_1_1 & p3il_2_2<=p4o_1_1]]] | [p1ol_1_1<=0 & [p4o_1_1<=p2i_2_2 | [p1i_2_2<=0 | p4i_2_1<=1]]]]] | ~ [[[[[1<=pb2_1_1 & 2<=pb2_2_1] & [2<=p3i_2_2 & p1il_2_1<=pb4_1_2]] | [[2<=p1o_2_1 | p1ol_2_1<=2] & ~ [p4i_1_2<=2]]] & [[~ [2<=p1ol_1_1] | ~ [p2o_1_2<=p1i_2_1]] | ~ [[pb1_1_1<=1 | 1<=p4o_1_1]]]]]]] | [p1o_1_2<=p2il_2_2 & ~ [[pb4_2_1<=p1i_2_1 & [~ [[p3ol_2_2<=0 | p4o_1_1<=p3il_2_1]] | [1<=pb4_2_2 | p1ol_2_1<=0]]]]]] | [p1i_2_1<=pb1_2_1 & [~ [[~ [p4ol_1_2<=0] & ~ [p4ol_1_1<=1]]] | [1<=p4i_1_2 | ~ [pb2_1_1<=p3i_2_2]]]]]]

abstracting: (pb2_1_1<=p3i_2_2)
states: 1,434,418,752,922 (12)
abstracting: (1<=p4i_1_2)
states: 592,360,675,452 (11)
abstracting: (p4ol_1_1<=1)
states: 2,085,423,232,578 (12)
abstracting: (p4ol_1_2<=0)
states: 592,360,675,452 (11)
abstracting: (p1i_2_1<=pb1_2_1)
states: 1,710,070,304,850 (12)
abstracting: (p1ol_2_1<=0)
states: 592,360,675,452 (11)
abstracting: (1<=pb4_2_2)
states: 794,343,606,432 (11)
abstracting: (p4o_1_1<=p3il_2_1)
states: 1,922,434,474,086 (12)
abstracting: (p3ol_2_2<=0)
states: 592,360,675,452 (11)
abstracting: (pb4_2_1<=p1i_2_1)
states: 1,434,418,752,922 (12)
abstracting: (p1o_1_2<=p2il_2_2)
states: 1,922,434,474,086 (12)
abstracting: (1<=p4o_1_1)
states: 592,360,675,452 (11)
abstracting: (pb1_1_1<=1)
states: 1,804,763,408,402 (12)
abstracting: (p2o_1_2<=p1i_2_1)
states: 1,656,051,315,618 (12)
abstracting: (2<=p1ol_1_1)
states: 0
abstracting: (p4i_1_2<=2)
states: 2,085,423,232,578 (12)
abstracting: (p1ol_2_1<=2)
states: 2,085,423,232,578 (12)
abstracting: (2<=p1o_2_1)
states: 0
abstracting: (p1il_2_1<=pb4_1_2)
states: 1,169,696,534,160 (12)
abstracting: (2<=p3i_2_2)
states: 0
abstracting: (2<=pb2_2_1)
states: 280,659,824,176 (11)
abstracting: (1<=pb2_1_1)
states: 794,343,606,432 (11)
abstracting: (p4i_2_1<=1)
states: 2,085,423,232,578 (12)
abstracting: (p1i_2_2<=0)
states: 1,493,062,557,126 (12)
abstracting: (p4o_1_1<=p2i_2_2)
states: 1,656,051,315,618 (12)
abstracting: (p1ol_1_1<=0)
states: 592,360,675,452 (11)
abstracting: (p3il_2_2<=p4o_1_1)
states: 1,021,732,592,412 (12)
abstracting: (2<=p4i_1_1)
states: 0
abstracting: (p2o_2_2<=1)
states: 2,085,423,232,578 (12)
abstracting: (1<=p4o_1_2)
states: 592,360,675,452 (11)
abstracting: (p1il_0<=pb3_2_2)
states: 1,169,696,534,160 (12)
abstracting: (p4o_2_1<=1)
states: 2,085,423,232,578 (12)
abstracting: (p3i_2_1<=pb2_2_1)
states: 1,710,070,304,850 (12)
abstracting: (pb3_1_1<=p1o_1_2)
states: 1,434,418,752,922 (12)
abstracting: (p1ol_1_1<=pb1_1_2)
states: 1,169,696,534,160 (12)
abstracting: (p1i_2_2<=p2ol_2_2)
states: 1,922,434,474,086 (12)
abstracting: (p3i_2_2<=pb3_2_2)
states: 1,710,070,304,850 (12)
abstracting: (pb2_1_1<=p2o_1_2)
states: 1,434,418,752,922 (12)
abstracting: (p1o_1_1<=1)
states: 2,085,423,232,578 (12)
abstracting: (p4i_1_2<=1)
states: 2,085,423,232,578 (12)
abstracting: (p3ol_2_1<=1)
states: 2,085,423,232,578 (12)
abstracting: (p2il_1_2<=2)
states: 2,085,423,232,578 (12)
abstracting: (p3o_2_2<=p4i_2_2)
states: 1,656,051,315,618 (12)
abstracting: (2<=p4ol_2_1)
states: 0
abstracting: (pbl_1_2<=0)
states: 66,309,199,488 (10)
abstracting: (pb2_2_2<=p4il_2_1)
states: 1,661,424,281,626 (12)
abstracting: (pb2_1_1<=p3o_2_1)
states: 1,434,418,752,922 (12)
abstracting: (2<=p3ol_2_1)
states: 0
abstracting: (p4o_2_2<=p2o_2_2)
states: 1,656,051,315,618 (12)
abstracting: (p2i_2_2<=2)
states: 2,085,423,232,578 (12)
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.154sec

checking: EF [[~ [[1<=p4o_1_2 | [~ [p1o_2_2<=p3i_2_1] | [pb2_1_2<=2 & ~ [[[p1o_2_2<=1 | p1il_2_2<=pb1_1_1] | [p2ol_2_2<=p3o_2_1 & p2o_2_2<=1]]]]]]] & [[[[[[[[pb4_2_1<=2 | p1i_2_1<=pb4_2_1] & p4ol_2_2<=2] | ~ [[1<=p4ol_2_2 & pb1_1_2<=p1ol_1_2]]] & ~ [[2<=pbl_2_1 | p2o_1_2<=pb3_1_2]]] & ~ [[[pbl_2_1<=pb2_1_2 & [pb2_1_1<=p3ol_2_2 & p1i_2_2<=p2o_1_2]] & p1i_2_1<=p1il_1_2]]] & [[[~ [[pb3_1_1<=2 | pbl_1_1<=pb3_1_2]] & p4i_2_2<=0] | pb1_1_1<=p1o_2_2] & [[~ [p4il_1_2<=1] & [[p4ol_2_1<=p1o_2_2 | 1<=p2i_2_2] & p2i_2_2<=0]] & [[p3o_2_2<=p2i_1_2 | [2<=pb3_1_1 | p3i_2_1<=1]] & [[p3ol_2_1<=pb2_1_1 | 1<=p4il_2_2] & [pbl_1_1<=2 & pb4_1_1<=0]]]]]] & ~ [p4ol_1_2<=pbl_1_1]] & [[[~ [[pb3_1_1<=pb2_1_1 | ~ [pbl_1_2<=p1ol_1_1]]] | [p4ol_2_2<=1 & [[2<=p3il_2_1 | [p4ol_1_2<=pb4_1_2 | p4i_1_1<=p2il_2_2]] & ~ [[pb1_1_2<=1 | 1<=p1il_1_2]]]]] & ~ [[~ [[p1o_1_1<=0 | 1<=p1ol_2_2]] & p1il_2_1<=1]]] & [2<=p2o_1_2 | [2<=p1i_2_2 | [~ [p2i_2_2<=p4il_2_2] & [[[pb1_2_1<=pb1_1_2 | pb1_1_2<=p4o_2_1] | ~ [p1ol_2_1<=1]] | [[pb4_2_1<=0 | p1ol_1_1<=p1o_2_2] & [p1i_0<=2 & p1i_0<=p3o_2_2]]]]]]]]]]
normalized: E [true U [[[[2<=p2o_1_2 | [2<=p1i_2_2 | [[[[p1i_0<=2 & p1i_0<=p3o_2_2] & [pb4_2_1<=0 | p1ol_1_1<=p1o_2_2]] | [~ [p1ol_2_1<=1] | [pb1_2_1<=pb1_1_2 | pb1_1_2<=p4o_2_1]]] & ~ [p2i_2_2<=p4il_2_2]]]] & [~ [[p1il_2_1<=1 & ~ [[p1o_1_1<=0 | 1<=p1ol_2_2]]]] & [[p4ol_2_2<=1 & [~ [[pb1_1_2<=1 | 1<=p1il_1_2]] & [2<=p3il_2_1 | [p4ol_1_2<=pb4_1_2 | p4i_1_1<=p2il_2_2]]]] | ~ [[pb3_1_1<=pb2_1_1 | ~ [pbl_1_2<=p1ol_1_1]]]]]] & [~ [p4ol_1_2<=pbl_1_1] & [[[[[[pbl_1_1<=2 & pb4_1_1<=0] & [p3ol_2_1<=pb2_1_1 | 1<=p4il_2_2]] & [p3o_2_2<=p2i_1_2 | [2<=pb3_1_1 | p3i_2_1<=1]]] & [[p2i_2_2<=0 & [p4ol_2_1<=p1o_2_2 | 1<=p2i_2_2]] & ~ [p4il_1_2<=1]]] & [pb1_1_1<=p1o_2_2 | [p4i_2_2<=0 & ~ [[pb3_1_1<=2 | pbl_1_1<=pb3_1_2]]]]] & [~ [[p1i_2_1<=p1il_1_2 & [pbl_2_1<=pb2_1_2 & [pb2_1_1<=p3ol_2_2 & p1i_2_2<=p2o_1_2]]]] & [~ [[2<=pbl_2_1 | p2o_1_2<=pb3_1_2]] & [~ [[1<=p4ol_2_2 & pb1_1_2<=p1ol_1_2]] | [p4ol_2_2<=2 & [pb4_2_1<=2 | p1i_2_1<=pb4_2_1]]]]]]]] & ~ [[1<=p4o_1_2 | [[pb2_1_2<=2 & ~ [[[p2ol_2_2<=p3o_2_1 & p2o_2_2<=1] | [p1o_2_2<=1 | p1il_2_2<=pb1_1_1]]]] | ~ [p1o_2_2<=p3i_2_1]]]]]]

abstracting: (p1o_2_2<=p3i_2_1)
states: 1,656,051,315,618 (12)
abstracting: (p1il_2_2<=pb1_1_1)
states: 1,169,696,534,160 (12)
abstracting: (p1o_2_2<=1)
states: 2,085,423,232,578 (12)
abstracting: (p2o_2_2<=1)
states: 2,085,423,232,578 (12)
abstracting: (p2ol_2_2<=p3o_2_1)
states: 1,021,732,592,412 (12)
abstracting: (pb2_1_2<=2)
states: 1,995,286,086,146 (12)
abstracting: (1<=p4o_1_2)
states: 592,360,675,452 (11)
abstracting: (p1i_2_1<=pb4_2_1)
states: 1,710,070,304,850 (12)
abstracting: (pb4_2_1<=2)
states: 1,995,286,086,146 (12)
abstracting: (p4ol_2_2<=2)
states: 2,085,423,232,578 (12)
abstracting: (pb1_1_2<=p1ol_1_2)
states: 1,661,424,281,626 (12)
abstracting: (1<=p4ol_2_2)
states: 1,493,062,557,126 (12)
abstracting: (p2o_1_2<=pb3_1_2)
states: 1,710,070,304,850 (12)
abstracting: (2<=pbl_2_1)
states: 1,878,473,281,986 (12)
abstracting: (p1i_2_2<=p2o_1_2)
states: 1,656,051,315,618 (12)
abstracting: (pb2_1_1<=p3ol_2_2)
states: 1,661,424,281,626 (12)
abstracting: (pbl_2_1<=pb2_1_2)
states: 160,161,665,248 (11)
abstracting: (p1i_2_1<=p1il_1_2)
states: 1,922,434,474,086 (12)
abstracting: (pbl_1_1<=pb3_1_2)
states: 160,161,665,248 (11)
abstracting: (pb3_1_1<=2)
states: 1,995,286,086,146 (12)
abstracting: (p4i_2_2<=0)
states: 1,493,062,557,126 (12)
abstracting: (pb1_1_1<=p1o_2_2)
states: 1,434,418,752,922 (12)
abstracting: (p4il_1_2<=1)
states: 2,085,423,232,578 (12)
abstracting: (1<=p2i_2_2)
states: 592,360,675,452 (11)
abstracting: (p4ol_2_1<=p1o_2_2)
states: 1,021,732,592,412 (12)
abstracting: (p2i_2_2<=0)
states: 1,493,062,557,126 (12)
abstracting: (p3i_2_1<=1)
states: 2,085,423,232,578 (12)
abstracting: (2<=pb3_1_1)
states: 280,659,824,176 (11)
abstracting: (p3o_2_2<=p2i_1_2)
states: 1,656,051,315,618 (12)
abstracting: (1<=p4il_2_2)
states: 1,493,062,557,126 (12)
abstracting: (p3ol_2_1<=pb2_1_1)
states: 1,169,696,534,160 (12)
abstracting: (pb4_1_1<=0)
states: 1,291,079,626,146 (12)
abstracting: (pbl_1_1<=2)
states: 463,972,589,192 (11)
abstracting: (p4ol_1_2<=pbl_1_1)
states: 2,034,138,849,834 (12)
abstracting: (pbl_1_2<=p1ol_1_1)
states: 172,760,362,096 (11)
abstracting: (pb3_1_1<=pb2_1_1)
states: 1,502,005,900,426 (12)
abstracting: (p4i_1_1<=p2il_2_2)
states: 1,922,434,474,086 (12)
abstracting: (p4ol_1_2<=pb4_1_2)
states: 1,169,696,534,160 (12)
abstracting: (2<=p3il_2_1)
states: 0
abstracting: (1<=p1il_1_2)
states: 1,493,062,557,126 (12)
abstracting: (pb1_1_2<=1)
states: 1,804,763,408,402 (12)
abstracting: (p4ol_2_2<=1)
states: 2,085,423,232,578 (12)
abstracting: (1<=p1ol_2_2)
states: 1,493,062,557,126 (12)
abstracting: (p1o_1_1<=0)
states: 1,493,062,557,126 (12)
abstracting: (p1il_2_1<=1)
states: 2,085,423,232,578 (12)
abstracting: (p2i_2_2<=p4il_2_2)
states: 1,922,434,474,086 (12)
abstracting: (pb1_1_2<=p4o_2_1)
states: 1,434,418,752,922 (12)
abstracting: (pb1_2_1<=pb1_1_2)
states: 1,506,492,088,762 (12)
abstracting: (p1ol_2_1<=1)
states: 2,085,423,232,578 (12)
abstracting: (p1ol_1_1<=p1o_2_2)
states: 1,021,732,592,412 (12)
abstracting: (pb4_2_1<=0)
states: 1,291,079,626,146 (12)
abstracting: (p1i_0<=p3o_2_2)
states: 1,656,051,315,618 (12)
abstracting: (p1i_0<=2)
states: 2,085,423,232,578 (12)
abstracting: (2<=p1i_2_2)
states: 0
abstracting: (2<=p2o_1_2)
states: 0
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.187sec

totally nodes used: 1543946 (1.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 25858842 16640287 42499129
used/not used/entry size/cache size: 15491756 51617108 16 1024MB
basic ops cache: hits/miss/sum: 2484126 1907035 4391161
used/not used/entry size/cache size: 2725657 14051559 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: 184517 136212 320729
used/not used/entry size/cache size: 135220 8253388 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 65658492
1 1391763
2 48946
3 5600
4 1613
5 680
6 334
7 158
8 108
9 107
>= 10 1063

Total processing time: 0m17.778sec


BK_STOP 1679400144660

--------------------
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:11383 (158), effective:1118 (15)

initing FirstDep: 0m 0.000sec


iterations count:3528 (49), effective:298 (4)

iterations count:3053 (42), effective:261 (3)

iterations count:1423 (19), effective:102 (1)

iterations count:3381 (46), effective:292 (4)

iterations count:1387 (19), effective:116 (1)

iterations count:2483 (34), effective:206 (2)

iterations count:6246 (86), effective:542 (7)

iterations count:692 (9), effective:65 (0)

iterations count:615 (8), effective:45 (0)

iterations count:5238 (72), effective:492 (6)

iterations count:72 (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="SquareGrid-PT-020102"
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 SquareGrid-PT-020102, 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 r458-smll-167912650200358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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