Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r266-smll-167863540500094.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 NeighborGrid-PT-d3n3m1t11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540500094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.4K Feb 26 09:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 09:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 09:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 09:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 26 09:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 46K 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 NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-00
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-01
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-02
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-03
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-04
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-05
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-06
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-07
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-08
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-09
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-10
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-11
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-12
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-13
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-14
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678785938702

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=NeighborGrid-PT-d3n3m1t11
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 09:25:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 09:25:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:25:42] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2023-03-14 09:25:42] [INFO ] Transformed 27 places.
[2023-03-14 09:25:42] [INFO ] Transformed 162 transitions.
[2023-03-14 09:25:42] [INFO ] Parsed PT model containing 27 places and 162 transitions and 324 arcs in 342 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 3422 steps, including 1 resets, run visited all 9 properties in 76 ms. (steps per millisecond=45 )
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 575 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: NeighborGrid_PT_d3n3m1t11
(NrP: 27 NrTr: 162 NrArc: 324)

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

net check time: 0m 0.000sec

init dd package: 0m 3.486sec


RS generation: 0m 0.624sec


-> reachability set: #nodes 729 (7.3e+02) #states 973,469,712,824,056 (14)



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

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

abstracting: (1<=p_0_2_2)
states: 495,918,532,948,104 (14)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.313sec

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

abstracting: (1<=p_1_1_1)
states: 495,918,532,948,104 (14)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.270sec

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

abstracting: (1<=p_0_1_2)
states: 495,918,532,948,104 (14)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.310sec

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

abstracting: (1<=p_1_1_1)
states: 495,918,532,948,104 (14)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.121sec

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

abstracting: (p_0_2_0<=1)
states: 725,510,446,350,004 (14)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.169sec

checking: EF [[[~ [p_1_1_1<=p_0_1_1] & [p_1_1_0<=p_2_0_0 | p_2_1_0<=1]] & p_2_2_1<=0]]
normalized: E [true U [[[p_1_1_0<=p_2_0_0 | p_2_1_0<=1] & ~ [p_1_1_1<=p_0_1_1]] & p_2_2_1<=0]]

abstracting: (p_2_2_1<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_1_1_1<=p_0_1_1)
states: 643,572,802,900,536 (14)
abstracting: (p_2_1_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_1_1_0<=p_2_0_0)
states: 643,572,802,900,536 (14)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.533sec

checking: EF [[[[[[[~ [[p_2_2_0<=1 | p_0_2_0<=1]] & 1<=p_0_2_1] & ~ [[[[1<=p_2_2_2 & p_0_1_0<=0] | [1<=p_2_2_2 & 1<=p_0_0_1]] & p_2_1_2<=1]]] | [p_0_2_0<=p_1_1_1 & p_0_1_1<=0]] & 1<=p_2_1_0] & 1<=p_0_2_1] & ~ [1<=p_2_2_1]]]
normalized: E [true U [~ [1<=p_2_2_1] & [1<=p_0_2_1 & [1<=p_2_1_0 & [[p_0_2_0<=p_1_1_1 & p_0_1_1<=0] | [~ [[p_2_1_2<=1 & [[1<=p_2_2_2 & 1<=p_0_0_1] | [1<=p_2_2_2 & p_0_1_0<=0]]]] & [1<=p_0_2_1 & ~ [[p_2_2_0<=1 | p_0_2_0<=1]]]]]]]]]

abstracting: (p_0_2_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_2_2_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_0_2_1)
states: 495,918,532,948,104 (14)
abstracting: (p_0_1_0<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p_2_2_2)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_0_0_1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_2_2_2)
states: 495,918,532,948,104 (14)
abstracting: (p_2_1_2<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_0_1_1<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_0_2_0<=p_1_1_1)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_2_1_0)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_0_2_1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_2_2_1)
states: 495,918,532,948,104 (14)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.974sec

checking: EF [[~ [1<=p_1_1_1] & ~ [[~ [[~ [[[p_2_0_0<=1 & 1<=p_1_0_1] | [p_2_1_2<=p_1_0_1 | p_2_2_0<=0]]] & ~ [1<=p_1_1_2]]] | [1<=p_0_0_1 & [[[p_1_0_0<=1 & [p_0_2_1<=p_2_0_2 | [1<=p_1_1_1 | 1<=p_0_0_0]]] & [~ [[p_2_0_1<=p_2_2_0 | p_0_1_2<=0]] | p_2_1_0<=p_2_0_0]] & p_0_1_0<=0]]]]]]
normalized: E [true U [~ [[~ [[~ [1<=p_1_1_2] & ~ [[[p_2_1_2<=p_1_0_1 | p_2_2_0<=0] | [p_2_0_0<=1 & 1<=p_1_0_1]]]]] | [1<=p_0_0_1 & [p_0_1_0<=0 & [[p_2_1_0<=p_2_0_0 | ~ [[p_2_0_1<=p_2_2_0 | p_0_1_2<=0]]] & [p_1_0_0<=1 & [p_0_2_1<=p_2_0_2 | [1<=p_1_1_1 | 1<=p_0_0_0]]]]]]]] & ~ [1<=p_1_1_1]]]

abstracting: (1<=p_1_1_1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_0_0_0)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_1_1_1)
states: 495,918,532,948,104 (14)
abstracting: (p_0_2_1<=p_2_0_2)
states: 643,572,802,900,536 (14)
abstracting: (p_1_0_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_0_1_2<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_2_0_1<=p_2_2_0)
states: 643,572,802,900,536 (14)
abstracting: (p_2_1_0<=p_2_0_0)
states: 643,572,802,900,536 (14)
abstracting: (p_0_1_0<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p_0_0_1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_1_0_1)
states: 495,918,532,948,104 (14)
abstracting: (p_2_0_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_2_2_0<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_2_1_2<=p_1_0_1)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_1_1_2)
states: 495,918,532,948,104 (14)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.602sec

checking: EF [~ [[[~ [1<=p_2_1_2] | [p_0_1_1<=p_1_2_2 & [p_0_1_0<=1 | 1<=p_0_2_2]]] & [~ [[p_1_1_2<=p_0_1_1 | [p_1_1_0<=p_2_1_2 | ~ [p_1_1_1<=1]]]] & ~ [[[[[p_1_0_0<=p_1_1_1 | 1<=p_1_0_2] & ~ [1<=p_1_0_2]] | p_1_2_0<=1] & [[[p_0_2_0<=p_2_0_0 & 1<=p_1_1_1] & [p_2_1_0<=1 | 1<=p_1_0_2]] | [[1<=p_0_2_2 & p_0_2_0<=p_2_2_1] & 1<=p_1_1_1]]]]]]]]
normalized: E [true U ~ [[[~ [[[[[p_0_2_0<=p_2_0_0 & 1<=p_1_1_1] & [p_2_1_0<=1 | 1<=p_1_0_2]] | [1<=p_1_1_1 & [1<=p_0_2_2 & p_0_2_0<=p_2_2_1]]] & [p_1_2_0<=1 | [~ [1<=p_1_0_2] & [p_1_0_0<=p_1_1_1 | 1<=p_1_0_2]]]]] & ~ [[p_1_1_2<=p_0_1_1 | [p_1_1_0<=p_2_1_2 | ~ [p_1_1_1<=1]]]]] & [[p_0_1_1<=p_1_2_2 & [p_0_1_0<=1 | 1<=p_0_2_2]] | ~ [1<=p_2_1_2]]]]]

abstracting: (1<=p_2_1_2)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_0_2_2)
states: 495,918,532,948,104 (14)
abstracting: (p_0_1_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_0_1_1<=p_1_2_2)
states: 643,572,802,900,536 (14)
abstracting: (p_1_1_1<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_1_1_0<=p_2_1_2)
states: 643,572,802,900,536 (14)
abstracting: (p_1_1_2<=p_0_1_1)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_1_0_2)
states: 495,918,532,948,104 (14)
abstracting: (p_1_0_0<=p_1_1_1)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_1_0_2)
states: 495,918,532,948,104 (14)
abstracting: (p_1_2_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_0_2_0<=p_2_2_1)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_0_2_2)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_1_1_1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_1_0_2)
states: 495,918,532,948,104 (14)
abstracting: (p_2_1_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_1_1_1)
states: 495,918,532,948,104 (14)
abstracting: (p_0_2_0<=p_2_0_0)
states: 643,572,802,900,536 (14)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m45.323sec

checking: AG [[[~ [p_1_1_0<=1] | [~ [[p_2_0_2<=1 | [1<=p_2_0_0 & ~ [[[p_0_1_2<=p_2_0_2 | 1<=p_2_0_0] | ~ [p_1_2_1<=p_1_2_2]]]]]] | [[~ [p_0_0_1<=p_1_0_1] & [1<=p_2_0_0 & [~ [p_0_2_1<=0] | [p_0_0_1<=p_1_0_0 | ~ [p_0_0_0<=0]]]]] & p_2_1_2<=p_2_0_0]]] & [1<=p_2_1_1 & ~ [[[p_0_0_2<=p_1_2_1 & ~ [[p_0_2_2<=1 | p_1_0_2<=p_1_0_0]]] & [~ [[p_1_0_1<=0 & p_0_2_0<=p_0_2_2]] | [1<=p_1_1_0 | [p_2_2_1<=p_1_1_1 | p_0_0_0<=p_1_2_2]]]]]]]]
normalized: ~ [E [true U ~ [[[1<=p_2_1_1 & ~ [[[[1<=p_1_1_0 | [p_2_2_1<=p_1_1_1 | p_0_0_0<=p_1_2_2]] | ~ [[p_1_0_1<=0 & p_0_2_0<=p_0_2_2]]] & [p_0_0_2<=p_1_2_1 & ~ [[p_0_2_2<=1 | p_1_0_2<=p_1_0_0]]]]]] & [[[p_2_1_2<=p_2_0_0 & [[1<=p_2_0_0 & [[p_0_0_1<=p_1_0_0 | ~ [p_0_0_0<=0]] | ~ [p_0_2_1<=0]]] & ~ [p_0_0_1<=p_1_0_1]]] | ~ [[p_2_0_2<=1 | [1<=p_2_0_0 & ~ [[~ [p_1_2_1<=p_1_2_2] | [p_0_1_2<=p_2_0_2 | 1<=p_2_0_0]]]]]]] | ~ [p_1_1_0<=1]]]]]]

abstracting: (p_1_1_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_2_0_0)
states: 495,918,532,948,104 (14)
abstracting: (p_0_1_2<=p_2_0_2)
states: 643,572,802,900,536 (14)
abstracting: (p_1_2_1<=p_1_2_2)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_2_0_0)
states: 495,918,532,948,104 (14)
abstracting: (p_2_0_2<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_0_0_1<=p_1_0_1)
states: 643,572,802,900,536 (14)
abstracting: (p_0_2_1<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_0_0_0<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_0_0_1<=p_1_0_0)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_2_0_0)
states: 495,918,532,948,104 (14)
abstracting: (p_2_1_2<=p_2_0_0)
states: 643,572,802,900,536 (14)
abstracting: (p_1_0_2<=p_1_0_0)
states: 643,572,802,900,536 (14)
abstracting: (p_0_2_2<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_0_0_2<=p_1_2_1)
states: 643,572,802,900,536 (14)
abstracting: (p_0_2_0<=p_0_2_2)
states: 643,572,802,900,536 (14)
abstracting: (p_1_0_1<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_0_0_0<=p_1_2_2)
states: 643,572,802,900,536 (14)
abstracting: (p_2_2_1<=p_1_1_1)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_1_1_0)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_2_1_1)
states: 495,918,532,948,104 (14)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.540sec

checking: AG [~ [[[[[[[~ [[1<=p_0_0_0 & 1<=p_0_2_0]] & [1<=p_0_2_2 & [p_2_0_2<=1 | p_1_0_2<=0]]] | [[[1<=p_1_2_1 & p_1_1_0<=p_2_1_2] | ~ [p_0_2_2<=0]] & p_1_1_2<=p_0_1_0]] & [[[1<=p_2_1_0 & 1<=p_0_0_2] | ~ [[1<=p_1_1_2 | 1<=p_2_1_0]]] & [~ [1<=p_1_1_2] | [1<=p_0_1_1 | p_0_0_0<=0]]]] & [~ [[[p_2_1_0<=1 & p_0_2_0<=1] & ~ [1<=p_0_1_0]]] | [~ [[p_1_0_1<=p_0_1_2 & ~ [p_2_2_2<=p_1_0_0]]] & [~ [[1<=p_2_1_0 | p_1_1_2<=p_2_2_1]] | ~ [p_2_2_2<=p_2_0_0]]]]] & ~ [1<=p_2_2_0]] & ~ [1<=p_1_2_1]]]]
normalized: ~ [E [true U [~ [1<=p_1_2_1] & [~ [1<=p_2_2_0] & [[[[~ [p_2_2_2<=p_2_0_0] | ~ [[1<=p_2_1_0 | p_1_1_2<=p_2_2_1]]] & ~ [[p_1_0_1<=p_0_1_2 & ~ [p_2_2_2<=p_1_0_0]]]] | ~ [[~ [1<=p_0_1_0] & [p_2_1_0<=1 & p_0_2_0<=1]]]] & [[[[1<=p_0_1_1 | p_0_0_0<=0] | ~ [1<=p_1_1_2]] & [~ [[1<=p_1_1_2 | 1<=p_2_1_0]] | [1<=p_2_1_0 & 1<=p_0_0_2]]] & [[p_1_1_2<=p_0_1_0 & [~ [p_0_2_2<=0] | [1<=p_1_2_1 & p_1_1_0<=p_2_1_2]]] | [[1<=p_0_2_2 & [p_2_0_2<=1 | p_1_0_2<=0]] & ~ [[1<=p_0_0_0 & 1<=p_0_2_0]]]]]]]]]]

abstracting: (1<=p_0_2_0)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_0_0_0)
states: 495,918,532,948,104 (14)
abstracting: (p_1_0_2<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_2_0_2<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_0_2_2)
states: 495,918,532,948,104 (14)
abstracting: (p_1_1_0<=p_2_1_2)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_1_2_1)
states: 495,918,532,948,104 (14)
abstracting: (p_0_2_2<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_1_1_2<=p_0_1_0)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_0_0_2)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_2_1_0)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_2_1_0)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_1_1_2)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_1_1_2)
states: 495,918,532,948,104 (14)
abstracting: (p_0_0_0<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p_0_1_1)
states: 495,918,532,948,104 (14)
abstracting: (p_0_2_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_2_1_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_0_1_0)
states: 495,918,532,948,104 (14)
abstracting: (p_2_2_2<=p_1_0_0)
states: 643,572,802,900,536 (14)
abstracting: (p_1_0_1<=p_0_1_2)
states: 643,572,802,900,536 (14)
abstracting: (p_1_1_2<=p_2_2_1)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_2_1_0)
states: 495,918,532,948,104 (14)
abstracting: (p_2_2_2<=p_2_0_0)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_2_2_0)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_1_2_1)
states: 495,918,532,948,104 (14)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.270sec

checking: EF [[[[p_1_0_0<=0 | ~ [[p_1_2_1<=p_1_1_1 & ~ [[~ [1<=p_1_2_2] & [1<=p_2_0_2 & p_2_1_0<=p_1_1_2]]]]]] & [[1<=p_0_1_2 | p_1_2_1<=p_0_1_0] & [[[~ [p_0_2_2<=0] & [~ [p_1_0_1<=p_1_2_2] | [~ [1<=p_0_1_0] & [p_2_0_1<=p_1_2_1 & p_1_0_0<=p_1_1_1]]]] | 1<=p_2_2_2] & [[1<=p_0_2_2 & [p_2_0_0<=p_0_2_2 & [p_1_1_0<=0 | ~ [p_2_0_0<=1]]]] | p_1_0_1<=p_0_2_0]]]] & ~ [[[[[1<=p_1_1_2 & p_1_0_1<=0] & p_1_0_2<=p_2_1_2] & ~ [1<=p_2_1_1]] | 1<=p_2_1_0]]]]
normalized: E [true U [~ [[1<=p_2_1_0 | [[p_1_0_2<=p_2_1_2 & [1<=p_1_1_2 & p_1_0_1<=0]] & ~ [1<=p_2_1_1]]]] & [[[[p_1_0_1<=p_0_2_0 | [1<=p_0_2_2 & [p_2_0_0<=p_0_2_2 & [p_1_1_0<=0 | ~ [p_2_0_0<=1]]]]] & [1<=p_2_2_2 | [[[[p_2_0_1<=p_1_2_1 & p_1_0_0<=p_1_1_1] & ~ [1<=p_0_1_0]] | ~ [p_1_0_1<=p_1_2_2]] & ~ [p_0_2_2<=0]]]] & [1<=p_0_1_2 | p_1_2_1<=p_0_1_0]] & [p_1_0_0<=0 | ~ [[p_1_2_1<=p_1_1_1 & ~ [[[1<=p_2_0_2 & p_2_1_0<=p_1_1_2] & ~ [1<=p_1_2_2]]]]]]]]]

abstracting: (1<=p_1_2_2)
states: 495,918,532,948,104 (14)
abstracting: (p_2_1_0<=p_1_1_2)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_2_0_2)
states: 495,918,532,948,104 (14)
abstracting: (p_1_2_1<=p_1_1_1)
states: 643,572,802,900,536 (14)
abstracting: (p_1_0_0<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_1_2_1<=p_0_1_0)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_0_1_2)
states: 495,918,532,948,104 (14)
abstracting: (p_0_2_2<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_1_0_1<=p_1_2_2)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_0_1_0)
states: 495,918,532,948,104 (14)
abstracting: (p_1_0_0<=p_1_1_1)
states: 643,572,802,900,536 (14)
abstracting: (p_2_0_1<=p_1_2_1)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_2_2_2)
states: 495,918,532,948,104 (14)
abstracting: (p_2_0_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_1_1_0<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_2_0_0<=p_0_2_2)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_0_2_2)
states: 495,918,532,948,104 (14)
abstracting: (p_1_0_1<=p_0_2_0)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_2_1_1)
states: 495,918,532,948,104 (14)
abstracting: (p_1_0_1<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p_1_1_2)
states: 495,918,532,948,104 (14)
abstracting: (p_1_0_2<=p_2_1_2)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_2_1_0)
states: 495,918,532,948,104 (14)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 8m49.101sec

checking: AG [[1<=p_2_0_1 & [[~ [[p_0_1_2<=p_2_1_2 | [[[1<=p_1_1_2 | [p_1_0_1<=1 & 1<=p_2_0_0]] | p_1_0_1<=p_1_1_0] | ~ [[[1<=p_0_1_1 & p_1_1_1<=0] | p_1_1_0<=0]]]]] & [[[[1<=p_0_2_1 & ~ [p_0_0_1<=1]] & [~ [p_1_0_1<=p_0_2_1] | [~ [1<=p_2_0_0] | [p_1_0_0<=p_1_0_1 & 1<=p_0_0_0]]]] | p_1_2_2<=p_0_1_2] | [1<=p_1_2_2 | ~ [[[p_2_2_2<=0 | [p_1_0_1<=p_1_2_0 & p_0_1_0<=0]] | ~ [p_0_0_2<=p_0_2_0]]]]]] & [~ [p_1_2_2<=p_1_0_2] & ~ [[~ [[[p_1_1_0<=0 & p_1_1_1<=0] | ~ [1<=p_1_2_2]]] & [~ [1<=p_2_1_2] & 1<=p_0_1_1]]]]]]]
normalized: ~ [E [true U ~ [[1<=p_2_0_1 & [[~ [[[1<=p_0_1_1 & ~ [1<=p_2_1_2]] & ~ [[~ [1<=p_1_2_2] | [p_1_1_0<=0 & p_1_1_1<=0]]]]] & ~ [p_1_2_2<=p_1_0_2]] & [[[1<=p_1_2_2 | ~ [[~ [p_0_0_2<=p_0_2_0] | [p_2_2_2<=0 | [p_1_0_1<=p_1_2_0 & p_0_1_0<=0]]]]] | [p_1_2_2<=p_0_1_2 | [[[[p_1_0_0<=p_1_0_1 & 1<=p_0_0_0] | ~ [1<=p_2_0_0]] | ~ [p_1_0_1<=p_0_2_1]] & [1<=p_0_2_1 & ~ [p_0_0_1<=1]]]]] & ~ [[p_0_1_2<=p_2_1_2 | [~ [[p_1_1_0<=0 | [1<=p_0_1_1 & p_1_1_1<=0]]] | [p_1_0_1<=p_1_1_0 | [1<=p_1_1_2 | [p_1_0_1<=1 & 1<=p_2_0_0]]]]]]]]]]]]

abstracting: (1<=p_2_0_0)
states: 495,918,532,948,104 (14)
abstracting: (p_1_0_1<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_1_1_2)
states: 495,918,532,948,104 (14)
abstracting: (p_1_0_1<=p_1_1_0)
states: 643,572,802,900,536 (14)
abstracting: (p_1_1_1<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p_0_1_1)
states: 495,918,532,948,104 (14)
abstracting: (p_1_1_0<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_0_1_2<=p_2_1_2)
states: 643,572,802,900,536 (14)
abstracting: (p_0_0_1<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_0_2_1)
states: 495,918,532,948,104 (14)
abstracting: (p_1_0_1<=p_0_2_1)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_2_0_0)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_0_0_0)
states: 495,918,532,948,104 (14)
abstracting: (p_1_0_0<=p_1_0_1)
states: 643,572,802,900,536 (14)
abstracting: (p_1_2_2<=p_0_1_2)
states: 643,572,802,900,536 (14)
abstracting: (p_0_1_0<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_1_0_1<=p_1_2_0)
states: 643,572,802,900,536 (14)
abstracting: (p_2_2_2<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_0_0_2<=p_0_2_0)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_1_2_2)
states: 495,918,532,948,104 (14)
abstracting: (p_1_2_2<=p_1_0_2)
states: 643,572,802,900,536 (14)
abstracting: (p_1_1_1<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_1_1_0<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p_1_2_2)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_2_1_2)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_0_1_1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_2_0_1)
states: 495,918,532,948,104 (14)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.199sec

checking: EF [[[~ [[[~ [[~ [p_1_1_0<=p_2_1_1] | [p_0_1_0<=0 & p_2_1_1<=1]]] | ~ [p_0_0_0<=p_0_2_2]] | [~ [[~ [p_2_1_0<=p_0_2_2] | ~ [1<=p_0_0_0]]] & p_1_1_0<=p_0_0_0]]] & ~ [[[[1<=p_1_0_2 | [[~ [1<=p_2_0_0] | [p_2_2_1<=1 | p_1_0_0<=p_0_0_1]] | ~ [[p_0_1_1<=0 | p_0_0_0<=p_2_2_0]]]] & [p_1_2_0<=1 | [[[p_1_2_1<=1 & 1<=p_0_2_0] | p_2_0_2<=p_2_1_2] | [[p_0_1_2<=p_1_1_2 | p_2_1_2<=1] | ~ [p_2_2_2<=p_0_2_0]]]]] & ~ [p_1_1_1<=0]]]] & [~ [[p_2_2_2<=1 & [p_2_1_1<=p_0_1_1 & [1<=p_1_0_2 | p_2_0_0<=1]]]] & ~ [1<=p_2_1_2]]]]
normalized: E [true U [[~ [1<=p_2_1_2] & ~ [[p_2_2_2<=1 & [p_2_1_1<=p_0_1_1 & [1<=p_1_0_2 | p_2_0_0<=1]]]]] & [~ [[~ [p_1_1_1<=0] & [[p_1_2_0<=1 | [[~ [p_2_2_2<=p_0_2_0] | [p_0_1_2<=p_1_1_2 | p_2_1_2<=1]] | [p_2_0_2<=p_2_1_2 | [p_1_2_1<=1 & 1<=p_0_2_0]]]] & [1<=p_1_0_2 | [~ [[p_0_1_1<=0 | p_0_0_0<=p_2_2_0]] | [[p_2_2_1<=1 | p_1_0_0<=p_0_0_1] | ~ [1<=p_2_0_0]]]]]]] & ~ [[[p_1_1_0<=p_0_0_0 & ~ [[~ [1<=p_0_0_0] | ~ [p_2_1_0<=p_0_2_2]]]] | [~ [p_0_0_0<=p_0_2_2] | ~ [[[p_0_1_0<=0 & p_2_1_1<=1] | ~ [p_1_1_0<=p_2_1_1]]]]]]]]]

abstracting: (p_1_1_0<=p_2_1_1)
states: 643,572,802,900,536 (14)
abstracting: (p_2_1_1<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_0_1_0<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_0_0_0<=p_0_2_2)
states: 643,572,802,900,536 (14)
abstracting: (p_2_1_0<=p_0_2_2)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_0_0_0)
states: 495,918,532,948,104 (14)
abstracting: (p_1_1_0<=p_0_0_0)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_2_0_0)
states: 495,918,532,948,104 (14)
abstracting: (p_1_0_0<=p_0_0_1)
states: 643,572,802,900,536 (14)
abstracting: (p_2_2_1<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_0_0_0<=p_2_2_0)
states: 643,572,802,900,536 (14)
abstracting: (p_0_1_1<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p_1_0_2)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_0_2_0)
states: 495,918,532,948,104 (14)
abstracting: (p_1_2_1<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_2_0_2<=p_2_1_2)
states: 643,572,802,900,536 (14)
abstracting: (p_2_1_2<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_0_1_2<=p_1_1_2)
states: 643,572,802,900,536 (14)
abstracting: (p_2_2_2<=p_0_2_0)
states: 643,572,802,900,536 (14)
abstracting: (p_1_2_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_1_1_1<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_2_0_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_1_0_2)
states: 495,918,532,948,104 (14)
abstracting: (p_2_1_1<=p_0_1_1)
states: 643,572,802,900,536 (14)
abstracting: (p_2_2_2<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_2_1_2)
states: 495,918,532,948,104 (14)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.292sec

checking: EF [[[~ [[[~ [[[[p_1_0_0<=p_1_0_1 & 1<=p_1_1_0] | [p_2_2_0<=0 & p_0_0_0<=p_1_0_2]] | p_0_2_1<=p_1_2_1]] & [p_2_2_1<=1 & [~ [[1<=p_2_1_2 | p_1_2_2<=p_0_1_1]] | p_1_2_0<=p_1_0_1]]] & p_0_1_2<=1]] & p_1_1_2<=1] | [[~ [[[[~ [p_0_1_2<=1] | [p_2_0_0<=p_0_2_2 & p_2_1_0<=p_0_0_0]] | ~ [[p_2_1_2<=p_2_1_0 & 1<=p_2_1_2]]] | p_1_2_0<=p_2_1_2]] | [[~ [1<=p_0_0_0] | [p_1_2_2<=0 | [p_1_1_0<=1 & p_1_0_1<=p_2_0_2]]] | ~ [[[[p_2_2_2<=1 | p_2_2_1<=p_0_2_0] & ~ [1<=p_1_0_0]] | [[1<=p_1_2_2 | p_1_2_0<=1] | [1<=p_2_0_1 | p_2_1_1<=p_2_0_1]]]]]] & p_1_1_0<=p_0_0_1]]]
normalized: E [true U [[p_1_1_0<=p_0_0_1 & [~ [[p_1_2_0<=p_2_1_2 | [[[p_2_0_0<=p_0_2_2 & p_2_1_0<=p_0_0_0] | ~ [p_0_1_2<=1]] | ~ [[p_2_1_2<=p_2_1_0 & 1<=p_2_1_2]]]]] | [~ [[[[1<=p_2_0_1 | p_2_1_1<=p_2_0_1] | [1<=p_1_2_2 | p_1_2_0<=1]] | [~ [1<=p_1_0_0] & [p_2_2_2<=1 | p_2_2_1<=p_0_2_0]]]] | [[p_1_2_2<=0 | [p_1_1_0<=1 & p_1_0_1<=p_2_0_2]] | ~ [1<=p_0_0_0]]]]] | [p_1_1_2<=1 & ~ [[p_0_1_2<=1 & [[p_2_2_1<=1 & [p_1_2_0<=p_1_0_1 | ~ [[1<=p_2_1_2 | p_1_2_2<=p_0_1_1]]]] & ~ [[p_0_2_1<=p_1_2_1 | [[p_2_2_0<=0 & p_0_0_0<=p_1_0_2] | [p_1_0_0<=p_1_0_1 & 1<=p_1_1_0]]]]]]]]]]

abstracting: (1<=p_1_1_0)
states: 495,918,532,948,104 (14)
abstracting: (p_1_0_0<=p_1_0_1)
states: 643,572,802,900,536 (14)
abstracting: (p_0_0_0<=p_1_0_2)
states: 643,572,802,900,536 (14)
abstracting: (p_2_2_0<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_0_2_1<=p_1_2_1)
states: 643,572,802,900,536 (14)
abstracting: (p_1_2_2<=p_0_1_1)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_2_1_2)
states: 495,918,532,948,104 (14)
abstracting: (p_1_2_0<=p_1_0_1)
states: 643,572,802,900,536 (14)
abstracting: (p_2_2_1<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_0_1_2<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_1_1_2<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_0_0_0)
states: 495,918,532,948,104 (14)
abstracting: (p_1_0_1<=p_2_0_2)
states: 643,572,802,900,536 (14)
abstracting: (p_1_1_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_1_2_2<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_2_2_1<=p_0_2_0)
states: 643,572,802,900,536 (14)
abstracting: (p_2_2_2<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_1_0_0)
states: 495,918,532,948,104 (14)
abstracting: (p_1_2_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_1_2_2)
states: 495,918,532,948,104 (14)
abstracting: (p_2_1_1<=p_2_0_1)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_2_0_1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_2_1_2)
states: 495,918,532,948,104 (14)
abstracting: (p_2_1_2<=p_2_1_0)
states: 643,572,802,900,536 (14)
abstracting: (p_0_1_2<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_2_1_0<=p_0_0_0)
states: 643,572,802,900,536 (14)
abstracting: (p_2_0_0<=p_0_2_2)
states: 643,572,802,900,536 (14)
abstracting: (p_1_2_0<=p_2_1_2)
states: 643,572,802,900,536 (14)
abstracting: (p_1_1_0<=p_0_0_1)
states: 643,572,802,900,536 (14)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m15.909sec

checking: EF [[[[[[~ [p_1_1_0<=p_2_1_2] | [[p_0_0_1<=p_1_2_0 & p_1_2_2<=p_0_0_1] | ~ [[p_2_0_1<=p_1_0_1 | p_1_1_2<=p_2_0_0]]]] | [p_1_2_1<=0 | p_0_1_1<=p_0_2_2]] | [p_2_2_2<=1 & [[p_1_1_0<=p_2_2_2 | ~ [[p_0_1_1<=p_0_2_1 & 1<=p_0_1_2]]] | [~ [p_2_2_2<=0] & [[p_2_2_0<=0 & ~ [p_1_0_0<=p_0_2_2]] & 1<=p_1_2_1]]]]] | ~ [[[[[[1<=p_1_1_0 | 1<=p_0_2_1] | ~ [p_1_0_0<=1]] & p_0_1_2<=p_2_2_0] | p_0_0_1<=1] | ~ [[p_1_2_2<=1 & ~ [[p_2_0_2<=p_1_0_2 & p_2_1_2<=p_0_1_0]]]]]]] & [[~ [1<=p_1_1_0] | [~ [[[1<=p_1_1_2 & ~ [p_0_2_2<=1]] | ~ [[1<=p_1_0_1 | p_2_0_1<=p_1_0_0]]]] & [~ [p_0_1_0<=1] & ~ [[1<=p_1_0_2 | [1<=p_2_0_2 & [1<=p_2_2_2 & p_2_2_1<=1]]]]]]] & [[[[[[[1<=p_0_1_2 | p_0_1_1<=p_0_0_1] & ~ [p_0_2_1<=p_0_1_1]] | [[p_1_2_0<=p_0_0_0 | p_2_1_2<=p_0_1_0] | 1<=p_1_2_2]] | ~ [[p_2_2_0<=p_2_2_1 & p_1_2_0<=p_2_2_2]]] | [p_1_2_1<=1 & p_0_2_2<=0]] | ~ [[[~ [[p_0_2_1<=0 | 1<=p_2_0_2]] & 1<=p_2_1_2] | [~ [[p_2_0_0<=1 & 1<=p_1_1_2]] & [[1<=p_1_0_0 | p_1_0_1<=1] | p_1_2_0<=1]]]]] | [~ [[[[p_0_0_1<=0 & 1<=p_1_0_0] | [p_1_0_2<=p_0_0_1 & p_1_2_2<=0]] & p_1_0_1<=p_0_0_1]] & p_0_2_1<=p_1_2_0]]]]]
normalized: E [true U [[[[p_0_2_1<=p_1_2_0 & ~ [[p_1_0_1<=p_0_0_1 & [[p_1_0_2<=p_0_0_1 & p_1_2_2<=0] | [p_0_0_1<=0 & 1<=p_1_0_0]]]]] | [~ [[[[p_1_2_0<=1 | [1<=p_1_0_0 | p_1_0_1<=1]] & ~ [[p_2_0_0<=1 & 1<=p_1_1_2]]] | [1<=p_2_1_2 & ~ [[p_0_2_1<=0 | 1<=p_2_0_2]]]]] | [[p_1_2_1<=1 & p_0_2_2<=0] | [~ [[p_2_2_0<=p_2_2_1 & p_1_2_0<=p_2_2_2]] | [[1<=p_1_2_2 | [p_1_2_0<=p_0_0_0 | p_2_1_2<=p_0_1_0]] | [~ [p_0_2_1<=p_0_1_1] & [1<=p_0_1_2 | p_0_1_1<=p_0_0_1]]]]]]] & [[[~ [[1<=p_1_0_2 | [1<=p_2_0_2 & [1<=p_2_2_2 & p_2_2_1<=1]]]] & ~ [p_0_1_0<=1]] & ~ [[~ [[1<=p_1_0_1 | p_2_0_1<=p_1_0_0]] | [1<=p_1_1_2 & ~ [p_0_2_2<=1]]]]] | ~ [1<=p_1_1_0]]] & [~ [[~ [[p_1_2_2<=1 & ~ [[p_2_0_2<=p_1_0_2 & p_2_1_2<=p_0_1_0]]]] | [p_0_0_1<=1 | [p_0_1_2<=p_2_2_0 & [~ [p_1_0_0<=1] | [1<=p_1_1_0 | 1<=p_0_2_1]]]]]] | [[p_2_2_2<=1 & [[[1<=p_1_2_1 & [p_2_2_0<=0 & ~ [p_1_0_0<=p_0_2_2]]] & ~ [p_2_2_2<=0]] | [p_1_1_0<=p_2_2_2 | ~ [[p_0_1_1<=p_0_2_1 & 1<=p_0_1_2]]]]] | [[p_1_2_1<=0 | p_0_1_1<=p_0_2_2] | [[~ [[p_2_0_1<=p_1_0_1 | p_1_1_2<=p_2_0_0]] | [p_0_0_1<=p_1_2_0 & p_1_2_2<=p_0_0_1]] | ~ [p_1_1_0<=p_2_1_2]]]]]]]

abstracting: (p_1_1_0<=p_2_1_2)
states: 643,572,802,900,536 (14)
abstracting: (p_1_2_2<=p_0_0_1)
states: 643,572,802,900,536 (14)
abstracting: (p_0_0_1<=p_1_2_0)
states: 643,572,802,900,536 (14)
abstracting: (p_1_1_2<=p_2_0_0)
states: 643,572,802,900,536 (14)
abstracting: (p_2_0_1<=p_1_0_1)
states: 643,572,802,900,536 (14)
abstracting: (p_0_1_1<=p_0_2_2)
states: 643,572,802,900,536 (14)
abstracting: (p_1_2_1<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p_0_1_2)
states: 495,918,532,948,104 (14)
abstracting: (p_0_1_1<=p_0_2_1)
states: 643,572,802,900,536 (14)
abstracting: (p_1_1_0<=p_2_2_2)
states: 643,572,802,900,536 (14)
abstracting: (p_2_2_2<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_1_0_0<=p_0_2_2)
states: 643,572,802,900,536 (14)
abstracting: (p_2_2_0<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p_1_2_1)
states: 495,918,532,948,104 (14)
abstracting: (p_2_2_2<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_0_2_1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_1_1_0)
states: 495,918,532,948,104 (14)
abstracting: (p_1_0_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_0_1_2<=p_2_2_0)
states: 643,572,802,900,536 (14)
abstracting: (p_0_0_1<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_2_1_2<=p_0_1_0)
states: 643,572,802,900,536 (14)
abstracting: (p_2_0_2<=p_1_0_2)
states: 643,572,802,900,536 (14)
abstracting: (p_1_2_2<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_1_1_0)
states: 495,918,532,948,104 (14)
abstracting: (p_0_2_2<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_1_1_2)
states: 495,918,532,948,104 (14)
abstracting: (p_2_0_1<=p_1_0_0)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_1_0_1)
states: 495,918,532,948,104 (14)
abstracting: (p_0_1_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_2_2_1<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_2_2_2)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_2_0_2)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_1_0_2)
states: 495,918,532,948,104 (14)
abstracting: (p_0_1_1<=p_0_0_1)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_0_1_2)
states: 495,918,532,948,104 (14)
abstracting: (p_0_2_1<=p_0_1_1)
states: 643,572,802,900,536 (14)
abstracting: (p_2_1_2<=p_0_1_0)
states: 643,572,802,900,536 (14)
abstracting: (p_1_2_0<=p_0_0_0)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_1_2_2)
states: 495,918,532,948,104 (14)
abstracting: (p_1_2_0<=p_2_2_2)
states: 643,572,802,900,536 (14)
abstracting: (p_2_2_0<=p_2_2_1)
states: 643,572,802,900,536 (14)
abstracting: (p_0_2_2<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_1_2_1<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_2_0_2)
states: 495,918,532,948,104 (14)
abstracting: (p_0_2_1<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p_2_1_2)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_1_1_2)
states: 495,918,532,948,104 (14)
abstracting: (p_2_0_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (p_1_0_1<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_1_0_0)
states: 495,918,532,948,104 (14)
abstracting: (p_1_2_0<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p_1_0_0)
states: 495,918,532,948,104 (14)
abstracting: (p_0_0_1<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_1_2_2<=0)
states: 477,551,179,875,952 (14)
abstracting: (p_1_0_2<=p_0_0_1)
states: 643,572,802,900,536 (14)
abstracting: (p_1_0_1<=p_0_0_1)
states: 643,572,802,900,536 (14)
abstracting: (p_0_2_1<=p_1_2_0)
states: 643,572,802,900,536 (14)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT


BK_STOP 1678787927889

--------------------
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:40446 (249), effective:702 (4)

initing FirstDep: 0m 0.000sec


iterations count:891 (5), effective:27 (0)

iterations count:1377 (8), effective:27 (0)

iterations count:1632 (10), effective:26 (0)

iterations count:1633 (10), effective:26 (0)

iterations count:656 (4), effective:26 (0)

iterations count:5993 (36), effective:102 (0)

iterations count:6819 (42), effective:150 (0)

iterations count:6403 (39), effective:152 (0)

iterations count:3712 (22), effective:172 (1)

iterations count:3442 (21), effective:146 (0)

iterations count:11269 (69), effective:268 (1)

iterations count:18871 (116), effective:703 (4)

iterations count:619 (3), effective:47 (0)

iterations count:21982 (135), effective:569 (3)

iterations count:3581 (22), effective:195 (1)

iterations count:5933 (36), effective:324 (2)
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 447 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="NeighborGrid-PT-d3n3m1t11"
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 NeighborGrid-PT-d3n3m1t11, 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 r266-smll-167863540500094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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