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.r202-smll-167840348600378.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 HexagonalGrid-PT-126, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348600378
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:06 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:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 26 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 17:13 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 18K 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-126-CTLFireability-00
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-01
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-02
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-03
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-04
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-05
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-06
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-07
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-08
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-09
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-10
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-11
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-12
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-13
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-14
FORMULA_NAME HexagonalGrid-PT-126-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678733908456

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HexagonalGrid-PT-126
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:58:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 18:58:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:58:32] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-13 18:58:32] [INFO ] Transformed 31 places.
[2023-03-13 18:58:32] [INFO ] Transformed 42 transitions.
[2023-03-13 18:58:32] [INFO ] Parsed PT model containing 31 places and 42 transitions and 168 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Initial state reduction rules removed 3 formulas.
FORMULA HexagonalGrid-PT-126-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-126-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-126-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 21 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2023-03-13 18:58:32] [INFO ] Computed 14 place invariants in 10 ms
[2023-03-13 18:58:32] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-13 18:58:32] [INFO ] Invariant cache hit.
[2023-03-13 18:58:32] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2023-03-13 18:58:32] [INFO ] Invariant cache hit.
[2023-03-13 18:58:32] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 556 ms. Remains : 31/31 places, 42/42 transitions.
Support contains 31 out of 31 places after structural reductions.
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 41 ms
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 19 ms
[2023-03-13 18:58:33] [INFO ] Input system was already deterministic with 42 transitions.
Finished random walk after 243 steps, including 0 resets, run visited all 33 properties in 40 ms. (steps per millisecond=6 )
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 24 ms
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 15 ms
[2023-03-13 18:58:33] [INFO ] Input system was already deterministic with 42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:58:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:58:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:58:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:58:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:58:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:58:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 9 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:58:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:58:33] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:58:34] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:58:34] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:58:34] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:58:34] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:58:34] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:58:34] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:58:34] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:58:34] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:58:34] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:58:34] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:58:34] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:58:34] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:58:34] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:58:34] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:58:34] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:58:34] [INFO ] Input system was already deterministic with 42 transitions.
[2023-03-13 18:58:34] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:58:34] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:58:34] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 18:58:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 42 transitions and 168 arcs took 1 ms.
Total runtime 2036 ms.
There are residual formulas that ITS could not solve within timeout
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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(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.492sec


RS generation: 0m 0.087sec


-> reachability set: #nodes 1925 (1.9e+03) #states 2,664,192 (6)



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

checking: AX [AF [[p14<=0 | p20<=0]]]
normalized: ~ [EX [EG [~ [[p14<=0 | p20<=0]]]]]

abstracting: (p20<=0)
states: 1,661,056 (6)
abstracting: (p14<=0)
states: 1,003,136 (6)
..
EG iterations: 2
.-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

checking: AG [EX [AX [EX [A [[1<=p6 & 1<=p10] U [1<=p16 & 1<=p22]]]]]]
normalized: ~ [E [true U ~ [EX [~ [EX [~ [EX [[~ [EG [~ [[1<=p16 & 1<=p22]]]] & ~ [E [~ [[1<=p16 & 1<=p22]] U [~ [[1<=p6 & 1<=p10]] & ~ [[1<=p16 & 1<=p22]]]]]]]]]]]]]]

abstracting: (1<=p22)
states: 1,003,136 (6)
abstracting: (1<=p16)
states: 1,661,056 (6)
abstracting: (1<=p10)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p22)
states: 1,003,136 (6)
abstracting: (1<=p16)
states: 1,661,056 (6)
abstracting: (1<=p22)
states: 1,003,136 (6)
abstracting: (1<=p16)
states: 1,661,056 (6)
..
EG iterations: 2
...-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.138sec

checking: AF [[AX [AF [AX [[p6<=0 | p9<=0]]]] & [p6<=0 | p11<=0]]]
normalized: ~ [EG [~ [[[p6<=0 | p11<=0] & ~ [EX [EG [EX [~ [[p6<=0 | p9<=0]]]]]]]]]]

abstracting: (p9<=0)
states: 1,661,056 (6)
abstracting: (p6<=0)
states: 0
....
EG iterations: 3
.abstracting: (p11<=0)
states: 1,661,056 (6)
abstracting: (p6<=0)
states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: E [[1<=p0 & 1<=p25] U AG [EF [AX [[[1<=p6 & 1<=p11] | [1<=p6 & 1<=p7]]]]]]
normalized: E [[1<=p0 & 1<=p25] U ~ [E [true U ~ [E [true U ~ [EX [~ [[[1<=p6 & 1<=p7] | [1<=p6 & 1<=p11]]]]]]]]]]

abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p7)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
.abstracting: (1<=p25)
states: 1,661,056 (6)
abstracting: (1<=p0)
states: 1,579,008 (6)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.175sec

checking: AG [AX [~ [A [[~ [[1<=p5 & 1<=p30]] | ~ [[1<=p6 & 1<=p11]]] U [AG [[1<=p6 & 1<=p9]] & [1<=p6 & 1<=p11]]]]]]
normalized: ~ [E [true U EX [[~ [EG [~ [[[1<=p6 & 1<=p11] & ~ [E [true U ~ [[1<=p6 & 1<=p9]]]]]]]] & ~ [E [~ [[[1<=p6 & 1<=p11] & ~ [E [true U ~ [[1<=p6 & 1<=p9]]]]]] U [~ [[~ [[1<=p6 & 1<=p11]] | ~ [[1<=p5 & 1<=p30]]]] & ~ [[[1<=p6 & 1<=p11] & ~ [E [true U ~ [[1<=p6 & 1<=p9]]]]]]]]]]]]]

abstracting: (1<=p9)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p30)
states: 1,661,056 (6)
abstracting: (1<=p5)
states: 1,579,008 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p9)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p9)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)

EG iterations: 0
.-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: E [AG [[1<=p17 & 1<=p23]] U EF [[AX [AG [[1<=p6 & 1<=p10]]] & [EX [[[1<=p6 & 1<=p9] & [1<=p6 & 1<=p7]]] | [AX [[1<=p6 & 1<=p11]] & [1<=p17 & 1<=p23]]]]]]
normalized: E [~ [E [true U ~ [[1<=p17 & 1<=p23]]]] U E [true U [[[[1<=p17 & 1<=p23] & ~ [EX [~ [[1<=p6 & 1<=p11]]]]] | EX [[[1<=p6 & 1<=p7] & [1<=p6 & 1<=p9]]]] & ~ [EX [E [true U ~ [[1<=p6 & 1<=p10]]]]]]]]

abstracting: (1<=p10)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
.abstracting: (1<=p9)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p7)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
.abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
.abstracting: (1<=p23)
states: 1,003,136 (6)
abstracting: (1<=p17)
states: 1,661,056 (6)
abstracting: (1<=p23)
states: 1,003,136 (6)
abstracting: (1<=p17)
states: 1,661,056 (6)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AG [EF [[A [[1<=p6 & 1<=p8] U [1<=p6 & 1<=p11]] & [~ [A [[1<=p6 & 1<=p11] U [1<=p6 & 1<=p12]]] | [~ [E [[1<=p6 & 1<=p11] U [1<=p6 & 1<=p7]]] | [[p6<=0 | p12<=0] & [p6<=0 | p9<=0]]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[[[p6<=0 | p9<=0] & [p6<=0 | p12<=0]] | ~ [E [[1<=p6 & 1<=p11] U [1<=p6 & 1<=p7]]]] | ~ [[~ [EG [~ [[1<=p6 & 1<=p12]]]] & ~ [E [~ [[1<=p6 & 1<=p12]] U [~ [[1<=p6 & 1<=p11]] & ~ [[1<=p6 & 1<=p12]]]]]]]] & [~ [EG [~ [[1<=p6 & 1<=p11]]]] & ~ [E [~ [[1<=p6 & 1<=p11]] U [~ [[1<=p6 & 1<=p8]] & ~ [[1<=p6 & 1<=p11]]]]]]]]]]]

abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p8)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
...
EG iterations: 3
abstracting: (1<=p12)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p12)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p12)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
...
EG iterations: 3
abstracting: (1<=p7)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (p12<=0)
states: 1,661,056 (6)
abstracting: (p6<=0)
states: 0
abstracting: (p9<=0)
states: 1,661,056 (6)
abstracting: (p6<=0)
states: 0
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: [AF [E [AF [~ [EF [[1<=p6 & 1<=p10]]]] U ~ [EX [[1<=p6 & 1<=p7]]]]] & [AX [[[1<=p6 & 1<=p10] | [[[p6<=0 | p10<=0] & [p5<=0 | p30<=0]] | [1<=p6 & 1<=p12]]]] | EF [AG [E [~ [[1<=p13 & 1<=p19]] U ~ [[1<=p6 & 1<=p7]]]]]]]
normalized: [[E [true U ~ [E [true U ~ [E [~ [[1<=p13 & 1<=p19]] U ~ [[1<=p6 & 1<=p7]]]]]]] | ~ [EX [~ [[[[1<=p6 & 1<=p12] | [[p5<=0 | p30<=0] & [p6<=0 | p10<=0]]] | [1<=p6 & 1<=p10]]]]]] & ~ [EG [~ [E [~ [EG [E [true U [1<=p6 & 1<=p10]]]] U ~ [EX [[1<=p6 & 1<=p7]]]]]]]]

abstracting: (1<=p7)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
.abstracting: (1<=p10)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)

EG iterations: 0
...
EG iterations: 3
abstracting: (1<=p10)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (p10<=0)
states: 1,661,056 (6)
abstracting: (p6<=0)
states: 0
abstracting: (p30<=0)
states: 1,003,136 (6)
abstracting: (p5<=0)
states: 1,085,184 (6)
abstracting: (1<=p12)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
.abstracting: (1<=p7)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p19)
states: 1,003,136 (6)
abstracting: (1<=p13)
states: 1,661,056 (6)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.104sec

checking: EF [[[E [[~ [EX [[1<=p6 & 1<=p7]]] & ~ [EG [[1<=p13 & 1<=p19]]]] U EX [EG [[1<=p6 & 1<=p7]]]] & 1<=p6] & [1<=p12 & [~ [E [[E [[1<=p5 & 1<=p30] U [1<=p6 & 1<=p11]] | AX [[1<=p2 & 1<=p27]]] U EX [[1<=p15 & 1<=p21]]]] | 1<=p9]]]]
normalized: E [true U [[1<=p12 & [1<=p9 | ~ [E [[~ [EX [~ [[1<=p2 & 1<=p27]]]] | E [[1<=p5 & 1<=p30] U [1<=p6 & 1<=p11]]] U EX [[1<=p15 & 1<=p21]]]]]] & [1<=p6 & E [[~ [EG [[1<=p13 & 1<=p19]]] & ~ [EX [[1<=p6 & 1<=p7]]]] U EX [EG [[1<=p6 & 1<=p7]]]]]]]

abstracting: (1<=p7)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
...
EG iterations: 3
.abstracting: (1<=p7)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
.abstracting: (1<=p19)
states: 1,003,136 (6)
abstracting: (1<=p13)
states: 1,661,056 (6)
..
EG iterations: 2
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p21)
states: 1,003,136 (6)
abstracting: (1<=p15)
states: 1,661,056 (6)
.abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p30)
states: 1,661,056 (6)
abstracting: (1<=p5)
states: 1,579,008 (6)
abstracting: (1<=p27)
states: 1,661,056 (6)
abstracting: (1<=p2)
states: 1,579,008 (6)
.abstracting: (1<=p9)
states: 1,003,136 (6)
abstracting: (1<=p12)
states: 1,003,136 (6)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.150sec

checking: AG [[[EF [[1<=p6 & 1<=p10]] | [AF [~ [E [[1<=p6 & 1<=p8] U [1<=p6 & 1<=p10]]]] | EX [[1<=p3 & 1<=p28]]]] | [AF [[1<=p13 & 1<=p19]] | [[1<=p2 & 1<=p27] | [E [[1<=p6 & 1<=p11] U [1<=p6 & 1<=p7]] & [EX [[1<=p6 & 1<=p11]] & AX [[1<=p6 & 1<=p9]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[~ [EX [~ [[1<=p6 & 1<=p9]]]] & EX [[1<=p6 & 1<=p11]]] & E [[1<=p6 & 1<=p11] U [1<=p6 & 1<=p7]]] | [1<=p2 & 1<=p27]] | ~ [EG [~ [[1<=p13 & 1<=p19]]]]] | [[EX [[1<=p3 & 1<=p28]] | ~ [EG [E [[1<=p6 & 1<=p8] U [1<=p6 & 1<=p10]]]]] | E [true U [1<=p6 & 1<=p10]]]]]]]

abstracting: (1<=p10)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p10)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p8)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
...
EG iterations: 3
abstracting: (1<=p28)
states: 1,661,056 (6)
abstracting: (1<=p3)
states: 1,579,008 (6)
.abstracting: (1<=p19)
states: 1,003,136 (6)
abstracting: (1<=p13)
states: 1,661,056 (6)
..
EG iterations: 2
abstracting: (1<=p27)
states: 1,661,056 (6)
abstracting: (1<=p2)
states: 1,579,008 (6)
abstracting: (1<=p7)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
.abstracting: (1<=p9)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
.-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.096sec

checking: AG [[~ [A [AG [[1<=p6 & 1<=p8]] U A [[1<=p6 & 1<=p11] U [1<=p16 & 1<=p22]]]] | [A [AF [[[1<=p6 & 1<=p11] & [1<=p6 & 1<=p10]]] U [~ [[1<=p6 & 1<=p12]] | [[[1<=p6 & 1<=p11] | [1<=p6 & 1<=p8]] & A [[1<=p13 & 1<=p19] U [1<=p6 & 1<=p11]]]]] | AF [AG [EX [[1<=p17 & 1<=p23]]]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [E [true U ~ [EX [[1<=p17 & 1<=p23]]]]]] | [~ [EG [~ [[[[~ [EG [~ [[1<=p6 & 1<=p11]]]] & ~ [E [~ [[1<=p6 & 1<=p11]] U [~ [[1<=p6 & 1<=p11]] & ~ [[1<=p13 & 1<=p19]]]]]] & [[1<=p6 & 1<=p8] | [1<=p6 & 1<=p11]]] | ~ [[1<=p6 & 1<=p12]]]]]] & ~ [E [~ [[[[~ [EG [~ [[1<=p6 & 1<=p11]]]] & ~ [E [~ [[1<=p6 & 1<=p11]] U [~ [[1<=p6 & 1<=p11]] & ~ [[1<=p13 & 1<=p19]]]]]] & [[1<=p6 & 1<=p8] | [1<=p6 & 1<=p11]]] | ~ [[1<=p6 & 1<=p12]]]] U [~ [[[[~ [EG [~ [[1<=p6 & 1<=p11]]]] & ~ [E [~ [[1<=p6 & 1<=p11]] U [~ [[1<=p6 & 1<=p11]] & ~ [[1<=p13 & 1<=p19]]]]]] & [[1<=p6 & 1<=p8] | [1<=p6 & 1<=p11]]] | ~ [[1<=p6 & 1<=p12]]]] & EG [~ [[[1<=p6 & 1<=p10] & [1<=p6 & 1<=p11]]]]]]]]] | ~ [[~ [EG [~ [[~ [EG [~ [[1<=p16 & 1<=p22]]]] & ~ [E [~ [[1<=p16 & 1<=p22]] U [~ [[1<=p6 & 1<=p11]] & ~ [[1<=p16 & 1<=p22]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p16 & 1<=p22]]]] & ~ [E [~ [[1<=p16 & 1<=p22]] U [~ [[1<=p6 & 1<=p11]] & ~ [[1<=p16 & 1<=p22]]]]]]] U [E [true U ~ [[1<=p6 & 1<=p8]]] & ~ [[~ [EG [~ [[1<=p16 & 1<=p22]]]] & ~ [E [~ [[1<=p16 & 1<=p22]] U [~ [[1<=p6 & 1<=p11]] & ~ [[1<=p16 & 1<=p22]]]]]]]]]]]]]]]]

abstracting: (1<=p22)
states: 1,003,136 (6)
abstracting: (1<=p16)
states: 1,661,056 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p22)
states: 1,003,136 (6)
abstracting: (1<=p16)
states: 1,661,056 (6)
abstracting: (1<=p22)
states: 1,003,136 (6)
abstracting: (1<=p16)
states: 1,661,056 (6)
..
EG iterations: 2
abstracting: (1<=p8)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p22)
states: 1,003,136 (6)
abstracting: (1<=p16)
states: 1,661,056 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p22)
states: 1,003,136 (6)
abstracting: (1<=p16)
states: 1,661,056 (6)
abstracting: (1<=p22)
states: 1,003,136 (6)
abstracting: (1<=p16)
states: 1,661,056 (6)
..
EG iterations: 2
abstracting: (1<=p22)
states: 1,003,136 (6)
abstracting: (1<=p16)
states: 1,661,056 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p22)
states: 1,003,136 (6)
abstracting: (1<=p16)
states: 1,661,056 (6)
abstracting: (1<=p22)
states: 1,003,136 (6)
abstracting: (1<=p16)
states: 1,661,056 (6)
..
EG iterations: 2
..
EG iterations: 2
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p10)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
.
EG iterations: 1
abstracting: (1<=p12)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p8)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p19)
states: 1,003,136 (6)
abstracting: (1<=p13)
states: 1,661,056 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
...
EG iterations: 3
abstracting: (1<=p12)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p8)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p19)
states: 1,003,136 (6)
abstracting: (1<=p13)
states: 1,661,056 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
...
EG iterations: 3
abstracting: (1<=p12)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p8)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p19)
states: 1,003,136 (6)
abstracting: (1<=p13)
states: 1,661,056 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
...
EG iterations: 3
....
EG iterations: 4
abstracting: (1<=p23)
states: 1,003,136 (6)
abstracting: (1<=p17)
states: 1,661,056 (6)
.
EG iterations: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.058sec

checking: AF [[[AG [~ [E [[1<=p6 & 1<=p8] U [1<=p6 & 1<=p11]]]] | [EX [[1<=p5 & 1<=p30]] | ~ [E [~ [E [[1<=p6 & 1<=p10] U [1<=p6 & 1<=p12]]] U [[1<=p5 & 1<=p30] & [1<=p6 & [1<=p7 & AG [[1<=p3 & 1<=p28]]]]]]]]] & [~ [E [~ [[[1<=p6 & 1<=p12] | [1<=p6 & 1<=p7]]] U [[[1<=p6 & 1<=p11] | [1<=p1 & 1<=p26]] | [[1<=p6 & 1<=p9] | [1<=p6 & 1<=p8]]]]] | EX [[1<=p6 & 1<=p7]]]]]
normalized: ~ [EG [~ [[[EX [[1<=p6 & 1<=p7]] | ~ [E [~ [[[1<=p6 & 1<=p7] | [1<=p6 & 1<=p12]]] U [[[1<=p6 & 1<=p8] | [1<=p6 & 1<=p9]] | [[1<=p1 & 1<=p26] | [1<=p6 & 1<=p11]]]]]] & [[~ [E [~ [E [[1<=p6 & 1<=p10] U [1<=p6 & 1<=p12]]] U [[1<=p6 & [1<=p7 & ~ [E [true U ~ [[1<=p3 & 1<=p28]]]]]] & [1<=p5 & 1<=p30]]]] | EX [[1<=p5 & 1<=p30]]] | ~ [E [true U E [[1<=p6 & 1<=p8] U [1<=p6 & 1<=p11]]]]]]]]]

abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p8)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p30)
states: 1,661,056 (6)
abstracting: (1<=p5)
states: 1,579,008 (6)
.abstracting: (1<=p30)
states: 1,661,056 (6)
abstracting: (1<=p5)
states: 1,579,008 (6)
abstracting: (1<=p28)
states: 1,661,056 (6)
abstracting: (1<=p3)
states: 1,579,008 (6)
abstracting: (1<=p7)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p12)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p10)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p26)
states: 1,661,056 (6)
abstracting: (1<=p1)
states: 1,579,008 (6)
abstracting: (1<=p9)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p8)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p12)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p7)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p7)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
..
EG iterations: 1
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.168sec

checking: [AF [[[EX [EX [[1<=p17 & 1<=p23]]] | [AG [[p6<=0 | p11<=0]] & EG [[1<=p6 & 1<=p7]]]] & [1<=p18 & 1<=p24]]] & [E [~ [[1<=p6 & 1<=p12]] U [EX [[[1<=p6 & 1<=p7] & [1<=p5 & 1<=p30]]] & [[A [[1<=p6 & 1<=p7] U [1<=p4 & 1<=p29]] | [[1<=p6 & 1<=p9] & [1<=p16 & [1<=p22 & [[1<=p6 & 1<=p9] | [1<=p6 & 1<=p10]]]]]] & EG [EF [[1<=p6 & 1<=p11]]]]]] & E [~ [EX [AF [[1<=p6 & 1<=p7]]]] U [1<=p6 & 1<=p10]]]]
normalized: [[E [~ [EX [~ [EG [~ [[1<=p6 & 1<=p7]]]]]] U [1<=p6 & 1<=p10]] & E [~ [[1<=p6 & 1<=p12]] U [[EG [E [true U [1<=p6 & 1<=p11]]] & [[[1<=p16 & [1<=p22 & [[1<=p6 & 1<=p10] | [1<=p6 & 1<=p9]]]] & [1<=p6 & 1<=p9]] | [~ [EG [~ [[1<=p4 & 1<=p29]]]] & ~ [E [~ [[1<=p4 & 1<=p29]] U [~ [[1<=p6 & 1<=p7]] & ~ [[1<=p4 & 1<=p29]]]]]]]] & EX [[[1<=p5 & 1<=p30] & [1<=p6 & 1<=p7]]]]]] & ~ [EG [~ [[[1<=p18 & 1<=p24] & [[EG [[1<=p6 & 1<=p7]] & ~ [E [true U ~ [[p6<=0 | p11<=0]]]]] | EX [EX [[1<=p17 & 1<=p23]]]]]]]]]

abstracting: (1<=p23)
states: 1,003,136 (6)
abstracting: (1<=p17)
states: 1,661,056 (6)
..abstracting: (p11<=0)
states: 1,661,056 (6)
abstracting: (p6<=0)
states: 0
abstracting: (1<=p7)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
...
EG iterations: 3
abstracting: (1<=p24)
states: 1,003,136 (6)
abstracting: (1<=p18)
states: 1,661,056 (6)
.
EG iterations: 1
abstracting: (1<=p7)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p30)
states: 1,661,056 (6)
abstracting: (1<=p5)
states: 1,579,008 (6)
.abstracting: (1<=p29)
states: 1,661,056 (6)
abstracting: (1<=p4)
states: 1,579,008 (6)
abstracting: (1<=p7)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p29)
states: 1,661,056 (6)
abstracting: (1<=p4)
states: 1,579,008 (6)
abstracting: (1<=p29)
states: 1,661,056 (6)
abstracting: (1<=p4)
states: 1,579,008 (6)
..
EG iterations: 2
abstracting: (1<=p9)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p9)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p10)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p22)
states: 1,003,136 (6)
abstracting: (1<=p16)
states: 1,661,056 (6)
abstracting: (1<=p11)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)

EG iterations: 0
abstracting: (1<=p12)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p10)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
abstracting: (1<=p7)
states: 1,003,136 (6)
abstracting: (1<=p6)
states: 2,664,192 (6)
...
EG iterations: 3
.-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.318sec

totally nodes used: 272217 (2.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2747419 2510173 5257592
used/not used/entry size/cache size: 2690152 64418712 16 1024MB
basic ops cache: hits/miss/sum: 284488 276584 561072
used/not used/entry size/cache size: 498063 16279153 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: 18249 16279 34528
used/not used/entry size/cache size: 16279 8372329 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 66843648
1 258722
2 6033
3 418
4 41
5 1
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.634sec


BK_STOP 1678733921734

--------------------
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 CTLFireability -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:1242 (29), effective:124 (2)

initing FirstDep: 0m 0.000sec


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

iterations count:329 (7), effective:19 (0)

iterations count:1998 (47), effective:138 (3)

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

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

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

iterations count:543 (12), effective:33 (0)

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

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

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

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

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

iterations count:251 (5), effective:14 (0)

iterations count:301 (7), effective:17 (0)

iterations count:335 (7), effective:17 (0)

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

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

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

iterations count:322 (7), effective:17 (0)

iterations count:253 (6), effective:15 (0)

iterations count:274 (6), effective:15 (0)

iterations count:514 (12), effective:32 (0)

iterations count:335 (7), effective:17 (0)

iterations count:299 (7), effective:14 (0)

iterations count:251 (5), effective:14 (0)

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

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

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

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

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

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

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

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

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

iterations count:1649 (39), effective:137 (3)

iterations count:595 (14), effective:35 (0)

iterations count:265 (6), effective:14 (0)

iterations count:318 (7), effective:19 (0)

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

iterations count:266 (6), effective:14 (0)

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

iterations count:301 (7), effective:17 (0)

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

iterations count:301 (7), effective:17 (0)

iterations count:780 (18), effective:63 (1)

iterations count:323 (7), effective:14 (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-126"
export BK_EXAMINATION="CTLFireability"
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 HexagonalGrid-PT-126, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r202-smll-167840348600378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HexagonalGrid-PT-126.tgz
mv HexagonalGrid-PT-126 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;