About the Execution of ITS-Tools for Peterson-COL-3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15745.080 | 201253.00 | 243241.00 | 115.00 | FFFFTFFTTFFTTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961258000668.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-COL-3, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258000668
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 43K Apr 27 15:14 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 Peterson-COL-3-CTLFireability-00
FORMULA_NAME Peterson-COL-3-CTLFireability-01
FORMULA_NAME Peterson-COL-3-CTLFireability-02
FORMULA_NAME Peterson-COL-3-CTLFireability-03
FORMULA_NAME Peterson-COL-3-CTLFireability-04
FORMULA_NAME Peterson-COL-3-CTLFireability-05
FORMULA_NAME Peterson-COL-3-CTLFireability-06
FORMULA_NAME Peterson-COL-3-CTLFireability-07
FORMULA_NAME Peterson-COL-3-CTLFireability-08
FORMULA_NAME Peterson-COL-3-CTLFireability-09
FORMULA_NAME Peterson-COL-3-CTLFireability-10
FORMULA_NAME Peterson-COL-3-CTLFireability-11
FORMULA_NAME Peterson-COL-3-CTLFireability-12
FORMULA_NAME Peterson-COL-3-CTLFireability-13
FORMULA_NAME Peterson-COL-3-CTLFireability-14
FORMULA_NAME Peterson-COL-3-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1590019050692
[2020-05-20 23:57:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-20 23:57:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 23:57:33] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-20 23:57:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 789 ms
[2020-05-20 23:57:33] [INFO ] sort/places :
ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
TourProc->turn,
ProcTour->askForSection,testTurn,endTurn,
Process->idle,CS,
[2020-05-20 23:57:33] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 44 ms.
[2020-05-20 23:57:33] [INFO ] Computed order based on color domains.
[2020-05-20 23:57:33] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions in 26 ms.
[2020-05-20 23:57:33] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 24 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 67 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 381 ms. (steps per millisecond=262 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1]
[2020-05-20 23:57:34] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-05-20 23:57:34] [INFO ] Computed 15 place invariants in 42 ms
[2020-05-20 23:57:34] [INFO ] [Real]Absence check using 11 positive place invariants in 37 ms returned sat
[2020-05-20 23:57:34] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:35] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2020-05-20 23:57:35] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-05-20 23:57:35] [INFO ] [Real]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-05-20 23:57:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:57:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 29 ms returned sat
[2020-05-20 23:57:35] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-05-20 23:57:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:35] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2020-05-20 23:57:35] [INFO ] [Nat]Added 66 Read/Feed constraints in 30 ms returned sat
[2020-05-20 23:57:36] [INFO ] Deduced a trap composed of 20 places in 594 ms
[2020-05-20 23:57:36] [INFO ] Deduced a trap composed of 49 places in 148 ms
[2020-05-20 23:57:36] [INFO ] Deduced a trap composed of 16 places in 180 ms
[2020-05-20 23:57:36] [INFO ] Deduced a trap composed of 84 places in 137 ms
[2020-05-20 23:57:36] [INFO ] Deduced a trap composed of 57 places in 80 ms
[2020-05-20 23:57:37] [INFO ] Deduced a trap composed of 56 places in 96 ms
[2020-05-20 23:57:37] [INFO ] Deduced a trap composed of 51 places in 119 ms
[2020-05-20 23:57:37] [INFO ] Deduced a trap composed of 57 places in 126 ms
[2020-05-20 23:57:37] [INFO ] Deduced a trap composed of 55 places in 68 ms
[2020-05-20 23:57:37] [INFO ] Deduced a trap composed of 9 places in 50 ms
[2020-05-20 23:57:37] [INFO ] Deduced a trap composed of 9 places in 98 ms
[2020-05-20 23:57:37] [INFO ] Deduced a trap composed of 51 places in 164 ms
[2020-05-20 23:57:37] [INFO ] Deduced a trap composed of 26 places in 87 ms
[2020-05-20 23:57:38] [INFO ] Deduced a trap composed of 38 places in 109 ms
[2020-05-20 23:57:38] [INFO ] Deduced a trap composed of 32 places in 70 ms
[2020-05-20 23:57:38] [INFO ] Deduced a trap composed of 38 places in 58 ms
[2020-05-20 23:57:38] [INFO ] Deduced a trap composed of 46 places in 135 ms
[2020-05-20 23:57:38] [INFO ] Deduced a trap composed of 43 places in 160 ms
[2020-05-20 23:57:38] [INFO ] Deduced a trap composed of 37 places in 94 ms
[2020-05-20 23:57:38] [INFO ] Deduced a trap composed of 34 places in 63 ms
[2020-05-20 23:57:39] [INFO ] Deduced a trap composed of 39 places in 296 ms
[2020-05-20 23:57:39] [INFO ] Deduced a trap composed of 31 places in 68 ms
[2020-05-20 23:57:39] [INFO ] Deduced a trap composed of 51 places in 67 ms
[2020-05-20 23:57:39] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3761 ms
[2020-05-20 23:57:39] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 18 ms.
[2020-05-20 23:57:41] [INFO ] Added : 279 causal constraints over 56 iterations in 1869 ms. Result :sat
[2020-05-20 23:57:41] [INFO ] [Real]Absence check using 11 positive place invariants in 40 ms returned sat
[2020-05-20 23:57:41] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:42] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2020-05-20 23:57:42] [INFO ] [Real]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-20 23:57:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:57:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-20 23:57:42] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:57:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:42] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2020-05-20 23:57:42] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-05-20 23:57:42] [INFO ] Deduced a trap composed of 33 places in 55 ms
[2020-05-20 23:57:42] [INFO ] Deduced a trap composed of 35 places in 54 ms
[2020-05-20 23:57:42] [INFO ] Deduced a trap composed of 16 places in 68 ms
[2020-05-20 23:57:42] [INFO ] Deduced a trap composed of 17 places in 64 ms
[2020-05-20 23:57:42] [INFO ] Deduced a trap composed of 9 places in 65 ms
[2020-05-20 23:57:43] [INFO ] Deduced a trap composed of 36 places in 61 ms
[2020-05-20 23:57:43] [INFO ] Deduced a trap composed of 30 places in 456 ms
[2020-05-20 23:57:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 929 ms
[2020-05-20 23:57:43] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 20 ms.
[2020-05-20 23:57:45] [INFO ] Added : 304 causal constraints over 61 iterations in 1461 ms. Result :sat
[2020-05-20 23:57:45] [INFO ] Deduced a trap composed of 50 places in 93 ms
[2020-05-20 23:57:45] [INFO ] Deduced a trap composed of 54 places in 160 ms
[2020-05-20 23:57:45] [INFO ] Deduced a trap composed of 37 places in 126 ms
[2020-05-20 23:57:45] [INFO ] Deduced a trap composed of 31 places in 257 ms
[2020-05-20 23:57:45] [INFO ] Deduced a trap composed of 56 places in 105 ms
[2020-05-20 23:57:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 943 ms
[2020-05-20 23:57:46] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-20 23:57:46] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:57:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:46] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2020-05-20 23:57:46] [INFO ] [Real]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-05-20 23:57:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:57:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-20 23:57:46] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 8 ms returned sat
[2020-05-20 23:57:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:46] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2020-05-20 23:57:46] [INFO ] [Nat]Added 66 Read/Feed constraints in 20 ms returned sat
[2020-05-20 23:57:46] [INFO ] Deduced a trap composed of 36 places in 73 ms
[2020-05-20 23:57:46] [INFO ] Deduced a trap composed of 35 places in 60 ms
[2020-05-20 23:57:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2020-05-20 23:57:46] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 16 ms.
[2020-05-20 23:57:48] [INFO ] Added : 304 causal constraints over 61 iterations in 1361 ms. Result :sat
[2020-05-20 23:57:48] [INFO ] Deduced a trap composed of 53 places in 112 ms
[2020-05-20 23:57:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2020-05-20 23:57:48] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-20 23:57:48] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:57:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:48] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2020-05-20 23:57:48] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-05-20 23:57:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:57:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 27 ms returned sat
[2020-05-20 23:57:48] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:57:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:49] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2020-05-20 23:57:49] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-05-20 23:57:49] [INFO ] Deduced a trap composed of 33 places in 72 ms
[2020-05-20 23:57:49] [INFO ] Deduced a trap composed of 35 places in 73 ms
[2020-05-20 23:57:49] [INFO ] Deduced a trap composed of 16 places in 142 ms
[2020-05-20 23:57:49] [INFO ] Deduced a trap composed of 17 places in 82 ms
[2020-05-20 23:57:49] [INFO ] Deduced a trap composed of 9 places in 106 ms
[2020-05-20 23:57:49] [INFO ] Deduced a trap composed of 34 places in 64 ms
[2020-05-20 23:57:49] [INFO ] Deduced a trap composed of 44 places in 50 ms
[2020-05-20 23:57:49] [INFO ] Deduced a trap composed of 45 places in 60 ms
[2020-05-20 23:57:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 791 ms
[2020-05-20 23:57:49] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 39 ms.
[2020-05-20 23:57:51] [INFO ] Added : 304 causal constraints over 61 iterations in 1695 ms. Result :sat
[2020-05-20 23:57:51] [INFO ] Deduced a trap composed of 53 places in 83 ms
[2020-05-20 23:57:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2020-05-20 23:57:51] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-20 23:57:51] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:51] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2020-05-20 23:57:52] [INFO ] [Real]Added 66 Read/Feed constraints in 29 ms returned sat
[2020-05-20 23:57:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:57:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 40 ms returned sat
[2020-05-20 23:57:52] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:57:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:52] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2020-05-20 23:57:52] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-05-20 23:57:52] [INFO ] Deduced a trap composed of 16 places in 60 ms
[2020-05-20 23:57:52] [INFO ] Deduced a trap composed of 9 places in 100 ms
[2020-05-20 23:57:52] [INFO ] Deduced a trap composed of 17 places in 94 ms
[2020-05-20 23:57:52] [INFO ] Deduced a trap composed of 27 places in 109 ms
[2020-05-20 23:57:52] [INFO ] Deduced a trap composed of 27 places in 91 ms
[2020-05-20 23:57:53] [INFO ] Deduced a trap composed of 27 places in 108 ms
[2020-05-20 23:57:53] [INFO ] Deduced a trap composed of 45 places in 84 ms
[2020-05-20 23:57:53] [INFO ] Deduced a trap composed of 45 places in 54 ms
[2020-05-20 23:57:53] [INFO ] Deduced a trap composed of 45 places in 67 ms
[2020-05-20 23:57:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 931 ms
[2020-05-20 23:57:53] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 16 ms.
[2020-05-20 23:57:55] [INFO ] Added : 304 causal constraints over 61 iterations in 1785 ms. Result :sat
[2020-05-20 23:57:55] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-20 23:57:55] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:55] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2020-05-20 23:57:55] [INFO ] [Real]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-05-20 23:57:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:57:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-05-20 23:57:55] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:57:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:55] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2020-05-20 23:57:55] [INFO ] [Nat]Added 66 Read/Feed constraints in 24 ms returned sat
[2020-05-20 23:57:55] [INFO ] Deduced a trap composed of 16 places in 53 ms
[2020-05-20 23:57:56] [INFO ] Deduced a trap composed of 9 places in 80 ms
[2020-05-20 23:57:56] [INFO ] Deduced a trap composed of 34 places in 67 ms
[2020-05-20 23:57:56] [INFO ] Deduced a trap composed of 17 places in 78 ms
[2020-05-20 23:57:56] [INFO ] Deduced a trap composed of 35 places in 58 ms
[2020-05-20 23:57:56] [INFO ] Deduced a trap composed of 27 places in 35 ms
[2020-05-20 23:57:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 483 ms
[2020-05-20 23:57:56] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-05-20 23:57:57] [INFO ] Added : 265 causal constraints over 53 iterations in 1266 ms. Result :sat
[2020-05-20 23:57:57] [INFO ] Deduced a trap composed of 14 places in 137 ms
[2020-05-20 23:57:57] [INFO ] Deduced a trap composed of 16 places in 72 ms
[2020-05-20 23:57:58] [INFO ] Deduced a trap composed of 42 places in 67 ms
[2020-05-20 23:57:58] [INFO ] Deduced a trap composed of 37 places in 62 ms
[2020-05-20 23:57:58] [INFO ] Deduced a trap composed of 42 places in 107 ms
[2020-05-20 23:57:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 628 ms
[2020-05-20 23:57:58] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-20 23:57:58] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:57:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:58] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2020-05-20 23:57:58] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-05-20 23:57:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:57:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-20 23:57:58] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:57:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:58] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2020-05-20 23:57:58] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-20 23:57:59] [INFO ] Deduced a trap composed of 56 places in 106 ms
[2020-05-20 23:57:59] [INFO ] Deduced a trap composed of 16 places in 68 ms
[2020-05-20 23:57:59] [INFO ] Deduced a trap composed of 51 places in 65 ms
[2020-05-20 23:57:59] [INFO ] Deduced a trap composed of 38 places in 105 ms
[2020-05-20 23:57:59] [INFO ] Deduced a trap composed of 13 places in 91 ms
[2020-05-20 23:57:59] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2020-05-20 23:57:59] [INFO ] Deduced a trap composed of 34 places in 208 ms
[2020-05-20 23:57:59] [INFO ] Deduced a trap composed of 39 places in 55 ms
[2020-05-20 23:57:59] [INFO ] Deduced a trap composed of 56 places in 89 ms
[2020-05-20 23:58:00] [INFO ] Deduced a trap composed of 47 places in 71 ms
[2020-05-20 23:58:00] [INFO ] Deduced a trap composed of 16 places in 71 ms
[2020-05-20 23:58:00] [INFO ] Deduced a trap composed of 53 places in 80 ms
[2020-05-20 23:58:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1283 ms
[2020-05-20 23:58:00] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 18 ms.
[2020-05-20 23:58:01] [INFO ] Added : 304 causal constraints over 61 iterations in 1573 ms. Result :sat
[2020-05-20 23:58:01] [INFO ] Deduced a trap composed of 37 places in 63 ms
[2020-05-20 23:58:01] [INFO ] Deduced a trap composed of 53 places in 66 ms
[2020-05-20 23:58:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2020-05-20 23:58:02] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-20 23:58:02] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-20 23:58:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:02] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2020-05-20 23:58:02] [INFO ] [Real]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-05-20 23:58:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-05-20 23:58:02] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2020-05-20 23:58:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:02] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2020-05-20 23:58:02] [INFO ] [Nat]Added 66 Read/Feed constraints in 17 ms returned sat
[2020-05-20 23:58:02] [INFO ] Deduced a trap composed of 59 places in 122 ms
[2020-05-20 23:58:03] [INFO ] Deduced a trap composed of 52 places in 124 ms
[2020-05-20 23:58:03] [INFO ] Deduced a trap composed of 38 places in 96 ms
[2020-05-20 23:58:03] [INFO ] Deduced a trap composed of 56 places in 80 ms
[2020-05-20 23:58:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 490 ms
[2020-05-20 23:58:03] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2020-05-20 23:58:04] [INFO ] Added : 277 causal constraints over 56 iterations in 1301 ms. Result :sat
[2020-05-20 23:58:04] [INFO ] Deduced a trap composed of 14 places in 133 ms
[2020-05-20 23:58:04] [INFO ] Deduced a trap composed of 17 places in 88 ms
[2020-05-20 23:58:04] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2020-05-20 23:58:05] [INFO ] Deduced a trap composed of 38 places in 45 ms
[2020-05-20 23:58:05] [INFO ] Deduced a trap composed of 39 places in 60 ms
[2020-05-20 23:58:05] [INFO ] Deduced a trap composed of 17 places in 104 ms
[2020-05-20 23:58:05] [INFO ] Deduced a trap composed of 12 places in 118 ms
[2020-05-20 23:58:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 868 ms
[2020-05-20 23:58:05] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-20 23:58:05] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:58:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:05] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2020-05-20 23:58:05] [INFO ] [Real]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-05-20 23:58:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-20 23:58:05] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-05-20 23:58:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:06] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2020-05-20 23:58:06] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-05-20 23:58:06] [INFO ] Deduced a trap composed of 59 places in 96 ms
[2020-05-20 23:58:06] [INFO ] Deduced a trap composed of 52 places in 93 ms
[2020-05-20 23:58:06] [INFO ] Deduced a trap composed of 38 places in 95 ms
[2020-05-20 23:58:06] [INFO ] Deduced a trap composed of 56 places in 133 ms
[2020-05-20 23:58:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 487 ms
[2020-05-20 23:58:06] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 24 ms.
[2020-05-20 23:58:08] [INFO ] Added : 277 causal constraints over 56 iterations in 1687 ms. Result :sat
[2020-05-20 23:58:08] [INFO ] Deduced a trap composed of 9 places in 92 ms
[2020-05-20 23:58:08] [INFO ] Deduced a trap composed of 16 places in 109 ms
[2020-05-20 23:58:08] [INFO ] Deduced a trap composed of 29 places in 114 ms
[2020-05-20 23:58:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 444 ms
[2020-05-20 23:58:08] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-20 23:58:08] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 12 ms returned sat
[2020-05-20 23:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:09] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2020-05-20 23:58:09] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-05-20 23:58:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-20 23:58:09] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:58:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:09] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2020-05-20 23:58:09] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-05-20 23:58:09] [INFO ] Deduced a trap composed of 13 places in 70 ms
[2020-05-20 23:58:09] [INFO ] Deduced a trap composed of 17 places in 64 ms
[2020-05-20 23:58:09] [INFO ] Deduced a trap composed of 18 places in 67 ms
[2020-05-20 23:58:09] [INFO ] Deduced a trap composed of 31 places in 81 ms
[2020-05-20 23:58:09] [INFO ] Deduced a trap composed of 31 places in 84 ms
[2020-05-20 23:58:09] [INFO ] Deduced a trap composed of 56 places in 66 ms
[2020-05-20 23:58:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 550 ms
[2020-05-20 23:58:09] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-05-20 23:58:11] [INFO ] Added : 302 causal constraints over 61 iterations in 1553 ms. Result :sat
[2020-05-20 23:58:11] [INFO ] Deduced a trap composed of 30 places in 78 ms
[2020-05-20 23:58:11] [INFO ] Deduced a trap composed of 49 places in 99 ms
[2020-05-20 23:58:11] [INFO ] Deduced a trap composed of 27 places in 69 ms
[2020-05-20 23:58:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 361 ms
[2020-05-20 23:58:11] [INFO ] [Real]Absence check using 11 positive place invariants in 26 ms returned sat
[2020-05-20 23:58:11] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-05-20 23:58:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:12] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2020-05-20 23:58:12] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-05-20 23:58:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-20 23:58:12] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-05-20 23:58:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:12] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2020-05-20 23:58:12] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-05-20 23:58:12] [INFO ] Deduced a trap composed of 17 places in 74 ms
[2020-05-20 23:58:12] [INFO ] Deduced a trap composed of 13 places in 63 ms
[2020-05-20 23:58:12] [INFO ] Deduced a trap composed of 18 places in 73 ms
[2020-05-20 23:58:12] [INFO ] Deduced a trap composed of 37 places in 87 ms
[2020-05-20 23:58:12] [INFO ] Deduced a trap composed of 34 places in 56 ms
[2020-05-20 23:58:13] [INFO ] Deduced a trap composed of 54 places in 75 ms
[2020-05-20 23:58:13] [INFO ] Deduced a trap composed of 51 places in 116 ms
[2020-05-20 23:58:13] [INFO ] Deduced a trap composed of 16 places in 114 ms
[2020-05-20 23:58:13] [INFO ] Deduced a trap composed of 31 places in 90 ms
[2020-05-20 23:58:13] [INFO ] Deduced a trap composed of 16 places in 76 ms
[2020-05-20 23:58:13] [INFO ] Deduced a trap composed of 53 places in 71 ms
[2020-05-20 23:58:13] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1085 ms
[2020-05-20 23:58:13] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-05-20 23:58:14] [INFO ] Added : 272 causal constraints over 55 iterations in 1361 ms. Result :sat
[2020-05-20 23:58:15] [INFO ] Deduced a trap composed of 43 places in 107 ms
[2020-05-20 23:58:15] [INFO ] Deduced a trap composed of 34 places in 173 ms
[2020-05-20 23:58:15] [INFO ] Deduced a trap composed of 31 places in 80 ms
[2020-05-20 23:58:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 466 ms
[2020-05-20 23:58:15] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-05-20 23:58:15] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:15] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2020-05-20 23:58:15] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-05-20 23:58:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-20 23:58:15] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:16] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2020-05-20 23:58:16] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-05-20 23:58:16] [INFO ] Deduced a trap composed of 35 places in 58 ms
[2020-05-20 23:58:16] [INFO ] Deduced a trap composed of 17 places in 71 ms
[2020-05-20 23:58:16] [INFO ] Deduced a trap composed of 18 places in 56 ms
[2020-05-20 23:58:16] [INFO ] Deduced a trap composed of 38 places in 64 ms
[2020-05-20 23:58:16] [INFO ] Deduced a trap composed of 37 places in 79 ms
[2020-05-20 23:58:16] [INFO ] Deduced a trap composed of 34 places in 67 ms
[2020-05-20 23:58:16] [INFO ] Deduced a trap composed of 38 places in 58 ms
[2020-05-20 23:58:16] [INFO ] Deduced a trap composed of 31 places in 63 ms
[2020-05-20 23:58:16] [INFO ] Deduced a trap composed of 53 places in 108 ms
[2020-05-20 23:58:16] [INFO ] Deduced a trap composed of 31 places in 53 ms
[2020-05-20 23:58:17] [INFO ] Deduced a trap composed of 49 places in 94 ms
[2020-05-20 23:58:17] [INFO ] Deduced a trap composed of 52 places in 100 ms
[2020-05-20 23:58:17] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1096 ms
[2020-05-20 23:58:17] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 18 ms.
[2020-05-20 23:58:18] [INFO ] Added : 304 causal constraints over 61 iterations in 1394 ms. Result :sat
[2020-05-20 23:58:18] [INFO ] Deduced a trap composed of 12 places in 100 ms
[2020-05-20 23:58:18] [INFO ] Deduced a trap composed of 37 places in 88 ms
[2020-05-20 23:58:18] [INFO ] Deduced a trap composed of 20 places in 71 ms
[2020-05-20 23:58:19] [INFO ] Deduced a trap composed of 53 places in 88 ms
[2020-05-20 23:58:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 467 ms
[2020-05-20 23:58:19] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-20 23:58:19] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 18 ms returned sat
[2020-05-20 23:58:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:19] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2020-05-20 23:58:19] [INFO ] [Real]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-20 23:58:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 26 ms returned sat
[2020-05-20 23:58:19] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:58:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:19] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2020-05-20 23:58:19] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-20 23:58:19] [INFO ] Deduced a trap composed of 35 places in 73 ms
[2020-05-20 23:58:19] [INFO ] Deduced a trap composed of 17 places in 59 ms
[2020-05-20 23:58:20] [INFO ] Deduced a trap composed of 18 places in 75 ms
[2020-05-20 23:58:20] [INFO ] Deduced a trap composed of 38 places in 54 ms
[2020-05-20 23:58:20] [INFO ] Deduced a trap composed of 37 places in 61 ms
[2020-05-20 23:58:20] [INFO ] Deduced a trap composed of 34 places in 46 ms
[2020-05-20 23:58:20] [INFO ] Deduced a trap composed of 38 places in 47 ms
[2020-05-20 23:58:20] [INFO ] Deduced a trap composed of 31 places in 45 ms
[2020-05-20 23:58:20] [INFO ] Deduced a trap composed of 53 places in 99 ms
[2020-05-20 23:58:20] [INFO ] Deduced a trap composed of 31 places in 57 ms
[2020-05-20 23:58:20] [INFO ] Deduced a trap composed of 49 places in 87 ms
[2020-05-20 23:58:20] [INFO ] Deduced a trap composed of 49 places in 73 ms
[2020-05-20 23:58:20] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 957 ms
[2020-05-20 23:58:20] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-05-20 23:58:22] [INFO ] Added : 304 causal constraints over 61 iterations in 1424 ms. Result :sat
[2020-05-20 23:58:22] [INFO ] Deduced a trap composed of 30 places in 82 ms
[2020-05-20 23:58:22] [INFO ] Deduced a trap composed of 12 places in 75 ms
[2020-05-20 23:58:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2020-05-20 23:58:22] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-20 23:58:22] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:58:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:22] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2020-05-20 23:58:22] [INFO ] [Real]Added 66 Read/Feed constraints in 7 ms returned sat
[2020-05-20 23:58:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-05-20 23:58:22] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:58:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:23] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2020-05-20 23:58:23] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-05-20 23:58:23] [INFO ] Deduced a trap composed of 38 places in 108 ms
[2020-05-20 23:58:23] [INFO ] Deduced a trap composed of 38 places in 196 ms
[2020-05-20 23:58:23] [INFO ] Deduced a trap composed of 56 places in 94 ms
[2020-05-20 23:58:23] [INFO ] Deduced a trap composed of 56 places in 76 ms
[2020-05-20 23:58:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 566 ms
[2020-05-20 23:58:23] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-05-20 23:58:24] [INFO ] Added : 219 causal constraints over 44 iterations in 985 ms. Result :sat
[2020-05-20 23:58:24] [INFO ] Deduced a trap composed of 54 places in 81 ms
[2020-05-20 23:58:24] [INFO ] Deduced a trap composed of 17 places in 91 ms
[2020-05-20 23:58:24] [INFO ] Deduced a trap composed of 31 places in 95 ms
[2020-05-20 23:58:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 379 ms
[2020-05-20 23:58:25] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-20 23:58:25] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:58:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:25] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2020-05-20 23:58:25] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2020-05-20 23:58:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-20 23:58:25] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:58:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:25] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2020-05-20 23:58:25] [INFO ] [Nat]Added 66 Read/Feed constraints in 21 ms returned sat
[2020-05-20 23:58:25] [INFO ] Deduced a trap composed of 38 places in 102 ms
[2020-05-20 23:58:25] [INFO ] Deduced a trap composed of 38 places in 102 ms
[2020-05-20 23:58:25] [INFO ] Deduced a trap composed of 56 places in 89 ms
[2020-05-20 23:58:26] [INFO ] Deduced a trap composed of 56 places in 105 ms
[2020-05-20 23:58:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 459 ms
[2020-05-20 23:58:26] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 13 ms.
[2020-05-20 23:58:27] [INFO ] Added : 219 causal constraints over 44 iterations in 1110 ms. Result :sat
[2020-05-20 23:58:27] [INFO ] Deduced a trap composed of 16 places in 92 ms
[2020-05-20 23:58:27] [INFO ] Deduced a trap composed of 77 places in 137 ms
[2020-05-20 23:58:27] [INFO ] Deduced a trap composed of 56 places in 66 ms
[2020-05-20 23:58:27] [INFO ] Deduced a trap composed of 80 places in 105 ms
[2020-05-20 23:58:27] [INFO ] Deduced a trap composed of 54 places in 92 ms
[2020-05-20 23:58:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 682 ms
[2020-05-20 23:58:27] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-20 23:58:27] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 9 ms returned sat
[2020-05-20 23:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:28] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-05-20 23:58:28] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-05-20 23:58:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-05-20 23:58:28] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:58:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:28] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2020-05-20 23:58:28] [INFO ] [Nat]Added 66 Read/Feed constraints in 25 ms returned sat
[2020-05-20 23:58:28] [INFO ] Deduced a trap composed of 38 places in 87 ms
[2020-05-20 23:58:28] [INFO ] Deduced a trap composed of 38 places in 75 ms
[2020-05-20 23:58:28] [INFO ] Deduced a trap composed of 56 places in 102 ms
[2020-05-20 23:58:28] [INFO ] Deduced a trap composed of 56 places in 101 ms
[2020-05-20 23:58:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 431 ms
[2020-05-20 23:58:28] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-05-20 23:58:29] [INFO ] Added : 219 causal constraints over 44 iterations in 1000 ms. Result :sat
[2020-05-20 23:58:30] [INFO ] Deduced a trap composed of 16 places in 88 ms
[2020-05-20 23:58:30] [INFO ] Deduced a trap composed of 31 places in 101 ms
[2020-05-20 23:58:30] [INFO ] Deduced a trap composed of 56 places in 104 ms
[2020-05-20 23:58:30] [INFO ] Deduced a trap composed of 39 places in 61 ms
[2020-05-20 23:58:30] [INFO ] Deduced a trap composed of 29 places in 89 ms
[2020-05-20 23:58:30] [INFO ] Deduced a trap composed of 9 places in 79 ms
[2020-05-20 23:58:30] [INFO ] Deduced a trap composed of 9 places in 57 ms
[2020-05-20 23:58:30] [INFO ] Deduced a trap composed of 9 places in 74 ms
[2020-05-20 23:58:31] [INFO ] Deduced a trap composed of 14 places in 86 ms
[2020-05-20 23:58:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1156 ms
[2020-05-20 23:58:31] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-20 23:58:31] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:31] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2020-05-20 23:58:31] [INFO ] [Real]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-05-20 23:58:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-20 23:58:31] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:58:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:31] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2020-05-20 23:58:31] [INFO ] [Nat]Added 66 Read/Feed constraints in 26 ms returned sat
[2020-05-20 23:58:31] [INFO ] Deduced a trap composed of 38 places in 113 ms
[2020-05-20 23:58:32] [INFO ] Deduced a trap composed of 20 places in 84 ms
[2020-05-20 23:58:32] [INFO ] Deduced a trap composed of 38 places in 88 ms
[2020-05-20 23:58:32] [INFO ] Deduced a trap composed of 62 places in 82 ms
[2020-05-20 23:58:32] [INFO ] Deduced a trap composed of 59 places in 77 ms
[2020-05-20 23:58:32] [INFO ] Deduced a trap composed of 19 places in 31 ms
[2020-05-20 23:58:32] [INFO ] Deduced a trap composed of 20 places in 83 ms
[2020-05-20 23:58:32] [INFO ] Deduced a trap composed of 57 places in 93 ms
[2020-05-20 23:58:32] [INFO ] Deduced a trap composed of 57 places in 63 ms
[2020-05-20 23:58:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 865 ms
[2020-05-20 23:58:32] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-05-20 23:58:34] [INFO ] Added : 303 causal constraints over 61 iterations in 1833 ms. Result :sat
[2020-05-20 23:58:34] [INFO ] Deduced a trap composed of 21 places in 136 ms
[2020-05-20 23:58:34] [INFO ] Deduced a trap composed of 36 places in 100 ms
[2020-05-20 23:58:34] [INFO ] Deduced a trap composed of 27 places in 93 ms
[2020-05-20 23:58:35] [INFO ] Deduced a trap composed of 34 places in 87 ms
[2020-05-20 23:58:35] [INFO ] Deduced a trap composed of 66 places in 86 ms
[2020-05-20 23:58:35] [INFO ] Deduced a trap composed of 35 places in 90 ms
[2020-05-20 23:58:35] [INFO ] Deduced a trap composed of 47 places in 86 ms
[2020-05-20 23:58:35] [INFO ] Deduced a trap composed of 47 places in 102 ms
[2020-05-20 23:58:35] [INFO ] Deduced a trap composed of 46 places in 85 ms
[2020-05-20 23:58:35] [INFO ] Deduced a trap composed of 27 places in 135 ms
[2020-05-20 23:58:35] [INFO ] Deduced a trap composed of 47 places in 80 ms
[2020-05-20 23:58:36] [INFO ] Deduced a trap composed of 50 places in 92 ms
[2020-05-20 23:58:36] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1614 ms
[2020-05-20 23:58:36] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-20 23:58:36] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:58:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:36] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2020-05-20 23:58:36] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-05-20 23:58:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-05-20 23:58:36] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:58:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:36] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2020-05-20 23:58:36] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-20 23:58:36] [INFO ] Deduced a trap composed of 38 places in 88 ms
[2020-05-20 23:58:36] [INFO ] Deduced a trap composed of 20 places in 81 ms
[2020-05-20 23:58:37] [INFO ] Deduced a trap composed of 38 places in 95 ms
[2020-05-20 23:58:37] [INFO ] Deduced a trap composed of 62 places in 79 ms
[2020-05-20 23:58:37] [INFO ] Deduced a trap composed of 59 places in 80 ms
[2020-05-20 23:58:37] [INFO ] Deduced a trap composed of 19 places in 32 ms
[2020-05-20 23:58:37] [INFO ] Deduced a trap composed of 20 places in 86 ms
[2020-05-20 23:58:37] [INFO ] Deduced a trap composed of 57 places in 71 ms
[2020-05-20 23:58:37] [INFO ] Deduced a trap composed of 57 places in 55 ms
[2020-05-20 23:58:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 797 ms
[2020-05-20 23:58:37] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2020-05-20 23:58:38] [INFO ] Added : 303 causal constraints over 61 iterations in 1262 ms. Result :sat
[2020-05-20 23:58:38] [INFO ] Deduced a trap composed of 21 places in 104 ms
[2020-05-20 23:58:39] [INFO ] Deduced a trap composed of 34 places in 87 ms
[2020-05-20 23:58:39] [INFO ] Deduced a trap composed of 27 places in 95 ms
[2020-05-20 23:58:39] [INFO ] Deduced a trap composed of 78 places in 85 ms
[2020-05-20 23:58:39] [INFO ] Deduced a trap composed of 35 places in 94 ms
[2020-05-20 23:58:39] [INFO ] Deduced a trap composed of 47 places in 97 ms
[2020-05-20 23:58:39] [INFO ] Deduced a trap composed of 34 places in 115 ms
[2020-05-20 23:58:39] [INFO ] Deduced a trap composed of 47 places in 86 ms
[2020-05-20 23:58:40] [INFO ] Deduced a trap composed of 18 places in 156 ms
[2020-05-20 23:58:40] [INFO ] Deduced a trap composed of 9 places in 101 ms
[2020-05-20 23:58:40] [INFO ] Deduced a trap composed of 47 places in 81 ms
[2020-05-20 23:58:40] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1562 ms
[2020-05-20 23:58:40] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-05-20 23:58:40] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:58:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:40] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2020-05-20 23:58:40] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-05-20 23:58:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-05-20 23:58:40] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-05-20 23:58:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:41] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2020-05-20 23:58:41] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-20 23:58:41] [INFO ] Deduced a trap composed of 34 places in 111 ms
[2020-05-20 23:58:41] [INFO ] Deduced a trap composed of 20 places in 90 ms
[2020-05-20 23:58:41] [INFO ] Deduced a trap composed of 62 places in 79 ms
[2020-05-20 23:58:41] [INFO ] Deduced a trap composed of 59 places in 92 ms
[2020-05-20 23:58:41] [INFO ] Deduced a trap composed of 19 places in 33 ms
[2020-05-20 23:58:41] [INFO ] Deduced a trap composed of 20 places in 80 ms
[2020-05-20 23:58:41] [INFO ] Deduced a trap composed of 57 places in 80 ms
[2020-05-20 23:58:41] [INFO ] Deduced a trap composed of 57 places in 53 ms
[2020-05-20 23:58:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 739 ms
[2020-05-20 23:58:41] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 12 ms.
[2020-05-20 23:58:43] [INFO ] Added : 271 causal constraints over 55 iterations in 1452 ms. Result :sat
[2020-05-20 23:58:43] [INFO ] Deduced a trap composed of 38 places in 103 ms
[2020-05-20 23:58:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2020-05-20 23:58:43] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-20 23:58:43] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-05-20 23:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:43] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2020-05-20 23:58:43] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-05-20 23:58:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-20 23:58:43] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:58:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:44] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2020-05-20 23:58:44] [INFO ] [Nat]Added 66 Read/Feed constraints in 27 ms returned sat
[2020-05-20 23:58:44] [INFO ] Deduced a trap composed of 95 places in 113 ms
[2020-05-20 23:58:44] [INFO ] Deduced a trap composed of 20 places in 94 ms
[2020-05-20 23:58:44] [INFO ] Deduced a trap composed of 62 places in 94 ms
[2020-05-20 23:58:44] [INFO ] Deduced a trap composed of 66 places in 88 ms
[2020-05-20 23:58:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 447 ms
[2020-05-20 23:58:44] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 12 ms.
[2020-05-20 23:58:45] [INFO ] Added : 304 causal constraints over 61 iterations in 1385 ms. Result :sat
[2020-05-20 23:58:46] [INFO ] Deduced a trap composed of 21 places in 66 ms
[2020-05-20 23:58:46] [INFO ] Deduced a trap composed of 9 places in 83 ms
[2020-05-20 23:58:46] [INFO ] Deduced a trap composed of 46 places in 57 ms
[2020-05-20 23:58:46] [INFO ] Deduced a trap composed of 20 places in 43 ms
[2020-05-20 23:58:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 373 ms
[2020-05-20 23:58:46] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-20 23:58:46] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2020-05-20 23:58:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:46] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2020-05-20 23:58:46] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-05-20 23:58:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 22 ms returned sat
[2020-05-20 23:58:46] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2020-05-20 23:58:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:46] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2020-05-20 23:58:46] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-20 23:58:47] [INFO ] Deduced a trap composed of 92 places in 88 ms
[2020-05-20 23:58:47] [INFO ] Deduced a trap composed of 62 places in 98 ms
[2020-05-20 23:58:47] [INFO ] Deduced a trap composed of 22 places in 106 ms
[2020-05-20 23:58:47] [INFO ] Deduced a trap composed of 52 places in 96 ms
[2020-05-20 23:58:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 453 ms
[2020-05-20 23:58:47] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-05-20 23:58:48] [INFO ] Added : 301 causal constraints over 61 iterations in 1323 ms. Result :sat
[2020-05-20 23:58:48] [INFO ] Deduced a trap composed of 9 places in 73 ms
[2020-05-20 23:58:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2020-05-20 23:58:48] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-20 23:58:48] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:58:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:49] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2020-05-20 23:58:49] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2020-05-20 23:58:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-05-20 23:58:49] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-05-20 23:58:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:49] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2020-05-20 23:58:49] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-20 23:58:49] [INFO ] Deduced a trap composed of 41 places in 62 ms
[2020-05-20 23:58:49] [INFO ] Deduced a trap composed of 38 places in 67 ms
[2020-05-20 23:58:49] [INFO ] Deduced a trap composed of 35 places in 63 ms
[2020-05-20 23:58:49] [INFO ] Deduced a trap composed of 56 places in 74 ms
[2020-05-20 23:58:49] [INFO ] Deduced a trap composed of 20 places in 69 ms
[2020-05-20 23:58:49] [INFO ] Deduced a trap composed of 19 places in 32 ms
[2020-05-20 23:58:50] [INFO ] Deduced a trap composed of 20 places in 93 ms
[2020-05-20 23:58:50] [INFO ] Deduced a trap composed of 34 places in 51 ms
[2020-05-20 23:58:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 646 ms
[2020-05-20 23:58:50] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-05-20 23:58:51] [INFO ] Added : 304 causal constraints over 61 iterations in 1220 ms. Result :sat
[2020-05-20 23:58:51] [INFO ] Deduced a trap composed of 21 places in 67 ms
[2020-05-20 23:58:51] [INFO ] Deduced a trap composed of 36 places in 68 ms
[2020-05-20 23:58:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2020-05-20 23:58:51] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-20 23:58:51] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:58:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:51] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2020-05-20 23:58:51] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-05-20 23:58:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-05-20 23:58:51] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:58:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:52] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2020-05-20 23:58:52] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-05-20 23:58:52] [INFO ] Deduced a trap composed of 41 places in 68 ms
[2020-05-20 23:58:52] [INFO ] Deduced a trap composed of 38 places in 69 ms
[2020-05-20 23:58:52] [INFO ] Deduced a trap composed of 35 places in 67 ms
[2020-05-20 23:58:52] [INFO ] Deduced a trap composed of 56 places in 78 ms
[2020-05-20 23:58:52] [INFO ] Deduced a trap composed of 20 places in 75 ms
[2020-05-20 23:58:52] [INFO ] Deduced a trap composed of 19 places in 27 ms
[2020-05-20 23:58:52] [INFO ] Deduced a trap composed of 20 places in 108 ms
[2020-05-20 23:58:52] [INFO ] Deduced a trap composed of 34 places in 56 ms
[2020-05-20 23:58:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 659 ms
[2020-05-20 23:58:52] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-05-20 23:58:54] [INFO ] Added : 304 causal constraints over 61 iterations in 1344 ms. Result :sat
[2020-05-20 23:58:54] [INFO ] Deduced a trap composed of 21 places in 98 ms
[2020-05-20 23:58:54] [INFO ] Deduced a trap composed of 36 places in 52 ms
[2020-05-20 23:58:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2020-05-20 23:58:54] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-20 23:58:54] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:54] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2020-05-20 23:58:54] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-05-20 23:58:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-20 23:58:54] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:54] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2020-05-20 23:58:54] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-05-20 23:58:55] [INFO ] Deduced a trap composed of 20 places in 55 ms
[2020-05-20 23:58:55] [INFO ] Deduced a trap composed of 56 places in 55 ms
[2020-05-20 23:58:55] [INFO ] Deduced a trap composed of 38 places in 56 ms
[2020-05-20 23:58:55] [INFO ] Deduced a trap composed of 20 places in 55 ms
[2020-05-20 23:58:55] [INFO ] Deduced a trap composed of 41 places in 67 ms
[2020-05-20 23:58:55] [INFO ] Deduced a trap composed of 35 places in 55 ms
[2020-05-20 23:58:55] [INFO ] Deduced a trap composed of 38 places in 43 ms
[2020-05-20 23:58:55] [INFO ] Deduced a trap composed of 19 places in 25 ms
[2020-05-20 23:58:55] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 545 ms
[2020-05-20 23:58:55] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 13 ms.
[2020-05-20 23:58:56] [INFO ] Added : 301 causal constraints over 61 iterations in 1470 ms. Result :sat
[2020-05-20 23:58:57] [INFO ] Deduced a trap composed of 51 places in 110 ms
[2020-05-20 23:58:57] [INFO ] Deduced a trap composed of 56 places in 99 ms
[2020-05-20 23:58:57] [INFO ] Deduced a trap composed of 9 places in 101 ms
[2020-05-20 23:58:57] [INFO ] Deduced a trap composed of 27 places in 92 ms
[2020-05-20 23:58:57] [INFO ] Deduced a trap composed of 16 places in 128 ms
[2020-05-20 23:58:57] [INFO ] Deduced a trap composed of 49 places in 106 ms
[2020-05-20 23:58:57] [INFO ] Deduced a trap composed of 59 places in 70 ms
[2020-05-20 23:58:58] [INFO ] Deduced a trap composed of 56 places in 106 ms
[2020-05-20 23:58:58] [INFO ] Deduced a trap composed of 56 places in 50 ms
[2020-05-20 23:58:58] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2020-05-20 23:58:58] [INFO ] Deduced a trap composed of 78 places in 96 ms
[2020-05-20 23:58:58] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1358 ms
[2020-05-20 23:58:58] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-20 23:58:58] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:58:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:58] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2020-05-20 23:58:58] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-05-20 23:58:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 44 ms returned sat
[2020-05-20 23:58:58] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:59] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2020-05-20 23:58:59] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-20 23:58:59] [INFO ] Deduced a trap composed of 20 places in 61 ms
[2020-05-20 23:58:59] [INFO ] Deduced a trap composed of 56 places in 72 ms
[2020-05-20 23:58:59] [INFO ] Deduced a trap composed of 38 places in 70 ms
[2020-05-20 23:58:59] [INFO ] Deduced a trap composed of 20 places in 55 ms
[2020-05-20 23:58:59] [INFO ] Deduced a trap composed of 41 places in 63 ms
[2020-05-20 23:58:59] [INFO ] Deduced a trap composed of 35 places in 54 ms
[2020-05-20 23:58:59] [INFO ] Deduced a trap composed of 38 places in 47 ms
[2020-05-20 23:58:59] [INFO ] Deduced a trap composed of 21 places in 67 ms
[2020-05-20 23:58:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 609 ms
[2020-05-20 23:58:59] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 19 ms.
[2020-05-20 23:59:01] [INFO ] Added : 304 causal constraints over 61 iterations in 1683 ms. Result :sat
[2020-05-20 23:59:01] [INFO ] Deduced a trap composed of 21 places in 86 ms
[2020-05-20 23:59:01] [INFO ] Deduced a trap composed of 34 places in 93 ms
[2020-05-20 23:59:01] [INFO ] Deduced a trap composed of 57 places in 97 ms
[2020-05-20 23:59:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 399 ms
[2020-05-20 23:59:01] [INFO ] [Real]Absence check using 11 positive place invariants in 24 ms returned sat
[2020-05-20 23:59:01] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:02] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2020-05-20 23:59:02] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2020-05-20 23:59:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:59:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-05-20 23:59:02] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:02] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2020-05-20 23:59:02] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-20 23:59:02] [INFO ] Deduced a trap composed of 20 places in 75 ms
[2020-05-20 23:59:02] [INFO ] Deduced a trap composed of 20 places in 82 ms
[2020-05-20 23:59:02] [INFO ] Deduced a trap composed of 40 places in 73 ms
[2020-05-20 23:59:02] [INFO ] Deduced a trap composed of 40 places in 82 ms
[2020-05-20 23:59:02] [INFO ] Deduced a trap composed of 21 places in 86 ms
[2020-05-20 23:59:03] [INFO ] Deduced a trap composed of 35 places in 76 ms
[2020-05-20 23:59:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 560 ms
[2020-05-20 23:59:03] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-05-20 23:59:04] [INFO ] Added : 304 causal constraints over 61 iterations in 1552 ms. Result :sat
[2020-05-20 23:59:04] [INFO ] Deduced a trap composed of 21 places in 106 ms
[2020-05-20 23:59:04] [INFO ] Deduced a trap composed of 34 places in 93 ms
[2020-05-20 23:59:04] [INFO ] Deduced a trap composed of 58 places in 89 ms
[2020-05-20 23:59:05] [INFO ] Deduced a trap composed of 41 places in 63 ms
[2020-05-20 23:59:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 494 ms
[2020-05-20 23:59:05] [INFO ] [Real]Absence check using 11 positive place invariants in 22 ms returned sat
[2020-05-20 23:59:05] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-05-20 23:59:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:05] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2020-05-20 23:59:05] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-05-20 23:59:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:59:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 38 ms returned sat
[2020-05-20 23:59:05] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 12 ms returned sat
[2020-05-20 23:59:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:05] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2020-05-20 23:59:05] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-20 23:59:06] [INFO ] Deduced a trap composed of 93 places in 91 ms
[2020-05-20 23:59:06] [INFO ] Deduced a trap composed of 53 places in 91 ms
[2020-05-20 23:59:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2020-05-20 23:59:06] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 13 ms.
[2020-05-20 23:59:08] [INFO ] Added : 304 causal constraints over 61 iterations in 1955 ms. Result :sat
[2020-05-20 23:59:09] [INFO ] Deduced a trap composed of 16 places in 1484 ms
[2020-05-20 23:59:09] [INFO ] Deduced a trap composed of 17 places in 93 ms
[2020-05-20 23:59:09] [INFO ] Deduced a trap composed of 30 places in 50 ms
[2020-05-20 23:59:09] [INFO ] Deduced a trap composed of 46 places in 64 ms
[2020-05-20 23:59:10] [INFO ] Deduced a trap composed of 27 places in 158 ms
[2020-05-20 23:59:10] [INFO ] Deduced a trap composed of 9 places in 56 ms
[2020-05-20 23:59:10] [INFO ] Deduced a trap composed of 20 places in 55 ms
[2020-05-20 23:59:10] [INFO ] Deduced a trap composed of 12 places in 95 ms
[2020-05-20 23:59:10] [INFO ] Deduced a trap composed of 30 places in 96 ms
[2020-05-20 23:59:10] [INFO ] Deduced a trap composed of 9 places in 118 ms
[2020-05-20 23:59:10] [INFO ] Deduced a trap composed of 27 places in 73 ms
[2020-05-20 23:59:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2747 ms
[2020-05-20 23:59:10] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-20 23:59:10] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:11] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2020-05-20 23:59:11] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2020-05-20 23:59:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:59:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 61 ms returned sat
[2020-05-20 23:59:11] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 16 ms returned sat
[2020-05-20 23:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:11] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2020-05-20 23:59:11] [INFO ] [Nat]Added 66 Read/Feed constraints in 25 ms returned sat
[2020-05-20 23:59:11] [INFO ] Deduced a trap composed of 93 places in 98 ms
[2020-05-20 23:59:11] [INFO ] Deduced a trap composed of 53 places in 94 ms
[2020-05-20 23:59:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2020-05-20 23:59:11] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 13 ms.
[2020-05-20 23:59:13] [INFO ] Added : 304 causal constraints over 61 iterations in 1729 ms. Result :sat
[2020-05-20 23:59:13] [INFO ] Deduced a trap composed of 16 places in 152 ms
[2020-05-20 23:59:13] [INFO ] Deduced a trap composed of 17 places in 102 ms
[2020-05-20 23:59:14] [INFO ] Deduced a trap composed of 42 places in 87 ms
[2020-05-20 23:59:14] [INFO ] Deduced a trap composed of 34 places in 77 ms
[2020-05-20 23:59:14] [INFO ] Deduced a trap composed of 27 places in 84 ms
[2020-05-20 23:59:14] [INFO ] Deduced a trap composed of 9 places in 77 ms
[2020-05-20 23:59:14] [INFO ] Deduced a trap composed of 20 places in 82 ms
[2020-05-20 23:59:14] [INFO ] Deduced a trap composed of 41 places in 74 ms
[2020-05-20 23:59:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1113 ms
[2020-05-20 23:59:14] [INFO ] [Real]Absence check using 11 positive place invariants in 25 ms returned sat
[2020-05-20 23:59:14] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:15] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2020-05-20 23:59:15] [INFO ] [Real]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-05-20 23:59:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:59:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-20 23:59:15] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 23:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:15] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2020-05-20 23:59:15] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-05-20 23:59:15] [INFO ] Deduced a trap composed of 20 places in 109 ms
[2020-05-20 23:59:15] [INFO ] Deduced a trap composed of 100 places in 96 ms
[2020-05-20 23:59:15] [INFO ] Deduced a trap composed of 53 places in 120 ms
[2020-05-20 23:59:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 387 ms
[2020-05-20 23:59:15] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2020-05-20 23:59:17] [INFO ] Added : 270 causal constraints over 54 iterations in 1261 ms. Result :sat
[2020-05-20 23:59:17] [INFO ] Deduced a trap composed of 16 places in 75 ms
[2020-05-20 23:59:17] [INFO ] Deduced a trap composed of 35 places in 55 ms
[2020-05-20 23:59:17] [INFO ] Deduced a trap composed of 34 places in 79 ms
[2020-05-20 23:59:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 316 ms
[2020-05-20 23:59:17] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-20 23:59:17] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-05-20 23:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:17] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2020-05-20 23:59:17] [INFO ] [Real]Added 66 Read/Feed constraints in 17 ms returned sat
[2020-05-20 23:59:17] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-05-20 23:59:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:59:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 58 ms returned sat
[2020-05-20 23:59:18] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 31 ms returned sat
[2020-05-20 23:59:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:18] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2020-05-20 23:59:18] [INFO ] [Nat]Added 66 Read/Feed constraints in 29 ms returned sat
[2020-05-20 23:59:18] [INFO ] Deduced a trap composed of 16 places in 120 ms
[2020-05-20 23:59:18] [INFO ] Deduced a trap composed of 17 places in 104 ms
[2020-05-20 23:59:18] [INFO ] Deduced a trap composed of 20 places in 106 ms
[2020-05-20 23:59:18] [INFO ] Deduced a trap composed of 35 places in 93 ms
[2020-05-20 23:59:19] [INFO ] Deduced a trap composed of 20 places in 139 ms
[2020-05-20 23:59:19] [INFO ] Deduced a trap composed of 34 places in 103 ms
[2020-05-20 23:59:19] [INFO ] Deduced a trap composed of 54 places in 99 ms
[2020-05-20 23:59:19] [INFO ] Deduced a trap composed of 57 places in 64 ms
[2020-05-20 23:59:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 975 ms
[2020-05-20 23:59:19] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-05-20 23:59:20] [INFO ] Added : 304 causal constraints over 61 iterations in 1662 ms. Result :sat
[2020-05-20 23:59:21] [INFO ] Deduced a trap composed of 36 places in 73 ms
[2020-05-20 23:59:21] [INFO ] Deduced a trap composed of 57 places in 76 ms
[2020-05-20 23:59:21] [INFO ] Deduced a trap composed of 59 places in 83 ms
[2020-05-20 23:59:21] [INFO ] Deduced a trap composed of 49 places in 67 ms
[2020-05-20 23:59:21] [INFO ] Deduced a trap composed of 50 places in 90 ms
[2020-05-20 23:59:21] [INFO ] Deduced a trap composed of 41 places in 56 ms
[2020-05-20 23:59:21] [INFO ] Deduced a trap composed of 73 places in 100 ms
[2020-05-20 23:59:22] [INFO ] Deduced a trap composed of 26 places in 114 ms
[2020-05-20 23:59:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1110 ms
[2020-05-20 23:59:22] [INFO ] Flatten gal took : 127 ms
[2020-05-20 23:59:22] [INFO ] Flatten gal took : 27 ms
[2020-05-20 23:59:22] [INFO ] Applying decomposition
[2020-05-20 23:59:22] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph848161262065234120.txt, -o, /tmp/graph848161262065234120.bin, -w, /tmp/graph848161262065234120.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph848161262065234120.bin, -l, -1, -v, -w, /tmp/graph848161262065234120.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 23:59:22] [INFO ] Decomposing Gal with order
[2020-05-20 23:59:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 23:59:22] [INFO ] Removed a total of 200 redundant transitions.
[2020-05-20 23:59:23] [INFO ] Flatten gal took : 237 ms
[2020-05-20 23:59:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 13 ms.
[2020-05-20 23:59:23] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 11 ms
[2020-05-20 23:59:23] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 12 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 63 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 27 ordering constraints for composite.
built 22 ordering constraints for composite.
built 36 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
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,3.40795e+06,7.04854,170896,5196,350,261657,2561,671,1.01619e+06,123,21098,0
Converting to forward existential form...Done !
original formula: A(!(AF(((((((((((((i11.u17.testIdentity_34>=1)||(i14.i1.u30.testIdentity_0>=1))||(i8.u14.testIdentity_17>=1))||(i12.u57.testIdentity_39>=1))||(i7.i1.u34.testIdentity_4>=1))||(i9.u45.testIdentity_21>=1))||(i15.u66.testIdentity_26>=1))||(i1.u20.testIdentity_43>=1))||(i3.u38.testIdentity_8>=1))||(i10.u67.testIdentity_30>=1))||(i5.u23.testIdentity_47>=1))||(i13.u12.testIdentity_13>=1)))) U (AF(((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17>=1)||(i2.u42.beginLoop_16>=1))||(i8.u63.beginLoop_19>=1))||(i8.u14.beginLoop_18>=1))||(i9.u45.beginLoop_21>=1))||(i4.u44.beginLoop_20>=1))||(i9.u47.beginLoop_23>=1))||(i9.u46.beginLoop_22>=1))||(i15.u49.beginLoop_25>=1))||(i0.u48.beginLoop_24>=1))||(i15.u15.beginLoop_27>=1))||(i15.u66.beginLoop_26>=1))||(i10.u51.beginLoop_29>=1))||(i2.u50.beginLoop_28>=1))||(i10.u52.beginLoop_31>=1))||(i10.u67.beginLoop_30>=1))||(i11.u54.beginLoop_33>=1))||(i4.u53.beginLoop_32>=1))||(i11.u55.beginLoop_35>=1))||(i11.u17.beginLoop_34>=1))||(i12.u18.beginLoop_37>=1))||(i0.u56.beginLoop_36>=1))||(i12.u57.beginLoop_39>=1))||(i12.u64.beginLoop_38>=1))||(i1.u58.beginLoop_41>=1))||(i1.u19.beginLoop_40>=1))||(i1.u20.beginLoop_43>=1))||(i1.u59.beginLoop_42>=1))||(i5.u21.beginLoop_45>=1))||(i5.u60.beginLoop_44>=1))||(i5.u23.beginLoop_47>=1))||(i5.u22.beginLoop_46>=1))||(i14.i1.u65.beginLoop_1>=1))||(i14.i1.u30.beginLoop_0>=1))||(i14.i0.u33.beginLoop_3>=1))||(i14.i0.u32.beginLoop_2>=1))||(i7.i1.u35.beginLoop_5>=1))||(i7.i1.u34.beginLoop_4>=1))||(i7.i0.u37.beginLoop_7>=1))||(i7.i0.u36.beginLoop_6>=1))||(i3.u10.beginLoop_9>=1))||(i3.u38.beginLoop_8>=1))||(i6.u40.beginLoop_11>=1))||(i3.u11.beginLoop_10>=1))||(i13.u12.beginLoop_13>=1))||(i0.u41.beginLoop_12>=1))||(i13.u13.beginLoop_15>=1))||(i13.u62.beginLoop_14>=1))) * ((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17>=1)||(i2.u42.beginLoop_16>=1))||(i8.u63.beginLoop_19>=1))||(i8.u14.beginLoop_18>=1))||(i9.u45.beginLoop_21>=1))||(i4.u44.beginLoop_20>=1))||(i9.u47.beginLoop_23>=1))||(i9.u46.beginLoop_22>=1))||(i15.u49.beginLoop_25>=1))||(i0.u48.beginLoop_24>=1))||(i15.u15.beginLoop_27>=1))||(i15.u66.beginLoop_26>=1))||(i10.u51.beginLoop_29>=1))||(i2.u50.beginLoop_28>=1))||(i10.u52.beginLoop_31>=1))||(i10.u67.beginLoop_30>=1))||(i11.u54.beginLoop_33>=1))||(i4.u53.beginLoop_32>=1))||(i11.u55.beginLoop_35>=1))||(i11.u17.beginLoop_34>=1))||(i12.u18.beginLoop_37>=1))||(i0.u56.beginLoop_36>=1))||(i12.u57.beginLoop_39>=1))||(i12.u64.beginLoop_38>=1))||(i1.u58.beginLoop_41>=1))||(i1.u19.beginLoop_40>=1))||(i1.u20.beginLoop_43>=1))||(i1.u59.beginLoop_42>=1))||(i5.u21.beginLoop_45>=1))||(i5.u60.beginLoop_44>=1))||(i5.u23.beginLoop_47>=1))||(i5.u22.beginLoop_46>=1))||(i14.i1.u65.beginLoop_1>=1))||(i14.i1.u30.beginLoop_0>=1))||(i14.i0.u33.beginLoop_3>=1))||(i14.i0.u32.beginLoop_2>=1))||(i7.i1.u35.beginLoop_5>=1))||(i7.i1.u34.beginLoop_4>=1))||(i7.i0.u37.beginLoop_7>=1))||(i7.i0.u36.beginLoop_6>=1))||(i3.u10.beginLoop_9>=1))||(i3.u38.beginLoop_8>=1))||(i6.u40.beginLoop_11>=1))||(i3.u11.beginLoop_10>=1))||(i13.u12.beginLoop_13>=1))||(i0.u41.beginLoop_12>=1))||(i13.u13.beginLoop_15>=1))||(i13.u62.beginLoop_14>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17>=1)||(i2.u42.beginLoop_16>=1))||(i8.u63.beginLoop_19>=1))||(i8.u14.beginLoop_18>=1))||(i9.u45.beginLoop_21>=1))||(i4.u44.beginLoop_20>=1))||(i9.u47.beginLoop_23>=1))||(i9.u46.beginLoop_22>=1))||(i15.u49.beginLoop_25>=1))||(i0.u48.beginLoop_24>=1))||(i15.u15.beginLoop_27>=1))||(i15.u66.beginLoop_26>=1))||(i10.u51.beginLoop_29>=1))||(i2.u50.beginLoop_28>=1))||(i10.u52.beginLoop_31>=1))||(i10.u67.beginLoop_30>=1))||(i11.u54.beginLoop_33>=1))||(i4.u53.beginLoop_32>=1))||(i11.u55.beginLoop_35>=1))||(i11.u17.beginLoop_34>=1))||(i12.u18.beginLoop_37>=1))||(i0.u56.beginLoop_36>=1))||(i12.u57.beginLoop_39>=1))||(i12.u64.beginLoop_38>=1))||(i1.u58.beginLoop_41>=1))||(i1.u19.beginLoop_40>=1))||(i1.u20.beginLoop_43>=1))||(i1.u59.beginLoop_42>=1))||(i5.u21.beginLoop_45>=1))||(i5.u60.beginLoop_44>=1))||(i5.u23.beginLoop_47>=1))||(i5.u22.beginLoop_46>=1))||(i14.i1.u65.beginLoop_1>=1))||(i14.i1.u30.beginLoop_0>=1))||(i14.i0.u33.beginLoop_3>=1))||(i14.i0.u32.beginLoop_2>=1))||(i7.i1.u35.beginLoop_5>=1))||(i7.i1.u34.beginLoop_4>=1))||(i7.i0.u37.beginLoop_7>=1))||(i7.i0.u36.beginLoop_6>=1))||(i3.u10.beginLoop_9>=1))||(i3.u38.beginLoop_8>=1))||(i6.u40.beginLoop_11>=1))||(i3.u11.beginLoop_10>=1))||(i13.u12.beginLoop_13>=1))||(i0.u41.beginLoop_12>=1))||(i13.u13.beginLoop_15>=1))||(i13.u62.beginLoop_14>=1))))) * ((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17>=1)||(i2.u42.beginLoop_16>=1))||(i8.u63.beginLoop_19>=1))||(i8.u14.beginLoop_18>=1))||(i9.u45.beginLoop_21>=1))||(i4.u44.beginLoop_20>=1))||(i9.u47.beginLoop_23>=1))||(i9.u46.beginLoop_22>=1))||(i15.u49.beginLoop_25>=1))||(i0.u48.beginLoop_24>=1))||(i15.u15.beginLoop_27>=1))||(i15.u66.beginLoop_26>=1))||(i10.u51.beginLoop_29>=1))||(i2.u50.beginLoop_28>=1))||(i10.u52.beginLoop_31>=1))||(i10.u67.beginLoop_30>=1))||(i11.u54.beginLoop_33>=1))||(i4.u53.beginLoop_32>=1))||(i11.u55.beginLoop_35>=1))||(i11.u17.beginLoop_34>=1))||(i12.u18.beginLoop_37>=1))||(i0.u56.beginLoop_36>=1))||(i12.u57.beginLoop_39>=1))||(i12.u64.beginLoop_38>=1))||(i1.u58.beginLoop_41>=1))||(i1.u19.beginLoop_40>=1))||(i1.u20.beginLoop_43>=1))||(i1.u59.beginLoop_42>=1))||(i5.u21.beginLoop_45>=1))||(i5.u60.beginLoop_44>=1))||(i5.u23.beginLoop_47>=1))||(i5.u22.beginLoop_46>=1))||(i14.i1.u65.beginLoop_1>=1))||(i14.i1.u30.beginLoop_0>=1))||(i14.i0.u33.beginLoop_3>=1))||(i14.i0.u32.beginLoop_2>=1))||(i7.i1.u35.beginLoop_5>=1))||(i7.i1.u34.beginLoop_4>=1))||(i7.i0.u37.beginLoop_7>=1))||(i7.i0.u36.beginLoop_6>=1))||(i3.u10.beginLoop_9>=1))||(i3.u38.beginLoop_8>=1))||(i6.u40.beginLoop_11>=1))||(i3.u11.beginLoop_10>=1))||(i13.u12.beginLoop_13>=1))||(i0.u41.beginLoop_12>=1))||(i13.u13.beginLoop_15>=1))||(i13.u62.beginLoop_14>=1))))))) * !(E(!((!(EG(!(((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17>=1)||(i2.u42.beginLoop_16>=1))||(i8.u63.beginLoop_19>=1))||(i8.u14.beginLoop_18>=1))||(i9.u45.beginLoop_21>=1))||(i4.u44.beginLoop_20>=1))||(i9.u47.beginLoop_23>=1))||(i9.u46.beginLoop_22>=1))||(i15.u49.beginLoop_25>=1))||(i0.u48.beginLoop_24>=1))||(i15.u15.beginLoop_27>=1))||(i15.u66.beginLoop_26>=1))||(i10.u51.beginLoop_29>=1))||(i2.u50.beginLoop_28>=1))||(i10.u52.beginLoop_31>=1))||(i10.u67.beginLoop_30>=1))||(i11.u54.beginLoop_33>=1))||(i4.u53.beginLoop_32>=1))||(i11.u55.beginLoop_35>=1))||(i11.u17.beginLoop_34>=1))||(i12.u18.beginLoop_37>=1))||(i0.u56.beginLoop_36>=1))||(i12.u57.beginLoop_39>=1))||(i12.u64.beginLoop_38>=1))||(i1.u58.beginLoop_41>=1))||(i1.u19.beginLoop_40>=1))||(i1.u20.beginLoop_43>=1))||(i1.u59.beginLoop_42>=1))||(i5.u21.beginLoop_45>=1))||(i5.u60.beginLoop_44>=1))||(i5.u23.beginLoop_47>=1))||(i5.u22.beginLoop_46>=1))||(i14.i1.u65.beginLoop_1>=1))||(i14.i1.u30.beginLoop_0>=1))||(i14.i0.u33.beginLoop_3>=1))||(i14.i0.u32.beginLoop_2>=1))||(i7.i1.u35.beginLoop_5>=1))||(i7.i1.u34.beginLoop_4>=1))||(i7.i0.u37.beginLoop_7>=1))||(i7.i0.u36.beginLoop_6>=1))||(i3.u10.beginLoop_9>=1))||(i3.u38.beginLoop_8>=1))||(i6.u40.beginLoop_11>=1))||(i3.u11.beginLoop_10>=1))||(i13.u12.beginLoop_13>=1))||(i0.u41.beginLoop_12>=1))||(i13.u13.beginLoop_15>=1))||(i13.u62.beginLoop_14>=1))))) * ((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17>=1)||(i2.u42.beginLoop_16>=1))||(i8.u63.beginLoop_19>=1))||(i8.u14.beginLoop_18>=1))||(i9.u45.beginLoop_21>=1))||(i4.u44.beginLoop_20>=1))||(i9.u47.beginLoop_23>=1))||(i9.u46.beginLoop_22>=1))||(i15.u49.beginLoop_25>=1))||(i0.u48.beginLoop_24>=1))||(i15.u15.beginLoop_27>=1))||(i15.u66.beginLoop_26>=1))||(i10.u51.beginLoop_29>=1))||(i2.u50.beginLoop_28>=1))||(i10.u52.beginLoop_31>=1))||(i10.u67.beginLoop_30>=1))||(i11.u54.beginLoop_33>=1))||(i4.u53.beginLoop_32>=1))||(i11.u55.beginLoop_35>=1))||(i11.u17.beginLoop_34>=1))||(i12.u18.beginLoop_37>=1))||(i0.u56.beginLoop_36>=1))||(i12.u57.beginLoop_39>=1))||(i12.u64.beginLoop_38>=1))||(i1.u58.beginLoop_41>=1))||(i1.u19.beginLoop_40>=1))||(i1.u20.beginLoop_43>=1))||(i1.u59.beginLoop_42>=1))||(i5.u21.beginLoop_45>=1))||(i5.u60.beginLoop_44>=1))||(i5.u23.beginLoop_47>=1))||(i5.u22.beginLoop_46>=1))||(i14.i1.u65.beginLoop_1>=1))||(i14.i1.u30.beginLoop_0>=1))||(i14.i0.u33.beginLoop_3>=1))||(i14.i0.u32.beginLoop_2>=1))||(i7.i1.u35.beginLoop_5>=1))||(i7.i1.u34.beginLoop_4>=1))||(i7.i0.u37.beginLoop_7>=1))||(i7.i0.u36.beginLoop_6>=1))||(i3.u10.beginLoop_9>=1))||(i3.u38.beginLoop_8>=1))||(i6.u40.beginLoop_11>=1))||(i3.u11.beginLoop_10>=1))||(i13.u12.beginLoop_13>=1))||(i0.u41.beginLoop_12>=1))||(i13.u13.beginLoop_15>=1))||(i13.u62.beginLoop_14>=1)))) U (!(!(!(EG(!(((((((((((((i11.u17.testIdentity_34>=1)||(i14.i1.u30.testIdentity_0>=1))||(i8.u14.testIdentity_17>=1))||(i12.u57.testIdentity_39>=1))||(i7.i1.u34.testIdentity_4>=1))||(i9.u45.testIdentity_21>=1))||(i15.u66.testIdentity_26>=1))||(i1.u20.testIdentity_43>=1))||(i3.u38.testIdentity_8>=1))||(i10.u67.testIdentity_30>=1))||(i5.u23.testIdentity_47>=1))||(i13.u12.testIdentity_13>=1))))))) * !((!(EG(!(((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17>=1)||(i2.u42.beginLoop_16>=1))||(i8.u63.beginLoop_19>=1))||(i8.u14.beginLoop_18>=1))||(i9.u45.beginLoop_21>=1))||(i4.u44.beginLoop_20>=1))||(i9.u47.beginLoop_23>=1))||(i9.u46.beginLoop_22>=1))||(i15.u49.beginLoop_25>=1))||(i0.u48.beginLoop_24>=1))||(i15.u15.beginLoop_27>=1))||(i15.u66.beginLoop_26>=1))||(i10.u51.beginLoop_29>=1))||(i2.u50.beginLoop_28>=1))||(i10.u52.beginLoop_31>=1))||(i10.u67.beginLoop_30>=1))||(i11.u54.beginLoop_33>=1))||(i4.u53.beginLoop_32>=1))||(i11.u55.beginLoop_35>=1))||(i11.u17.beginLoop_34>=1))||(i12.u18.beginLoop_37>=1))||(i0.u56.beginLoop_36>=1))||(i12.u57.beginLoop_39>=1))||(i12.u64.beginLoop_38>=1))||(i1.u58.beginLoop_41>=1))||(i1.u19.beginLoop_40>=1))||(i1.u20.beginLoop_43>=1))||(i1.u59.beginLoop_42>=1))||(i5.u21.beginLoop_45>=1))||(i5.u60.beginLoop_44>=1))||(i5.u23.beginLoop_47>=1))||(i5.u22.beginLoop_46>=1))||(i14.i1.u65.beginLoop_1>=1))||(i14.i1.u30.beginLoop_0>=1))||(i14.i0.u33.beginLoop_3>=1))||(i14.i0.u32.beginLoop_2>=1))||(i7.i1.u35.beginLoop_5>=1))||(i7.i1.u34.beginLoop_4>=1))||(i7.i0.u37.beginLoop_7>=1))||(i7.i0.u36.beginLoop_6>=1))||(i3.u10.beginLoop_9>=1))||(i3.u38.beginLoop_8>=1))||(i6.u40.beginLoop_11>=1))||(i3.u11.beginLoop_10>=1))||(i13.u12.beginLoop_13>=1))||(i0.u41.beginLoop_12>=1))||(i13.u13.beginLoop_15>=1))||(i13.u62.beginLoop_14>=1))))) * ((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17>=1)||(i2.u42.beginLoop_16>=1))||(i8.u63.beginLoop_19>=1))||(i8.u14.beginLoop_18>=1))||(i9.u45.beginLoop_21>=1))||(i4.u44.beginLoop_20>=1))||(i9.u47.beginLoop_23>=1))||(i9.u46.beginLoop_22>=1))||(i15.u49.beginLoop_25>=1))||(i0.u48.beginLoop_24>=1))||(i15.u15.beginLoop_27>=1))||(i15.u66.beginLoop_26>=1))||(i10.u51.beginLoop_29>=1))||(i2.u50.beginLoop_28>=1))||(i10.u52.beginLoop_31>=1))||(i10.u67.beginLoop_30>=1))||(i11.u54.beginLoop_33>=1))||(i4.u53.beginLoop_32>=1))||(i11.u55.beginLoop_35>=1))||(i11.u17.beginLoop_34>=1))||(i12.u18.beginLoop_37>=1))||(i0.u56.beginLoop_36>=1))||(i12.u57.beginLoop_39>=1))||(i12.u64.beginLoop_38>=1))||(i1.u58.beginLoop_41>=1))||(i1.u19.beginLoop_40>=1))||(i1.u20.beginLoop_43>=1))||(i1.u59.beginLoop_42>=1))||(i5.u21.beginLoop_45>=1))||(i5.u60.beginLoop_44>=1))||(i5.u23.beginLoop_47>=1))||(i5.u22.beginLoop_46>=1))||(i14.i1.u65.beginLoop_1>=1))||(i14.i1.u30.beginLoop_0>=1))||(i14.i0.u33.beginLoop_3>=1))||(i14.i0.u32.beginLoop_2>=1))||(i7.i1.u35.beginLoop_5>=1))||(i7.i1.u34.beginLoop_4>=1))||(i7.i0.u37.beginLoop_7>=1))||(i7.i0.u36.beginLoop_6>=1))||(i3.u10.beginLoop_9>=1))||(i3.u38.beginLoop_8>=1))||(i6.u40.beginLoop_11>=1))||(i3.u11.beginLoop_10>=1))||(i13.u12.beginLoop_13>=1))||(i0.u41.beginLoop_12>=1))||(i13.u13.beginLoop_15>=1))||(i13.u62.beginLoop_14>=1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions updateTurnj1i3k2, updateTurnj1i3k3, updateTurnj2i3k0, updateTurnj2i3k3, becomeIdlei0, becomeIdlei1, becomeIdlei2, becomeIdlei3, notAlonej0i0k2, notAlonej0i0k3, notAlonej0i1k2, notAlonej0i1k3, notAlonej0i2k1, notAlonej0i2k3, notAlonej0i3k1, notAlonej0i3k2, notAlonej1i0k2, notAlonej1i0k3, notAlonej1i1k2, notAlonej1i1k3, notAlonej1i2k1, notAlonej1i2k3, notAlonej1i3k1, notAlonej1i3k2, notAlonej2i0k2, notAlonej2i0k3, notAlonej2i1k2, notAlonej2i1k3, notAlonej2i2k1, notAlonej2i2k3, notAlonej2i3k1, notAlonej2i3k2, endLoopj0i3, i0.updateTurnj0i3k3, i0.updateTurnj0i3k0, i0.updateTurnj0i1k2, i0.updateTurnj0i1k1, i0.updateTurnj0i0k3, i0.updateTurnj0i0k0, i0.u4.updateTurnj0i2k0, i0.u4.updateTurnj0i2k1, i0.u4.updateTurnj0i2k2, i0.u4.updateTurnj0i2k3, i0.u4.endLoopj0i2, i0.u6.endLoopj0i0, i0.u25.endLoopj0i1, i1.endLoopj1i3, i2.updateTurnj1i2k2, i2.updateTurnj1i2k0, i2.updateTurnj1i0k1, i2.updateTurnj1i0k0, i2.u7.endLoopj1i0, i2.u8.updateTurnj1i1k0, i2.u8.updateTurnj1i1k1, i2.u8.updateTurnj1i1k2, i2.u8.updateTurnj1i1k3, i2.u8.endLoopj1i1, i2.u27.endLoopj1i2, i4.updateTurnj2i2k3, i4.updateTurnj2i2k2, i4.updateTurnj2i1k2, i4.updateTurnj2i1k1, i4.u24.updateTurnj2i0k0, i4.u24.updateTurnj2i0k1, i4.u24.updateTurnj2i0k2, i4.u24.updateTurnj2i0k3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/245/66/311
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,28.5031,663128,1,0,1.01545e+06,8936,3888,3.77012e+06,736,58053,3190179
FORMULA Peterson-COL-3-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(AG((((((((((((((i11.u17.testIdentity_34<1)&&(i14.i1.u30.testIdentity_0<1))&&(i8.u14.testIdentity_17<1))&&(i12.u57.testIdentity_39<1))&&(i7.i1.u34.testIdentity_4<1))&&(i9.u45.testIdentity_21<1))&&(i15.u66.testIdentity_26<1))&&(i1.u20.testIdentity_43<1))&&(i3.u38.testIdentity_8<1))&&(i10.u67.testIdentity_30<1))&&(i5.u23.testIdentity_47<1))&&(i13.u12.testIdentity_13<1))&&(((((i0.u2.idle_0>=1)&&(i8.u43.wantSection_0>=1))||((i2.u1.idle_3>=1)&&(i2.u1.wantSection_6>=1)))||((i0.u0.idle_1>=1)&&(i11.u16.wantSection_2>=1)))||((i6.u3.idle_2>=1)&&(i6.u3.wantSection_4>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((((((((((((i11.u17.testIdentity_34<1)&&(i14.i1.u30.testIdentity_0<1))&&(i8.u14.testIdentity_17<1))&&(i12.u57.testIdentity_39<1))&&(i7.i1.u34.testIdentity_4<1))&&(i9.u45.testIdentity_21<1))&&(i15.u66.testIdentity_26<1))&&(i1.u20.testIdentity_43<1))&&(i3.u38.testIdentity_8<1))&&(i10.u67.testIdentity_30<1))&&(i5.u23.testIdentity_47<1))&&(i13.u12.testIdentity_13<1))&&(((((i0.u2.idle_0>=1)&&(i8.u43.wantSection_0>=1))||((i2.u1.idle_3>=1)&&(i2.u1.wantSection_6>=1)))||((i0.u0.idle_1>=1)&&(i11.u16.wantSection_2>=1)))||((i6.u3.idle_2>=1)&&(i6.u3.wantSection_4>=1))))))))] != FALSE
(forward)formula 1,0,29.7231,698548,1,0,1.05778e+06,9248,4504,3.88223e+06,767,59976,3355491
FORMULA Peterson-COL-3-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF((!(EF((((((((((((((i0.u4.turn_2>=1)&&(i0.u4.testTurn_6>=1))||((i2.u8.turn_4>=1)&&(i2.u7.testTurn_1>=1)))||((i4.u24.turn_11>=1)&&(i5.u29.testTurn_11>=1)))||((i0.u4.turn_0>=1)&&(i0.u6.testTurn_0>=1)))||((i2.u8.turn_6>=1)&&(i2.u27.testTurn_7>=1)))||((i0.u4.turn_1>=1)&&(i0.u25.testTurn_3>=1)))||((i2.u8.turn_7>=1)&&(i1.u5.testTurn_10>=1)))||((i0.u4.turn_3>=1)&&(i0.u9.testTurn_9>=1)))||((i2.u8.turn_5>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i4.u28.testTurn_8>=1)))||((i4.u24.turn_9>=1)&&(i4.u26.testTurn_5>=1)))||((i4.u24.turn_8>=1)&&(i4.u24.testTurn_2>=1))))) * (((((((((((((((((((((((((((((((((((((((((((((((((i0.u25.askForSection_3>=1)&&(i0.u4.turn_2>=1))||((i0.u25.askForSection_3>=1)&&(i0.u4.turn_1>=1)))||((i0.u25.askForSection_3>=1)&&(i0.u4.turn_3>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_3>=1)))||((i0.u25.askForSection_3>=1)&&(i0.u4.turn_0>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_4>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_0>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_6>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_5>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_2>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_1>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_7>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_2>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_7>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_11>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_3>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_6>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_10>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_0>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_5>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_9>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_1>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_4>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_8>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_7>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_10>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_9>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_11>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_4>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_5>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_6>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_11>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_10>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_8>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_11>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_9>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_8>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_8>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_10>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_9>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_1>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_5>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_0>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_4>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_3>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_7>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_2>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_6>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (((((((((((((((((((((((((((((((((((((((((((((((((i0.u25.askForSection_3>=1)&&(i0.u4.turn_2>=1))||((i0.u25.askForSection_3>=1)&&(i0.u4.turn_1>=1)))||((i0.u25.askForSection_3>=1)&&(i0.u4.turn_3>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_3>=1)))||((i0.u25.askForSection_3>=1)&&(i0.u4.turn_0>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_4>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_0>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_6>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_5>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_2>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_1>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_7>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_2>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_7>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_11>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_3>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_6>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_10>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_0>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_5>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_9>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_1>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_4>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_8>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_7>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_10>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_9>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_11>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_4>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_5>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_6>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_11>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_10>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_8>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_11>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_9>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_8>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_8>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_10>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_9>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_1>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_5>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_0>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_4>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_3>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_7>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_2>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_6>=1)))) * !(E(TRUE U (((((((((((((i0.u4.turn_2>=1)&&(i0.u4.testTurn_6>=1))||((i2.u8.turn_4>=1)&&(i2.u7.testTurn_1>=1)))||((i4.u24.turn_11>=1)&&(i5.u29.testTurn_11>=1)))||((i0.u4.turn_0>=1)&&(i0.u6.testTurn_0>=1)))||((i2.u8.turn_6>=1)&&(i2.u27.testTurn_7>=1)))||((i0.u4.turn_1>=1)&&(i0.u25.testTurn_3>=1)))||((i2.u8.turn_7>=1)&&(i1.u5.testTurn_10>=1)))||((i0.u4.turn_3>=1)&&(i0.u9.testTurn_9>=1)))||((i2.u8.turn_5>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i4.u28.testTurn_8>=1)))||((i4.u24.turn_9>=1)&&(i4.u26.testTurn_5>=1)))||((i4.u24.turn_8>=1)&&(i4.u24.testTurn_2>=1))))))] != FALSE
(forward)formula 2,0,30.3581,709896,1,0,1.09084e+06,9342,4620,3.97896e+06,772,60476,3480172
FORMULA Peterson-COL-3-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(AG((((((((((((((((((((((((((((((((((((((i2.u8.turn_7>=1)&&(i2.u27.testTurn_7>=1))||((i0.u4.turn_2>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_2>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_11>=1)&&(i4.u24.testTurn_2>=1)))||((i0.u4.turn_1>=1)&&(i0.u6.testTurn_0>=1)))||((i4.u24.turn_11>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_7>=1)&&(i2.u8.testTurn_4>=1)))||((i2.u8.turn_7>=1)&&(i2.u7.testTurn_1>=1)))||((i4.u24.turn_11>=1)&&(i4.u26.testTurn_5>=1)))||((i0.u4.turn_3>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_8>=1)&&(i4.u26.testTurn_5>=1)))||((i4.u24.turn_8>=1)&&(i4.u28.testTurn_8>=1)))||((i0.u4.turn_0>=1)&&(i0.u25.testTurn_3>=1)))||((i0.u4.turn_3>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_8>=1)&&(i5.u29.testTurn_11>=1)))||((i4.u24.turn_9>=1)&&(i4.u24.testTurn_2>=1)))||((i2.u8.turn_4>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i5.u29.testTurn_11>=1)))||((i2.u8.turn_5>=1)&&(i1.u5.testTurn_10>=1)))||((i2.u8.turn_5>=1)&&(i2.u27.testTurn_7>=1)))||((i2.u8.turn_4>=1)&&(i2.u27.testTurn_7>=1)))||((i0.u4.turn_0>=1)&&(i0.u4.testTurn_6>=1)))||((i2.u8.turn_4>=1)&&(i1.u5.testTurn_10>=1)))||((i4.u24.turn_9>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_5>=1)&&(i2.u7.testTurn_1>=1)))||((i0.u4.turn_3>=1)&&(i0.u6.testTurn_0>=1)))||((i0.u4.turn_0>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_1>=1)&&(i0.u9.testTurn_9>=1)))||((i2.u8.turn_6>=1)&&(i1.u5.testTurn_10>=1)))||((i0.u4.turn_1>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_9>=1)&&(i5.u29.testTurn_11>=1)))||((i0.u4.turn_2>=1)&&(i0.u6.testTurn_0>=1)))||((i2.u8.turn_6>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i4.u24.testTurn_2>=1)))||((i4.u24.turn_10>=1)&&(i4.u26.testTurn_5>=1)))||((i2.u8.turn_6>=1)&&(i2.u7.testTurn_1>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((((((((((((((((((((((((((((((((((((i2.u8.turn_7>=1)&&(i2.u27.testTurn_7>=1))||((i0.u4.turn_2>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_2>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_11>=1)&&(i4.u24.testTurn_2>=1)))||((i0.u4.turn_1>=1)&&(i0.u6.testTurn_0>=1)))||((i4.u24.turn_11>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_7>=1)&&(i2.u8.testTurn_4>=1)))||((i2.u8.turn_7>=1)&&(i2.u7.testTurn_1>=1)))||((i4.u24.turn_11>=1)&&(i4.u26.testTurn_5>=1)))||((i0.u4.turn_3>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_8>=1)&&(i4.u26.testTurn_5>=1)))||((i4.u24.turn_8>=1)&&(i4.u28.testTurn_8>=1)))||((i0.u4.turn_0>=1)&&(i0.u25.testTurn_3>=1)))||((i0.u4.turn_3>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_8>=1)&&(i5.u29.testTurn_11>=1)))||((i4.u24.turn_9>=1)&&(i4.u24.testTurn_2>=1)))||((i2.u8.turn_4>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i5.u29.testTurn_11>=1)))||((i2.u8.turn_5>=1)&&(i1.u5.testTurn_10>=1)))||((i2.u8.turn_5>=1)&&(i2.u27.testTurn_7>=1)))||((i2.u8.turn_4>=1)&&(i2.u27.testTurn_7>=1)))||((i0.u4.turn_0>=1)&&(i0.u4.testTurn_6>=1)))||((i2.u8.turn_4>=1)&&(i1.u5.testTurn_10>=1)))||((i4.u24.turn_9>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_5>=1)&&(i2.u7.testTurn_1>=1)))||((i0.u4.turn_3>=1)&&(i0.u6.testTurn_0>=1)))||((i0.u4.turn_0>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_1>=1)&&(i0.u9.testTurn_9>=1)))||((i2.u8.turn_6>=1)&&(i1.u5.testTurn_10>=1)))||((i0.u4.turn_1>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_9>=1)&&(i5.u29.testTurn_11>=1)))||((i0.u4.turn_2>=1)&&(i0.u6.testTurn_0>=1)))||((i2.u8.turn_6>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i4.u24.testTurn_2>=1)))||((i4.u24.turn_10>=1)&&(i4.u26.testTurn_5>=1)))||((i2.u8.turn_6>=1)&&(i2.u7.testTurn_1>=1)))))))] != FALSE
(forward)formula 3,0,30.4893,711744,1,0,1.09555e+06,9402,4901,3.9941e+06,796,60774,3498304
FORMULA Peterson-COL-3-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AF(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i8.u14.testIdentity_18>=1)||(i8.u63.testIdentity_19>=1))||(i2.u42.testIdentity_16>=1))||(i9.u46.testIdentity_22>=1))||(i9.u47.testIdentity_23>=1))||(i4.u44.testIdentity_20>=1))||(i15.u15.testIdentity_27>=1))||(i0.u48.testIdentity_24>=1))||(i15.u49.testIdentity_25>=1))||(i10.u52.testIdentity_31>=1))||(i2.u50.testIdentity_28>=1))||(i10.u51.testIdentity_29>=1))||(i11.u55.testIdentity_35>=1))||(i4.u53.testIdentity_32>=1))||(i11.u54.testIdentity_33>=1))||(i12.u64.testIdentity_38>=1))||(i0.u56.testIdentity_36>=1))||(i12.u18.testIdentity_37>=1))||(i1.u59.testIdentity_42>=1))||(i1.u19.testIdentity_40>=1))||(i1.u58.testIdentity_41>=1))||(i5.u22.testIdentity_46>=1))||(i5.u60.testIdentity_44>=1))||(i5.u21.testIdentity_45>=1))||(i14.i0.u32.testIdentity_2>=1))||(i14.i0.u33.testIdentity_3>=1))||(i14.i1.u31.testIdentity_1>=1))||(i7.i0.u36.testIdentity_6>=1))||(i7.i0.u37.testIdentity_7>=1))||(i7.i1.u61.testIdentity_5>=1))||(i3.u11.testIdentity_10>=1))||(i6.u40.testIdentity_11>=1))||(i3.u39.testIdentity_9>=1))||(i13.u62.testIdentity_14>=1))||(i13.u13.testIdentity_15>=1))||(i0.u41.testIdentity_12>=1))||((i2.u8.turn_7>=1)&&(i2.u27.testTurn_7>=1)))||((i0.u4.turn_2>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_2>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_11>=1)&&(i4.u24.testTurn_2>=1)))||((i0.u4.turn_1>=1)&&(i0.u6.testTurn_0>=1)))||((i4.u24.turn_11>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_7>=1)&&(i2.u8.testTurn_4>=1)))||((i2.u8.turn_7>=1)&&(i2.u7.testTurn_1>=1)))||((i4.u24.turn_11>=1)&&(i4.u26.testTurn_5>=1)))||((i0.u4.turn_3>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_8>=1)&&(i4.u26.testTurn_5>=1)))||((i4.u24.turn_8>=1)&&(i4.u28.testTurn_8>=1)))||((i0.u4.turn_0>=1)&&(i0.u25.testTurn_3>=1)))||((i0.u4.turn_3>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_8>=1)&&(i5.u29.testTurn_11>=1)))||((i4.u24.turn_9>=1)&&(i4.u24.testTurn_2>=1)))||((i2.u8.turn_4>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i5.u29.testTurn_11>=1)))||((i2.u8.turn_5>=1)&&(i1.u5.testTurn_10>=1)))||((i2.u8.turn_5>=1)&&(i2.u27.testTurn_7>=1)))||((i2.u8.turn_4>=1)&&(i2.u27.testTurn_7>=1)))||((i0.u4.turn_0>=1)&&(i0.u4.testTurn_6>=1)))||((i2.u8.turn_4>=1)&&(i1.u5.testTurn_10>=1)))||((i4.u24.turn_9>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_5>=1)&&(i2.u7.testTurn_1>=1)))||((i0.u4.turn_3>=1)&&(i0.u6.testTurn_0>=1)))||((i0.u4.turn_0>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_1>=1)&&(i0.u9.testTurn_9>=1)))||((i2.u8.turn_6>=1)&&(i1.u5.testTurn_10>=1)))||((i0.u4.turn_1>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_9>=1)&&(i5.u29.testTurn_11>=1)))||((i0.u4.turn_2>=1)&&(i0.u6.testTurn_0>=1)))||((i2.u8.turn_6>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i4.u24.testTurn_2>=1)))||((i4.u24.turn_10>=1)&&(i4.u26.testTurn_5>=1)))||((i2.u8.turn_6>=1)&&(i2.u7.testTurn_1>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i8.u14.testIdentity_18>=1)||(i8.u63.testIdentity_19>=1))||(i2.u42.testIdentity_16>=1))||(i9.u46.testIdentity_22>=1))||(i9.u47.testIdentity_23>=1))||(i4.u44.testIdentity_20>=1))||(i15.u15.testIdentity_27>=1))||(i0.u48.testIdentity_24>=1))||(i15.u49.testIdentity_25>=1))||(i10.u52.testIdentity_31>=1))||(i2.u50.testIdentity_28>=1))||(i10.u51.testIdentity_29>=1))||(i11.u55.testIdentity_35>=1))||(i4.u53.testIdentity_32>=1))||(i11.u54.testIdentity_33>=1))||(i12.u64.testIdentity_38>=1))||(i0.u56.testIdentity_36>=1))||(i12.u18.testIdentity_37>=1))||(i1.u59.testIdentity_42>=1))||(i1.u19.testIdentity_40>=1))||(i1.u58.testIdentity_41>=1))||(i5.u22.testIdentity_46>=1))||(i5.u60.testIdentity_44>=1))||(i5.u21.testIdentity_45>=1))||(i14.i0.u32.testIdentity_2>=1))||(i14.i0.u33.testIdentity_3>=1))||(i14.i1.u31.testIdentity_1>=1))||(i7.i0.u36.testIdentity_6>=1))||(i7.i0.u37.testIdentity_7>=1))||(i7.i1.u61.testIdentity_5>=1))||(i3.u11.testIdentity_10>=1))||(i6.u40.testIdentity_11>=1))||(i3.u39.testIdentity_9>=1))||(i13.u62.testIdentity_14>=1))||(i13.u13.testIdentity_15>=1))||(i0.u41.testIdentity_12>=1))||((i2.u8.turn_7>=1)&&(i2.u27.testTurn_7>=1)))||((i0.u4.turn_2>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_2>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_11>=1)&&(i4.u24.testTurn_2>=1)))||((i0.u4.turn_1>=1)&&(i0.u6.testTurn_0>=1)))||((i4.u24.turn_11>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_7>=1)&&(i2.u8.testTurn_4>=1)))||((i2.u8.turn_7>=1)&&(i2.u7.testTurn_1>=1)))||((i4.u24.turn_11>=1)&&(i4.u26.testTurn_5>=1)))||((i0.u4.turn_3>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_8>=1)&&(i4.u26.testTurn_5>=1)))||((i4.u24.turn_8>=1)&&(i4.u28.testTurn_8>=1)))||((i0.u4.turn_0>=1)&&(i0.u25.testTurn_3>=1)))||((i0.u4.turn_3>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_8>=1)&&(i5.u29.testTurn_11>=1)))||((i4.u24.turn_9>=1)&&(i4.u24.testTurn_2>=1)))||((i2.u8.turn_4>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i5.u29.testTurn_11>=1)))||((i2.u8.turn_5>=1)&&(i1.u5.testTurn_10>=1)))||((i2.u8.turn_5>=1)&&(i2.u27.testTurn_7>=1)))||((i2.u8.turn_4>=1)&&(i2.u27.testTurn_7>=1)))||((i0.u4.turn_0>=1)&&(i0.u4.testTurn_6>=1)))||((i2.u8.turn_4>=1)&&(i1.u5.testTurn_10>=1)))||((i4.u24.turn_9>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_5>=1)&&(i2.u7.testTurn_1>=1)))||((i0.u4.turn_3>=1)&&(i0.u6.testTurn_0>=1)))||((i0.u4.turn_0>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_1>=1)&&(i0.u9.testTurn_9>=1)))||((i2.u8.turn_6>=1)&&(i1.u5.testTurn_10>=1)))||((i0.u4.turn_1>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_9>=1)&&(i5.u29.testTurn_11>=1)))||((i0.u4.turn_2>=1)&&(i0.u6.testTurn_0>=1)))||((i2.u8.turn_6>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i4.u24.testTurn_2>=1)))||((i4.u24.turn_10>=1)&&(i4.u26.testTurn_5>=1)))||((i2.u8.turn_6>=1)&&(i2.u7.testTurn_1>=1)))))] = FALSE
(forward)formula 4,1,30.7246,720456,1,0,1.11402e+06,9404,5160,4.0375e+06,798,61098,3552855
FORMULA Peterson-COL-3-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(AG((((((((((((((((((((((((((((((((((((((i8.u43.wantSection_0>=1)&&(i5.u60.testAlone_44>=1))||((i11.u16.wantSection_2>=1)&&(i3.u39.testAlone_9>=1)))||((i6.u3.wantSection_4>=1)&&(i12.u64.testAlone_38>=1)))||((i11.u16.wantSection_2>=1)&&(i7.i1.u61.testAlone_5>=1)))||((i2.u1.wantSection_6>=1)&&(i14.i0.u33.testAlone_3>=1)))||((i11.u16.wantSection_2>=1)&&(i14.i1.u31.testAlone_1>=1)))||((i8.u43.wantSection_0>=1)&&(i2.u50.testAlone_28>=1)))||((i2.u1.wantSection_6>=1)&&(i6.u40.testAlone_11>=1)))||((i11.u16.wantSection_2>=1)&&(i15.u49.testAlone_25>=1)))||((i8.u43.wantSection_0>=1)&&(i4.u53.testAlone_32>=1)))||((i2.u1.wantSection_6>=1)&&(i7.i0.u37.testAlone_7>=1)))||((i8.u43.wantSection_0>=1)&&(i0.u56.testAlone_36>=1)))||((i2.u1.wantSection_6>=1)&&(i8.u63.testAlone_19>=1)))||((i6.u3.wantSection_4>=1)&&(i1.u59.testAlone_42>=1)))||((i8.u43.wantSection_0>=1)&&(i1.u19.testAlone_40>=1)))||((i2.u1.wantSection_6>=1)&&(i13.u13.testAlone_15>=1)))||((i6.u3.wantSection_4>=1)&&(i5.u22.testAlone_46>=1)))||((i8.u43.wantSection_0>=1)&&(i0.u41.testAlone_12>=1)))||((i2.u1.wantSection_6>=1)&&(i15.u15.testAlone_27>=1)))||((i6.u3.wantSection_4>=1)&&(i14.i0.u32.testAlone_2>=1)))||((i11.u16.wantSection_2>=1)&&(i1.u58.testAlone_41>=1)))||((i8.u43.wantSection_0>=1)&&(i2.u42.testAlone_16>=1)))||((i2.u1.wantSection_6>=1)&&(i9.u47.testAlone_23>=1)))||((i6.u3.wantSection_4>=1)&&(i7.i0.u36.testAlone_6>=1)))||((i11.u16.wantSection_2>=1)&&(i12.u18.testAlone_37>=1)))||((i8.u43.wantSection_0>=1)&&(i4.u44.testAlone_20>=1)))||((i2.u1.wantSection_6>=1)&&(i11.u55.testAlone_35>=1)))||((i11.u16.wantSection_2>=1)&&(i11.u54.testAlone_33>=1)))||((i8.u43.wantSection_0>=1)&&(i0.u48.testAlone_24>=1)))||((i2.u1.wantSection_6>=1)&&(i10.u52.testAlone_31>=1)))||((i11.u16.wantSection_2>=1)&&(i10.u51.testAlone_29>=1)))||((i6.u3.wantSection_4>=1)&&(i8.u14.testAlone_18>=1)))||((i6.u3.wantSection_4>=1)&&(i9.u46.testAlone_22>=1)))||((i6.u3.wantSection_4>=1)&&(i3.u11.testAlone_10>=1)))||((i6.u3.wantSection_4>=1)&&(i13.u62.testAlone_14>=1)))||((i11.u16.wantSection_2>=1)&&(i5.u21.testAlone_45>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((((((((((((((((((((((((((((((((((((i8.u43.wantSection_0>=1)&&(i5.u60.testAlone_44>=1))||((i11.u16.wantSection_2>=1)&&(i3.u39.testAlone_9>=1)))||((i6.u3.wantSection_4>=1)&&(i12.u64.testAlone_38>=1)))||((i11.u16.wantSection_2>=1)&&(i7.i1.u61.testAlone_5>=1)))||((i2.u1.wantSection_6>=1)&&(i14.i0.u33.testAlone_3>=1)))||((i11.u16.wantSection_2>=1)&&(i14.i1.u31.testAlone_1>=1)))||((i8.u43.wantSection_0>=1)&&(i2.u50.testAlone_28>=1)))||((i2.u1.wantSection_6>=1)&&(i6.u40.testAlone_11>=1)))||((i11.u16.wantSection_2>=1)&&(i15.u49.testAlone_25>=1)))||((i8.u43.wantSection_0>=1)&&(i4.u53.testAlone_32>=1)))||((i2.u1.wantSection_6>=1)&&(i7.i0.u37.testAlone_7>=1)))||((i8.u43.wantSection_0>=1)&&(i0.u56.testAlone_36>=1)))||((i2.u1.wantSection_6>=1)&&(i8.u63.testAlone_19>=1)))||((i6.u3.wantSection_4>=1)&&(i1.u59.testAlone_42>=1)))||((i8.u43.wantSection_0>=1)&&(i1.u19.testAlone_40>=1)))||((i2.u1.wantSection_6>=1)&&(i13.u13.testAlone_15>=1)))||((i6.u3.wantSection_4>=1)&&(i5.u22.testAlone_46>=1)))||((i8.u43.wantSection_0>=1)&&(i0.u41.testAlone_12>=1)))||((i2.u1.wantSection_6>=1)&&(i15.u15.testAlone_27>=1)))||((i6.u3.wantSection_4>=1)&&(i14.i0.u32.testAlone_2>=1)))||((i11.u16.wantSection_2>=1)&&(i1.u58.testAlone_41>=1)))||((i8.u43.wantSection_0>=1)&&(i2.u42.testAlone_16>=1)))||((i2.u1.wantSection_6>=1)&&(i9.u47.testAlone_23>=1)))||((i6.u3.wantSection_4>=1)&&(i7.i0.u36.testAlone_6>=1)))||((i11.u16.wantSection_2>=1)&&(i12.u18.testAlone_37>=1)))||((i8.u43.wantSection_0>=1)&&(i4.u44.testAlone_20>=1)))||((i2.u1.wantSection_6>=1)&&(i11.u55.testAlone_35>=1)))||((i11.u16.wantSection_2>=1)&&(i11.u54.testAlone_33>=1)))||((i8.u43.wantSection_0>=1)&&(i0.u48.testAlone_24>=1)))||((i2.u1.wantSection_6>=1)&&(i10.u52.testAlone_31>=1)))||((i11.u16.wantSection_2>=1)&&(i10.u51.testAlone_29>=1)))||((i6.u3.wantSection_4>=1)&&(i8.u14.testAlone_18>=1)))||((i6.u3.wantSection_4>=1)&&(i9.u46.testAlone_22>=1)))||((i6.u3.wantSection_4>=1)&&(i3.u11.testAlone_10>=1)))||((i6.u3.wantSection_4>=1)&&(i13.u62.testAlone_14>=1)))||((i11.u16.wantSection_2>=1)&&(i5.u21.testAlone_45>=1)))))))] != FALSE
(forward)formula 5,0,30.8606,723888,1,0,1.12063e+06,9404,5376,4.04877e+06,798,61098,3581446
FORMULA Peterson-COL-3-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG((((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17<1)&&(i2.u42.beginLoop_16<1))&&(i8.u63.beginLoop_19<1))&&(i8.u14.beginLoop_18<1))&&(i9.u45.beginLoop_21<1))&&(i4.u44.beginLoop_20<1))&&(i9.u47.beginLoop_23<1))&&(i9.u46.beginLoop_22<1))&&(i15.u49.beginLoop_25<1))&&(i0.u48.beginLoop_24<1))&&(i15.u15.beginLoop_27<1))&&(i15.u66.beginLoop_26<1))&&(i10.u51.beginLoop_29<1))&&(i2.u50.beginLoop_28<1))&&(i10.u52.beginLoop_31<1))&&(i10.u67.beginLoop_30<1))&&(i11.u54.beginLoop_33<1))&&(i4.u53.beginLoop_32<1))&&(i11.u55.beginLoop_35<1))&&(i11.u17.beginLoop_34<1))&&(i12.u18.beginLoop_37<1))&&(i0.u56.beginLoop_36<1))&&(i12.u57.beginLoop_39<1))&&(i12.u64.beginLoop_38<1))&&(i1.u58.beginLoop_41<1))&&(i1.u19.beginLoop_40<1))&&(i1.u20.beginLoop_43<1))&&(i1.u59.beginLoop_42<1))&&(i5.u21.beginLoop_45<1))&&(i5.u60.beginLoop_44<1))&&(i5.u23.beginLoop_47<1))&&(i5.u22.beginLoop_46<1))&&(i14.i1.u65.beginLoop_1<1))&&(i14.i1.u30.beginLoop_0<1))&&(i14.i0.u33.beginLoop_3<1))&&(i14.i0.u32.beginLoop_2<1))&&(i7.i1.u35.beginLoop_5<1))&&(i7.i1.u34.beginLoop_4<1))&&(i7.i0.u37.beginLoop_7<1))&&(i7.i0.u36.beginLoop_6<1))&&(i3.u10.beginLoop_9<1))&&(i3.u38.beginLoop_8<1))&&(i6.u40.beginLoop_11<1))&&(i3.u11.beginLoop_10<1))&&(i13.u12.beginLoop_13<1))&&(i0.u41.beginLoop_12<1))&&(i13.u13.beginLoop_15<1))&&(i13.u62.beginLoop_14<1))||(((((i6.u3.wantSection_5<1)||(i4.u28.CS_2<1))&&((i2.u1.wantSection_7<1)||(i5.u29.CS_3<1)))&&((i0.u2.wantSection_1<1)||(i4.u24.CS_0<1)))&&((i0.u0.wantSection_3<1)||(i4.u26.CS_1<1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17<1)&&(i2.u42.beginLoop_16<1))&&(i8.u63.beginLoop_19<1))&&(i8.u14.beginLoop_18<1))&&(i9.u45.beginLoop_21<1))&&(i4.u44.beginLoop_20<1))&&(i9.u47.beginLoop_23<1))&&(i9.u46.beginLoop_22<1))&&(i15.u49.beginLoop_25<1))&&(i0.u48.beginLoop_24<1))&&(i15.u15.beginLoop_27<1))&&(i15.u66.beginLoop_26<1))&&(i10.u51.beginLoop_29<1))&&(i2.u50.beginLoop_28<1))&&(i10.u52.beginLoop_31<1))&&(i10.u67.beginLoop_30<1))&&(i11.u54.beginLoop_33<1))&&(i4.u53.beginLoop_32<1))&&(i11.u55.beginLoop_35<1))&&(i11.u17.beginLoop_34<1))&&(i12.u18.beginLoop_37<1))&&(i0.u56.beginLoop_36<1))&&(i12.u57.beginLoop_39<1))&&(i12.u64.beginLoop_38<1))&&(i1.u58.beginLoop_41<1))&&(i1.u19.beginLoop_40<1))&&(i1.u20.beginLoop_43<1))&&(i1.u59.beginLoop_42<1))&&(i5.u21.beginLoop_45<1))&&(i5.u60.beginLoop_44<1))&&(i5.u23.beginLoop_47<1))&&(i5.u22.beginLoop_46<1))&&(i14.i1.u65.beginLoop_1<1))&&(i14.i1.u30.beginLoop_0<1))&&(i14.i0.u33.beginLoop_3<1))&&(i14.i0.u32.beginLoop_2<1))&&(i7.i1.u35.beginLoop_5<1))&&(i7.i1.u34.beginLoop_4<1))&&(i7.i0.u37.beginLoop_7<1))&&(i7.i0.u36.beginLoop_6<1))&&(i3.u10.beginLoop_9<1))&&(i3.u38.beginLoop_8<1))&&(i6.u40.beginLoop_11<1))&&(i3.u11.beginLoop_10<1))&&(i13.u12.beginLoop_13<1))&&(i0.u41.beginLoop_12<1))&&(i13.u13.beginLoop_15<1))&&(i13.u62.beginLoop_14<1))||(((((i6.u3.wantSection_5<1)||(i4.u28.CS_2<1))&&((i2.u1.wantSection_7<1)||(i5.u29.CS_3<1)))&&((i0.u2.wantSection_1<1)||(i4.u24.CS_0<1)))&&((i0.u0.wantSection_3<1)||(i4.u26.CS_1<1))))))] = FALSE
(forward)formula 6,0,30.9508,726528,1,0,1.12504e+06,9425,5671,4.0549e+06,798,61149,3604130
FORMULA Peterson-COL-3-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (AX(((((((((((((((((((((((((((((((((((((i8.u14.testIdentity_18>=1)||(i8.u63.testIdentity_19>=1))||(i2.u42.testIdentity_16>=1))||(i9.u46.testIdentity_22>=1))||(i9.u47.testIdentity_23>=1))||(i4.u44.testIdentity_20>=1))||(i15.u15.testIdentity_27>=1))||(i0.u48.testIdentity_24>=1))||(i15.u49.testIdentity_25>=1))||(i10.u52.testIdentity_31>=1))||(i2.u50.testIdentity_28>=1))||(i10.u51.testIdentity_29>=1))||(i11.u55.testIdentity_35>=1))||(i4.u53.testIdentity_32>=1))||(i11.u54.testIdentity_33>=1))||(i12.u64.testIdentity_38>=1))||(i0.u56.testIdentity_36>=1))||(i12.u18.testIdentity_37>=1))||(i1.u59.testIdentity_42>=1))||(i1.u19.testIdentity_40>=1))||(i1.u58.testIdentity_41>=1))||(i5.u22.testIdentity_46>=1))||(i5.u60.testIdentity_44>=1))||(i5.u21.testIdentity_45>=1))||(i14.i0.u32.testIdentity_2>=1))||(i14.i0.u33.testIdentity_3>=1))||(i14.i1.u31.testIdentity_1>=1))||(i7.i0.u36.testIdentity_6>=1))||(i7.i0.u37.testIdentity_7>=1))||(i7.i1.u61.testIdentity_5>=1))||(i3.u11.testIdentity_10>=1))||(i6.u40.testIdentity_11>=1))||(i3.u39.testIdentity_9>=1))||(i13.u62.testIdentity_14>=1))||(i13.u13.testIdentity_15>=1))||(i0.u41.testIdentity_12>=1))) + EG(((((((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17<1)&&(i2.u42.beginLoop_16<1))&&(i8.u63.beginLoop_19<1))&&(i8.u14.beginLoop_18<1))&&(i9.u45.beginLoop_21<1))&&(i4.u44.beginLoop_20<1))&&(i9.u47.beginLoop_23<1))&&(i9.u46.beginLoop_22<1))&&(i15.u49.beginLoop_25<1))&&(i0.u48.beginLoop_24<1))&&(i15.u15.beginLoop_27<1))&&(i15.u66.beginLoop_26<1))&&(i10.u51.beginLoop_29<1))&&(i2.u50.beginLoop_28<1))&&(i10.u52.beginLoop_31<1))&&(i10.u67.beginLoop_30<1))&&(i11.u54.beginLoop_33<1))&&(i4.u53.beginLoop_32<1))&&(i11.u55.beginLoop_35<1))&&(i11.u17.beginLoop_34<1))&&(i12.u18.beginLoop_37<1))&&(i0.u56.beginLoop_36<1))&&(i12.u57.beginLoop_39<1))&&(i12.u64.beginLoop_38<1))&&(i1.u58.beginLoop_41<1))&&(i1.u19.beginLoop_40<1))&&(i1.u20.beginLoop_43<1))&&(i1.u59.beginLoop_42<1))&&(i5.u21.beginLoop_45<1))&&(i5.u60.beginLoop_44<1))&&(i5.u23.beginLoop_47<1))&&(i5.u22.beginLoop_46<1))&&(i14.i1.u65.beginLoop_1<1))&&(i14.i1.u30.beginLoop_0<1))&&(i14.i0.u33.beginLoop_3<1))&&(i14.i0.u32.beginLoop_2<1))&&(i7.i1.u35.beginLoop_5<1))&&(i7.i1.u34.beginLoop_4<1))&&(i7.i0.u37.beginLoop_7<1))&&(i7.i0.u36.beginLoop_6<1))&&(i3.u10.beginLoop_9<1))&&(i3.u38.beginLoop_8<1))&&(i6.u40.beginLoop_11<1))&&(i3.u11.beginLoop_10<1))&&(i13.u12.beginLoop_13<1))&&(i0.u41.beginLoop_12<1))&&(i13.u13.beginLoop_15<1))&&(i13.u62.beginLoop_14<1))||((i6.u3.wantSection_5>=1)&&(i4.u28.CS_2>=1)))||((i2.u1.wantSection_7>=1)&&(i5.u29.CS_3>=1)))||((i0.u2.wantSection_1>=1)&&(i4.u24.CS_0>=1)))||((i0.u0.wantSection_3>=1)&&(i4.u26.CS_1>=1)))))
=> equivalent forward existential formula: [(EY((Init * !(EG(((((((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17<1)&&(i2.u42.beginLoop_16<1))&&(i8.u63.beginLoop_19<1))&&(i8.u14.beginLoop_18<1))&&(i9.u45.beginLoop_21<1))&&(i4.u44.beginLoop_20<1))&&(i9.u47.beginLoop_23<1))&&(i9.u46.beginLoop_22<1))&&(i15.u49.beginLoop_25<1))&&(i0.u48.beginLoop_24<1))&&(i15.u15.beginLoop_27<1))&&(i15.u66.beginLoop_26<1))&&(i10.u51.beginLoop_29<1))&&(i2.u50.beginLoop_28<1))&&(i10.u52.beginLoop_31<1))&&(i10.u67.beginLoop_30<1))&&(i11.u54.beginLoop_33<1))&&(i4.u53.beginLoop_32<1))&&(i11.u55.beginLoop_35<1))&&(i11.u17.beginLoop_34<1))&&(i12.u18.beginLoop_37<1))&&(i0.u56.beginLoop_36<1))&&(i12.u57.beginLoop_39<1))&&(i12.u64.beginLoop_38<1))&&(i1.u58.beginLoop_41<1))&&(i1.u19.beginLoop_40<1))&&(i1.u20.beginLoop_43<1))&&(i1.u59.beginLoop_42<1))&&(i5.u21.beginLoop_45<1))&&(i5.u60.beginLoop_44<1))&&(i5.u23.beginLoop_47<1))&&(i5.u22.beginLoop_46<1))&&(i14.i1.u65.beginLoop_1<1))&&(i14.i1.u30.beginLoop_0<1))&&(i14.i0.u33.beginLoop_3<1))&&(i14.i0.u32.beginLoop_2<1))&&(i7.i1.u35.beginLoop_5<1))&&(i7.i1.u34.beginLoop_4<1))&&(i7.i0.u37.beginLoop_7<1))&&(i7.i0.u36.beginLoop_6<1))&&(i3.u10.beginLoop_9<1))&&(i3.u38.beginLoop_8<1))&&(i6.u40.beginLoop_11<1))&&(i3.u11.beginLoop_10<1))&&(i13.u12.beginLoop_13<1))&&(i0.u41.beginLoop_12<1))&&(i13.u13.beginLoop_15<1))&&(i13.u62.beginLoop_14<1))||((i6.u3.wantSection_5>=1)&&(i4.u28.CS_2>=1)))||((i2.u1.wantSection_7>=1)&&(i5.u29.CS_3>=1)))||((i0.u2.wantSection_1>=1)&&(i4.u24.CS_0>=1)))||((i0.u0.wantSection_3>=1)&&(i4.u26.CS_1>=1))))))) * !(((((((((((((((((((((((((((((((((((((i8.u14.testIdentity_18>=1)||(i8.u63.testIdentity_19>=1))||(i2.u42.testIdentity_16>=1))||(i9.u46.testIdentity_22>=1))||(i9.u47.testIdentity_23>=1))||(i4.u44.testIdentity_20>=1))||(i15.u15.testIdentity_27>=1))||(i0.u48.testIdentity_24>=1))||(i15.u49.testIdentity_25>=1))||(i10.u52.testIdentity_31>=1))||(i2.u50.testIdentity_28>=1))||(i10.u51.testIdentity_29>=1))||(i11.u55.testIdentity_35>=1))||(i4.u53.testIdentity_32>=1))||(i11.u54.testIdentity_33>=1))||(i12.u64.testIdentity_38>=1))||(i0.u56.testIdentity_36>=1))||(i12.u18.testIdentity_37>=1))||(i1.u59.testIdentity_42>=1))||(i1.u19.testIdentity_40>=1))||(i1.u58.testIdentity_41>=1))||(i5.u22.testIdentity_46>=1))||(i5.u60.testIdentity_44>=1))||(i5.u21.testIdentity_45>=1))||(i14.i0.u32.testIdentity_2>=1))||(i14.i0.u33.testIdentity_3>=1))||(i14.i1.u31.testIdentity_1>=1))||(i7.i0.u36.testIdentity_6>=1))||(i7.i0.u37.testIdentity_7>=1))||(i7.i1.u61.testIdentity_5>=1))||(i3.u11.testIdentity_10>=1))||(i6.u40.testIdentity_11>=1))||(i3.u39.testIdentity_9>=1))||(i13.u62.testIdentity_14>=1))||(i13.u13.testIdentity_15>=1))||(i0.u41.testIdentity_12>=1))))] = FALSE
(forward)formula 7,1,36.8697,858792,1,0,1.33426e+06,9602,5711,4.53067e+06,798,62241,4249747
FORMULA Peterson-COL-3-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EG(EF((((((((((((((i0.u6.isEndLoop_3>=1)||(i2.u8.isEndLoop_19>=1))||(i12.u57.isEndLoop_39>=1))||(i2.u7.isEndLoop_7>=1))||(i4.u26.isEndLoop_23>=1))||(i4.u28.isEndLoop_35>=1))||(i0.u4.isEndLoop_27>=1))||(i4.u24.isEndLoop_11>=1))||(i5.u23.isEndLoop_47>=1))||(i0.u25.isEndLoop_15>=1))||(i2.u27.isEndLoop_31>=1))||(i1.u20.isEndLoop_43>=1))&&(((((((((((((((((((((((((((((((((((((i2.u8.turn_7>=1)&&(i2.u27.testTurn_7>=1))||((i0.u4.turn_2>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_2>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_11>=1)&&(i4.u24.testTurn_2>=1)))||((i0.u4.turn_1>=1)&&(i0.u6.testTurn_0>=1)))||((i4.u24.turn_11>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_7>=1)&&(i2.u8.testTurn_4>=1)))||((i2.u8.turn_7>=1)&&(i2.u7.testTurn_1>=1)))||((i4.u24.turn_11>=1)&&(i4.u26.testTurn_5>=1)))||((i0.u4.turn_3>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_8>=1)&&(i4.u26.testTurn_5>=1)))||((i4.u24.turn_8>=1)&&(i4.u28.testTurn_8>=1)))||((i0.u4.turn_0>=1)&&(i0.u25.testTurn_3>=1)))||((i0.u4.turn_3>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_8>=1)&&(i5.u29.testTurn_11>=1)))||((i4.u24.turn_9>=1)&&(i4.u24.testTurn_2>=1)))||((i2.u8.turn_4>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i5.u29.testTurn_11>=1)))||((i2.u8.turn_5>=1)&&(i1.u5.testTurn_10>=1)))||((i2.u8.turn_5>=1)&&(i2.u27.testTurn_7>=1)))||((i2.u8.turn_4>=1)&&(i2.u27.testTurn_7>=1)))||((i0.u4.turn_0>=1)&&(i0.u4.testTurn_6>=1)))||((i2.u8.turn_4>=1)&&(i1.u5.testTurn_10>=1)))||((i4.u24.turn_9>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_5>=1)&&(i2.u7.testTurn_1>=1)))||((i0.u4.turn_3>=1)&&(i0.u6.testTurn_0>=1)))||((i0.u4.turn_0>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_1>=1)&&(i0.u9.testTurn_9>=1)))||((i2.u8.turn_6>=1)&&(i1.u5.testTurn_10>=1)))||((i0.u4.turn_1>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_9>=1)&&(i5.u29.testTurn_11>=1)))||((i0.u4.turn_2>=1)&&(i0.u6.testTurn_0>=1)))||((i2.u8.turn_6>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i4.u24.testTurn_2>=1)))||((i4.u24.turn_10>=1)&&(i4.u26.testTurn_5>=1)))||((i2.u8.turn_6>=1)&&(i2.u7.testTurn_1>=1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((((((((((((i0.u6.isEndLoop_3>=1)||(i2.u8.isEndLoop_19>=1))||(i12.u57.isEndLoop_39>=1))||(i2.u7.isEndLoop_7>=1))||(i4.u26.isEndLoop_23>=1))||(i4.u28.isEndLoop_35>=1))||(i0.u4.isEndLoop_27>=1))||(i4.u24.isEndLoop_11>=1))||(i5.u23.isEndLoop_47>=1))||(i0.u25.isEndLoop_15>=1))||(i2.u27.isEndLoop_31>=1))||(i1.u20.isEndLoop_43>=1))&&(((((((((((((((((((((((((((((((((((((i2.u8.turn_7>=1)&&(i2.u27.testTurn_7>=1))||((i0.u4.turn_2>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_2>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_11>=1)&&(i4.u24.testTurn_2>=1)))||((i0.u4.turn_1>=1)&&(i0.u6.testTurn_0>=1)))||((i4.u24.turn_11>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_7>=1)&&(i2.u8.testTurn_4>=1)))||((i2.u8.turn_7>=1)&&(i2.u7.testTurn_1>=1)))||((i4.u24.turn_11>=1)&&(i4.u26.testTurn_5>=1)))||((i0.u4.turn_3>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_8>=1)&&(i4.u26.testTurn_5>=1)))||((i4.u24.turn_8>=1)&&(i4.u28.testTurn_8>=1)))||((i0.u4.turn_0>=1)&&(i0.u25.testTurn_3>=1)))||((i0.u4.turn_3>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_8>=1)&&(i5.u29.testTurn_11>=1)))||((i4.u24.turn_9>=1)&&(i4.u24.testTurn_2>=1)))||((i2.u8.turn_4>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i5.u29.testTurn_11>=1)))||((i2.u8.turn_5>=1)&&(i1.u5.testTurn_10>=1)))||((i2.u8.turn_5>=1)&&(i2.u27.testTurn_7>=1)))||((i2.u8.turn_4>=1)&&(i2.u27.testTurn_7>=1)))||((i0.u4.turn_0>=1)&&(i0.u4.testTurn_6>=1)))||((i2.u8.turn_4>=1)&&(i1.u5.testTurn_10>=1)))||((i4.u24.turn_9>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_5>=1)&&(i2.u7.testTurn_1>=1)))||((i0.u4.turn_3>=1)&&(i0.u6.testTurn_0>=1)))||((i0.u4.turn_0>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_1>=1)&&(i0.u9.testTurn_9>=1)))||((i2.u8.turn_6>=1)&&(i1.u5.testTurn_10>=1)))||((i0.u4.turn_1>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_9>=1)&&(i5.u29.testTurn_11>=1)))||((i0.u4.turn_2>=1)&&(i0.u6.testTurn_0>=1)))||((i2.u8.turn_6>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i4.u24.testTurn_2>=1)))||((i4.u24.turn_10>=1)&&(i4.u26.testTurn_5>=1)))||((i2.u8.turn_6>=1)&&(i2.u7.testTurn_1>=1))))))] != FALSE
(forward)formula 8,1,53.9966,1243104,1,0,1.94494e+06,9922,5794,6.98548e+06,802,66589,5425271
FORMULA Peterson-COL-3-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(AG(((((((((((((((((((((((((((((((((((((((((((((((((i8.u14.testIdentity_18>=1)||(i8.u63.testIdentity_19>=1))||(i2.u42.testIdentity_16>=1))||(i9.u46.testIdentity_22>=1))||(i9.u47.testIdentity_23>=1))||(i4.u44.testIdentity_20>=1))||(i15.u15.testIdentity_27>=1))||(i0.u48.testIdentity_24>=1))||(i15.u49.testIdentity_25>=1))||(i10.u52.testIdentity_31>=1))||(i2.u50.testIdentity_28>=1))||(i10.u51.testIdentity_29>=1))||(i11.u55.testIdentity_35>=1))||(i4.u53.testIdentity_32>=1))||(i11.u54.testIdentity_33>=1))||(i12.u64.testIdentity_38>=1))||(i0.u56.testIdentity_36>=1))||(i12.u18.testIdentity_37>=1))||(i1.u59.testIdentity_42>=1))||(i1.u19.testIdentity_40>=1))||(i1.u58.testIdentity_41>=1))||(i5.u22.testIdentity_46>=1))||(i5.u60.testIdentity_44>=1))||(i5.u21.testIdentity_45>=1))||(i14.i0.u32.testIdentity_2>=1))||(i14.i0.u33.testIdentity_3>=1))||(i14.i1.u31.testIdentity_1>=1))||(i7.i0.u36.testIdentity_6>=1))||(i7.i0.u37.testIdentity_7>=1))||(i7.i1.u61.testIdentity_5>=1))||(i3.u11.testIdentity_10>=1))||(i6.u40.testIdentity_11>=1))||(i3.u39.testIdentity_9>=1))||(i13.u62.testIdentity_14>=1))||(i13.u13.testIdentity_15>=1))||(i0.u41.testIdentity_12>=1))||(i11.u17.testIdentity_34>=1))||(i14.i1.u30.testIdentity_0>=1))||(i8.u14.testIdentity_17>=1))||(i12.u57.testIdentity_39>=1))||(i7.i1.u34.testIdentity_4>=1))||(i9.u45.testIdentity_21>=1))||(i15.u66.testIdentity_26>=1))||(i1.u20.testIdentity_43>=1))||(i3.u38.testIdentity_8>=1))||(i10.u67.testIdentity_30>=1))||(i5.u23.testIdentity_47>=1))||(i13.u12.testIdentity_13>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((((((((((((((((((((((((((((((((((((((((((((((((i8.u14.testIdentity_18>=1)||(i8.u63.testIdentity_19>=1))||(i2.u42.testIdentity_16>=1))||(i9.u46.testIdentity_22>=1))||(i9.u47.testIdentity_23>=1))||(i4.u44.testIdentity_20>=1))||(i15.u15.testIdentity_27>=1))||(i0.u48.testIdentity_24>=1))||(i15.u49.testIdentity_25>=1))||(i10.u52.testIdentity_31>=1))||(i2.u50.testIdentity_28>=1))||(i10.u51.testIdentity_29>=1))||(i11.u55.testIdentity_35>=1))||(i4.u53.testIdentity_32>=1))||(i11.u54.testIdentity_33>=1))||(i12.u64.testIdentity_38>=1))||(i0.u56.testIdentity_36>=1))||(i12.u18.testIdentity_37>=1))||(i1.u59.testIdentity_42>=1))||(i1.u19.testIdentity_40>=1))||(i1.u58.testIdentity_41>=1))||(i5.u22.testIdentity_46>=1))||(i5.u60.testIdentity_44>=1))||(i5.u21.testIdentity_45>=1))||(i14.i0.u32.testIdentity_2>=1))||(i14.i0.u33.testIdentity_3>=1))||(i14.i1.u31.testIdentity_1>=1))||(i7.i0.u36.testIdentity_6>=1))||(i7.i0.u37.testIdentity_7>=1))||(i7.i1.u61.testIdentity_5>=1))||(i3.u11.testIdentity_10>=1))||(i6.u40.testIdentity_11>=1))||(i3.u39.testIdentity_9>=1))||(i13.u62.testIdentity_14>=1))||(i13.u13.testIdentity_15>=1))||(i0.u41.testIdentity_12>=1))||(i11.u17.testIdentity_34>=1))||(i14.i1.u30.testIdentity_0>=1))||(i8.u14.testIdentity_17>=1))||(i12.u57.testIdentity_39>=1))||(i7.i1.u34.testIdentity_4>=1))||(i9.u45.testIdentity_21>=1))||(i15.u66.testIdentity_26>=1))||(i1.u20.testIdentity_43>=1))||(i3.u38.testIdentity_8>=1))||(i10.u67.testIdentity_30>=1))||(i5.u23.testIdentity_47>=1))||(i13.u12.testIdentity_13>=1))))))] != FALSE
(forward)formula 9,0,54.104,1244952,1,0,1.9476e+06,9922,5849,6.98757e+06,802,66593,5436222
FORMULA Peterson-COL-3-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: A(((((((((((((((((((((((((((((((((((((i14.i0.u33.isEndLoop_2<1)&&(i14.i0.u32.isEndLoop_1<1))&&(i14.i1.u65.isEndLoop_0<1))&&(i7.i0.u37.isEndLoop_6<1))&&(i7.i0.u36.isEndLoop_5<1))&&(i7.i1.u35.isEndLoop_4<1))&&(i6.u40.isEndLoop_10<1))&&(i3.u11.isEndLoop_9<1))&&(i3.u10.isEndLoop_8<1))&&(i13.u13.isEndLoop_14<1))&&(i13.u12.isEndLoop_13<1))&&(i13.u12.isEndLoop_12<1))&&(i8.u63.isEndLoop_18<1))&&(i8.u14.isEndLoop_17<1))&&(i8.u43.isEndLoop_16<1))&&(i9.u47.isEndLoop_22<1))&&(i9.u46.isEndLoop_21<1))&&(i9.u45.isEndLoop_20<1))&&(i15.u66.isEndLoop_26<1))&&(i15.u66.isEndLoop_25<1))&&(i15.u49.isEndLoop_24<1))&&(i10.u67.isEndLoop_30<1))&&(i10.u67.isEndLoop_29<1))&&(i10.u51.isEndLoop_28<1))&&(i12.u18.isEndLoop_36<1))&&(i12.u64.isEndLoop_37<1))&&(i12.u57.isEndLoop_38<1))&&(i11.u54.isEndLoop_32<1))&&(i11.u16.isEndLoop_33<1))&&(i11.u17.isEndLoop_34<1))&&(i5.u21.isEndLoop_44<1))&&(i5.u22.isEndLoop_45<1))&&(i5.u23.isEndLoop_46<1))&&(i1.u58.isEndLoop_40<1))&&(i1.u59.isEndLoop_41<1))&&(i1.u20.isEndLoop_42<1)) U ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17>=1)||(i2.u42.beginLoop_16>=1))||(i8.u63.beginLoop_19>=1))||(i8.u14.beginLoop_18>=1))||(i9.u45.beginLoop_21>=1))||(i4.u44.beginLoop_20>=1))||(i9.u47.beginLoop_23>=1))||(i9.u46.beginLoop_22>=1))||(i15.u49.beginLoop_25>=1))||(i0.u48.beginLoop_24>=1))||(i15.u15.beginLoop_27>=1))||(i15.u66.beginLoop_26>=1))||(i10.u51.beginLoop_29>=1))||(i2.u50.beginLoop_28>=1))||(i10.u52.beginLoop_31>=1))||(i10.u67.beginLoop_30>=1))||(i11.u54.beginLoop_33>=1))||(i4.u53.beginLoop_32>=1))||(i11.u55.beginLoop_35>=1))||(i11.u17.beginLoop_34>=1))||(i12.u18.beginLoop_37>=1))||(i0.u56.beginLoop_36>=1))||(i12.u57.beginLoop_39>=1))||(i12.u64.beginLoop_38>=1))||(i1.u58.beginLoop_41>=1))||(i1.u19.beginLoop_40>=1))||(i1.u20.beginLoop_43>=1))||(i1.u59.beginLoop_42>=1))||(i5.u21.beginLoop_45>=1))||(i5.u60.beginLoop_44>=1))||(i5.u23.beginLoop_47>=1))||(i5.u22.beginLoop_46>=1))||(i14.i1.u65.beginLoop_1>=1))||(i14.i1.u30.beginLoop_0>=1))||(i14.i0.u33.beginLoop_3>=1))||(i14.i0.u32.beginLoop_2>=1))||(i7.i1.u35.beginLoop_5>=1))||(i7.i1.u34.beginLoop_4>=1))||(i7.i0.u37.beginLoop_7>=1))||(i7.i0.u36.beginLoop_6>=1))||(i3.u10.beginLoop_9>=1))||(i3.u38.beginLoop_8>=1))||(i6.u40.beginLoop_11>=1))||(i3.u11.beginLoop_10>=1))||(i13.u12.beginLoop_13>=1))||(i0.u41.beginLoop_12>=1))||(i13.u13.beginLoop_15>=1))||(i13.u62.beginLoop_14>=1))||((i2.u1.wantSection_7>=1)&&(i7.i0.u37.testAlone_7>=1)))||((i6.u3.wantSection_5>=1)&&(i5.u22.testAlone_46>=1)))||((i6.u3.wantSection_5>=1)&&(i1.u59.testAlone_42>=1)))||((i2.u1.wantSection_7>=1)&&(i6.u40.testAlone_11>=1)))||((i2.u1.wantSection_7>=1)&&(i13.u13.testAlone_15>=1)))||((i0.u0.wantSection_3>=1)&&(i3.u39.testAlone_9>=1)))||((i2.u1.wantSection_7>=1)&&(i8.u63.testAlone_19>=1)))||((i0.u2.wantSection_1>=1)&&(i5.u60.testAlone_44>=1)))||((i0.u0.wantSection_3>=1)&&(i14.i1.u31.testAlone_1>=1)))||((i0.u2.wantSection_1>=1)&&(i1.u19.testAlone_40>=1)))||((i0.u0.wantSection_3>=1)&&(i7.i1.u61.testAlone_5>=1)))||((i0.u2.wantSection_1>=1)&&(i0.u56.testAlone_36>=1)))||((i6.u3.wantSection_5>=1)&&(i12.u64.testAlone_38>=1)))||((i0.u2.wantSection_1>=1)&&(i4.u53.testAlone_32>=1)))||((i2.u1.wantSection_7>=1)&&(i14.i0.u33.testAlone_3>=1)))||((i0.u2.wantSection_1>=1)&&(i2.u50.testAlone_28>=1)))||((i6.u3.wantSection_5>=1)&&(i13.u62.testAlone_14>=1)))||((i0.u2.wantSection_1>=1)&&(i0.u48.testAlone_24>=1)))||((i6.u3.wantSection_5>=1)&&(i3.u11.testAlone_10>=1)))||((i0.u2.wantSection_1>=1)&&(i4.u44.testAlone_20>=1)))||((i6.u3.wantSection_5>=1)&&(i9.u46.testAlone_22>=1)))||((i0.u0.wantSection_3>=1)&&(i1.u58.testAlone_41>=1)))||((i0.u2.wantSection_1>=1)&&(i2.u42.testAlone_16>=1)))||((i6.u3.wantSection_5>=1)&&(i8.u14.testAlone_18>=1)))||((i0.u0.wantSection_3>=1)&&(i5.u21.testAlone_45>=1)))||((i0.u2.wantSection_1>=1)&&(i0.u41.testAlone_12>=1)))||((i2.u1.wantSection_7>=1)&&(i9.u47.testAlone_23>=1)))||((i0.u0.wantSection_3>=1)&&(i11.u54.testAlone_33>=1)))||((i2.u1.wantSection_7>=1)&&(i15.u15.testAlone_27>=1)))||((i0.u0.wantSection_3>=1)&&(i12.u18.testAlone_37>=1)))||((i6.u3.wantSection_5>=1)&&(i7.i0.u36.testAlone_6>=1)))||((i2.u1.wantSection_7>=1)&&(i10.u52.testAlone_31>=1)))||((i0.u0.wantSection_3>=1)&&(i15.u49.testAlone_25>=1)))||((i6.u3.wantSection_5>=1)&&(i14.i0.u32.testAlone_2>=1)))||((i2.u1.wantSection_7>=1)&&(i11.u55.testAlone_35>=1)))||((i0.u0.wantSection_3>=1)&&(i10.u51.testAlone_29>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17>=1)||(i2.u42.beginLoop_16>=1))||(i8.u63.beginLoop_19>=1))||(i8.u14.beginLoop_18>=1))||(i9.u45.beginLoop_21>=1))||(i4.u44.beginLoop_20>=1))||(i9.u47.beginLoop_23>=1))||(i9.u46.beginLoop_22>=1))||(i15.u49.beginLoop_25>=1))||(i0.u48.beginLoop_24>=1))||(i15.u15.beginLoop_27>=1))||(i15.u66.beginLoop_26>=1))||(i10.u51.beginLoop_29>=1))||(i2.u50.beginLoop_28>=1))||(i10.u52.beginLoop_31>=1))||(i10.u67.beginLoop_30>=1))||(i11.u54.beginLoop_33>=1))||(i4.u53.beginLoop_32>=1))||(i11.u55.beginLoop_35>=1))||(i11.u17.beginLoop_34>=1))||(i12.u18.beginLoop_37>=1))||(i0.u56.beginLoop_36>=1))||(i12.u57.beginLoop_39>=1))||(i12.u64.beginLoop_38>=1))||(i1.u58.beginLoop_41>=1))||(i1.u19.beginLoop_40>=1))||(i1.u20.beginLoop_43>=1))||(i1.u59.beginLoop_42>=1))||(i5.u21.beginLoop_45>=1))||(i5.u60.beginLoop_44>=1))||(i5.u23.beginLoop_47>=1))||(i5.u22.beginLoop_46>=1))||(i14.i1.u65.beginLoop_1>=1))||(i14.i1.u30.beginLoop_0>=1))||(i14.i0.u33.beginLoop_3>=1))||(i14.i0.u32.beginLoop_2>=1))||(i7.i1.u35.beginLoop_5>=1))||(i7.i1.u34.beginLoop_4>=1))||(i7.i0.u37.beginLoop_7>=1))||(i7.i0.u36.beginLoop_6>=1))||(i3.u10.beginLoop_9>=1))||(i3.u38.beginLoop_8>=1))||(i6.u40.beginLoop_11>=1))||(i3.u11.beginLoop_10>=1))||(i13.u12.beginLoop_13>=1))||(i0.u41.beginLoop_12>=1))||(i13.u13.beginLoop_15>=1))||(i13.u62.beginLoop_14>=1))||((i2.u1.wantSection_7>=1)&&(i7.i0.u37.testAlone_7>=1)))||((i6.u3.wantSection_5>=1)&&(i5.u22.testAlone_46>=1)))||((i6.u3.wantSection_5>=1)&&(i1.u59.testAlone_42>=1)))||((i2.u1.wantSection_7>=1)&&(i6.u40.testAlone_11>=1)))||((i2.u1.wantSection_7>=1)&&(i13.u13.testAlone_15>=1)))||((i0.u0.wantSection_3>=1)&&(i3.u39.testAlone_9>=1)))||((i2.u1.wantSection_7>=1)&&(i8.u63.testAlone_19>=1)))||((i0.u2.wantSection_1>=1)&&(i5.u60.testAlone_44>=1)))||((i0.u0.wantSection_3>=1)&&(i14.i1.u31.testAlone_1>=1)))||((i0.u2.wantSection_1>=1)&&(i1.u19.testAlone_40>=1)))||((i0.u0.wantSection_3>=1)&&(i7.i1.u61.testAlone_5>=1)))||((i0.u2.wantSection_1>=1)&&(i0.u56.testAlone_36>=1)))||((i6.u3.wantSection_5>=1)&&(i12.u64.testAlone_38>=1)))||((i0.u2.wantSection_1>=1)&&(i4.u53.testAlone_32>=1)))||((i2.u1.wantSection_7>=1)&&(i14.i0.u33.testAlone_3>=1)))||((i0.u2.wantSection_1>=1)&&(i2.u50.testAlone_28>=1)))||((i6.u3.wantSection_5>=1)&&(i13.u62.testAlone_14>=1)))||((i0.u2.wantSection_1>=1)&&(i0.u48.testAlone_24>=1)))||((i6.u3.wantSection_5>=1)&&(i3.u11.testAlone_10>=1)))||((i0.u2.wantSection_1>=1)&&(i4.u44.testAlone_20>=1)))||((i6.u3.wantSection_5>=1)&&(i9.u46.testAlone_22>=1)))||((i0.u0.wantSection_3>=1)&&(i1.u58.testAlone_41>=1)))||((i0.u2.wantSection_1>=1)&&(i2.u42.testAlone_16>=1)))||((i6.u3.wantSection_5>=1)&&(i8.u14.testAlone_18>=1)))||((i0.u0.wantSection_3>=1)&&(i5.u21.testAlone_45>=1)))||((i0.u2.wantSection_1>=1)&&(i0.u41.testAlone_12>=1)))||((i2.u1.wantSection_7>=1)&&(i9.u47.testAlone_23>=1)))||((i0.u0.wantSection_3>=1)&&(i11.u54.testAlone_33>=1)))||((i2.u1.wantSection_7>=1)&&(i15.u15.testAlone_27>=1)))||((i0.u0.wantSection_3>=1)&&(i12.u18.testAlone_37>=1)))||((i6.u3.wantSection_5>=1)&&(i7.i0.u36.testAlone_6>=1)))||((i2.u1.wantSection_7>=1)&&(i10.u52.testAlone_31>=1)))||((i0.u0.wantSection_3>=1)&&(i15.u49.testAlone_25>=1)))||((i6.u3.wantSection_5>=1)&&(i14.i0.u32.testAlone_2>=1)))||((i2.u1.wantSection_7>=1)&&(i11.u55.testAlone_35>=1)))||((i0.u0.wantSection_3>=1)&&(i10.u51.testAlone_29>=1))))))) * !(E(!(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17>=1)||(i2.u42.beginLoop_16>=1))||(i8.u63.beginLoop_19>=1))||(i8.u14.beginLoop_18>=1))||(i9.u45.beginLoop_21>=1))||(i4.u44.beginLoop_20>=1))||(i9.u47.beginLoop_23>=1))||(i9.u46.beginLoop_22>=1))||(i15.u49.beginLoop_25>=1))||(i0.u48.beginLoop_24>=1))||(i15.u15.beginLoop_27>=1))||(i15.u66.beginLoop_26>=1))||(i10.u51.beginLoop_29>=1))||(i2.u50.beginLoop_28>=1))||(i10.u52.beginLoop_31>=1))||(i10.u67.beginLoop_30>=1))||(i11.u54.beginLoop_33>=1))||(i4.u53.beginLoop_32>=1))||(i11.u55.beginLoop_35>=1))||(i11.u17.beginLoop_34>=1))||(i12.u18.beginLoop_37>=1))||(i0.u56.beginLoop_36>=1))||(i12.u57.beginLoop_39>=1))||(i12.u64.beginLoop_38>=1))||(i1.u58.beginLoop_41>=1))||(i1.u19.beginLoop_40>=1))||(i1.u20.beginLoop_43>=1))||(i1.u59.beginLoop_42>=1))||(i5.u21.beginLoop_45>=1))||(i5.u60.beginLoop_44>=1))||(i5.u23.beginLoop_47>=1))||(i5.u22.beginLoop_46>=1))||(i14.i1.u65.beginLoop_1>=1))||(i14.i1.u30.beginLoop_0>=1))||(i14.i0.u33.beginLoop_3>=1))||(i14.i0.u32.beginLoop_2>=1))||(i7.i1.u35.beginLoop_5>=1))||(i7.i1.u34.beginLoop_4>=1))||(i7.i0.u37.beginLoop_7>=1))||(i7.i0.u36.beginLoop_6>=1))||(i3.u10.beginLoop_9>=1))||(i3.u38.beginLoop_8>=1))||(i6.u40.beginLoop_11>=1))||(i3.u11.beginLoop_10>=1))||(i13.u12.beginLoop_13>=1))||(i0.u41.beginLoop_12>=1))||(i13.u13.beginLoop_15>=1))||(i13.u62.beginLoop_14>=1))||((i2.u1.wantSection_7>=1)&&(i7.i0.u37.testAlone_7>=1)))||((i6.u3.wantSection_5>=1)&&(i5.u22.testAlone_46>=1)))||((i6.u3.wantSection_5>=1)&&(i1.u59.testAlone_42>=1)))||((i2.u1.wantSection_7>=1)&&(i6.u40.testAlone_11>=1)))||((i2.u1.wantSection_7>=1)&&(i13.u13.testAlone_15>=1)))||((i0.u0.wantSection_3>=1)&&(i3.u39.testAlone_9>=1)))||((i2.u1.wantSection_7>=1)&&(i8.u63.testAlone_19>=1)))||((i0.u2.wantSection_1>=1)&&(i5.u60.testAlone_44>=1)))||((i0.u0.wantSection_3>=1)&&(i14.i1.u31.testAlone_1>=1)))||((i0.u2.wantSection_1>=1)&&(i1.u19.testAlone_40>=1)))||((i0.u0.wantSection_3>=1)&&(i7.i1.u61.testAlone_5>=1)))||((i0.u2.wantSection_1>=1)&&(i0.u56.testAlone_36>=1)))||((i6.u3.wantSection_5>=1)&&(i12.u64.testAlone_38>=1)))||((i0.u2.wantSection_1>=1)&&(i4.u53.testAlone_32>=1)))||((i2.u1.wantSection_7>=1)&&(i14.i0.u33.testAlone_3>=1)))||((i0.u2.wantSection_1>=1)&&(i2.u50.testAlone_28>=1)))||((i6.u3.wantSection_5>=1)&&(i13.u62.testAlone_14>=1)))||((i0.u2.wantSection_1>=1)&&(i0.u48.testAlone_24>=1)))||((i6.u3.wantSection_5>=1)&&(i3.u11.testAlone_10>=1)))||((i0.u2.wantSection_1>=1)&&(i4.u44.testAlone_20>=1)))||((i6.u3.wantSection_5>=1)&&(i9.u46.testAlone_22>=1)))||((i0.u0.wantSection_3>=1)&&(i1.u58.testAlone_41>=1)))||((i0.u2.wantSection_1>=1)&&(i2.u42.testAlone_16>=1)))||((i6.u3.wantSection_5>=1)&&(i8.u14.testAlone_18>=1)))||((i0.u0.wantSection_3>=1)&&(i5.u21.testAlone_45>=1)))||((i0.u2.wantSection_1>=1)&&(i0.u41.testAlone_12>=1)))||((i2.u1.wantSection_7>=1)&&(i9.u47.testAlone_23>=1)))||((i0.u0.wantSection_3>=1)&&(i11.u54.testAlone_33>=1)))||((i2.u1.wantSection_7>=1)&&(i15.u15.testAlone_27>=1)))||((i0.u0.wantSection_3>=1)&&(i12.u18.testAlone_37>=1)))||((i6.u3.wantSection_5>=1)&&(i7.i0.u36.testAlone_6>=1)))||((i2.u1.wantSection_7>=1)&&(i10.u52.testAlone_31>=1)))||((i0.u0.wantSection_3>=1)&&(i15.u49.testAlone_25>=1)))||((i6.u3.wantSection_5>=1)&&(i14.i0.u32.testAlone_2>=1)))||((i2.u1.wantSection_7>=1)&&(i11.u55.testAlone_35>=1)))||((i0.u0.wantSection_3>=1)&&(i10.u51.testAlone_29>=1)))) U (!(((((((((((((((((((((((((((((((((((((i14.i0.u33.isEndLoop_2<1)&&(i14.i0.u32.isEndLoop_1<1))&&(i14.i1.u65.isEndLoop_0<1))&&(i7.i0.u37.isEndLoop_6<1))&&(i7.i0.u36.isEndLoop_5<1))&&(i7.i1.u35.isEndLoop_4<1))&&(i6.u40.isEndLoop_10<1))&&(i3.u11.isEndLoop_9<1))&&(i3.u10.isEndLoop_8<1))&&(i13.u13.isEndLoop_14<1))&&(i13.u12.isEndLoop_13<1))&&(i13.u12.isEndLoop_12<1))&&(i8.u63.isEndLoop_18<1))&&(i8.u14.isEndLoop_17<1))&&(i8.u43.isEndLoop_16<1))&&(i9.u47.isEndLoop_22<1))&&(i9.u46.isEndLoop_21<1))&&(i9.u45.isEndLoop_20<1))&&(i15.u66.isEndLoop_26<1))&&(i15.u66.isEndLoop_25<1))&&(i15.u49.isEndLoop_24<1))&&(i10.u67.isEndLoop_30<1))&&(i10.u67.isEndLoop_29<1))&&(i10.u51.isEndLoop_28<1))&&(i12.u18.isEndLoop_36<1))&&(i12.u64.isEndLoop_37<1))&&(i12.u57.isEndLoop_38<1))&&(i11.u54.isEndLoop_32<1))&&(i11.u16.isEndLoop_33<1))&&(i11.u17.isEndLoop_34<1))&&(i5.u21.isEndLoop_44<1))&&(i5.u22.isEndLoop_45<1))&&(i5.u23.isEndLoop_46<1))&&(i1.u58.isEndLoop_40<1))&&(i1.u59.isEndLoop_41<1))&&(i1.u20.isEndLoop_42<1))) * !(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17>=1)||(i2.u42.beginLoop_16>=1))||(i8.u63.beginLoop_19>=1))||(i8.u14.beginLoop_18>=1))||(i9.u45.beginLoop_21>=1))||(i4.u44.beginLoop_20>=1))||(i9.u47.beginLoop_23>=1))||(i9.u46.beginLoop_22>=1))||(i15.u49.beginLoop_25>=1))||(i0.u48.beginLoop_24>=1))||(i15.u15.beginLoop_27>=1))||(i15.u66.beginLoop_26>=1))||(i10.u51.beginLoop_29>=1))||(i2.u50.beginLoop_28>=1))||(i10.u52.beginLoop_31>=1))||(i10.u67.beginLoop_30>=1))||(i11.u54.beginLoop_33>=1))||(i4.u53.beginLoop_32>=1))||(i11.u55.beginLoop_35>=1))||(i11.u17.beginLoop_34>=1))||(i12.u18.beginLoop_37>=1))||(i0.u56.beginLoop_36>=1))||(i12.u57.beginLoop_39>=1))||(i12.u64.beginLoop_38>=1))||(i1.u58.beginLoop_41>=1))||(i1.u19.beginLoop_40>=1))||(i1.u20.beginLoop_43>=1))||(i1.u59.beginLoop_42>=1))||(i5.u21.beginLoop_45>=1))||(i5.u60.beginLoop_44>=1))||(i5.u23.beginLoop_47>=1))||(i5.u22.beginLoop_46>=1))||(i14.i1.u65.beginLoop_1>=1))||(i14.i1.u30.beginLoop_0>=1))||(i14.i0.u33.beginLoop_3>=1))||(i14.i0.u32.beginLoop_2>=1))||(i7.i1.u35.beginLoop_5>=1))||(i7.i1.u34.beginLoop_4>=1))||(i7.i0.u37.beginLoop_7>=1))||(i7.i0.u36.beginLoop_6>=1))||(i3.u10.beginLoop_9>=1))||(i3.u38.beginLoop_8>=1))||(i6.u40.beginLoop_11>=1))||(i3.u11.beginLoop_10>=1))||(i13.u12.beginLoop_13>=1))||(i0.u41.beginLoop_12>=1))||(i13.u13.beginLoop_15>=1))||(i13.u62.beginLoop_14>=1))||((i2.u1.wantSection_7>=1)&&(i7.i0.u37.testAlone_7>=1)))||((i6.u3.wantSection_5>=1)&&(i5.u22.testAlone_46>=1)))||((i6.u3.wantSection_5>=1)&&(i1.u59.testAlone_42>=1)))||((i2.u1.wantSection_7>=1)&&(i6.u40.testAlone_11>=1)))||((i2.u1.wantSection_7>=1)&&(i13.u13.testAlone_15>=1)))||((i0.u0.wantSection_3>=1)&&(i3.u39.testAlone_9>=1)))||((i2.u1.wantSection_7>=1)&&(i8.u63.testAlone_19>=1)))||((i0.u2.wantSection_1>=1)&&(i5.u60.testAlone_44>=1)))||((i0.u0.wantSection_3>=1)&&(i14.i1.u31.testAlone_1>=1)))||((i0.u2.wantSection_1>=1)&&(i1.u19.testAlone_40>=1)))||((i0.u0.wantSection_3>=1)&&(i7.i1.u61.testAlone_5>=1)))||((i0.u2.wantSection_1>=1)&&(i0.u56.testAlone_36>=1)))||((i6.u3.wantSection_5>=1)&&(i12.u64.testAlone_38>=1)))||((i0.u2.wantSection_1>=1)&&(i4.u53.testAlone_32>=1)))||((i2.u1.wantSection_7>=1)&&(i14.i0.u33.testAlone_3>=1)))||((i0.u2.wantSection_1>=1)&&(i2.u50.testAlone_28>=1)))||((i6.u3.wantSection_5>=1)&&(i13.u62.testAlone_14>=1)))||((i0.u2.wantSection_1>=1)&&(i0.u48.testAlone_24>=1)))||((i6.u3.wantSection_5>=1)&&(i3.u11.testAlone_10>=1)))||((i0.u2.wantSection_1>=1)&&(i4.u44.testAlone_20>=1)))||((i6.u3.wantSection_5>=1)&&(i9.u46.testAlone_22>=1)))||((i0.u0.wantSection_3>=1)&&(i1.u58.testAlone_41>=1)))||((i0.u2.wantSection_1>=1)&&(i2.u42.testAlone_16>=1)))||((i6.u3.wantSection_5>=1)&&(i8.u14.testAlone_18>=1)))||((i0.u0.wantSection_3>=1)&&(i5.u21.testAlone_45>=1)))||((i0.u2.wantSection_1>=1)&&(i0.u41.testAlone_12>=1)))||((i2.u1.wantSection_7>=1)&&(i9.u47.testAlone_23>=1)))||((i0.u0.wantSection_3>=1)&&(i11.u54.testAlone_33>=1)))||((i2.u1.wantSection_7>=1)&&(i15.u15.testAlone_27>=1)))||((i0.u0.wantSection_3>=1)&&(i12.u18.testAlone_37>=1)))||((i6.u3.wantSection_5>=1)&&(i7.i0.u36.testAlone_6>=1)))||((i2.u1.wantSection_7>=1)&&(i10.u52.testAlone_31>=1)))||((i0.u0.wantSection_3>=1)&&(i15.u49.testAlone_25>=1)))||((i6.u3.wantSection_5>=1)&&(i14.i0.u32.testAlone_2>=1)))||((i2.u1.wantSection_7>=1)&&(i11.u55.testAlone_35>=1)))||((i0.u0.wantSection_3>=1)&&(i10.u51.testAlone_29>=1))))))))] != FALSE
(forward)formula 10,0,72.1012,1749784,1,0,2.63728e+06,11725,6230,1.01655e+07,805,80221,7591036
FORMULA Peterson-COL-3-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(((((((((((((i0.u6.isEndLoop_3>=1)||(i2.u8.isEndLoop_19>=1))||(i12.u57.isEndLoop_39>=1))||(i2.u7.isEndLoop_7>=1))||(i4.u26.isEndLoop_23>=1))||(i4.u28.isEndLoop_35>=1))||(i0.u4.isEndLoop_27>=1))||(i4.u24.isEndLoop_11>=1))||(i5.u23.isEndLoop_47>=1))||(i0.u25.isEndLoop_15>=1))||(i2.u27.isEndLoop_31>=1))||(i1.u20.isEndLoop_43>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((((((((((((i0.u6.isEndLoop_3>=1)||(i2.u8.isEndLoop_19>=1))||(i12.u57.isEndLoop_39>=1))||(i2.u7.isEndLoop_7>=1))||(i4.u26.isEndLoop_23>=1))||(i4.u28.isEndLoop_35>=1))||(i0.u4.isEndLoop_27>=1))||(i4.u24.isEndLoop_11>=1))||(i5.u23.isEndLoop_47>=1))||(i0.u25.isEndLoop_15>=1))||(i2.u27.isEndLoop_31>=1))||(i1.u20.isEndLoop_43>=1)))] != FALSE
(forward)formula 11,1,72.1117,1750048,1,0,2.6373e+06,11725,6230,1.01668e+07,805,80221,7591047
FORMULA Peterson-COL-3-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (AF((EF(((((((((((((i11.u17.testIdentity_34>=1)||(i14.i1.u30.testIdentity_0>=1))||(i8.u14.testIdentity_17>=1))||(i12.u57.testIdentity_39>=1))||(i7.i1.u34.testIdentity_4>=1))||(i9.u45.testIdentity_21>=1))||(i15.u66.testIdentity_26>=1))||(i1.u20.testIdentity_43>=1))||(i3.u38.testIdentity_8>=1))||(i10.u67.testIdentity_30>=1))||(i5.u23.testIdentity_47>=1))||(i13.u12.testIdentity_13>=1))) * (((((((((((((i11.u17.testIdentity_34<1)&&(i14.i1.u30.testIdentity_0<1))&&(i8.u14.testIdentity_17<1))&&(i12.u57.testIdentity_39<1))&&(i7.i1.u34.testIdentity_4<1))&&(i9.u45.testIdentity_21<1))&&(i15.u66.testIdentity_26<1))&&(i1.u20.testIdentity_43<1))&&(i3.u38.testIdentity_8<1))&&(i10.u67.testIdentity_30<1))&&(i5.u23.testIdentity_47<1))&&(i13.u12.testIdentity_13<1))||(((((((((((((((((((((((((((((((((((((i8.u14.testIdentity_18>=1)||(i8.u63.testIdentity_19>=1))||(i2.u42.testIdentity_16>=1))||(i9.u46.testIdentity_22>=1))||(i9.u47.testIdentity_23>=1))||(i4.u44.testIdentity_20>=1))||(i15.u15.testIdentity_27>=1))||(i0.u48.testIdentity_24>=1))||(i15.u49.testIdentity_25>=1))||(i10.u52.testIdentity_31>=1))||(i2.u50.testIdentity_28>=1))||(i10.u51.testIdentity_29>=1))||(i11.u55.testIdentity_35>=1))||(i4.u53.testIdentity_32>=1))||(i11.u54.testIdentity_33>=1))||(i12.u64.testIdentity_38>=1))||(i0.u56.testIdentity_36>=1))||(i12.u18.testIdentity_37>=1))||(i1.u59.testIdentity_42>=1))||(i1.u19.testIdentity_40>=1))||(i1.u58.testIdentity_41>=1))||(i5.u22.testIdentity_46>=1))||(i5.u60.testIdentity_44>=1))||(i5.u21.testIdentity_45>=1))||(i14.i0.u32.testIdentity_2>=1))||(i14.i0.u33.testIdentity_3>=1))||(i14.i1.u31.testIdentity_1>=1))||(i7.i0.u36.testIdentity_6>=1))||(i7.i0.u37.testIdentity_7>=1))||(i7.i1.u61.testIdentity_5>=1))||(i3.u11.testIdentity_10>=1))||(i6.u40.testIdentity_11>=1))||(i3.u39.testIdentity_9>=1))||(i13.u62.testIdentity_14>=1))||(i13.u13.testIdentity_15>=1))||(i0.u41.testIdentity_12>=1))&&(((((((((((((((((((((((((((((((((((((((((((((((((i0.u25.askForSection_3>=1)&&(i0.u4.turn_2>=1))||((i0.u25.askForSection_3>=1)&&(i0.u4.turn_1>=1)))||((i0.u25.askForSection_3>=1)&&(i0.u4.turn_3>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_3>=1)))||((i0.u25.askForSection_3>=1)&&(i0.u4.turn_0>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_4>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_0>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_6>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_5>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_2>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_1>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_7>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_2>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_7>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_11>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_3>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_6>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_10>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_0>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_5>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_9>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_1>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_4>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_8>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_7>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_10>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_9>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_11>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_4>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_5>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_6>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_11>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_10>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_8>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_11>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_9>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_8>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_8>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_10>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_9>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_1>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_5>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_0>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_4>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_3>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_7>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_2>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_6>=1))))))) * EG(EF(((((i4.u24.endTurn_2>=1)||(i4.u26.endTurn_5>=1))||(i4.u28.endTurn_8>=1))||(i5.u29.endTurn_11>=1)))))
=> equivalent forward existential formula: ([FwdG(Init,!((E(TRUE U ((((((((((((i11.u17.testIdentity_34>=1)||(i14.i1.u30.testIdentity_0>=1))||(i8.u14.testIdentity_17>=1))||(i12.u57.testIdentity_39>=1))||(i7.i1.u34.testIdentity_4>=1))||(i9.u45.testIdentity_21>=1))||(i15.u66.testIdentity_26>=1))||(i1.u20.testIdentity_43>=1))||(i3.u38.testIdentity_8>=1))||(i10.u67.testIdentity_30>=1))||(i5.u23.testIdentity_47>=1))||(i13.u12.testIdentity_13>=1))) * (((((((((((((i11.u17.testIdentity_34<1)&&(i14.i1.u30.testIdentity_0<1))&&(i8.u14.testIdentity_17<1))&&(i12.u57.testIdentity_39<1))&&(i7.i1.u34.testIdentity_4<1))&&(i9.u45.testIdentity_21<1))&&(i15.u66.testIdentity_26<1))&&(i1.u20.testIdentity_43<1))&&(i3.u38.testIdentity_8<1))&&(i10.u67.testIdentity_30<1))&&(i5.u23.testIdentity_47<1))&&(i13.u12.testIdentity_13<1))||(((((((((((((((((((((((((((((((((((((i8.u14.testIdentity_18>=1)||(i8.u63.testIdentity_19>=1))||(i2.u42.testIdentity_16>=1))||(i9.u46.testIdentity_22>=1))||(i9.u47.testIdentity_23>=1))||(i4.u44.testIdentity_20>=1))||(i15.u15.testIdentity_27>=1))||(i0.u48.testIdentity_24>=1))||(i15.u49.testIdentity_25>=1))||(i10.u52.testIdentity_31>=1))||(i2.u50.testIdentity_28>=1))||(i10.u51.testIdentity_29>=1))||(i11.u55.testIdentity_35>=1))||(i4.u53.testIdentity_32>=1))||(i11.u54.testIdentity_33>=1))||(i12.u64.testIdentity_38>=1))||(i0.u56.testIdentity_36>=1))||(i12.u18.testIdentity_37>=1))||(i1.u59.testIdentity_42>=1))||(i1.u19.testIdentity_40>=1))||(i1.u58.testIdentity_41>=1))||(i5.u22.testIdentity_46>=1))||(i5.u60.testIdentity_44>=1))||(i5.u21.testIdentity_45>=1))||(i14.i0.u32.testIdentity_2>=1))||(i14.i0.u33.testIdentity_3>=1))||(i14.i1.u31.testIdentity_1>=1))||(i7.i0.u36.testIdentity_6>=1))||(i7.i0.u37.testIdentity_7>=1))||(i7.i1.u61.testIdentity_5>=1))||(i3.u11.testIdentity_10>=1))||(i6.u40.testIdentity_11>=1))||(i3.u39.testIdentity_9>=1))||(i13.u62.testIdentity_14>=1))||(i13.u13.testIdentity_15>=1))||(i0.u41.testIdentity_12>=1))&&(((((((((((((((((((((((((((((((((((((((((((((((((i0.u25.askForSection_3>=1)&&(i0.u4.turn_2>=1))||((i0.u25.askForSection_3>=1)&&(i0.u4.turn_1>=1)))||((i0.u25.askForSection_3>=1)&&(i0.u4.turn_3>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_3>=1)))||((i0.u25.askForSection_3>=1)&&(i0.u4.turn_0>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_4>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_0>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_6>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_5>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_2>=1)))||((i0.u9.askForSection_9>=1)&&(i0.u4.turn_1>=1)))||((i2.u27.askForSection_7>=1)&&(i2.u8.turn_7>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_2>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_7>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_11>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_3>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_6>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_10>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_0>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_5>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_9>=1)))||((i0.u6.askForSection_0>=1)&&(i0.u4.turn_1>=1)))||((i2.u8.askForSection_4>=1)&&(i2.u8.turn_4>=1)))||((i4.u28.askForSection_8>=1)&&(i4.u24.turn_8>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_7>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_10>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_9>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_11>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_4>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_5>=1)))||((i2.u7.askForSection_1>=1)&&(i2.u8.turn_6>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_11>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_10>=1)))||((i5.u29.askForSection_11>=1)&&(i4.u24.turn_8>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_11>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_9>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_8>=1)))||((i4.u24.askForSection_2>=1)&&(i4.u24.turn_8>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_10>=1)))||((i4.u26.askForSection_5>=1)&&(i4.u24.turn_9>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_1>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_5>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_0>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_4>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_3>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_7>=1)))||((i0.u4.askForSection_6>=1)&&(i0.u4.turn_2>=1)))||((i1.u5.askForSection_10>=1)&&(i2.u8.turn_6>=1))))))))] = FALSE * [(Init * !(EG(E(TRUE U ((((i4.u24.endTurn_2>=1)||(i4.u26.endTurn_5>=1))||(i4.u28.endTurn_8>=1))||(i5.u29.endTurn_11>=1))))))] = FALSE)
(forward)formula 12,1,76.2758,1869640,1,0,2.83586e+06,11970,6628,1.08343e+07,840,83458,8199037
FORMULA Peterson-COL-3-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG((!(EF((((((((((((((((((((((((((((((((((((((i2.u8.turn_7>=1)&&(i2.u27.testTurn_7>=1))||((i0.u4.turn_2>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_2>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_11>=1)&&(i4.u24.testTurn_2>=1)))||((i0.u4.turn_1>=1)&&(i0.u6.testTurn_0>=1)))||((i4.u24.turn_11>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_7>=1)&&(i2.u8.testTurn_4>=1)))||((i2.u8.turn_7>=1)&&(i2.u7.testTurn_1>=1)))||((i4.u24.turn_11>=1)&&(i4.u26.testTurn_5>=1)))||((i0.u4.turn_3>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_8>=1)&&(i4.u26.testTurn_5>=1)))||((i4.u24.turn_8>=1)&&(i4.u28.testTurn_8>=1)))||((i0.u4.turn_0>=1)&&(i0.u25.testTurn_3>=1)))||((i0.u4.turn_3>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_8>=1)&&(i5.u29.testTurn_11>=1)))||((i4.u24.turn_9>=1)&&(i4.u24.testTurn_2>=1)))||((i2.u8.turn_4>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i5.u29.testTurn_11>=1)))||((i2.u8.turn_5>=1)&&(i1.u5.testTurn_10>=1)))||((i2.u8.turn_5>=1)&&(i2.u27.testTurn_7>=1)))||((i2.u8.turn_4>=1)&&(i2.u27.testTurn_7>=1)))||((i0.u4.turn_0>=1)&&(i0.u4.testTurn_6>=1)))||((i2.u8.turn_4>=1)&&(i1.u5.testTurn_10>=1)))||((i4.u24.turn_9>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_5>=1)&&(i2.u7.testTurn_1>=1)))||((i0.u4.turn_3>=1)&&(i0.u6.testTurn_0>=1)))||((i0.u4.turn_0>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_1>=1)&&(i0.u9.testTurn_9>=1)))||((i2.u8.turn_6>=1)&&(i1.u5.testTurn_10>=1)))||((i0.u4.turn_1>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_9>=1)&&(i5.u29.testTurn_11>=1)))||((i0.u4.turn_2>=1)&&(i0.u6.testTurn_0>=1)))||((i2.u8.turn_6>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i4.u24.testTurn_2>=1)))||((i4.u24.turn_10>=1)&&(i4.u26.testTurn_5>=1)))||((i2.u8.turn_6>=1)&&(i2.u7.testTurn_1>=1))))) + !(AG(((((((((i2.u7.endTurn_1>=1)||(i0.u6.endTurn_0>=1))||(i0.u25.endTurn_3>=1))||(i2.u8.endTurn_4>=1))||(i2.u27.endTurn_7>=1))||(i0.u4.endTurn_6>=1))||(i1.u5.endTurn_10>=1))||(i0.u9.endTurn_9>=1))))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!(!(E(TRUE U !(((((((((i2.u7.endTurn_1>=1)||(i0.u6.endTurn_0>=1))||(i0.u25.endTurn_3>=1))||(i2.u8.endTurn_4>=1))||(i2.u27.endTurn_7>=1))||(i0.u4.endTurn_6>=1))||(i1.u5.endTurn_10>=1))||(i0.u9.endTurn_9>=1)))))))),TRUE) * (((((((((((((((((((((((((((((((((((((i2.u8.turn_7>=1)&&(i2.u27.testTurn_7>=1))||((i0.u4.turn_2>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_2>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_11>=1)&&(i4.u24.testTurn_2>=1)))||((i0.u4.turn_1>=1)&&(i0.u6.testTurn_0>=1)))||((i4.u24.turn_11>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_7>=1)&&(i2.u8.testTurn_4>=1)))||((i2.u8.turn_7>=1)&&(i2.u7.testTurn_1>=1)))||((i4.u24.turn_11>=1)&&(i4.u26.testTurn_5>=1)))||((i0.u4.turn_3>=1)&&(i0.u25.testTurn_3>=1)))||((i4.u24.turn_8>=1)&&(i4.u26.testTurn_5>=1)))||((i4.u24.turn_8>=1)&&(i4.u28.testTurn_8>=1)))||((i0.u4.turn_0>=1)&&(i0.u25.testTurn_3>=1)))||((i0.u4.turn_3>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_8>=1)&&(i5.u29.testTurn_11>=1)))||((i4.u24.turn_9>=1)&&(i4.u24.testTurn_2>=1)))||((i2.u8.turn_4>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i5.u29.testTurn_11>=1)))||((i2.u8.turn_5>=1)&&(i1.u5.testTurn_10>=1)))||((i2.u8.turn_5>=1)&&(i2.u27.testTurn_7>=1)))||((i2.u8.turn_4>=1)&&(i2.u27.testTurn_7>=1)))||((i0.u4.turn_0>=1)&&(i0.u4.testTurn_6>=1)))||((i2.u8.turn_4>=1)&&(i1.u5.testTurn_10>=1)))||((i4.u24.turn_9>=1)&&(i4.u28.testTurn_8>=1)))||((i2.u8.turn_5>=1)&&(i2.u7.testTurn_1>=1)))||((i0.u4.turn_3>=1)&&(i0.u6.testTurn_0>=1)))||((i0.u4.turn_0>=1)&&(i0.u9.testTurn_9>=1)))||((i0.u4.turn_1>=1)&&(i0.u9.testTurn_9>=1)))||((i2.u8.turn_6>=1)&&(i1.u5.testTurn_10>=1)))||((i0.u4.turn_1>=1)&&(i0.u4.testTurn_6>=1)))||((i4.u24.turn_9>=1)&&(i5.u29.testTurn_11>=1)))||((i0.u4.turn_2>=1)&&(i0.u6.testTurn_0>=1)))||((i2.u8.turn_6>=1)&&(i2.u8.testTurn_4>=1)))||((i4.u24.turn_10>=1)&&(i4.u24.testTurn_2>=1)))||((i4.u24.turn_10>=1)&&(i4.u26.testTurn_5>=1)))||((i2.u8.turn_6>=1)&&(i2.u7.testTurn_1>=1))))] = FALSE
(forward)formula 13,1,76.6624,1879672,1,0,2.85314e+06,11988,6656,1.08888e+07,840,83697,8252402
FORMULA Peterson-COL-3-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(EF(EX(((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17>=1)||(i2.u42.beginLoop_16>=1))||(i8.u63.beginLoop_19>=1))||(i8.u14.beginLoop_18>=1))||(i9.u45.beginLoop_21>=1))||(i4.u44.beginLoop_20>=1))||(i9.u47.beginLoop_23>=1))||(i9.u46.beginLoop_22>=1))||(i15.u49.beginLoop_25>=1))||(i0.u48.beginLoop_24>=1))||(i15.u15.beginLoop_27>=1))||(i15.u66.beginLoop_26>=1))||(i10.u51.beginLoop_29>=1))||(i2.u50.beginLoop_28>=1))||(i10.u52.beginLoop_31>=1))||(i10.u67.beginLoop_30>=1))||(i11.u54.beginLoop_33>=1))||(i4.u53.beginLoop_32>=1))||(i11.u55.beginLoop_35>=1))||(i11.u17.beginLoop_34>=1))||(i12.u18.beginLoop_37>=1))||(i0.u56.beginLoop_36>=1))||(i12.u57.beginLoop_39>=1))||(i12.u64.beginLoop_38>=1))||(i1.u58.beginLoop_41>=1))||(i1.u19.beginLoop_40>=1))||(i1.u20.beginLoop_43>=1))||(i1.u59.beginLoop_42>=1))||(i5.u21.beginLoop_45>=1))||(i5.u60.beginLoop_44>=1))||(i5.u23.beginLoop_47>=1))||(i5.u22.beginLoop_46>=1))||(i14.i1.u65.beginLoop_1>=1))||(i14.i1.u30.beginLoop_0>=1))||(i14.i0.u33.beginLoop_3>=1))||(i14.i0.u32.beginLoop_2>=1))||(i7.i1.u35.beginLoop_5>=1))||(i7.i1.u34.beginLoop_4>=1))||(i7.i0.u37.beginLoop_7>=1))||(i7.i0.u36.beginLoop_6>=1))||(i3.u10.beginLoop_9>=1))||(i3.u38.beginLoop_8>=1))||(i6.u40.beginLoop_11>=1))||(i3.u11.beginLoop_10>=1))||(i13.u12.beginLoop_13>=1))||(i0.u41.beginLoop_12>=1))||(i13.u13.beginLoop_15>=1))||(i13.u62.beginLoop_14>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EX(((((((((((((((((((((((((((((((((((((((((((((((((i8.u43.beginLoop_17>=1)||(i2.u42.beginLoop_16>=1))||(i8.u63.beginLoop_19>=1))||(i8.u14.beginLoop_18>=1))||(i9.u45.beginLoop_21>=1))||(i4.u44.beginLoop_20>=1))||(i9.u47.beginLoop_23>=1))||(i9.u46.beginLoop_22>=1))||(i15.u49.beginLoop_25>=1))||(i0.u48.beginLoop_24>=1))||(i15.u15.beginLoop_27>=1))||(i15.u66.beginLoop_26>=1))||(i10.u51.beginLoop_29>=1))||(i2.u50.beginLoop_28>=1))||(i10.u52.beginLoop_31>=1))||(i10.u67.beginLoop_30>=1))||(i11.u54.beginLoop_33>=1))||(i4.u53.beginLoop_32>=1))||(i11.u55.beginLoop_35>=1))||(i11.u17.beginLoop_34>=1))||(i12.u18.beginLoop_37>=1))||(i0.u56.beginLoop_36>=1))||(i12.u57.beginLoop_39>=1))||(i12.u64.beginLoop_38>=1))||(i1.u58.beginLoop_41>=1))||(i1.u19.beginLoop_40>=1))||(i1.u20.beginLoop_43>=1))||(i1.u59.beginLoop_42>=1))||(i5.u21.beginLoop_45>=1))||(i5.u60.beginLoop_44>=1))||(i5.u23.beginLoop_47>=1))||(i5.u22.beginLoop_46>=1))||(i14.i1.u65.beginLoop_1>=1))||(i14.i1.u30.beginLoop_0>=1))||(i14.i0.u33.beginLoop_3>=1))||(i14.i0.u32.beginLoop_2>=1))||(i7.i1.u35.beginLoop_5>=1))||(i7.i1.u34.beginLoop_4>=1))||(i7.i0.u37.beginLoop_7>=1))||(i7.i0.u36.beginLoop_6>=1))||(i3.u10.beginLoop_9>=1))||(i3.u38.beginLoop_8>=1))||(i6.u40.beginLoop_11>=1))||(i3.u11.beginLoop_10>=1))||(i13.u12.beginLoop_13>=1))||(i0.u41.beginLoop_12>=1))||(i13.u13.beginLoop_15>=1))||(i13.u62.beginLoop_14>=1))))))] = FALSE
(forward)formula 14,1,78.0618,1917424,1,0,2.91758e+06,12054,6656,1.10984e+07,840,84741,8421882
FORMULA Peterson-COL-3-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG((AG((((((i6.u3.wantSection_5>=1)&&(i4.u28.CS_2>=1))||((i2.u1.wantSection_7>=1)&&(i5.u29.CS_3>=1)))||((i0.u2.wantSection_1>=1)&&(i4.u24.CS_0>=1)))||((i0.u0.wantSection_3>=1)&&(i4.u26.CS_1>=1)))) + EX(((((((((((((i11.u17.testIdentity_34<1)&&(i14.i1.u30.testIdentity_0<1))&&(i8.u14.testIdentity_17<1))&&(i12.u57.testIdentity_39<1))&&(i7.i1.u34.testIdentity_4<1))&&(i9.u45.testIdentity_21<1))&&(i15.u66.testIdentity_26<1))&&(i1.u20.testIdentity_43<1))&&(i3.u38.testIdentity_8<1))&&(i10.u67.testIdentity_30<1))&&(i5.u23.testIdentity_47<1))&&(i13.u12.testIdentity_13<1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EX(((((((((((((i11.u17.testIdentity_34<1)&&(i14.i1.u30.testIdentity_0<1))&&(i8.u14.testIdentity_17<1))&&(i12.u57.testIdentity_39<1))&&(i7.i1.u34.testIdentity_4<1))&&(i9.u45.testIdentity_21<1))&&(i15.u66.testIdentity_26<1))&&(i1.u20.testIdentity_43<1))&&(i3.u38.testIdentity_8<1))&&(i10.u67.testIdentity_30<1))&&(i5.u23.testIdentity_47<1))&&(i13.u12.testIdentity_13<1))))),TRUE) * !((((((i6.u3.wantSection_5>=1)&&(i4.u28.CS_2>=1))||((i2.u1.wantSection_7>=1)&&(i5.u29.CS_3>=1)))||((i0.u2.wantSection_1>=1)&&(i4.u24.CS_0>=1)))||((i0.u0.wantSection_3>=1)&&(i4.u26.CS_1>=1)))))] = FALSE
(forward)formula 15,0,87.8073,2129416,1,0,3.20881e+06,13079,7245,1.25853e+07,877,96134,9213585
FORMULA Peterson-COL-3-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
BK_STOP 1590019251945
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
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="Peterson-COL-3"
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"
# 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 Peterson-COL-3, 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 r111-csrt-158961258000668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-3.tgz
mv Peterson-COL-3 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 '
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 ;