fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r140-tall-162089127200082
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for NeighborGrid-PT-d2n3m1t12

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
243.388 5308.00 9659.00 399.60 FTFFFFTTTTFFTFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127200082.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NeighborGrid-PT-d2n3m1t12, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127200082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 06:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 25 07:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 25 07:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 19K May 5 16:51 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-CTLFireability-00
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-01
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-02
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-03
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-04
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-05
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-06
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-07
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-08
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-09
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-10
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-11
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-12
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-13
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-14
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620927362191

Running Version 0
[2021-05-13 17:36:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 17:36:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 17:36:03] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2021-05-13 17:36:03] [INFO ] Transformed 9 places.
[2021-05-13 17:36:03] [INFO ] Transformed 72 transitions.
[2021-05-13 17:36:03] [INFO ] Parsed PT model containing 9 places and 72 transitions in 65 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:36:03] [INFO ] Reduced 1 identical enabling conditions.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:04] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-13 17:36:04] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:04] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-13 17:36:04] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:04] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:36:04] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 72/72 transitions.
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 47 ms
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 10 ms
[2021-05-13 17:36:04] [INFO ] Input system was already deterministic with 72 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=819 ) properties (out of 114) seen :113
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 9 cols
[2021-05-13 17:36:04] [INFO ] Computed 1 place invariants in 4 ms
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Applied a total of 0 rules in 5 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 4 ms
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 4 ms
[2021-05-13 17:36:04] [INFO ] Input system was already deterministic with 72 transitions.
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 3 ms
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 3 ms
[2021-05-13 17:36:04] [INFO ] Time to serialize gal into /tmp/CTLFireability15074912227778558992.gal : 2 ms
[2021-05-13 17:36:04] [INFO ] Time to serialize properties into /tmp/CTLFireability18420231074827827465.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15074912227778558992.gal, -t, CGAL, -ctl, /tmp/CTLFireability18420231074827827465.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15074912227778558992.gal -t CGAL -ctl /tmp/CTLFireability18420231074827827465.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24310,0.017424,4508,2,82,5,2783,6,0,111,2360,0


Converting to forward existential form...Done !
original formula: (E(((p_1_2>=1) * E((((p_0_0>=1)||(p_1_0>=1))||(p_1_2>=1)) U (EF((((p_0_1>=1)||(p_0_2>=1))||(p_1_0>=1))) * EG(((((((p_0_0>=1)||(p_1_0>=1))||(p_1_2>=1))||(p_2_0>=1))||(p_2_1>=1))||(p_2_2>=1)))))) U (((!(EF((((((((p_0_0>=1)||(p_0_1>=1))||(p_0_2>=1))||(p_1_1>=1))||(p_1_2>=1))||(p_2_0>=1))||(p_2_2>=1)))) * (p_1_2<1)) * (p_2_0<1)) * (p_2_1<1))) + AG(((((((p_0_0>=1)||(p_0_2>=1))||(p_1_1>=1))||(p_2_0>=1))||(p_2_1>=1))||(p_2_2>=1))))
=> equivalent forward existential formula: [(FwdU((Init * !(E(((p_1_2>=1) * E((((p_0_0>=1)||(p_1_0>=1))||(p_1_2>=1)) U (E(TRUE U (((p_0_1>=1)||(p_0_2>=1))||(p_1_0>=1))) * EG(((((((p_0_0>=1)||(p_1_0>=1))||(p_1_2>=1))||(p_2_0>=1))||(p_2_1>=1))||(p_2_2>=1)))))) U (((!(E(TRUE U (((((((p_0_0>=1)||(p_0_1>=1))||(p_0_2>=1))||(p_1_1>=1))||(p_1_2>=1))||(p_2_0>=1))||(p_2_2>=1)))) * (p_1_2<1)) * (p_2_0<1)) * (p_2_1<1))))),TRUE) * !(((((((p_0_0>=1)||(p_0_2>=1))||(p_1_1>=1))||(p_2_0>=1))||(p_2_1>=1))||(p_2_2>=1))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 30/0/42
(forward)formula 0,0,0.062844,5952,1,0,16,7909,41,5,539,7206,22
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Graph (trivial) has 6 edges and 9 vertex of which 3 / 9 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Applied a total of 1 rules in 6 ms. Remains 7 /9 variables (removed 2) and now considering 43/72 (removed 29) transitions.
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 2 ms
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 2 ms
[2021-05-13 17:36:04] [INFO ] Input system was already deterministic with 43 transitions.
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 1 ms
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 1 ms
[2021-05-13 17:36:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13841902308754534855.gal : 1 ms
[2021-05-13 17:36:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16127418267850956488.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13841902308754534855.gal, -t, CGAL, -ctl, /tmp/CTLFireability16127418267850956488.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13841902308754534855.gal -t CGAL -ctl /tmp/CTLFireability16127418267850956488.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5005,0.008647,4456,2,62,5,1684,6,0,73,1417,0


Converting to forward existential form...Done !
original formula: EF(AG(A((((p_0_0<1)&&(p_0_2<1))&&(p_2_2<1)) U E(AG((p_1_1>=1)) U ((((((p_0_0>=1)||(p_0_2>=1))||(p_1_1>=1))||(p_1_2>=1))||(p_2_1>=1))&&((p_0_0>=1)||(p_0_2>=1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!(E(!(E(TRUE U !((p_1_1>=1)))) U ((((((p_0_0>=1)||(p_0_2>=1))||(p_1_1>=1))||(p_1_2>=1))||(p_2_1>=1))&&((p_0_0>=1)||(p_0_2>=1))))) U (!((((p_0_0<1)&&(p_0_2<1))&&(p_2_2<1))) * !(E(!(E(TRUE U !((p_1_1>=1)))) U ((((((p_0_0>=1)||(p_0_2>=1))||(p_1_1>=1))||(p_1_2>=1))||(p_2_1>=1))&&((p_0_0>=1)||(p_0_2>=1))))))) + EG(!(E(!(E(TRUE U !((p_1_1>=1)))) U ((((((p_0_0>=1)||(p_0_2>=1))||(p_1_1>=1))||(p_1_2>=1))||(p_2_1>=1))&&((p_0_0>=1)||(p_0_2>=1))))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.034395,5624,1,0,12,5537,28,4,345,4943,20
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 3 ms
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 3 ms
[2021-05-13 17:36:04] [INFO ] Input system was already deterministic with 72 transitions.
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 2 ms
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 2 ms
[2021-05-13 17:36:04] [INFO ] Time to serialize gal into /tmp/CTLFireability5567554393036932884.gal : 0 ms
[2021-05-13 17:36:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13304817134695405827.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability5567554393036932884.gal, -t, CGAL, -ctl, /tmp/CTLFireability13304817134695405827.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability5567554393036932884.gal -t CGAL -ctl /tmp/CTLFireability13304817134695405827.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24310,0.013849,4680,2,82,5,2783,6,0,111,2360,0


Converting to forward existential form...Done !
original formula: EF(AG((((((((AG((((p_0_0>=1)||(p_1_1>=1))||(p_2_0>=1))) * (p_0_0<1)) * (p_0_2<1)) * (p_1_1<1)) * (p_2_0<1)) * (p_2_2<1)) * (((((p_0_2>=1)||(p_1_0>=1))||(p_2_0>=1))||(p_0_1>=1))||(p_1_2>=1))) * (((((p_0_0>=1)||(p_0_1>=1))||(p_1_1>=1))||(p_1_2>=1))||(p_2_2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((((((!(E(TRUE U !((((p_0_0>=1)||(p_1_1>=1))||(p_2_0>=1))))) * (p_0_0<1)) * (p_0_2<1)) * (p_1_1<1)) * (p_2_0<1)) * (p_2_2<1)) * (((((p_0_2>=1)||(p_1_0>=1))||(p_2_0>=1))||(p_0_1>=1))||(p_1_2>=1))) * (((((p_0_0>=1)||(p_0_1>=1))||(p_1_1>=1))||(p_1_2>=1))||(p_2_2>=1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.034883,5320,1,0,13,4777,22,0,475,3980,14
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Graph (trivial) has 20 edges and 9 vertex of which 5 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Applied a total of 1 rules in 2 ms. Remains 5 /9 variables (removed 4) and now considering 21/72 (removed 51) transitions.
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 1 ms
[2021-05-13 17:36:04] [INFO ] Flatten gal took : 0 ms
[2021-05-13 17:36:04] [INFO ] Input system was already deterministic with 21 transitions.
Finished random walk after 178 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=89 )
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2021-05-13 17:36:05] [INFO ] Flatten gal took : 5 ms
[2021-05-13 17:36:05] [INFO ] Flatten gal took : 5 ms
[2021-05-13 17:36:05] [INFO ] Applying decomposition
[2021-05-13 17:36:05] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10720365466030280123.txt, -o, /tmp/graph10720365466030280123.bin, -w, /tmp/graph10720365466030280123.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10720365466030280123.bin, -l, -1, -v, -w, /tmp/graph10720365466030280123.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 17:36:05] [INFO ] Decomposing Gal with order
[2021-05-13 17:36:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 17:36:05] [INFO ] Flatten gal took : 6 ms
[2021-05-13 17:36:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 17:36:05] [INFO ] Time to serialize gal into /tmp/CTLFireability16558364286855115246.gal : 0 ms
[2021-05-13 17:36:05] [INFO ] Time to serialize properties into /tmp/CTLFireability18417228470694069484.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability16558364286855115246.gal, -t, CGAL, -ctl, /tmp/CTLFireability18417228470694069484.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability16558364286855115246.gal -t CGAL -ctl /tmp/CTLFireability18417228470694069484.ctl
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24310,0.014179,4944,2,82,5,2783,6,0,111,2360,0


Converting to forward existential form...Done !
original formula: E((AX(EX((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1)))) * ((u0.p_0_2>=1)||(u0.p_1_0>=1))) U (AG((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1))&&(((((u0.p_0_2>=1)||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))&&(((((u0.p_0_0>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1)))) * EF(AX((((u0.p_0_1>=1)||(u0.p_1_2>=1))||(u0.p_2_1>=1))))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,(!(EX(!(EX((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1)))))) * ((u0.p_0_2>=1)||(u0.p_1_0>=1)))) * !(E(TRUE U !((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1))&&(((((u0.p_0_2>=1)||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))&&(((((u0.p_0_0>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))))))),TRUE) * !(EX(!((((u0.p_0_1>=1)||(u0.p_1_2>=1))||(u0.p_2_1>=1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.047332,6120,1,0,9,7358,42,1,501,5812,7
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG(((EF((((((AF((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_2_1>=1))) * ((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_0_2<1))&&(u0.p_2_0<1))&&(u0.p_2_2<1))||((((u0.p_1_0<1)&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1)))) * (u0.p_0_2<1)) * (u0.p_1_1<1)) * (u0.p_1_2<1)) * (u0.p_2_0<1))) + (((EX(E(((((u0.p_0_1>=1)||(u0.p_1_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U ((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))) + A(((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1)) U ((((u0.p_0_1>=1)||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1)))) * ((((((u0.p_0_1>=1)||(u0.p_1_0>=1))||(u0.p_0_0>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) * (((((((A(((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U ((u0.p_0_1>=1)||(u0.p_2_0>=1))) + (u0.p_0_2>=1)) + (u0.p_1_0>=1)) + (u0.p_1_1>=1)) + (u0.p_1_2>=1)) + (u0.p_2_0>=1)) + (u0.p_2_1>=1)) + (u0.p_2_2>=1)))) * (((((((!(AX(!(A(((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1)) U ((u0.p_1_2>=1)||(u0.p_2_0>=1)))))) + A((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U ((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1)))) + A(((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1)) U EG(((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))))) + (u0.p_0_0>=1)) + (u0.p_0_1>=1)) + (u0.p_0_2>=1)) + (u0.p_1_2>=1)) + (u0.p_2_0>=1))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((((EX(E(((((u0.p_0_1>=1)||(u0.p_1_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U ((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))) + !((E(!(((((u0.p_0_1>=1)||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))) U (!(((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))) * !(((((u0.p_0_1>=1)||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))))) + EG(!(((((u0.p_0_1>=1)||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))))))) * ((((((u0.p_0_1>=1)||(u0.p_1_0>=1))||(u0.p_0_0>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) * (((((((!((E(!(((u0.p_0_1>=1)||(u0.p_2_0>=1))) U (!(((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) * !(((u0.p_0_1>=1)||(u0.p_2_0>=1))))) + EG(!(((u0.p_0_1>=1)||(u0.p_2_0>=1)))))) + (u0.p_0_2>=1)) + (u0.p_1_0>=1)) + (u0.p_1_1>=1)) + (u0.p_1_2>=1)) + (u0.p_2_0>=1)) + (u0.p_2_1>=1)) + (u0.p_2_2>=1))))) * !(E(TRUE U (((((!(EG(!((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_2_1>=1))))) * ((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_0_2<1))&&(u0.p_2_0<1))&&(u0.p_2_2<1))||((((u0.p_1_0<1)&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1)))) * (u0.p_0_2<1)) * (u0.p_1_1<1)) * (u0.p_1_2<1)) * (u0.p_2_0<1)))))] = FALSE * [((((((((FwdU(Init,TRUE) * !((u0.p_2_0>=1))) * !((u0.p_1_2>=1))) * !((u0.p_0_2>=1))) * !((u0.p_0_1>=1))) * !((u0.p_0_0>=1))) * !(!((E(!(EG(((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1)))) U (!(((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))) * !(EG(((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1)))))) + EG(!(EG(((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))))))))) * !(!((E(!(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))) U (!((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) * !(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))))) + EG(!(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1)))))))) * !(EX(!(!(!((E(!(((u0.p_1_2>=1)||(u0.p_2_0>=1))) U (!(((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))) * !(((u0.p_1_2>=1)||(u0.p_2_0>=1))))) + EG(!(((u0.p_1_2>=1)||(u0.p_2_0>=1)))))))))))] = FALSE)
Hit Full ! (commute/partial/dont) 42/28/30
(forward)formula 1,1,0.103664,7704,1,0,23,17766,93,8,607,13931,24
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: E(AX(AG((EG((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_1>=1))) + (((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1))&&(((((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_0_0>=1))||(u0.p_0_1>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))))) U ((((((((!(AF(((((((((u0.p_0_0<1)&&(u0.p_2_1<1))&&(u0.p_0_0<1))&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1)))) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_1_2<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)) * (((((EX((((((AF((((((u0.p_0_0>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_2<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1))) + AG((((AG(((u0.p_0_0>=1)||(u0.p_2_0>=1))) * E(((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U ((((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1)))) * (((((((u0.p_0_1>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_0_0>=1))||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_2_2>=1))) * (((((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))))) + (u0.p_1_0>=1)) + (u0.p_1_2>=1)) + (u0.p_2_1>=1)) + (u0.p_2_2>=1))) * (!(AG((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1)))) + ((u0.p_0_0<1)&&(u0.p_0_2<1)))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(EX(!(!(E(TRUE U !((EG((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_1>=1))) + (((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1))&&(((((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_0_0>=1))||(u0.p_0_1>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))))))))))) * (((((((!(!(EG(!(((((((((u0.p_0_0<1)&&(u0.p_2_1<1))&&(u0.p_0_0<1))&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1)))))) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_1_2<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)) * (((((EX((((((!(EG(!((((((u0.p_0_0>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1))))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_2<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1))) + !(E(TRUE U !((((!(E(TRUE U !(((u0.p_0_0>=1)||(u0.p_2_0>=1))))) * E(((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U ((((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1)))) * (((((((u0.p_0_1>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_0_0>=1))||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_2_2>=1))) * (((((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))))))) + (u0.p_1_0>=1)) + (u0.p_1_2>=1)) + (u0.p_2_1>=1)) + (u0.p_2_2>=1)))),TRUE) * !((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))))] != FALSE + [((FwdU(Init,!(EX(!(!(E(TRUE U !((EG((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_1>=1))) + (((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1))&&(((((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_0_0>=1))||(u0.p_0_1>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))))))))))) * (((((((!(!(EG(!(((((((((u0.p_0_0<1)&&(u0.p_2_1<1))&&(u0.p_0_0<1))&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1)))))) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_1_2<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)) * (((((EX((((((!(EG(!((((((u0.p_0_0>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1))))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_2<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1))) + !(E(TRUE U !((((!(E(TRUE U !(((u0.p_0_0>=1)||(u0.p_2_0>=1))))) * E(((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U ((((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1)))) * (((((((u0.p_0_1>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_0_0>=1))||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_2_2>=1))) * (((((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))))))) + (u0.p_1_0>=1)) + (u0.p_1_2>=1)) + (u0.p_2_1>=1)) + (u0.p_2_2>=1)))) * ((u0.p_0_0<1)&&(u0.p_0_2<1)))] != FALSE)
Hit Full ! (commute/partial/dont) 6/0/66
(forward)formula 2,0,0.165194,9552,1,0,66,25897,177,29,713,22163,59
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: ((EG(E(((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1)) U ((EG(((((u0.p_1_0>=1)||(u0.p_1_2>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) + AF((((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))) * A((u0.p_2_0>=1) U (((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1)))))) * E(((((((!(A((((((u0.p_0_1>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1)) U (((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_1>=1)))) + AG(AX(((((u0.p_0_2>=1)||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))))) + (u0.p_0_0>=1)) + (u0.p_0_1>=1)) + (u0.p_1_1>=1)) + (u0.p_1_2>=1)) + (u0.p_2_1>=1)) U (EG(!(EX((((u0.p_0_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))))) * ((((!(EX(((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1)))) + (((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_2<1))) + ((((u0.p_0_0<1)&&(u0.p_1_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1))) + ((((u0.p_0_0<1)&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_1<1))) + ((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))))) * EF(EG(AX((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * (EG(E(((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1)) U ((EG(((((u0.p_1_0>=1)||(u0.p_1_2>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) + !(EG(!((((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))))) * !((E(!((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))) U (!((u0.p_2_0>=1)) * !((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))))) + EG(!((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))))))))) * E(((((((!(!((E(!((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_1>=1))) U (!((((((u0.p_0_1>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))) * !((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_1>=1))))) + EG(!((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_1>=1))))))) + !(E(TRUE U !(!(EX(!(((((u0.p_0_2>=1)||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))))))))) + (u0.p_0_0>=1)) + (u0.p_0_1>=1)) + (u0.p_1_1>=1)) + (u0.p_1_2>=1)) + (u0.p_2_1>=1)) U (EG(!(EX((((u0.p_0_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))))) * ((((!(EX(((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1)))) + (((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_2<1))) + ((((u0.p_0_0<1)&&(u0.p_1_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1))) + ((((u0.p_0_0<1)&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_1<1))) + ((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1))))))),TRUE),!(EX(!((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))))))] != FALSE
(forward)formula 3,0,0.22181,10608,1,0,89,34029,245,38,785,29855,79
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(E(E(A(((((u0.p_0_1<1)&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1)) U ((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) U (((((E(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U (((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) + (u0.p_0_2>=1)) + (u0.p_1_1>=1)) + (u0.p_1_2>=1)) + (u0.p_2_0>=1)) + (u0.p_2_1>=1))) U (EX(((((((u0.p_0_0<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))) + (EF(((((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))&&(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1)))) * ((u0.p_0_0>=1)||(u0.p_2_1>=1))))) U (!(EX(EG(AF((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1)))))) * (EX(EX((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_2_1>=1)))) + !(A((A((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1)) U ((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))) + ((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_1_0<1))&&(u0.p_2_0<1))) U ((EG((u0.p_1_0>=1)) * ((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_1>=1))) * ((u0.p_0_2>=1)||(u0.p_1_1>=1))))))))
=> equivalent forward existential formula: ([(EY(EY((FwdU(Init,E(E(!((E(!(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) U (!(((((u0.p_0_1<1)&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))) * !(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))))) + EG(!(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))))) U (((((E(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U (((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) + (u0.p_0_2>=1)) + (u0.p_1_1>=1)) + (u0.p_1_2>=1)) + (u0.p_2_0>=1)) + (u0.p_2_1>=1))) U (EX(((((((u0.p_0_0<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))) + (E(TRUE U ((((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))&&(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1)))) * ((u0.p_0_0>=1)||(u0.p_2_1>=1)))))) * !(EX(EG(!(EG(!((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1))))))))))) * (((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_2_1>=1)))] != FALSE + ((([((FwdU((FwdU(Init,E(E(!((E(!(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) U (!(((((u0.p_0_1<1)&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))) * !(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))))) + EG(!(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))))) U (((((E(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U (((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) + (u0.p_0_2>=1)) + (u0.p_1_1>=1)) + (u0.p_1_2>=1)) + (u0.p_2_0>=1)) + (u0.p_2_1>=1))) U (EX(((((((u0.p_0_0<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))) + (E(TRUE U ((((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))&&(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1)))) * ((u0.p_0_0>=1)||(u0.p_2_1>=1)))))) * !(EX(EG(!(EG(!((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1))))))))),!(((EG((u0.p_1_0>=1)) * ((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_1>=1))) * ((u0.p_0_2>=1)||(u0.p_1_1>=1))))) * !((!((E(!(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))) U (!((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))) * !(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))))) + EG(!(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1)))))) + ((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_1_0<1))&&(u0.p_2_0<1))))) * !(EG((u0.p_1_0>=1))))] != FALSE + [((FwdU((FwdU(Init,E(E(!((E(!(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) U (!(((((u0.p_0_1<1)&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))) * !(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))))) + EG(!(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))))) U (((((E(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U (((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) + (u0.p_0_2>=1)) + (u0.p_1_1>=1)) + (u0.p_1_2>=1)) + (u0.p_2_0>=1)) + (u0.p_2_1>=1))) U (EX(((((((u0.p_0_0<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))) + (E(TRUE U ((((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))&&(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1)))) * ((u0.p_0_0>=1)||(u0.p_2_1>=1)))))) * !(EX(EG(!(EG(!((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1))))))))),!(((EG((u0.p_1_0>=1)) * ((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_1>=1))) * ((u0.p_0_2>=1)||(u0.p_1_1>=1))))) * !((!((E(!(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))) U (!((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))) * !(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))))) + EG(!(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1)))))) + ((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_1_0<1))&&(u0.p_2_0<1))))) * !(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_1>=1))))] != FALSE) + [((FwdU((FwdU(Init,E(E(!((E(!(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) U (!(((((u0.p_0_1<1)&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))) * !(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))))) + EG(!(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))))) U (((((E(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U (((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) + (u0.p_0_2>=1)) + (u0.p_1_1>=1)) + (u0.p_1_2>=1)) + (u0.p_2_0>=1)) + (u0.p_2_1>=1))) U (EX(((((((u0.p_0_0<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))) + (E(TRUE U ((((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))&&(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1)))) * ((u0.p_0_0>=1)||(u0.p_2_1>=1)))))) * !(EX(EG(!(EG(!((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1))))))))),!(((EG((u0.p_1_0>=1)) * ((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_1>=1))) * ((u0.p_0_2>=1)||(u0.p_1_1>=1))))) * !((!((E(!(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))) U (!((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))) * !(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))))) + EG(!(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1)))))) + ((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_1_0<1))&&(u0.p_2_0<1))))) * !(((u0.p_0_2>=1)||(u0.p_1_1>=1))))] != FALSE) + [FwdG((FwdU(Init,E(E(!((E(!(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) U (!(((((u0.p_0_1<1)&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))) * !(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))))) + EG(!(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))))) U (((((E(((((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U (((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) + (u0.p_0_2>=1)) + (u0.p_1_1>=1)) + (u0.p_1_2>=1)) + (u0.p_2_0>=1)) + (u0.p_2_1>=1))) U (EX(((((((u0.p_0_0<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))) + (E(TRUE U ((((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))&&(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1)))) * ((u0.p_0_0>=1)||(u0.p_2_1>=1)))))) * !(EX(EG(!(EG(!((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1))))))))),!(((EG((u0.p_1_0>=1)) * ((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_1>=1))) * ((u0.p_0_2>=1)||(u0.p_1_1>=1)))))] != FALSE))
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 20/144/52
(forward)formula 4,0,0.265967,11400,1,0,107,39316,291,48,913,34695,93
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: A(AX((!(AX(EG((((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))))) + (((((((u0.p_0_0<1)&&(u0.p_0_2<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))) U (E(((((((EG((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) * (u0.p_0_1<1)) * (u0.p_0_2<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)) U !(EG((u0.p_2_1>=1)))) + !(AG((AF((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))) + AG(((((u0.p_1_0>=1)||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))))))))
=> equivalent forward existential formula: [((Init * !(EG(!((E(((((((EG((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) * (u0.p_0_1<1)) * (u0.p_0_2<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)) U !(EG((u0.p_2_1>=1)))) + !(!(E(TRUE U !((!(EG(!((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))))) + !(E(TRUE U !(((((u0.p_1_0>=1)||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))))))))))))))) * !(E(!((E(((((((EG((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) * (u0.p_0_1<1)) * (u0.p_0_2<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)) U !(EG((u0.p_2_1>=1)))) + !(!(E(TRUE U !((!(EG(!((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))))) + !(E(TRUE U !(((((u0.p_1_0>=1)||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1)))))))))))) U (!(!(EX(!((!(!(EX(!(EG((((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))))))) + (((((((u0.p_0_0<1)&&(u0.p_0_2<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1))))))) * !((E(((((((EG((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))) * (u0.p_0_1<1)) * (u0.p_0_2<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)) U !(EG((u0.p_2_1>=1)))) + !(!(E(TRUE U !((!(EG(!((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))))) + !(E(TRUE U !(((((u0.p_1_0>=1)||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))))))))))))))))] != FALSE
(forward)formula 5,1,0.303247,12192,1,0,116,45049,319,60,932,40002,106
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EF(EG(((((((!(EX((((((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))) + (((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_2_1<1))) + ((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_0_2<1))&&(u0.p_1_1<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1))) + ((((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1))) + (((((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1))) * (!(EX((u0.p_0_2>=1))) + ((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_1<1))&&(u0.p_2_0<1))&&(u0.p_2_2<1))&&(u0.p_1_0<1)))) * (((u0.p_0_1<1)&&(u0.p_2_1<1))||((((u0.p_0_1<1)&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_2<1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((((!(EX((((((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))) + (((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_2_1<1))) + ((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_0_2<1))&&(u0.p_1_1<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1))) + ((((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1))) + (((((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1))) * (!(EX((u0.p_0_2>=1))) + ((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_1<1))&&(u0.p_2_0<1))&&(u0.p_2_2<1))&&(u0.p_1_0<1)))) * (((u0.p_0_1<1)&&(u0.p_2_1<1))||((((u0.p_0_1<1)&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_2<1)))))] != FALSE
(forward)formula 6,1,0.314552,12720,1,0,127,46317,369,66,991,41264,120
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: E(AX(AX((((u0.p_0_0>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1)))) U !(E(EX((EX(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_1>=1))||(u0.p_2_2>=1))) * ((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))) U ((((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))||(((((((((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_2_0<1))&&(u0.p_2_2<1))&&(u0.p_0_1<1))&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_2<1))) * !(E((((u0.p_1_2>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1)) U (((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))))) * !(AF((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_2>=1))))))))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(EX(!((((u0.p_0_0>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))))))))) * !(E(EX((EX(((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_1>=1))||(u0.p_2_2>=1))) * ((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))) U ((((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))||(((((((((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_2_0<1))&&(u0.p_2_2<1))&&(u0.p_0_1<1))&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_2<1))) * !(E((((u0.p_1_2>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1)) U (((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))))) * !(!(EG(!((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_2_2>=1))))))))))] != FALSE
Hit Full ! (commute/partial/dont) 30/0/42
(forward)formula 7,1,0.461404,16212,1,0,154,72701,423,89,1064,66799,162
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EX((((EF((((((((((!(EG((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_2>=1)))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1))) * (((((((!(A(((((u0.p_0_2>=1)||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1)) U (((((u0.p_0_1>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1)))) + AX(((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_2_0>=1)))) + !(E((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U (((((u0.p_0_1>=1)||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))))) + AX(((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1)))) + (u0.p_0_0>=1)) + (u0.p_0_2>=1)) + (!(EG(((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))) * (!(AX((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1)))) + ((((((u0.p_0_0<1)&&(u0.p_1_0<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_2<1))&&(u0.p_0_1<1))))) + (AG(((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1))) * ((((A(((u0.p_0_0>=1)||(u0.p_1_1>=1)) U (((u0.p_1_1>=1)||(u0.p_2_1>=1))||(u0.p_2_2>=1))) + (u0.p_0_2>=1)) + (u0.p_1_2>=1)) + (u0.p_2_1>=1)) + (u0.p_2_2>=1))))) * ((u0.p_0_0>=1)||(u0.p_0_2>=1))) * ((u0.p_1_2>=1)||((((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))))
=> equivalent forward existential formula: (((((((([(FwdU((((EY(Init) * ((u0.p_1_2>=1)||((((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))) * ((u0.p_0_0>=1)||(u0.p_0_2>=1))) * E(TRUE U (((((((((!(EG((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_2>=1)))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)))),!((((((u0.p_0_1>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1)))) * (!(((((u0.p_0_2>=1)||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))) * !((((((u0.p_0_1>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1)))))] != FALSE + [FwdG((((EY(Init) * ((u0.p_1_2>=1)||((((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))) * ((u0.p_0_0>=1)||(u0.p_0_2>=1))) * E(TRUE U (((((((((!(EG((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_2>=1)))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)))),!((((((u0.p_0_1>=1)||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1))))] != FALSE) + [((((EY(Init) * ((u0.p_1_2>=1)||((((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))) * ((u0.p_0_0>=1)||(u0.p_0_2>=1))) * E(TRUE U (((((((((!(EG((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_2>=1)))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)))) * !(EX(!(((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_2_0>=1))))))] != FALSE) + [((((EY(Init) * ((u0.p_1_2>=1)||((((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))) * ((u0.p_0_0>=1)||(u0.p_0_2>=1))) * E(TRUE U (((((((((!(EG((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_2>=1)))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)))) * !(E((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U (((((u0.p_0_1>=1)||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))))] != FALSE) + [((((EY(Init) * ((u0.p_1_2>=1)||((((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))) * ((u0.p_0_0>=1)||(u0.p_0_2>=1))) * E(TRUE U (((((((((!(EG((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_2>=1)))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)))) * !(EX(!(((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))))))] != FALSE) + [((((EY(Init) * ((u0.p_1_2>=1)||((((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))) * ((u0.p_0_0>=1)||(u0.p_0_2>=1))) * E(TRUE U (((((((((!(EG((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_2>=1)))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)))) * (u0.p_0_0>=1))] != FALSE) + [((((EY(Init) * ((u0.p_1_2>=1)||((((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))) * ((u0.p_0_0>=1)||(u0.p_0_2>=1))) * E(TRUE U (((((((((!(EG((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_2>=1)))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)))) * (u0.p_0_2>=1))] != FALSE) + ([(EY(((((EY(Init) * ((u0.p_1_2>=1)||((((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))) * ((u0.p_0_0>=1)||(u0.p_0_2>=1))) * E(TRUE U (((((((((!(EG((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_2>=1)))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)))) * !(EG(((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)))))) * !((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))))] != FALSE + [(((((EY(Init) * ((u0.p_1_2>=1)||((((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))) * ((u0.p_0_0>=1)||(u0.p_0_2>=1))) * E(TRUE U (((((((((!(EG((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_2>=1)))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)))) * !(EG(((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_0_2>=1))||(u0.p_1_2>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1))))) * ((((((u0.p_0_0<1)&&(u0.p_1_0<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_2<1))&&(u0.p_0_1<1)))] != FALSE)) + (((([((((((EY(Init) * ((u0.p_1_2>=1)||((((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))) * ((u0.p_0_0>=1)||(u0.p_0_2>=1))) * E(TRUE U (((((((((!(EG((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_2>=1)))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)))) * !(E(TRUE U !(((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1)))))) * !(EG(!((((u0.p_1_1>=1)||(u0.p_2_1>=1))||(u0.p_2_2>=1)))))) * !(E(!((((u0.p_1_1>=1)||(u0.p_2_1>=1))||(u0.p_2_2>=1))) U (!(((u0.p_0_0>=1)||(u0.p_1_1>=1))) * !((((u0.p_1_1>=1)||(u0.p_2_1>=1))||(u0.p_2_2>=1)))))))] != FALSE + [(((((EY(Init) * ((u0.p_1_2>=1)||((((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))) * ((u0.p_0_0>=1)||(u0.p_0_2>=1))) * E(TRUE U (((((((((!(EG((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_2>=1)))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)))) * !(E(TRUE U !(((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1)))))) * (u0.p_0_2>=1))] != FALSE) + [(((((EY(Init) * ((u0.p_1_2>=1)||((((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))) * ((u0.p_0_0>=1)||(u0.p_0_2>=1))) * E(TRUE U (((((((((!(EG((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_2>=1)))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)))) * !(E(TRUE U !(((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1)))))) * (u0.p_1_2>=1))] != FALSE) + [(((((EY(Init) * ((u0.p_1_2>=1)||((((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))) * ((u0.p_0_0>=1)||(u0.p_0_2>=1))) * E(TRUE U (((((((((!(EG((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_2>=1)))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)))) * !(E(TRUE U !(((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1)))))) * (u0.p_2_1>=1))] != FALSE) + [(((((EY(Init) * ((u0.p_1_2>=1)||((((((((u0.p_0_1<1)&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_1_2<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))) * ((u0.p_0_0>=1)||(u0.p_0_2>=1))) * E(TRUE U (((((((((!(EG((((u0.p_1_0>=1)||(u0.p_1_1>=1))||(u0.p_2_2>=1)))) * (u0.p_0_0<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_1_1<1)) * (u0.p_0_1<1)) * (u0.p_1_0<1)) * (u0.p_2_0<1)) * (u0.p_2_1<1)) * (u0.p_2_2<1)))) * !(E(TRUE U !(((((u0.p_0_2>=1)||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_2>=1)))))) * (u0.p_2_2>=1))] != FALSE))
Hit Full ! (commute/partial/dont) 12/220/60
(forward)formula 8,1,0.497647,17004,1,0,169,76130,461,107,1197,70223,175
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EX(AF(AG(E((((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))&&(((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))) U ((u0.p_0_1>=1)||(u0.p_2_1>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E(TRUE U !(E((((((((u0.p_0_0>=1)||(u0.p_0_2>=1))||(u0.p_1_0>=1))||(u0.p_1_1>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))&&(((u0.p_1_0>=1)||(u0.p_2_0>=1))||(u0.p_2_1>=1))) U ((u0.p_0_1>=1)||(u0.p_2_1>=1))))))))))] != FALSE
Hit Full ! (commute/partial/dont) 2/4/70
(forward)formula 9,0,0.520612,17532,1,0,173,80326,475,108,1221,74295,182
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EG(AG(((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) + (!(AX(((u0.p_1_0>=1)||(u0.p_2_1>=1)))) * (((((EX((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))) + (u0.p_0_0>=1)) + (u0.p_0_1>=1)) + (u0.p_1_2>=1)) + (u0.p_2_0>=1)) + (u0.p_2_1>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((((((((u0.p_0_0>=1)||(u0.p_0_1>=1))||(u0.p_1_0>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_1>=1))||(u0.p_2_2>=1)) + (!(!(EX(!(((u0.p_1_0>=1)||(u0.p_2_1>=1)))))) * (((((EX((((((u0.p_0_1>=1)||(u0.p_0_2>=1))||(u0.p_1_2>=1))||(u0.p_2_0>=1))||(u0.p_2_2>=1))) + (u0.p_0_0>=1)) + (u0.p_0_1>=1)) + (u0.p_1_2>=1)) + (u0.p_2_0>=1)) + (u0.p_2_1>=1))))))))] != FALSE
(forward)formula 10,1,0.537818,18060,1,0,178,82821,483,115,1245,76941,191
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG(E(!(AX((u0.p_1_1>=1))) U (EF(((((((u0.p_0_2<1)&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_1_1<1))) * (EX(E((((u0.p_1_1>=1)||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U ((u0.p_2_0>=1)||(u0.p_2_1>=1)))) + AF(((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(!(EX(!((u0.p_1_1>=1))))) U (E(TRUE U ((((((u0.p_0_2<1)&&(u0.p_1_0<1))&&(u0.p_1_1<1))&&(u0.p_2_0<1))&&(u0.p_2_1<1))&&(u0.p_1_1<1))) * (EX(E((((u0.p_1_1>=1)||(u0.p_2_1>=1))||(u0.p_2_2>=1)) U ((u0.p_2_0>=1)||(u0.p_2_1>=1)))) + !(EG(!(((((((u0.p_0_0<1)&&(u0.p_0_1<1))&&(u0.p_0_2<1))&&(u0.p_1_0<1))&&(u0.p_2_1<1))&&(u0.p_2_2<1))))))))))] = FALSE
Hit Full ! (commute/partial/dont) 30/0/42
(forward)formula 11,1,0.56464,18852,1,0,185,87337,516,119,1289,81149,204
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************


BK_STOP 1620927367499

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="CTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is NeighborGrid-PT-d2n3m1t12, 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 r140-tall-162089127200082"
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 [ "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 ;