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.r193-smll-167840340600374.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 marcie
Input is HexagonalGrid-PT-110, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r193-smll-167840340600374
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.7K Feb 26 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 17:00 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 3.6K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 17:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 17:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 29K Mar 5 18:22 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 HexagonalGrid-PT-110-ReachabilityCardinality-00
FORMULA_NAME HexagonalGrid-PT-110-ReachabilityCardinality-01
FORMULA_NAME HexagonalGrid-PT-110-ReachabilityCardinality-02
FORMULA_NAME HexagonalGrid-PT-110-ReachabilityCardinality-03
FORMULA_NAME HexagonalGrid-PT-110-ReachabilityCardinality-04
FORMULA_NAME HexagonalGrid-PT-110-ReachabilityCardinality-05
FORMULA_NAME HexagonalGrid-PT-110-ReachabilityCardinality-06
FORMULA_NAME HexagonalGrid-PT-110-ReachabilityCardinality-07
FORMULA_NAME HexagonalGrid-PT-110-ReachabilityCardinality-08
FORMULA_NAME HexagonalGrid-PT-110-ReachabilityCardinality-09
FORMULA_NAME HexagonalGrid-PT-110-ReachabilityCardinality-10
FORMULA_NAME HexagonalGrid-PT-110-ReachabilityCardinality-11
FORMULA_NAME HexagonalGrid-PT-110-ReachabilityCardinality-12
FORMULA_NAME HexagonalGrid-PT-110-ReachabilityCardinality-13
FORMULA_NAME HexagonalGrid-PT-110-ReachabilityCardinality-14
FORMULA_NAME HexagonalGrid-PT-110-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679876203985

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=marcie
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HexagonalGrid-PT-110
Not applying reductions.
Model is PT
ReachabilityCardinality PT
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//../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: HexagonalGrid_PT_110
(NrP: 31 NrTr: 42 NrArc: 168)

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

net check time: 0m 0.000sec

init dd package: 0m 3.371sec


RS generation: 0m 0.022sec


-> reachability set: #nodes 679 (6.8e+02) #states 40,193 (4)



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

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

abstracting: (pil5_1_1<=1)
states: 40,193 (4)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (pi2_1_1<=1)
states: 40,193 (4)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (pil4_1_1<=1)
states: 40,193 (4)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

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

abstracting: (po2_1_1<=pol3_1_1)
states: 37,632 (4)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [pi3_1_1<=pil1_1_1]
normalized: ~ [E [true U ~ [pi3_1_1<=pil1_1_1]]]

abstracting: (pi3_1_1<=pil1_1_1)
states: 37,632 (4)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: AG [[po1_1_1<=pil5_1_1 | [pi3_1_1<=1 | 1<=pil4_1_1]]]
normalized: ~ [E [true U ~ [[[pi3_1_1<=1 | 1<=pil4_1_1] | po1_1_1<=pil5_1_1]]]]

abstracting: (po1_1_1<=pil5_1_1)
states: 37,632 (4)
abstracting: (1<=pil4_1_1)
states: 29,568 (4)
abstracting: (pi3_1_1<=1)
states: 40,193 (4)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[[~ [po2_1_1<=0] | [pil3_1_1<=pb2_1_1 | ~ [[po2_1_1<=po6_1_1 & 1<=po3_1_1]]]] | pil1_1_1<=1] | po6_1_1<=1]]
normalized: ~ [E [true U ~ [[[[[~ [[po2_1_1<=po6_1_1 & 1<=po3_1_1]] | pil3_1_1<=pb2_1_1] | ~ [po2_1_1<=0]] | pil1_1_1<=1] | po6_1_1<=1]]]]

abstracting: (po6_1_1<=1)
states: 40,193 (4)
abstracting: (pil1_1_1<=1)
states: 40,193 (4)
abstracting: (po2_1_1<=0)
states: 29,568 (4)
abstracting: (pil3_1_1<=pb2_1_1)
states: 21,250 (4)
abstracting: (1<=po3_1_1)
states: 10,625 (4)
abstracting: (po2_1_1<=po6_1_1)
states: 32,129 (4)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[1<=pol3_1_1 & pil6_1_1<=pol1_1_1] | [pi5_1_1<=1 | ~ [[~ [[[po4_1_1<=1 | 1<=pol6_1_1] | pi6_1_1<=po5_1_1]] & [~ [pol3_1_1<=pil3_1_1] & [~ [pb4_1_1<=0] & ~ [pi6_1_1<=0]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[[~ [pi6_1_1<=0] & ~ [pb4_1_1<=0]] & ~ [pol3_1_1<=pil3_1_1]] & ~ [[[po4_1_1<=1 | 1<=pol6_1_1] | pi6_1_1<=po5_1_1]]]] | pi5_1_1<=1] | [1<=pol3_1_1 & pil6_1_1<=pol1_1_1]]]]]

abstracting: (pil6_1_1<=pol1_1_1)
states: 32,129 (4)
abstracting: (1<=pol3_1_1)
states: 29,568 (4)
abstracting: (pi5_1_1<=1)
states: 40,193 (4)
abstracting: (pi6_1_1<=po5_1_1)
states: 32,129 (4)
abstracting: (1<=pol6_1_1)
states: 29,568 (4)
abstracting: (po4_1_1<=1)
states: 40,193 (4)
abstracting: (pol3_1_1<=pil3_1_1)
states: 32,129 (4)
abstracting: (pb4_1_1<=0)
states: 26,351 (4)
abstracting: (pi6_1_1<=0)
states: 29,568 (4)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[po1_1_1<=1 | [[pbl_1_1<=pil4_1_1 | ~ [[[~ [[1<=pb6_1_1 & pi4_1_1<=pb3_1_1]] & [[[1<=pol4_1_1 | 1<=pb3_1_1] & pi6_1_1<=1] & [pol3_1_1<=0 | [pil5_1_1<=0 | pi4_1_1<=1]]]] | ~ [1<=pi4_1_1]]]] | ~ [[1<=pb6_1_1 | pol1_1_1<=pol6_1_1]]]]]
normalized: ~ [E [true U ~ [[po1_1_1<=1 | [~ [[1<=pb6_1_1 | pol1_1_1<=pol6_1_1]] | [~ [[~ [1<=pi4_1_1] | [[[[pil5_1_1<=0 | pi4_1_1<=1] | pol3_1_1<=0] & [[1<=pol4_1_1 | 1<=pb3_1_1] & pi6_1_1<=1]] & ~ [[1<=pb6_1_1 & pi4_1_1<=pb3_1_1]]]]] | pbl_1_1<=pil4_1_1]]]]]]

abstracting: (pbl_1_1<=pil4_1_1)
states: 3,234 (3)
abstracting: (pi4_1_1<=pb3_1_1)
states: 32,785 (4)
abstracting: (1<=pb6_1_1)
states: 13,842 (4)
abstracting: (pi6_1_1<=1)
states: 40,193 (4)
abstracting: (1<=pb3_1_1)
states: 13,842 (4)
abstracting: (1<=pol4_1_1)
states: 29,568 (4)
abstracting: (pol3_1_1<=0)
states: 10,625 (4)
abstracting: (pi4_1_1<=1)
states: 40,193 (4)
abstracting: (pil5_1_1<=0)
states: 10,625 (4)
abstracting: (1<=pi4_1_1)
states: 10,625 (4)
abstracting: (pol1_1_1<=pol6_1_1)
states: 32,129 (4)
abstracting: (1<=pb6_1_1)
states: 13,842 (4)
abstracting: (po1_1_1<=1)
states: 40,193 (4)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [~ [[~ [[~ [pil4_1_1<=pol2_1_1] | ~ [[pol5_1_1<=0 | [pol1_1_1<=0 & [~ [pi1_1_1<=1] | [pb1_1_1<=1 & 1<=pil5_1_1]]]]]]] & ~ [[~ [pbl_1_1<=pb4_1_1] | ~ [[~ [[[pol6_1_1<=po3_1_1 | pol4_1_1<=1] & [pi5_1_1<=0 | po4_1_1<=pol1_1_1]]] & ~ [[1<=pol1_1_1 & pi3_1_1<=1]]]]]]]]]
normalized: ~ [E [true U [~ [[~ [[~ [[1<=pol1_1_1 & pi3_1_1<=1]] & ~ [[[pi5_1_1<=0 | po4_1_1<=pol1_1_1] & [pol6_1_1<=po3_1_1 | pol4_1_1<=1]]]]] | ~ [pbl_1_1<=pb4_1_1]]] & ~ [[~ [[[[[pb1_1_1<=1 & 1<=pil5_1_1] | ~ [pi1_1_1<=1]] & pol1_1_1<=0] | pol5_1_1<=0]] | ~ [pil4_1_1<=pol2_1_1]]]]]]

abstracting: (pil4_1_1<=pol2_1_1)
states: 32,129 (4)
abstracting: (pol5_1_1<=0)
states: 10,625 (4)
abstracting: (pol1_1_1<=0)
states: 10,625 (4)
abstracting: (pi1_1_1<=1)
states: 40,193 (4)
abstracting: (1<=pil5_1_1)
states: 29,568 (4)
abstracting: (pb1_1_1<=1)
states: 36,194 (4)
abstracting: (pbl_1_1<=pb4_1_1)
states: 3,580 (3)
abstracting: (pol4_1_1<=1)
states: 40,193 (4)
abstracting: (pol6_1_1<=po3_1_1)
states: 18,689 (4)
abstracting: (po4_1_1<=pol1_1_1)
states: 37,632 (4)
abstracting: (pi5_1_1<=0)
states: 29,568 (4)
abstracting: (pi3_1_1<=1)
states: 40,193 (4)
abstracting: (1<=pol1_1_1)
states: 29,568 (4)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [~ [[[pbl_1_1<=0 | 1<=pol1_1_1] & ~ [[[~ [[pi5_1_1<=pb3_1_1 | ~ [pb5_1_1<=1]]] | ~ [[1<=pi2_1_1 & pol4_1_1<=pol2_1_1]]] | [1<=pil1_1_1 | [[pb2_1_1<=pb5_1_1 & [[1<=pi5_1_1 | pol1_1_1<=1] & [pol3_1_1<=pol5_1_1 | pil2_1_1<=pi1_1_1]]] | pb6_1_1<=1]]]]]]]
normalized: ~ [E [true U [~ [[[[[[[pol3_1_1<=pol5_1_1 | pil2_1_1<=pi1_1_1] & [1<=pi5_1_1 | pol1_1_1<=1]] & pb2_1_1<=pb5_1_1] | pb6_1_1<=1] | 1<=pil1_1_1] | [~ [[1<=pi2_1_1 & pol4_1_1<=pol2_1_1]] | ~ [[~ [pb5_1_1<=1] | pi5_1_1<=pb3_1_1]]]]] & [pbl_1_1<=0 | 1<=pol1_1_1]]]]

abstracting: (1<=pol1_1_1)
states: 29,568 (4)
abstracting: (pbl_1_1<=0)
states: 462
abstracting: (pi5_1_1<=pb3_1_1)
states: 32,785 (4)
abstracting: (pb5_1_1<=1)
states: 36,194 (4)
abstracting: (pol4_1_1<=pol2_1_1)
states: 32,129 (4)
abstracting: (1<=pi2_1_1)
states: 10,625 (4)
abstracting: (1<=pil1_1_1)
states: 29,568 (4)
abstracting: (pb6_1_1<=1)
states: 36,194 (4)
abstracting: (pb2_1_1<=pb5_1_1)
states: 29,568 (4)
abstracting: (pol1_1_1<=1)
states: 40,193 (4)
abstracting: (1<=pi5_1_1)
states: 10,625 (4)
abstracting: (pil2_1_1<=pi1_1_1)
states: 18,689 (4)
abstracting: (pol3_1_1<=pol5_1_1)
states: 32,129 (4)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: EF [~ [[[[pb5_1_1<=pil2_1_1 | 1<=pol3_1_1] & [[~ [[1<=pb3_1_1 & pol6_1_1<=0]] & pol4_1_1<=0] & [[~ [[pb1_1_1<=1 | ~ [pi6_1_1<=0]]] | [~ [[1<=pil6_1_1 & pil1_1_1<=pol3_1_1]] | [[pb6_1_1<=pil1_1_1 | po4_1_1<=pb6_1_1] | [1<=po2_1_1 & 1<=po4_1_1]]]] & [pol4_1_1<=pi5_1_1 | pil3_1_1<=pbl_1_1]]]] | pi4_1_1<=pb5_1_1]]]
normalized: E [true U ~ [[pi4_1_1<=pb5_1_1 | [[[[pol4_1_1<=pi5_1_1 | pil3_1_1<=pbl_1_1] & [[[[1<=po2_1_1 & 1<=po4_1_1] | [pb6_1_1<=pil1_1_1 | po4_1_1<=pb6_1_1]] | ~ [[1<=pil6_1_1 & pil1_1_1<=pol3_1_1]]] | ~ [[pb1_1_1<=1 | ~ [pi6_1_1<=0]]]]] & [pol4_1_1<=0 & ~ [[1<=pb3_1_1 & pol6_1_1<=0]]]] & [pb5_1_1<=pil2_1_1 | 1<=pol3_1_1]]]]]

abstracting: (1<=pol3_1_1)
states: 29,568 (4)
abstracting: (pb5_1_1<=pil2_1_1)
states: 33,759 (4)
abstracting: (pol6_1_1<=0)
states: 10,625 (4)
abstracting: (1<=pb3_1_1)
states: 13,842 (4)
abstracting: (pol4_1_1<=0)
states: 10,625 (4)
abstracting: (pi6_1_1<=0)
states: 29,568 (4)
abstracting: (pb1_1_1<=1)
states: 36,194 (4)
abstracting: (pil1_1_1<=pol3_1_1)
states: 32,129 (4)
abstracting: (1<=pil6_1_1)
states: 29,568 (4)
abstracting: (po4_1_1<=pb6_1_1)
states: 32,785 (4)
abstracting: (pb6_1_1<=pil1_1_1)
states: 33,759 (4)
abstracting: (1<=po4_1_1)
states: 10,625 (4)
abstracting: (1<=po2_1_1)
states: 10,625 (4)
abstracting: (pil3_1_1<=pbl_1_1)
states: 39,731 (4)
abstracting: (pol4_1_1<=pi5_1_1)
states: 18,689 (4)
abstracting: (pi4_1_1<=pb5_1_1)
states: 32,785 (4)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: EF [[[~ [[~ [[~ [[pi3_1_1<=1 | po3_1_1<=po4_1_1]] & pb2_1_1<=pil5_1_1]] & ~ [[[[~ [pil5_1_1<=0] & ~ [po4_1_1<=1]] & pi6_1_1<=1] & ~ [pil3_1_1<=1]]]]] | ~ [[pb1_1_1<=1 | 1<=pil5_1_1]]] & [~ [pol6_1_1<=pil2_1_1] & [[~ [[[[pi2_1_1<=1 & pb3_1_1<=1] & pi3_1_1<=1] & [pb5_1_1<=pil2_1_1 | pol4_1_1<=pi5_1_1]]] & pi2_1_1<=po5_1_1] & [[~ [1<=pi2_1_1] & pil4_1_1<=1] | ~ [pb2_1_1<=1]]]]]]
normalized: E [true U [[[[~ [pb2_1_1<=1] | [pil4_1_1<=1 & ~ [1<=pi2_1_1]]] & [pi2_1_1<=po5_1_1 & ~ [[[pb5_1_1<=pil2_1_1 | pol4_1_1<=pi5_1_1] & [pi3_1_1<=1 & [pi2_1_1<=1 & pb3_1_1<=1]]]]]] & ~ [pol6_1_1<=pil2_1_1]] & [~ [[pb1_1_1<=1 | 1<=pil5_1_1]] | ~ [[~ [[~ [pil3_1_1<=1] & [pi6_1_1<=1 & [~ [po4_1_1<=1] & ~ [pil5_1_1<=0]]]]] & ~ [[pb2_1_1<=pil5_1_1 & ~ [[pi3_1_1<=1 | po3_1_1<=po4_1_1]]]]]]]]]

abstracting: (po3_1_1<=po4_1_1)
states: 32,129 (4)
abstracting: (pi3_1_1<=1)
states: 40,193 (4)
abstracting: (pb2_1_1<=pil5_1_1)
states: 33,759 (4)
abstracting: (pil5_1_1<=0)
states: 10,625 (4)
abstracting: (po4_1_1<=1)
states: 40,193 (4)
abstracting: (pi6_1_1<=1)
states: 40,193 (4)
abstracting: (pil3_1_1<=1)
states: 40,193 (4)
abstracting: (1<=pil5_1_1)
states: 29,568 (4)
abstracting: (pb1_1_1<=1)
states: 36,194 (4)
abstracting: (pol6_1_1<=pil2_1_1)
states: 32,129 (4)
abstracting: (pb3_1_1<=1)
states: 36,194 (4)
abstracting: (pi2_1_1<=1)
states: 40,193 (4)
abstracting: (pi3_1_1<=1)
states: 40,193 (4)
abstracting: (pol4_1_1<=pi5_1_1)
states: 18,689 (4)
abstracting: (pb5_1_1<=pil2_1_1)
states: 33,759 (4)
abstracting: (pi2_1_1<=po5_1_1)
states: 32,129 (4)
abstracting: (1<=pi2_1_1)
states: 10,625 (4)
abstracting: (pil4_1_1<=1)
states: 40,193 (4)
abstracting: (pb2_1_1<=1)
states: 36,194 (4)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [~ [[[1<=pbl_1_1 | [~ [pi3_1_1<=pi1_1_1] & ~ [[[pi1_1_1<=pbl_1_1 & [~ [pol1_1_1<=pil3_1_1] | [pi6_1_1<=po3_1_1 & 1<=pi3_1_1]]] | [~ [pil4_1_1<=po4_1_1] | ~ [[1<=po2_1_1 | pi2_1_1<=1]]]]]]] | ~ [[[[[~ [[po4_1_1<=po5_1_1 | 1<=pbl_1_1]] & pil6_1_1<=1] & ~ [[[pil1_1_1<=1 & 1<=pb3_1_1] & ~ [pi4_1_1<=pi3_1_1]]]] & ~ [[[1<=pol3_1_1 | po5_1_1<=pol5_1_1] & [pb6_1_1<=pol3_1_1 & pi4_1_1<=pbl_1_1]]]] | pol5_1_1<=pi4_1_1]]]]]
normalized: E [true U ~ [[~ [[pol5_1_1<=pi4_1_1 | [~ [[[pb6_1_1<=pol3_1_1 & pi4_1_1<=pbl_1_1] & [1<=pol3_1_1 | po5_1_1<=pol5_1_1]]] & [~ [[~ [pi4_1_1<=pi3_1_1] & [pil1_1_1<=1 & 1<=pb3_1_1]]] & [pil6_1_1<=1 & ~ [[po4_1_1<=po5_1_1 | 1<=pbl_1_1]]]]]]] | [1<=pbl_1_1 | [~ [[[~ [[1<=po2_1_1 | pi2_1_1<=1]] | ~ [pil4_1_1<=po4_1_1]] | [pi1_1_1<=pbl_1_1 & [[pi6_1_1<=po3_1_1 & 1<=pi3_1_1] | ~ [pol1_1_1<=pil3_1_1]]]]] & ~ [pi3_1_1<=pi1_1_1]]]]]]

abstracting: (pi3_1_1<=pi1_1_1)
states: 32,129 (4)
abstracting: (pol1_1_1<=pil3_1_1)
states: 32,129 (4)
abstracting: (1<=pi3_1_1)
states: 10,625 (4)
abstracting: (pi6_1_1<=po3_1_1)
states: 32,129 (4)
abstracting: (pi1_1_1<=pbl_1_1)
states: 40,193 (4)
abstracting: (pil4_1_1<=po4_1_1)
states: 18,689 (4)
abstracting: (pi2_1_1<=1)
states: 40,193 (4)
abstracting: (1<=po2_1_1)
states: 10,625 (4)
abstracting: (1<=pbl_1_1)
states: 39,731 (4)
abstracting: (1<=pbl_1_1)
states: 39,731 (4)
abstracting: (po4_1_1<=po5_1_1)
states: 32,129 (4)
abstracting: (pil6_1_1<=1)
states: 40,193 (4)
abstracting: (1<=pb3_1_1)
states: 13,842 (4)
abstracting: (pil1_1_1<=1)
states: 40,193 (4)
abstracting: (pi4_1_1<=pi3_1_1)
states: 32,129 (4)
abstracting: (po5_1_1<=pol5_1_1)
states: 29,568 (4)
abstracting: (1<=pol3_1_1)
states: 29,568 (4)
abstracting: (pi4_1_1<=pbl_1_1)
states: 40,193 (4)
abstracting: (pb6_1_1<=pol3_1_1)
states: 33,759 (4)
abstracting: (pol5_1_1<=pi4_1_1)
states: 18,689 (4)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [[pil1_1_1<=pb6_1_1 | [pi2_1_1<=po1_1_1 | [[[[[[1<=pol2_1_1 | [1<=pi6_1_1 | 1<=pol2_1_1]] & [[pil1_1_1<=1 & 1<=pol6_1_1] | po1_1_1<=po4_1_1]] & [1<=po3_1_1 | [~ [1<=pi1_1_1] & pi5_1_1<=po1_1_1]]] & [[[[1<=pil6_1_1 & 1<=pb5_1_1] & 1<=po5_1_1] & [~ [1<=pil3_1_1] | 1<=pi6_1_1]] | ~ [[[pb2_1_1<=1 | pi1_1_1<=1] & pbl_1_1<=po1_1_1]]]] | [[[~ [[pil6_1_1<=0 | pi6_1_1<=po2_1_1]] | [~ [pol5_1_1<=0] | pi5_1_1<=po5_1_1]] & ~ [1<=pb6_1_1]] & ~ [1<=pb3_1_1]]] & [~ [pb6_1_1<=0] | [[~ [[~ [1<=pb2_1_1] | ~ [pil3_1_1<=1]]] & [[[1<=pb3_1_1 | pol1_1_1<=1] | [pil3_1_1<=po5_1_1 | 1<=pi3_1_1]] | ~ [1<=pil2_1_1]]] & ~ [[~ [[po1_1_1<=pbl_1_1 & pi2_1_1<=0]] | pol6_1_1<=1]]]]]]]]
normalized: ~ [E [true U ~ [[pil1_1_1<=pb6_1_1 | [pi2_1_1<=po1_1_1 | [[[~ [[pol6_1_1<=1 | ~ [[po1_1_1<=pbl_1_1 & pi2_1_1<=0]]]] & [[~ [1<=pil2_1_1] | [[pil3_1_1<=po5_1_1 | 1<=pi3_1_1] | [1<=pb3_1_1 | pol1_1_1<=1]]] & ~ [[~ [pil3_1_1<=1] | ~ [1<=pb2_1_1]]]]] | ~ [pb6_1_1<=0]] & [[~ [1<=pb3_1_1] & [~ [1<=pb6_1_1] & [[pi5_1_1<=po5_1_1 | ~ [pol5_1_1<=0]] | ~ [[pil6_1_1<=0 | pi6_1_1<=po2_1_1]]]]] | [[~ [[pbl_1_1<=po1_1_1 & [pb2_1_1<=1 | pi1_1_1<=1]]] | [[1<=pi6_1_1 | ~ [1<=pil3_1_1]] & [1<=po5_1_1 & [1<=pil6_1_1 & 1<=pb5_1_1]]]] & [[1<=po3_1_1 | [pi5_1_1<=po1_1_1 & ~ [1<=pi1_1_1]]] & [[po1_1_1<=po4_1_1 | [pil1_1_1<=1 & 1<=pol6_1_1]] & [1<=pol2_1_1 | [1<=pi6_1_1 | 1<=pol2_1_1]]]]]]]]]]]]

abstracting: (1<=pol2_1_1)
states: 29,568 (4)
abstracting: (1<=pi6_1_1)
states: 10,625 (4)
abstracting: (1<=pol2_1_1)
states: 29,568 (4)
abstracting: (1<=pol6_1_1)
states: 29,568 (4)
abstracting: (pil1_1_1<=1)
states: 40,193 (4)
abstracting: (po1_1_1<=po4_1_1)
states: 32,129 (4)
abstracting: (1<=pi1_1_1)
states: 10,625 (4)
abstracting: (pi5_1_1<=po1_1_1)
states: 32,129 (4)
abstracting: (1<=po3_1_1)
states: 10,625 (4)
abstracting: (1<=pb5_1_1)
states: 13,842 (4)
abstracting: (1<=pil6_1_1)
states: 29,568 (4)
abstracting: (1<=po5_1_1)
states: 10,625 (4)
abstracting: (1<=pil3_1_1)
states: 29,568 (4)
abstracting: (1<=pi6_1_1)
states: 10,625 (4)
abstracting: (pi1_1_1<=1)
states: 40,193 (4)
abstracting: (pb2_1_1<=1)
states: 36,194 (4)
abstracting: (pbl_1_1<=po1_1_1)
states: 714
abstracting: (pi6_1_1<=po2_1_1)
states: 32,129 (4)
abstracting: (pil6_1_1<=0)
states: 10,625 (4)
abstracting: (pol5_1_1<=0)
states: 10,625 (4)
abstracting: (pi5_1_1<=po5_1_1)
states: 32,129 (4)
abstracting: (1<=pb6_1_1)
states: 13,842 (4)
abstracting: (1<=pb3_1_1)
states: 13,842 (4)
abstracting: (pb6_1_1<=0)
states: 26,351 (4)
abstracting: (1<=pb2_1_1)
states: 13,842 (4)
abstracting: (pil3_1_1<=1)
states: 40,193 (4)
abstracting: (pol1_1_1<=1)
states: 40,193 (4)
abstracting: (1<=pb3_1_1)
states: 13,842 (4)
abstracting: (1<=pi3_1_1)
states: 10,625 (4)
abstracting: (pil3_1_1<=po5_1_1)
states: 18,689 (4)
abstracting: (1<=pil2_1_1)
states: 29,568 (4)
abstracting: (pi2_1_1<=0)
states: 29,568 (4)
abstracting: (po1_1_1<=pbl_1_1)
states: 40,193 (4)
abstracting: (pol6_1_1<=1)
states: 40,193 (4)
abstracting: (pi2_1_1<=po1_1_1)
states: 32,129 (4)
abstracting: (pil1_1_1<=pb6_1_1)
states: 21,250 (4)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: EF [[[[[[[1<=pb5_1_1 & [[[pil1_1_1<=po5_1_1 & po5_1_1<=0] & [pi4_1_1<=1 & 1<=pb2_1_1]] & po4_1_1<=1]] & [[~ [[pil2_1_1<=1 | pol1_1_1<=1]] & [1<=pil3_1_1 | ~ [pb6_1_1<=pb1_1_1]]] & [1<=pol5_1_1 | 1<=pi4_1_1]]] & [[[[~ [1<=pi2_1_1] | po2_1_1<=pol4_1_1] & [~ [po4_1_1<=pil6_1_1] | ~ [pi6_1_1<=pbl_1_1]]] | [[[po5_1_1<=pb1_1_1 & 1<=pil2_1_1] | 1<=pi1_1_1] & [~ [po4_1_1<=pb2_1_1] | pol3_1_1<=po4_1_1]]] & 1<=po2_1_1]] & pi6_1_1<=pi4_1_1] | ~ [pol1_1_1<=1]] & ~ [[[~ [1<=po6_1_1] | ~ [[1<=pol5_1_1 | [~ [1<=pil1_1_1] & pb6_1_1<=1]]]] & [[[[[po5_1_1<=1 & 1<=pi1_1_1] | [po6_1_1<=0 & pi3_1_1<=1]] & ~ [po4_1_1<=0]] & [~ [pil6_1_1<=0] | [~ [1<=pil4_1_1] & [1<=pi4_1_1 | 1<=pi6_1_1]]]] & [[pb4_1_1<=1 & ~ [[pol3_1_1<=1 | pil4_1_1<=0]]] | pb6_1_1<=1]]]]]]
normalized: E [true U [~ [[[[pb6_1_1<=1 | [pb4_1_1<=1 & ~ [[pol3_1_1<=1 | pil4_1_1<=0]]]] & [[[[1<=pi4_1_1 | 1<=pi6_1_1] & ~ [1<=pil4_1_1]] | ~ [pil6_1_1<=0]] & [~ [po4_1_1<=0] & [[po6_1_1<=0 & pi3_1_1<=1] | [po5_1_1<=1 & 1<=pi1_1_1]]]]] & [~ [[1<=pol5_1_1 | [pb6_1_1<=1 & ~ [1<=pil1_1_1]]]] | ~ [1<=po6_1_1]]]] & [~ [pol1_1_1<=1] | [pi6_1_1<=pi4_1_1 & [[1<=po2_1_1 & [[[pol3_1_1<=po4_1_1 | ~ [po4_1_1<=pb2_1_1]] & [1<=pi1_1_1 | [po5_1_1<=pb1_1_1 & 1<=pil2_1_1]]] | [[~ [pi6_1_1<=pbl_1_1] | ~ [po4_1_1<=pil6_1_1]] & [po2_1_1<=pol4_1_1 | ~ [1<=pi2_1_1]]]]] & [[[1<=pol5_1_1 | 1<=pi4_1_1] & [[1<=pil3_1_1 | ~ [pb6_1_1<=pb1_1_1]] & ~ [[pil2_1_1<=1 | pol1_1_1<=1]]]] & [1<=pb5_1_1 & [po4_1_1<=1 & [[pi4_1_1<=1 & 1<=pb2_1_1] & [pil1_1_1<=po5_1_1 & po5_1_1<=0]]]]]]]]]]

abstracting: (po5_1_1<=0)
states: 29,568 (4)
abstracting: (pil1_1_1<=po5_1_1)
states: 18,689 (4)
abstracting: (1<=pb2_1_1)
states: 13,842 (4)
abstracting: (pi4_1_1<=1)
states: 40,193 (4)
abstracting: (po4_1_1<=1)
states: 40,193 (4)
abstracting: (1<=pb5_1_1)
states: 13,842 (4)
abstracting: (pol1_1_1<=1)
states: 40,193 (4)
abstracting: (pil2_1_1<=1)
states: 40,193 (4)
abstracting: (pb6_1_1<=pb1_1_1)
states: 29,568 (4)
abstracting: (1<=pil3_1_1)
states: 29,568 (4)
abstracting: (1<=pi4_1_1)
states: 10,625 (4)
abstracting: (1<=pol5_1_1)
states: 29,568 (4)
abstracting: (1<=pi2_1_1)
states: 10,625 (4)
abstracting: (po2_1_1<=pol4_1_1)
states: 37,632 (4)
abstracting: (po4_1_1<=pil6_1_1)
states: 37,632 (4)
abstracting: (pi6_1_1<=pbl_1_1)
states: 40,193 (4)
abstracting: (1<=pil2_1_1)
states: 29,568 (4)
abstracting: (po5_1_1<=pb1_1_1)
states: 32,785 (4)
abstracting: (1<=pi1_1_1)
states: 10,625 (4)
abstracting: (po4_1_1<=pb2_1_1)
states: 32,785 (4)
abstracting: (pol3_1_1<=po4_1_1)
states: 18,689 (4)
abstracting: (1<=po2_1_1)
states: 10,625 (4)
abstracting: (pi6_1_1<=pi4_1_1)
states: 32,129 (4)
abstracting: (pol1_1_1<=1)
states: 40,193 (4)
abstracting: (1<=po6_1_1)
states: 10,625 (4)
abstracting: (1<=pil1_1_1)
states: 29,568 (4)
abstracting: (pb6_1_1<=1)
states: 36,194 (4)
abstracting: (1<=pol5_1_1)
states: 29,568 (4)
abstracting: (1<=pi1_1_1)
states: 10,625 (4)
abstracting: (po5_1_1<=1)
states: 40,193 (4)
abstracting: (pi3_1_1<=1)
states: 40,193 (4)
abstracting: (po6_1_1<=0)
states: 29,568 (4)
abstracting: (po4_1_1<=0)
states: 29,568 (4)
abstracting: (pil6_1_1<=0)
states: 10,625 (4)
abstracting: (1<=pil4_1_1)
states: 29,568 (4)
abstracting: (1<=pi6_1_1)
states: 10,625 (4)
abstracting: (1<=pi4_1_1)
states: 10,625 (4)
abstracting: (pil4_1_1<=0)
states: 10,625 (4)
abstracting: (pol3_1_1<=1)
states: 40,193 (4)
abstracting: (pb4_1_1<=1)
states: 36,194 (4)
abstracting: (pb6_1_1<=1)
states: 36,194 (4)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

totally nodes used: 44670 (4.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 156635 294837 451472
used/not used/entry size/cache size: 306105 66802759 16 1024MB
basic ops cache: hits/miss/sum: 44985 91316 136301
used/not used/entry size/cache size: 161452 16615764 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: 7903 11571 19474
used/not used/entry size/cache size: 11571 8377037 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 67064887
1 43496
2 408
3 33
4 9
5 3
6 7
7 16
8 0
9 1
>= 10 4

Total processing time: 0m 5.154sec


BK_STOP 1679876209210

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

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:798 (19), effective:65 (1)

initing FirstDep: 0m 0.000sec


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

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

iterations count:582 (13), effective:34 (0)

iterations count:1287 (30), effective:81 (1)

iterations count:661 (15), effective:34 (0)

iterations count:660 (15), effective:32 (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="HexagonalGrid-PT-110"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
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 marcie"
echo " Input is HexagonalGrid-PT-110, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r193-smll-167840340600374"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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