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-162089127300090.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-d3n3m1t11, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127300090
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K 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.8K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 06:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 25 07:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K 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 46K 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-d3n3m1t11-CTLFireability-00
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-01
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-02
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-03
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-04
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-05
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-06
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-07
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-08
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-09
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-10
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-11
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-12
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-13
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-14
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620927460461

Running Version 0
[2021-05-13 17:37:41] [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:37:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 17:37:41] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2021-05-13 17:37:41] [INFO ] Transformed 27 places.
[2021-05-13 17:37:41] [INFO ] Transformed 162 transitions.
[2021-05-13 17:37:41] [INFO ] Parsed PT model containing 27 places and 162 transitions in 74 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:37:41] [INFO ] Reduced 1 identical enabling conditions.
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 9 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:37:42] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-13 17:37:42] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:37:42] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-13 17:37:42] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:37:42] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-13 17:37:42] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
[2021-05-13 17:37:42] [INFO ] Flatten gal took : 32 ms
[2021-05-13 17:37:42] [INFO ] Flatten gal took : 13 ms
[2021-05-13 17:37:42] [INFO ] Input system was already deterministic with 162 transitions.
Incomplete random walk after 100008 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=1408 ) properties (out of 118) seen :117
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:37:42] [INFO ] Computed 1 place invariants in 2 ms
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Graph (trivial) has 2 edges and 27 vertex of which 2 / 27 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 12 ms. Remains 26 /27 variables (removed 1) and now considering 159/162 (removed 3) transitions.
[2021-05-13 17:37:42] [INFO ] Flatten gal took : 7 ms
[2021-05-13 17:37:42] [INFO ] Flatten gal took : 7 ms
[2021-05-13 17:37:42] [INFO ] Input system was already deterministic with 159 transitions.
[2021-05-13 17:37:42] [INFO ] Flatten gal took : 8 ms
[2021-05-13 17:37:42] [INFO ] Flatten gal took : 5 ms
[2021-05-13 17:37:42] [INFO ] Time to serialize gal into /tmp/CTLFireability1255790381302994978.gal : 3 ms
[2021-05-13 17:37:42] [INFO ] Time to serialize properties into /tmp/CTLFireability17204245532861865403.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/CTLFireability1255790381302994978.gal, -t, CGAL, -ctl, /tmp/CTLFireability17204245532861865403.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/CTLFireability1255790381302994978.gal -t CGAL -ctl /tmp/CTLFireability17204245532861865403.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,4.77551e+14,0.384894,13592,2,702,5,56918,6,0,265,52579,0


Converting to forward existential form...Done !
original formula: EF(((((((((p_1_2_1>=1)||(p_0_0_0>=1))||(p_2_0_1>=1))||(p_0_1_0>=1))||(p_2_2_2>=1))||(p_1_1_0>=1))||(p_1_2_0>=1)) * ((!(AF((((((((p_1_2_1<1)&&(p_0_0_0<1))&&(p_1_2_2<1))&&(p_0_0_2<1))&&(p_0_2_0<1))&&(p_2_1_1<1))||(((((p_1_2_2>=1)||(p_0_1_0>=1))||(p_0_2_2>=1))||(p_2_2_0>=1))&&((((p_0_0_2>=1)||(p_0_2_1>=1))||(p_1_1_0>=1))||(p_1_1_2>=1)))))) + !(E(((((((((((p_2_0_0>=1)||(p_0_0_2>=1))||(p_0_1_0>=1))||(p_2_0_2>=1))||(p_0_1_1>=1))||(p_0_1_2>=1))||(p_0_2_1>=1))||(p_2_1_2>=1))||(p_1_1_0>=1))||(p_1_1_2>=1)) U ((((((((((((p_0_1_0>=1)||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_1_0_0>=1))||(p_1_0_2>=1))||(p_1_2_0>=1))||(p_1_2_1>=1))||(p_2_1_0>=1))||(p_2_2_0>=1))||(p_2_2_2>=1))||(p_1_1_1>=1))||(p_1_1_2>=1))))) + (((EF(((p_1_2_2>=1)||(p_2_2_0>=1))) * (p_2_0_2<1)) * (p_1_1_1<1)) * (p_1_1_2<1)))))
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * (((((((p_1_2_1>=1)||(p_0_0_0>=1))||(p_2_0_1>=1))||(p_0_1_0>=1))||(p_2_2_2>=1))||(p_1_1_0>=1))||(p_1_2_0>=1))),!((((((((p_1_2_1<1)&&(p_0_0_0<1))&&(p_1_2_2<1))&&(p_0_0_2<1))&&(p_0_2_0<1))&&(p_2_1_1<1))||(((((p_1_2_2>=1)||(p_0_1_0>=1))||(p_0_2_2>=1))||(p_2_2_0>=1))&&((((p_0_0_2>=1)||(p_0_2_1>=1))||(p_1_1_0>=1))||(p_1_1_2>=1))))))] != FALSE + [((FwdU(Init,TRUE) * (((((((p_1_2_1>=1)||(p_0_0_0>=1))||(p_2_0_1>=1))||(p_0_1_0>=1))||(p_2_2_2>=1))||(p_1_1_0>=1))||(p_1_2_0>=1))) * !(E(((((((((((p_2_0_0>=1)||(p_0_0_2>=1))||(p_0_1_0>=1))||(p_2_0_2>=1))||(p_0_1_1>=1))||(p_0_1_2>=1))||(p_0_2_1>=1))||(p_2_1_2>=1))||(p_1_1_0>=1))||(p_1_1_2>=1)) U ((((((((((((p_0_1_0>=1)||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_1_0_0>=1))||(p_1_0_2>=1))||(p_1_2_0>=1))||(p_1_2_1>=1))||(p_2_1_0>=1))||(p_2_2_0>=1))||(p_2_2_2>=1))||(p_1_1_1>=1))||(p_1_1_2>=1)))))] != FALSE) + [(FwdU(((((FwdU(Init,TRUE) * (((((((p_1_2_1>=1)||(p_0_0_0>=1))||(p_2_0_1>=1))||(p_0_1_0>=1))||(p_2_2_2>=1))||(p_1_1_0>=1))||(p_1_2_0>=1))) * (p_1_1_2<1)) * (p_1_1_1<1)) * (p_2_0_2<1)),TRUE) * ((p_1_2_2>=1)||(p_2_2_0>=1)))] != FALSE)
Hit Full ! (commute/partial/dont) 45/30/114
(forward)formula 0,1,4.95072,82056,1,0,8,338763,21,2,1742,578375,9
FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 4 edges and 27 vertex of which 3 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Applied a total of 1 rules in 3 ms. Remains 25 /27 variables (removed 2) and now considering 153/162 (removed 9) transitions.
[2021-05-13 17:37:47] [INFO ] Flatten gal took : 5 ms
[2021-05-13 17:37:47] [INFO ] Flatten gal took : 5 ms
[2021-05-13 17:37:47] [INFO ] Input system was already deterministic with 153 transitions.
[2021-05-13 17:37:47] [INFO ] Flatten gal took : 6 ms
[2021-05-13 17:37:47] [INFO ] Flatten gal took : 8 ms
[2021-05-13 17:37:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14864032830878092009.gal : 2 ms
[2021-05-13 17:37:47] [INFO ] Time to serialize properties into /tmp/CTLFireability16572715231095935907.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/CTLFireability14864032830878092009.gal, -t, CGAL, -ctl, /tmp/CTLFireability16572715231095935907.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/CTLFireability14864032830878092009.gal -t CGAL -ctl /tmp/CTLFireability16572715231095935907.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,2.29592e+14,0.368701,13224,2,674,5,54280,6,0,255,50428,0


Converting to forward existential form...Done !
original formula: (!(EF((EF(((((((p_1_2_2>=1)||(p_0_0_1>=1))||(p_0_1_0>=1))||(p_2_2_0>=1))||(p_1_0_0>=1))||(p_1_2_0>=1))) * (((((((((((((((p_0_0_1<1)&&(p_0_1_1<1))&&(p_0_2_1<1))&&(p_1_0_0<1))&&(p_1_0_1<1))&&(p_1_0_2<1))&&(p_1_1_0<1))||(((p_2_0_1<1)&&(p_0_1_0<1))&&(p_2_1_2<1)))||(p_2_1_1>=1))||(p_2_1_2>=1))||(p_1_2_1>=1))||(p_2_0_1>=1))||(p_0_2_1>=1))||(p_2_1_2>=1))||(p_2_2_1>=1))))) + !(AF(AG(((((((((A(((((((p_1_2_2>=1)||(p_0_0_1>=1))||(p_2_0_1>=1))||(p_0_1_0>=1))||(p_0_2_2>=1))||(p_1_0_0>=1)) U ((((p_2_1_1>=1)||(p_0_2_1>=1))||(p_2_2_1>=1))||(p_1_1_1>=1))) * (((((p_0_0_1>=1)||(p_0_1_2>=1))||(p_2_1_1>=1))||(p_2_1_2>=1))||(p_1_1_0>=1))) * (((((((((p_0_0_0>=1)||(p_2_0_1>=1))||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_2_2_0>=1))||(p_2_2_2>=1))||(p_1_0_2>=1))||(p_1_1_0>=1))||(p_1_1_1>=1))) + (p_1_2_2>=1)) + (p_2_1_0>=1)) + (p_2_1_1>=1)) + (p_0_2_0>=1)) + (p_2_2_2>=1)) + (p_1_1_1>=1))))))
=> equivalent forward existential formula: [(FwdU((FwdU((Init * !(!(!(EG(!(!(E(TRUE U !(((((((((!((E(!(((((p_2_1_1>=1)||(p_0_2_1>=1))||(p_2_2_1>=1))||(p_1_1_1>=1))) U (!(((((((p_1_2_2>=1)||(p_0_0_1>=1))||(p_2_0_1>=1))||(p_0_1_0>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))) * !(((((p_2_1_1>=1)||(p_0_2_1>=1))||(p_2_2_1>=1))||(p_1_1_1>=1))))) + EG(!(((((p_2_1_1>=1)||(p_0_2_1>=1))||(p_2_2_1>=1))||(p_1_1_1>=1)))))) * (((((p_0_0_1>=1)||(p_0_1_2>=1))||(p_2_1_1>=1))||(p_2_1_2>=1))||(p_1_1_0>=1))) * (((((((((p_0_0_0>=1)||(p_2_0_1>=1))||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_2_2_0>=1))||(p_2_2_2>=1))||(p_1_0_2>=1))||(p_1_1_0>=1))||(p_1_1_1>=1))) + (p_1_2_2>=1)) + (p_2_1_0>=1)) + (p_2_1_1>=1)) + (p_0_2_0>=1)) + (p_2_2_2>=1)) + (p_1_1_1>=1))))))))))),TRUE) * (((((((((((((((p_0_0_1<1)&&(p_0_1_1<1))&&(p_0_2_1<1))&&(p_1_0_0<1))&&(p_1_0_1<1))&&(p_1_0_2<1))&&(p_1_1_0<1))||(((p_2_0_1<1)&&(p_0_1_0<1))&&(p_2_1_2<1)))||(p_2_1_1>=1))||(p_2_1_2>=1))||(p_1_2_1>=1))||(p_2_0_1>=1))||(p_0_2_1>=1))||(p_2_1_2>=1))||(p_2_2_1>=1))),TRUE) * ((((((p_1_2_2>=1)||(p_0_0_1>=1))||(p_0_1_0>=1))||(p_2_2_0>=1))||(p_1_0_0>=1))||(p_1_2_0>=1)))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 111/120/42
(forward)formula 0,1,1.90427,44192,1,0,28,194286,39,10,1767,183123,22
FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 16 edges and 27 vertex of which 9 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Applied a total of 1 rules in 2 ms. Remains 19 /27 variables (removed 8) and now considering 105/162 (removed 57) transitions.
[2021-05-13 17:37:49] [INFO ] Flatten gal took : 4 ms
[2021-05-13 17:37:49] [INFO ] Flatten gal took : 4 ms
[2021-05-13 17:37:49] [INFO ] Input system was already deterministic with 105 transitions.
[2021-05-13 17:37:49] [INFO ] Flatten gal took : 4 ms
[2021-05-13 17:37:49] [INFO ] Flatten gal took : 3 ms
[2021-05-13 17:37:49] [INFO ] Time to serialize gal into /tmp/CTLFireability17905959442975520779.gal : 1 ms
[2021-05-13 17:37:49] [INFO ] Time to serialize properties into /tmp/CTLFireability16675248737110966478.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/CTLFireability17905959442975520779.gal, -t, CGAL, -ctl, /tmp/CTLFireability16675248737110966478.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/CTLFireability17905959442975520779.gal -t CGAL -ctl /tmp/CTLFireability16675248737110966478.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,1.71588e+12,0.201586,9816,2,506,5,35571,6,0,183,33555,0


Converting to forward existential form...Done !
original formula: EF(EG(A(E(EG(((((((((((p_0_0_0>=1)||(p_0_0_2>=1))||(p_0_1_1>=1))||(p_0_1_2>=1))||(p_0_2_1>=1))||(p_0_2_2>=1))||(p_1_0_1>=1))||(p_1_1_0>=1))||(p_1_1_1>=1))||(p_1_2_0>=1))) U AG((((((((((p_2_0_0>=1)||(p_0_1_2>=1))||(p_2_1_1>=1))||(p_0_2_0>=1))||(p_0_2_1>=1))||(p_0_2_2>=1))||(p_2_2_2>=1))||(p_1_1_0>=1))||(p_1_1_1>=1)))) U ((((p_0_0_0<1)&&(p_0_1_0<1))&&(p_2_1_2<1))&&(p_1_0_2<1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(!(((((p_0_0_0<1)&&(p_0_1_0<1))&&(p_2_1_2<1))&&(p_1_0_2<1))) U (!(E(EG(((((((((((p_0_0_0>=1)||(p_0_0_2>=1))||(p_0_1_1>=1))||(p_0_1_2>=1))||(p_0_2_1>=1))||(p_0_2_2>=1))||(p_1_0_1>=1))||(p_1_1_0>=1))||(p_1_1_1>=1))||(p_1_2_0>=1))) U !(E(TRUE U !((((((((((p_2_0_0>=1)||(p_0_1_2>=1))||(p_2_1_1>=1))||(p_0_2_0>=1))||(p_0_2_1>=1))||(p_0_2_2>=1))||(p_2_2_2>=1))||(p_1_1_0>=1))||(p_1_1_1>=1))))))) * !(((((p_0_0_0<1)&&(p_0_1_0<1))&&(p_2_1_2<1))&&(p_1_0_2<1))))) + EG(!(((((p_0_0_0<1)&&(p_0_1_0<1))&&(p_2_1_2<1))&&(p_1_0_2<1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 67/0/38
(forward)formula 0,1,1.34366,31844,1,0,10,147815,40,5,1275,146334,18
FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2021-05-13 17:37:51] [INFO ] Flatten gal took : 10 ms
[2021-05-13 17:37:51] [INFO ] Flatten gal took : 7 ms
[2021-05-13 17:37:51] [INFO ] Applying decomposition
[2021-05-13 17:37:51] [INFO ] Flatten gal took : 9 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/graph5186868483651523829.txt, -o, /tmp/graph5186868483651523829.bin, -w, /tmp/graph5186868483651523829.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/graph5186868483651523829.bin, -l, -1, -v, -w, /tmp/graph5186868483651523829.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 17:37:51] [INFO ] Decomposing Gal with order
[2021-05-13 17:37:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 17:37:51] [INFO ] Removed a total of 162 redundant transitions.
[2021-05-13 17:37:51] [INFO ] Flatten gal took : 40 ms
[2021-05-13 17:37:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-13 17:37:51] [INFO ] Time to serialize gal into /tmp/CTLFireability17926598777595811498.gal : 4 ms
[2021-05-13 17:37:51] [INFO ] Time to serialize properties into /tmp/CTLFireability128108888161217185.ctl : 11 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/CTLFireability17926598777595811498.gal, -t, CGAL, -ctl, /tmp/CTLFireability128108888161217185.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/CTLFireability17926598777595811498.gal -t CGAL -ctl /tmp/CTLFireability128108888161217185.ctl
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Detected timeout of ITS tools.
[2021-05-13 17:57:54] [INFO ] Flatten gal took : 7 ms
[2021-05-13 17:57:54] [INFO ] Time to serialize gal into /tmp/CTLFireability6270737753939885534.gal : 2 ms
[2021-05-13 17:57:54] [INFO ] Time to serialize properties into /tmp/CTLFireability6468053591000073112.ctl : 3 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/CTLFireability6270737753939885534.gal, -t, CGAL, -ctl, /tmp/CTLFireability6468053591000073112.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/CTLFireability6270737753939885534.gal -t CGAL -ctl /tmp/CTLFireability6468053591000073112.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 13 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,9.7347e+14,0.409779,14064,2,730,5,59023,6,0,273,54443,0


Converting to forward existential form...Done !
original formula: AX(!(AG(EX(((((((p_0_0_1>=1)||(p_2_0_1>=1))||(p_0_1_1>=1))||(p_2_1_1>=1))||(p_2_2_0>=1))||(p_1_2_0>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX(((((((p_0_0_1>=1)||(p_2_0_1>=1))||(p_0_1_1>=1))||(p_2_1_1>=1))||(p_2_2_0>=1))||(p_1_2_0>=1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.22682,25948,1,0,8,120506,14,1,1706,106882,6
FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AX((AG((((!(EX(((((((((p_0_0_2>=1)||(p_2_0_2>=1))||(p_2_1_0>=1))||(p_2_1_1>=1))||(p_2_1_2>=1))||(p_2_2_0>=1))||(p_2_2_2>=1))||(p_1_1_2>=1)))) * (((((((((((p_0_0_1>=1)||(p_2_0_1>=1))||(p_2_0_2>=1))||(p_0_1_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_0_2_1>=1))||(p_2_2_1>=1))||(p_1_1_0>=1))&&(p_2_2_0>=1)) + AX(((((((((p_2_0_0>=1)||(p_2_0_1>=1))||(p_0_1_1>=1))||(p_0_1_2>=1))||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_1_0_2>=1))))) * EG((((p_1_2_1>=1)||(p_0_1_1>=1))||(p_1_1_2>=1)))) * ((((p_1_2_2<1)&&(p_0_1_0<1))&&(p_0_2_2<1)) + E((((p_2_1_1>=1)||(p_1_1_1>=1))||(p_1_2_0>=1)) U ((((((((p_2_0_0>=1)||(p_2_0_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_1_0_1>=1))||(p_1_1_2>=1)))))) + ((AG(((((((p_0_0_0>=1)||(p_0_0_1>=1))||(p_0_0_2>=1))||(p_2_0_1>=1))||(p_2_2_0>=1))||(p_1_0_2>=1))) * (((((p_1_2_1>=1)||(p_2_0_0>=1))||(p_2_0_1>=1))||(p_2_1_2>=1))||(p_1_1_2>=1))) * (((EF(((((((((p_0_0_0>=1)||(p_0_0_1>=1))||(p_2_1_0>=1))||(p_0_1_2>=1))||(p_0_2_0>=1))||(p_2_1_1>=1))||(p_0_2_2>=1))||(p_1_1_0>=1))) * EF((p_1_2_0>=1))) * (((((((p_1_2_2>=1)||(p_2_0_1>=1))||(p_2_0_2>=1))||(p_2_1_1>=1))||(p_0_2_0>=1))||(p_0_2_2>=1))||(p_1_0_1>=1))) + (!(AF(((p_0_0_1>=1)||(p_0_0_2>=1)))) * (((((((((p_1_2_1>=1)||(p_0_0_1>=1))||(p_2_0_1>=1))||(p_0_1_0>=1))||(p_2_1_1>=1))||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_1_0_1>=1))||(p_1_0_2>=1)))))))
=> equivalent forward existential formula: (([(FwdU((EY(Init) * !(!(E(TRUE U !((((!(EX(((((((((p_0_0_2>=1)||(p_2_0_2>=1))||(p_2_1_0>=1))||(p_2_1_1>=1))||(p_2_1_2>=1))||(p_2_2_0>=1))||(p_2_2_2>=1))||(p_1_1_2>=1)))) * (((((((((((p_0_0_1>=1)||(p_2_0_1>=1))||(p_2_0_2>=1))||(p_0_1_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_0_2_1>=1))||(p_2_2_1>=1))||(p_1_1_0>=1))&&(p_2_2_0>=1)) + !(EX(!(((((((((p_2_0_0>=1)||(p_2_0_1>=1))||(p_0_1_1>=1))||(p_0_1_2>=1))||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_1_0_2>=1))))))) * EG((((p_1_2_1>=1)||(p_0_1_1>=1))||(p_1_1_2>=1)))) * ((((p_1_2_2<1)&&(p_0_1_0<1))&&(p_0_2_2<1)) + E((((p_2_1_1>=1)||(p_1_1_1>=1))||(p_1_2_0>=1)) U ((((((((p_2_0_0>=1)||(p_2_0_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_1_0_1>=1))||(p_1_1_2>=1)))))))))),TRUE) * !(((((((p_0_0_0>=1)||(p_0_0_1>=1))||(p_0_0_2>=1))||(p_2_0_1>=1))||(p_2_2_0>=1))||(p_1_0_2>=1))))] = FALSE * [((EY(Init) * !(!(E(TRUE U !((((!(EX(((((((((p_0_0_2>=1)||(p_2_0_2>=1))||(p_2_1_0>=1))||(p_2_1_1>=1))||(p_2_1_2>=1))||(p_2_2_0>=1))||(p_2_2_2>=1))||(p_1_1_2>=1)))) * (((((((((((p_0_0_1>=1)||(p_2_0_1>=1))||(p_2_0_2>=1))||(p_0_1_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_0_2_1>=1))||(p_2_2_1>=1))||(p_1_1_0>=1))&&(p_2_2_0>=1)) + !(EX(!(((((((((p_2_0_0>=1)||(p_2_0_1>=1))||(p_0_1_1>=1))||(p_0_1_2>=1))||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_1_0_2>=1))))))) * EG((((p_1_2_1>=1)||(p_0_1_1>=1))||(p_1_1_2>=1)))) * ((((p_1_2_2<1)&&(p_0_1_0<1))&&(p_0_2_2<1)) + E((((p_2_1_1>=1)||(p_1_1_1>=1))||(p_1_2_0>=1)) U ((((((((p_2_0_0>=1)||(p_2_0_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_1_0_1>=1))||(p_1_1_2>=1)))))))))) * !((((((p_1_2_1>=1)||(p_2_0_0>=1))||(p_2_0_1>=1))||(p_2_1_2>=1))||(p_1_1_2>=1))))] = FALSE) * (([(((EY(Init) * !(!(E(TRUE U !((((!(EX(((((((((p_0_0_2>=1)||(p_2_0_2>=1))||(p_2_1_0>=1))||(p_2_1_1>=1))||(p_2_1_2>=1))||(p_2_2_0>=1))||(p_2_2_2>=1))||(p_1_1_2>=1)))) * (((((((((((p_0_0_1>=1)||(p_2_0_1>=1))||(p_2_0_2>=1))||(p_0_1_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_0_2_1>=1))||(p_2_2_1>=1))||(p_1_1_0>=1))&&(p_2_2_0>=1)) + !(EX(!(((((((((p_2_0_0>=1)||(p_2_0_1>=1))||(p_0_1_1>=1))||(p_0_1_2>=1))||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_1_0_2>=1))))))) * EG((((p_1_2_1>=1)||(p_0_1_1>=1))||(p_1_1_2>=1)))) * ((((p_1_2_2<1)&&(p_0_1_0<1))&&(p_0_2_2<1)) + E((((p_2_1_1>=1)||(p_1_1_1>=1))||(p_1_2_0>=1)) U ((((((((p_2_0_0>=1)||(p_2_0_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_1_0_1>=1))||(p_1_1_2>=1)))))))))) * !((!(!(EG(!(((p_0_0_1>=1)||(p_0_0_2>=1)))))) * (((((((((p_1_2_1>=1)||(p_0_0_1>=1))||(p_2_0_1>=1))||(p_0_1_0>=1))||(p_2_1_1>=1))||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_1_0_1>=1))||(p_1_0_2>=1))))) * !(E(TRUE U ((((((((p_0_0_0>=1)||(p_0_0_1>=1))||(p_2_1_0>=1))||(p_0_1_2>=1))||(p_0_2_0>=1))||(p_2_1_1>=1))||(p_0_2_2>=1))||(p_1_1_0>=1)))))] = FALSE * [(((EY(Init) * !(!(E(TRUE U !((((!(EX(((((((((p_0_0_2>=1)||(p_2_0_2>=1))||(p_2_1_0>=1))||(p_2_1_1>=1))||(p_2_1_2>=1))||(p_2_2_0>=1))||(p_2_2_2>=1))||(p_1_1_2>=1)))) * (((((((((((p_0_0_1>=1)||(p_2_0_1>=1))||(p_2_0_2>=1))||(p_0_1_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_0_2_1>=1))||(p_2_2_1>=1))||(p_1_1_0>=1))&&(p_2_2_0>=1)) + !(EX(!(((((((((p_2_0_0>=1)||(p_2_0_1>=1))||(p_0_1_1>=1))||(p_0_1_2>=1))||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_1_0_2>=1))))))) * EG((((p_1_2_1>=1)||(p_0_1_1>=1))||(p_1_1_2>=1)))) * ((((p_1_2_2<1)&&(p_0_1_0<1))&&(p_0_2_2<1)) + E((((p_2_1_1>=1)||(p_1_1_1>=1))||(p_1_2_0>=1)) U ((((((((p_2_0_0>=1)||(p_2_0_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_1_0_1>=1))||(p_1_1_2>=1)))))))))) * !((!(!(EG(!(((p_0_0_1>=1)||(p_0_0_2>=1)))))) * (((((((((p_1_2_1>=1)||(p_0_0_1>=1))||(p_2_0_1>=1))||(p_0_1_0>=1))||(p_2_1_1>=1))||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_1_0_1>=1))||(p_1_0_2>=1))))) * !(E(TRUE U (p_1_2_0>=1))))] = FALSE) * [(((EY(Init) * !(!(E(TRUE U !((((!(EX(((((((((p_0_0_2>=1)||(p_2_0_2>=1))||(p_2_1_0>=1))||(p_2_1_1>=1))||(p_2_1_2>=1))||(p_2_2_0>=1))||(p_2_2_2>=1))||(p_1_1_2>=1)))) * (((((((((((p_0_0_1>=1)||(p_2_0_1>=1))||(p_2_0_2>=1))||(p_0_1_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_0_2_1>=1))||(p_2_2_1>=1))||(p_1_1_0>=1))&&(p_2_2_0>=1)) + !(EX(!(((((((((p_2_0_0>=1)||(p_2_0_1>=1))||(p_0_1_1>=1))||(p_0_1_2>=1))||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_1_0_2>=1))))))) * EG((((p_1_2_1>=1)||(p_0_1_1>=1))||(p_1_1_2>=1)))) * ((((p_1_2_2<1)&&(p_0_1_0<1))&&(p_0_2_2<1)) + E((((p_2_1_1>=1)||(p_1_1_1>=1))||(p_1_2_0>=1)) U ((((((((p_2_0_0>=1)||(p_2_0_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_1_0_1>=1))||(p_1_1_2>=1)))))))))) * !((!(!(EG(!(((p_0_0_1>=1)||(p_0_0_2>=1)))))) * (((((((((p_1_2_1>=1)||(p_0_0_1>=1))||(p_2_0_1>=1))||(p_0_1_0>=1))||(p_2_1_1>=1))||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_1_0_1>=1))||(p_1_0_2>=1))))) * !((((((((p_1_2_2>=1)||(p_2_0_1>=1))||(p_2_0_2>=1))||(p_2_1_1>=1))||(p_0_2_0>=1))||(p_0_2_2>=1))||(p_1_0_1>=1))))] = FALSE))
Hit Full ! (commute/partial/dont) 128/0/34
(forward)formula 1,0,3.34491,73496,1,0,38,381218,54,16,1942,368293,37
FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX((AX(((((((((((((((((((((((((((p_0_0_0>=1)||(p_2_0_1>=1))||(p_2_2_0>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_2_2_2>=1))||(p_1_0_2>=1))||(p_1_1_2>=1))||(p_2_0_0>=1))||(p_0_0_2>=1))||(p_0_1_1>=1))||(p_2_1_1>=1))||(p_2_1_2>=1))||(p_2_2_0>=1))||(p_2_2_1>=1))||(p_1_0_2>=1))||(p_1_2_0>=1))&&(p_0_0_0<1))&&(p_1_2_1<1))&&(p_2_1_0<1))&&(p_0_2_0<1))&&(p_2_2_0<1))&&(p_2_2_1<1))&&(p_1_0_1<1))&&(p_2_2_2<1))&&(p_1_1_0<1))) + (((AX((((p_0_0_2>=1)||(p_1_1_1>=1))&&((((((p_0_1_0>=1)||(p_0_1_2>=1))||(p_2_2_0>=1))||(p_1_1_0>=1))||(p_1_1_1>=1))||(p_1_1_2>=1)))) * !(EG(((((((p_0_0_1>=1)||(p_0_1_0>=1))||(p_0_1_2>=1))||(p_0_2_2>=1))||(p_1_0_0>=1)) * AF(((((((p_0_0_2>=1)||(p_0_1_1>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_2_2_2>=1))||(p_1_1_2>=1))))))) * (p_2_2_2>=1)) * (((((p_0_0_1>=1)||(p_0_1_0>=1))||(p_2_0_1>=1))||(p_1_0_0>=1))||(p_1_1_1>=1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(((((((((((((((((((((((((((p_0_0_0>=1)||(p_2_0_1>=1))||(p_2_2_0>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_2_2_2>=1))||(p_1_0_2>=1))||(p_1_1_2>=1))||(p_2_0_0>=1))||(p_0_0_2>=1))||(p_0_1_1>=1))||(p_2_1_1>=1))||(p_2_1_2>=1))||(p_2_2_0>=1))||(p_2_2_1>=1))||(p_1_0_2>=1))||(p_1_2_0>=1))&&(p_0_0_0<1))&&(p_1_2_1<1))&&(p_2_1_0<1))&&(p_0_2_0<1))&&(p_2_2_0<1))&&(p_2_2_1<1))&&(p_1_0_1<1))&&(p_2_2_2<1))&&(p_1_1_0<1))))))] != FALSE + [((((EY(Init) * (((((p_0_0_1>=1)||(p_0_1_0>=1))||(p_2_0_1>=1))||(p_1_0_0>=1))||(p_1_1_1>=1))) * (p_2_2_2>=1)) * !(EX(!((((p_0_0_2>=1)||(p_1_1_1>=1))&&((((((p_0_1_0>=1)||(p_0_1_2>=1))||(p_2_2_0>=1))||(p_1_1_0>=1))||(p_1_1_1>=1))||(p_1_1_2>=1))))))) * !(EG(((((((p_0_0_1>=1)||(p_0_1_0>=1))||(p_0_1_2>=1))||(p_0_2_2>=1))||(p_1_0_0>=1)) * !(EG(!(((((((p_0_0_2>=1)||(p_0_1_1>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_2_2_2>=1))||(p_1_1_2>=1)))))))))] != FALSE)
Using saturation style SCC detection
(forward)formula 2,0,5.85366,124480,1,0,54,656991,74,26,2047,663785,47
FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX(AG(((((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_1_1>=1))||(p_1_0_0>=1))||(p_1_1_0>=1))||(p_1_1_1>=1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(((((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_1_1>=1))||(p_1_0_0>=1))||(p_1_1_0>=1))||(p_1_1_1>=1))))] = FALSE
(forward)formula 3,0,5.86559,124744,1,0,57,658315,76,28,2053,666102,48
FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX((((E((!(A((((((((((p_0_0_1>=1)||(p_2_0_1>=1))||(p_0_1_1>=1))||(p_0_2_0>=1))||(p_2_1_1>=1))||(p_0_2_1>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_1_1_2>=1)) U ((((((p_0_0_2>=1)||(p_2_0_0>=1))||(p_0_1_0>=1))||(p_0_2_0>=1))||(p_2_2_0>=1))||(p_1_0_0>=1)))) * ((!(E((((((((p_1_2_1>=1)||(p_0_0_2>=1))||(p_2_0_1>=1))||(p_0_1_2>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_1_1_2>=1)) U (((p_0_0_2>=1)||(p_2_0_1>=1))||(p_1_0_1>=1)))) + (((((p_0_0_1<1)&&(p_2_0_0<1))&&(p_2_0_1<1))&&(p_0_1_0<1))&&(p_2_1_0<1))) + (((p_2_2_0<1)&&(p_2_2_1<1))&&(p_1_2_0<1)))) U A(A(((((((p_1_2_2>=1)||(p_0_0_1>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_1_0_0>=1))||(p_1_0_2>=1)) U (p_0_2_0>=1)) U EG(((((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_2_2>=1))||(p_1_0_1>=1))||(p_1_1_0>=1))||(p_1_1_1>=1))))) * !(EX(((((((((((p_2_0_1>=1)||(p_0_2_1>=1))||(p_2_2_0>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_2_2_1>=1))||(p_1_0_1>=1))||(p_1_1_0>=1))||(p_1_1_1>=1))&&((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_1_2>=1))||(p_1_0_2>=1)))))) * AX((((((((p_0_0_1>=1)||(p_0_1_2>=1))||(p_1_0_0>=1))||(p_2_2_2>=1))||(p_1_0_1>=1))||(p_1_1_1>=1))||(p_1_2_0>=1)))) * (!(EG(((((p_0_0_0>=1)||(p_2_0_2>=1))||(p_0_2_2>=1))||(p_1_0_0>=1)))) + (((p_0_0_0>=1)||(p_2_0_1>=1))&&(((((((((((p_0_0_0<1)&&(p_1_2_2<1))&&(p_0_0_2<1))&&(p_2_0_1<1))&&(p_2_0_2<1))&&(p_0_1_2<1))&&(p_2_2_0<1))&&(p_0_2_2<1))&&(p_1_0_1<1))&&(p_1_2_0<1))||(((p_2_1_0<1)&&(p_2_1_2<1))&&(p_1_0_2<1)))))))
=> equivalent forward existential formula: ([((EY(Init) * ((E((!(!((E(!(((((((p_0_0_2>=1)||(p_2_0_0>=1))||(p_0_1_0>=1))||(p_0_2_0>=1))||(p_2_2_0>=1))||(p_1_0_0>=1))) U (!((((((((((p_0_0_1>=1)||(p_2_0_1>=1))||(p_0_1_1>=1))||(p_0_2_0>=1))||(p_2_1_1>=1))||(p_0_2_1>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_1_1_2>=1))) * !(((((((p_0_0_2>=1)||(p_2_0_0>=1))||(p_0_1_0>=1))||(p_0_2_0>=1))||(p_2_2_0>=1))||(p_1_0_0>=1))))) + EG(!(((((((p_0_0_2>=1)||(p_2_0_0>=1))||(p_0_1_0>=1))||(p_0_2_0>=1))||(p_2_2_0>=1))||(p_1_0_0>=1))))))) * ((!(E((((((((p_1_2_1>=1)||(p_0_0_2>=1))||(p_2_0_1>=1))||(p_0_1_2>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_1_1_2>=1)) U (((p_0_0_2>=1)||(p_2_0_1>=1))||(p_1_0_1>=1)))) + (((((p_0_0_1<1)&&(p_2_0_0<1))&&(p_2_0_1<1))&&(p_0_1_0<1))&&(p_2_1_0<1))) + (((p_2_2_0<1)&&(p_2_2_1<1))&&(p_1_2_0<1)))) U !((E(!(EG(((((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_2_2>=1))||(p_1_0_1>=1))||(p_1_1_0>=1))||(p_1_1_1>=1)))) U (!(!((E(!((p_0_2_0>=1)) U (!(((((((p_1_2_2>=1)||(p_0_0_1>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_1_0_0>=1))||(p_1_0_2>=1))) * !((p_0_2_0>=1)))) + EG(!((p_0_2_0>=1)))))) * !(EG(((((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_2_2>=1))||(p_1_0_1>=1))||(p_1_1_0>=1))||(p_1_1_1>=1)))))) + EG(!(EG(((((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_2_2>=1))||(p_1_0_1>=1))||(p_1_1_0>=1))||(p_1_1_1>=1)))))))) * !(EX(((((((((((p_2_0_1>=1)||(p_0_2_1>=1))||(p_2_2_0>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_2_2_1>=1))||(p_1_0_1>=1))||(p_1_1_0>=1))||(p_1_1_1>=1))&&((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_1_2>=1))||(p_1_0_2>=1)))))) * !(EX(!((((((((p_0_0_1>=1)||(p_0_1_2>=1))||(p_1_0_0>=1))||(p_2_2_2>=1))||(p_1_0_1>=1))||(p_1_1_1>=1))||(p_1_2_0>=1))))))) * !(EG(((((p_0_0_0>=1)||(p_2_0_2>=1))||(p_0_2_2>=1))||(p_1_0_0>=1)))))] != FALSE + [((EY(Init) * ((E((!(!((E(!(((((((p_0_0_2>=1)||(p_2_0_0>=1))||(p_0_1_0>=1))||(p_0_2_0>=1))||(p_2_2_0>=1))||(p_1_0_0>=1))) U (!((((((((((p_0_0_1>=1)||(p_2_0_1>=1))||(p_0_1_1>=1))||(p_0_2_0>=1))||(p_2_1_1>=1))||(p_0_2_1>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_1_1_2>=1))) * !(((((((p_0_0_2>=1)||(p_2_0_0>=1))||(p_0_1_0>=1))||(p_0_2_0>=1))||(p_2_2_0>=1))||(p_1_0_0>=1))))) + EG(!(((((((p_0_0_2>=1)||(p_2_0_0>=1))||(p_0_1_0>=1))||(p_0_2_0>=1))||(p_2_2_0>=1))||(p_1_0_0>=1))))))) * ((!(E((((((((p_1_2_1>=1)||(p_0_0_2>=1))||(p_2_0_1>=1))||(p_0_1_2>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_1_1_2>=1)) U (((p_0_0_2>=1)||(p_2_0_1>=1))||(p_1_0_1>=1)))) + (((((p_0_0_1<1)&&(p_2_0_0<1))&&(p_2_0_1<1))&&(p_0_1_0<1))&&(p_2_1_0<1))) + (((p_2_2_0<1)&&(p_2_2_1<1))&&(p_1_2_0<1)))) U !((E(!(EG(((((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_2_2>=1))||(p_1_0_1>=1))||(p_1_1_0>=1))||(p_1_1_1>=1)))) U (!(!((E(!((p_0_2_0>=1)) U (!(((((((p_1_2_2>=1)||(p_0_0_1>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_1_0_0>=1))||(p_1_0_2>=1))) * !((p_0_2_0>=1)))) + EG(!((p_0_2_0>=1)))))) * !(EG(((((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_2_2>=1))||(p_1_0_1>=1))||(p_1_1_0>=1))||(p_1_1_1>=1)))))) + EG(!(EG(((((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_2_2>=1))||(p_1_0_1>=1))||(p_1_1_0>=1))||(p_1_1_1>=1)))))))) * !(EX(((((((((((p_2_0_1>=1)||(p_0_2_1>=1))||(p_2_2_0>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_2_2_1>=1))||(p_1_0_1>=1))||(p_1_1_0>=1))||(p_1_1_1>=1))&&((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_1_2>=1))||(p_1_0_2>=1)))))) * !(EX(!((((((((p_0_0_1>=1)||(p_0_1_2>=1))||(p_1_0_0>=1))||(p_2_2_2>=1))||(p_1_0_1>=1))||(p_1_1_1>=1))||(p_1_2_0>=1))))))) * (((p_0_0_0>=1)||(p_2_0_1>=1))&&(((((((((((p_0_0_0<1)&&(p_1_2_2<1))&&(p_0_0_2<1))&&(p_2_0_1<1))&&(p_2_0_2<1))&&(p_0_1_2<1))&&(p_2_2_0<1))&&(p_0_2_2<1))&&(p_1_0_1<1))&&(p_1_2_0<1))||(((p_2_1_0<1)&&(p_2_1_2<1))&&(p_1_0_2<1)))))] != FALSE)
Hit Full ! (commute/partial/dont) 90/0/72
Hit Full ! (commute/partial/dont) 98/312/64
Hit Full ! (commute/partial/dont) 150/0/12
Using saturation style SCC detection
(forward)formula 4,0,18.0782,347040,1,0,143,1.81875e+06,136,100,2407,1.82966e+06,138
FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX(AG(A((((((((((((((p_0_0_0<1)&&(p_0_0_2<1))&&(p_0_1_1<1))&&(p_2_1_0<1))&&(p_0_2_0<1))&&(p_2_2_0<1))&&(p_2_2_1<1))&&(p_1_1_2<1))&&(p_2_0_0<1))&&(p_1_0_0<1))&&(p_1_1_0<1))&&(p_1_1_1<1))&&((((p_2_1_2>=1)||(p_2_2_1>=1))||(p_1_1_1>=1))||(p_1_1_2>=1))) U E((((((((p_1_2_2>=1)||(p_0_0_2>=1))||(p_0_1_2>=1))||(p_2_1_2>=1))||(p_2_2_1>=1))||(p_2_2_2>=1))||(p_1_1_1>=1)) U AF((((((((p_0_1_2>=1)||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_1_1_1>=1))||(p_1_2_0>=1)))))))
=> equivalent forward existential formula: ([((FwdU(FwdU(EY(Init),TRUE),!(E((((((((p_1_2_2>=1)||(p_0_0_2>=1))||(p_0_1_2>=1))||(p_2_1_2>=1))||(p_2_2_1>=1))||(p_2_2_2>=1))||(p_1_1_1>=1)) U !(EG(!((((((((p_0_1_2>=1)||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_1_1_1>=1))||(p_1_2_0>=1)))))))) * !((((((((((((((p_0_0_0<1)&&(p_0_0_2<1))&&(p_0_1_1<1))&&(p_2_1_0<1))&&(p_0_2_0<1))&&(p_2_2_0<1))&&(p_2_2_1<1))&&(p_1_1_2<1))&&(p_2_0_0<1))&&(p_1_0_0<1))&&(p_1_1_0<1))&&(p_1_1_1<1))&&((((p_2_1_2>=1)||(p_2_2_1>=1))||(p_1_1_1>=1))||(p_1_1_2>=1))))) * !(E((((((((p_1_2_2>=1)||(p_0_0_2>=1))||(p_0_1_2>=1))||(p_2_1_2>=1))||(p_2_2_1>=1))||(p_2_2_2>=1))||(p_1_1_1>=1)) U !(EG(!((((((((p_0_1_2>=1)||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_1_1_1>=1))||(p_1_2_0>=1))))))))] = FALSE * [FwdG(FwdU(EY(Init),TRUE),!(E((((((((p_1_2_2>=1)||(p_0_0_2>=1))||(p_0_1_2>=1))||(p_2_1_2>=1))||(p_2_2_1>=1))||(p_2_2_2>=1))||(p_1_1_1>=1)) U !(EG(!((((((((p_0_1_2>=1)||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_1_1_1>=1))||(p_1_2_0>=1))))))))] = FALSE)
Hit Full ! (commute/partial/dont) 88/0/74
(forward)formula 5,0,18.8692,363936,1,0,149,1.91967e+06,155,104,2472,1.9272e+06,147
FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF(!(EX(EX(((((p_2_0_0>=1)||(p_2_0_2>=1))||(p_0_2_2>=1))||(p_1_1_2>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(EX(((((p_2_0_0>=1)||(p_2_0_2>=1))||(p_0_2_2>=1))||(p_1_1_2>=1))))))] != FALSE
(forward)formula 6,0,19.3904,375024,1,0,151,1.98115e+06,156,104,2475,1.99201e+06,150
FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (A((((((p_0_0_0>=1)||(p_0_0_1>=1))||(p_2_0_0>=1))||(p_2_2_0>=1))||(p_2_2_1>=1)) U (((((((((((((((((!(EX(((((((((((p_1_2_1>=1)||(p_0_0_0>=1))||(p_1_2_2>=1))||(p_0_0_2>=1))||(p_0_1_1>=1))||(p_2_1_1>=1))||(p_2_2_1>=1))||(p_1_0_0>=1))||(p_1_0_2>=1))||(p_1_1_2>=1)))) * !(A((((((((p_1_2_1>=1)||(p_0_0_2>=1))||(p_2_0_2>=1))||(p_0_1_1>=1))||(p_2_1_0>=1))||(p_0_2_1>=1))||(p_1_0_1>=1)) U ((p_1_2_2>=1)||(p_1_0_0>=1))))) * (p_0_0_1<1)) * (p_2_0_1<1)) * (p_0_1_1<1)) * (p_0_1_2<1)) * (p_0_2_0<1)) * (p_0_2_1<1)) * (p_2_2_2<1)) * (p_2_0_1<1)) * (p_0_2_0<1)) * (p_2_1_1<1)) * (p_2_1_2<1)) * (p_0_0_1<1)) * (p_2_1_1<1)) * (p_0_2_2<1)) * (p_1_1_2<1)) + !(AX(EF(((((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_1_0_0>=1))||(p_1_1_1>=1))))))) + (EX((AX(((p_1_1_0>=1)||(p_1_1_2>=1))) * A((((p_0_2_1>=1)||(p_1_1_2>=1))||(p_1_2_0>=1)) U (((p_2_0_2>=1)||(p_0_2_1>=1))||(p_1_0_0>=1))))) * EX((AG(((((((p_0_0_2>=1)||(p_0_1_0>=1))||(p_2_0_2>=1))||(p_0_2_1>=1))||(p_2_2_0>=1))||(p_1_0_1>=1))) * A((((p_0_2_1>=1)||(p_2_2_0>=1))||(p_1_0_2>=1)) U (((p_0_0_0>=1)||(p_0_1_1>=1))||(p_0_2_2>=1)))))))
=> equivalent forward existential formula: ([((Init * !(EG(!((((((((((((((((((!(EX(((((((((((p_1_2_1>=1)||(p_0_0_0>=1))||(p_1_2_2>=1))||(p_0_0_2>=1))||(p_0_1_1>=1))||(p_2_1_1>=1))||(p_2_2_1>=1))||(p_1_0_0>=1))||(p_1_0_2>=1))||(p_1_1_2>=1)))) * !(!((E(!(((p_1_2_2>=1)||(p_1_0_0>=1))) U (!((((((((p_1_2_1>=1)||(p_0_0_2>=1))||(p_2_0_2>=1))||(p_0_1_1>=1))||(p_2_1_0>=1))||(p_0_2_1>=1))||(p_1_0_1>=1))) * !(((p_1_2_2>=1)||(p_1_0_0>=1))))) + EG(!(((p_1_2_2>=1)||(p_1_0_0>=1)))))))) * (p_0_0_1<1)) * (p_2_0_1<1)) * (p_0_1_1<1)) * (p_0_1_2<1)) * (p_0_2_0<1)) * (p_0_2_1<1)) * (p_2_2_2<1)) * (p_2_0_1<1)) * (p_0_2_0<1)) * (p_2_1_1<1)) * (p_2_1_2<1)) * (p_0_0_1<1)) * (p_2_1_1<1)) * (p_0_2_2<1)) * (p_1_1_2<1)) + !(!(EX(!(E(TRUE U ((((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_1_0_0>=1))||(p_1_1_1>=1)))))))))))) * !(E(!((((((((((((((((((!(EX(((((((((((p_1_2_1>=1)||(p_0_0_0>=1))||(p_1_2_2>=1))||(p_0_0_2>=1))||(p_0_1_1>=1))||(p_2_1_1>=1))||(p_2_2_1>=1))||(p_1_0_0>=1))||(p_1_0_2>=1))||(p_1_1_2>=1)))) * !(!((E(!(((p_1_2_2>=1)||(p_1_0_0>=1))) U (!((((((((p_1_2_1>=1)||(p_0_0_2>=1))||(p_2_0_2>=1))||(p_0_1_1>=1))||(p_2_1_0>=1))||(p_0_2_1>=1))||(p_1_0_1>=1))) * !(((p_1_2_2>=1)||(p_1_0_0>=1))))) + EG(!(((p_1_2_2>=1)||(p_1_0_0>=1)))))))) * (p_0_0_1<1)) * (p_2_0_1<1)) * (p_0_1_1<1)) * (p_0_1_2<1)) * (p_0_2_0<1)) * (p_0_2_1<1)) * (p_2_2_2<1)) * (p_2_0_1<1)) * (p_0_2_0<1)) * (p_2_1_1<1)) * (p_2_1_2<1)) * (p_0_0_1<1)) * (p_2_1_1<1)) * (p_0_2_2<1)) * (p_1_1_2<1)) + !(!(EX(!(E(TRUE U ((((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_1_0_0>=1))||(p_1_1_1>=1))))))))) U (!((((((p_0_0_0>=1)||(p_0_0_1>=1))||(p_2_0_0>=1))||(p_2_2_0>=1))||(p_2_2_1>=1))) * !((((((((((((((((((!(EX(((((((((((p_1_2_1>=1)||(p_0_0_0>=1))||(p_1_2_2>=1))||(p_0_0_2>=1))||(p_0_1_1>=1))||(p_2_1_1>=1))||(p_2_2_1>=1))||(p_1_0_0>=1))||(p_1_0_2>=1))||(p_1_1_2>=1)))) * !(!((E(!(((p_1_2_2>=1)||(p_1_0_0>=1))) U (!((((((((p_1_2_1>=1)||(p_0_0_2>=1))||(p_2_0_2>=1))||(p_0_1_1>=1))||(p_2_1_0>=1))||(p_0_2_1>=1))||(p_1_0_1>=1))) * !(((p_1_2_2>=1)||(p_1_0_0>=1))))) + EG(!(((p_1_2_2>=1)||(p_1_0_0>=1)))))))) * (p_0_0_1<1)) * (p_2_0_1<1)) * (p_0_1_1<1)) * (p_0_1_2<1)) * (p_0_2_0<1)) * (p_0_2_1<1)) * (p_2_2_2<1)) * (p_2_0_1<1)) * (p_0_2_0<1)) * (p_2_1_1<1)) * (p_2_1_2<1)) * (p_0_0_1<1)) * (p_2_1_1<1)) * (p_0_2_2<1)) * (p_1_1_2<1)) + !(!(EX(!(E(TRUE U ((((((p_1_2_1>=1)||(p_2_0_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_1_0_0>=1))||(p_1_1_1>=1)))))))))))))] != FALSE + [(((EY((Init * EX((!(EX(!(((p_1_1_0>=1)||(p_1_1_2>=1))))) * !((E(!((((p_2_0_2>=1)||(p_0_2_1>=1))||(p_1_0_0>=1))) U (!((((p_0_2_1>=1)||(p_1_1_2>=1))||(p_1_2_0>=1))) * !((((p_2_0_2>=1)||(p_0_2_1>=1))||(p_1_0_0>=1))))) + EG(!((((p_2_0_2>=1)||(p_0_2_1>=1))||(p_1_0_0>=1)))))))))) * !(E(TRUE U !(((((((p_0_0_2>=1)||(p_0_1_0>=1))||(p_2_0_2>=1))||(p_0_2_1>=1))||(p_2_2_0>=1))||(p_1_0_1>=1)))))) * !(EG(!((((p_0_0_0>=1)||(p_0_1_1>=1))||(p_0_2_2>=1)))))) * !(E(!((((p_0_0_0>=1)||(p_0_1_1>=1))||(p_0_2_2>=1))) U (!((((p_0_2_1>=1)||(p_2_2_0>=1))||(p_1_0_2>=1))) * !((((p_0_0_0>=1)||(p_0_1_1>=1))||(p_0_2_2>=1)))))))] != FALSE)
Hit Full ! (commute/partial/dont) 138/24/24
Hit Full ! (commute/partial/dont) 126/72/36
(forward)formula 7,0,21.3155,419968,1,0,170,2.20449e+06,198,106,2706,2.18823e+06,181
FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG(E((EX(((((p_0_0_0>=1)||(p_0_2_2>=1))||(p_1_0_1>=1))||(p_1_1_2>=1))) + AG((p_2_2_0>=1))) U (A(((((((((p_0_0_0>=1)||(p_1_2_1>=1))||(p_0_0_2>=1))||(p_0_1_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_2_2_0>=1))||(p_1_1_0>=1)) U ((((p_0_1_0>=1)||(p_2_0_1>=1))||(p_2_1_1>=1))||(p_1_1_0>=1))) * (((EF((((((p_0_1_1>=1)||(p_0_1_2>=1))||(p_0_2_0>=1))||(p_1_0_2>=1))||(p_1_1_2>=1))) * ((((((((((p_0_0_0>=1)||(p_0_0_2>=1))||(p_2_0_1>=1))||(p_1_1_0>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_2_2_2>=1))||(p_1_1_2>=1))) + (E((((((((p_1_2_1>=1)||(p_0_1_0>=1))||(p_0_2_0>=1))||(p_0_2_1>=1))||(p_2_2_0>=1))||(p_1_0_0>=1))||(p_1_0_2>=1)) U ((((p_0_1_0>=1)||(p_2_0_2>=1))||(p_1_0_1>=1))||(p_1_1_2>=1))) * EF(((((p_1_2_1>=1)||(p_0_1_0>=1))||(p_2_0_1>=1))||(p_1_0_1>=1))))) + ((((((((A(((((((p_1_2_2>=1)||(p_0_1_1>=1))||(p_0_2_1>=1))||(p_2_2_2>=1))||(p_1_0_2>=1))||(p_1_1_2>=1)) U (((((p_2_0_0>=1)||(p_2_0_2>=1))||(p_0_2_0>=1))||(p_1_0_0>=1))||(p_1_0_1>=1))) * EX(((((((p_0_0_0>=1)||(p_2_0_1>=1))||(p_0_1_2>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_1_1_2>=1)))) * (p_0_0_0<1)) * (p_2_0_0<1)) * (p_0_0_2<1)) * (p_0_1_0<1)) * (p_0_1_1<1)) * (p_1_0_2<1)) * (((((((((p_1_2_2>=1)||(p_0_0_2>=1))||(p_1_1_1>=1))||(p_1_2_1>=1))||(p_0_0_1>=1))||(p_2_0_2>=1))||(p_0_1_2>=1))||(p_2_2_0>=1))||(p_2_2_1>=1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((EX(((((p_0_0_0>=1)||(p_0_2_2>=1))||(p_1_0_1>=1))||(p_1_1_2>=1))) + !(E(TRUE U !((p_2_2_0>=1))))) U (!((E(!(((((p_0_1_0>=1)||(p_2_0_1>=1))||(p_2_1_1>=1))||(p_1_1_0>=1))) U (!(((((((((p_0_0_0>=1)||(p_1_2_1>=1))||(p_0_0_2>=1))||(p_0_1_1>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_2_2_0>=1))||(p_1_1_0>=1))) * !(((((p_0_1_0>=1)||(p_2_0_1>=1))||(p_2_1_1>=1))||(p_1_1_0>=1))))) + EG(!(((((p_0_1_0>=1)||(p_2_0_1>=1))||(p_2_1_1>=1))||(p_1_1_0>=1)))))) * (((E(TRUE U (((((p_0_1_1>=1)||(p_0_1_2>=1))||(p_0_2_0>=1))||(p_1_0_2>=1))||(p_1_1_2>=1))) * ((((((((((p_0_0_0>=1)||(p_0_0_2>=1))||(p_2_0_1>=1))||(p_1_1_0>=1))||(p_2_1_0>=1))||(p_0_2_0>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_2_2_2>=1))||(p_1_1_2>=1))) + (E((((((((p_1_2_1>=1)||(p_0_1_0>=1))||(p_0_2_0>=1))||(p_0_2_1>=1))||(p_2_2_0>=1))||(p_1_0_0>=1))||(p_1_0_2>=1)) U ((((p_0_1_0>=1)||(p_2_0_2>=1))||(p_1_0_1>=1))||(p_1_1_2>=1))) * E(TRUE U ((((p_1_2_1>=1)||(p_0_1_0>=1))||(p_2_0_1>=1))||(p_1_0_1>=1))))) + ((((((((!((E(!((((((p_2_0_0>=1)||(p_2_0_2>=1))||(p_0_2_0>=1))||(p_1_0_0>=1))||(p_1_0_1>=1))) U (!(((((((p_1_2_2>=1)||(p_0_1_1>=1))||(p_0_2_1>=1))||(p_2_2_2>=1))||(p_1_0_2>=1))||(p_1_1_2>=1))) * !((((((p_2_0_0>=1)||(p_2_0_2>=1))||(p_0_2_0>=1))||(p_1_0_0>=1))||(p_1_0_1>=1))))) + EG(!((((((p_2_0_0>=1)||(p_2_0_2>=1))||(p_0_2_0>=1))||(p_1_0_0>=1))||(p_1_0_1>=1)))))) * EX(((((((p_0_0_0>=1)||(p_2_0_1>=1))||(p_0_1_2>=1))||(p_0_2_2>=1))||(p_2_2_1>=1))||(p_1_1_2>=1)))) * (p_0_0_0<1)) * (p_2_0_0<1)) * (p_0_0_2<1)) * (p_0_1_0<1)) * (p_0_1_1<1)) * (p_1_0_2<1)) * (((((((((p_1_2_2>=1)||(p_0_0_2>=1))||(p_1_1_1>=1))||(p_1_2_1>=1))||(p_0_0_1>=1))||(p_2_0_2>=1))||(p_0_1_2>=1))||(p_2_2_0>=1))||(p_2_2_1>=1))))))))] = FALSE
Hit Full ! (commute/partial/dont) 88/0/74
Hit Full ! (commute/partial/dont) 108/210/54
Hit Full ! (commute/partial/dont) 118/128/44
(forward)formula 8,0,25.9151,512556,1,0,207,2.71081e+06,248,128,3062,2.69234e+06,222
FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
Detected timeout of ITS tools.
[2021-05-13 18:17:58] [INFO ] Flatten gal took : 7 ms
[2021-05-13 18:17:58] [INFO ] Input system was already deterministic with 162 transitions.
[2021-05-13 18:17:58] [INFO ] Transformed 27 places.
[2021-05-13 18:17:58] [INFO ] Transformed 162 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-13 18:17:58] [INFO ] Time to serialize gal into /tmp/CTLFireability6885866396826491694.gal : 1 ms
[2021-05-13 18:17:58] [INFO ] Time to serialize properties into /tmp/CTLFireability6059640773335003389.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/CTLFireability6885866396826491694.gal, -t, CGAL, -ctl, /tmp/CTLFireability6059640773335003389.ctl, --load-order, /home/mcc/execution/model.ord, --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/CTLFireability6885866396826491694.gal -t CGAL -ctl /tmp/CTLFireability6059640773335003389.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 4 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,9.7347e+14,0.415144,14292,2,730,5,59754,6,0,273,56094,0


Converting to forward existential form...Done !
original formula: E((EX(AX(((((((((p_0_1_0>=1)||(p_2_1_0>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_1_1_1>=1))&&(((((((((p_2_0_2>=1)||(p_0_1_1>=1))||(p_0_2_0>=1))||(p_0_2_2>=1))||(p_2_2_0>=1))||(p_1_0_0>=1))||(p_2_2_1>=1))||(p_2_2_2>=1))||(p_1_1_2>=1)))&&(((((((((p_1_2_2>=1)||(p_2_0_1>=1))||(p_0_1_2>=1))||(p_2_1_0>=1))||(p_0_2_1>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_1_1_1>=1))||(p_1_1_2>=1))))) + !(AF(((((((((p_0_0_0>=1)||(p_1_2_1>=1))||(p_1_2_2>=1))||(p_0_0_1>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_1_0_1>=1))||(p_1_2_0>=1))))) U (A((((((((p_1_2_1>=1)||(p_0_1_0>=1))||(p_2_1_1>=1))||(p_2_1_2>=1))||(p_2_2_0>=1))||(p_1_1_0>=1))||(p_1_2_0>=1)) U !(AG((((((((p_1_2_1>=1)||(p_1_2_2>=1))||(p_0_1_2>=1))||(p_0_2_0>=1))||(p_0_2_1>=1))||(p_2_2_0>=1))||(p_2_2_1>=1))))) + (((((((p_1_2_1<1)&&(p_2_0_1<1))&&(p_2_0_2<1))&&(p_0_1_2<1))&&(p_0_2_2<1))&&(p_1_0_1<1))&&(p_1_0_2<1))))
=> equivalent forward existential formula: ([((FwdU(Init,(EX(!(EX(!(((((((((p_0_1_0>=1)||(p_2_1_0>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_1_1_1>=1))&&(((((((((p_2_0_2>=1)||(p_0_1_1>=1))||(p_0_2_0>=1))||(p_0_2_2>=1))||(p_2_2_0>=1))||(p_1_0_0>=1))||(p_2_2_1>=1))||(p_2_2_2>=1))||(p_1_1_2>=1)))&&(((((((((p_1_2_2>=1)||(p_2_0_1>=1))||(p_0_1_2>=1))||(p_2_1_0>=1))||(p_0_2_1>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_1_1_1>=1))||(p_1_1_2>=1))))))) + !(!(EG(!(((((((((p_0_0_0>=1)||(p_1_2_1>=1))||(p_1_2_2>=1))||(p_0_0_1>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_1_0_1>=1))||(p_1_2_0>=1)))))))) * !(EG(!(!(!(E(TRUE U !((((((((p_1_2_1>=1)||(p_1_2_2>=1))||(p_0_1_2>=1))||(p_0_2_0>=1))||(p_0_2_1>=1))||(p_2_2_0>=1))||(p_2_2_1>=1)))))))))) * !(E(!(!(!(E(TRUE U !((((((((p_1_2_1>=1)||(p_1_2_2>=1))||(p_0_1_2>=1))||(p_0_2_0>=1))||(p_0_2_1>=1))||(p_2_2_0>=1))||(p_2_2_1>=1))))))) U (!((((((((p_1_2_1>=1)||(p_0_1_0>=1))||(p_2_1_1>=1))||(p_2_1_2>=1))||(p_2_2_0>=1))||(p_1_1_0>=1))||(p_1_2_0>=1))) * !(!(!(E(TRUE U !((((((((p_1_2_1>=1)||(p_1_2_2>=1))||(p_0_1_2>=1))||(p_0_2_0>=1))||(p_0_2_1>=1))||(p_2_2_0>=1))||(p_2_2_1>=1)))))))))))] != FALSE + [(FwdU(Init,(EX(!(EX(!(((((((((p_0_1_0>=1)||(p_2_1_0>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_1_1_1>=1))&&(((((((((p_2_0_2>=1)||(p_0_1_1>=1))||(p_0_2_0>=1))||(p_0_2_2>=1))||(p_2_2_0>=1))||(p_1_0_0>=1))||(p_2_2_1>=1))||(p_2_2_2>=1))||(p_1_1_2>=1)))&&(((((((((p_1_2_2>=1)||(p_2_0_1>=1))||(p_0_1_2>=1))||(p_2_1_0>=1))||(p_0_2_1>=1))||(p_2_1_2>=1))||(p_0_2_2>=1))||(p_1_1_1>=1))||(p_1_1_2>=1))))))) + !(!(EG(!(((((((((p_0_0_0>=1)||(p_1_2_1>=1))||(p_1_2_2>=1))||(p_0_0_1>=1))||(p_0_2_2>=1))||(p_1_0_0>=1))||(p_1_0_1>=1))||(p_1_2_0>=1)))))))) * (((((((p_1_2_1<1)&&(p_2_0_1<1))&&(p_2_0_2<1))&&(p_0_1_2<1))&&(p_0_2_2<1))&&(p_1_0_1<1))&&(p_1_0_2<1)))] != FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

--------------------
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-d3n3m1t11"
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-d3n3m1t11, 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-162089127300090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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