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.r266-smll-167863540400086.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-d2n3m1t12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540400086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.9K Feb 26 09:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 09:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K 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.0K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 09:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 09:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 09:45 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 19K 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-d2n3m1t12-ReachabilityCardinality-00
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-01
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-02
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-03
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-04
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-05
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-06
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-07
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-08
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-09
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-10
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-11
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-12
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-13
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-14
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678785810180

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-d2n3m1t12
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 09:23:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 09:23:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:23:33] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-14 09:23:33] [INFO ] Transformed 9 places.
[2023-03-14 09:23:33] [INFO ] Transformed 72 transitions.
[2023-03-14 09:23:33] [INFO ] Parsed PT model containing 9 places and 72 transitions and 144 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10005 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 7) seen :6
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 138 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=23 )
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 485 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_d2n3m1t12
(NrP: 9 NrTr: 72 NrArc: 144)

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

net check time: 0m 0.000sec

init dd package: 0m 3.695sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 81 (8.1e+01) #states 24,310 (4)



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

checking: AG [p_2_2<=0]
normalized: ~ [E [true U ~ [p_2_2<=0]]]

abstracting: (p_2_2<=0)
states: 11,440 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [~ [p_0_2<=0]]
normalized: E [true U ~ [p_0_2<=0]]

abstracting: (p_0_2<=0)
states: 11,440 (4)
-> the formula is TRUE

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

MC time: 0m 0.001sec

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

abstracting: (p_1_0<=1)
states: 17,875 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

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

abstracting: (p_2_1<=1)
states: 17,875 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[p_0_1<=p_2_0 | 1<=p_1_1]]
normalized: ~ [E [true U ~ [[p_0_1<=p_2_0 | 1<=p_1_1]]]]

abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (p_0_1<=p_2_0)
states: 15,792 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [~ [[~ [p_2_1<=1] & ~ [[p_0_2<=p_1_0 | 1<=p_0_1]]]]]
normalized: E [true U ~ [[~ [[p_0_2<=p_1_0 | 1<=p_0_1]] & ~ [p_2_1<=1]]]]

abstracting: (p_2_1<=1)
states: 17,875 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (p_0_2<=p_1_0)
states: 15,792 (4)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EF [[p_1_2<=p_0_1 | ~ [[~ [[~ [[p_1_0<=1 | [p_0_2<=1 & 1<=p_1_1]]] & p_0_1<=p_1_0]] | 1<=p_0_0]]]]
normalized: E [true U [~ [[~ [[~ [[[p_0_2<=1 & 1<=p_1_1] | p_1_0<=1]] & p_0_1<=p_1_0]] | 1<=p_0_0]] | p_1_2<=p_0_1]]

abstracting: (p_1_2<=p_0_1)
states: 15,792 (4)
abstracting: (1<=p_0_0)
states: 12,870 (4)
abstracting: (p_0_1<=p_1_0)
states: 15,792 (4)
abstracting: (p_1_0<=1)
states: 17,875 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (p_0_2<=1)
states: 17,875 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [~ [[1<=p_1_1 & ~ [[~ [[~ [p_0_0<=p_1_2] | [p_1_2<=1 & [p_1_2<=0 & p_0_1<=p_0_1]]]] & [~ [p_2_0<=0] & p_1_2<=p_0_1]]]]]]
normalized: ~ [E [true U [~ [[[~ [p_2_0<=0] & p_1_2<=p_0_1] & ~ [[[[p_1_2<=0 & p_0_1<=p_0_1] & p_1_2<=1] | ~ [p_0_0<=p_1_2]]]]] & 1<=p_1_1]]]

abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (p_0_0<=p_1_2)
states: 15,792 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_0_1<=p_0_1)
states: 24,310 (4)
abstracting: (p_1_2<=0)
states: 11,440 (4)
abstracting: (p_1_2<=p_0_1)
states: 15,792 (4)
abstracting: (p_2_0<=0)
states: 11,440 (4)
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EF [[p_0_2<=p_2_0 & [[1<=p_2_2 & ~ [[p_2_2<=0 & [[~ [1<=p_1_0] | [~ [1<=p_1_1] | ~ [1<=p_0_2]]] | ~ [1<=p_1_1]]]]] | p_2_2<=p_1_0]]]
normalized: E [true U [[[~ [[[~ [1<=p_1_1] | [[~ [1<=p_0_2] | ~ [1<=p_1_1]] | ~ [1<=p_1_0]]] & p_2_2<=0]] & 1<=p_2_2] | p_2_2<=p_1_0] & p_0_2<=p_2_0]]

abstracting: (p_0_2<=p_2_0)
states: 15,792 (4)
abstracting: (p_2_2<=p_1_0)
states: 15,792 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (p_2_2<=0)
states: 11,440 (4)
abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [~ [[p_0_2<=p_1_2 & ~ [[[~ [[[~ [p_0_0<=0] & p_0_1<=p_2_2] & ~ [[p_1_0<=p_1_0 & 1<=p_2_2]]]] & p_0_0<=p_0_2] & 1<=p_1_1]]]]]
normalized: ~ [E [true U [~ [[[~ [[~ [[p_1_0<=p_1_0 & 1<=p_2_2]] & [~ [p_0_0<=0] & p_0_1<=p_2_2]]] & p_0_0<=p_0_2] & 1<=p_1_1]] & p_0_2<=p_1_2]]]

abstracting: (p_0_2<=p_1_2)
states: 15,792 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (p_0_0<=p_0_2)
states: 15,792 (4)
abstracting: (p_0_1<=p_2_2)
states: 15,792 (4)
abstracting: (p_0_0<=0)
states: 11,440 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (p_1_0<=p_1_0)
states: 24,310 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [~ [[~ [[p_2_1<=0 & p_0_1<=0]] & [[[[~ [[~ [1<=p_2_0] & [1<=p_1_1 & 1<=p_2_1]]] | p_2_1<=1] & [~ [[[p_0_1<=p_2_2 | 1<=p_0_1] & ~ [p_1_0<=p_0_1]]] & ~ [[~ [p_0_0<=p_0_0] & ~ [1<=p_2_1]]]]] & ~ [1<=p_1_2]] | ~ [[~ [p_1_1<=p_0_2] & ~ [[p_2_2<=0 & p_0_2<=0]]]]]]]]
normalized: ~ [E [true U [[~ [[~ [[p_2_2<=0 & p_0_2<=0]] & ~ [p_1_1<=p_0_2]]] | [~ [1<=p_1_2] & [[~ [[~ [1<=p_2_1] & ~ [p_0_0<=p_0_0]]] & ~ [[~ [p_1_0<=p_0_1] & [p_0_1<=p_2_2 | 1<=p_0_1]]]] & [~ [[[1<=p_1_1 & 1<=p_2_1] & ~ [1<=p_2_0]]] | p_2_1<=1]]]] & ~ [[p_2_1<=0 & p_0_1<=0]]]]]

abstracting: (p_0_1<=0)
states: 11,440 (4)
abstracting: (p_2_1<=0)
states: 11,440 (4)
abstracting: (p_2_1<=1)
states: 17,875 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (p_0_1<=p_2_2)
states: 15,792 (4)
abstracting: (p_1_0<=p_0_1)
states: 15,792 (4)
abstracting: (p_0_0<=p_0_0)
states: 24,310 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (p_1_1<=p_0_2)
states: 15,792 (4)
abstracting: (p_0_2<=0)
states: 11,440 (4)
abstracting: (p_2_2<=0)
states: 11,440 (4)
-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: AG [[[[~ [[~ [[p_0_0<=1 & p_2_1<=0]] & [1<=p_2_2 & p_2_1<=p_1_0]]] & [p_2_1<=p_0_0 | [[p_0_0<=p_0_2 | [~ [[p_1_1<=1 & 1<=p_2_0]] | [[p_1_2<=1 | p_2_0<=p_0_1] & ~ [1<=p_2_1]]]] | p_2_0<=p_1_1]]] | 1<=p_2_1] | ~ [[[~ [[p_1_1<=p_1_1 & [1<=p_0_1 | p_0_1<=p_0_1]]] & 1<=p_0_2] & p_1_2<=p_1_2]]]]
normalized: ~ [E [true U ~ [[~ [[[~ [[[1<=p_0_1 | p_0_1<=p_0_1] & p_1_1<=p_1_1]] & 1<=p_0_2] & p_1_2<=p_1_2]] | [[[p_2_1<=p_0_0 | [[p_0_0<=p_0_2 | [[~ [1<=p_2_1] & [p_1_2<=1 | p_2_0<=p_0_1]] | ~ [[p_1_1<=1 & 1<=p_2_0]]]] | p_2_0<=p_1_1]] & ~ [[[1<=p_2_2 & p_2_1<=p_1_0] & ~ [[p_0_0<=1 & p_2_1<=0]]]]] | 1<=p_2_1]]]]]

abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_2_1<=0)
states: 11,440 (4)
abstracting: (p_0_0<=1)
states: 17,875 (4)
abstracting: (p_2_1<=p_1_0)
states: 15,792 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (p_2_0<=p_1_1)
states: 15,792 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (p_1_1<=1)
states: 17,875 (4)
abstracting: (p_2_0<=p_0_1)
states: 15,792 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_0_0<=p_0_2)
states: 15,792 (4)
abstracting: (p_2_1<=p_0_0)
states: 15,792 (4)
abstracting: (p_1_2<=p_1_2)
states: 24,310 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
abstracting: (p_1_1<=p_1_1)
states: 24,310 (4)
abstracting: (p_0_1<=p_0_1)
states: 24,310 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EF [[p_0_0<=p_2_2 | [[~ [[~ [1<=p_1_1] & ~ [[~ [[p_1_0<=1 | p_0_1<=p_0_1]] | ~ [p_1_0<=0]]]]] & ~ [[p_2_1<=1 | [p_1_2<=0 | ~ [1<=p_0_0]]]]] & ~ [[~ [[~ [[1<=p_0_0 & [1<=p_0_2 & 1<=p_1_0]]] | [[[1<=p_0_2 | 1<=p_1_2] & [p_0_2<=1 & 1<=p_2_1]] & ~ [[p_1_2<=0 | p_2_0<=p_1_2]]]]] | [1<=p_2_2 | ~ [[[~ [p_1_0<=p_1_0] & ~ [1<=p_1_2]] & ~ [[1<=p_1_0 | 1<=p_1_2]]]]]]]]]]
normalized: E [true U [[~ [[[~ [[~ [[1<=p_1_0 | 1<=p_1_2]] & [~ [1<=p_1_2] & ~ [p_1_0<=p_1_0]]]] | 1<=p_2_2] | ~ [[[~ [[p_1_2<=0 | p_2_0<=p_1_2]] & [[p_0_2<=1 & 1<=p_2_1] & [1<=p_0_2 | 1<=p_1_2]]] | ~ [[[1<=p_0_2 & 1<=p_1_0] & 1<=p_0_0]]]]]] & [~ [[[~ [1<=p_0_0] | p_1_2<=0] | p_2_1<=1]] & ~ [[~ [[~ [p_1_0<=0] | ~ [[p_1_0<=1 | p_0_1<=p_0_1]]]] & ~ [1<=p_1_1]]]]] | p_0_0<=p_2_2]]

abstracting: (p_0_0<=p_2_2)
states: 15,792 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (p_0_1<=p_0_1)
states: 24,310 (4)
abstracting: (p_1_0<=1)
states: 17,875 (4)
abstracting: (p_1_0<=0)
states: 11,440 (4)
abstracting: (p_2_1<=1)
states: 17,875 (4)
abstracting: (p_1_2<=0)
states: 11,440 (4)
abstracting: (1<=p_0_0)
states: 12,870 (4)
abstracting: (1<=p_0_0)
states: 12,870 (4)
abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_0_2<=1)
states: 17,875 (4)
abstracting: (p_2_0<=p_1_2)
states: 15,792 (4)
abstracting: (p_1_2<=0)
states: 11,440 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (p_1_0<=p_1_0)
states: 24,310 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (1<=p_1_0)
states: 12,870 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[[1<=p_2_1 | [p_0_1<=1 | [[[[[1<=p_2_1 | p_2_2<=1] | [p_0_0<=1 | p_1_1<=p_2_1]] | [p_0_1<=1 & [p_2_2<=0 | p_0_2<=p_2_2]]] | [[[p_1_2<=1 | p_2_2<=p_1_0] | ~ [1<=p_1_1]] | ~ [1<=p_1_2]]] & ~ [p_1_2<=p_1_1]]]] & [[p_2_0<=p_0_0 | [[p_0_2<=1 & p_0_2<=p_1_2] & [[~ [p_2_1<=p_2_2] | p_0_0<=1] & [~ [p_0_2<=p_0_2] | [[p_1_1<=0 & p_0_0<=1] | [p_2_0<=p_2_0 | p_1_0<=p_2_2]]]]]] | ~ [[~ [p_0_0<=p_2_0] | [[[p_0_0<=1 & [p_0_2<=1 | p_2_1<=1]] & [~ [p_2_1<=p_0_2] | p_2_0<=1]] & p_2_0<=p_1_0]]]]] & [1<=p_1_1 | 1<=p_2_0]]]
normalized: E [true U [[1<=p_1_1 | 1<=p_2_0] & [[~ [[[[[~ [p_2_1<=p_0_2] | p_2_0<=1] & [[p_0_2<=1 | p_2_1<=1] & p_0_0<=1]] & p_2_0<=p_1_0] | ~ [p_0_0<=p_2_0]]] | [[[[[[p_2_0<=p_2_0 | p_1_0<=p_2_2] | [p_1_1<=0 & p_0_0<=1]] | ~ [p_0_2<=p_0_2]] & [~ [p_2_1<=p_2_2] | p_0_0<=1]] & [p_0_2<=1 & p_0_2<=p_1_2]] | p_2_0<=p_0_0]] & [[[~ [p_1_2<=p_1_1] & [[~ [1<=p_1_2] | [~ [1<=p_1_1] | [p_1_2<=1 | p_2_2<=p_1_0]]] | [[[p_2_2<=0 | p_0_2<=p_2_2] & p_0_1<=1] | [[p_0_0<=1 | p_1_1<=p_2_1] | [1<=p_2_1 | p_2_2<=1]]]]] | p_0_1<=1] | 1<=p_2_1]]]]

abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_0_1<=1)
states: 17,875 (4)
abstracting: (p_2_2<=1)
states: 17,875 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_1_1<=p_2_1)
states: 15,792 (4)
abstracting: (p_0_0<=1)
states: 17,875 (4)
abstracting: (p_0_1<=1)
states: 17,875 (4)
abstracting: (p_0_2<=p_2_2)
states: 15,792 (4)
abstracting: (p_2_2<=0)
states: 11,440 (4)
abstracting: (p_2_2<=p_1_0)
states: 15,792 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (p_1_2<=p_1_1)
states: 15,792 (4)
abstracting: (p_2_0<=p_0_0)
states: 15,792 (4)
abstracting: (p_0_2<=p_1_2)
states: 15,792 (4)
abstracting: (p_0_2<=1)
states: 17,875 (4)
abstracting: (p_0_0<=1)
states: 17,875 (4)
abstracting: (p_2_1<=p_2_2)
states: 15,792 (4)
abstracting: (p_0_2<=p_0_2)
states: 24,310 (4)
abstracting: (p_0_0<=1)
states: 17,875 (4)
abstracting: (p_1_1<=0)
states: 11,440 (4)
abstracting: (p_1_0<=p_2_2)
states: 15,792 (4)
abstracting: (p_2_0<=p_2_0)
states: 24,310 (4)
abstracting: (p_0_0<=p_2_0)
states: 15,792 (4)
abstracting: (p_2_0<=p_1_0)
states: 15,792 (4)
abstracting: (p_0_0<=1)
states: 17,875 (4)
abstracting: (p_2_1<=1)
states: 17,875 (4)
abstracting: (p_0_2<=1)
states: 17,875 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_2_1<=p_0_2)
states: 15,792 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: EF [[[[p_1_0<=0 & ~ [p_1_2<=0]] | [[~ [p_2_0<=0] | ~ [1<=p_2_1]] & 1<=p_1_2]] & [[~ [[p_1_0<=p_2_2 | [[p_0_1<=1 & [[p_1_2<=p_0_1 & 1<=p_1_1] | ~ [p_0_1<=p_1_1]]] & [[p_0_1<=p_2_0 | p_2_0<=p_0_0] & [p_2_1<=0 & [p_2_2<=0 | 1<=p_0_1]]]]]] & [~ [[p_2_0<=1 & [~ [[p_1_2<=p_1_1 & 1<=p_2_1]] & [[p_0_0<=1 & p_0_2<=1] & [p_1_1<=0 & p_1_2<=p_0_2]]]]] & p_2_2<=p_2_1]] & ~ [[[[p_2_0<=p_2_1 | [[[1<=p_1_0 & p_2_1<=p_2_2] & [p_0_2<=p_2_1 | p_0_2<=p_0_0]] & [~ [p_2_2<=p_0_0] | p_0_1<=1]]] | p_0_2<=1] | [[p_1_2<=1 & [~ [p_2_0<=1] | [p_1_1<=p_2_2 & ~ [p_0_0<=0]]]] & p_1_1<=0]]]]]]
normalized: E [true U [[~ [[[[[[~ [p_0_0<=0] & p_1_1<=p_2_2] | ~ [p_2_0<=1]] & p_1_2<=1] & p_1_1<=0] | [[[[~ [p_2_2<=p_0_0] | p_0_1<=1] & [[p_0_2<=p_2_1 | p_0_2<=p_0_0] & [1<=p_1_0 & p_2_1<=p_2_2]]] | p_2_0<=p_2_1] | p_0_2<=1]]] & [[~ [[[[[p_1_1<=0 & p_1_2<=p_0_2] & [p_0_0<=1 & p_0_2<=1]] & ~ [[p_1_2<=p_1_1 & 1<=p_2_1]]] & p_2_0<=1]] & p_2_2<=p_2_1] & ~ [[[[[[p_2_2<=0 | 1<=p_0_1] & p_2_1<=0] & [p_0_1<=p_2_0 | p_2_0<=p_0_0]] & [[~ [p_0_1<=p_1_1] | [p_1_2<=p_0_1 & 1<=p_1_1]] & p_0_1<=1]] | p_1_0<=p_2_2]]]] & [[[~ [1<=p_2_1] | ~ [p_2_0<=0]] & 1<=p_1_2] | [~ [p_1_2<=0] & p_1_0<=0]]]]

abstracting: (p_1_0<=0)
states: 11,440 (4)
abstracting: (p_1_2<=0)
states: 11,440 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (p_2_0<=0)
states: 11,440 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_1_0<=p_2_2)
states: 15,792 (4)
abstracting: (p_0_1<=1)
states: 17,875 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (p_1_2<=p_0_1)
states: 15,792 (4)
abstracting: (p_0_1<=p_1_1)
states: 15,792 (4)
abstracting: (p_2_0<=p_0_0)
states: 15,792 (4)
abstracting: (p_0_1<=p_2_0)
states: 15,792 (4)
abstracting: (p_2_1<=0)
states: 11,440 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (p_2_2<=0)
states: 11,440 (4)
abstracting: (p_2_2<=p_2_1)
states: 15,792 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_1_2<=p_1_1)
states: 15,792 (4)
abstracting: (p_0_2<=1)
states: 17,875 (4)
abstracting: (p_0_0<=1)
states: 17,875 (4)
abstracting: (p_1_2<=p_0_2)
states: 15,792 (4)
abstracting: (p_1_1<=0)
states: 11,440 (4)
abstracting: (p_0_2<=1)
states: 17,875 (4)
abstracting: (p_2_0<=p_2_1)
states: 15,792 (4)
abstracting: (p_2_1<=p_2_2)
states: 15,792 (4)
abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (p_0_2<=p_0_0)
states: 15,792 (4)
abstracting: (p_0_2<=p_2_1)
states: 15,792 (4)
abstracting: (p_0_1<=1)
states: 17,875 (4)
abstracting: (p_2_2<=p_0_0)
states: 15,792 (4)
abstracting: (p_1_1<=0)
states: 11,440 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_1_1<=p_2_2)
states: 15,792 (4)
abstracting: (p_0_0<=0)
states: 11,440 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [[~ [[~ [[p_2_2<=1 | p_1_2<=p_1_1]] & ~ [[[[p_2_2<=0 & ~ [p_2_2<=1]] & [[[p_2_1<=p_0_0 & 1<=p_0_1] & ~ [p_2_1<=1]] & [[p_2_0<=0 | p_1_1<=0] | ~ [1<=p_0_0]]]] | ~ [1<=p_0_0]]]]] & [[[[p_1_1<=p_2_0 | p_1_0<=p_2_2] | [[p_0_1<=0 & p_1_0<=1] & [1<=p_1_2 | ~ [p_2_2<=p_2_0]]]] & [~ [[[~ [[p_2_0<=p_1_0 | p_2_0<=p_1_1]] | [[1<=p_0_0 & 1<=p_0_0] & [p_1_1<=1 & 1<=p_1_2]]] & [[[p_0_0<=p_1_2 & p_0_0<=p_1_1] | ~ [1<=p_1_2]] & ~ [[1<=p_1_2 | 1<=p_2_2]]]]] & [~ [[p_1_1<=p_1_0 | p_1_2<=1]] | [p_0_1<=0 & ~ [p_2_2<=p_0_1]]]]] & [[[p_1_2<=p_0_1 | ~ [[[[p_1_0<=0 & p_2_0<=0] | [p_2_2<=0 & 1<=p_0_1]] & [~ [p_1_0<=0] | [1<=p_2_1 & p_0_0<=0]]]]] | ~ [[[[[p_2_2<=1 | 1<=p_0_0] & [p_1_2<=0 & 1<=p_2_2]] | ~ [p_2_1<=p_2_1]] | ~ [p_2_2<=p_2_0]]]] | [[~ [[[~ [p_1_0<=0] & [1<=p_1_0 | 1<=p_2_1]] | p_2_0<=1]] | [[[p_0_2<=p_1_2 & [p_2_2<=p_1_1 & p_1_0<=0]] & ~ [[p_1_0<=1 & p_1_2<=p_0_2]]] | p_2_0<=p_2_1]] & [~ [[[[1<=p_0_2 & p_2_1<=p_2_2] & 1<=p_2_2] | [~ [1<=p_2_1] | p_0_1<=1]]] | [[~ [[p_0_0<=p_0_0 | p_0_2<=p_2_1]] | [[1<=p_2_0 & p_1_1<=p_1_0] & [p_2_2<=0 & p_1_2<=0]]] | ~ [p_2_0<=p_0_0]]]]]]]]
normalized: E [true U [[[[[[~ [p_2_0<=p_0_0] | [[[p_2_2<=0 & p_1_2<=0] & [1<=p_2_0 & p_1_1<=p_1_0]] | ~ [[p_0_0<=p_0_0 | p_0_2<=p_2_1]]]] | ~ [[[~ [1<=p_2_1] | p_0_1<=1] | [[1<=p_0_2 & p_2_1<=p_2_2] & 1<=p_2_2]]]] & [[[~ [[p_1_0<=1 & p_1_2<=p_0_2]] & [[p_2_2<=p_1_1 & p_1_0<=0] & p_0_2<=p_1_2]] | p_2_0<=p_2_1] | ~ [[[[1<=p_1_0 | 1<=p_2_1] & ~ [p_1_0<=0]] | p_2_0<=1]]]] | [~ [[~ [p_2_2<=p_2_0] | [~ [p_2_1<=p_2_1] | [[p_1_2<=0 & 1<=p_2_2] & [p_2_2<=1 | 1<=p_0_0]]]]] | [~ [[[[1<=p_2_1 & p_0_0<=0] | ~ [p_1_0<=0]] & [[p_2_2<=0 & 1<=p_0_1] | [p_1_0<=0 & p_2_0<=0]]]] | p_1_2<=p_0_1]]] & [[[[~ [p_2_2<=p_0_1] & p_0_1<=0] | ~ [[p_1_1<=p_1_0 | p_1_2<=1]]] & ~ [[[~ [[1<=p_1_2 | 1<=p_2_2]] & [~ [1<=p_1_2] | [p_0_0<=p_1_2 & p_0_0<=p_1_1]]] & [[[p_1_1<=1 & 1<=p_1_2] & [1<=p_0_0 & 1<=p_0_0]] | ~ [[p_2_0<=p_1_0 | p_2_0<=p_1_1]]]]]] & [[[~ [p_2_2<=p_2_0] | 1<=p_1_2] & [p_0_1<=0 & p_1_0<=1]] | [p_1_1<=p_2_0 | p_1_0<=p_2_2]]]] & ~ [[~ [[~ [1<=p_0_0] | [[[~ [1<=p_0_0] | [p_2_0<=0 | p_1_1<=0]] & [~ [p_2_1<=1] & [p_2_1<=p_0_0 & 1<=p_0_1]]] & [~ [p_2_2<=1] & p_2_2<=0]]]] & ~ [[p_2_2<=1 | p_1_2<=p_1_1]]]]]]

abstracting: (p_1_2<=p_1_1)
states: 15,792 (4)
abstracting: (p_2_2<=1)
states: 17,875 (4)
abstracting: (p_2_2<=0)
states: 11,440 (4)
abstracting: (p_2_2<=1)
states: 17,875 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (p_2_1<=p_0_0)
states: 15,792 (4)
abstracting: (p_2_1<=1)
states: 17,875 (4)
abstracting: (p_1_1<=0)
states: 11,440 (4)
abstracting: (p_2_0<=0)
states: 11,440 (4)
abstracting: (1<=p_0_0)
states: 12,870 (4)
abstracting: (1<=p_0_0)
states: 12,870 (4)
abstracting: (p_1_0<=p_2_2)
states: 15,792 (4)
abstracting: (p_1_1<=p_2_0)
states: 15,792 (4)
abstracting: (p_1_0<=1)
states: 17,875 (4)
abstracting: (p_0_1<=0)
states: 11,440 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (p_2_2<=p_2_0)
states: 15,792 (4)
abstracting: (p_2_0<=p_1_1)
states: 15,792 (4)
abstracting: (p_2_0<=p_1_0)
states: 15,792 (4)
abstracting: (1<=p_0_0)
states: 12,870 (4)
abstracting: (1<=p_0_0)
states: 12,870 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (p_1_1<=1)
states: 17,875 (4)
abstracting: (p_0_0<=p_1_1)
states: 15,792 (4)
abstracting: (p_0_0<=p_1_2)
states: 15,792 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_1_1<=p_1_0)
states: 15,792 (4)
abstracting: (p_0_1<=0)
states: 11,440 (4)
abstracting: (p_2_2<=p_0_1)
states: 15,792 (4)
abstracting: (p_1_2<=p_0_1)
states: 15,792 (4)
abstracting: (p_2_0<=0)
states: 11,440 (4)
abstracting: (p_1_0<=0)
states: 11,440 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (p_2_2<=0)
states: 11,440 (4)
abstracting: (p_1_0<=0)
states: 11,440 (4)
abstracting: (p_0_0<=0)
states: 11,440 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (1<=p_0_0)
states: 12,870 (4)
abstracting: (p_2_2<=1)
states: 17,875 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (p_1_2<=0)
states: 11,440 (4)
abstracting: (p_2_1<=p_2_1)
states: 24,310 (4)
abstracting: (p_2_2<=p_2_0)
states: 15,792 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_1_0<=0)
states: 11,440 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (p_2_0<=p_2_1)
states: 15,792 (4)
abstracting: (p_0_2<=p_1_2)
states: 15,792 (4)
abstracting: (p_1_0<=0)
states: 11,440 (4)
abstracting: (p_2_2<=p_1_1)
states: 15,792 (4)
abstracting: (p_1_2<=p_0_2)
states: 15,792 (4)
abstracting: (p_1_0<=1)
states: 17,875 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (p_2_1<=p_2_2)
states: 15,792 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
abstracting: (p_0_1<=1)
states: 17,875 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_0_2<=p_2_1)
states: 15,792 (4)
abstracting: (p_0_0<=p_0_0)
states: 24,310 (4)
abstracting: (p_1_1<=p_1_0)
states: 15,792 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (p_1_2<=0)
states: 11,440 (4)
abstracting: (p_2_2<=0)
states: 11,440 (4)
abstracting: (p_2_0<=p_0_0)
states: 15,792 (4)
-> the formula is TRUE

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

MC time: 0m 0.011sec

totally nodes used: 17465 (1.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 225836 57589 283425
used/not used/entry size/cache size: 64346 67044518 16 1024MB
basic ops cache: hits/miss/sum: 80080 29472 109552
used/not used/entry size/cache size: 58521 16718695 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: 9747 2258 12005
used/not used/entry size/cache size: 2258 8386350 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 67093017
1 15235
2 357
3 97
4 54
5 16
6 17
7 13
8 8
9 9
>= 10 41

Total processing time: 0m 5.569sec


BK_STOP 1678785820855

--------------------
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:1720 (23), effective:72 (1)

initing FirstDep: 0m 0.000sec


iterations count:249 (3), effective:8 (0)

iterations count:249 (3), effective:8 (0)

iterations count:426 (5), effective:16 (0)

iterations count:426 (5), effective:16 (0)

iterations count:609 (8), effective:36 (0)

iterations count:77 (1), effective:2 (0)

iterations count:241 (3), effective:27 (0)

iterations count:252 (3), effective:11 (0)

iterations count:99 (1), effective:9 (0)

iterations count:122 (1), effective:14 (0)

iterations count:294 (4), effective:24 (0)

iterations count:90 (1), effective:9 (0)

iterations count:228 (3), effective:15 (0)

iterations count:1464 (20), effective:66 (0)

iterations count:551 (7), effective:57 (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="NeighborGrid-PT-d2n3m1t12"
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-d2n3m1t12, 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-167863540400086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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