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-158961258100722.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-PT-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258100722
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 144K 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 33K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 32K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 138K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 511K 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-PT-4-00
FORMULA_NAME Peterson-PT-4-01
FORMULA_NAME Peterson-PT-4-02
FORMULA_NAME Peterson-PT-4-03
FORMULA_NAME Peterson-PT-4-04
FORMULA_NAME Peterson-PT-4-05
FORMULA_NAME Peterson-PT-4-06
FORMULA_NAME Peterson-PT-4-07
FORMULA_NAME Peterson-PT-4-08
FORMULA_NAME Peterson-PT-4-09
FORMULA_NAME Peterson-PT-4-10
FORMULA_NAME Peterson-PT-4-11
FORMULA_NAME Peterson-PT-4-12
FORMULA_NAME Peterson-PT-4-13
FORMULA_NAME Peterson-PT-4-14
FORMULA_NAME Peterson-PT-4-15

=== Now, execution of the tool begins

BK_START 1590023258362

[2020-05-21 01:07:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-21 01:07:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 01:07:40] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2020-05-21 01:07:40] [INFO ] Transformed 480 places.
[2020-05-21 01:07:40] [INFO ] Transformed 690 transitions.
[2020-05-21 01:07:40] [INFO ] Parsed PT model containing 480 places and 690 transitions in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 42 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 505 ms. (steps per millisecond=198 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0]
[2020-05-21 01:07:41] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2020-05-21 01:07:41] [INFO ] Computed 19 place invariants in 23 ms
[2020-05-21 01:07:41] [INFO ] [Real]Absence check using 14 positive place invariants in 44 ms returned sat
[2020-05-21 01:07:41] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:07:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:42] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2020-05-21 01:07:42] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-05-21 01:07:42] [INFO ] [Real]Added 132 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:07:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2020-05-21 01:07:42] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:07:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:43] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2020-05-21 01:07:43] [INFO ] [Nat]Added 132 Read/Feed constraints in 40 ms returned sat
[2020-05-21 01:07:43] [INFO ] Deduced a trap composed of 42 places in 261 ms
[2020-05-21 01:07:43] [INFO ] Deduced a trap composed of 42 places in 157 ms
[2020-05-21 01:07:43] [INFO ] Deduced a trap composed of 10 places in 173 ms
[2020-05-21 01:07:44] [INFO ] Deduced a trap composed of 10 places in 164 ms
[2020-05-21 01:07:44] [INFO ] Deduced a trap composed of 27 places in 154 ms
[2020-05-21 01:07:44] [INFO ] Deduced a trap composed of 27 places in 173 ms
[2020-05-21 01:07:45] [INFO ] Deduced a trap composed of 27 places in 739 ms
[2020-05-21 01:07:45] [INFO ] Deduced a trap composed of 36 places in 200 ms
[2020-05-21 01:07:45] [INFO ] Deduced a trap composed of 21 places in 155 ms
[2020-05-21 01:07:45] [INFO ] Deduced a trap composed of 10 places in 161 ms
[2020-05-21 01:07:46] [INFO ] Deduced a trap composed of 58 places in 174 ms
[2020-05-21 01:07:46] [INFO ] Deduced a trap composed of 42 places in 167 ms
[2020-05-21 01:07:46] [INFO ] Deduced a trap composed of 32 places in 216 ms
[2020-05-21 01:07:46] [INFO ] Deduced a trap composed of 40 places in 339 ms
[2020-05-21 01:07:47] [INFO ] Deduced a trap composed of 84 places in 262 ms
[2020-05-21 01:07:47] [INFO ] Deduced a trap composed of 32 places in 211 ms
[2020-05-21 01:07:47] [INFO ] Deduced a trap composed of 32 places in 179 ms
[2020-05-21 01:07:47] [INFO ] Deduced a trap composed of 62 places in 117 ms
[2020-05-21 01:07:47] [INFO ] Deduced a trap composed of 62 places in 120 ms
[2020-05-21 01:07:48] [INFO ] Deduced a trap composed of 61 places in 116 ms
[2020-05-21 01:07:48] [INFO ] Deduced a trap composed of 54 places in 100 ms
[2020-05-21 01:07:48] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5025 ms
[2020-05-21 01:07:48] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 92 ms.
[2020-05-21 01:07:55] [INFO ] Added : 609 causal constraints over 123 iterations in 7243 ms. Result :sat
[2020-05-21 01:07:55] [INFO ] Deduced a trap composed of 31 places in 140 ms
[2020-05-21 01:07:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2020-05-21 01:07:55] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2020-05-21 01:07:55] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:07:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:56] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2020-05-21 01:07:56] [INFO ] [Real]Added 132 Read/Feed constraints in 19 ms returned sat
[2020-05-21 01:07:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:07:56] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2020-05-21 01:07:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:57] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2020-05-21 01:07:57] [INFO ] [Nat]Added 132 Read/Feed constraints in 36 ms returned sat
[2020-05-21 01:07:57] [INFO ] Deduced a trap composed of 10 places in 223 ms
[2020-05-21 01:07:57] [INFO ] Deduced a trap composed of 25 places in 252 ms
[2020-05-21 01:07:58] [INFO ] Deduced a trap composed of 25 places in 200 ms
[2020-05-21 01:07:58] [INFO ] Deduced a trap composed of 50 places in 227 ms
[2020-05-21 01:07:58] [INFO ] Deduced a trap composed of 25 places in 208 ms
[2020-05-21 01:07:58] [INFO ] Deduced a trap composed of 10 places in 228 ms
[2020-05-21 01:07:59] [INFO ] Deduced a trap composed of 10 places in 250 ms
[2020-05-21 01:07:59] [INFO ] Deduced a trap composed of 58 places in 231 ms
[2020-05-21 01:07:59] [INFO ] Deduced a trap composed of 58 places in 196 ms
[2020-05-21 01:07:59] [INFO ] Deduced a trap composed of 58 places in 231 ms
[2020-05-21 01:08:00] [INFO ] Deduced a trap composed of 40 places in 274 ms
[2020-05-21 01:08:00] [INFO ] Deduced a trap composed of 32 places in 181 ms
[2020-05-21 01:08:00] [INFO ] Deduced a trap composed of 32 places in 202 ms
[2020-05-21 01:08:00] [INFO ] Deduced a trap composed of 32 places in 185 ms
[2020-05-21 01:08:00] [INFO ] Deduced a trap composed of 10 places in 160 ms
[2020-05-21 01:08:01] [INFO ] Deduced a trap composed of 32 places in 193 ms
[2020-05-21 01:08:01] [INFO ] Deduced a trap composed of 54 places in 151 ms
[2020-05-21 01:08:01] [INFO ] Deduced a trap composed of 76 places in 124 ms
[2020-05-21 01:08:01] [INFO ] Deduced a trap composed of 76 places in 103 ms
[2020-05-21 01:08:01] [INFO ] Deduced a trap composed of 76 places in 130 ms
[2020-05-21 01:08:01] [INFO ] Deduced a trap composed of 76 places in 115 ms
[2020-05-21 01:08:02] [INFO ] Deduced a trap composed of 47 places in 133 ms
[2020-05-21 01:08:02] [INFO ] Deduced a trap composed of 47 places in 128 ms
[2020-05-21 01:08:02] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5070 ms
[2020-05-21 01:08:02] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 33 ms.
[2020-05-21 01:08:07] [INFO ] Added : 587 causal constraints over 118 iterations in 5647 ms. Result :sat
[2020-05-21 01:08:08] [INFO ] Deduced a trap composed of 43 places in 217 ms
[2020-05-21 01:08:08] [INFO ] Deduced a trap composed of 43 places in 201 ms
[2020-05-21 01:08:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 620 ms
[2020-05-21 01:08:08] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2020-05-21 01:08:08] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:09] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2020-05-21 01:08:09] [INFO ] [Real]Added 132 Read/Feed constraints in 32 ms returned sat
[2020-05-21 01:08:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:08:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 26 ms returned sat
[2020-05-21 01:08:09] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:08:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:10] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2020-05-21 01:08:10] [INFO ] [Nat]Added 132 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:08:10] [INFO ] Deduced a trap composed of 76 places in 211 ms
[2020-05-21 01:08:10] [INFO ] Deduced a trap composed of 32 places in 252 ms
[2020-05-21 01:08:10] [INFO ] Deduced a trap composed of 47 places in 189 ms
[2020-05-21 01:08:11] [INFO ] Deduced a trap composed of 47 places in 185 ms
[2020-05-21 01:08:11] [INFO ] Deduced a trap composed of 69 places in 210 ms
[2020-05-21 01:08:11] [INFO ] Deduced a trap composed of 69 places in 201 ms
[2020-05-21 01:08:11] [INFO ] Deduced a trap composed of 32 places in 177 ms
[2020-05-21 01:08:11] [INFO ] Deduced a trap composed of 10 places in 152 ms
[2020-05-21 01:08:12] [INFO ] Deduced a trap composed of 37 places in 147 ms
[2020-05-21 01:08:12] [INFO ] Deduced a trap composed of 22 places in 144 ms
[2020-05-21 01:08:12] [INFO ] Deduced a trap composed of 10 places in 143 ms
[2020-05-21 01:08:12] [INFO ] Deduced a trap composed of 10 places in 130 ms
[2020-05-21 01:08:12] [INFO ] Deduced a trap composed of 82 places in 159 ms
[2020-05-21 01:08:12] [INFO ] Deduced a trap composed of 69 places in 167 ms
[2020-05-21 01:08:13] [INFO ] Deduced a trap composed of 92 places in 170 ms
[2020-05-21 01:08:13] [INFO ] Deduced a trap composed of 92 places in 122 ms
[2020-05-21 01:08:13] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3176 ms
[2020-05-21 01:08:13] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 42 ms.
[2020-05-21 01:08:19] [INFO ] Added : 576 causal constraints over 116 iterations in 5930 ms. Result :sat
[2020-05-21 01:08:19] [INFO ] Deduced a trap composed of 36 places in 195 ms
[2020-05-21 01:08:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2020-05-21 01:08:19] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned sat
[2020-05-21 01:08:19] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:20] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2020-05-21 01:08:20] [INFO ] [Real]Added 132 Read/Feed constraints in 18 ms returned sat
[2020-05-21 01:08:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:08:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2020-05-21 01:08:20] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2020-05-21 01:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:20] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2020-05-21 01:08:21] [INFO ] [Nat]Added 132 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:08:21] [INFO ] Deduced a trap composed of 54 places in 238 ms
[2020-05-21 01:08:21] [INFO ] Deduced a trap composed of 67 places in 246 ms
[2020-05-21 01:08:21] [INFO ] Deduced a trap composed of 27 places in 244 ms
[2020-05-21 01:08:22] [INFO ] Deduced a trap composed of 27 places in 276 ms
[2020-05-21 01:08:22] [INFO ] Deduced a trap composed of 190 places in 239 ms
[2020-05-21 01:08:22] [INFO ] Deduced a trap composed of 14 places in 174 ms
[2020-05-21 01:08:22] [INFO ] Deduced a trap composed of 14 places in 161 ms
[2020-05-21 01:08:23] [INFO ] Deduced a trap composed of 76 places in 216 ms
[2020-05-21 01:08:23] [INFO ] Deduced a trap composed of 32 places in 226 ms
[2020-05-21 01:08:23] [INFO ] Deduced a trap composed of 10 places in 197 ms
[2020-05-21 01:08:23] [INFO ] Deduced a trap composed of 21 places in 256 ms
[2020-05-21 01:08:24] [INFO ] Deduced a trap composed of 50 places in 188 ms
[2020-05-21 01:08:24] [INFO ] Deduced a trap composed of 76 places in 199 ms
[2020-05-21 01:08:24] [INFO ] Deduced a trap composed of 52 places in 129 ms
[2020-05-21 01:08:24] [INFO ] Deduced a trap composed of 42 places in 128 ms
[2020-05-21 01:08:24] [INFO ] Deduced a trap composed of 106 places in 198 ms
[2020-05-21 01:08:24] [INFO ] Deduced a trap composed of 50 places in 117 ms
[2020-05-21 01:08:25] [INFO ] Deduced a trap composed of 54 places in 198 ms
[2020-05-21 01:08:25] [INFO ] Deduced a trap composed of 35 places in 201 ms
[2020-05-21 01:08:25] [INFO ] Deduced a trap composed of 35 places in 205 ms
[2020-05-21 01:08:25] [INFO ] Deduced a trap composed of 10 places in 203 ms
[2020-05-21 01:08:26] [INFO ] Deduced a trap composed of 47 places in 182 ms
[2020-05-21 01:08:26] [INFO ] Deduced a trap composed of 47 places in 149 ms
[2020-05-21 01:08:26] [INFO ] Deduced a trap composed of 47 places in 153 ms
[2020-05-21 01:08:26] [INFO ] Deduced a trap composed of 76 places in 160 ms
[2020-05-21 01:08:26] [INFO ] Deduced a trap composed of 54 places in 144 ms
[2020-05-21 01:08:27] [INFO ] Deduced a trap composed of 22 places in 170 ms
[2020-05-21 01:08:27] [INFO ] Deduced a trap composed of 76 places in 108 ms
[2020-05-21 01:08:27] [INFO ] Deduced a trap composed of 76 places in 110 ms
[2020-05-21 01:08:27] [INFO ] Deduced a trap composed of 13 places in 158 ms
[2020-05-21 01:08:27] [INFO ] Deduced a trap composed of 10 places in 202 ms
[2020-05-21 01:08:27] [INFO ] Deduced a trap composed of 38 places in 134 ms
[2020-05-21 01:08:28] [INFO ] Deduced a trap composed of 69 places in 222 ms
[2020-05-21 01:08:28] [INFO ] Deduced a trap composed of 42 places in 214 ms
[2020-05-21 01:08:28] [INFO ] Deduced a trap composed of 57 places in 159 ms
[2020-05-21 01:08:28] [INFO ] Deduced a trap composed of 81 places in 139 ms
[2020-05-21 01:08:29] [INFO ] Deduced a trap composed of 57 places in 137 ms
[2020-05-21 01:08:29] [INFO ] Deduced a trap composed of 80 places in 153 ms
[2020-05-21 01:08:29] [INFO ] Deduced a trap composed of 80 places in 141 ms
[2020-05-21 01:08:29] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 8465 ms
[2020-05-21 01:08:29] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 32 ms.
[2020-05-21 01:08:35] [INFO ] Added : 625 causal constraints over 125 iterations in 6213 ms. Result :sat
[2020-05-21 01:08:35] [INFO ] Deduced a trap composed of 96 places in 118 ms
[2020-05-21 01:08:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2020-05-21 01:08:36] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:08:36] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:36] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2020-05-21 01:08:36] [INFO ] [Real]Added 132 Read/Feed constraints in 24 ms returned sat
[2020-05-21 01:08:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:08:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2020-05-21 01:08:36] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:08:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:37] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2020-05-21 01:08:37] [INFO ] [Nat]Added 132 Read/Feed constraints in 36 ms returned sat
[2020-05-21 01:08:37] [INFO ] Deduced a trap composed of 10 places in 169 ms
[2020-05-21 01:08:37] [INFO ] Deduced a trap composed of 27 places in 147 ms
[2020-05-21 01:08:38] [INFO ] Deduced a trap composed of 10 places in 187 ms
[2020-05-21 01:08:38] [INFO ] Deduced a trap composed of 10 places in 164 ms
[2020-05-21 01:08:38] [INFO ] Deduced a trap composed of 10 places in 171 ms
[2020-05-21 01:08:38] [INFO ] Deduced a trap composed of 50 places in 140 ms
[2020-05-21 01:08:38] [INFO ] Deduced a trap composed of 39 places in 138 ms
[2020-05-21 01:08:39] [INFO ] Deduced a trap composed of 40 places in 153 ms
[2020-05-21 01:08:39] [INFO ] Deduced a trap composed of 32 places in 179 ms
[2020-05-21 01:08:39] [INFO ] Deduced a trap composed of 47 places in 226 ms
[2020-05-21 01:08:39] [INFO ] Deduced a trap composed of 47 places in 218 ms
[2020-05-21 01:08:39] [INFO ] Deduced a trap composed of 47 places in 195 ms
[2020-05-21 01:08:40] [INFO ] Deduced a trap composed of 36 places in 135 ms
[2020-05-21 01:08:40] [INFO ] Deduced a trap composed of 61 places in 225 ms
[2020-05-21 01:08:40] [INFO ] Deduced a trap composed of 62 places in 187 ms
[2020-05-21 01:08:40] [INFO ] Deduced a trap composed of 40 places in 213 ms
[2020-05-21 01:08:41] [INFO ] Deduced a trap composed of 62 places in 159 ms
[2020-05-21 01:08:41] [INFO ] Deduced a trap composed of 58 places in 138 ms
[2020-05-21 01:08:41] [INFO ] Deduced a trap composed of 83 places in 168 ms
[2020-05-21 01:08:41] [INFO ] Deduced a trap composed of 97 places in 225 ms
[2020-05-21 01:08:41] [INFO ] Deduced a trap composed of 61 places in 120 ms
[2020-05-21 01:08:41] [INFO ] Deduced a trap composed of 39 places in 127 ms
[2020-05-21 01:08:42] [INFO ] Deduced a trap composed of 61 places in 152 ms
[2020-05-21 01:08:42] [INFO ] Deduced a trap composed of 58 places in 100 ms
[2020-05-21 01:08:42] [INFO ] Deduced a trap composed of 62 places in 104 ms
[2020-05-21 01:08:42] [INFO ] Deduced a trap composed of 21 places in 80 ms
[2020-05-21 01:08:42] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4973 ms
[2020-05-21 01:08:42] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 27 ms.
[2020-05-21 01:08:47] [INFO ] Added : 536 causal constraints over 108 iterations in 4947 ms. Result :sat
[2020-05-21 01:08:47] [INFO ] Deduced a trap composed of 76 places in 184 ms
[2020-05-21 01:08:47] [INFO ] Deduced a trap composed of 76 places in 176 ms
[2020-05-21 01:08:48] [INFO ] Deduced a trap composed of 43 places in 215 ms
[2020-05-21 01:08:48] [INFO ] Deduced a trap composed of 57 places in 206 ms
[2020-05-21 01:08:48] [INFO ] Deduced a trap composed of 43 places in 183 ms
[2020-05-21 01:08:49] [INFO ] Deduced a trap composed of 70 places in 230 ms
[2020-05-21 01:08:49] [INFO ] Deduced a trap composed of 43 places in 224 ms
[2020-05-21 01:08:49] [INFO ] Deduced a trap composed of 66 places in 243 ms
[2020-05-21 01:08:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2587 ms
[2020-05-21 01:08:50] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2020-05-21 01:08:50] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:08:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:50] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2020-05-21 01:08:50] [INFO ] [Real]Added 132 Read/Feed constraints in 27 ms returned sat
[2020-05-21 01:08:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:08:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:08:50] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:08:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:51] [INFO ] [Nat]Absence check using state equation in 707 ms returned sat
[2020-05-21 01:08:51] [INFO ] [Nat]Added 132 Read/Feed constraints in 38 ms returned sat
[2020-05-21 01:08:52] [INFO ] Deduced a trap composed of 10 places in 267 ms
[2020-05-21 01:08:52] [INFO ] Deduced a trap composed of 66 places in 340 ms
[2020-05-21 01:08:52] [INFO ] Deduced a trap composed of 63 places in 224 ms
[2020-05-21 01:08:52] [INFO ] Deduced a trap composed of 43 places in 205 ms
[2020-05-21 01:08:53] [INFO ] Deduced a trap composed of 32 places in 200 ms
[2020-05-21 01:08:53] [INFO ] Deduced a trap composed of 10 places in 259 ms
[2020-05-21 01:08:53] [INFO ] Deduced a trap composed of 10 places in 232 ms
[2020-05-21 01:08:53] [INFO ] Deduced a trap composed of 10 places in 188 ms
[2020-05-21 01:08:54] [INFO ] Deduced a trap composed of 32 places in 195 ms
[2020-05-21 01:08:54] [INFO ] Deduced a trap composed of 32 places in 197 ms
[2020-05-21 01:08:54] [INFO ] Deduced a trap composed of 32 places in 199 ms
[2020-05-21 01:08:54] [INFO ] Deduced a trap composed of 50 places in 170 ms
[2020-05-21 01:08:54] [INFO ] Deduced a trap composed of 50 places in 198 ms
[2020-05-21 01:08:55] [INFO ] Deduced a trap composed of 50 places in 201 ms
[2020-05-21 01:08:55] [INFO ] Deduced a trap composed of 50 places in 177 ms
[2020-05-21 01:08:55] [INFO ] Deduced a trap composed of 54 places in 218 ms
[2020-05-21 01:08:55] [INFO ] Deduced a trap composed of 54 places in 211 ms
[2020-05-21 01:08:56] [INFO ] Deduced a trap composed of 76 places in 190 ms
[2020-05-21 01:08:56] [INFO ] Deduced a trap composed of 54 places in 142 ms
[2020-05-21 01:08:56] [INFO ] Deduced a trap composed of 76 places in 120 ms
[2020-05-21 01:08:56] [INFO ] Deduced a trap composed of 76 places in 113 ms
[2020-05-21 01:08:56] [INFO ] Deduced a trap composed of 76 places in 138 ms
[2020-05-21 01:08:56] [INFO ] Deduced a trap composed of 54 places in 116 ms
[2020-05-21 01:08:57] [INFO ] Deduced a trap composed of 31 places in 276 ms
[2020-05-21 01:08:57] [INFO ] Deduced a trap composed of 69 places in 294 ms
[2020-05-21 01:08:57] [INFO ] Deduced a trap composed of 21 places in 280 ms
[2020-05-21 01:08:58] [INFO ] Deduced a trap composed of 17 places in 259 ms
[2020-05-21 01:08:58] [INFO ] Deduced a trap composed of 25 places in 251 ms
[2020-05-21 01:08:58] [INFO ] Deduced a trap composed of 119 places in 192 ms
[2020-05-21 01:08:58] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7053 ms
[2020-05-21 01:08:58] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 36 ms.
[2020-05-21 01:09:05] [INFO ] Added : 625 causal constraints over 125 iterations in 6428 ms. Result :sat
[2020-05-21 01:09:05] [INFO ] Deduced a trap composed of 57 places in 210 ms
[2020-05-21 01:09:05] [INFO ] Deduced a trap composed of 39 places in 207 ms
[2020-05-21 01:09:05] [INFO ] Deduced a trap composed of 61 places in 197 ms
[2020-05-21 01:09:06] [INFO ] Deduced a trap composed of 13 places in 183 ms
[2020-05-21 01:09:06] [INFO ] Deduced a trap composed of 71 places in 172 ms
[2020-05-21 01:09:06] [INFO ] Deduced a trap composed of 47 places in 195 ms
[2020-05-21 01:09:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1726 ms
[2020-05-21 01:09:06] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:09:06] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:07] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2020-05-21 01:09:07] [INFO ] [Real]Added 132 Read/Feed constraints in 29 ms returned sat
[2020-05-21 01:09:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:09:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 26 ms returned sat
[2020-05-21 01:09:07] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:08] [INFO ] [Nat]Absence check using state equation in 679 ms returned sat
[2020-05-21 01:09:08] [INFO ] [Nat]Added 132 Read/Feed constraints in 34 ms returned sat
[2020-05-21 01:09:08] [INFO ] Deduced a trap composed of 58 places in 185 ms
[2020-05-21 01:09:08] [INFO ] Deduced a trap composed of 27 places in 145 ms
[2020-05-21 01:09:09] [INFO ] Deduced a trap composed of 27 places in 155 ms
[2020-05-21 01:09:09] [INFO ] Deduced a trap composed of 10 places in 163 ms
[2020-05-21 01:09:09] [INFO ] Deduced a trap composed of 10 places in 145 ms
[2020-05-21 01:09:09] [INFO ] Deduced a trap composed of 10 places in 201 ms
[2020-05-21 01:09:09] [INFO ] Deduced a trap composed of 32 places in 153 ms
[2020-05-21 01:09:09] [INFO ] Deduced a trap composed of 27 places in 178 ms
[2020-05-21 01:09:10] [INFO ] Deduced a trap composed of 27 places in 166 ms
[2020-05-21 01:09:10] [INFO ] Deduced a trap composed of 54 places in 147 ms
[2020-05-21 01:09:10] [INFO ] Deduced a trap composed of 54 places in 188 ms
[2020-05-21 01:09:10] [INFO ] Deduced a trap composed of 54 places in 180 ms
[2020-05-21 01:09:11] [INFO ] Deduced a trap composed of 32 places in 170 ms
[2020-05-21 01:09:11] [INFO ] Deduced a trap composed of 10 places in 148 ms
[2020-05-21 01:09:11] [INFO ] Deduced a trap composed of 76 places in 200 ms
[2020-05-21 01:09:11] [INFO ] Deduced a trap composed of 76 places in 167 ms
[2020-05-21 01:09:11] [INFO ] Deduced a trap composed of 76 places in 179 ms
[2020-05-21 01:09:12] [INFO ] Deduced a trap composed of 54 places in 161 ms
[2020-05-21 01:09:12] [INFO ] Deduced a trap composed of 76 places in 137 ms
[2020-05-21 01:09:12] [INFO ] Deduced a trap composed of 32 places in 131 ms
[2020-05-21 01:09:12] [INFO ] Deduced a trap composed of 32 places in 99 ms
[2020-05-21 01:09:12] [INFO ] Deduced a trap composed of 35 places in 114 ms
[2020-05-21 01:09:13] [INFO ] Deduced a trap composed of 70 places in 183 ms
[2020-05-21 01:09:13] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4601 ms
[2020-05-21 01:09:13] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 29 ms.
[2020-05-21 01:09:18] [INFO ] Added : 625 causal constraints over 125 iterations in 5681 ms. Result :sat
[2020-05-21 01:09:19] [INFO ] Deduced a trap composed of 65 places in 227 ms
[2020-05-21 01:09:19] [INFO ] Deduced a trap composed of 13 places in 244 ms
[2020-05-21 01:09:19] [INFO ] Deduced a trap composed of 39 places in 195 ms
[2020-05-21 01:09:20] [INFO ] Deduced a trap composed of 14 places in 226 ms
[2020-05-21 01:09:20] [INFO ] Deduced a trap composed of 40 places in 291 ms
[2020-05-21 01:09:20] [INFO ] Deduced a trap composed of 97 places in 230 ms
[2020-05-21 01:09:21] [INFO ] Deduced a trap composed of 132 places in 255 ms
[2020-05-21 01:09:21] [INFO ] Deduced a trap composed of 18 places in 238 ms
[2020-05-21 01:09:21] [INFO ] Deduced a trap composed of 39 places in 291 ms
[2020-05-21 01:09:22] [INFO ] Deduced a trap composed of 97 places in 272 ms
[2020-05-21 01:09:22] [INFO ] Deduced a trap composed of 18 places in 300 ms
[2020-05-21 01:09:22] [INFO ] Deduced a trap composed of 63 places in 297 ms
[2020-05-21 01:09:23] [INFO ] Deduced a trap composed of 17 places in 293 ms
[2020-05-21 01:09:23] [INFO ] Deduced a trap composed of 102 places in 184 ms
[2020-05-21 01:09:23] [INFO ] Deduced a trap composed of 61 places in 268 ms
[2020-05-21 01:09:24] [INFO ] Deduced a trap composed of 62 places in 161 ms
[2020-05-21 01:09:24] [INFO ] Deduced a trap composed of 89 places in 193 ms
[2020-05-21 01:09:24] [INFO ] Deduced a trap composed of 21 places in 213 ms
[2020-05-21 01:09:24] [INFO ] Deduced a trap composed of 87 places in 143 ms
[2020-05-21 01:09:25] [INFO ] Deduced a trap composed of 21 places in 254 ms
[2020-05-21 01:09:25] [INFO ] Deduced a trap composed of 66 places in 235 ms
[2020-05-21 01:09:25] [INFO ] Deduced a trap composed of 88 places in 180 ms
[2020-05-21 01:09:26] [INFO ] Deduced a trap composed of 128 places in 133 ms
[2020-05-21 01:09:26] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 7371 ms
[2020-05-21 01:09:26] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2020-05-21 01:09:26] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:26] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2020-05-21 01:09:26] [INFO ] [Real]Added 132 Read/Feed constraints in 21 ms returned sat
[2020-05-21 01:09:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:09:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:09:26] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:09:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:27] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2020-05-21 01:09:27] [INFO ] [Nat]Added 132 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:09:27] [INFO ] Deduced a trap composed of 16 places in 168 ms
[2020-05-21 01:09:28] [INFO ] Deduced a trap composed of 21 places in 168 ms
[2020-05-21 01:09:28] [INFO ] Deduced a trap composed of 14 places in 187 ms
[2020-05-21 01:09:28] [INFO ] Deduced a trap composed of 14 places in 177 ms
[2020-05-21 01:09:28] [INFO ] Deduced a trap composed of 10 places in 237 ms
[2020-05-21 01:09:28] [INFO ] Deduced a trap composed of 17 places in 227 ms
[2020-05-21 01:09:29] [INFO ] Deduced a trap composed of 13 places in 198 ms
[2020-05-21 01:09:29] [INFO ] Deduced a trap composed of 58 places in 137 ms
[2020-05-21 01:09:29] [INFO ] Deduced a trap composed of 58 places in 174 ms
[2020-05-21 01:09:29] [INFO ] Deduced a trap composed of 43 places in 174 ms
[2020-05-21 01:09:30] [INFO ] Deduced a trap composed of 43 places in 287 ms
[2020-05-21 01:09:30] [INFO ] Deduced a trap composed of 40 places in 176 ms
[2020-05-21 01:09:30] [INFO ] Deduced a trap composed of 36 places in 139 ms
[2020-05-21 01:09:30] [INFO ] Deduced a trap composed of 43 places in 157 ms
[2020-05-21 01:09:30] [INFO ] Deduced a trap composed of 35 places in 225 ms
[2020-05-21 01:09:31] [INFO ] Deduced a trap composed of 91 places in 291 ms
[2020-05-21 01:09:31] [INFO ] Deduced a trap composed of 42 places in 185 ms
[2020-05-21 01:09:31] [INFO ] Deduced a trap composed of 58 places in 128 ms
[2020-05-21 01:09:31] [INFO ] Deduced a trap composed of 61 places in 146 ms
[2020-05-21 01:09:31] [INFO ] Deduced a trap composed of 61 places in 143 ms
[2020-05-21 01:09:32] [INFO ] Deduced a trap composed of 84 places in 171 ms
[2020-05-21 01:09:32] [INFO ] Deduced a trap composed of 84 places in 180 ms
[2020-05-21 01:09:32] [INFO ] Deduced a trap composed of 58 places in 125 ms
[2020-05-21 01:09:32] [INFO ] Deduced a trap composed of 36 places in 85 ms
[2020-05-21 01:09:32] [INFO ] Deduced a trap composed of 10 places in 119 ms
[2020-05-21 01:09:32] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5126 ms
[2020-05-21 01:09:32] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 31 ms.
[2020-05-21 01:09:38] [INFO ] Added : 589 causal constraints over 118 iterations in 5854 ms. Result :sat
[2020-05-21 01:09:38] [INFO ] Deduced a trap composed of 83 places in 123 ms
[2020-05-21 01:09:38] [INFO ] Deduced a trap composed of 83 places in 120 ms
[2020-05-21 01:09:39] [INFO ] Deduced a trap composed of 80 places in 155 ms
[2020-05-21 01:09:39] [INFO ] Deduced a trap composed of 80 places in 138 ms
[2020-05-21 01:09:39] [INFO ] Deduced a trap composed of 79 places in 133 ms
[2020-05-21 01:09:40] [INFO ] Deduced a trap composed of 96 places in 110 ms
[2020-05-21 01:09:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1466 ms
[2020-05-21 01:09:40] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:09:40] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:09:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:40] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2020-05-21 01:09:40] [INFO ] [Real]Added 132 Read/Feed constraints in 23 ms returned sat
[2020-05-21 01:09:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:09:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:09:40] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:09:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:41] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2020-05-21 01:09:41] [INFO ] [Nat]Added 132 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:09:41] [INFO ] Deduced a trap composed of 10 places in 177 ms
[2020-05-21 01:09:41] [INFO ] Deduced a trap composed of 10 places in 212 ms
[2020-05-21 01:09:42] [INFO ] Deduced a trap composed of 12 places in 220 ms
[2020-05-21 01:09:42] [INFO ] Deduced a trap composed of 12 places in 223 ms
[2020-05-21 01:09:42] [INFO ] Deduced a trap composed of 32 places in 170 ms
[2020-05-21 01:09:42] [INFO ] Deduced a trap composed of 32 places in 206 ms
[2020-05-21 01:09:43] [INFO ] Deduced a trap composed of 50 places in 147 ms
[2020-05-21 01:09:43] [INFO ] Deduced a trap composed of 50 places in 150 ms
[2020-05-21 01:09:43] [INFO ] Deduced a trap composed of 58 places in 128 ms
[2020-05-21 01:09:43] [INFO ] Deduced a trap composed of 39 places in 91 ms
[2020-05-21 01:09:43] [INFO ] Deduced a trap composed of 40 places in 127 ms
[2020-05-21 01:09:43] [INFO ] Deduced a trap composed of 43 places in 182 ms
[2020-05-21 01:09:44] [INFO ] Deduced a trap composed of 10 places in 187 ms
[2020-05-21 01:09:44] [INFO ] Deduced a trap composed of 42 places in 196 ms
[2020-05-21 01:09:44] [INFO ] Deduced a trap composed of 10 places in 151 ms
[2020-05-21 01:09:44] [INFO ] Deduced a trap composed of 54 places in 97 ms
[2020-05-21 01:09:44] [INFO ] Deduced a trap composed of 13 places in 184 ms
[2020-05-21 01:09:44] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3425 ms
[2020-05-21 01:09:44] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 36 ms.
[2020-05-21 01:09:50] [INFO ] Added : 530 causal constraints over 106 iterations in 5288 ms. Result :sat
[2020-05-21 01:09:50] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2020-05-21 01:09:50] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:09:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:50] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2020-05-21 01:09:50] [INFO ] [Real]Added 132 Read/Feed constraints in 17 ms returned sat
[2020-05-21 01:09:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:09:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:09:51] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:09:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:51] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2020-05-21 01:09:51] [INFO ] [Nat]Added 132 Read/Feed constraints in 56 ms returned sat
[2020-05-21 01:09:51] [INFO ] Deduced a trap composed of 43 places in 201 ms
[2020-05-21 01:09:52] [INFO ] Deduced a trap composed of 31 places in 161 ms
[2020-05-21 01:09:52] [INFO ] Deduced a trap composed of 40 places in 155 ms
[2020-05-21 01:09:52] [INFO ] Deduced a trap composed of 97 places in 179 ms
[2020-05-21 01:09:52] [INFO ] Deduced a trap composed of 27 places in 162 ms
[2020-05-21 01:09:52] [INFO ] Deduced a trap composed of 32 places in 153 ms
[2020-05-21 01:09:53] [INFO ] Deduced a trap composed of 38 places in 173 ms
[2020-05-21 01:09:53] [INFO ] Deduced a trap composed of 10 places in 166 ms
[2020-05-21 01:09:53] [INFO ] Deduced a trap composed of 10 places in 164 ms
[2020-05-21 01:09:53] [INFO ] Deduced a trap composed of 44 places in 175 ms
[2020-05-21 01:09:53] [INFO ] Deduced a trap composed of 47 places in 144 ms
[2020-05-21 01:09:53] [INFO ] Deduced a trap composed of 21 places in 160 ms
[2020-05-21 01:09:54] [INFO ] Deduced a trap composed of 21 places in 172 ms
[2020-05-21 01:09:54] [INFO ] Deduced a trap composed of 14 places in 184 ms
[2020-05-21 01:09:54] [INFO ] Deduced a trap composed of 44 places in 129 ms
[2020-05-21 01:09:54] [INFO ] Deduced a trap composed of 69 places in 136 ms
[2020-05-21 01:09:54] [INFO ] Deduced a trap composed of 69 places in 139 ms
[2020-05-21 01:09:55] [INFO ] Deduced a trap composed of 69 places in 132 ms
[2020-05-21 01:09:55] [INFO ] Deduced a trap composed of 65 places in 132 ms
[2020-05-21 01:09:55] [INFO ] Deduced a trap composed of 105 places in 164 ms
[2020-05-21 01:09:55] [INFO ] Deduced a trap composed of 58 places in 112 ms
[2020-05-21 01:09:55] [INFO ] Deduced a trap composed of 36 places in 106 ms
[2020-05-21 01:09:55] [INFO ] Deduced a trap composed of 54 places in 149 ms
[2020-05-21 01:09:55] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4301 ms
[2020-05-21 01:09:56] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 47 ms.
[2020-05-21 01:10:01] [INFO ] Added : 572 causal constraints over 115 iterations in 5122 ms. Result :sat
[2020-05-21 01:10:01] [INFO ] Deduced a trap composed of 32 places in 174 ms
[2020-05-21 01:10:01] [INFO ] Deduced a trap composed of 43 places in 166 ms
[2020-05-21 01:10:01] [INFO ] Deduced a trap composed of 10 places in 185 ms
[2020-05-21 01:10:02] [INFO ] Deduced a trap composed of 69 places in 158 ms
[2020-05-21 01:10:02] [INFO ] Deduced a trap composed of 54 places in 210 ms
[2020-05-21 01:10:02] [INFO ] Deduced a trap composed of 96 places in 147 ms
[2020-05-21 01:10:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1611 ms
[2020-05-21 01:10:02] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2020-05-21 01:10:02] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:10:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:03] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2020-05-21 01:10:03] [INFO ] [Real]Added 132 Read/Feed constraints in 17 ms returned sat
[2020-05-21 01:10:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:10:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:10:03] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:10:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:04] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2020-05-21 01:10:04] [INFO ] [Nat]Added 132 Read/Feed constraints in 32 ms returned sat
[2020-05-21 01:10:04] [INFO ] Deduced a trap composed of 12 places in 221 ms
[2020-05-21 01:10:04] [INFO ] Deduced a trap composed of 43 places in 132 ms
[2020-05-21 01:10:04] [INFO ] Deduced a trap composed of 39 places in 131 ms
[2020-05-21 01:10:04] [INFO ] Deduced a trap composed of 44 places in 131 ms
[2020-05-21 01:10:05] [INFO ] Deduced a trap composed of 51 places in 132 ms
[2020-05-21 01:10:05] [INFO ] Deduced a trap composed of 66 places in 137 ms
[2020-05-21 01:10:05] [INFO ] Deduced a trap composed of 85 places in 118 ms
[2020-05-21 01:10:05] [INFO ] Deduced a trap composed of 62 places in 103 ms
[2020-05-21 01:10:05] [INFO ] Deduced a trap composed of 65 places in 108 ms
[2020-05-21 01:10:05] [INFO ] Deduced a trap composed of 10 places in 77 ms
[2020-05-21 01:10:05] [INFO ] Deduced a trap composed of 22 places in 128 ms
[2020-05-21 01:10:05] [INFO ] Deduced a trap composed of 13 places in 89 ms
[2020-05-21 01:10:06] [INFO ] Deduced a trap composed of 14 places in 93 ms
[2020-05-21 01:10:06] [INFO ] Deduced a trap composed of 10 places in 81 ms
[2020-05-21 01:10:06] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2024 ms
[2020-05-21 01:10:06] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 28 ms.
[2020-05-21 01:10:11] [INFO ] Added : 558 causal constraints over 112 iterations in 5120 ms. Result :sat
[2020-05-21 01:10:11] [INFO ] Deduced a trap composed of 19 places in 165 ms
[2020-05-21 01:10:11] [INFO ] Deduced a trap composed of 50 places in 221 ms
[2020-05-21 01:10:12] [INFO ] Deduced a trap composed of 17 places in 194 ms
[2020-05-21 01:10:12] [INFO ] Deduced a trap composed of 50 places in 158 ms
[2020-05-21 01:10:12] [INFO ] Deduced a trap composed of 72 places in 152 ms
[2020-05-21 01:10:12] [INFO ] Deduced a trap composed of 54 places in 105 ms
[2020-05-21 01:10:12] [INFO ] Deduced a trap composed of 76 places in 153 ms
[2020-05-21 01:10:13] [INFO ] Deduced a trap composed of 50 places in 85 ms
[2020-05-21 01:10:13] [INFO ] Deduced a trap composed of 61 places in 97 ms
[2020-05-21 01:10:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2093 ms
[2020-05-21 01:10:13] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2020-05-21 01:10:13] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:10:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:14] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2020-05-21 01:10:14] [INFO ] [Real]Added 132 Read/Feed constraints in 19 ms returned sat
[2020-05-21 01:10:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:10:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:10:14] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:10:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:14] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2020-05-21 01:10:14] [INFO ] [Nat]Added 132 Read/Feed constraints in 37 ms returned sat
[2020-05-21 01:10:15] [INFO ] Deduced a trap composed of 12 places in 220 ms
[2020-05-21 01:10:15] [INFO ] Deduced a trap composed of 10 places in 175 ms
[2020-05-21 01:10:15] [INFO ] Deduced a trap composed of 14 places in 228 ms
[2020-05-21 01:10:15] [INFO ] Deduced a trap composed of 19 places in 163 ms
[2020-05-21 01:10:15] [INFO ] Deduced a trap composed of 32 places in 139 ms
[2020-05-21 01:10:16] [INFO ] Deduced a trap composed of 54 places in 165 ms
[2020-05-21 01:10:16] [INFO ] Deduced a trap composed of 66 places in 144 ms
[2020-05-21 01:10:16] [INFO ] Deduced a trap composed of 27 places in 153 ms
[2020-05-21 01:10:16] [INFO ] Deduced a trap composed of 39 places in 144 ms
[2020-05-21 01:10:16] [INFO ] Deduced a trap composed of 42 places in 147 ms
[2020-05-21 01:10:16] [INFO ] Deduced a trap composed of 36 places in 98 ms
[2020-05-21 01:10:17] [INFO ] Deduced a trap composed of 39 places in 114 ms
[2020-05-21 01:10:17] [INFO ] Deduced a trap composed of 40 places in 94 ms
[2020-05-21 01:10:17] [INFO ] Deduced a trap composed of 58 places in 83 ms
[2020-05-21 01:10:17] [INFO ] Deduced a trap composed of 58 places in 101 ms
[2020-05-21 01:10:17] [INFO ] Deduced a trap composed of 61 places in 101 ms
[2020-05-21 01:10:17] [INFO ] Deduced a trap composed of 58 places in 82 ms
[2020-05-21 01:10:17] [INFO ] Deduced a trap composed of 57 places in 82 ms
[2020-05-21 01:10:17] [INFO ] Deduced a trap composed of 13 places in 88 ms
[2020-05-21 01:10:17] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3013 ms
[2020-05-21 01:10:17] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 28 ms.
[2020-05-21 01:10:24] [INFO ] Added : 625 causal constraints over 125 iterations in 6296 ms. Result :sat
[2020-05-21 01:10:24] [INFO ] Deduced a trap composed of 14 places in 81 ms
[2020-05-21 01:10:24] [INFO ] Deduced a trap composed of 31 places in 195 ms
[2020-05-21 01:10:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 461 ms
[2020-05-21 01:10:24] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:10:24] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:10:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:25] [INFO ] [Real]Absence check using state equation in 639 ms returned sat
[2020-05-21 01:10:25] [INFO ] [Real]Added 132 Read/Feed constraints in 22 ms returned sat
[2020-05-21 01:10:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:10:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:10:25] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:10:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:26] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2020-05-21 01:10:26] [INFO ] [Nat]Added 132 Read/Feed constraints in 34 ms returned sat
[2020-05-21 01:10:26] [INFO ] Deduced a trap composed of 39 places in 164 ms
[2020-05-21 01:10:26] [INFO ] Deduced a trap composed of 39 places in 204 ms
[2020-05-21 01:10:26] [INFO ] Deduced a trap composed of 40 places in 230 ms
[2020-05-21 01:10:27] [INFO ] Deduced a trap composed of 18 places in 206 ms
[2020-05-21 01:10:27] [INFO ] Deduced a trap composed of 23 places in 169 ms
[2020-05-21 01:10:27] [INFO ] Deduced a trap composed of 14 places in 182 ms
[2020-05-21 01:10:27] [INFO ] Deduced a trap composed of 17 places in 196 ms
[2020-05-21 01:10:27] [INFO ] Deduced a trap composed of 13 places in 204 ms
[2020-05-21 01:10:28] [INFO ] Deduced a trap composed of 40 places in 142 ms
[2020-05-21 01:10:28] [INFO ] Deduced a trap composed of 102 places in 103 ms
[2020-05-21 01:10:28] [INFO ] Deduced a trap composed of 61 places in 98 ms
[2020-05-21 01:10:28] [INFO ] Deduced a trap composed of 48 places in 100 ms
[2020-05-21 01:10:28] [INFO ] Deduced a trap composed of 69 places in 83 ms
[2020-05-21 01:10:28] [INFO ] Deduced a trap composed of 69 places in 83 ms
[2020-05-21 01:10:28] [INFO ] Deduced a trap composed of 62 places in 98 ms
[2020-05-21 01:10:29] [INFO ] Deduced a trap composed of 39 places in 100 ms
[2020-05-21 01:10:29] [INFO ] Deduced a trap composed of 62 places in 112 ms
[2020-05-21 01:10:29] [INFO ] Deduced a trap composed of 84 places in 136 ms
[2020-05-21 01:10:29] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3270 ms
[2020-05-21 01:10:29] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 39 ms.
[2020-05-21 01:10:34] [INFO ] Added : 592 causal constraints over 119 iterations in 5552 ms. Result :sat
[2020-05-21 01:10:35] [INFO ] Deduced a trap composed of 27 places in 245 ms
[2020-05-21 01:10:35] [INFO ] Deduced a trap composed of 42 places in 263 ms
[2020-05-21 01:10:35] [INFO ] Deduced a trap composed of 92 places in 291 ms
[2020-05-21 01:10:36] [INFO ] Deduced a trap composed of 27 places in 262 ms
[2020-05-21 01:10:36] [INFO ] Deduced a trap composed of 42 places in 265 ms
[2020-05-21 01:10:36] [INFO ] Deduced a trap composed of 42 places in 277 ms
[2020-05-21 01:10:37] [INFO ] Deduced a trap composed of 10 places in 221 ms
[2020-05-21 01:10:37] [INFO ] Deduced a trap composed of 30 places in 212 ms
[2020-05-21 01:10:37] [INFO ] Deduced a trap composed of 27 places in 225 ms
[2020-05-21 01:10:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2974 ms
[2020-05-21 01:10:37] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:10:37] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:10:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:38] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2020-05-21 01:10:38] [INFO ] [Real]Added 132 Read/Feed constraints in 15 ms returned sat
[2020-05-21 01:10:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:10:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:10:38] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:10:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:39] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2020-05-21 01:10:39] [INFO ] [Nat]Added 132 Read/Feed constraints in 34 ms returned sat
[2020-05-21 01:10:39] [INFO ] Deduced a trap composed of 62 places in 201 ms
[2020-05-21 01:10:39] [INFO ] Deduced a trap composed of 36 places in 179 ms
[2020-05-21 01:10:40] [INFO ] Deduced a trap composed of 36 places in 259 ms
[2020-05-21 01:10:40] [INFO ] Deduced a trap composed of 10 places in 173 ms
[2020-05-21 01:10:40] [INFO ] Deduced a trap composed of 62 places in 200 ms
[2020-05-21 01:10:40] [INFO ] Deduced a trap composed of 37 places in 161 ms
[2020-05-21 01:10:40] [INFO ] Deduced a trap composed of 57 places in 212 ms
[2020-05-21 01:10:41] [INFO ] Deduced a trap composed of 58 places in 196 ms
[2020-05-21 01:10:41] [INFO ] Deduced a trap composed of 14 places in 233 ms
[2020-05-21 01:10:41] [INFO ] Deduced a trap composed of 10 places in 205 ms
[2020-05-21 01:10:41] [INFO ] Deduced a trap composed of 69 places in 226 ms
[2020-05-21 01:10:42] [INFO ] Deduced a trap composed of 69 places in 197 ms
[2020-05-21 01:10:42] [INFO ] Deduced a trap composed of 14 places in 191 ms
[2020-05-21 01:10:42] [INFO ] Deduced a trap composed of 39 places in 146 ms
[2020-05-21 01:10:42] [INFO ] Deduced a trap composed of 42 places in 126 ms
[2020-05-21 01:10:42] [INFO ] Deduced a trap composed of 39 places in 117 ms
[2020-05-21 01:10:42] [INFO ] Deduced a trap composed of 61 places in 117 ms
[2020-05-21 01:10:43] [INFO ] Deduced a trap composed of 62 places in 135 ms
[2020-05-21 01:10:43] [INFO ] Deduced a trap composed of 40 places in 156 ms
[2020-05-21 01:10:43] [INFO ] Deduced a trap composed of 44 places in 116 ms
[2020-05-21 01:10:43] [INFO ] Deduced a trap composed of 84 places in 151 ms
[2020-05-21 01:10:43] [INFO ] Deduced a trap composed of 40 places in 41 ms
[2020-05-21 01:10:43] [INFO ] Deduced a trap composed of 65 places in 105 ms
[2020-05-21 01:10:43] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4466 ms
[2020-05-21 01:10:43] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 44 ms.
[2020-05-21 01:10:48] [INFO ] Added : 531 causal constraints over 107 iterations in 5147 ms. Result :sat
[2020-05-21 01:10:49] [INFO ] Deduced a trap composed of 47 places in 222 ms
[2020-05-21 01:10:49] [INFO ] Deduced a trap composed of 10 places in 186 ms
[2020-05-21 01:10:49] [INFO ] Deduced a trap composed of 10 places in 219 ms
[2020-05-21 01:10:50] [INFO ] Deduced a trap composed of 32 places in 194 ms
[2020-05-21 01:10:50] [INFO ] Deduced a trap composed of 39 places in 180 ms
[2020-05-21 01:10:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1395 ms
[2020-05-21 01:10:50] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:10:50] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:10:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:51] [INFO ] [Real]Absence check using state equation in 678 ms returned sat
[2020-05-21 01:10:51] [INFO ] [Real]Added 132 Read/Feed constraints in 18 ms returned sat
[2020-05-21 01:10:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:10:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:10:51] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:10:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:10:51] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2020-05-21 01:10:51] [INFO ] [Nat]Added 132 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:10:52] [INFO ] Deduced a trap composed of 12 places in 210 ms
[2020-05-21 01:10:52] [INFO ] Deduced a trap composed of 32 places in 210 ms
[2020-05-21 01:10:52] [INFO ] Deduced a trap composed of 10 places in 207 ms
[2020-05-21 01:10:52] [INFO ] Deduced a trap composed of 12 places in 210 ms
[2020-05-21 01:10:53] [INFO ] Deduced a trap composed of 16 places in 206 ms
[2020-05-21 01:10:53] [INFO ] Deduced a trap composed of 10 places in 211 ms
[2020-05-21 01:10:53] [INFO ] Deduced a trap composed of 87 places in 222 ms
[2020-05-21 01:10:53] [INFO ] Deduced a trap composed of 54 places in 137 ms
[2020-05-21 01:10:53] [INFO ] Deduced a trap composed of 32 places in 134 ms
[2020-05-21 01:10:54] [INFO ] Deduced a trap composed of 32 places in 143 ms
[2020-05-21 01:10:54] [INFO ] Deduced a trap composed of 32 places in 141 ms
[2020-05-21 01:10:54] [INFO ] Deduced a trap composed of 54 places in 119 ms
[2020-05-21 01:10:54] [INFO ] Deduced a trap composed of 54 places in 101 ms
[2020-05-21 01:10:54] [INFO ] Deduced a trap composed of 50 places in 105 ms
[2020-05-21 01:10:54] [INFO ] Deduced a trap composed of 10 places in 208 ms
[2020-05-21 01:10:55] [INFO ] Deduced a trap composed of 76 places in 109 ms
[2020-05-21 01:10:55] [INFO ] Deduced a trap composed of 76 places in 126 ms
[2020-05-21 01:10:55] [INFO ] Deduced a trap composed of 76 places in 137 ms
[2020-05-21 01:10:55] [INFO ] Deduced a trap composed of 76 places in 122 ms
[2020-05-21 01:10:55] [INFO ] Deduced a trap composed of 36 places in 165 ms
[2020-05-21 01:10:55] [INFO ] Deduced a trap composed of 39 places in 172 ms
[2020-05-21 01:10:56] [INFO ] Deduced a trap composed of 58 places in 200 ms
[2020-05-21 01:10:56] [INFO ] Deduced a trap composed of 58 places in 175 ms
[2020-05-21 01:10:56] [INFO ] Deduced a trap composed of 58 places in 174 ms
[2020-05-21 01:10:56] [INFO ] Deduced a trap composed of 36 places in 177 ms
[2020-05-21 01:10:57] [INFO ] Deduced a trap composed of 42 places in 170 ms
[2020-05-21 01:10:57] [INFO ] Deduced a trap composed of 58 places in 157 ms
[2020-05-21 01:10:57] [INFO ] Deduced a trap composed of 65 places in 173 ms
[2020-05-21 01:10:57] [INFO ] Deduced a trap composed of 92 places in 95 ms
[2020-05-21 01:10:57] [INFO ] Deduced a trap composed of 91 places in 101 ms
[2020-05-21 01:10:57] [INFO ] Deduced a trap composed of 92 places in 95 ms
[2020-05-21 01:10:57] [INFO ] Deduced a trap composed of 13 places in 207 ms
[2020-05-21 01:10:58] [INFO ] Deduced a trap composed of 23 places in 211 ms
[2020-05-21 01:10:58] [INFO ] Deduced a trap composed of 30 places in 124 ms
[2020-05-21 01:10:58] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 6469 ms
[2020-05-21 01:10:58] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 30 ms.
[2020-05-21 01:11:03] [INFO ] Added : 550 causal constraints over 110 iterations in 4680 ms. Result :sat
[2020-05-21 01:11:03] [INFO ] Deduced a trap composed of 69 places in 191 ms
[2020-05-21 01:11:03] [INFO ] Deduced a trap composed of 35 places in 168 ms
[2020-05-21 01:11:03] [INFO ] Deduced a trap composed of 69 places in 195 ms
[2020-05-21 01:11:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 993 ms
[2020-05-21 01:11:04] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:11:04] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:11:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:04] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2020-05-21 01:11:04] [INFO ] [Real]Added 132 Read/Feed constraints in 22 ms returned sat
[2020-05-21 01:11:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:11:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:11:04] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:11:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:05] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2020-05-21 01:11:05] [INFO ] [Nat]Added 132 Read/Feed constraints in 34 ms returned sat
[2020-05-21 01:11:05] [INFO ] Deduced a trap composed of 27 places in 164 ms
[2020-05-21 01:11:06] [INFO ] Deduced a trap composed of 39 places in 180 ms
[2020-05-21 01:11:06] [INFO ] Deduced a trap composed of 36 places in 163 ms
[2020-05-21 01:11:06] [INFO ] Deduced a trap composed of 36 places in 161 ms
[2020-05-21 01:11:06] [INFO ] Deduced a trap composed of 37 places in 185 ms
[2020-05-21 01:11:06] [INFO ] Deduced a trap composed of 12 places in 178 ms
[2020-05-21 01:11:06] [INFO ] Deduced a trap composed of 37 places in 163 ms
[2020-05-21 01:11:07] [INFO ] Deduced a trap composed of 27 places in 184 ms
[2020-05-21 01:11:07] [INFO ] Deduced a trap composed of 10 places in 162 ms
[2020-05-21 01:11:07] [INFO ] Deduced a trap composed of 10 places in 176 ms
[2020-05-21 01:11:07] [INFO ] Deduced a trap composed of 10 places in 204 ms
[2020-05-21 01:11:07] [INFO ] Deduced a trap composed of 36 places in 165 ms
[2020-05-21 01:11:08] [INFO ] Deduced a trap composed of 54 places in 164 ms
[2020-05-21 01:11:08] [INFO ] Deduced a trap composed of 54 places in 180 ms
[2020-05-21 01:11:08] [INFO ] Deduced a trap composed of 76 places in 151 ms
[2020-05-21 01:11:08] [INFO ] Deduced a trap composed of 76 places in 204 ms
[2020-05-21 01:11:08] [INFO ] Deduced a trap composed of 58 places in 130 ms
[2020-05-21 01:11:09] [INFO ] Deduced a trap composed of 54 places in 152 ms
[2020-05-21 01:11:09] [INFO ] Deduced a trap composed of 42 places in 154 ms
[2020-05-21 01:11:09] [INFO ] Deduced a trap composed of 13 places in 85 ms
[2020-05-21 01:11:09] [INFO ] Deduced a trap composed of 55 places in 106 ms
[2020-05-21 01:11:09] [INFO ] Deduced a trap composed of 45 places in 116 ms
[2020-05-21 01:11:09] [INFO ] Deduced a trap composed of 92 places in 131 ms
[2020-05-21 01:11:10] [INFO ] Deduced a trap composed of 92 places in 113 ms
[2020-05-21 01:11:10] [INFO ] Deduced a trap composed of 80 places in 153 ms
[2020-05-21 01:11:10] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4626 ms
[2020-05-21 01:11:10] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 52 ms.
[2020-05-21 01:11:15] [INFO ] Added : 551 causal constraints over 111 iterations in 5547 ms. Result :sat
[2020-05-21 01:11:16] [INFO ] Deduced a trap composed of 65 places in 172 ms
[2020-05-21 01:11:16] [INFO ] Deduced a trap composed of 65 places in 139 ms
[2020-05-21 01:11:16] [INFO ] Deduced a trap composed of 66 places in 151 ms
[2020-05-21 01:11:16] [INFO ] Deduced a trap composed of 21 places in 211 ms
[2020-05-21 01:11:17] [INFO ] Deduced a trap composed of 22 places in 226 ms
[2020-05-21 01:11:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1456 ms
[2020-05-21 01:11:17] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:11:17] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:11:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:18] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2020-05-21 01:11:18] [INFO ] [Real]Added 132 Read/Feed constraints in 21 ms returned sat
[2020-05-21 01:11:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:11:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:11:18] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:11:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:18] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2020-05-21 01:11:18] [INFO ] [Nat]Added 132 Read/Feed constraints in 32 ms returned sat
[2020-05-21 01:11:18] [INFO ] Deduced a trap composed of 32 places in 188 ms
[2020-05-21 01:11:19] [INFO ] Deduced a trap composed of 32 places in 191 ms
[2020-05-21 01:11:19] [INFO ] Deduced a trap composed of 68 places in 206 ms
[2020-05-21 01:11:19] [INFO ] Deduced a trap composed of 25 places in 160 ms
[2020-05-21 01:11:19] [INFO ] Deduced a trap composed of 10 places in 149 ms
[2020-05-21 01:11:19] [INFO ] Deduced a trap composed of 39 places in 211 ms
[2020-05-21 01:11:20] [INFO ] Deduced a trap composed of 76 places in 206 ms
[2020-05-21 01:11:20] [INFO ] Deduced a trap composed of 54 places in 167 ms
[2020-05-21 01:11:20] [INFO ] Deduced a trap composed of 10 places in 161 ms
[2020-05-21 01:11:20] [INFO ] Deduced a trap composed of 10 places in 177 ms
[2020-05-21 01:11:20] [INFO ] Deduced a trap composed of 25 places in 153 ms
[2020-05-21 01:11:21] [INFO ] Deduced a trap composed of 94 places in 120 ms
[2020-05-21 01:11:21] [INFO ] Deduced a trap composed of 32 places in 144 ms
[2020-05-21 01:11:21] [INFO ] Deduced a trap composed of 40 places in 96 ms
[2020-05-21 01:11:21] [INFO ] Deduced a trap composed of 61 places in 116 ms
[2020-05-21 01:11:21] [INFO ] Deduced a trap composed of 62 places in 118 ms
[2020-05-21 01:11:21] [INFO ] Deduced a trap composed of 62 places in 118 ms
[2020-05-21 01:11:21] [INFO ] Deduced a trap composed of 84 places in 122 ms
[2020-05-21 01:11:22] [INFO ] Deduced a trap composed of 83 places in 123 ms
[2020-05-21 01:11:22] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3414 ms
[2020-05-21 01:11:22] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 28 ms.
[2020-05-21 01:11:27] [INFO ] Added : 537 causal constraints over 108 iterations in 5159 ms. Result :sat
[2020-05-21 01:11:27] [INFO ] Deduced a trap composed of 10 places in 201 ms
[2020-05-21 01:11:27] [INFO ] Deduced a trap composed of 65 places in 117 ms
[2020-05-21 01:11:27] [INFO ] Deduced a trap composed of 66 places in 120 ms
[2020-05-21 01:11:28] [INFO ] Deduced a trap composed of 13 places in 242 ms
[2020-05-21 01:11:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 999 ms
[2020-05-21 01:11:28] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:11:28] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:11:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:29] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2020-05-21 01:11:29] [INFO ] [Real]Added 132 Read/Feed constraints in 20 ms returned sat
[2020-05-21 01:11:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:11:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:11:29] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:11:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:29] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2020-05-21 01:11:29] [INFO ] [Nat]Added 132 Read/Feed constraints in 30 ms returned sat
[2020-05-21 01:11:30] [INFO ] Deduced a trap composed of 10 places in 171 ms
[2020-05-21 01:11:30] [INFO ] Deduced a trap composed of 32 places in 228 ms
[2020-05-21 01:11:30] [INFO ] Deduced a trap composed of 54 places in 198 ms
[2020-05-21 01:11:30] [INFO ] Deduced a trap composed of 10 places in 208 ms
[2020-05-21 01:11:30] [INFO ] Deduced a trap composed of 14 places in 187 ms
[2020-05-21 01:11:31] [INFO ] Deduced a trap composed of 54 places in 170 ms
[2020-05-21 01:11:31] [INFO ] Deduced a trap composed of 27 places in 147 ms
[2020-05-21 01:11:31] [INFO ] Deduced a trap composed of 21 places in 145 ms
[2020-05-21 01:11:31] [INFO ] Deduced a trap composed of 61 places in 132 ms
[2020-05-21 01:11:31] [INFO ] Deduced a trap composed of 10 places in 228 ms
[2020-05-21 01:11:32] [INFO ] Deduced a trap composed of 32 places in 180 ms
[2020-05-21 01:11:32] [INFO ] Deduced a trap composed of 54 places in 141 ms
[2020-05-21 01:11:32] [INFO ] Deduced a trap composed of 36 places in 122 ms
[2020-05-21 01:11:32] [INFO ] Deduced a trap composed of 40 places in 126 ms
[2020-05-21 01:11:32] [INFO ] Deduced a trap composed of 69 places in 72 ms
[2020-05-21 01:11:32] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2879 ms
[2020-05-21 01:11:32] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 29 ms.
[2020-05-21 01:11:38] [INFO ] Added : 569 causal constraints over 114 iterations in 5490 ms. Result :sat
[2020-05-21 01:11:38] [INFO ] Deduced a trap composed of 88 places in 204 ms
[2020-05-21 01:11:38] [INFO ] Deduced a trap composed of 21 places in 204 ms
[2020-05-21 01:11:38] [INFO ] Deduced a trap composed of 61 places in 178 ms
[2020-05-21 01:11:39] [INFO ] Deduced a trap composed of 27 places in 225 ms
[2020-05-21 01:11:39] [INFO ] Deduced a trap composed of 39 places in 180 ms
[2020-05-21 01:11:39] [INFO ] Deduced a trap composed of 83 places in 127 ms
[2020-05-21 01:11:39] [INFO ] Deduced a trap composed of 62 places in 148 ms
[2020-05-21 01:11:40] [INFO ] Deduced a trap composed of 83 places in 71 ms
[2020-05-21 01:11:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1967 ms
[2020-05-21 01:11:40] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2020-05-21 01:11:40] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:11:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:40] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2020-05-21 01:11:40] [INFO ] [Real]Added 132 Read/Feed constraints in 20 ms returned sat
[2020-05-21 01:11:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:11:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:11:41] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:11:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:41] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2020-05-21 01:11:41] [INFO ] [Nat]Added 132 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:11:41] [INFO ] Deduced a trap composed of 14 places in 206 ms
[2020-05-21 01:11:42] [INFO ] Deduced a trap composed of 22 places in 214 ms
[2020-05-21 01:11:42] [INFO ] Deduced a trap composed of 12 places in 226 ms
[2020-05-21 01:11:42] [INFO ] Deduced a trap composed of 36 places in 239 ms
[2020-05-21 01:11:42] [INFO ] Deduced a trap composed of 51 places in 222 ms
[2020-05-21 01:11:43] [INFO ] Deduced a trap composed of 36 places in 270 ms
[2020-05-21 01:11:43] [INFO ] Deduced a trap composed of 58 places in 238 ms
[2020-05-21 01:11:43] [INFO ] Deduced a trap composed of 51 places in 254 ms
[2020-05-21 01:11:44] [INFO ] Deduced a trap composed of 58 places in 216 ms
[2020-05-21 01:11:44] [INFO ] Deduced a trap composed of 14 places in 280 ms
[2020-05-21 01:11:44] [INFO ] Deduced a trap composed of 10 places in 226 ms
[2020-05-21 01:11:44] [INFO ] Deduced a trap composed of 84 places in 199 ms
[2020-05-21 01:11:45] [INFO ] Deduced a trap composed of 27 places in 213 ms
[2020-05-21 01:11:45] [INFO ] Deduced a trap composed of 42 places in 249 ms
[2020-05-21 01:11:45] [INFO ] Deduced a trap composed of 62 places in 204 ms
[2020-05-21 01:11:45] [INFO ] Deduced a trap composed of 39 places in 184 ms
[2020-05-21 01:11:46] [INFO ] Deduced a trap composed of 61 places in 210 ms
[2020-05-21 01:11:46] [INFO ] Deduced a trap composed of 39 places in 176 ms
[2020-05-21 01:11:46] [INFO ] Deduced a trap composed of 61 places in 238 ms
[2020-05-21 01:11:46] [INFO ] Deduced a trap composed of 70 places in 207 ms
[2020-05-21 01:11:47] [INFO ] Deduced a trap composed of 38 places in 214 ms
[2020-05-21 01:11:47] [INFO ] Deduced a trap composed of 13 places in 200 ms
[2020-05-21 01:11:47] [INFO ] Deduced a trap composed of 84 places in 101 ms
[2020-05-21 01:11:47] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5727 ms
[2020-05-21 01:11:47] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 43 ms.
[2020-05-21 01:11:52] [INFO ] Added : 499 causal constraints over 100 iterations in 4830 ms. Result :sat
[2020-05-21 01:11:52] [INFO ] Deduced a trap composed of 23 places in 197 ms
[2020-05-21 01:11:52] [INFO ] Deduced a trap composed of 21 places in 218 ms
[2020-05-21 01:11:53] [INFO ] Deduced a trap composed of 19 places in 185 ms
[2020-05-21 01:11:53] [INFO ] Deduced a trap composed of 43 places in 192 ms
[2020-05-21 01:11:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1035 ms
[2020-05-21 01:11:53] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:11:53] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:11:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:54] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2020-05-21 01:11:54] [INFO ] [Real]Added 132 Read/Feed constraints in 15 ms returned sat
[2020-05-21 01:11:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:11:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:11:54] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:11:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:11:54] [INFO ] [Nat]Absence check using state equation in 626 ms returned sat
[2020-05-21 01:11:54] [INFO ] [Nat]Added 132 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:11:55] [INFO ] Deduced a trap composed of 32 places in 209 ms
[2020-05-21 01:11:55] [INFO ] Deduced a trap composed of 10 places in 215 ms
[2020-05-21 01:11:55] [INFO ] Deduced a trap composed of 25 places in 223 ms
[2020-05-21 01:11:55] [INFO ] Deduced a trap composed of 14 places in 216 ms
[2020-05-21 01:11:55] [INFO ] Deduced a trap composed of 14 places in 188 ms
[2020-05-21 01:11:56] [INFO ] Deduced a trap composed of 32 places in 201 ms
[2020-05-21 01:11:56] [INFO ] Deduced a trap composed of 10 places in 187 ms
[2020-05-21 01:11:56] [INFO ] Deduced a trap composed of 42 places in 158 ms
[2020-05-21 01:11:56] [INFO ] Deduced a trap composed of 54 places in 186 ms
[2020-05-21 01:11:57] [INFO ] Deduced a trap composed of 58 places in 196 ms
[2020-05-21 01:11:57] [INFO ] Deduced a trap composed of 27 places in 197 ms
[2020-05-21 01:11:57] [INFO ] Deduced a trap composed of 39 places in 187 ms
[2020-05-21 01:11:57] [INFO ] Deduced a trap composed of 32 places in 168 ms
[2020-05-21 01:11:57] [INFO ] Deduced a trap composed of 76 places in 127 ms
[2020-05-21 01:11:58] [INFO ] Deduced a trap composed of 76 places in 131 ms
[2020-05-21 01:11:58] [INFO ] Deduced a trap composed of 76 places in 145 ms
[2020-05-21 01:11:58] [INFO ] Deduced a trap composed of 76 places in 129 ms
[2020-05-21 01:11:58] [INFO ] Deduced a trap composed of 42 places in 104 ms
[2020-05-21 01:11:58] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3829 ms
[2020-05-21 01:11:58] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 27 ms.
[2020-05-21 01:12:04] [INFO ] Added : 557 causal constraints over 112 iterations in 5446 ms. Result :sat
[2020-05-21 01:12:04] [INFO ] Deduced a trap composed of 65 places in 206 ms
[2020-05-21 01:12:04] [INFO ] Deduced a trap composed of 65 places in 163 ms
[2020-05-21 01:12:04] [INFO ] Deduced a trap composed of 13 places in 150 ms
[2020-05-21 01:12:05] [INFO ] Deduced a trap composed of 62 places in 230 ms
[2020-05-21 01:12:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1094 ms
[2020-05-21 01:12:05] [INFO ] [Real]Absence check using 14 positive place invariants in 33 ms returned sat
[2020-05-21 01:12:05] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:12:05] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2020-05-21 01:12:05] [INFO ] [Real]Added 132 Read/Feed constraints in 18 ms returned sat
[2020-05-21 01:12:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:12:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2020-05-21 01:12:06] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:12:06] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2020-05-21 01:12:06] [INFO ] [Nat]Added 132 Read/Feed constraints in 44 ms returned sat
[2020-05-21 01:12:06] [INFO ] Deduced a trap composed of 54 places in 149 ms
[2020-05-21 01:12:07] [INFO ] Deduced a trap composed of 12 places in 190 ms
[2020-05-21 01:12:07] [INFO ] Deduced a trap composed of 12 places in 156 ms
[2020-05-21 01:12:07] [INFO ] Deduced a trap composed of 10 places in 155 ms
[2020-05-21 01:12:07] [INFO ] Deduced a trap composed of 10 places in 163 ms
[2020-05-21 01:12:07] [INFO ] Deduced a trap composed of 54 places in 164 ms
[2020-05-21 01:12:07] [INFO ] Deduced a trap composed of 42 places in 178 ms
[2020-05-21 01:12:08] [INFO ] Deduced a trap composed of 73 places in 124 ms
[2020-05-21 01:12:08] [INFO ] Deduced a trap composed of 42 places in 120 ms
[2020-05-21 01:12:08] [INFO ] Deduced a trap composed of 36 places in 131 ms
[2020-05-21 01:12:08] [INFO ] Deduced a trap composed of 36 places in 137 ms
[2020-05-21 01:12:08] [INFO ] Deduced a trap composed of 32 places in 182 ms
[2020-05-21 01:12:09] [INFO ] Deduced a trap composed of 32 places in 178 ms
[2020-05-21 01:12:09] [INFO ] Deduced a trap composed of 62 places in 107 ms
[2020-05-21 01:12:09] [INFO ] Deduced a trap composed of 58 places in 157 ms
[2020-05-21 01:12:09] [INFO ] Deduced a trap composed of 61 places in 157 ms
[2020-05-21 01:12:09] [INFO ] Deduced a trap composed of 35 places in 134 ms
[2020-05-21 01:12:09] [INFO ] Deduced a trap composed of 15 places in 153 ms
[2020-05-21 01:12:10] [INFO ] Deduced a trap composed of 14 places in 155 ms
[2020-05-21 01:12:10] [INFO ] Deduced a trap composed of 23 places in 181 ms
[2020-05-21 01:12:10] [INFO ] Deduced a trap composed of 65 places in 170 ms
[2020-05-21 01:12:10] [INFO ] Deduced a trap composed of 19 places in 164 ms
[2020-05-21 01:12:10] [INFO ] Deduced a trap composed of 43 places in 167 ms
[2020-05-21 01:12:11] [INFO ] Deduced a trap composed of 37 places in 164 ms
[2020-05-21 01:12:11] [INFO ] Deduced a trap composed of 36 places in 168 ms
[2020-05-21 01:12:11] [INFO ] Deduced a trap composed of 14 places in 168 ms
[2020-05-21 01:12:11] [INFO ] Deduced a trap composed of 65 places in 108 ms
[2020-05-21 01:12:11] [INFO ] Deduced a trap composed of 58 places in 140 ms
[2020-05-21 01:12:11] [INFO ] Deduced a trap composed of 57 places in 162 ms
[2020-05-21 01:12:12] [INFO ] Deduced a trap composed of 80 places in 150 ms
[2020-05-21 01:12:12] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5527 ms
[2020-05-21 01:12:12] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 36 ms.
[2020-05-21 01:12:17] [INFO ] Added : 573 causal constraints over 116 iterations in 5647 ms. Result :sat
[2020-05-21 01:12:18] [INFO ] Deduced a trap composed of 39 places in 247 ms
[2020-05-21 01:12:18] [INFO ] Deduced a trap composed of 63 places in 206 ms
[2020-05-21 01:12:18] [INFO ] Deduced a trap composed of 32 places in 228 ms
[2020-05-21 01:12:18] [INFO ] Deduced a trap composed of 65 places in 221 ms
[2020-05-21 01:12:19] [INFO ] Deduced a trap composed of 54 places in 185 ms
[2020-05-21 01:12:19] [INFO ] Deduced a trap composed of 31 places in 206 ms
[2020-05-21 01:12:20] [INFO ] Deduced a trap composed of 47 places in 214 ms
[2020-05-21 01:12:20] [INFO ] Deduced a trap composed of 65 places in 125 ms
[2020-05-21 01:12:20] [INFO ] Deduced a trap composed of 66 places in 142 ms
[2020-05-21 01:12:20] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2752 ms
[2020-05-21 01:12:20] [INFO ] [Real]Absence check using 14 positive place invariants in 27 ms returned sat
[2020-05-21 01:12:20] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:12:21] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2020-05-21 01:12:21] [INFO ] [Real]Added 132 Read/Feed constraints in 15 ms returned sat
[2020-05-21 01:12:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:12:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:12:21] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:12:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:12:22] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2020-05-21 01:12:22] [INFO ] [Nat]Added 132 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:12:22] [INFO ] Deduced a trap composed of 12 places in 157 ms
[2020-05-21 01:12:22] [INFO ] Deduced a trap composed of 10 places in 208 ms
[2020-05-21 01:12:22] [INFO ] Deduced a trap composed of 12 places in 208 ms
[2020-05-21 01:12:22] [INFO ] Deduced a trap composed of 27 places in 171 ms
[2020-05-21 01:12:23] [INFO ] Deduced a trap composed of 27 places in 164 ms
[2020-05-21 01:12:23] [INFO ] Deduced a trap composed of 27 places in 172 ms
[2020-05-21 01:12:23] [INFO ] Deduced a trap composed of 27 places in 174 ms
[2020-05-21 01:12:23] [INFO ] Deduced a trap composed of 21 places in 183 ms
[2020-05-21 01:12:23] [INFO ] Deduced a trap composed of 43 places in 193 ms
[2020-05-21 01:12:24] [INFO ] Deduced a trap composed of 44 places in 164 ms
[2020-05-21 01:12:24] [INFO ] Deduced a trap composed of 43 places in 140 ms
[2020-05-21 01:12:24] [INFO ] Deduced a trap composed of 43 places in 169 ms
[2020-05-21 01:12:24] [INFO ] Deduced a trap composed of 17 places in 173 ms
[2020-05-21 01:12:24] [INFO ] Deduced a trap composed of 10 places in 234 ms
[2020-05-21 01:12:25] [INFO ] Deduced a trap composed of 49 places in 216 ms
[2020-05-21 01:12:25] [INFO ] Deduced a trap composed of 10 places in 243 ms
[2020-05-21 01:12:25] [INFO ] Deduced a trap composed of 21 places in 184 ms
[2020-05-21 01:12:25] [INFO ] Deduced a trap composed of 18 places in 200 ms
[2020-05-21 01:12:26] [INFO ] Deduced a trap composed of 97 places in 189 ms
[2020-05-21 01:12:26] [INFO ] Deduced a trap composed of 70 places in 159 ms
[2020-05-21 01:12:26] [INFO ] Deduced a trap composed of 65 places in 138 ms
[2020-05-21 01:12:26] [INFO ] Deduced a trap composed of 58 places in 112 ms
[2020-05-21 01:12:26] [INFO ] Deduced a trap composed of 61 places in 101 ms
[2020-05-21 01:12:26] [INFO ] Deduced a trap composed of 35 places in 96 ms
[2020-05-21 01:12:27] [INFO ] Deduced a trap composed of 61 places in 144 ms
[2020-05-21 01:12:27] [INFO ] Deduced a trap composed of 43 places in 192 ms
[2020-05-21 01:12:27] [INFO ] Deduced a trap composed of 40 places in 197 ms
[2020-05-21 01:12:27] [INFO ] Deduced a trap composed of 84 places in 180 ms
[2020-05-21 01:12:27] [INFO ] Deduced a trap composed of 62 places in 157 ms
[2020-05-21 01:12:28] [INFO ] Deduced a trap composed of 83 places in 117 ms
[2020-05-21 01:12:28] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 6058 ms
[2020-05-21 01:12:28] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 39 ms.
[2020-05-21 01:12:34] [INFO ] Added : 624 causal constraints over 125 iterations in 6273 ms. Result :sat
[2020-05-21 01:12:34] [INFO ] Deduced a trap composed of 65 places in 264 ms
[2020-05-21 01:12:35] [INFO ] Deduced a trap composed of 14 places in 234 ms
[2020-05-21 01:12:35] [INFO ] Deduced a trap composed of 65 places in 255 ms
[2020-05-21 01:12:35] [INFO ] Deduced a trap composed of 36 places in 266 ms
[2020-05-21 01:12:35] [INFO ] Deduced a trap composed of 96 places in 145 ms
[2020-05-21 01:12:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1661 ms
[2020-05-21 01:12:36] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:12:36] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:12:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:12:36] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2020-05-21 01:12:36] [INFO ] [Real]Added 132 Read/Feed constraints in 19 ms returned sat
[2020-05-21 01:12:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:12:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:12:36] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:12:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:12:37] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2020-05-21 01:12:37] [INFO ] [Nat]Added 132 Read/Feed constraints in 34 ms returned sat
[2020-05-21 01:12:37] [INFO ] Deduced a trap composed of 10 places in 235 ms
[2020-05-21 01:12:38] [INFO ] Deduced a trap composed of 22 places in 268 ms
[2020-05-21 01:12:38] [INFO ] Deduced a trap composed of 10 places in 270 ms
[2020-05-21 01:12:38] [INFO ] Deduced a trap composed of 10 places in 268 ms
[2020-05-21 01:12:39] [INFO ] Deduced a trap composed of 32 places in 229 ms
[2020-05-21 01:12:39] [INFO ] Deduced a trap composed of 40 places in 253 ms
[2020-05-21 01:12:39] [INFO ] Deduced a trap composed of 40 places in 191 ms
[2020-05-21 01:12:39] [INFO ] Deduced a trap composed of 39 places in 234 ms
[2020-05-21 01:12:40] [INFO ] Deduced a trap composed of 47 places in 182 ms
[2020-05-21 01:12:40] [INFO ] Deduced a trap composed of 62 places in 153 ms
[2020-05-21 01:12:40] [INFO ] Deduced a trap composed of 62 places in 156 ms
[2020-05-21 01:12:40] [INFO ] Deduced a trap composed of 107 places in 200 ms
[2020-05-21 01:12:40] [INFO ] Deduced a trap composed of 62 places in 200 ms
[2020-05-21 01:12:41] [INFO ] Deduced a trap composed of 30 places in 226 ms
[2020-05-21 01:12:41] [INFO ] Deduced a trap composed of 35 places in 218 ms
[2020-05-21 01:12:41] [INFO ] Deduced a trap composed of 61 places in 178 ms
[2020-05-21 01:12:41] [INFO ] Deduced a trap composed of 13 places in 227 ms
[2020-05-21 01:12:42] [INFO ] Deduced a trap composed of 43 places in 208 ms
[2020-05-21 01:12:42] [INFO ] Deduced a trap composed of 58 places in 150 ms
[2020-05-21 01:12:42] [INFO ] Deduced a trap composed of 58 places in 151 ms
[2020-05-21 01:12:42] [INFO ] Deduced a trap composed of 131 places in 148 ms
[2020-05-21 01:12:42] [INFO ] Deduced a trap composed of 91 places in 162 ms
[2020-05-21 01:12:43] [INFO ] Deduced a trap composed of 58 places in 136 ms
[2020-05-21 01:12:43] [INFO ] Deduced a trap composed of 36 places in 166 ms
[2020-05-21 01:12:43] [INFO ] Deduced a trap composed of 80 places in 194 ms
[2020-05-21 01:12:43] [INFO ] Deduced a trap composed of 47 places in 179 ms
[2020-05-21 01:12:43] [INFO ] Deduced a trap composed of 89 places in 136 ms
[2020-05-21 01:12:43] [INFO ] Deduced a trap composed of 69 places in 92 ms
[2020-05-21 01:12:43] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6358 ms
[2020-05-21 01:12:44] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 28 ms.
[2020-05-21 01:12:49] [INFO ] Added : 560 causal constraints over 113 iterations in 5286 ms. Result :sat
[2020-05-21 01:12:49] [INFO ] Deduced a trap composed of 21 places in 317 ms
[2020-05-21 01:12:49] [INFO ] Deduced a trap composed of 32 places in 179 ms
[2020-05-21 01:12:50] [INFO ] Deduced a trap composed of 43 places in 244 ms
[2020-05-21 01:12:50] [INFO ] Deduced a trap composed of 69 places in 134 ms
[2020-05-21 01:12:50] [INFO ] Deduced a trap composed of 44 places in 152 ms
[2020-05-21 01:12:50] [INFO ] Deduced a trap composed of 111 places in 145 ms
[2020-05-21 01:12:51] [INFO ] Deduced a trap composed of 66 places in 161 ms
[2020-05-21 01:12:51] [INFO ] Deduced a trap composed of 21 places in 162 ms
[2020-05-21 01:12:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2317 ms
[2020-05-21 01:12:51] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2020-05-21 01:12:51] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:12:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:12:52] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2020-05-21 01:12:52] [INFO ] [Real]Added 132 Read/Feed constraints in 18 ms returned sat
[2020-05-21 01:12:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:12:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:12:52] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:12:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:12:52] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2020-05-21 01:12:53] [INFO ] [Nat]Added 132 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:12:53] [INFO ] Deduced a trap composed of 14 places in 182 ms
[2020-05-21 01:12:53] [INFO ] Deduced a trap composed of 47 places in 176 ms
[2020-05-21 01:12:53] [INFO ] Deduced a trap composed of 40 places in 176 ms
[2020-05-21 01:12:53] [INFO ] Deduced a trap composed of 14 places in 233 ms
[2020-05-21 01:12:54] [INFO ] Deduced a trap composed of 62 places in 169 ms
[2020-05-21 01:12:54] [INFO ] Deduced a trap composed of 112 places in 141 ms
[2020-05-21 01:12:54] [INFO ] Deduced a trap composed of 70 places in 182 ms
[2020-05-21 01:12:54] [INFO ] Deduced a trap composed of 42 places in 182 ms
[2020-05-21 01:12:54] [INFO ] Deduced a trap composed of 62 places in 143 ms
[2020-05-21 01:12:55] [INFO ] Deduced a trap composed of 44 places in 149 ms
[2020-05-21 01:12:55] [INFO ] Deduced a trap composed of 39 places in 204 ms
[2020-05-21 01:12:55] [INFO ] Deduced a trap composed of 39 places in 160 ms
[2020-05-21 01:12:55] [INFO ] Deduced a trap composed of 43 places in 129 ms
[2020-05-21 01:12:55] [INFO ] Deduced a trap composed of 62 places in 214 ms
[2020-05-21 01:12:56] [INFO ] Deduced a trap composed of 84 places in 195 ms
[2020-05-21 01:12:56] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3089 ms
[2020-05-21 01:12:56] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 38 ms.
[2020-05-21 01:13:01] [INFO ] Added : 546 causal constraints over 110 iterations in 5535 ms. Result :sat
[2020-05-21 01:13:01] [INFO ] Deduced a trap composed of 13 places in 248 ms
[2020-05-21 01:13:02] [INFO ] Deduced a trap composed of 10 places in 204 ms
[2020-05-21 01:13:02] [INFO ] Deduced a trap composed of 21 places in 224 ms
[2020-05-21 01:13:02] [INFO ] Deduced a trap composed of 40 places in 151 ms
[2020-05-21 01:13:02] [INFO ] Deduced a trap composed of 47 places in 145 ms
[2020-05-21 01:13:03] [INFO ] Deduced a trap composed of 61 places in 124 ms
[2020-05-21 01:13:03] [INFO ] Deduced a trap composed of 70 places in 111 ms
[2020-05-21 01:13:03] [INFO ] Deduced a trap composed of 70 places in 91 ms
[2020-05-21 01:13:03] [INFO ] Deduced a trap composed of 32 places in 167 ms
[2020-05-21 01:13:03] [INFO ] Deduced a trap composed of 10 places in 167 ms
[2020-05-21 01:13:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2454 ms
[2020-05-21 01:13:04] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2020-05-21 01:13:04] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:13:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:04] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2020-05-21 01:13:04] [INFO ] [Real]Added 132 Read/Feed constraints in 23 ms returned sat
[2020-05-21 01:13:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:13:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:13:04] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:13:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:05] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2020-05-21 01:13:05] [INFO ] [Nat]Added 132 Read/Feed constraints in 34 ms returned sat
[2020-05-21 01:13:05] [INFO ] Deduced a trap composed of 10 places in 201 ms
[2020-05-21 01:13:06] [INFO ] Deduced a trap composed of 10 places in 209 ms
[2020-05-21 01:13:06] [INFO ] Deduced a trap composed of 10 places in 151 ms
[2020-05-21 01:13:06] [INFO ] Deduced a trap composed of 10 places in 147 ms
[2020-05-21 01:13:06] [INFO ] Deduced a trap composed of 32 places in 172 ms
[2020-05-21 01:13:06] [INFO ] Deduced a trap composed of 39 places in 148 ms
[2020-05-21 01:13:06] [INFO ] Deduced a trap composed of 32 places in 169 ms
[2020-05-21 01:13:07] [INFO ] Deduced a trap composed of 42 places in 149 ms
[2020-05-21 01:13:07] [INFO ] Deduced a trap composed of 36 places in 143 ms
[2020-05-21 01:13:07] [INFO ] Deduced a trap composed of 50 places in 131 ms
[2020-05-21 01:13:07] [INFO ] Deduced a trap composed of 40 places in 145 ms
[2020-05-21 01:13:07] [INFO ] Deduced a trap composed of 18 places in 148 ms
[2020-05-21 01:13:07] [INFO ] Deduced a trap composed of 14 places in 132 ms
[2020-05-21 01:13:08] [INFO ] Deduced a trap composed of 17 places in 131 ms
[2020-05-21 01:13:08] [INFO ] Deduced a trap composed of 58 places in 138 ms
[2020-05-21 01:13:08] [INFO ] Deduced a trap composed of 83 places in 224 ms
[2020-05-21 01:13:08] [INFO ] Deduced a trap composed of 50 places in 131 ms
[2020-05-21 01:13:08] [INFO ] Deduced a trap composed of 50 places in 129 ms
[2020-05-21 01:13:09] [INFO ] Deduced a trap composed of 51 places in 152 ms
[2020-05-21 01:13:09] [INFO ] Deduced a trap composed of 62 places in 133 ms
[2020-05-21 01:13:09] [INFO ] Deduced a trap composed of 54 places in 128 ms
[2020-05-21 01:13:09] [INFO ] Deduced a trap composed of 32 places in 171 ms
[2020-05-21 01:13:09] [INFO ] Deduced a trap composed of 54 places in 154 ms
[2020-05-21 01:13:09] [INFO ] Deduced a trap composed of 54 places in 131 ms
[2020-05-21 01:13:10] [INFO ] Deduced a trap composed of 17 places in 130 ms
[2020-05-21 01:13:10] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4616 ms
[2020-05-21 01:13:10] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 40 ms.
[2020-05-21 01:13:16] [INFO ] Added : 625 causal constraints over 125 iterations in 6274 ms. Result :sat
[2020-05-21 01:13:16] [INFO ] Deduced a trap composed of 85 places in 243 ms
[2020-05-21 01:13:17] [INFO ] Deduced a trap composed of 47 places in 290 ms
[2020-05-21 01:13:17] [INFO ] Deduced a trap composed of 30 places in 227 ms
[2020-05-21 01:13:17] [INFO ] Deduced a trap composed of 38 places in 256 ms
[2020-05-21 01:13:17] [INFO ] Deduced a trap composed of 13 places in 241 ms
[2020-05-21 01:13:18] [INFO ] Deduced a trap composed of 57 places in 227 ms
[2020-05-21 01:13:18] [INFO ] Deduced a trap composed of 65 places in 215 ms
[2020-05-21 01:13:18] [INFO ] Deduced a trap composed of 80 places in 203 ms
[2020-05-21 01:13:19] [INFO ] Deduced a trap composed of 58 places in 203 ms
[2020-05-21 01:13:19] [INFO ] Deduced a trap composed of 14 places in 249 ms
[2020-05-21 01:13:19] [INFO ] Deduced a trap composed of 80 places in 153 ms
[2020-05-21 01:13:20] [INFO ] Deduced a trap composed of 79 places in 186 ms
[2020-05-21 01:13:20] [INFO ] Deduced a trap composed of 35 places in 111 ms
[2020-05-21 01:13:20] [INFO ] Deduced a trap composed of 77 places in 100 ms
[2020-05-21 01:13:20] [INFO ] Deduced a trap composed of 58 places in 102 ms
[2020-05-21 01:13:20] [INFO ] Deduced a trap composed of 36 places in 85 ms
[2020-05-21 01:13:21] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4570 ms
[2020-05-21 01:13:21] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2020-05-21 01:13:21] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:13:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:21] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2020-05-21 01:13:21] [INFO ] [Real]Added 132 Read/Feed constraints in 21 ms returned sat
[2020-05-21 01:13:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:13:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:13:21] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:13:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:22] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2020-05-21 01:13:22] [INFO ] [Nat]Added 132 Read/Feed constraints in 34 ms returned sat
[2020-05-21 01:13:22] [INFO ] Deduced a trap composed of 10 places in 196 ms
[2020-05-21 01:13:22] [INFO ] Deduced a trap composed of 10 places in 204 ms
[2020-05-21 01:13:23] [INFO ] Deduced a trap composed of 10 places in 198 ms
[2020-05-21 01:13:23] [INFO ] Deduced a trap composed of 10 places in 202 ms
[2020-05-21 01:13:23] [INFO ] Deduced a trap composed of 27 places in 234 ms
[2020-05-21 01:13:23] [INFO ] Deduced a trap composed of 27 places in 214 ms
[2020-05-21 01:13:24] [INFO ] Deduced a trap composed of 27 places in 263 ms
[2020-05-21 01:13:24] [INFO ] Deduced a trap composed of 27 places in 223 ms
[2020-05-21 01:13:24] [INFO ] Deduced a trap composed of 61 places in 210 ms
[2020-05-21 01:13:24] [INFO ] Deduced a trap composed of 62 places in 191 ms
[2020-05-21 01:13:25] [INFO ] Deduced a trap composed of 43 places in 191 ms
[2020-05-21 01:13:25] [INFO ] Deduced a trap composed of 40 places in 291 ms
[2020-05-21 01:13:25] [INFO ] Deduced a trap composed of 39 places in 204 ms
[2020-05-21 01:13:25] [INFO ] Deduced a trap composed of 65 places in 154 ms
[2020-05-21 01:13:26] [INFO ] Deduced a trap composed of 43 places in 166 ms
[2020-05-21 01:13:26] [INFO ] Deduced a trap composed of 42 places in 199 ms
[2020-05-21 01:13:26] [INFO ] Deduced a trap composed of 42 places in 153 ms
[2020-05-21 01:13:26] [INFO ] Deduced a trap composed of 42 places in 166 ms
[2020-05-21 01:13:26] [INFO ] Deduced a trap composed of 23 places in 175 ms
[2020-05-21 01:13:27] [INFO ] Deduced a trap composed of 13 places in 176 ms
[2020-05-21 01:13:27] [INFO ] Deduced a trap composed of 38 places in 208 ms
[2020-05-21 01:13:27] [INFO ] Deduced a trap composed of 89 places in 144 ms
[2020-05-21 01:13:27] [INFO ] Deduced a trap composed of 88 places in 129 ms
[2020-05-21 01:13:27] [INFO ] Deduced a trap composed of 88 places in 109 ms
[2020-05-21 01:13:27] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5424 ms
[2020-05-21 01:13:27] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 37 ms.
[2020-05-21 01:13:33] [INFO ] Added : 574 causal constraints over 117 iterations in 5922 ms. Result :sat
[2020-05-21 01:13:34] [INFO ] Deduced a trap composed of 30 places in 202 ms
[2020-05-21 01:13:34] [INFO ] Deduced a trap composed of 45 places in 222 ms
[2020-05-21 01:13:34] [INFO ] Deduced a trap composed of 42 places in 208 ms
[2020-05-21 01:13:34] [INFO ] Deduced a trap composed of 60 places in 128 ms
[2020-05-21 01:13:35] [INFO ] Deduced a trap composed of 64 places in 131 ms
[2020-05-21 01:13:35] [INFO ] Deduced a trap composed of 44 places in 228 ms
[2020-05-21 01:13:35] [INFO ] Deduced a trap composed of 44 places in 257 ms
[2020-05-21 01:13:36] [INFO ] Deduced a trap composed of 18 places in 254 ms
[2020-05-21 01:13:36] [INFO ] Deduced a trap composed of 43 places in 274 ms
[2020-05-21 01:13:36] [INFO ] Deduced a trap composed of 14 places in 261 ms
[2020-05-21 01:13:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3121 ms
[2020-05-21 01:13:37] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2020-05-21 01:13:37] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:13:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:37] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2020-05-21 01:13:37] [INFO ] [Real]Added 132 Read/Feed constraints in 17 ms returned sat
[2020-05-21 01:13:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:13:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:13:37] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:13:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:38] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2020-05-21 01:13:38] [INFO ] [Nat]Added 132 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:13:38] [INFO ] Deduced a trap composed of 12 places in 228 ms
[2020-05-21 01:13:38] [INFO ] Deduced a trap composed of 12 places in 156 ms
[2020-05-21 01:13:39] [INFO ] Deduced a trap composed of 32 places in 167 ms
[2020-05-21 01:13:39] [INFO ] Deduced a trap composed of 32 places in 168 ms
[2020-05-21 01:13:39] [INFO ] Deduced a trap composed of 32 places in 177 ms
[2020-05-21 01:13:39] [INFO ] Deduced a trap composed of 32 places in 155 ms
[2020-05-21 01:13:39] [INFO ] Deduced a trap composed of 37 places in 142 ms
[2020-05-21 01:13:39] [INFO ] Deduced a trap composed of 10 places in 158 ms
[2020-05-21 01:13:40] [INFO ] Deduced a trap composed of 62 places in 185 ms
[2020-05-21 01:13:40] [INFO ] Deduced a trap composed of 10 places in 195 ms
[2020-05-21 01:13:40] [INFO ] Deduced a trap composed of 61 places in 109 ms
[2020-05-21 01:13:40] [INFO ] Deduced a trap composed of 50 places in 125 ms
[2020-05-21 01:13:40] [INFO ] Deduced a trap composed of 54 places in 102 ms
[2020-05-21 01:13:41] [INFO ] Deduced a trap composed of 10 places in 189 ms
[2020-05-21 01:13:41] [INFO ] Deduced a trap composed of 14 places in 204 ms
[2020-05-21 01:13:41] [INFO ] Deduced a trap composed of 54 places in 165 ms
[2020-05-21 01:13:41] [INFO ] Deduced a trap composed of 54 places in 149 ms
[2020-05-21 01:13:41] [INFO ] Deduced a trap composed of 76 places in 165 ms
[2020-05-21 01:13:41] [INFO ] Deduced a trap composed of 76 places in 108 ms
[2020-05-21 01:13:42] [INFO ] Deduced a trap composed of 76 places in 112 ms
[2020-05-21 01:13:42] [INFO ] Deduced a trap composed of 76 places in 110 ms
[2020-05-21 01:13:42] [INFO ] Deduced a trap composed of 54 places in 114 ms
[2020-05-21 01:13:42] [INFO ] Deduced a trap composed of 63 places in 154 ms
[2020-05-21 01:13:42] [INFO ] Deduced a trap composed of 119 places in 160 ms
[2020-05-21 01:13:43] [INFO ] Deduced a trap composed of 98 places in 179 ms
[2020-05-21 01:13:43] [INFO ] Deduced a trap composed of 119 places in 197 ms
[2020-05-21 01:13:43] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4890 ms
[2020-05-21 01:13:43] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 32 ms.
[2020-05-21 01:13:48] [INFO ] Added : 548 causal constraints over 110 iterations in 4831 ms. Result :sat
[2020-05-21 01:13:48] [INFO ] Deduced a trap composed of 62 places in 245 ms
[2020-05-21 01:13:48] [INFO ] Deduced a trap composed of 21 places in 240 ms
[2020-05-21 01:13:49] [INFO ] Deduced a trap composed of 43 places in 235 ms
[2020-05-21 01:13:49] [INFO ] Deduced a trap composed of 58 places in 177 ms
[2020-05-21 01:13:49] [INFO ] Deduced a trap composed of 30 places in 173 ms
[2020-05-21 01:13:49] [INFO ] Deduced a trap composed of 66 places in 245 ms
[2020-05-21 01:13:50] [INFO ] Deduced a trap composed of 36 places in 227 ms
[2020-05-21 01:13:50] [INFO ] Deduced a trap composed of 69 places in 161 ms
[2020-05-21 01:13:50] [INFO ] Deduced a trap composed of 124 places in 209 ms
[2020-05-21 01:13:50] [INFO ] Deduced a trap composed of 69 places in 200 ms
[2020-05-21 01:13:51] [INFO ] Deduced a trap composed of 124 places in 186 ms
[2020-05-21 01:13:51] [INFO ] Deduced a trap composed of 79 places in 168 ms
[2020-05-21 01:13:51] [INFO ] Deduced a trap composed of 69 places in 164 ms
[2020-05-21 01:13:51] [INFO ] Deduced a trap composed of 21 places in 144 ms
[2020-05-21 01:13:52] [INFO ] Deduced a trap composed of 55 places in 175 ms
[2020-05-21 01:13:52] [INFO ] Deduced a trap composed of 63 places in 181 ms
[2020-05-21 01:13:52] [INFO ] Deduced a trap composed of 14 places in 224 ms
[2020-05-21 01:13:53] [INFO ] Deduced a trap composed of 67 places in 169 ms
[2020-05-21 01:13:53] [INFO ] Deduced a trap composed of 36 places in 187 ms
[2020-05-21 01:13:53] [INFO ] Deduced a trap composed of 48 places in 199 ms
[2020-05-21 01:13:53] [INFO ] Deduced a trap composed of 39 places in 184 ms
[2020-05-21 01:13:53] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5790 ms
[2020-05-21 01:13:53] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:13:53] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2020-05-21 01:13:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:54] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2020-05-21 01:13:54] [INFO ] [Real]Added 132 Read/Feed constraints in 36 ms returned sat
[2020-05-21 01:13:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:13:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:13:54] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:13:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:13:55] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2020-05-21 01:13:55] [INFO ] [Nat]Added 132 Read/Feed constraints in 45 ms returned sat
[2020-05-21 01:13:55] [INFO ] Deduced a trap composed of 19 places in 202 ms
[2020-05-21 01:13:55] [INFO ] Deduced a trap composed of 14 places in 201 ms
[2020-05-21 01:13:56] [INFO ] Deduced a trap composed of 14 places in 219 ms
[2020-05-21 01:13:56] [INFO ] Deduced a trap composed of 14 places in 180 ms
[2020-05-21 01:13:56] [INFO ] Deduced a trap composed of 32 places in 195 ms
[2020-05-21 01:13:56] [INFO ] Deduced a trap composed of 40 places in 249 ms
[2020-05-21 01:13:57] [INFO ] Deduced a trap composed of 32 places in 241 ms
[2020-05-21 01:13:57] [INFO ] Deduced a trap composed of 32 places in 228 ms
[2020-05-21 01:13:57] [INFO ] Deduced a trap composed of 39 places in 227 ms
[2020-05-21 01:13:57] [INFO ] Deduced a trap composed of 62 places in 194 ms
[2020-05-21 01:13:58] [INFO ] Deduced a trap composed of 62 places in 193 ms
[2020-05-21 01:13:58] [INFO ] Deduced a trap composed of 129 places in 179 ms
[2020-05-21 01:13:58] [INFO ] Deduced a trap composed of 62 places in 129 ms
[2020-05-21 01:13:58] [INFO ] Deduced a trap composed of 84 places in 198 ms
[2020-05-21 01:13:58] [INFO ] Deduced a trap composed of 61 places in 129 ms
[2020-05-21 01:13:58] [INFO ] Deduced a trap composed of 39 places in 123 ms
[2020-05-21 01:13:59] [INFO ] Deduced a trap composed of 61 places in 115 ms
[2020-05-21 01:13:59] [INFO ] Deduced a trap composed of 21 places in 99 ms
[2020-05-21 01:13:59] [INFO ] Deduced a trap composed of 84 places in 140 ms
[2020-05-21 01:13:59] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3998 ms
[2020-05-21 01:13:59] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 36 ms.
[2020-05-21 01:14:05] [INFO ] Added : 611 causal constraints over 123 iterations in 6094 ms. Result :sat
[2020-05-21 01:14:05] [INFO ] Deduced a trap composed of 47 places in 237 ms
[2020-05-21 01:14:06] [INFO ] Deduced a trap composed of 30 places in 236 ms
[2020-05-21 01:14:06] [INFO ] Deduced a trap composed of 66 places in 120 ms
[2020-05-21 01:14:06] [INFO ] Deduced a trap composed of 51 places in 167 ms
[2020-05-21 01:14:06] [INFO ] Deduced a trap composed of 50 places in 182 ms
[2020-05-21 01:14:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1374 ms
[2020-05-21 01:14:06] [INFO ] [Real]Absence check using 14 positive place invariants in 27 ms returned sat
[2020-05-21 01:14:06] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:14:07] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2020-05-21 01:14:07] [INFO ] [Real]Added 132 Read/Feed constraints in 19 ms returned sat
[2020-05-21 01:14:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:14:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:14:07] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:14:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:14:08] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2020-05-21 01:14:08] [INFO ] [Nat]Added 132 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:14:08] [INFO ] Deduced a trap composed of 10 places in 220 ms
[2020-05-21 01:14:08] [INFO ] Deduced a trap composed of 32 places in 182 ms
[2020-05-21 01:14:08] [INFO ] Deduced a trap composed of 32 places in 176 ms
[2020-05-21 01:14:09] [INFO ] Deduced a trap composed of 62 places in 165 ms
[2020-05-21 01:14:09] [INFO ] Deduced a trap composed of 32 places in 134 ms
[2020-05-21 01:14:09] [INFO ] Deduced a trap composed of 32 places in 183 ms
[2020-05-21 01:14:09] [INFO ] Deduced a trap composed of 10 places in 200 ms
[2020-05-21 01:14:09] [INFO ] Deduced a trap composed of 10 places in 198 ms
[2020-05-21 01:14:10] [INFO ] Deduced a trap composed of 10 places in 171 ms
[2020-05-21 01:14:10] [INFO ] Deduced a trap composed of 50 places in 152 ms
[2020-05-21 01:14:10] [INFO ] Deduced a trap composed of 54 places in 142 ms
[2020-05-21 01:14:10] [INFO ] Deduced a trap composed of 54 places in 133 ms
[2020-05-21 01:14:10] [INFO ] Deduced a trap composed of 76 places in 109 ms
[2020-05-21 01:14:10] [INFO ] Deduced a trap composed of 76 places in 107 ms
[2020-05-21 01:14:11] [INFO ] Deduced a trap composed of 76 places in 109 ms
[2020-05-21 01:14:11] [INFO ] Deduced a trap composed of 76 places in 110 ms
[2020-05-21 01:14:11] [INFO ] Deduced a trap composed of 40 places in 178 ms
[2020-05-21 01:14:11] [INFO ] Deduced a trap composed of 92 places in 105 ms
[2020-05-21 01:14:11] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3291 ms
[2020-05-21 01:14:11] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 30 ms.
[2020-05-21 01:14:17] [INFO ] Added : 625 causal constraints over 125 iterations in 6007 ms. Result :sat
[2020-05-21 01:14:17] [INFO ] Deduced a trap composed of 35 places in 181 ms
[2020-05-21 01:14:18] [INFO ] Deduced a trap composed of 42 places in 229 ms
[2020-05-21 01:14:18] [INFO ] Deduced a trap composed of 96 places in 229 ms
[2020-05-21 01:14:18] [INFO ] Deduced a trap composed of 69 places in 195 ms
[2020-05-21 01:14:18] [INFO ] Deduced a trap composed of 43 places in 162 ms
[2020-05-21 01:14:19] [INFO ] Deduced a trap composed of 39 places in 218 ms
[2020-05-21 01:14:19] [INFO ] Deduced a trap composed of 62 places in 147 ms
[2020-05-21 01:14:19] [INFO ] Deduced a trap composed of 65 places in 196 ms
[2020-05-21 01:14:19] [INFO ] Deduced a trap composed of 88 places in 130 ms
[2020-05-21 01:14:20] [INFO ] Deduced a trap composed of 61 places in 153 ms
[2020-05-21 01:14:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2678 ms
[2020-05-21 01:14:20] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:14:20] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:14:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:14:21] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2020-05-21 01:14:21] [INFO ] [Real]Added 132 Read/Feed constraints in 17 ms returned sat
[2020-05-21 01:14:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:14:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:14:21] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:14:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:14:21] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2020-05-21 01:14:21] [INFO ] [Nat]Added 132 Read/Feed constraints in 53 ms returned sat
[2020-05-21 01:14:22] [INFO ] Deduced a trap composed of 10 places in 184 ms
[2020-05-21 01:14:22] [INFO ] Deduced a trap composed of 58 places in 182 ms
[2020-05-21 01:14:22] [INFO ] Deduced a trap composed of 13 places in 157 ms
[2020-05-21 01:14:22] [INFO ] Deduced a trap composed of 10 places in 142 ms
[2020-05-21 01:14:22] [INFO ] Deduced a trap composed of 10 places in 147 ms
[2020-05-21 01:14:22] [INFO ] Deduced a trap composed of 10 places in 146 ms
[2020-05-21 01:14:23] [INFO ] Deduced a trap composed of 105 places in 208 ms
[2020-05-21 01:14:23] [INFO ] Deduced a trap composed of 27 places in 196 ms
[2020-05-21 01:14:23] [INFO ] Deduced a trap composed of 40 places in 201 ms
[2020-05-21 01:14:23] [INFO ] Deduced a trap composed of 36 places in 204 ms
[2020-05-21 01:14:24] [INFO ] Deduced a trap composed of 30 places in 254 ms
[2020-05-21 01:14:24] [INFO ] Deduced a trap composed of 27 places in 229 ms
[2020-05-21 01:14:24] [INFO ] Deduced a trap composed of 39 places in 230 ms
[2020-05-21 01:14:24] [INFO ] Deduced a trap composed of 54 places in 215 ms
[2020-05-21 01:14:25] [INFO ] Deduced a trap composed of 32 places in 191 ms
[2020-05-21 01:14:25] [INFO ] Deduced a trap composed of 32 places in 188 ms
[2020-05-21 01:14:25] [INFO ] Deduced a trap composed of 84 places in 208 ms
[2020-05-21 01:14:25] [INFO ] Deduced a trap composed of 54 places in 139 ms
[2020-05-21 01:14:25] [INFO ] Deduced a trap composed of 66 places in 141 ms
[2020-05-21 01:14:26] [INFO ] Deduced a trap composed of 57 places in 134 ms
[2020-05-21 01:14:26] [INFO ] Deduced a trap composed of 50 places in 152 ms
[2020-05-21 01:14:26] [INFO ] Deduced a trap composed of 31 places in 100 ms
[2020-05-21 01:14:26] [INFO ] Deduced a trap composed of 62 places in 99 ms
[2020-05-21 01:14:26] [INFO ] Deduced a trap composed of 56 places in 168 ms
[2020-05-21 01:14:26] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4913 ms
[2020-05-21 01:14:26] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 38 ms.
[2020-05-21 01:14:32] [INFO ] Added : 572 causal constraints over 115 iterations in 5922 ms. Result :sat
[2020-05-21 01:14:32] [INFO ] Deduced a trap composed of 21 places in 237 ms
[2020-05-21 01:14:33] [INFO ] Deduced a trap composed of 46 places in 175 ms
[2020-05-21 01:14:33] [INFO ] Deduced a trap composed of 36 places in 196 ms
[2020-05-21 01:14:33] [INFO ] Deduced a trap composed of 31 places in 168 ms
[2020-05-21 01:14:33] [INFO ] Deduced a trap composed of 80 places in 112 ms
[2020-05-21 01:14:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1335 ms
[2020-05-21 01:14:34] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:14:34] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:14:34] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2020-05-21 01:14:34] [INFO ] [Real]Added 132 Read/Feed constraints in 19 ms returned sat
[2020-05-21 01:14:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:14:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:14:34] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:14:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:14:35] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2020-05-21 01:14:35] [INFO ] [Nat]Added 132 Read/Feed constraints in 50 ms returned sat
[2020-05-21 01:14:35] [INFO ] Deduced a trap composed of 10 places in 216 ms
[2020-05-21 01:14:35] [INFO ] Deduced a trap composed of 10 places in 184 ms
[2020-05-21 01:14:36] [INFO ] Deduced a trap composed of 10 places in 197 ms
[2020-05-21 01:14:36] [INFO ] Deduced a trap composed of 10 places in 189 ms
[2020-05-21 01:14:36] [INFO ] Deduced a trap composed of 62 places in 153 ms
[2020-05-21 01:14:36] [INFO ] Deduced a trap composed of 69 places in 156 ms
[2020-05-21 01:14:36] [INFO ] Deduced a trap composed of 17 places in 145 ms
[2020-05-21 01:14:37] [INFO ] Deduced a trap composed of 14 places in 146 ms
[2020-05-21 01:14:37] [INFO ] Deduced a trap composed of 36 places in 162 ms
[2020-05-21 01:14:37] [INFO ] Deduced a trap composed of 40 places in 149 ms
[2020-05-21 01:14:37] [INFO ] Deduced a trap composed of 40 places in 144 ms
[2020-05-21 01:14:37] [INFO ] Deduced a trap composed of 39 places in 153 ms
[2020-05-21 01:14:38] [INFO ] Deduced a trap composed of 38 places in 173 ms
[2020-05-21 01:14:38] [INFO ] Deduced a trap composed of 13 places in 185 ms
[2020-05-21 01:14:38] [INFO ] Deduced a trap composed of 16 places in 219 ms
[2020-05-21 01:14:38] [INFO ] Deduced a trap composed of 16 places in 193 ms
[2020-05-21 01:14:38] [INFO ] Deduced a trap composed of 43 places in 154 ms
[2020-05-21 01:14:39] [INFO ] Deduced a trap composed of 65 places in 233 ms
[2020-05-21 01:14:39] [INFO ] Deduced a trap composed of 57 places in 213 ms
[2020-05-21 01:14:39] [INFO ] Deduced a trap composed of 59 places in 237 ms
[2020-05-21 01:14:39] [INFO ] Deduced a trap composed of 80 places in 225 ms
[2020-05-21 01:14:40] [INFO ] Deduced a trap composed of 58 places in 118 ms
[2020-05-21 01:14:40] [INFO ] Deduced a trap composed of 58 places in 172 ms
[2020-05-21 01:14:40] [INFO ] Deduced a trap composed of 80 places in 128 ms
[2020-05-21 01:14:40] [INFO ] Deduced a trap composed of 69 places in 70 ms
[2020-05-21 01:14:40] [INFO ] Deduced a trap composed of 32 places in 109 ms
[2020-05-21 01:14:40] [INFO ] Deduced a trap composed of 44 places in 112 ms
[2020-05-21 01:14:40] [INFO ] Deduced a trap composed of 43 places in 75 ms
[2020-05-21 01:14:41] [INFO ] Deduced a trap composed of 43 places in 66 ms
[2020-05-21 01:14:41] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 5625 ms
[2020-05-21 01:14:41] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 46 ms.
[2020-05-21 01:14:47] [INFO ] Added : 566 causal constraints over 114 iterations in 6077 ms. Result :sat
[2020-05-21 01:14:47] [INFO ] Deduced a trap composed of 32 places in 223 ms
[2020-05-21 01:14:47] [INFO ] Deduced a trap composed of 60 places in 188 ms
[2020-05-21 01:14:48] [INFO ] Deduced a trap composed of 42 places in 242 ms
[2020-05-21 01:14:48] [INFO ] Deduced a trap composed of 58 places in 194 ms
[2020-05-21 01:14:48] [INFO ] Deduced a trap composed of 57 places in 122 ms
[2020-05-21 01:14:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1452 ms
[2020-05-21 01:14:48] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:14:48] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:14:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:14:49] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2020-05-21 01:14:49] [INFO ] [Real]Added 132 Read/Feed constraints in 28 ms returned sat
[2020-05-21 01:14:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:14:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2020-05-21 01:14:49] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:14:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:14:50] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2020-05-21 01:14:50] [INFO ] [Nat]Added 132 Read/Feed constraints in 37 ms returned sat
[2020-05-21 01:14:50] [INFO ] Deduced a trap composed of 47 places in 185 ms
[2020-05-21 01:14:50] [INFO ] Deduced a trap composed of 54 places in 174 ms
[2020-05-21 01:14:50] [INFO ] Deduced a trap composed of 32 places in 181 ms
[2020-05-21 01:14:51] [INFO ] Deduced a trap composed of 32 places in 182 ms
[2020-05-21 01:14:51] [INFO ] Deduced a trap composed of 40 places in 204 ms
[2020-05-21 01:14:51] [INFO ] Deduced a trap composed of 10 places in 176 ms
[2020-05-21 01:14:51] [INFO ] Deduced a trap composed of 10 places in 160 ms
[2020-05-21 01:14:51] [INFO ] Deduced a trap composed of 10 places in 153 ms
[2020-05-21 01:14:52] [INFO ] Deduced a trap composed of 37 places in 157 ms
[2020-05-21 01:14:52] [INFO ] Deduced a trap composed of 10 places in 225 ms
[2020-05-21 01:14:52] [INFO ] Deduced a trap composed of 54 places in 182 ms
[2020-05-21 01:14:52] [INFO ] Deduced a trap composed of 54 places in 161 ms
[2020-05-21 01:14:52] [INFO ] Deduced a trap composed of 54 places in 158 ms
[2020-05-21 01:14:53] [INFO ] Deduced a trap composed of 32 places in 182 ms
[2020-05-21 01:14:53] [INFO ] Deduced a trap composed of 76 places in 136 ms
[2020-05-21 01:14:53] [INFO ] Deduced a trap composed of 76 places in 137 ms
[2020-05-21 01:14:53] [INFO ] Deduced a trap composed of 76 places in 160 ms
[2020-05-21 01:14:53] [INFO ] Deduced a trap composed of 76 places in 155 ms
[2020-05-21 01:14:54] [INFO ] Deduced a trap composed of 36 places in 200 ms
[2020-05-21 01:14:54] [INFO ] Deduced a trap composed of 47 places in 214 ms
[2020-05-21 01:14:54] [INFO ] Deduced a trap composed of 36 places in 223 ms
[2020-05-21 01:14:54] [INFO ] Deduced a trap composed of 70 places in 147 ms
[2020-05-21 01:14:55] [INFO ] Deduced a trap composed of 70 places in 152 ms
[2020-05-21 01:14:55] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4824 ms
[2020-05-21 01:14:55] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 30 ms.
[2020-05-21 01:15:00] [INFO ] Added : 570 causal constraints over 114 iterations in 5233 ms. Result :sat
[2020-05-21 01:15:00] [INFO ] Deduced a trap composed of 55 places in 172 ms
[2020-05-21 01:15:00] [INFO ] Deduced a trap composed of 21 places in 160 ms
[2020-05-21 01:15:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 501 ms
[2020-05-21 01:15:00] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:15:00] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:15:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:15:01] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2020-05-21 01:15:01] [INFO ] [Real]Added 132 Read/Feed constraints in 14 ms returned sat
[2020-05-21 01:15:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:15:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:15:01] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:15:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:15:02] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2020-05-21 01:15:02] [INFO ] [Nat]Added 132 Read/Feed constraints in 37 ms returned sat
[2020-05-21 01:15:02] [INFO ] Deduced a trap composed of 31 places in 179 ms
[2020-05-21 01:15:02] [INFO ] Deduced a trap composed of 27 places in 170 ms
[2020-05-21 01:15:02] [INFO ] Deduced a trap composed of 23 places in 164 ms
[2020-05-21 01:15:03] [INFO ] Deduced a trap composed of 14 places in 172 ms
[2020-05-21 01:15:03] [INFO ] Deduced a trap composed of 18 places in 172 ms
[2020-05-21 01:15:03] [INFO ] Deduced a trap composed of 21 places in 162 ms
[2020-05-21 01:15:03] [INFO ] Deduced a trap composed of 13 places in 156 ms
[2020-05-21 01:15:03] [INFO ] Deduced a trap composed of 31 places in 140 ms
[2020-05-21 01:15:03] [INFO ] Deduced a trap composed of 31 places in 133 ms
[2020-05-21 01:15:04] [INFO ] Deduced a trap composed of 65 places in 126 ms
[2020-05-21 01:15:04] [INFO ] Deduced a trap composed of 58 places in 125 ms
[2020-05-21 01:15:04] [INFO ] Deduced a trap composed of 58 places in 123 ms
[2020-05-21 01:15:04] [INFO ] Deduced a trap composed of 62 places in 151 ms
[2020-05-21 01:15:04] [INFO ] Deduced a trap composed of 34 places in 135 ms
[2020-05-21 01:15:04] [INFO ] Deduced a trap composed of 17 places in 193 ms
[2020-05-21 01:15:05] [INFO ] Deduced a trap composed of 39 places in 130 ms
[2020-05-21 01:15:05] [INFO ] Deduced a trap composed of 45 places in 123 ms
[2020-05-21 01:15:05] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3145 ms
[2020-05-21 01:15:05] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 52 ms.
[2020-05-21 01:15:10] [INFO ] Added : 547 causal constraints over 110 iterations in 5305 ms. Result :sat
[2020-05-21 01:15:10] [INFO ] Deduced a trap composed of 31 places in 264 ms
[2020-05-21 01:15:11] [INFO ] Deduced a trap composed of 69 places in 178 ms
[2020-05-21 01:15:11] [INFO ] Deduced a trap composed of 92 places in 138 ms
[2020-05-21 01:15:11] [INFO ] Deduced a trap composed of 96 places in 169 ms
[2020-05-21 01:15:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1057 ms
[2020-05-21 01:15:11] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:15:11] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:15:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:15:12] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2020-05-21 01:15:12] [INFO ] [Real]Added 132 Read/Feed constraints in 17 ms returned sat
[2020-05-21 01:15:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:15:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:15:12] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:15:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:15:13] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2020-05-21 01:15:13] [INFO ] [Nat]Added 132 Read/Feed constraints in 32 ms returned sat
[2020-05-21 01:15:13] [INFO ] Deduced a trap composed of 36 places in 231 ms
[2020-05-21 01:15:13] [INFO ] Deduced a trap composed of 59 places in 175 ms
[2020-05-21 01:15:13] [INFO ] Deduced a trap composed of 10 places in 169 ms
[2020-05-21 01:15:14] [INFO ] Deduced a trap composed of 12 places in 173 ms
[2020-05-21 01:15:14] [INFO ] Deduced a trap composed of 10 places in 197 ms
[2020-05-21 01:15:14] [INFO ] Deduced a trap composed of 37 places in 189 ms
[2020-05-21 01:15:14] [INFO ] Deduced a trap composed of 10 places in 212 ms
[2020-05-21 01:15:14] [INFO ] Deduced a trap composed of 54 places in 140 ms
[2020-05-21 01:15:15] [INFO ] Deduced a trap composed of 32 places in 161 ms
[2020-05-21 01:15:15] [INFO ] Deduced a trap composed of 32 places in 169 ms
[2020-05-21 01:15:15] [INFO ] Deduced a trap composed of 32 places in 122 ms
[2020-05-21 01:15:15] [INFO ] Deduced a trap composed of 32 places in 128 ms
[2020-05-21 01:15:15] [INFO ] Deduced a trap composed of 84 places in 231 ms
[2020-05-21 01:15:16] [INFO ] Deduced a trap composed of 50 places in 170 ms
[2020-05-21 01:15:16] [INFO ] Deduced a trap composed of 50 places in 189 ms
[2020-05-21 01:15:16] [INFO ] Deduced a trap composed of 50 places in 211 ms
[2020-05-21 01:15:16] [INFO ] Deduced a trap composed of 76 places in 238 ms
[2020-05-21 01:15:17] [INFO ] Deduced a trap composed of 54 places in 213 ms
[2020-05-21 01:15:17] [INFO ] Deduced a trap composed of 54 places in 167 ms
[2020-05-21 01:15:17] [INFO ] Deduced a trap composed of 76 places in 148 ms
[2020-05-21 01:15:17] [INFO ] Deduced a trap composed of 76 places in 114 ms
[2020-05-21 01:15:17] [INFO ] Deduced a trap composed of 76 places in 156 ms
[2020-05-21 01:15:17] [INFO ] Deduced a trap composed of 54 places in 144 ms
[2020-05-21 01:15:18] [INFO ] Deduced a trap composed of 13 places in 159 ms
[2020-05-21 01:15:18] [INFO ] Deduced a trap composed of 61 places in 178 ms
[2020-05-21 01:15:18] [INFO ] Deduced a trap composed of 38 places in 130 ms
[2020-05-21 01:15:18] [INFO ] Deduced a trap composed of 35 places in 128 ms
[2020-05-21 01:15:19] [INFO ] Deduced a trap composed of 72 places in 139 ms
[2020-05-21 01:15:19] [INFO ] Deduced a trap composed of 43 places in 171 ms
[2020-05-21 01:15:19] [INFO ] Deduced a trap composed of 57 places in 211 ms
[2020-05-21 01:15:19] [INFO ] Deduced a trap composed of 148 places in 133 ms
[2020-05-21 01:15:19] [INFO ] Deduced a trap composed of 80 places in 168 ms
[2020-05-21 01:15:20] [INFO ] Deduced a trap composed of 80 places in 168 ms
[2020-05-21 01:15:20] [INFO ] Deduced a trap composed of 81 places in 195 ms
[2020-05-21 01:15:20] [INFO ] Deduced a trap composed of 88 places in 136 ms
[2020-05-21 01:15:20] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 7350 ms
[2020-05-21 01:15:20] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 46 ms.
[2020-05-21 01:15:25] [INFO ] Added : 548 causal constraints over 110 iterations in 5111 ms. Result :sat
[2020-05-21 01:15:26] [INFO ] Deduced a trap composed of 43 places in 230 ms
[2020-05-21 01:15:26] [INFO ] Deduced a trap composed of 36 places in 196 ms
[2020-05-21 01:15:26] [INFO ] Deduced a trap composed of 98 places in 232 ms
[2020-05-21 01:15:26] [INFO ] Deduced a trap composed of 102 places in 166 ms
[2020-05-21 01:15:27] [INFO ] Deduced a trap composed of 36 places in 169 ms
[2020-05-21 01:15:27] [INFO ] Deduced a trap composed of 65 places in 199 ms
[2020-05-21 01:15:27] [INFO ] Deduced a trap composed of 70 places in 164 ms
[2020-05-21 01:15:27] [INFO ] Deduced a trap composed of 65 places in 182 ms
[2020-05-21 01:15:28] [INFO ] Deduced a trap composed of 70 places in 226 ms
[2020-05-21 01:15:28] [INFO ] Deduced a trap composed of 88 places in 176 ms
[2020-05-21 01:15:28] [INFO ] Deduced a trap composed of 112 places in 162 ms
[2020-05-21 01:15:28] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3059 ms
[2020-05-21 01:15:28] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2020-05-21 01:15:28] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:15:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:15:29] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2020-05-21 01:15:29] [INFO ] [Real]Added 132 Read/Feed constraints in 17 ms returned sat
[2020-05-21 01:15:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:15:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:15:29] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:15:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:15:30] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2020-05-21 01:15:30] [INFO ] [Nat]Added 132 Read/Feed constraints in 29 ms returned sat
[2020-05-21 01:15:30] [INFO ] Deduced a trap composed of 14 places in 177 ms
[2020-05-21 01:15:30] [INFO ] Deduced a trap composed of 14 places in 219 ms
[2020-05-21 01:15:30] [INFO ] Deduced a trap composed of 21 places in 194 ms
[2020-05-21 01:15:31] [INFO ] Deduced a trap composed of 10 places in 170 ms
[2020-05-21 01:15:31] [INFO ] Deduced a trap composed of 13 places in 198 ms
[2020-05-21 01:15:31] [INFO ] Deduced a trap composed of 32 places in 200 ms
[2020-05-21 01:15:31] [INFO ] Deduced a trap composed of 32 places in 197 ms
[2020-05-21 01:15:31] [INFO ] Deduced a trap composed of 30 places in 200 ms
[2020-05-21 01:15:32] [INFO ] Deduced a trap composed of 32 places in 145 ms
[2020-05-21 01:15:32] [INFO ] Deduced a trap composed of 31 places in 167 ms
[2020-05-21 01:15:32] [INFO ] Deduced a trap composed of 50 places in 156 ms
[2020-05-21 01:15:32] [INFO ] Deduced a trap composed of 50 places in 103 ms
[2020-05-21 01:15:32] [INFO ] Deduced a trap composed of 62 places in 112 ms
[2020-05-21 01:15:32] [INFO ] Deduced a trap composed of 58 places in 134 ms
[2020-05-21 01:15:33] [INFO ] Deduced a trap composed of 39 places in 140 ms
[2020-05-21 01:15:33] [INFO ] Deduced a trap composed of 21 places in 298 ms
[2020-05-21 01:15:33] [INFO ] Deduced a trap composed of 10 places in 242 ms
[2020-05-21 01:15:34] [INFO ] Deduced a trap composed of 10 places in 247 ms
[2020-05-21 01:15:34] [INFO ] Deduced a trap composed of 32 places in 259 ms
[2020-05-21 01:15:34] [INFO ] Deduced a trap composed of 76 places in 176 ms
[2020-05-21 01:15:34] [INFO ] Deduced a trap composed of 92 places in 227 ms
[2020-05-21 01:15:35] [INFO ] Deduced a trap composed of 101 places in 191 ms
[2020-05-21 01:15:35] [INFO ] Deduced a trap composed of 98 places in 186 ms
[2020-05-21 01:15:35] [INFO ] Deduced a trap composed of 58 places in 112 ms
[2020-05-21 01:15:35] [INFO ] Deduced a trap composed of 87 places in 122 ms
[2020-05-21 01:15:35] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5394 ms
[2020-05-21 01:15:35] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 32 ms.
[2020-05-21 01:15:41] [INFO ] Added : 556 causal constraints over 112 iterations in 5828 ms. Result :sat
[2020-05-21 01:15:41] [INFO ] Deduced a trap composed of 65 places in 206 ms
[2020-05-21 01:15:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2020-05-21 01:15:41] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2020-05-21 01:15:41] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:15:42] [INFO ] [Real]Absence check using state equation in 661 ms returned sat
[2020-05-21 01:15:42] [INFO ] [Real]Added 132 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:15:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2020-05-21 01:15:42] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:15:43] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2020-05-21 01:15:43] [INFO ] [Nat]Added 132 Read/Feed constraints in 53 ms returned sat
[2020-05-21 01:15:43] [INFO ] Deduced a trap composed of 43 places in 206 ms
[2020-05-21 01:15:43] [INFO ] Deduced a trap composed of 21 places in 205 ms
[2020-05-21 01:15:44] [INFO ] Deduced a trap composed of 10 places in 229 ms
[2020-05-21 01:15:44] [INFO ] Deduced a trap composed of 10 places in 197 ms
[2020-05-21 01:15:44] [INFO ] Deduced a trap composed of 10 places in 224 ms
[2020-05-21 01:15:44] [INFO ] Deduced a trap composed of 32 places in 171 ms
[2020-05-21 01:15:45] [INFO ] Deduced a trap composed of 32 places in 155 ms
[2020-05-21 01:15:45] [INFO ] Deduced a trap composed of 32 places in 134 ms
[2020-05-21 01:15:45] [INFO ] Deduced a trap composed of 10 places in 175 ms
[2020-05-21 01:15:45] [INFO ] Deduced a trap composed of 32 places in 163 ms
[2020-05-21 01:15:45] [INFO ] Deduced a trap composed of 54 places in 136 ms
[2020-05-21 01:15:45] [INFO ] Deduced a trap composed of 42 places in 92 ms
[2020-05-21 01:15:45] [INFO ] Deduced a trap composed of 54 places in 107 ms
[2020-05-21 01:15:46] [INFO ] Deduced a trap composed of 54 places in 103 ms
[2020-05-21 01:15:46] [INFO ] Deduced a trap composed of 50 places in 152 ms
[2020-05-21 01:15:46] [INFO ] Deduced a trap composed of 76 places in 116 ms
[2020-05-21 01:15:46] [INFO ] Deduced a trap composed of 76 places in 145 ms
[2020-05-21 01:15:46] [INFO ] Deduced a trap composed of 76 places in 125 ms
[2020-05-21 01:15:46] [INFO ] Deduced a trap composed of 76 places in 113 ms
[2020-05-21 01:15:47] [INFO ] Deduced a trap composed of 57 places in 83 ms
[2020-05-21 01:15:47] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3739 ms
[2020-05-21 01:15:47] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 30 ms.
[2020-05-21 01:15:52] [INFO ] Added : 545 causal constraints over 109 iterations in 4955 ms. Result :sat
[2020-05-21 01:15:52] [INFO ] Deduced a trap composed of 39 places in 243 ms
[2020-05-21 01:15:52] [INFO ] Deduced a trap composed of 60 places in 263 ms
[2020-05-21 01:15:53] [INFO ] Deduced a trap composed of 54 places in 193 ms
[2020-05-21 01:15:53] [INFO ] Deduced a trap composed of 38 places in 233 ms
[2020-05-21 01:15:53] [INFO ] Deduced a trap composed of 32 places in 238 ms
[2020-05-21 01:15:53] [INFO ] Deduced a trap composed of 13 places in 219 ms
[2020-05-21 01:15:54] [INFO ] Deduced a trap composed of 63 places in 191 ms
[2020-05-21 01:15:54] [INFO ] Deduced a trap composed of 36 places in 209 ms
[2020-05-21 01:15:54] [INFO ] Deduced a trap composed of 27 places in 233 ms
[2020-05-21 01:15:55] [INFO ] Deduced a trap composed of 16 places in 234 ms
[2020-05-21 01:15:55] [INFO ] Deduced a trap composed of 57 places in 157 ms
[2020-05-21 01:15:55] [INFO ] Deduced a trap composed of 58 places in 219 ms
[2020-05-21 01:15:55] [INFO ] Deduced a trap composed of 58 places in 154 ms
[2020-05-21 01:15:56] [INFO ] Deduced a trap composed of 58 places in 217 ms
[2020-05-21 01:15:56] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4194 ms
[2020-05-21 01:15:56] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:15:56] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:15:57] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2020-05-21 01:15:57] [INFO ] [Real]Added 132 Read/Feed constraints in 42 ms returned sat
[2020-05-21 01:15:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:15:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:15:57] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:15:57] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2020-05-21 01:15:57] [INFO ] [Nat]Added 132 Read/Feed constraints in 36 ms returned sat
[2020-05-21 01:15:58] [INFO ] Deduced a trap composed of 12 places in 268 ms
[2020-05-21 01:15:58] [INFO ] Deduced a trap composed of 43 places in 308 ms
[2020-05-21 01:15:58] [INFO ] Deduced a trap composed of 43 places in 269 ms
[2020-05-21 01:15:59] [INFO ] Deduced a trap composed of 44 places in 283 ms
[2020-05-21 01:15:59] [INFO ] Deduced a trap composed of 27 places in 302 ms
[2020-05-21 01:15:59] [INFO ] Deduced a trap composed of 14 places in 207 ms
[2020-05-21 01:15:59] [INFO ] Deduced a trap composed of 14 places in 267 ms
[2020-05-21 01:16:00] [INFO ] Deduced a trap composed of 21 places in 263 ms
[2020-05-21 01:16:00] [INFO ] Deduced a trap composed of 62 places in 277 ms
[2020-05-21 01:16:00] [INFO ] Deduced a trap composed of 62 places in 227 ms
[2020-05-21 01:16:01] [INFO ] Deduced a trap composed of 13 places in 247 ms
[2020-05-21 01:16:01] [INFO ] Deduced a trap composed of 65 places in 216 ms
[2020-05-21 01:16:01] [INFO ] Deduced a trap composed of 39 places in 198 ms
[2020-05-21 01:16:01] [INFO ] Deduced a trap composed of 43 places in 203 ms
[2020-05-21 01:16:02] [INFO ] Deduced a trap composed of 10 places in 222 ms
[2020-05-21 01:16:02] [INFO ] Deduced a trap composed of 84 places in 201 ms
[2020-05-21 01:16:02] [INFO ] Deduced a trap composed of 62 places in 186 ms
[2020-05-21 01:16:02] [INFO ] Deduced a trap composed of 83 places in 182 ms
[2020-05-21 01:16:02] [INFO ] Deduced a trap composed of 127 places in 184 ms
[2020-05-21 01:16:03] [INFO ] Deduced a trap composed of 65 places in 123 ms
[2020-05-21 01:16:03] [INFO ] Deduced a trap composed of 10 places in 225 ms
[2020-05-21 01:16:03] [INFO ] Deduced a trap composed of 27 places in 220 ms
[2020-05-21 01:16:03] [INFO ] Deduced a trap composed of 83 places in 233 ms
[2020-05-21 01:16:04] [INFO ] Deduced a trap composed of 39 places in 186 ms
[2020-05-21 01:16:04] [INFO ] Deduced a trap composed of 61 places in 182 ms
[2020-05-21 01:16:04] [INFO ] Deduced a trap composed of 32 places in 116 ms
[2020-05-21 01:16:04] [INFO ] Deduced a trap composed of 30 places in 126 ms
[2020-05-21 01:16:04] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6833 ms
[2020-05-21 01:16:04] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 39 ms.
[2020-05-21 01:16:10] [INFO ] Added : 530 causal constraints over 106 iterations in 5340 ms. Result :sat
[2020-05-21 01:16:10] [INFO ] Deduced a trap composed of 43 places in 242 ms
[2020-05-21 01:16:10] [INFO ] Deduced a trap composed of 47 places in 180 ms
[2020-05-21 01:16:10] [INFO ] Deduced a trap composed of 48 places in 153 ms
[2020-05-21 01:16:11] [INFO ] Deduced a trap composed of 69 places in 135 ms
[2020-05-21 01:16:11] [INFO ] Deduced a trap composed of 69 places in 184 ms
[2020-05-21 01:16:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1369 ms
[2020-05-21 01:16:11] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:16:11] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:16:12] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2020-05-21 01:16:12] [INFO ] [Real]Added 132 Read/Feed constraints in 16 ms returned sat
[2020-05-21 01:16:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:16:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 26 ms returned sat
[2020-05-21 01:16:12] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:16:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:16:12] [INFO ] [Nat]Absence check using state equation in 609 ms returned sat
[2020-05-21 01:16:12] [INFO ] [Nat]Added 132 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:16:13] [INFO ] Deduced a trap composed of 10 places in 276 ms
[2020-05-21 01:16:13] [INFO ] Deduced a trap composed of 32 places in 293 ms
[2020-05-21 01:16:13] [INFO ] Deduced a trap composed of 32 places in 253 ms
[2020-05-21 01:16:14] [INFO ] Deduced a trap composed of 32 places in 279 ms
[2020-05-21 01:16:14] [INFO ] Deduced a trap composed of 32 places in 222 ms
[2020-05-21 01:16:14] [INFO ] Deduced a trap composed of 14 places in 231 ms
[2020-05-21 01:16:14] [INFO ] Deduced a trap composed of 21 places in 209 ms
[2020-05-21 01:16:15] [INFO ] Deduced a trap composed of 80 places in 216 ms
[2020-05-21 01:16:15] [INFO ] Deduced a trap composed of 10 places in 201 ms
[2020-05-21 01:16:15] [INFO ] Deduced a trap composed of 76 places in 194 ms
[2020-05-21 01:16:15] [INFO ] Deduced a trap composed of 54 places in 112 ms
[2020-05-21 01:16:15] [INFO ] Deduced a trap composed of 54 places in 98 ms
[2020-05-21 01:16:16] [INFO ] Deduced a trap composed of 50 places in 102 ms
[2020-05-21 01:16:16] [INFO ] Deduced a trap composed of 54 places in 107 ms
[2020-05-21 01:16:16] [INFO ] Deduced a trap composed of 76 places in 129 ms
[2020-05-21 01:16:16] [INFO ] Deduced a trap composed of 76 places in 121 ms
[2020-05-21 01:16:16] [INFO ] Deduced a trap composed of 76 places in 158 ms
[2020-05-21 01:16:17] [INFO ] Deduced a trap composed of 36 places in 182 ms
[2020-05-21 01:16:17] [INFO ] Deduced a trap composed of 119 places in 159 ms
[2020-05-21 01:16:17] [INFO ] Deduced a trap composed of 48 places in 156 ms
[2020-05-21 01:16:17] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4426 ms
[2020-05-21 01:16:17] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 34 ms.
[2020-05-21 01:16:22] [INFO ] Added : 544 causal constraints over 109 iterations in 5427 ms. Result :sat
[2020-05-21 01:16:23] [INFO ] Deduced a trap composed of 17 places in 242 ms
[2020-05-21 01:16:23] [INFO ] Deduced a trap composed of 43 places in 221 ms
[2020-05-21 01:16:23] [INFO ] Deduced a trap composed of 65 places in 239 ms
[2020-05-21 01:16:23] [INFO ] Deduced a trap composed of 43 places in 251 ms
[2020-05-21 01:16:24] [INFO ] Deduced a trap composed of 65 places in 194 ms
[2020-05-21 01:16:24] [INFO ] Deduced a trap composed of 65 places in 166 ms
[2020-05-21 01:16:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1819 ms
[2020-05-21 01:16:24] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2020-05-21 01:16:24] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:16:25] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2020-05-21 01:16:25] [INFO ] [Real]Added 132 Read/Feed constraints in 36 ms returned sat
[2020-05-21 01:16:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:16:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:16:25] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:16:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:16:26] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2020-05-21 01:16:26] [INFO ] [Nat]Added 132 Read/Feed constraints in 32 ms returned sat
[2020-05-21 01:16:26] [INFO ] Deduced a trap composed of 32 places in 222 ms
[2020-05-21 01:16:26] [INFO ] Deduced a trap composed of 10 places in 218 ms
[2020-05-21 01:16:26] [INFO ] Deduced a trap composed of 16 places in 230 ms
[2020-05-21 01:16:27] [INFO ] Deduced a trap composed of 47 places in 177 ms
[2020-05-21 01:16:27] [INFO ] Deduced a trap composed of 39 places in 204 ms
[2020-05-21 01:16:27] [INFO ] Deduced a trap composed of 10 places in 218 ms
[2020-05-21 01:16:27] [INFO ] Deduced a trap composed of 10 places in 224 ms
[2020-05-21 01:16:27] [INFO ] Deduced a trap composed of 54 places in 136 ms
[2020-05-21 01:16:28] [INFO ] Deduced a trap composed of 10 places in 208 ms
[2020-05-21 01:16:28] [INFO ] Deduced a trap composed of 54 places in 178 ms
[2020-05-21 01:16:28] [INFO ] Deduced a trap composed of 54 places in 168 ms
[2020-05-21 01:16:28] [INFO ] Deduced a trap composed of 69 places in 182 ms
[2020-05-21 01:16:29] [INFO ] Deduced a trap composed of 31 places in 118 ms
[2020-05-21 01:16:29] [INFO ] Deduced a trap composed of 31 places in 116 ms
[2020-05-21 01:16:29] [INFO ] Deduced a trap composed of 54 places in 111 ms
[2020-05-21 01:16:29] [INFO ] Deduced a trap composed of 36 places in 132 ms
[2020-05-21 01:16:29] [INFO ] Deduced a trap composed of 62 places in 156 ms
[2020-05-21 01:16:29] [INFO ] Deduced a trap composed of 62 places in 111 ms
[2020-05-21 01:16:29] [INFO ] Deduced a trap composed of 54 places in 128 ms
[2020-05-21 01:16:30] [INFO ] Deduced a trap composed of 18 places in 210 ms
[2020-05-21 01:16:30] [INFO ] Deduced a trap composed of 40 places in 92 ms
[2020-05-21 01:16:30] [INFO ] Deduced a trap composed of 36 places in 74 ms
[2020-05-21 01:16:30] [INFO ] Deduced a trap composed of 61 places in 97 ms
[2020-05-21 01:16:30] [INFO ] Deduced a trap composed of 85 places in 123 ms
[2020-05-21 01:16:30] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4674 ms
[2020-05-21 01:16:30] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 44 ms.
[2020-05-21 01:16:37] [INFO ] Added : 625 causal constraints over 125 iterations in 6513 ms. Result :sat
[2020-05-21 01:16:37] [INFO ] Deduced a trap composed of 35 places in 268 ms
[2020-05-21 01:16:37] [INFO ] Deduced a trap composed of 83 places in 223 ms
[2020-05-21 01:16:38] [INFO ] Deduced a trap composed of 61 places in 179 ms
[2020-05-21 01:16:38] [INFO ] Deduced a trap composed of 19 places in 257 ms
[2020-05-21 01:16:38] [INFO ] Deduced a trap composed of 46 places in 252 ms
[2020-05-21 01:16:39] [INFO ] Deduced a trap composed of 32 places in 193 ms
[2020-05-21 01:16:39] [INFO ] Deduced a trap composed of 32 places in 209 ms
[2020-05-21 01:16:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2283 ms
[2020-05-21 01:16:39] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:16:39] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:16:40] [INFO ] [Real]Absence check using state equation in 690 ms returned sat
[2020-05-21 01:16:40] [INFO ] [Real]Added 132 Read/Feed constraints in 23 ms returned sat
[2020-05-21 01:16:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:16:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2020-05-21 01:16:40] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:16:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:16:41] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2020-05-21 01:16:41] [INFO ] [Nat]Added 132 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:16:41] [INFO ] Deduced a trap composed of 10 places in 200 ms
[2020-05-21 01:16:41] [INFO ] Deduced a trap composed of 10 places in 166 ms
[2020-05-21 01:16:41] [INFO ] Deduced a trap composed of 10 places in 193 ms
[2020-05-21 01:16:42] [INFO ] Deduced a trap composed of 27 places in 198 ms
[2020-05-21 01:16:42] [INFO ] Deduced a trap composed of 27 places in 203 ms
[2020-05-21 01:16:42] [INFO ] Deduced a trap composed of 27 places in 207 ms
[2020-05-21 01:16:42] [INFO ] Deduced a trap composed of 10 places in 205 ms
[2020-05-21 01:16:43] [INFO ] Deduced a trap composed of 42 places in 187 ms
[2020-05-21 01:16:43] [INFO ] Deduced a trap composed of 39 places in 186 ms
[2020-05-21 01:16:43] [INFO ] Deduced a trap composed of 62 places in 147 ms
[2020-05-21 01:16:43] [INFO ] Deduced a trap composed of 62 places in 142 ms
[2020-05-21 01:16:43] [INFO ] Deduced a trap composed of 61 places in 146 ms
[2020-05-21 01:16:43] [INFO ] Deduced a trap composed of 58 places in 132 ms
[2020-05-21 01:16:44] [INFO ] Deduced a trap composed of 40 places in 92 ms
[2020-05-21 01:16:44] [INFO ] Deduced a trap composed of 36 places in 146 ms
[2020-05-21 01:16:44] [INFO ] Deduced a trap composed of 61 places in 103 ms
[2020-05-21 01:16:44] [INFO ] Deduced a trap composed of 13 places in 128 ms
[2020-05-21 01:16:44] [INFO ] Deduced a trap composed of 14 places in 242 ms
[2020-05-21 01:16:45] [INFO ] Deduced a trap composed of 18 places in 232 ms
[2020-05-21 01:16:45] [INFO ] Deduced a trap composed of 21 places in 214 ms
[2020-05-21 01:16:45] [INFO ] Deduced a trap composed of 83 places in 183 ms
[2020-05-21 01:16:45] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4486 ms
[2020-05-21 01:16:45] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 50 ms.
[2020-05-21 01:16:51] [INFO ] Added : 558 causal constraints over 114 iterations in 6051 ms. Result :sat
[2020-05-21 01:16:52] [INFO ] Deduced a trap composed of 43 places in 269 ms
[2020-05-21 01:16:52] [INFO ] Deduced a trap composed of 35 places in 269 ms
[2020-05-21 01:16:52] [INFO ] Deduced a trap composed of 54 places in 204 ms
[2020-05-21 01:16:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1094 ms
[2020-05-21 01:16:52] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:16:52] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:16:53] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2020-05-21 01:16:53] [INFO ] [Real]Added 132 Read/Feed constraints in 19 ms returned sat
[2020-05-21 01:16:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:16:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:16:53] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:16:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:16:54] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2020-05-21 01:16:54] [INFO ] [Nat]Added 132 Read/Feed constraints in 34 ms returned sat
[2020-05-21 01:16:54] [INFO ] Deduced a trap composed of 105 places in 162 ms
[2020-05-21 01:16:54] [INFO ] Deduced a trap composed of 22 places in 201 ms
[2020-05-21 01:16:54] [INFO ] Deduced a trap composed of 17 places in 173 ms
[2020-05-21 01:16:55] [INFO ] Deduced a trap composed of 47 places in 224 ms
[2020-05-21 01:16:55] [INFO ] Deduced a trap composed of 32 places in 217 ms
[2020-05-21 01:16:55] [INFO ] Deduced a trap composed of 32 places in 191 ms
[2020-05-21 01:16:55] [INFO ] Deduced a trap composed of 32 places in 182 ms
[2020-05-21 01:16:56] [INFO ] Deduced a trap composed of 14 places in 204 ms
[2020-05-21 01:16:56] [INFO ] Deduced a trap composed of 61 places in 170 ms
[2020-05-21 01:16:56] [INFO ] Deduced a trap composed of 74 places in 221 ms
[2020-05-21 01:16:56] [INFO ] Deduced a trap composed of 10 places in 168 ms
[2020-05-21 01:16:56] [INFO ] Deduced a trap composed of 82 places in 158 ms
[2020-05-21 01:16:57] [INFO ] Deduced a trap composed of 13 places in 168 ms
[2020-05-21 01:16:57] [INFO ] Deduced a trap composed of 14 places in 179 ms
[2020-05-21 01:16:57] [INFO ] Deduced a trap composed of 18 places in 158 ms
[2020-05-21 01:16:57] [INFO ] Deduced a trap composed of 43 places in 142 ms
[2020-05-21 01:16:57] [INFO ] Deduced a trap composed of 44 places in 153 ms
[2020-05-21 01:16:58] [INFO ] Deduced a trap composed of 43 places in 156 ms
[2020-05-21 01:16:58] [INFO ] Deduced a trap composed of 39 places in 228 ms
[2020-05-21 01:16:58] [INFO ] Deduced a trap composed of 84 places in 194 ms
[2020-05-21 01:16:58] [INFO ] Deduced a trap composed of 65 places in 218 ms
[2020-05-21 01:16:59] [INFO ] Deduced a trap composed of 66 places in 157 ms
[2020-05-21 01:16:59] [INFO ] Deduced a trap composed of 62 places in 185 ms
[2020-05-21 01:16:59] [INFO ] Deduced a trap composed of 84 places in 166 ms
[2020-05-21 01:16:59] [INFO ] Deduced a trap composed of 83 places in 130 ms
[2020-05-21 01:16:59] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5223 ms
[2020-05-21 01:16:59] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 33 ms.
[2020-05-21 01:17:05] [INFO ] Added : 551 causal constraints over 111 iterations in 5667 ms. Result :sat
[2020-05-21 01:17:05] [INFO ] Deduced a trap composed of 43 places in 255 ms
[2020-05-21 01:17:05] [INFO ] Deduced a trap composed of 66 places in 273 ms
[2020-05-21 01:17:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 772 ms
[2020-05-21 01:17:06] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:17:06] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:17:06] [INFO ] [Real]Absence check using state equation in 678 ms returned sat
[2020-05-21 01:17:06] [INFO ] [Real]Added 132 Read/Feed constraints in 23 ms returned sat
[2020-05-21 01:17:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:17:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:17:06] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:17:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:17:07] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2020-05-21 01:17:07] [INFO ] [Nat]Added 132 Read/Feed constraints in 50 ms returned sat
[2020-05-21 01:17:07] [INFO ] Deduced a trap composed of 10 places in 238 ms
[2020-05-21 01:17:08] [INFO ] Deduced a trap composed of 49 places in 265 ms
[2020-05-21 01:17:08] [INFO ] Deduced a trap composed of 10 places in 235 ms
[2020-05-21 01:17:08] [INFO ] Deduced a trap composed of 10 places in 164 ms
[2020-05-21 01:17:08] [INFO ] Deduced a trap composed of 12 places in 217 ms
[2020-05-21 01:17:09] [INFO ] Deduced a trap composed of 52 places in 235 ms
[2020-05-21 01:17:09] [INFO ] Deduced a trap composed of 62 places in 205 ms
[2020-05-21 01:17:09] [INFO ] Deduced a trap composed of 32 places in 247 ms
[2020-05-21 01:17:09] [INFO ] Deduced a trap composed of 88 places in 237 ms
[2020-05-21 01:17:10] [INFO ] Deduced a trap composed of 10 places in 253 ms
[2020-05-21 01:17:10] [INFO ] Deduced a trap composed of 32 places in 237 ms
[2020-05-21 01:17:10] [INFO ] Deduced a trap composed of 32 places in 224 ms
[2020-05-21 01:17:10] [INFO ] Deduced a trap composed of 32 places in 229 ms
[2020-05-21 01:17:11] [INFO ] Deduced a trap composed of 61 places in 195 ms
[2020-05-21 01:17:11] [INFO ] Deduced a trap composed of 84 places in 233 ms
[2020-05-21 01:17:11] [INFO ] Deduced a trap composed of 54 places in 144 ms
[2020-05-21 01:17:11] [INFO ] Deduced a trap composed of 54 places in 121 ms
[2020-05-21 01:17:11] [INFO ] Deduced a trap composed of 36 places in 172 ms
[2020-05-21 01:17:12] [INFO ] Deduced a trap composed of 36 places in 153 ms
[2020-05-21 01:17:12] [INFO ] Deduced a trap composed of 62 places in 87 ms
[2020-05-21 01:17:12] [INFO ] Deduced a trap composed of 39 places in 107 ms
[2020-05-21 01:17:12] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4849 ms
[2020-05-21 01:17:12] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 35 ms.
[2020-05-21 01:17:17] [INFO ] Added : 550 causal constraints over 110 iterations in 5507 ms. Result :sat
[2020-05-21 01:17:18] [INFO ] Deduced a trap composed of 13 places in 280 ms
[2020-05-21 01:17:18] [INFO ] Deduced a trap composed of 67 places in 196 ms
[2020-05-21 01:17:18] [INFO ] Deduced a trap composed of 65 places in 77 ms
[2020-05-21 01:17:18] [INFO ] Deduced a trap composed of 65 places in 103 ms
[2020-05-21 01:17:19] [INFO ] Deduced a trap composed of 66 places in 78 ms
[2020-05-21 01:17:19] [INFO ] Deduced a trap composed of 70 places in 98 ms
[2020-05-21 01:17:19] [INFO ] Deduced a trap composed of 22 places in 148 ms
[2020-05-21 01:17:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1750 ms
[2020-05-21 01:17:19] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:17:19] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:17:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:17:20] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2020-05-21 01:17:20] [INFO ] [Real]Added 132 Read/Feed constraints in 21 ms returned sat
[2020-05-21 01:17:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:17:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:17:20] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 13 ms returned sat
[2020-05-21 01:17:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:17:21] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2020-05-21 01:17:21] [INFO ] [Nat]Added 132 Read/Feed constraints in 39 ms returned sat
[2020-05-21 01:17:21] [INFO ] Deduced a trap composed of 12 places in 186 ms
[2020-05-21 01:17:21] [INFO ] Deduced a trap composed of 10 places in 203 ms
[2020-05-21 01:17:21] [INFO ] Deduced a trap composed of 10 places in 204 ms
[2020-05-21 01:17:22] [INFO ] Deduced a trap composed of 10 places in 171 ms
[2020-05-21 01:17:22] [INFO ] Deduced a trap composed of 32 places in 201 ms
[2020-05-21 01:17:22] [INFO ] Deduced a trap composed of 32 places in 196 ms
[2020-05-21 01:17:22] [INFO ] Deduced a trap composed of 54 places in 199 ms
[2020-05-21 01:17:22] [INFO ] Deduced a trap composed of 40 places in 160 ms
[2020-05-21 01:17:23] [INFO ] Deduced a trap composed of 32 places in 175 ms
[2020-05-21 01:17:23] [INFO ] Deduced a trap composed of 30 places in 219 ms
[2020-05-21 01:17:23] [INFO ] Deduced a trap composed of 39 places in 194 ms
[2020-05-21 01:17:23] [INFO ] Deduced a trap composed of 54 places in 164 ms
[2020-05-21 01:17:23] [INFO ] Deduced a trap composed of 54 places in 150 ms
[2020-05-21 01:17:24] [INFO ] Deduced a trap composed of 54 places in 155 ms
[2020-05-21 01:17:24] [INFO ] Deduced a trap composed of 61 places in 144 ms
[2020-05-21 01:17:24] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3183 ms
[2020-05-21 01:17:24] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 32 ms.
[2020-05-21 01:17:30] [INFO ] Added : 597 causal constraints over 121 iterations in 6621 ms. Result :sat
[2020-05-21 01:17:31] [INFO ] Deduced a trap composed of 88 places in 251 ms
[2020-05-21 01:17:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2020-05-21 01:17:31] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:17:31] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2020-05-21 01:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:17:32] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2020-05-21 01:17:32] [INFO ] [Real]Added 132 Read/Feed constraints in 17 ms returned sat
[2020-05-21 01:17:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:17:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2020-05-21 01:17:32] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:17:32] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2020-05-21 01:17:32] [INFO ] [Nat]Added 132 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:17:33] [INFO ] Deduced a trap composed of 10 places in 201 ms
[2020-05-21 01:17:33] [INFO ] Deduced a trap composed of 23 places in 153 ms
[2020-05-21 01:17:33] [INFO ] Deduced a trap composed of 10 places in 168 ms
[2020-05-21 01:17:33] [INFO ] Deduced a trap composed of 24 places in 154 ms
[2020-05-21 01:17:33] [INFO ] Deduced a trap composed of 32 places in 229 ms
[2020-05-21 01:17:34] [INFO ] Deduced a trap composed of 32 places in 241 ms
[2020-05-21 01:17:34] [INFO ] Deduced a trap composed of 32 places in 245 ms
[2020-05-21 01:17:34] [INFO ] Deduced a trap composed of 32 places in 249 ms
[2020-05-21 01:17:34] [INFO ] Deduced a trap composed of 62 places in 218 ms
[2020-05-21 01:17:35] [INFO ] Deduced a trap composed of 62 places in 182 ms
[2020-05-21 01:17:35] [INFO ] Deduced a trap composed of 61 places in 220 ms
[2020-05-21 01:17:35] [INFO ] Deduced a trap composed of 84 places in 201 ms
[2020-05-21 01:17:35] [INFO ] Deduced a trap composed of 54 places in 202 ms
[2020-05-21 01:17:36] [INFO ] Deduced a trap composed of 14 places in 207 ms
[2020-05-21 01:17:36] [INFO ] Deduced a trap composed of 54 places in 265 ms
[2020-05-21 01:17:36] [INFO ] Deduced a trap composed of 74 places in 251 ms
[2020-05-21 01:17:37] [INFO ] Deduced a trap composed of 10 places in 201 ms
[2020-05-21 01:17:37] [INFO ] Deduced a trap composed of 10 places in 245 ms
[2020-05-21 01:17:37] [INFO ] Deduced a trap composed of 76 places in 166 ms
[2020-05-21 01:17:37] [INFO ] Deduced a trap composed of 54 places in 218 ms
[2020-05-21 01:17:37] [INFO ] Deduced a trap composed of 54 places in 182 ms
[2020-05-21 01:17:38] [INFO ] Deduced a trap composed of 76 places in 193 ms
[2020-05-21 01:17:38] [INFO ] Deduced a trap composed of 69 places in 167 ms
[2020-05-21 01:17:38] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5642 ms
[2020-05-21 01:17:38] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 38 ms.
[2020-05-21 01:17:43] [INFO ] Added : 570 causal constraints over 114 iterations in 5490 ms. Result :sat
[2020-05-21 01:17:44] [INFO ] Deduced a trap composed of 13 places in 211 ms
[2020-05-21 01:17:44] [INFO ] Deduced a trap composed of 46 places in 274 ms
[2020-05-21 01:17:45] [INFO ] Deduced a trap composed of 47 places in 307 ms
[2020-05-21 01:17:45] [INFO ] Deduced a trap composed of 14 places in 277 ms
[2020-05-21 01:17:45] [INFO ] Deduced a trap composed of 14 places in 291 ms
[2020-05-21 01:17:46] [INFO ] Deduced a trap composed of 108 places in 188 ms
[2020-05-21 01:17:46] [INFO ] Deduced a trap composed of 89 places in 128 ms
[2020-05-21 01:17:46] [INFO ] Deduced a trap composed of 57 places in 108 ms
[2020-05-21 01:17:46] [INFO ] Deduced a trap composed of 58 places in 135 ms
[2020-05-21 01:17:47] [INFO ] Deduced a trap composed of 39 places in 251 ms
[2020-05-21 01:17:47] [INFO ] Deduced a trap composed of 58 places in 186 ms
[2020-05-21 01:17:47] [INFO ] Deduced a trap composed of 42 places in 252 ms
[2020-05-21 01:17:48] [INFO ] Deduced a trap composed of 80 places in 154 ms
[2020-05-21 01:17:48] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4245 ms
[2020-05-21 01:17:48] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:17:48] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:17:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:17:48] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2020-05-21 01:17:48] [INFO ] [Real]Added 132 Read/Feed constraints in 15 ms returned sat
[2020-05-21 01:17:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:17:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:17:49] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:17:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:17:49] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2020-05-21 01:17:49] [INFO ] [Nat]Added 132 Read/Feed constraints in 35 ms returned sat
[2020-05-21 01:17:49] [INFO ] Deduced a trap composed of 10 places in 171 ms
[2020-05-21 01:17:50] [INFO ] Deduced a trap composed of 10 places in 199 ms
[2020-05-21 01:17:50] [INFO ] Deduced a trap composed of 12 places in 204 ms
[2020-05-21 01:17:50] [INFO ] Deduced a trap composed of 27 places in 186 ms
[2020-05-21 01:17:50] [INFO ] Deduced a trap composed of 42 places in 170 ms
[2020-05-21 01:17:51] [INFO ] Deduced a trap composed of 12 places in 208 ms
[2020-05-21 01:17:51] [INFO ] Deduced a trap composed of 27 places in 189 ms
[2020-05-21 01:17:51] [INFO ] Deduced a trap composed of 27 places in 184 ms
[2020-05-21 01:17:51] [INFO ] Deduced a trap composed of 27 places in 172 ms
[2020-05-21 01:17:51] [INFO ] Deduced a trap composed of 62 places in 161 ms
[2020-05-21 01:17:52] [INFO ] Deduced a trap composed of 40 places in 115 ms
[2020-05-21 01:17:52] [INFO ] Deduced a trap composed of 40 places in 172 ms
[2020-05-21 01:17:52] [INFO ] Deduced a trap composed of 62 places in 123 ms
[2020-05-21 01:17:52] [INFO ] Deduced a trap composed of 39 places in 140 ms
[2020-05-21 01:17:52] [INFO ] Deduced a trap composed of 65 places in 112 ms
[2020-05-21 01:17:52] [INFO ] Deduced a trap composed of 58 places in 116 ms
[2020-05-21 01:17:53] [INFO ] Deduced a trap composed of 58 places in 128 ms
[2020-05-21 01:17:53] [INFO ] Deduced a trap composed of 23 places in 139 ms
[2020-05-21 01:17:53] [INFO ] Deduced a trap composed of 42 places in 149 ms
[2020-05-21 01:17:53] [INFO ] Deduced a trap composed of 42 places in 104 ms
[2020-05-21 01:17:53] [INFO ] Deduced a trap composed of 43 places in 95 ms
[2020-05-21 01:17:53] [INFO ] Deduced a trap composed of 61 places in 146 ms
[2020-05-21 01:17:54] [INFO ] Deduced a trap composed of 17 places in 194 ms
[2020-05-21 01:17:54] [INFO ] Deduced a trap composed of 54 places in 199 ms
[2020-05-21 01:17:54] [INFO ] Deduced a trap composed of 54 places in 187 ms
[2020-05-21 01:17:54] [INFO ] Deduced a trap composed of 54 places in 205 ms
[2020-05-21 01:17:55] [INFO ] Deduced a trap composed of 79 places in 203 ms
[2020-05-21 01:17:55] [INFO ] Deduced a trap composed of 47 places in 190 ms
[2020-05-21 01:17:55] [INFO ] Deduced a trap composed of 89 places in 175 ms
[2020-05-21 01:17:55] [INFO ] Deduced a trap composed of 58 places in 178 ms
[2020-05-21 01:17:55] [INFO ] Deduced a trap composed of 57 places in 161 ms
[2020-05-21 01:17:56] [INFO ] Deduced a trap composed of 30 places in 208 ms
[2020-05-21 01:17:56] [INFO ] Deduced a trap composed of 80 places in 111 ms
[2020-05-21 01:17:56] [INFO ] Deduced a trap composed of 80 places in 108 ms
[2020-05-21 01:17:56] [INFO ] Deduced a trap composed of 80 places in 101 ms
[2020-05-21 01:17:56] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 6862 ms
[2020-05-21 01:17:56] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 28 ms.
[2020-05-21 01:18:00] [INFO ] Added : 505 causal constraints over 101 iterations in 4335 ms. Result :sat
[2020-05-21 01:18:01] [INFO ] Deduced a trap composed of 36 places in 188 ms
[2020-05-21 01:18:01] [INFO ] Deduced a trap composed of 65 places in 204 ms
[2020-05-21 01:18:01] [INFO ] Deduced a trap composed of 65 places in 174 ms
[2020-05-21 01:18:01] [INFO ] Deduced a trap composed of 65 places in 137 ms
[2020-05-21 01:18:02] [INFO ] Deduced a trap composed of 41 places in 204 ms
[2020-05-21 01:18:02] [INFO ] Deduced a trap composed of 105 places in 188 ms
[2020-05-21 01:18:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1662 ms
[2020-05-21 01:18:02] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2020-05-21 01:18:02] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:18:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:18:03] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2020-05-21 01:18:03] [INFO ] [Real]Added 132 Read/Feed constraints in 25 ms returned sat
[2020-05-21 01:18:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:18:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2020-05-21 01:18:03] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:18:04] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2020-05-21 01:18:04] [INFO ] [Nat]Added 132 Read/Feed constraints in 55 ms returned sat
[2020-05-21 01:18:04] [INFO ] Deduced a trap composed of 10 places in 224 ms
[2020-05-21 01:18:04] [INFO ] Deduced a trap composed of 10 places in 206 ms
[2020-05-21 01:18:04] [INFO ] Deduced a trap composed of 39 places in 248 ms
[2020-05-21 01:18:05] [INFO ] Deduced a trap composed of 65 places in 211 ms
[2020-05-21 01:18:05] [INFO ] Deduced a trap composed of 62 places in 206 ms
[2020-05-21 01:18:05] [INFO ] Deduced a trap composed of 39 places in 231 ms
[2020-05-21 01:18:05] [INFO ] Deduced a trap composed of 10 places in 221 ms
[2020-05-21 01:18:06] [INFO ] Deduced a trap composed of 10 places in 256 ms
[2020-05-21 01:18:06] [INFO ] Deduced a trap composed of 40 places in 220 ms
[2020-05-21 01:18:06] [INFO ] Deduced a trap composed of 39 places in 183 ms
[2020-05-21 01:18:06] [INFO ] Deduced a trap composed of 58 places in 155 ms
[2020-05-21 01:18:06] [INFO ] Deduced a trap composed of 62 places in 149 ms
[2020-05-21 01:18:07] [INFO ] Deduced a trap composed of 21 places in 181 ms
[2020-05-21 01:18:07] [INFO ] Deduced a trap composed of 36 places in 180 ms
[2020-05-21 01:18:07] [INFO ] Deduced a trap composed of 36 places in 179 ms
[2020-05-21 01:18:07] [INFO ] Deduced a trap composed of 42 places in 206 ms
[2020-05-21 01:18:08] [INFO ] Deduced a trap composed of 43 places in 237 ms
[2020-05-21 01:18:08] [INFO ] Deduced a trap composed of 70 places in 152 ms
[2020-05-21 01:18:08] [INFO ] Deduced a trap composed of 58 places in 185 ms
[2020-05-21 01:18:08] [INFO ] Deduced a trap composed of 43 places in 172 ms
[2020-05-21 01:18:08] [INFO ] Deduced a trap composed of 36 places in 206 ms
[2020-05-21 01:18:09] [INFO ] Deduced a trap composed of 87 places in 132 ms
[2020-05-21 01:18:09] [INFO ] Deduced a trap composed of 88 places in 147 ms
[2020-05-21 01:18:09] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5173 ms
[2020-05-21 01:18:09] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 36 ms.
[2020-05-21 01:18:14] [INFO ] Added : 555 causal constraints over 111 iterations in 4818 ms. Result :sat
[2020-05-21 01:18:14] [INFO ] Deduced a trap composed of 65 places in 138 ms
[2020-05-21 01:18:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2020-05-21 01:18:14] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:18:14] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:18:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:18:15] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2020-05-21 01:18:15] [INFO ] [Real]Added 132 Read/Feed constraints in 24 ms returned sat
[2020-05-21 01:18:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:18:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2020-05-21 01:18:15] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:18:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:18:15] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2020-05-21 01:18:15] [INFO ] [Nat]Added 132 Read/Feed constraints in 46 ms returned sat
[2020-05-21 01:18:16] [INFO ] Deduced a trap composed of 12 places in 221 ms
[2020-05-21 01:18:16] [INFO ] Deduced a trap composed of 66 places in 141 ms
[2020-05-21 01:18:16] [INFO ] Deduced a trap composed of 54 places in 160 ms
[2020-05-21 01:18:16] [INFO ] Deduced a trap composed of 82 places in 174 ms
[2020-05-21 01:18:16] [INFO ] Deduced a trap composed of 47 places in 145 ms
[2020-05-21 01:18:17] [INFO ] Deduced a trap composed of 14 places in 165 ms
[2020-05-21 01:18:17] [INFO ] Deduced a trap composed of 21 places in 153 ms
[2020-05-21 01:18:17] [INFO ] Deduced a trap composed of 14 places in 177 ms
[2020-05-21 01:18:17] [INFO ] Deduced a trap composed of 10 places in 187 ms
[2020-05-21 01:18:17] [INFO ] Deduced a trap composed of 50 places in 108 ms
[2020-05-21 01:18:18] [INFO ] Deduced a trap composed of 54 places in 114 ms
[2020-05-21 01:18:18] [INFO ] Deduced a trap composed of 27 places in 142 ms
[2020-05-21 01:18:18] [INFO ] Deduced a trap composed of 39 places in 94 ms
[2020-05-21 01:18:18] [INFO ] Deduced a trap composed of 36 places in 110 ms
[2020-05-21 01:18:18] [INFO ] Deduced a trap composed of 43 places in 88 ms
[2020-05-21 01:18:18] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2630 ms
[2020-05-21 01:18:18] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 29 ms.
[2020-05-21 01:18:23] [INFO ] Added : 519 causal constraints over 104 iterations in 4684 ms. Result :sat
[2020-05-21 01:18:23] [INFO ] Deduced a trap composed of 25 places in 270 ms
[2020-05-21 01:18:23] [INFO ] Deduced a trap composed of 13 places in 235 ms
[2020-05-21 01:18:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 706 ms
[2020-05-21 01:18:24] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:18:24] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:18:24] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2020-05-21 01:18:24] [INFO ] [Real]Added 132 Read/Feed constraints in 14 ms returned sat
[2020-05-21 01:18:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:18:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:18:24] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:18:25] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2020-05-21 01:18:25] [INFO ] [Nat]Added 132 Read/Feed constraints in 32 ms returned sat
[2020-05-21 01:18:25] [INFO ] Deduced a trap composed of 47 places in 157 ms
[2020-05-21 01:18:25] [INFO ] Deduced a trap composed of 47 places in 144 ms
[2020-05-21 01:18:26] [INFO ] Deduced a trap composed of 21 places in 150 ms
[2020-05-21 01:18:26] [INFO ] Deduced a trap composed of 56 places in 176 ms
[2020-05-21 01:18:26] [INFO ] Deduced a trap composed of 22 places in 143 ms
[2020-05-21 01:18:26] [INFO ] Deduced a trap composed of 32 places in 147 ms
[2020-05-21 01:18:26] [INFO ] Deduced a trap composed of 36 places in 80 ms
[2020-05-21 01:18:26] [INFO ] Deduced a trap composed of 40 places in 75 ms
[2020-05-21 01:18:26] [INFO ] Deduced a trap composed of 37 places in 156 ms
[2020-05-21 01:18:27] [INFO ] Deduced a trap composed of 12 places in 161 ms
[2020-05-21 01:18:27] [INFO ] Deduced a trap composed of 13 places in 180 ms
[2020-05-21 01:18:27] [INFO ] Deduced a trap composed of 37 places in 140 ms
[2020-05-21 01:18:27] [INFO ] Deduced a trap composed of 10 places in 146 ms
[2020-05-21 01:18:27] [INFO ] Deduced a trap composed of 36 places in 106 ms
[2020-05-21 01:18:27] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2359 ms
[2020-05-21 01:18:27] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 43 ms.
[2020-05-21 01:18:33] [INFO ] Added : 625 causal constraints over 125 iterations in 5696 ms. Result :sat
[2020-05-21 01:18:33] [INFO ] Deduced a trap composed of 39 places in 220 ms
[2020-05-21 01:18:34] [INFO ] Deduced a trap composed of 27 places in 264 ms
[2020-05-21 01:18:34] [INFO ] Deduced a trap composed of 60 places in 232 ms
[2020-05-21 01:18:34] [INFO ] Deduced a trap composed of 27 places in 260 ms
[2020-05-21 01:18:35] [INFO ] Deduced a trap composed of 54 places in 125 ms
[2020-05-21 01:18:35] [INFO ] Deduced a trap composed of 39 places in 115 ms
[2020-05-21 01:18:35] [INFO ] Deduced a trap composed of 40 places in 166 ms
[2020-05-21 01:18:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2031 ms
[2020-05-21 01:18:35] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2020-05-21 01:18:35] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:18:36] [INFO ] [Real]Absence check using state equation in 618 ms returned sat
[2020-05-21 01:18:36] [INFO ] [Real]Added 132 Read/Feed constraints in 15 ms returned sat
[2020-05-21 01:18:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:18:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:18:36] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2020-05-21 01:18:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:18:36] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2020-05-21 01:18:37] [INFO ] [Nat]Added 132 Read/Feed constraints in 29 ms returned sat
[2020-05-21 01:18:37] [INFO ] Deduced a trap composed of 25 places in 197 ms
[2020-05-21 01:18:37] [INFO ] Deduced a trap composed of 10 places in 168 ms
[2020-05-21 01:18:37] [INFO ] Deduced a trap composed of 10 places in 172 ms
[2020-05-21 01:18:37] [INFO ] Deduced a trap composed of 27 places in 213 ms
[2020-05-21 01:18:38] [INFO ] Deduced a trap composed of 14 places in 184 ms
[2020-05-21 01:18:38] [INFO ] Deduced a trap composed of 43 places in 214 ms
[2020-05-21 01:18:38] [INFO ] Deduced a trap composed of 21 places in 157 ms
[2020-05-21 01:18:38] [INFO ] Deduced a trap composed of 36 places in 144 ms
[2020-05-21 01:18:38] [INFO ] Deduced a trap composed of 32 places in 137 ms
[2020-05-21 01:18:39] [INFO ] Deduced a trap composed of 42 places in 130 ms
[2020-05-21 01:18:39] [INFO ] Deduced a trap composed of 62 places in 175 ms
[2020-05-21 01:18:39] [INFO ] Deduced a trap composed of 61 places in 160 ms
[2020-05-21 01:18:39] [INFO ] Deduced a trap composed of 54 places in 177 ms
[2020-05-21 01:18:39] [INFO ] Deduced a trap composed of 54 places in 157 ms
[2020-05-21 01:18:39] [INFO ] Deduced a trap composed of 39 places in 159 ms
[2020-05-21 01:18:40] [INFO ] Deduced a trap composed of 31 places in 216 ms
[2020-05-21 01:18:40] [INFO ] Deduced a trap composed of 40 places in 177 ms
[2020-05-21 01:18:40] [INFO ] Deduced a trap composed of 65 places in 134 ms
[2020-05-21 01:18:40] [INFO ] Deduced a trap composed of 57 places in 176 ms
[2020-05-21 01:18:40] [INFO ] Deduced a trap composed of 83 places in 119 ms
[2020-05-21 01:18:40] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3930 ms
[2020-05-21 01:18:40] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 27 ms.
[2020-05-21 01:18:46] [INFO ] Added : 561 causal constraints over 113 iterations in 5156 ms. Result :sat
[2020-05-21 01:18:46] [INFO ] Deduced a trap composed of 10 places in 214 ms
[2020-05-21 01:18:46] [INFO ] Deduced a trap composed of 112 places in 223 ms
[2020-05-21 01:18:46] [INFO ] Deduced a trap composed of 13 places in 257 ms
[2020-05-21 01:18:47] [INFO ] Deduced a trap composed of 47 places in 199 ms
[2020-05-21 01:18:47] [INFO ] Deduced a trap composed of 47 places in 181 ms
[2020-05-21 01:18:47] [INFO ] Deduced a trap composed of 88 places in 183 ms
[2020-05-21 01:18:47] [INFO ] Deduced a trap composed of 57 places in 174 ms
[2020-05-21 01:18:48] [INFO ] Deduced a trap composed of 69 places in 148 ms
[2020-05-21 01:18:48] [INFO ] Deduced a trap composed of 88 places in 137 ms
[2020-05-21 01:18:48] [INFO ] Deduced a trap composed of 111 places in 91 ms
[2020-05-21 01:18:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2441 ms
[2020-05-21 01:18:48] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2020-05-21 01:18:48] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:18:49] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2020-05-21 01:18:49] [INFO ] [Real]Added 132 Read/Feed constraints in 17 ms returned sat
[2020-05-21 01:18:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:18:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:18:49] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:18:49] [INFO ] [Nat]Absence check using state equation in 612 ms returned sat
[2020-05-21 01:18:49] [INFO ] [Nat]Added 132 Read/Feed constraints in 32 ms returned sat
[2020-05-21 01:18:50] [INFO ] Deduced a trap composed of 10 places in 175 ms
[2020-05-21 01:18:50] [INFO ] Deduced a trap composed of 10 places in 178 ms
[2020-05-21 01:18:50] [INFO ] Deduced a trap composed of 10 places in 182 ms
[2020-05-21 01:18:50] [INFO ] Deduced a trap composed of 10 places in 147 ms
[2020-05-21 01:18:50] [INFO ] Deduced a trap composed of 43 places in 108 ms
[2020-05-21 01:18:51] [INFO ] Deduced a trap composed of 44 places in 146 ms
[2020-05-21 01:18:51] [INFO ] Deduced a trap composed of 50 places in 111 ms
[2020-05-21 01:18:51] [INFO ] Deduced a trap composed of 43 places in 112 ms
[2020-05-21 01:18:51] [INFO ] Deduced a trap composed of 13 places in 157 ms
[2020-05-21 01:18:51] [INFO ] Deduced a trap composed of 39 places in 165 ms
[2020-05-21 01:18:51] [INFO ] Deduced a trap composed of 98 places in 171 ms
[2020-05-21 01:18:52] [INFO ] Deduced a trap composed of 121 places in 166 ms
[2020-05-21 01:18:52] [INFO ] Deduced a trap composed of 66 places in 149 ms
[2020-05-21 01:18:52] [INFO ] Deduced a trap composed of 62 places in 184 ms
[2020-05-21 01:18:52] [INFO ] Deduced a trap composed of 65 places in 159 ms
[2020-05-21 01:18:52] [INFO ] Deduced a trap composed of 65 places in 153 ms
[2020-05-21 01:18:53] [INFO ] Deduced a trap composed of 19 places in 174 ms
[2020-05-21 01:18:53] [INFO ] Deduced a trap composed of 69 places in 126 ms
[2020-05-21 01:18:53] [INFO ] Deduced a trap composed of 31 places in 98 ms
[2020-05-21 01:18:53] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3466 ms
[2020-05-21 01:18:53] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 30 ms.
[2020-05-21 01:19:00] [INFO ] Added : 592 causal constraints over 119 iterations in 6572 ms. Result :sat
[2020-05-21 01:19:00] [INFO ] Deduced a trap composed of 89 places in 235 ms
[2020-05-21 01:19:00] [INFO ] Deduced a trap composed of 21 places in 189 ms
[2020-05-21 01:19:00] [INFO ] Deduced a trap composed of 61 places in 144 ms
[2020-05-21 01:19:00] [INFO ] Deduced a trap composed of 39 places in 170 ms
[2020-05-21 01:19:01] [INFO ] Deduced a trap composed of 42 places in 160 ms
[2020-05-21 01:19:01] [INFO ] Deduced a trap composed of 61 places in 96 ms
[2020-05-21 01:19:01] [INFO ] Deduced a trap composed of 58 places in 96 ms
[2020-05-21 01:19:01] [INFO ] Deduced a trap composed of 32 places in 158 ms
[2020-05-21 01:19:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1918 ms
[2020-05-21 01:19:01] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2020-05-21 01:19:01] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:19:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:19:02] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2020-05-21 01:19:02] [INFO ] [Real]Added 132 Read/Feed constraints in 18 ms returned sat
[2020-05-21 01:19:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:19:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:19:02] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:19:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:19:03] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2020-05-21 01:19:03] [INFO ] [Nat]Added 132 Read/Feed constraints in 32 ms returned sat
[2020-05-21 01:19:03] [INFO ] Deduced a trap composed of 32 places in 205 ms
[2020-05-21 01:19:03] [INFO ] Deduced a trap composed of 14 places in 229 ms
[2020-05-21 01:19:04] [INFO ] Deduced a trap composed of 58 places in 259 ms
[2020-05-21 01:19:04] [INFO ] Deduced a trap composed of 14 places in 252 ms
[2020-05-21 01:19:04] [INFO ] Deduced a trap composed of 10 places in 235 ms
[2020-05-21 01:19:04] [INFO ] Deduced a trap composed of 58 places in 254 ms
[2020-05-21 01:19:05] [INFO ] Deduced a trap composed of 27 places in 252 ms
[2020-05-21 01:19:05] [INFO ] Deduced a trap composed of 16 places in 228 ms
[2020-05-21 01:19:05] [INFO ] Deduced a trap composed of 31 places in 193 ms
[2020-05-21 01:19:05] [INFO ] Deduced a trap composed of 76 places in 190 ms
[2020-05-21 01:19:06] [INFO ] Deduced a trap composed of 40 places in 222 ms
[2020-05-21 01:19:06] [INFO ] Deduced a trap composed of 50 places in 229 ms
[2020-05-21 01:19:06] [INFO ] Deduced a trap composed of 100 places in 248 ms
[2020-05-21 01:19:06] [INFO ] Deduced a trap composed of 32 places in 222 ms
[2020-05-21 01:19:07] [INFO ] Deduced a trap composed of 10 places in 245 ms
[2020-05-21 01:19:07] [INFO ] Deduced a trap composed of 54 places in 222 ms
[2020-05-21 01:19:07] [INFO ] Deduced a trap composed of 54 places in 190 ms
[2020-05-21 01:19:08] [INFO ] Deduced a trap composed of 54 places in 192 ms
[2020-05-21 01:19:08] [INFO ] Deduced a trap composed of 54 places in 137 ms
[2020-05-21 01:19:08] [INFO ] Deduced a trap composed of 76 places in 121 ms
[2020-05-21 01:19:08] [INFO ] Deduced a trap composed of 76 places in 173 ms
[2020-05-21 01:19:08] [INFO ] Deduced a trap composed of 76 places in 158 ms
[2020-05-21 01:19:08] [INFO ] Deduced a trap composed of 43 places in 124 ms
[2020-05-21 01:19:09] [INFO ] Deduced a trap composed of 22 places in 250 ms
[2020-05-21 01:19:09] [INFO ] Deduced a trap composed of 66 places in 210 ms
[2020-05-21 01:19:10] [INFO ] Deduced a trap composed of 10 places in 324 ms
[2020-05-21 01:19:10] [INFO ] Deduced a trap composed of 32 places in 225 ms
[2020-05-21 01:19:10] [INFO ] Deduced a trap composed of 21 places in 238 ms
[2020-05-21 01:19:10] [INFO ] Deduced a trap composed of 91 places in 221 ms
[2020-05-21 01:19:11] [INFO ] Deduced a trap composed of 65 places in 270 ms
[2020-05-21 01:19:11] [INFO ] Deduced a trap composed of 38 places in 237 ms
[2020-05-21 01:19:11] [INFO ] Deduced a trap composed of 42 places in 233 ms
[2020-05-21 01:19:11] [INFO ] Deduced a trap composed of 69 places in 176 ms
[2020-05-21 01:19:12] [INFO ] Deduced a trap composed of 91 places in 104 ms
[2020-05-21 01:19:12] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 8748 ms
[2020-05-21 01:19:12] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 40 ms.
[2020-05-21 01:19:18] [INFO ] Added : 622 causal constraints over 125 iterations in 6586 ms. Result :sat
[2020-05-21 01:19:18] [INFO ] Deduced a trap composed of 96 places in 224 ms
[2020-05-21 01:19:19] [INFO ] Deduced a trap composed of 91 places in 222 ms
[2020-05-21 01:19:19] [INFO ] Deduced a trap composed of 69 places in 209 ms
[2020-05-21 01:19:19] [INFO ] Deduced a trap composed of 61 places in 165 ms
[2020-05-21 01:19:20] [INFO ] Deduced a trap composed of 90 places in 231 ms
[2020-05-21 01:19:20] [INFO ] Deduced a trap composed of 147 places in 199 ms
[2020-05-21 01:19:20] [INFO ] Deduced a trap composed of 61 places in 128 ms
[2020-05-21 01:19:20] [INFO ] Deduced a trap composed of 91 places in 147 ms
[2020-05-21 01:19:21] [INFO ] Deduced a trap composed of 92 places in 142 ms
[2020-05-21 01:19:21] [INFO ] Deduced a trap composed of 92 places in 133 ms
[2020-05-21 01:19:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2604 ms
[2020-05-21 01:19:21] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2020-05-21 01:19:21] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:19:21] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2020-05-21 01:19:21] [INFO ] [Real]Added 132 Read/Feed constraints in 29 ms returned sat
[2020-05-21 01:19:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:19:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:19:22] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:19:22] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2020-05-21 01:19:22] [INFO ] [Nat]Added 132 Read/Feed constraints in 38 ms returned sat
[2020-05-21 01:19:22] [INFO ] Deduced a trap composed of 14 places in 169 ms
[2020-05-21 01:19:23] [INFO ] Deduced a trap composed of 47 places in 150 ms
[2020-05-21 01:19:23] [INFO ] Deduced a trap composed of 47 places in 167 ms
[2020-05-21 01:19:23] [INFO ] Deduced a trap composed of 47 places in 146 ms
[2020-05-21 01:19:23] [INFO ] Deduced a trap composed of 21 places in 166 ms
[2020-05-21 01:19:23] [INFO ] Deduced a trap composed of 40 places in 137 ms
[2020-05-21 01:19:24] [INFO ] Deduced a trap composed of 17 places in 147 ms
[2020-05-21 01:19:24] [INFO ] Deduced a trap composed of 14 places in 161 ms
[2020-05-21 01:19:24] [INFO ] Deduced a trap composed of 14 places in 163 ms
[2020-05-21 01:19:24] [INFO ] Deduced a trap composed of 61 places in 85 ms
[2020-05-21 01:19:24] [INFO ] Deduced a trap composed of 62 places in 81 ms
[2020-05-21 01:19:24] [INFO ] Deduced a trap composed of 62 places in 85 ms
[2020-05-21 01:19:24] [INFO ] Deduced a trap composed of 69 places in 76 ms
[2020-05-21 01:19:25] [INFO ] Deduced a trap composed of 13 places in 157 ms
[2020-05-21 01:19:25] [INFO ] Deduced a trap composed of 61 places in 113 ms
[2020-05-21 01:19:25] [INFO ] Deduced a trap composed of 10 places in 109 ms
[2020-05-21 01:19:25] [INFO ] Deduced a trap composed of 10 places in 108 ms
[2020-05-21 01:19:25] [INFO ] Deduced a trap composed of 39 places in 117 ms
[2020-05-21 01:19:25] [INFO ] Deduced a trap composed of 36 places in 214 ms
[2020-05-21 01:19:26] [INFO ] Deduced a trap composed of 36 places in 217 ms
[2020-05-21 01:19:26] [INFO ] Deduced a trap composed of 84 places in 189 ms
[2020-05-21 01:19:26] [INFO ] Deduced a trap composed of 84 places in 144 ms
[2020-05-21 01:19:26] [INFO ] Deduced a trap composed of 87 places in 148 ms
[2020-05-21 01:19:26] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3967 ms
[2020-05-21 01:19:26] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 31 ms.
[2020-05-21 01:19:32] [INFO ] Added : 625 causal constraints over 125 iterations in 5915 ms. Result :sat
[2020-05-21 01:19:32] [INFO ] Deduced a trap composed of 112 places in 186 ms
[2020-05-21 01:19:33] [INFO ] Deduced a trap composed of 83 places in 166 ms
[2020-05-21 01:19:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 521 ms
[2020-05-21 01:19:33] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2020-05-21 01:19:33] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:19:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:19:33] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2020-05-21 01:19:33] [INFO ] [Real]Added 132 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:19:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:19:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:19:33] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:19:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:19:34] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2020-05-21 01:19:34] [INFO ] [Nat]Added 132 Read/Feed constraints in 57 ms returned sat
[2020-05-21 01:19:34] [INFO ] Deduced a trap composed of 37 places in 212 ms
[2020-05-21 01:19:35] [INFO ] Deduced a trap composed of 37 places in 195 ms
[2020-05-21 01:19:35] [INFO ] Deduced a trap composed of 21 places in 171 ms
[2020-05-21 01:19:35] [INFO ] Deduced a trap composed of 17 places in 168 ms
[2020-05-21 01:19:35] [INFO ] Deduced a trap composed of 32 places in 196 ms
[2020-05-21 01:19:35] [INFO ] Deduced a trap composed of 14 places in 202 ms
[2020-05-21 01:19:36] [INFO ] Deduced a trap composed of 14 places in 183 ms
[2020-05-21 01:19:36] [INFO ] Deduced a trap composed of 10 places in 215 ms
[2020-05-21 01:19:36] [INFO ] Deduced a trap composed of 62 places in 97 ms
[2020-05-21 01:19:36] [INFO ] Deduced a trap composed of 62 places in 122 ms
[2020-05-21 01:19:36] [INFO ] Deduced a trap composed of 65 places in 133 ms
[2020-05-21 01:19:37] [INFO ] Deduced a trap composed of 61 places in 135 ms
[2020-05-21 01:19:37] [INFO ] Deduced a trap composed of 84 places in 151 ms
[2020-05-21 01:19:37] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2593 ms
[2020-05-21 01:19:37] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 48 ms.
[2020-05-21 01:19:43] [INFO ] Added : 590 causal constraints over 119 iterations in 6294 ms. Result :sat
[2020-05-21 01:19:43] [INFO ] Deduced a trap composed of 58 places in 130 ms
[2020-05-21 01:19:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2020-05-21 01:19:43] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:19:43] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:19:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:19:44] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2020-05-21 01:19:44] [INFO ] [Real]Added 132 Read/Feed constraints in 25 ms returned sat
[2020-05-21 01:19:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:19:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2020-05-21 01:19:44] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:19:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:19:45] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2020-05-21 01:19:45] [INFO ] [Nat]Added 132 Read/Feed constraints in 55 ms returned sat
[2020-05-21 01:19:45] [INFO ] Deduced a trap composed of 37 places in 156 ms
[2020-05-21 01:19:45] [INFO ] Deduced a trap composed of 39 places in 187 ms
[2020-05-21 01:19:45] [INFO ] Deduced a trap composed of 10 places in 174 ms
[2020-05-21 01:19:46] [INFO ] Deduced a trap composed of 21 places in 171 ms
[2020-05-21 01:19:46] [INFO ] Deduced a trap composed of 10 places in 199 ms
[2020-05-21 01:19:46] [INFO ] Deduced a trap composed of 32 places in 186 ms
[2020-05-21 01:19:46] [INFO ] Deduced a trap composed of 32 places in 178 ms
[2020-05-21 01:19:46] [INFO ] Deduced a trap composed of 32 places in 148 ms
[2020-05-21 01:19:47] [INFO ] Deduced a trap composed of 10 places in 187 ms
[2020-05-21 01:19:47] [INFO ] Deduced a trap composed of 54 places in 120 ms
[2020-05-21 01:19:47] [INFO ] Deduced a trap composed of 32 places in 128 ms
[2020-05-21 01:19:47] [INFO ] Deduced a trap composed of 58 places in 102 ms
[2020-05-21 01:19:47] [INFO ] Deduced a trap composed of 54 places in 110 ms
[2020-05-21 01:19:47] [INFO ] Deduced a trap composed of 54 places in 133 ms
[2020-05-21 01:19:48] [INFO ] Deduced a trap composed of 76 places in 165 ms
[2020-05-21 01:19:48] [INFO ] Deduced a trap composed of 76 places in 169 ms
[2020-05-21 01:19:48] [INFO ] Deduced a trap composed of 76 places in 165 ms
[2020-05-21 01:19:48] [INFO ] Deduced a trap composed of 76 places in 113 ms
[2020-05-21 01:19:48] [INFO ] Deduced a trap composed of 54 places in 104 ms
[2020-05-21 01:19:49] [INFO ] Deduced a trap composed of 57 places in 147 ms
[2020-05-21 01:19:49] [INFO ] Deduced a trap composed of 30 places in 215 ms
[2020-05-21 01:19:49] [INFO ] Deduced a trap composed of 76 places in 139 ms
[2020-05-21 01:19:49] [INFO ] Deduced a trap composed of 13 places in 160 ms
[2020-05-21 01:19:49] [INFO ] Deduced a trap composed of 39 places in 114 ms
[2020-05-21 01:19:49] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4497 ms
[2020-05-21 01:19:49] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 50 ms.
[2020-05-21 01:19:55] [INFO ] Added : 571 causal constraints over 115 iterations in 5508 ms. Result :sat
[2020-05-21 01:19:55] [INFO ] Deduced a trap composed of 43 places in 231 ms
[2020-05-21 01:19:55] [INFO ] Deduced a trap composed of 14 places in 248 ms
[2020-05-21 01:19:56] [INFO ] Deduced a trap composed of 21 places in 242 ms
[2020-05-21 01:19:56] [INFO ] Deduced a trap composed of 102 places in 131 ms
[2020-05-21 01:19:56] [INFO ] Deduced a trap composed of 69 places in 132 ms
[2020-05-21 01:19:56] [INFO ] Deduced a trap composed of 69 places in 122 ms
[2020-05-21 01:19:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1524 ms
[2020-05-21 01:19:56] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:19:56] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:19:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:19:57] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2020-05-21 01:19:57] [INFO ] [Real]Added 132 Read/Feed constraints in 18 ms returned sat
[2020-05-21 01:19:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:19:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:19:57] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:19:58] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2020-05-21 01:19:58] [INFO ] [Nat]Added 132 Read/Feed constraints in 35 ms returned sat
[2020-05-21 01:19:58] [INFO ] Deduced a trap composed of 21 places in 179 ms
[2020-05-21 01:19:58] [INFO ] Deduced a trap composed of 32 places in 127 ms
[2020-05-21 01:19:58] [INFO ] Deduced a trap composed of 32 places in 154 ms
[2020-05-21 01:19:58] [INFO ] Deduced a trap composed of 54 places in 130 ms
[2020-05-21 01:19:59] [INFO ] Deduced a trap composed of 31 places in 168 ms
[2020-05-21 01:19:59] [INFO ] Deduced a trap composed of 50 places in 128 ms
[2020-05-21 01:19:59] [INFO ] Deduced a trap composed of 39 places in 145 ms
[2020-05-21 01:19:59] [INFO ] Deduced a trap composed of 10 places in 159 ms
[2020-05-21 01:19:59] [INFO ] Deduced a trap composed of 10 places in 177 ms
[2020-05-21 01:20:00] [INFO ] Deduced a trap composed of 58 places in 183 ms
[2020-05-21 01:20:00] [INFO ] Deduced a trap composed of 58 places in 147 ms
[2020-05-21 01:20:00] [INFO ] Deduced a trap composed of 62 places in 177 ms
[2020-05-21 01:20:00] [INFO ] Deduced a trap composed of 72 places in 180 ms
[2020-05-21 01:20:00] [INFO ] Deduced a trap composed of 54 places in 152 ms
[2020-05-21 01:20:01] [INFO ] Deduced a trap composed of 10 places in 196 ms
[2020-05-21 01:20:01] [INFO ] Deduced a trap composed of 69 places in 148 ms
[2020-05-21 01:20:01] [INFO ] Deduced a trap composed of 65 places in 135 ms
[2020-05-21 01:20:01] [INFO ] Deduced a trap composed of 61 places in 189 ms
[2020-05-21 01:20:01] [INFO ] Deduced a trap composed of 62 places in 149 ms
[2020-05-21 01:20:02] [INFO ] Deduced a trap composed of 67 places in 133 ms
[2020-05-21 01:20:02] [INFO ] Deduced a trap composed of 43 places in 54 ms
[2020-05-21 01:20:02] [INFO ] Deduced a trap composed of 48 places in 140 ms
[2020-05-21 01:20:02] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3984 ms
[2020-05-21 01:20:02] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 38 ms.
[2020-05-21 01:20:07] [INFO ] Added : 531 causal constraints over 107 iterations in 4750 ms. Result :sat
[2020-05-21 01:20:07] [INFO ] Deduced a trap composed of 40 places in 104 ms
[2020-05-21 01:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2020-05-21 01:20:07] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2020-05-21 01:20:07] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:20:07] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2020-05-21 01:20:07] [INFO ] [Real]Added 132 Read/Feed constraints in 17 ms returned sat
[2020-05-21 01:20:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:20:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:20:07] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:20:08] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2020-05-21 01:20:08] [INFO ] [Nat]Added 132 Read/Feed constraints in 30 ms returned sat
[2020-05-21 01:20:08] [INFO ] Deduced a trap composed of 10 places in 155 ms
[2020-05-21 01:20:08] [INFO ] Deduced a trap composed of 10 places in 179 ms
[2020-05-21 01:20:09] [INFO ] Deduced a trap composed of 47 places in 152 ms
[2020-05-21 01:20:09] [INFO ] Deduced a trap composed of 36 places in 211 ms
[2020-05-21 01:20:09] [INFO ] Deduced a trap composed of 13 places in 204 ms
[2020-05-21 01:20:09] [INFO ] Deduced a trap composed of 47 places in 191 ms
[2020-05-21 01:20:10] [INFO ] Deduced a trap composed of 47 places in 161 ms
[2020-05-21 01:20:10] [INFO ] Deduced a trap composed of 36 places in 202 ms
[2020-05-21 01:20:10] [INFO ] Deduced a trap composed of 32 places in 213 ms
[2020-05-21 01:20:10] [INFO ] Deduced a trap composed of 39 places in 243 ms
[2020-05-21 01:20:10] [INFO ] Deduced a trap composed of 10 places in 180 ms
[2020-05-21 01:20:11] [INFO ] Deduced a trap composed of 10 places in 168 ms
[2020-05-21 01:20:11] [INFO ] Deduced a trap composed of 43 places in 188 ms
[2020-05-21 01:20:11] [INFO ] Deduced a trap composed of 58 places in 253 ms
[2020-05-21 01:20:11] [INFO ] Deduced a trap composed of 35 places in 193 ms
[2020-05-21 01:20:12] [INFO ] Deduced a trap composed of 54 places in 235 ms
[2020-05-21 01:20:12] [INFO ] Deduced a trap composed of 98 places in 248 ms
[2020-05-21 01:20:12] [INFO ] Deduced a trap composed of 47 places in 183 ms
[2020-05-21 01:20:12] [INFO ] Deduced a trap composed of 54 places in 193 ms
[2020-05-21 01:20:12] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4357 ms
[2020-05-21 01:20:12] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 42 ms.
[2020-05-21 01:20:18] [INFO ] Added : 569 causal constraints over 114 iterations in 5731 ms. Result :sat
[2020-05-21 01:20:18] [INFO ] Deduced a trap composed of 67 places in 227 ms
[2020-05-21 01:20:19] [INFO ] Deduced a trap composed of 40 places in 192 ms
[2020-05-21 01:20:19] [INFO ] Deduced a trap composed of 69 places in 171 ms
[2020-05-21 01:20:19] [INFO ] Deduced a trap composed of 32 places in 164 ms
[2020-05-21 01:20:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1081 ms
[2020-05-21 01:20:19] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2020-05-21 01:20:19] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:20:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:20:20] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2020-05-21 01:20:20] [INFO ] [Real]Added 132 Read/Feed constraints in 16 ms returned sat
[2020-05-21 01:20:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:20:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:20:20] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:20:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:20:21] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2020-05-21 01:20:21] [INFO ] [Nat]Added 132 Read/Feed constraints in 39 ms returned sat
[2020-05-21 01:20:21] [INFO ] Deduced a trap composed of 14 places in 216 ms
[2020-05-21 01:20:21] [INFO ] Deduced a trap composed of 32 places in 206 ms
[2020-05-21 01:20:21] [INFO ] Deduced a trap composed of 50 places in 226 ms
[2020-05-21 01:20:22] [INFO ] Deduced a trap composed of 79 places in 252 ms
[2020-05-21 01:20:22] [INFO ] Deduced a trap composed of 27 places in 164 ms
[2020-05-21 01:20:22] [INFO ] Deduced a trap composed of 27 places in 186 ms
[2020-05-21 01:20:22] [INFO ] Deduced a trap composed of 27 places in 158 ms
[2020-05-21 01:20:23] [INFO ] Deduced a trap composed of 10 places in 210 ms
[2020-05-21 01:20:23] [INFO ] Deduced a trap composed of 10 places in 146 ms
[2020-05-21 01:20:23] [INFO ] Deduced a trap composed of 10 places in 149 ms
[2020-05-21 01:20:23] [INFO ] Deduced a trap composed of 42 places in 183 ms
[2020-05-21 01:20:23] [INFO ] Deduced a trap composed of 42 places in 198 ms
[2020-05-21 01:20:24] [INFO ] Deduced a trap composed of 58 places in 190 ms
[2020-05-21 01:20:24] [INFO ] Deduced a trap composed of 61 places in 154 ms
[2020-05-21 01:20:24] [INFO ] Deduced a trap composed of 36 places in 94 ms
[2020-05-21 01:20:24] [INFO ] Deduced a trap composed of 40 places in 73 ms
[2020-05-21 01:20:24] [INFO ] Deduced a trap composed of 39 places in 100 ms
[2020-05-21 01:20:24] [INFO ] Deduced a trap composed of 40 places in 69 ms
[2020-05-21 01:20:24] [INFO ] Deduced a trap composed of 35 places in 223 ms
[2020-05-21 01:20:25] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3795 ms
[2020-05-21 01:20:25] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 35 ms.
[2020-05-21 01:20:31] [INFO ] Added : 625 causal constraints over 125 iterations in 6098 ms. Result :sat
[2020-05-21 01:20:31] [INFO ] Deduced a trap composed of 25 places in 203 ms
[2020-05-21 01:20:31] [INFO ] Deduced a trap composed of 13 places in 201 ms
[2020-05-21 01:20:31] [INFO ] Deduced a trap composed of 79 places in 154 ms
[2020-05-21 01:20:32] [INFO ] Deduced a trap composed of 80 places in 155 ms
[2020-05-21 01:20:32] [INFO ] Deduced a trap composed of 14 places in 193 ms
[2020-05-21 01:20:32] [INFO ] Deduced a trap composed of 80 places in 128 ms
[2020-05-21 01:20:32] [INFO ] Deduced a trap composed of 21 places in 143 ms
[2020-05-21 01:20:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1835 ms
[2020-05-21 01:20:33] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2020-05-21 01:20:33] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:20:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:20:33] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2020-05-21 01:20:33] [INFO ] [Real]Added 132 Read/Feed constraints in 40 ms returned sat
[2020-05-21 01:20:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:20:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 26 ms returned sat
[2020-05-21 01:20:33] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:20:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:20:34] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2020-05-21 01:20:34] [INFO ] [Nat]Added 132 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:20:34] [INFO ] Deduced a trap composed of 47 places in 250 ms
[2020-05-21 01:20:35] [INFO ] Deduced a trap composed of 47 places in 276 ms
[2020-05-21 01:20:35] [INFO ] Deduced a trap composed of 10 places in 241 ms
[2020-05-21 01:20:35] [INFO ] Deduced a trap composed of 12 places in 241 ms
[2020-05-21 01:20:35] [INFO ] Deduced a trap composed of 12 places in 247 ms
[2020-05-21 01:20:36] [INFO ] Deduced a trap composed of 10 places in 257 ms
[2020-05-21 01:20:36] [INFO ] Deduced a trap composed of 83 places in 188 ms
[2020-05-21 01:20:36] [INFO ] Deduced a trap composed of 84 places in 205 ms
[2020-05-21 01:20:36] [INFO ] Deduced a trap composed of 50 places in 206 ms
[2020-05-21 01:20:37] [INFO ] Deduced a trap composed of 50 places in 184 ms
[2020-05-21 01:20:37] [INFO ] Deduced a trap composed of 50 places in 177 ms
[2020-05-21 01:20:37] [INFO ] Deduced a trap composed of 119 places in 157 ms
[2020-05-21 01:20:37] [INFO ] Deduced a trap composed of 54 places in 103 ms
[2020-05-21 01:20:37] [INFO ] Deduced a trap composed of 98 places in 136 ms
[2020-05-21 01:20:37] [INFO ] Deduced a trap composed of 69 places in 142 ms
[2020-05-21 01:20:38] [INFO ] Deduced a trap composed of 54 places in 177 ms
[2020-05-21 01:20:38] [INFO ] Deduced a trap composed of 32 places in 169 ms
[2020-05-21 01:20:38] [INFO ] Deduced a trap composed of 76 places in 161 ms
[2020-05-21 01:20:38] [INFO ] Deduced a trap composed of 27 places in 239 ms
[2020-05-21 01:20:38] [INFO ] Deduced a trap composed of 76 places in 111 ms
[2020-05-21 01:20:39] [INFO ] Deduced a trap composed of 76 places in 116 ms
[2020-05-21 01:20:39] [INFO ] Deduced a trap composed of 76 places in 170 ms
[2020-05-21 01:20:39] [INFO ] Deduced a trap composed of 44 places in 156 ms
[2020-05-21 01:20:39] [INFO ] Deduced a trap composed of 54 places in 109 ms
[2020-05-21 01:20:39] [INFO ] Deduced a trap composed of 56 places in 163 ms
[2020-05-21 01:20:40] [INFO ] Deduced a trap composed of 58 places in 169 ms
[2020-05-21 01:20:40] [INFO ] Deduced a trap composed of 36 places in 168 ms
[2020-05-21 01:20:40] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5833 ms
[2020-05-21 01:20:40] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 36 ms.
[2020-05-21 01:20:46] [INFO ] Added : 625 causal constraints over 125 iterations in 5957 ms. Result :sat
[2020-05-21 01:20:46] [INFO ] Deduced a trap composed of 35 places in 216 ms
[2020-05-21 01:20:46] [INFO ] Deduced a trap composed of 21 places in 192 ms
[2020-05-21 01:20:47] [INFO ] Deduced a trap composed of 43 places in 179 ms
[2020-05-21 01:20:47] [INFO ] Deduced a trap composed of 65 places in 145 ms
[2020-05-21 01:20:47] [INFO ] Deduced a trap composed of 69 places in 132 ms
[2020-05-21 01:20:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1321 ms
[2020-05-21 01:20:47] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:20:47] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2020-05-21 01:20:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:20:48] [INFO ] [Real]Absence check using state equation in 637 ms returned sat
[2020-05-21 01:20:48] [INFO ] [Real]Added 132 Read/Feed constraints in 22 ms returned sat
[2020-05-21 01:20:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:20:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:20:48] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:20:49] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2020-05-21 01:20:49] [INFO ] [Nat]Added 132 Read/Feed constraints in 36 ms returned sat
[2020-05-21 01:20:49] [INFO ] Deduced a trap composed of 10 places in 188 ms
[2020-05-21 01:20:49] [INFO ] Deduced a trap composed of 10 places in 178 ms
[2020-05-21 01:20:49] [INFO ] Deduced a trap composed of 10 places in 190 ms
[2020-05-21 01:20:50] [INFO ] Deduced a trap composed of 13 places in 213 ms
[2020-05-21 01:20:50] [INFO ] Deduced a trap composed of 81 places in 211 ms
[2020-05-21 01:20:50] [INFO ] Deduced a trap composed of 32 places in 222 ms
[2020-05-21 01:20:50] [INFO ] Deduced a trap composed of 81 places in 172 ms
[2020-05-21 01:20:50] [INFO ] Deduced a trap composed of 82 places in 164 ms
[2020-05-21 01:20:51] [INFO ] Deduced a trap composed of 10 places in 181 ms
[2020-05-21 01:20:51] [INFO ] Deduced a trap composed of 31 places in 165 ms
[2020-05-21 01:20:51] [INFO ] Deduced a trap composed of 50 places in 219 ms
[2020-05-21 01:20:51] [INFO ] Deduced a trap composed of 40 places in 195 ms
[2020-05-21 01:20:51] [INFO ] Deduced a trap composed of 39 places in 145 ms
[2020-05-21 01:20:52] [INFO ] Deduced a trap composed of 31 places in 153 ms
[2020-05-21 01:20:52] [INFO ] Deduced a trap composed of 17 places in 222 ms
[2020-05-21 01:20:52] [INFO ] Deduced a trap composed of 69 places in 243 ms
[2020-05-21 01:20:52] [INFO ] Deduced a trap composed of 50 places in 133 ms
[2020-05-21 01:20:52] [INFO ] Deduced a trap composed of 50 places in 118 ms
[2020-05-21 01:20:53] [INFO ] Deduced a trap composed of 96 places in 119 ms
[2020-05-21 01:20:53] [INFO ] Deduced a trap composed of 50 places in 117 ms
[2020-05-21 01:20:53] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4115 ms
[2020-05-21 01:20:53] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 30 ms.
[2020-05-21 01:20:58] [INFO ] Added : 543 causal constraints over 109 iterations in 5471 ms. Result :sat
[2020-05-21 01:20:58] [INFO ] Deduced a trap composed of 43 places in 187 ms
[2020-05-21 01:20:59] [INFO ] Deduced a trap composed of 43 places in 179 ms
[2020-05-21 01:20:59] [INFO ] Deduced a trap composed of 43 places in 188 ms
[2020-05-21 01:20:59] [INFO ] Deduced a trap composed of 65 places in 170 ms
[2020-05-21 01:20:59] [INFO ] Deduced a trap composed of 65 places in 157 ms
[2020-05-21 01:21:00] [INFO ] Deduced a trap composed of 65 places in 149 ms
[2020-05-21 01:21:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1468 ms
[2020-05-21 01:21:00] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:21:00] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:21:00] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2020-05-21 01:21:00] [INFO ] [Real]Added 132 Read/Feed constraints in 20 ms returned sat
[2020-05-21 01:21:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:21:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:21:00] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:21:01] [INFO ] [Nat]Absence check using state equation in 716 ms returned sat
[2020-05-21 01:21:01] [INFO ] [Nat]Added 132 Read/Feed constraints in 52 ms returned sat
[2020-05-21 01:21:01] [INFO ] Deduced a trap composed of 10 places in 206 ms
[2020-05-21 01:21:02] [INFO ] Deduced a trap composed of 10 places in 230 ms
[2020-05-21 01:21:02] [INFO ] Deduced a trap composed of 10 places in 220 ms
[2020-05-21 01:21:02] [INFO ] Deduced a trap composed of 10 places in 211 ms
[2020-05-21 01:21:02] [INFO ] Deduced a trap composed of 39 places in 182 ms
[2020-05-21 01:21:03] [INFO ] Deduced a trap composed of 54 places in 153 ms
[2020-05-21 01:21:03] [INFO ] Deduced a trap composed of 44 places in 203 ms
[2020-05-21 01:21:03] [INFO ] Deduced a trap composed of 39 places in 244 ms
[2020-05-21 01:21:03] [INFO ] Deduced a trap composed of 40 places in 174 ms
[2020-05-21 01:21:03] [INFO ] Deduced a trap composed of 62 places in 137 ms
[2020-05-21 01:21:04] [INFO ] Deduced a trap composed of 62 places in 147 ms
[2020-05-21 01:21:04] [INFO ] Deduced a trap composed of 61 places in 137 ms
[2020-05-21 01:21:04] [INFO ] Deduced a trap composed of 62 places in 159 ms
[2020-05-21 01:21:04] [INFO ] Deduced a trap composed of 65 places in 105 ms
[2020-05-21 01:21:04] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2926 ms
[2020-05-21 01:21:04] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 50 ms.
[2020-05-21 01:21:10] [INFO ] Added : 589 causal constraints over 118 iterations in 5615 ms. Result :sat
[2020-05-21 01:21:10] [INFO ] Deduced a trap composed of 57 places in 238 ms
[2020-05-21 01:21:10] [INFO ] Deduced a trap composed of 21 places in 236 ms
[2020-05-21 01:21:11] [INFO ] Deduced a trap composed of 87 places in 226 ms
[2020-05-21 01:21:11] [INFO ] Deduced a trap composed of 79 places in 210 ms
[2020-05-21 01:21:11] [INFO ] Deduced a trap composed of 27 places in 189 ms
[2020-05-21 01:21:11] [INFO ] Deduced a trap composed of 30 places in 166 ms
[2020-05-21 01:21:12] [INFO ] Deduced a trap composed of 45 places in 158 ms
[2020-05-21 01:21:12] [INFO ] Deduced a trap composed of 27 places in 163 ms
[2020-05-21 01:21:12] [INFO ] Deduced a trap composed of 43 places in 191 ms
[2020-05-21 01:21:13] [INFO ] Deduced a trap composed of 43 places in 190 ms
[2020-05-21 01:21:13] [INFO ] Deduced a trap composed of 97 places in 195 ms
[2020-05-21 01:21:13] [INFO ] Deduced a trap composed of 70 places in 183 ms
[2020-05-21 01:21:13] [INFO ] Deduced a trap composed of 36 places in 150 ms
[2020-05-21 01:21:14] [INFO ] Deduced a trap composed of 57 places in 195 ms
[2020-05-21 01:21:14] [INFO ] Deduced a trap composed of 80 places in 213 ms
[2020-05-21 01:21:14] [INFO ] Deduced a trap composed of 21 places in 228 ms
[2020-05-21 01:21:15] [INFO ] Deduced a trap composed of 14 places in 229 ms
[2020-05-21 01:21:15] [INFO ] Deduced a trap composed of 36 places in 255 ms
[2020-05-21 01:21:15] [INFO ] Deduced a trap composed of 54 places in 292 ms
[2020-05-21 01:21:16] [INFO ] Deduced a trap composed of 13 places in 272 ms
[2020-05-21 01:21:16] [INFO ] Deduced a trap composed of 80 places in 204 ms
[2020-05-21 01:21:16] [INFO ] Deduced a trap composed of 80 places in 169 ms
[2020-05-21 01:21:17] [INFO ] Deduced a trap composed of 27 places in 176 ms
[2020-05-21 01:21:17] [INFO ] Deduced a trap composed of 42 places in 119 ms
[2020-05-21 01:21:17] [INFO ] Deduced a trap composed of 65 places in 125 ms
[2020-05-21 01:21:17] [INFO ] Deduced a trap composed of 42 places in 147 ms
[2020-05-21 01:21:18] [INFO ] Deduced a trap composed of 112 places in 157 ms
[2020-05-21 01:21:18] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 7806 ms
[2020-05-21 01:21:18] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:21:18] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:21:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:21:18] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2020-05-21 01:21:18] [INFO ] [Real]Added 132 Read/Feed constraints in 20 ms returned sat
[2020-05-21 01:21:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:21:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:21:18] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:21:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:21:19] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2020-05-21 01:21:19] [INFO ] [Nat]Added 132 Read/Feed constraints in 32 ms returned sat
[2020-05-21 01:21:19] [INFO ] Deduced a trap composed of 14 places in 210 ms
[2020-05-21 01:21:20] [INFO ] Deduced a trap composed of 62 places in 202 ms
[2020-05-21 01:21:20] [INFO ] Deduced a trap composed of 40 places in 190 ms
[2020-05-21 01:21:20] [INFO ] Deduced a trap composed of 61 places in 197 ms
[2020-05-21 01:21:20] [INFO ] Deduced a trap composed of 14 places in 156 ms
[2020-05-21 01:21:20] [INFO ] Deduced a trap composed of 21 places in 160 ms
[2020-05-21 01:21:21] [INFO ] Deduced a trap composed of 10 places in 171 ms
[2020-05-21 01:21:21] [INFO ] Deduced a trap composed of 39 places in 157 ms
[2020-05-21 01:21:21] [INFO ] Deduced a trap composed of 40 places in 155 ms
[2020-05-21 01:21:21] [INFO ] Deduced a trap composed of 43 places in 201 ms
[2020-05-21 01:21:21] [INFO ] Deduced a trap composed of 13 places in 181 ms
[2020-05-21 01:21:22] [INFO ] Deduced a trap composed of 83 places in 187 ms
[2020-05-21 01:21:22] [INFO ] Deduced a trap composed of 65 places in 126 ms
[2020-05-21 01:21:22] [INFO ] Deduced a trap composed of 124 places in 144 ms
[2020-05-21 01:21:22] [INFO ] Deduced a trap composed of 62 places in 122 ms
[2020-05-21 01:21:22] [INFO ] Deduced a trap composed of 66 places in 220 ms
[2020-05-21 01:21:23] [INFO ] Deduced a trap composed of 35 places in 235 ms
[2020-05-21 01:21:23] [INFO ] Deduced a trap composed of 38 places in 207 ms
[2020-05-21 01:21:23] [INFO ] Deduced a trap composed of 61 places in 165 ms
[2020-05-21 01:21:23] [INFO ] Deduced a trap composed of 39 places in 173 ms
[2020-05-21 01:21:23] [INFO ] Deduced a trap composed of 97 places in 155 ms
[2020-05-21 01:21:24] [INFO ] Deduced a trap composed of 83 places in 152 ms
[2020-05-21 01:21:24] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4568 ms
[2020-05-21 01:21:24] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 29 ms.
[2020-05-21 01:21:29] [INFO ] Added : 556 causal constraints over 112 iterations in 5409 ms. Result :sat
[2020-05-21 01:21:29] [INFO ] Deduced a trap composed of 10 places in 223 ms
[2020-05-21 01:21:30] [INFO ] Deduced a trap composed of 27 places in 236 ms
[2020-05-21 01:21:30] [INFO ] Deduced a trap composed of 44 places in 221 ms
[2020-05-21 01:21:30] [INFO ] Deduced a trap composed of 43 places in 206 ms
[2020-05-21 01:21:30] [INFO ] Deduced a trap composed of 65 places in 129 ms
[2020-05-21 01:21:31] [INFO ] Deduced a trap composed of 66 places in 144 ms
[2020-05-21 01:21:31] [INFO ] Deduced a trap composed of 35 places in 172 ms
[2020-05-21 01:21:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1957 ms
[2020-05-21 01:21:31] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:21:31] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:21:32] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2020-05-21 01:21:32] [INFO ] [Real]Added 132 Read/Feed constraints in 20 ms returned sat
[2020-05-21 01:21:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:21:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:21:32] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:21:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:21:32] [INFO ] [Nat]Absence check using state equation in 612 ms returned sat
[2020-05-21 01:21:32] [INFO ] [Nat]Added 132 Read/Feed constraints in 29 ms returned sat
[2020-05-21 01:21:33] [INFO ] Deduced a trap composed of 18 places in 233 ms
[2020-05-21 01:21:33] [INFO ] Deduced a trap composed of 36 places in 270 ms
[2020-05-21 01:21:33] [INFO ] Deduced a trap composed of 43 places in 250 ms
[2020-05-21 01:21:34] [INFO ] Deduced a trap composed of 43 places in 248 ms
[2020-05-21 01:21:34] [INFO ] Deduced a trap composed of 36 places in 240 ms
[2020-05-21 01:21:34] [INFO ] Deduced a trap composed of 22 places in 270 ms
[2020-05-21 01:21:34] [INFO ] Deduced a trap composed of 12 places in 205 ms
[2020-05-21 01:21:35] [INFO ] Deduced a trap composed of 58 places in 257 ms
[2020-05-21 01:21:35] [INFO ] Deduced a trap composed of 65 places in 239 ms
[2020-05-21 01:21:35] [INFO ] Deduced a trap composed of 58 places in 252 ms
[2020-05-21 01:21:35] [INFO ] Deduced a trap composed of 58 places in 240 ms
[2020-05-21 01:21:36] [INFO ] Deduced a trap composed of 10 places in 193 ms
[2020-05-21 01:21:36] [INFO ] Deduced a trap composed of 50 places in 262 ms
[2020-05-21 01:21:36] [INFO ] Deduced a trap composed of 10 places in 265 ms
[2020-05-21 01:21:37] [INFO ] Deduced a trap composed of 49 places in 243 ms
[2020-05-21 01:21:37] [INFO ] Deduced a trap composed of 76 places in 158 ms
[2020-05-21 01:21:37] [INFO ] Deduced a trap composed of 76 places in 141 ms
[2020-05-21 01:21:37] [INFO ] Deduced a trap composed of 76 places in 164 ms
[2020-05-21 01:21:37] [INFO ] Deduced a trap composed of 76 places in 170 ms
[2020-05-21 01:21:37] [INFO ] Deduced a trap composed of 32 places in 107 ms
[2020-05-21 01:21:38] [INFO ] Deduced a trap composed of 50 places in 197 ms
[2020-05-21 01:21:38] [INFO ] Deduced a trap composed of 43 places in 178 ms
[2020-05-21 01:21:38] [INFO ] Deduced a trap composed of 54 places in 112 ms
[2020-05-21 01:21:38] [INFO ] Deduced a trap composed of 74 places in 109 ms
[2020-05-21 01:21:38] [INFO ] Deduced a trap composed of 32 places in 146 ms
[2020-05-21 01:21:39] [INFO ] Deduced a trap composed of 58 places in 126 ms
[2020-05-21 01:21:39] [INFO ] Deduced a trap composed of 32 places in 130 ms
[2020-05-21 01:21:39] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6541 ms
[2020-05-21 01:21:39] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 51 ms.
[2020-05-21 01:21:45] [INFO ] Added : 608 causal constraints over 122 iterations in 6488 ms. Result :sat
[2020-05-21 01:21:46] [INFO ] Deduced a trap composed of 66 places in 213 ms
[2020-05-21 01:21:46] [INFO ] Deduced a trap composed of 44 places in 223 ms
[2020-05-21 01:21:46] [INFO ] Deduced a trap composed of 38 places in 231 ms
[2020-05-21 01:21:47] [INFO ] Deduced a trap composed of 38 places in 215 ms
[2020-05-21 01:21:47] [INFO ] Deduced a trap composed of 57 places in 178 ms
[2020-05-21 01:21:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1478 ms
[2020-05-21 01:21:47] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2020-05-21 01:21:47] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2020-05-21 01:21:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:21:48] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2020-05-21 01:21:48] [INFO ] [Real]Added 132 Read/Feed constraints in 23 ms returned sat
[2020-05-21 01:21:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:21:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:21:48] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:21:48] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2020-05-21 01:21:48] [INFO ] [Nat]Added 132 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:21:49] [INFO ] Deduced a trap composed of 10 places in 172 ms
[2020-05-21 01:21:49] [INFO ] Deduced a trap composed of 10 places in 163 ms
[2020-05-21 01:21:49] [INFO ] Deduced a trap composed of 12 places in 157 ms
[2020-05-21 01:21:49] [INFO ] Deduced a trap composed of 10 places in 151 ms
[2020-05-21 01:21:49] [INFO ] Deduced a trap composed of 27 places in 192 ms
[2020-05-21 01:21:50] [INFO ] Deduced a trap composed of 27 places in 176 ms
[2020-05-21 01:21:50] [INFO ] Deduced a trap composed of 27 places in 150 ms
[2020-05-21 01:21:50] [INFO ] Deduced a trap composed of 27 places in 170 ms
[2020-05-21 01:21:50] [INFO ] Deduced a trap composed of 14 places in 181 ms
[2020-05-21 01:21:50] [INFO ] Deduced a trap composed of 57 places in 175 ms
[2020-05-21 01:21:51] [INFO ] Deduced a trap composed of 69 places in 161 ms
[2020-05-21 01:21:51] [INFO ] Deduced a trap composed of 80 places in 161 ms
[2020-05-21 01:21:51] [INFO ] Deduced a trap composed of 42 places in 114 ms
[2020-05-21 01:21:51] [INFO ] Deduced a trap composed of 54 places in 123 ms
[2020-05-21 01:21:51] [INFO ] Deduced a trap composed of 58 places in 95 ms
[2020-05-21 01:21:51] [INFO ] Deduced a trap composed of 65 places in 98 ms
[2020-05-21 01:21:52] [INFO ] Deduced a trap composed of 39 places in 181 ms
[2020-05-21 01:21:52] [INFO ] Deduced a trap composed of 36 places in 175 ms
[2020-05-21 01:21:52] [INFO ] Deduced a trap composed of 85 places in 155 ms
[2020-05-21 01:21:52] [INFO ] Deduced a trap composed of 17 places in 174 ms
[2020-05-21 01:21:52] [INFO ] Deduced a trap composed of 35 places in 182 ms
[2020-05-21 01:21:53] [INFO ] Deduced a trap composed of 42 places in 143 ms
[2020-05-21 01:21:53] [INFO ] Deduced a trap composed of 57 places in 114 ms
[2020-05-21 01:21:53] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4349 ms
[2020-05-21 01:21:53] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 31 ms.
[2020-05-21 01:21:59] [INFO ] Added : 625 causal constraints over 125 iterations in 6150 ms. Result :sat
[2020-05-21 01:21:59] [INFO ] Deduced a trap composed of 38 places in 275 ms
[2020-05-21 01:22:00] [INFO ] Deduced a trap composed of 30 places in 246 ms
[2020-05-21 01:22:00] [INFO ] Deduced a trap composed of 62 places in 234 ms
[2020-05-21 01:22:00] [INFO ] Deduced a trap composed of 43 places in 204 ms
[2020-05-21 01:22:01] [INFO ] Deduced a trap composed of 58 places in 248 ms
[2020-05-21 01:22:01] [INFO ] Deduced a trap composed of 58 places in 220 ms
[2020-05-21 01:22:01] [INFO ] Deduced a trap composed of 69 places in 227 ms
[2020-05-21 01:22:01] [INFO ] Deduced a trap composed of 58 places in 226 ms
[2020-05-21 01:22:02] [INFO ] Deduced a trap composed of 65 places in 233 ms
[2020-05-21 01:22:02] [INFO ] Deduced a trap composed of 69 places in 243 ms
[2020-05-21 01:22:02] [INFO ] Deduced a trap composed of 35 places in 249 ms
[2020-05-21 01:22:03] [INFO ] Deduced a trap composed of 44 places in 246 ms
[2020-05-21 01:22:03] [INFO ] Deduced a trap composed of 35 places in 241 ms
[2020-05-21 01:22:03] [INFO ] Deduced a trap composed of 26 places in 171 ms
[2020-05-21 01:22:04] [INFO ] Deduced a trap composed of 22 places in 199 ms
[2020-05-21 01:22:04] [INFO ] Deduced a trap composed of 17 places in 183 ms
[2020-05-21 01:22:04] [INFO ] Deduced a trap composed of 66 places in 154 ms
[2020-05-21 01:22:04] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5370 ms
[2020-05-21 01:22:04] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2020-05-21 01:22:04] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:22:05] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2020-05-21 01:22:05] [INFO ] [Real]Added 132 Read/Feed constraints in 21 ms returned sat
[2020-05-21 01:22:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:22:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2020-05-21 01:22:05] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:22:06] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2020-05-21 01:22:06] [INFO ] [Nat]Added 132 Read/Feed constraints in 34 ms returned sat
[2020-05-21 01:22:06] [INFO ] Deduced a trap composed of 10 places in 196 ms
[2020-05-21 01:22:06] [INFO ] Deduced a trap composed of 10 places in 170 ms
[2020-05-21 01:22:06] [INFO ] Deduced a trap composed of 10 places in 178 ms
[2020-05-21 01:22:07] [INFO ] Deduced a trap composed of 36 places in 164 ms
[2020-05-21 01:22:07] [INFO ] Deduced a trap composed of 10 places in 177 ms
[2020-05-21 01:22:07] [INFO ] Deduced a trap composed of 21 places in 147 ms
[2020-05-21 01:22:07] [INFO ] Deduced a trap composed of 104 places in 151 ms
[2020-05-21 01:22:07] [INFO ] Deduced a trap composed of 32 places in 145 ms
[2020-05-21 01:22:07] [INFO ] Deduced a trap composed of 32 places in 146 ms
[2020-05-21 01:22:08] [INFO ] Deduced a trap composed of 32 places in 148 ms
[2020-05-21 01:22:08] [INFO ] Deduced a trap composed of 32 places in 160 ms
[2020-05-21 01:22:08] [INFO ] Deduced a trap composed of 85 places in 159 ms
[2020-05-21 01:22:08] [INFO ] Deduced a trap composed of 39 places in 173 ms
[2020-05-21 01:22:08] [INFO ] Deduced a trap composed of 66 places in 113 ms
[2020-05-21 01:22:08] [INFO ] Deduced a trap composed of 50 places in 101 ms
[2020-05-21 01:22:09] [INFO ] Deduced a trap composed of 50 places in 101 ms
[2020-05-21 01:22:09] [INFO ] Deduced a trap composed of 57 places in 156 ms
[2020-05-21 01:22:09] [INFO ] Deduced a trap composed of 35 places in 200 ms
[2020-05-21 01:22:09] [INFO ] Deduced a trap composed of 45 places in 140 ms
[2020-05-21 01:22:09] [INFO ] Deduced a trap composed of 65 places in 68 ms
[2020-05-21 01:22:09] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3659 ms
[2020-05-21 01:22:09] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 37 ms.
[2020-05-21 01:22:15] [INFO ] Added : 570 causal constraints over 114 iterations in 5872 ms. Result :sat
[2020-05-21 01:22:16] [INFO ] Deduced a trap composed of 69 places in 229 ms
[2020-05-21 01:22:16] [INFO ] Deduced a trap composed of 80 places in 221 ms
[2020-05-21 01:22:16] [INFO ] Deduced a trap composed of 69 places in 178 ms
[2020-05-21 01:22:16] [INFO ] Deduced a trap composed of 70 places in 164 ms
[2020-05-21 01:22:17] [INFO ] Deduced a trap composed of 69 places in 163 ms
[2020-05-21 01:22:17] [INFO ] Deduced a trap composed of 70 places in 157 ms
[2020-05-21 01:22:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1661 ms
[2020-05-21 01:22:17] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:22:17] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:22:18] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2020-05-21 01:22:18] [INFO ] [Real]Added 132 Read/Feed constraints in 17 ms returned sat
[2020-05-21 01:22:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:22:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2020-05-21 01:22:18] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:22:18] [INFO ] [Nat]Absence check using state equation in 674 ms returned sat
[2020-05-21 01:22:18] [INFO ] [Nat]Added 132 Read/Feed constraints in 34 ms returned sat
[2020-05-21 01:22:19] [INFO ] Deduced a trap composed of 10 places in 234 ms
[2020-05-21 01:22:19] [INFO ] Deduced a trap composed of 10 places in 264 ms
[2020-05-21 01:22:19] [INFO ] Deduced a trap composed of 32 places in 268 ms
[2020-05-21 01:22:20] [INFO ] Deduced a trap composed of 32 places in 267 ms
[2020-05-21 01:22:20] [INFO ] Deduced a trap composed of 32 places in 218 ms
[2020-05-21 01:22:20] [INFO ] Deduced a trap composed of 32 places in 279 ms
[2020-05-21 01:22:20] [INFO ] Deduced a trap composed of 10 places in 212 ms
[2020-05-21 01:22:21] [INFO ] Deduced a trap composed of 54 places in 206 ms
[2020-05-21 01:22:21] [INFO ] Deduced a trap composed of 54 places in 227 ms
[2020-05-21 01:22:21] [INFO ] Deduced a trap composed of 54 places in 264 ms
[2020-05-21 01:22:21] [INFO ] Deduced a trap composed of 37 places in 280 ms
[2020-05-21 01:22:22] [INFO ] Deduced a trap composed of 10 places in 232 ms
[2020-05-21 01:22:22] [INFO ] Deduced a trap composed of 62 places in 228 ms
[2020-05-21 01:22:22] [INFO ] Deduced a trap composed of 13 places in 318 ms
[2020-05-21 01:22:23] [INFO ] Deduced a trap composed of 55 places in 260 ms
[2020-05-21 01:22:23] [INFO ] Deduced a trap composed of 35 places in 252 ms
[2020-05-21 01:22:23] [INFO ] Deduced a trap composed of 69 places in 164 ms
[2020-05-21 01:22:23] [INFO ] Deduced a trap composed of 76 places in 231 ms
[2020-05-21 01:22:24] [INFO ] Deduced a trap composed of 54 places in 172 ms
[2020-05-21 01:22:24] [INFO ] Deduced a trap composed of 83 places in 125 ms
[2020-05-21 01:22:24] [INFO ] Deduced a trap composed of 84 places in 154 ms
[2020-05-21 01:22:24] [INFO ] Deduced a trap composed of 84 places in 173 ms
[2020-05-21 01:22:24] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5771 ms
[2020-05-21 01:22:24] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 36 ms.
[2020-05-21 01:22:32] [INFO ] Added : 625 causal constraints over 125 iterations in 7316 ms. Result :sat
[2020-05-21 01:22:32] [INFO ] Deduced a trap composed of 57 places in 164 ms
[2020-05-21 01:22:32] [INFO ] Deduced a trap composed of 64 places in 157 ms
[2020-05-21 01:22:32] [INFO ] Deduced a trap composed of 58 places in 165 ms
[2020-05-21 01:22:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 902 ms
[2020-05-21 01:22:33] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:22:33] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:22:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:22:33] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2020-05-21 01:22:33] [INFO ] [Real]Added 132 Read/Feed constraints in 18 ms returned sat
[2020-05-21 01:22:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:22:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2020-05-21 01:22:33] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:22:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:22:34] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2020-05-21 01:22:34] [INFO ] [Nat]Added 132 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:22:34] [INFO ] Deduced a trap composed of 12 places in 188 ms
[2020-05-21 01:22:34] [INFO ] Deduced a trap composed of 42 places in 213 ms
[2020-05-21 01:22:35] [INFO ] Deduced a trap composed of 12 places in 214 ms
[2020-05-21 01:22:35] [INFO ] Deduced a trap composed of 10 places in 217 ms
[2020-05-21 01:22:35] [INFO ] Deduced a trap composed of 10 places in 204 ms
[2020-05-21 01:22:35] [INFO ] Deduced a trap composed of 36 places in 146 ms
[2020-05-21 01:22:36] [INFO ] Deduced a trap composed of 58 places in 143 ms
[2020-05-21 01:22:36] [INFO ] Deduced a trap composed of 43 places in 194 ms
[2020-05-21 01:22:36] [INFO ] Deduced a trap composed of 43 places in 170 ms
[2020-05-21 01:22:36] [INFO ] Deduced a trap composed of 61 places in 192 ms
[2020-05-21 01:22:36] [INFO ] Deduced a trap composed of 40 places in 179 ms
[2020-05-21 01:22:37] [INFO ] Deduced a trap composed of 62 places in 172 ms
[2020-05-21 01:22:37] [INFO ] Deduced a trap composed of 13 places in 186 ms
[2020-05-21 01:22:37] [INFO ] Deduced a trap composed of 42 places in 153 ms
[2020-05-21 01:22:37] [INFO ] Deduced a trap composed of 36 places in 139 ms
[2020-05-21 01:22:37] [INFO ] Deduced a trap composed of 62 places in 138 ms
[2020-05-21 01:22:38] [INFO ] Deduced a trap composed of 35 places in 187 ms
[2020-05-21 01:22:38] [INFO ] Deduced a trap composed of 58 places in 155 ms
[2020-05-21 01:22:38] [INFO ] Deduced a trap composed of 61 places in 116 ms
[2020-05-21 01:22:38] [INFO ] Deduced a trap composed of 21 places in 250 ms
[2020-05-21 01:22:39] [INFO ] Deduced a trap composed of 33 places in 238 ms
[2020-05-21 01:22:39] [INFO ] Deduced a trap composed of 18 places in 258 ms
[2020-05-21 01:22:39] [INFO ] Deduced a trap composed of 39 places in 223 ms
[2020-05-21 01:22:39] [INFO ] Deduced a trap composed of 41 places in 240 ms
[2020-05-21 01:22:40] [INFO ] Deduced a trap composed of 22 places in 218 ms
[2020-05-21 01:22:40] [INFO ] Deduced a trap composed of 39 places in 224 ms
[2020-05-21 01:22:40] [INFO ] Deduced a trap composed of 62 places in 198 ms
[2020-05-21 01:22:40] [INFO ] Deduced a trap composed of 83 places in 219 ms
[2020-05-21 01:22:41] [INFO ] Deduced a trap composed of 21 places in 167 ms
[2020-05-21 01:22:41] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6551 ms
[2020-05-21 01:22:41] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 40 ms.
[2020-05-21 01:22:46] [INFO ] Added : 485 causal constraints over 97 iterations in 5204 ms. Result :sat
[2020-05-21 01:22:46] [INFO ] Deduced a trap composed of 88 places in 185 ms
[2020-05-21 01:22:46] [INFO ] Deduced a trap composed of 65 places in 105 ms
[2020-05-21 01:22:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 430 ms
[2020-05-21 01:22:46] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2020-05-21 01:22:46] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:22:47] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2020-05-21 01:22:47] [INFO ] [Real]Added 132 Read/Feed constraints in 20 ms returned sat
[2020-05-21 01:22:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:22:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:22:47] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:22:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:22:48] [INFO ] [Nat]Absence check using state equation in 695 ms returned sat
[2020-05-21 01:22:48] [INFO ] [Nat]Added 132 Read/Feed constraints in 43 ms returned sat
[2020-05-21 01:22:48] [INFO ] Deduced a trap composed of 25 places in 173 ms
[2020-05-21 01:22:48] [INFO ] Deduced a trap composed of 25 places in 216 ms
[2020-05-21 01:22:48] [INFO ] Deduced a trap composed of 27 places in 159 ms
[2020-05-21 01:22:49] [INFO ] Deduced a trap composed of 31 places in 160 ms
[2020-05-21 01:22:49] [INFO ] Deduced a trap composed of 10 places in 174 ms
[2020-05-21 01:22:49] [INFO ] Deduced a trap composed of 10 places in 170 ms
[2020-05-21 01:22:49] [INFO ] Deduced a trap composed of 10 places in 183 ms
[2020-05-21 01:22:49] [INFO ] Deduced a trap composed of 31 places in 154 ms
[2020-05-21 01:22:50] [INFO ] Deduced a trap composed of 27 places in 161 ms
[2020-05-21 01:22:50] [INFO ] Deduced a trap composed of 27 places in 159 ms
[2020-05-21 01:22:50] [INFO ] Deduced a trap composed of 10 places in 188 ms
[2020-05-21 01:22:50] [INFO ] Deduced a trap composed of 32 places in 131 ms
[2020-05-21 01:22:50] [INFO ] Deduced a trap composed of 40 places in 143 ms
[2020-05-21 01:22:50] [INFO ] Deduced a trap composed of 62 places in 183 ms
[2020-05-21 01:22:51] [INFO ] Deduced a trap composed of 39 places in 189 ms
[2020-05-21 01:22:51] [INFO ] Deduced a trap composed of 58 places in 162 ms
[2020-05-21 01:22:51] [INFO ] Deduced a trap composed of 61 places in 133 ms
[2020-05-21 01:22:51] [INFO ] Deduced a trap composed of 62 places in 118 ms
[2020-05-21 01:22:51] [INFO ] Deduced a trap composed of 45 places in 99 ms
[2020-05-21 01:22:52] [INFO ] Deduced a trap composed of 57 places in 188 ms
[2020-05-21 01:22:52] [INFO ] Deduced a trap composed of 54 places in 203 ms
[2020-05-21 01:22:52] [INFO ] Deduced a trap composed of 54 places in 159 ms
[2020-05-21 01:22:52] [INFO ] Deduced a trap composed of 83 places in 176 ms
[2020-05-21 01:22:52] [INFO ] Deduced a trap composed of 21 places in 153 ms
[2020-05-21 01:22:52] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4672 ms
[2020-05-21 01:22:52] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 41 ms.
[2020-05-21 01:22:58] [INFO ] Added : 554 causal constraints over 111 iterations in 5265 ms. Result :sat
[2020-05-21 01:22:58] [INFO ] Deduced a trap composed of 13 places in 257 ms
[2020-05-21 01:22:58] [INFO ] Deduced a trap composed of 69 places in 198 ms
[2020-05-21 01:22:59] [INFO ] Deduced a trap composed of 127 places in 213 ms
[2020-05-21 01:22:59] [INFO ] Deduced a trap composed of 76 places in 198 ms
[2020-05-21 01:22:59] [INFO ] Deduced a trap composed of 54 places in 212 ms
[2020-05-21 01:23:00] [INFO ] Deduced a trap composed of 36 places in 181 ms
[2020-05-21 01:23:00] [INFO ] Deduced a trap composed of 36 places in 172 ms
[2020-05-21 01:23:00] [INFO ] Deduced a trap composed of 32 places in 170 ms
[2020-05-21 01:23:00] [INFO ] Deduced a trap composed of 35 places in 220 ms
[2020-05-21 01:23:01] [INFO ] Deduced a trap composed of 68 places in 147 ms
[2020-05-21 01:23:01] [INFO ] Deduced a trap composed of 42 places in 157 ms
[2020-05-21 01:23:01] [INFO ] Deduced a trap composed of 60 places in 152 ms
[2020-05-21 01:23:01] [INFO ] Deduced a trap composed of 64 places in 172 ms
[2020-05-21 01:23:01] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3719 ms
[2020-05-21 01:23:02] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:23:02] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2020-05-21 01:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:23:02] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2020-05-21 01:23:02] [INFO ] [Real]Added 132 Read/Feed constraints in 26 ms returned sat
[2020-05-21 01:23:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:23:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:23:02] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:23:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:23:03] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2020-05-21 01:23:03] [INFO ] [Nat]Added 132 Read/Feed constraints in 32 ms returned sat
[2020-05-21 01:23:03] [INFO ] Deduced a trap composed of 25 places in 188 ms
[2020-05-21 01:23:03] [INFO ] Deduced a trap composed of 61 places in 183 ms
[2020-05-21 01:23:04] [INFO ] Deduced a trap composed of 37 places in 175 ms
[2020-05-21 01:23:04] [INFO ] Deduced a trap composed of 14 places in 181 ms
[2020-05-21 01:23:04] [INFO ] Deduced a trap composed of 12 places in 173 ms
[2020-05-21 01:23:04] [INFO ] Deduced a trap composed of 62 places in 203 ms
[2020-05-21 01:23:05] [INFO ] Deduced a trap composed of 43 places in 202 ms
[2020-05-21 01:23:05] [INFO ] Deduced a trap composed of 40 places in 213 ms
[2020-05-21 01:23:05] [INFO ] Deduced a trap composed of 44 places in 172 ms
[2020-05-21 01:23:05] [INFO ] Deduced a trap composed of 32 places in 183 ms
[2020-05-21 01:23:05] [INFO ] Deduced a trap composed of 12 places in 226 ms
[2020-05-21 01:23:06] [INFO ] Deduced a trap composed of 42 places in 227 ms
[2020-05-21 01:23:06] [INFO ] Deduced a trap composed of 10 places in 185 ms
[2020-05-21 01:23:06] [INFO ] Deduced a trap composed of 13 places in 184 ms
[2020-05-21 01:23:06] [INFO ] Deduced a trap composed of 43 places in 111 ms
[2020-05-21 01:23:06] [INFO ] Deduced a trap composed of 66 places in 105 ms
[2020-05-21 01:23:07] [INFO ] Deduced a trap composed of 58 places in 125 ms
[2020-05-21 01:23:07] [INFO ] Deduced a trap composed of 109 places in 105 ms
[2020-05-21 01:23:07] [INFO ] Deduced a trap composed of 109 places in 106 ms
[2020-05-21 01:23:07] [INFO ] Deduced a trap composed of 39 places in 149 ms
[2020-05-21 01:23:07] [INFO ] Deduced a trap composed of 57 places in 146 ms
[2020-05-21 01:23:07] [INFO ] Deduced a trap composed of 111 places in 94 ms
[2020-05-21 01:23:07] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4453 ms
[2020-05-21 01:23:08] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 31 ms.
[2020-05-21 01:23:13] [INFO ] Added : 575 causal constraints over 115 iterations in 5770 ms. Result :sat
[2020-05-21 01:23:13] [INFO ] Deduced a trap composed of 23 places in 228 ms
[2020-05-21 01:23:14] [INFO ] Deduced a trap composed of 65 places in 215 ms
[2020-05-21 01:23:14] [INFO ] Deduced a trap composed of 47 places in 233 ms
[2020-05-21 01:23:15] [INFO ] Deduced a trap composed of 20 places in 263 ms
[2020-05-21 01:23:15] [INFO ] Deduced a trap composed of 43 places in 225 ms
[2020-05-21 01:23:15] [INFO ] Deduced a trap composed of 21 places in 233 ms
[2020-05-21 01:23:15] [INFO ] Deduced a trap composed of 65 places in 166 ms
[2020-05-21 01:23:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2353 ms
[2020-05-21 01:23:16] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:23:16] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:23:16] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2020-05-21 01:23:16] [INFO ] [Real]Added 132 Read/Feed constraints in 36 ms returned sat
[2020-05-21 01:23:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:23:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:23:16] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:23:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:23:17] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2020-05-21 01:23:17] [INFO ] [Nat]Added 132 Read/Feed constraints in 32 ms returned sat
[2020-05-21 01:23:17] [INFO ] Deduced a trap composed of 27 places in 182 ms
[2020-05-21 01:23:18] [INFO ] Deduced a trap composed of 21 places in 231 ms
[2020-05-21 01:23:18] [INFO ] Deduced a trap composed of 10 places in 163 ms
[2020-05-21 01:23:18] [INFO ] Deduced a trap composed of 10 places in 177 ms
[2020-05-21 01:23:18] [INFO ] Deduced a trap composed of 10 places in 174 ms
[2020-05-21 01:23:18] [INFO ] Deduced a trap composed of 54 places in 169 ms
[2020-05-21 01:23:19] [INFO ] Deduced a trap composed of 46 places in 141 ms
[2020-05-21 01:23:19] [INFO ] Deduced a trap composed of 62 places in 151 ms
[2020-05-21 01:23:19] [INFO ] Deduced a trap composed of 56 places in 163 ms
[2020-05-21 01:23:19] [INFO ] Deduced a trap composed of 42 places in 176 ms
[2020-05-21 01:23:19] [INFO ] Deduced a trap composed of 40 places in 175 ms
[2020-05-21 01:23:20] [INFO ] Deduced a trap composed of 32 places in 176 ms
[2020-05-21 01:23:20] [INFO ] Deduced a trap composed of 54 places in 180 ms
[2020-05-21 01:23:20] [INFO ] Deduced a trap composed of 27 places in 160 ms
[2020-05-21 01:23:20] [INFO ] Deduced a trap composed of 54 places in 119 ms
[2020-05-21 01:23:20] [INFO ] Deduced a trap composed of 54 places in 141 ms
[2020-05-21 01:23:21] [INFO ] Deduced a trap composed of 32 places in 215 ms
[2020-05-21 01:23:21] [INFO ] Deduced a trap composed of 32 places in 172 ms
[2020-05-21 01:23:21] [INFO ] Deduced a trap composed of 76 places in 167 ms
[2020-05-21 01:23:21] [INFO ] Deduced a trap composed of 144 places in 161 ms
[2020-05-21 01:23:21] [INFO ] Deduced a trap composed of 144 places in 150 ms
[2020-05-21 01:23:22] [INFO ] Deduced a trap composed of 76 places in 128 ms
[2020-05-21 01:23:22] [INFO ] Deduced a trap composed of 27 places in 145 ms
[2020-05-21 01:23:22] [INFO ] Deduced a trap composed of 114 places in 212 ms
[2020-05-21 01:23:22] [INFO ] Deduced a trap composed of 44 places in 232 ms
[2020-05-21 01:23:23] [INFO ] Deduced a trap composed of 36 places in 213 ms
[2020-05-21 01:23:23] [INFO ] Deduced a trap composed of 91 places in 184 ms
[2020-05-21 01:23:23] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5736 ms
[2020-05-21 01:23:23] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 47 ms.
[2020-05-21 01:23:30] [INFO ] Added : 622 causal constraints over 125 iterations in 6938 ms. Result :sat
[2020-05-21 01:23:30] [INFO ] Deduced a trap composed of 57 places in 259 ms
[2020-05-21 01:23:30] [INFO ] Deduced a trap composed of 65 places in 244 ms
[2020-05-21 01:23:31] [INFO ] Deduced a trap composed of 72 places in 246 ms
[2020-05-21 01:23:31] [INFO ] Deduced a trap composed of 70 places in 251 ms
[2020-05-21 01:23:31] [INFO ] Deduced a trap composed of 54 places in 272 ms
[2020-05-21 01:23:32] [INFO ] Deduced a trap composed of 57 places in 260 ms
[2020-05-21 01:23:32] [INFO ] Deduced a trap composed of 51 places in 225 ms
[2020-05-21 01:23:32] [INFO ] Deduced a trap composed of 13 places in 271 ms
[2020-05-21 01:23:33] [INFO ] Deduced a trap composed of 58 places in 167 ms
[2020-05-21 01:23:33] [INFO ] Deduced a trap composed of 58 places in 209 ms
[2020-05-21 01:23:33] [INFO ] Deduced a trap composed of 58 places in 181 ms
[2020-05-21 01:23:34] [INFO ] Deduced a trap composed of 14 places in 264 ms
[2020-05-21 01:23:34] [INFO ] Deduced a trap composed of 14 places in 273 ms
[2020-05-21 01:23:34] [INFO ] Deduced a trap composed of 43 places in 251 ms
[2020-05-21 01:23:35] [INFO ] Deduced a trap composed of 66 places in 271 ms
[2020-05-21 01:23:35] [INFO ] Deduced a trap composed of 79 places in 131 ms
[2020-05-21 01:23:35] [INFO ] Deduced a trap composed of 80 places in 166 ms
[2020-05-21 01:23:35] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5545 ms
[2020-05-21 01:23:35] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:23:35] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2020-05-21 01:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:23:36] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2020-05-21 01:23:36] [INFO ] [Real]Added 132 Read/Feed constraints in 24 ms returned sat
[2020-05-21 01:23:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:23:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:23:36] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:23:37] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2020-05-21 01:23:37] [INFO ] [Nat]Added 132 Read/Feed constraints in 34 ms returned sat
[2020-05-21 01:23:37] [INFO ] Deduced a trap composed of 14 places in 213 ms
[2020-05-21 01:23:37] [INFO ] Deduced a trap composed of 14 places in 174 ms
[2020-05-21 01:23:38] [INFO ] Deduced a trap composed of 66 places in 156 ms
[2020-05-21 01:23:38] [INFO ] Deduced a trap composed of 43 places in 190 ms
[2020-05-21 01:23:38] [INFO ] Deduced a trap composed of 43 places in 188 ms
[2020-05-21 01:23:38] [INFO ] Deduced a trap composed of 51 places in 199 ms
[2020-05-21 01:23:39] [INFO ] Deduced a trap composed of 40 places in 198 ms
[2020-05-21 01:23:39] [INFO ] Deduced a trap composed of 61 places in 146 ms
[2020-05-21 01:23:39] [INFO ] Deduced a trap composed of 62 places in 148 ms
[2020-05-21 01:23:39] [INFO ] Deduced a trap composed of 85 places in 151 ms
[2020-05-21 01:23:39] [INFO ] Deduced a trap composed of 83 places in 234 ms
[2020-05-21 01:23:39] [INFO ] Deduced a trap composed of 61 places in 96 ms
[2020-05-21 01:23:40] [INFO ] Deduced a trap composed of 21 places in 146 ms
[2020-05-21 01:23:40] [INFO ] Deduced a trap composed of 10 places in 135 ms
[2020-05-21 01:23:40] [INFO ] Deduced a trap composed of 10 places in 124 ms
[2020-05-21 01:23:40] [INFO ] Deduced a trap composed of 39 places in 152 ms
[2020-05-21 01:23:40] [INFO ] Deduced a trap composed of 10 places in 136 ms
[2020-05-21 01:23:40] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3412 ms
[2020-05-21 01:23:40] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 39 ms.
[2020-05-21 01:23:45] [INFO ] Added : 527 causal constraints over 106 iterations in 5110 ms. Result :sat
[2020-05-21 01:23:46] [INFO ] Deduced a trap composed of 14 places in 267 ms
[2020-05-21 01:23:46] [INFO ] Deduced a trap composed of 17 places in 203 ms
[2020-05-21 01:23:46] [INFO ] Deduced a trap composed of 63 places in 177 ms
[2020-05-21 01:23:47] [INFO ] Deduced a trap composed of 47 places in 155 ms
[2020-05-21 01:23:47] [INFO ] Deduced a trap composed of 69 places in 198 ms
[2020-05-21 01:23:47] [INFO ] Deduced a trap composed of 129 places in 175 ms
[2020-05-21 01:23:47] [INFO ] Deduced a trap composed of 62 places in 108 ms
[2020-05-21 01:23:47] [INFO ] Deduced a trap composed of 21 places in 84 ms
[2020-05-21 01:23:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2046 ms
[2020-05-21 01:23:48] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:23:48] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:23:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:23:48] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2020-05-21 01:23:48] [INFO ] [Real]Added 132 Read/Feed constraints in 24 ms returned sat
[2020-05-21 01:23:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:23:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:23:48] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:23:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:23:49] [INFO ] [Nat]Absence check using state equation in 718 ms returned sat
[2020-05-21 01:23:49] [INFO ] [Nat]Added 132 Read/Feed constraints in 35 ms returned sat
[2020-05-21 01:23:49] [INFO ] Deduced a trap composed of 10 places in 207 ms
[2020-05-21 01:23:50] [INFO ] Deduced a trap composed of 10 places in 212 ms
[2020-05-21 01:23:50] [INFO ] Deduced a trap composed of 10 places in 210 ms
[2020-05-21 01:23:50] [INFO ] Deduced a trap composed of 10 places in 217 ms
[2020-05-21 01:23:50] [INFO ] Deduced a trap composed of 36 places in 150 ms
[2020-05-21 01:23:50] [INFO ] Deduced a trap composed of 43 places in 137 ms
[2020-05-21 01:23:51] [INFO ] Deduced a trap composed of 44 places in 175 ms
[2020-05-21 01:23:51] [INFO ] Deduced a trap composed of 62 places in 193 ms
[2020-05-21 01:23:51] [INFO ] Deduced a trap composed of 60 places in 141 ms
[2020-05-21 01:23:51] [INFO ] Deduced a trap composed of 13 places in 174 ms
[2020-05-21 01:23:51] [INFO ] Deduced a trap composed of 40 places in 146 ms
[2020-05-21 01:23:52] [INFO ] Deduced a trap composed of 61 places in 102 ms
[2020-05-21 01:23:52] [INFO ] Deduced a trap composed of 65 places in 133 ms
[2020-05-21 01:23:52] [INFO ] Deduced a trap composed of 62 places in 109 ms
[2020-05-21 01:23:52] [INFO ] Deduced a trap composed of 69 places in 162 ms
[2020-05-21 01:23:52] [INFO ] Deduced a trap composed of 39 places in 130 ms
[2020-05-21 01:23:52] [INFO ] Deduced a trap composed of 89 places in 209 ms
[2020-05-21 01:23:53] [INFO ] Deduced a trap composed of 60 places in 143 ms
[2020-05-21 01:23:53] [INFO ] Deduced a trap composed of 62 places in 93 ms
[2020-05-21 01:23:53] [INFO ] Deduced a trap composed of 62 places in 83 ms
[2020-05-21 01:23:53] [INFO ] Deduced a trap composed of 61 places in 116 ms
[2020-05-21 01:23:53] [INFO ] Deduced a trap composed of 27 places in 126 ms
[2020-05-21 01:23:53] [INFO ] Deduced a trap composed of 36 places in 97 ms
[2020-05-21 01:23:53] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4207 ms
[2020-05-21 01:23:53] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 27 ms.
[2020-05-21 01:23:59] [INFO ] Added : 569 causal constraints over 114 iterations in 6073 ms. Result :sat
[2020-05-21 01:24:00] [INFO ] Deduced a trap composed of 96 places in 160 ms
[2020-05-21 01:24:00] [INFO ] Deduced a trap composed of 70 places in 139 ms
[2020-05-21 01:24:00] [INFO ] Deduced a trap composed of 104 places in 139 ms
[2020-05-21 01:24:00] [INFO ] Deduced a trap composed of 112 places in 197 ms
[2020-05-21 01:24:01] [INFO ] Deduced a trap composed of 69 places in 164 ms
[2020-05-21 01:24:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1204 ms
[2020-05-21 01:24:01] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:24:01] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:24:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:01] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2020-05-21 01:24:01] [INFO ] [Real]Added 132 Read/Feed constraints in 21 ms returned sat
[2020-05-21 01:24:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:24:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:24:01] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:24:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:02] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2020-05-21 01:24:02] [INFO ] [Nat]Added 132 Read/Feed constraints in 38 ms returned sat
[2020-05-21 01:24:02] [INFO ] Deduced a trap composed of 10 places in 279 ms
[2020-05-21 01:24:03] [INFO ] Deduced a trap composed of 10 places in 229 ms
[2020-05-21 01:24:03] [INFO ] Deduced a trap composed of 39 places in 260 ms
[2020-05-21 01:24:03] [INFO ] Deduced a trap composed of 62 places in 239 ms
[2020-05-21 01:24:03] [INFO ] Deduced a trap composed of 36 places in 213 ms
[2020-05-21 01:24:04] [INFO ] Deduced a trap composed of 40 places in 226 ms
[2020-05-21 01:24:04] [INFO ] Deduced a trap composed of 14 places in 258 ms
[2020-05-21 01:24:04] [INFO ] Deduced a trap composed of 10 places in 247 ms
[2020-05-21 01:24:05] [INFO ] Deduced a trap composed of 40 places in 218 ms
[2020-05-21 01:24:05] [INFO ] Deduced a trap composed of 31 places in 210 ms
[2020-05-21 01:24:05] [INFO ] Deduced a trap composed of 76 places in 194 ms
[2020-05-21 01:24:05] [INFO ] Deduced a trap composed of 31 places in 189 ms
[2020-05-21 01:24:05] [INFO ] Deduced a trap composed of 54 places in 105 ms
[2020-05-21 01:24:06] [INFO ] Deduced a trap composed of 54 places in 123 ms
[2020-05-21 01:24:06] [INFO ] Deduced a trap composed of 62 places in 97 ms
[2020-05-21 01:24:06] [INFO ] Deduced a trap composed of 27 places in 231 ms
[2020-05-21 01:24:06] [INFO ] Deduced a trap composed of 27 places in 235 ms
[2020-05-21 01:24:06] [INFO ] Deduced a trap composed of 76 places in 236 ms
[2020-05-21 01:24:07] [INFO ] Deduced a trap composed of 76 places in 204 ms
[2020-05-21 01:24:07] [INFO ] Deduced a trap composed of 61 places in 194 ms
[2020-05-21 01:24:07] [INFO ] Deduced a trap composed of 76 places in 174 ms
[2020-05-21 01:24:07] [INFO ] Deduced a trap composed of 32 places in 149 ms
[2020-05-21 01:24:08] [INFO ] Deduced a trap composed of 66 places in 161 ms
[2020-05-21 01:24:08] [INFO ] Deduced a trap composed of 32 places in 177 ms
[2020-05-21 01:24:08] [INFO ] Deduced a trap composed of 25 places in 144 ms
[2020-05-21 01:24:08] [INFO ] Deduced a trap composed of 32 places in 140 ms
[2020-05-21 01:24:08] [INFO ] Deduced a trap composed of 12 places in 157 ms
[2020-05-21 01:24:08] [INFO ] Deduced a trap composed of 32 places in 184 ms
[2020-05-21 01:24:09] [INFO ] Deduced a trap composed of 54 places in 108 ms
[2020-05-21 01:24:09] [INFO ] Deduced a trap composed of 54 places in 123 ms
[2020-05-21 01:24:09] [INFO ] Deduced a trap composed of 91 places in 195 ms
[2020-05-21 01:24:09] [INFO ] Deduced a trap composed of 47 places in 54 ms
[2020-05-21 01:24:09] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 7092 ms
[2020-05-21 01:24:09] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 26 ms.
[2020-05-21 01:24:15] [INFO ] Added : 625 causal constraints over 125 iterations in 6023 ms. Result :sat
[2020-05-21 01:24:15] [INFO ] Deduced a trap composed of 13 places in 193 ms
[2020-05-21 01:24:16] [INFO ] Deduced a trap composed of 47 places in 159 ms
[2020-05-21 01:24:16] [INFO ] Deduced a trap composed of 92 places in 89 ms
[2020-05-21 01:24:16] [INFO ] Deduced a trap composed of 91 places in 84 ms
[2020-05-21 01:24:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 953 ms
[2020-05-21 01:24:16] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:24:16] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:17] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2020-05-21 01:24:17] [INFO ] [Real]Added 132 Read/Feed constraints in 13 ms returned sat
[2020-05-21 01:24:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:24:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:24:17] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:24:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:18] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2020-05-21 01:24:18] [INFO ] [Nat]Added 132 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:24:18] [INFO ] Deduced a trap composed of 19 places in 214 ms
[2020-05-21 01:24:18] [INFO ] Deduced a trap composed of 10 places in 215 ms
[2020-05-21 01:24:18] [INFO ] Deduced a trap composed of 18 places in 205 ms
[2020-05-21 01:24:19] [INFO ] Deduced a trap composed of 10 places in 232 ms
[2020-05-21 01:24:19] [INFO ] Deduced a trap composed of 54 places in 229 ms
[2020-05-21 01:24:19] [INFO ] Deduced a trap composed of 54 places in 236 ms
[2020-05-21 01:24:19] [INFO ] Deduced a trap composed of 54 places in 193 ms
[2020-05-21 01:24:20] [INFO ] Deduced a trap composed of 54 places in 242 ms
[2020-05-21 01:24:20] [INFO ] Deduced a trap composed of 16 places in 187 ms
[2020-05-21 01:24:20] [INFO ] Deduced a trap composed of 32 places in 180 ms
[2020-05-21 01:24:20] [INFO ] Deduced a trap composed of 10 places in 199 ms
[2020-05-21 01:24:20] [INFO ] Deduced a trap composed of 32 places in 164 ms
[2020-05-21 01:24:21] [INFO ] Deduced a trap composed of 32 places in 201 ms
[2020-05-21 01:24:21] [INFO ] Deduced a trap composed of 54 places in 176 ms
[2020-05-21 01:24:21] [INFO ] Deduced a trap composed of 32 places in 173 ms
[2020-05-21 01:24:21] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3554 ms
[2020-05-21 01:24:21] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 29 ms.
[2020-05-21 01:24:26] [INFO ] Added : 489 causal constraints over 98 iterations in 4586 ms. Result :sat
[2020-05-21 01:24:26] [INFO ] Deduced a trap composed of 17 places in 248 ms
[2020-05-21 01:24:26] [INFO ] Deduced a trap composed of 39 places in 178 ms
[2020-05-21 01:24:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 599 ms
[2020-05-21 01:24:26] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2020-05-21 01:24:26] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:24:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:27] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2020-05-21 01:24:27] [INFO ] [Real]Added 132 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:24:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:24:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:24:27] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:24:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:28] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2020-05-21 01:24:28] [INFO ] [Nat]Added 132 Read/Feed constraints in 37 ms returned sat
[2020-05-21 01:24:28] [INFO ] Deduced a trap composed of 10 places in 205 ms
[2020-05-21 01:24:28] [INFO ] Deduced a trap composed of 12 places in 186 ms
[2020-05-21 01:24:28] [INFO ] Deduced a trap composed of 10 places in 174 ms
[2020-05-21 01:24:29] [INFO ] Deduced a trap composed of 10 places in 193 ms
[2020-05-21 01:24:29] [INFO ] Deduced a trap composed of 51 places in 137 ms
[2020-05-21 01:24:29] [INFO ] Deduced a trap composed of 54 places in 131 ms
[2020-05-21 01:24:29] [INFO ] Deduced a trap composed of 32 places in 145 ms
[2020-05-21 01:24:29] [INFO ] Deduced a trap composed of 32 places in 165 ms
[2020-05-21 01:24:29] [INFO ] Deduced a trap composed of 10 places in 192 ms
[2020-05-21 01:24:30] [INFO ] Deduced a trap composed of 65 places in 194 ms
[2020-05-21 01:24:30] [INFO ] Deduced a trap composed of 27 places in 218 ms
[2020-05-21 01:24:30] [INFO ] Deduced a trap composed of 43 places in 151 ms
[2020-05-21 01:24:30] [INFO ] Deduced a trap composed of 76 places in 93 ms
[2020-05-21 01:24:30] [INFO ] Deduced a trap composed of 76 places in 90 ms
[2020-05-21 01:24:31] [INFO ] Deduced a trap composed of 76 places in 82 ms
[2020-05-21 01:24:31] [INFO ] Deduced a trap composed of 76 places in 100 ms
[2020-05-21 01:24:31] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3061 ms
[2020-05-21 01:24:31] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 30 ms.
[2020-05-21 01:24:36] [INFO ] Added : 566 causal constraints over 114 iterations in 5448 ms. Result :sat
[2020-05-21 01:24:36] [INFO ] Deduced a trap composed of 13 places in 130 ms
[2020-05-21 01:24:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2020-05-21 01:24:37] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:24:37] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:37] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2020-05-21 01:24:37] [INFO ] [Real]Added 132 Read/Feed constraints in 22 ms returned sat
[2020-05-21 01:24:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:24:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2020-05-21 01:24:37] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:24:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:38] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2020-05-21 01:24:38] [INFO ] [Nat]Added 132 Read/Feed constraints in 44 ms returned sat
[2020-05-21 01:24:38] [INFO ] Deduced a trap composed of 36 places in 176 ms
[2020-05-21 01:24:38] [INFO ] Deduced a trap composed of 36 places in 147 ms
[2020-05-21 01:24:38] [INFO ] Deduced a trap composed of 14 places in 132 ms
[2020-05-21 01:24:39] [INFO ] Deduced a trap composed of 12 places in 148 ms
[2020-05-21 01:24:39] [INFO ] Deduced a trap composed of 10 places in 153 ms
[2020-05-21 01:24:39] [INFO ] Deduced a trap composed of 14 places in 134 ms
[2020-05-21 01:24:39] [INFO ] Deduced a trap composed of 39 places in 139 ms
[2020-05-21 01:24:39] [INFO ] Deduced a trap composed of 43 places in 159 ms
[2020-05-21 01:24:40] [INFO ] Deduced a trap composed of 21 places in 145 ms
[2020-05-21 01:24:40] [INFO ] Deduced a trap composed of 39 places in 120 ms
[2020-05-21 01:24:40] [INFO ] Deduced a trap composed of 14 places in 128 ms
[2020-05-21 01:24:40] [INFO ] Deduced a trap composed of 58 places in 127 ms
[2020-05-21 01:24:40] [INFO ] Deduced a trap composed of 61 places in 85 ms
[2020-05-21 01:24:40] [INFO ] Deduced a trap composed of 58 places in 87 ms
[2020-05-21 01:24:40] [INFO ] Deduced a trap composed of 58 places in 100 ms
[2020-05-21 01:24:40] [INFO ] Deduced a trap composed of 57 places in 125 ms
[2020-05-21 01:24:41] [INFO ] Deduced a trap composed of 80 places in 214 ms
[2020-05-21 01:24:41] [INFO ] Deduced a trap composed of 47 places in 215 ms
[2020-05-21 01:24:41] [INFO ] Deduced a trap composed of 47 places in 201 ms
[2020-05-21 01:24:42] [INFO ] Deduced a trap composed of 47 places in 236 ms
[2020-05-21 01:24:42] [INFO ] Deduced a trap composed of 87 places in 218 ms
[2020-05-21 01:24:42] [INFO ] Deduced a trap composed of 21 places in 203 ms
[2020-05-21 01:24:42] [INFO ] Deduced a trap composed of 44 places in 174 ms
[2020-05-21 01:24:42] [INFO ] Deduced a trap composed of 22 places in 175 ms
[2020-05-21 01:24:43] [INFO ] Deduced a trap composed of 10 places in 150 ms
[2020-05-21 01:24:43] [INFO ] Deduced a trap composed of 62 places in 168 ms
[2020-05-21 01:24:43] [INFO ] Deduced a trap composed of 65 places in 97 ms
[2020-05-21 01:24:43] [INFO ] Deduced a trap composed of 61 places in 104 ms
[2020-05-21 01:24:43] [INFO ] Deduced a trap composed of 21 places in 60 ms
[2020-05-21 01:24:43] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 5159 ms
[2020-05-21 01:24:43] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 26 ms.
[2020-05-21 01:24:50] [INFO ] Added : 619 causal constraints over 124 iterations in 6703 ms. Result :sat
[2020-05-21 01:24:50] [INFO ] Deduced a trap composed of 66 places in 123 ms
[2020-05-21 01:24:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2020-05-21 01:24:50] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:24:50] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:24:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:51] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2020-05-21 01:24:51] [INFO ] [Real]Added 132 Read/Feed constraints in 19 ms returned sat
[2020-05-21 01:24:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:24:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-05-21 01:24:51] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:52] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2020-05-21 01:24:52] [INFO ] [Nat]Added 132 Read/Feed constraints in 53 ms returned sat
[2020-05-21 01:24:52] [INFO ] Deduced a trap composed of 18 places in 201 ms
[2020-05-21 01:24:52] [INFO ] Deduced a trap composed of 10 places in 192 ms
[2020-05-21 01:24:52] [INFO ] Deduced a trap composed of 10 places in 154 ms
[2020-05-21 01:24:52] [INFO ] Deduced a trap composed of 42 places in 175 ms
[2020-05-21 01:24:53] [INFO ] Deduced a trap composed of 13 places in 180 ms
[2020-05-21 01:24:53] [INFO ] Deduced a trap composed of 10 places in 164 ms
[2020-05-21 01:24:53] [INFO ] Deduced a trap composed of 27 places in 145 ms
[2020-05-21 01:24:53] [INFO ] Deduced a trap composed of 27 places in 191 ms
[2020-05-21 01:24:53] [INFO ] Deduced a trap composed of 63 places in 142 ms
[2020-05-21 01:24:54] [INFO ] Deduced a trap composed of 27 places in 170 ms
[2020-05-21 01:24:54] [INFO ] Deduced a trap composed of 35 places in 180 ms
[2020-05-21 01:24:54] [INFO ] Deduced a trap composed of 27 places in 140 ms
[2020-05-21 01:24:54] [INFO ] Deduced a trap composed of 42 places in 186 ms
[2020-05-21 01:24:54] [INFO ] Deduced a trap composed of 58 places in 149 ms
[2020-05-21 01:24:55] [INFO ] Deduced a trap composed of 58 places in 163 ms
[2020-05-21 01:24:55] [INFO ] Deduced a trap composed of 17 places in 259 ms
[2020-05-21 01:24:55] [INFO ] Deduced a trap composed of 32 places in 227 ms
[2020-05-21 01:24:55] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3587 ms
[2020-05-21 01:24:55] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 30 ms.
[2020-05-21 01:24:59] [INFO ] Added : 438 causal constraints over 88 iterations in 3820 ms. Result :sat
[2020-05-21 01:24:59] [INFO ] Deduced a trap composed of 79 places in 142 ms
[2020-05-21 01:24:59] [INFO ] Deduced a trap composed of 57 places in 188 ms
[2020-05-21 01:25:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 477 ms
[2020-05-21 01:25:00] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:25:00] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:25:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:00] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2020-05-21 01:25:00] [INFO ] [Real]Added 132 Read/Feed constraints in 21 ms returned sat
[2020-05-21 01:25:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:25:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-05-21 01:25:00] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:25:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:01] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2020-05-21 01:25:01] [INFO ] [Nat]Added 132 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:25:01] [INFO ] Deduced a trap composed of 32 places in 244 ms
[2020-05-21 01:25:02] [INFO ] Deduced a trap composed of 32 places in 219 ms
[2020-05-21 01:25:02] [INFO ] Deduced a trap composed of 32 places in 210 ms
[2020-05-21 01:25:02] [INFO ] Deduced a trap composed of 54 places in 207 ms
[2020-05-21 01:25:02] [INFO ] Deduced a trap composed of 54 places in 210 ms
[2020-05-21 01:25:03] [INFO ] Deduced a trap composed of 54 places in 239 ms
[2020-05-21 01:25:03] [INFO ] Deduced a trap composed of 54 places in 268 ms
[2020-05-21 01:25:03] [INFO ] Deduced a trap composed of 43 places in 199 ms
[2020-05-21 01:25:03] [INFO ] Deduced a trap composed of 17 places in 182 ms
[2020-05-21 01:25:04] [INFO ] Deduced a trap composed of 10 places in 189 ms
[2020-05-21 01:25:04] [INFO ] Deduced a trap composed of 10 places in 226 ms
[2020-05-21 01:25:04] [INFO ] Deduced a trap composed of 10 places in 211 ms
[2020-05-21 01:25:04] [INFO ] Deduced a trap composed of 40 places in 214 ms
[2020-05-21 01:25:05] [INFO ] Deduced a trap composed of 88 places in 166 ms
[2020-05-21 01:25:05] [INFO ] Deduced a trap composed of 66 places in 185 ms
[2020-05-21 01:25:05] [INFO ] Deduced a trap composed of 44 places in 204 ms
[2020-05-21 01:25:05] [INFO ] Deduced a trap composed of 40 places in 203 ms
[2020-05-21 01:25:05] [INFO ] Deduced a trap composed of 43 places in 164 ms
[2020-05-21 01:25:06] [INFO ] Deduced a trap composed of 91 places in 187 ms
[2020-05-21 01:25:06] [INFO ] Deduced a trap composed of 87 places in 174 ms
[2020-05-21 01:25:06] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4787 ms
[2020-05-21 01:25:06] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 46 ms.
[2020-05-21 01:25:10] [INFO ] Added : 472 causal constraints over 95 iterations in 4460 ms. Result :sat
[2020-05-21 01:25:11] [INFO ] Deduced a trap composed of 13 places in 268 ms
[2020-05-21 01:25:11] [INFO ] Deduced a trap composed of 39 places in 276 ms
[2020-05-21 01:25:11] [INFO ] Deduced a trap composed of 85 places in 215 ms
[2020-05-21 01:25:12] [INFO ] Deduced a trap composed of 62 places in 166 ms
[2020-05-21 01:25:12] [INFO ] Deduced a trap composed of 84 places in 218 ms
[2020-05-21 01:25:12] [INFO ] Deduced a trap composed of 83 places in 197 ms
[2020-05-21 01:25:12] [INFO ] Deduced a trap composed of 14 places in 149 ms
[2020-05-21 01:25:13] [INFO ] Deduced a trap composed of 65 places in 96 ms
[2020-05-21 01:25:13] [INFO ] Deduced a trap composed of 65 places in 96 ms
[2020-05-21 01:25:13] [INFO ] Deduced a trap composed of 87 places in 138 ms
[2020-05-21 01:25:13] [INFO ] Deduced a trap composed of 91 places in 163 ms
[2020-05-21 01:25:13] [INFO ] Deduced a trap composed of 21 places in 217 ms
[2020-05-21 01:25:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3221 ms
[2020-05-21 01:25:14] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:25:14] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:14] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2020-05-21 01:25:14] [INFO ] [Real]Added 132 Read/Feed constraints in 22 ms returned sat
[2020-05-21 01:25:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:25:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 32 ms returned sat
[2020-05-21 01:25:14] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:15] [INFO ] [Nat]Absence check using state equation in 695 ms returned sat
[2020-05-21 01:25:15] [INFO ] [Nat]Added 132 Read/Feed constraints in 39 ms returned sat
[2020-05-21 01:25:15] [INFO ] Deduced a trap composed of 10 places in 281 ms
[2020-05-21 01:25:16] [INFO ] Deduced a trap composed of 32 places in 243 ms
[2020-05-21 01:25:16] [INFO ] Deduced a trap composed of 32 places in 226 ms
[2020-05-21 01:25:16] [INFO ] Deduced a trap composed of 32 places in 242 ms
[2020-05-21 01:25:16] [INFO ] Deduced a trap composed of 10 places in 227 ms
[2020-05-21 01:25:17] [INFO ] Deduced a trap composed of 32 places in 266 ms
[2020-05-21 01:25:17] [INFO ] Deduced a trap composed of 10 places in 268 ms
[2020-05-21 01:25:17] [INFO ] Deduced a trap composed of 54 places in 223 ms
[2020-05-21 01:25:18] [INFO ] Deduced a trap composed of 65 places in 225 ms
[2020-05-21 01:25:18] [INFO ] Deduced a trap composed of 18 places in 278 ms
[2020-05-21 01:25:18] [INFO ] Deduced a trap composed of 62 places in 214 ms
[2020-05-21 01:25:18] [INFO ] Deduced a trap composed of 62 places in 196 ms
[2020-05-21 01:25:19] [INFO ] Deduced a trap composed of 50 places in 166 ms
[2020-05-21 01:25:19] [INFO ] Deduced a trap composed of 76 places in 130 ms
[2020-05-21 01:25:19] [INFO ] Deduced a trap composed of 76 places in 160 ms
[2020-05-21 01:25:19] [INFO ] Deduced a trap composed of 76 places in 174 ms
[2020-05-21 01:25:19] [INFO ] Deduced a trap composed of 76 places in 190 ms
[2020-05-21 01:25:20] [INFO ] Deduced a trap composed of 40 places in 227 ms
[2020-05-21 01:25:20] [INFO ] Deduced a trap composed of 36 places in 234 ms
[2020-05-21 01:25:20] [INFO ] Deduced a trap composed of 61 places in 213 ms
[2020-05-21 01:25:20] [INFO ] Deduced a trap composed of 83 places in 164 ms
[2020-05-21 01:25:20] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5253 ms
[2020-05-21 01:25:20] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 50 ms.
[2020-05-21 01:25:26] [INFO ] Added : 559 causal constraints over 112 iterations in 5886 ms. Result :sat
[2020-05-21 01:25:27] [INFO ] Deduced a trap composed of 61 places in 232 ms
[2020-05-21 01:25:27] [INFO ] Deduced a trap composed of 39 places in 151 ms
[2020-05-21 01:25:27] [INFO ] Deduced a trap composed of 84 places in 130 ms
[2020-05-21 01:25:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 868 ms
[2020-05-21 01:25:27] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-05-21 01:25:27] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:25:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:28] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2020-05-21 01:25:28] [INFO ] [Real]Added 132 Read/Feed constraints in 19 ms returned sat
[2020-05-21 01:25:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:25:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:25:28] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:25:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:29] [INFO ] [Nat]Absence check using state equation in 711 ms returned sat
[2020-05-21 01:25:29] [INFO ] [Nat]Added 132 Read/Feed constraints in 35 ms returned sat
[2020-05-21 01:25:29] [INFO ] Deduced a trap composed of 10 places in 207 ms
[2020-05-21 01:25:29] [INFO ] Deduced a trap composed of 10 places in 165 ms
[2020-05-21 01:25:29] [INFO ] Deduced a trap composed of 10 places in 177 ms
[2020-05-21 01:25:30] [INFO ] Deduced a trap composed of 12 places in 149 ms
[2020-05-21 01:25:30] [INFO ] Deduced a trap composed of 10 places in 169 ms
[2020-05-21 01:25:30] [INFO ] Deduced a trap composed of 27 places in 172 ms
[2020-05-21 01:25:30] [INFO ] Deduced a trap composed of 40 places in 171 ms
[2020-05-21 01:25:30] [INFO ] Deduced a trap composed of 27 places in 139 ms
[2020-05-21 01:25:30] [INFO ] Deduced a trap composed of 32 places in 142 ms
[2020-05-21 01:25:31] [INFO ] Deduced a trap composed of 65 places in 113 ms
[2020-05-21 01:25:31] [INFO ] Deduced a trap composed of 39 places in 117 ms
[2020-05-21 01:25:31] [INFO ] Deduced a trap composed of 36 places in 117 ms
[2020-05-21 01:25:31] [INFO ] Deduced a trap composed of 43 places in 127 ms
[2020-05-21 01:25:31] [INFO ] Deduced a trap composed of 38 places in 141 ms
[2020-05-21 01:25:31] [INFO ] Deduced a trap composed of 65 places in 139 ms
[2020-05-21 01:25:32] [INFO ] Deduced a trap composed of 70 places in 101 ms
[2020-05-21 01:25:32] [INFO ] Deduced a trap composed of 62 places in 158 ms
[2020-05-21 01:25:32] [INFO ] Deduced a trap composed of 81 places in 105 ms
[2020-05-21 01:25:32] [INFO ] Deduced a trap composed of 21 places in 89 ms
[2020-05-21 01:25:32] [INFO ] Deduced a trap composed of 81 places in 158 ms
[2020-05-21 01:25:32] [INFO ] Deduced a trap composed of 36 places in 93 ms
[2020-05-21 01:25:32] [INFO ] Deduced a trap composed of 14 places in 84 ms
[2020-05-21 01:25:32] [INFO ] Deduced a trap composed of 14 places in 82 ms
[2020-05-21 01:25:33] [INFO ] Deduced a trap composed of 22 places in 83 ms
[2020-05-21 01:25:33] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3890 ms
[2020-05-21 01:25:33] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 38 ms.
[2020-05-21 01:25:40] [INFO ] Added : 625 causal constraints over 128 iterations in 7435 ms. Result :sat
[2020-05-21 01:25:40] [INFO ] Deduced a trap composed of 32 places in 270 ms
[2020-05-21 01:25:41] [INFO ] Deduced a trap composed of 45 places in 122 ms
[2020-05-21 01:25:41] [INFO ] Deduced a trap composed of 64 places in 162 ms
[2020-05-21 01:25:41] [INFO ] Deduced a trap composed of 80 places in 191 ms
[2020-05-21 01:25:41] [INFO ] Deduced a trap composed of 114 places in 153 ms
[2020-05-21 01:25:42] [INFO ] Deduced a trap composed of 43 places in 179 ms
[2020-05-21 01:25:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1607 ms
[2020-05-21 01:25:42] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned unsat
[2020-05-21 01:25:42] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2020-05-21 01:25:42] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-21 01:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:42] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2020-05-21 01:25:43] [INFO ] [Real]Added 132 Read/Feed constraints in 27 ms returned sat
[2020-05-21 01:25:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:25:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:25:43] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:25:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:43] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2020-05-21 01:25:43] [INFO ] [Nat]Added 132 Read/Feed constraints in 37 ms returned sat
[2020-05-21 01:25:44] [INFO ] Deduced a trap composed of 27 places in 247 ms
[2020-05-21 01:25:44] [INFO ] Deduced a trap composed of 27 places in 265 ms
[2020-05-21 01:25:44] [INFO ] Deduced a trap composed of 10 places in 258 ms
[2020-05-21 01:25:44] [INFO ] Deduced a trap composed of 10 places in 254 ms
[2020-05-21 01:25:45] [INFO ] Deduced a trap composed of 10 places in 244 ms
[2020-05-21 01:25:45] [INFO ] Deduced a trap composed of 10 places in 231 ms
[2020-05-21 01:25:45] [INFO ] Deduced a trap composed of 54 places in 220 ms
[2020-05-21 01:25:45] [INFO ] Deduced a trap composed of 54 places in 199 ms
[2020-05-21 01:25:46] [INFO ] Deduced a trap composed of 76 places in 202 ms
[2020-05-21 01:25:46] [INFO ] Deduced a trap composed of 40 places in 136 ms
[2020-05-21 01:25:46] [INFO ] Deduced a trap composed of 39 places in 144 ms
[2020-05-21 01:25:46] [INFO ] Deduced a trap composed of 42 places in 218 ms
[2020-05-21 01:25:46] [INFO ] Deduced a trap composed of 42 places in 161 ms
[2020-05-21 01:25:47] [INFO ] Deduced a trap composed of 48 places in 165 ms
[2020-05-21 01:25:47] [INFO ] Deduced a trap composed of 35 places in 186 ms
[2020-05-21 01:25:47] [INFO ] Deduced a trap composed of 90 places in 198 ms
[2020-05-21 01:25:47] [INFO ] Deduced a trap composed of 27 places in 181 ms
[2020-05-21 01:25:48] [INFO ] Deduced a trap composed of 45 places in 167 ms
[2020-05-21 01:25:48] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4228 ms
[2020-05-21 01:25:48] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 26 ms.
[2020-05-21 01:25:54] [INFO ] Added : 625 causal constraints over 125 iterations in 6154 ms. Result :sat
[2020-05-21 01:25:54] [INFO ] Deduced a trap composed of 23 places in 175 ms
[2020-05-21 01:25:54] [INFO ] Deduced a trap composed of 41 places in 180 ms
[2020-05-21 01:25:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 545 ms
[2020-05-21 01:25:54] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:25:54] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:55] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2020-05-21 01:25:55] [INFO ] [Real]Added 132 Read/Feed constraints in 16 ms returned sat
[2020-05-21 01:25:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:25:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2020-05-21 01:25:55] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:25:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:56] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2020-05-21 01:25:56] [INFO ] [Nat]Added 132 Read/Feed constraints in 36 ms returned sat
[2020-05-21 01:25:56] [INFO ] Deduced a trap composed of 27 places in 214 ms
[2020-05-21 01:25:56] [INFO ] Deduced a trap composed of 27 places in 213 ms
[2020-05-21 01:25:57] [INFO ] Deduced a trap composed of 10 places in 206 ms
[2020-05-21 01:25:57] [INFO ] Deduced a trap composed of 10 places in 225 ms
[2020-05-21 01:25:57] [INFO ] Deduced a trap composed of 10 places in 228 ms
[2020-05-21 01:25:57] [INFO ] Deduced a trap composed of 10 places in 270 ms
[2020-05-21 01:25:58] [INFO ] Deduced a trap composed of 54 places in 315 ms
[2020-05-21 01:25:58] [INFO ] Deduced a trap composed of 54 places in 248 ms
[2020-05-21 01:25:58] [INFO ] Deduced a trap composed of 76 places in 249 ms
[2020-05-21 01:25:59] [INFO ] Deduced a trap composed of 40 places in 153 ms
[2020-05-21 01:25:59] [INFO ] Deduced a trap composed of 39 places in 179 ms
[2020-05-21 01:25:59] [INFO ] Deduced a trap composed of 42 places in 161 ms
[2020-05-21 01:25:59] [INFO ] Deduced a trap composed of 42 places in 197 ms
[2020-05-21 01:25:59] [INFO ] Deduced a trap composed of 48 places in 203 ms
[2020-05-21 01:26:00] [INFO ] Deduced a trap composed of 35 places in 184 ms
[2020-05-21 01:26:00] [INFO ] Deduced a trap composed of 90 places in 195 ms
[2020-05-21 01:26:00] [INFO ] Deduced a trap composed of 27 places in 175 ms
[2020-05-21 01:26:00] [INFO ] Deduced a trap composed of 45 places in 151 ms
[2020-05-21 01:26:00] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4335 ms
[2020-05-21 01:26:00] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 30 ms.
[2020-05-21 01:26:06] [INFO ] Added : 625 causal constraints over 125 iterations in 5608 ms. Result :sat
[2020-05-21 01:26:06] [INFO ] Deduced a trap composed of 23 places in 181 ms
[2020-05-21 01:26:06] [INFO ] Deduced a trap composed of 41 places in 204 ms
[2020-05-21 01:26:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 549 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-21 01:26:07] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-21 01:26:07] [INFO ] Flatten gal took : 142 ms
FORMULA Peterson-PT-4-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 01:26:07] [INFO ] Flatten gal took : 106 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 01:26:07] [INFO ] Applying decomposition
[2020-05-21 01:26:07] [INFO ] Flatten gal took : 47 ms
[2020-05-21 01:26:07] [INFO ] Input system was already deterministic with 690 transitions.
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/graph14511076604141388360.txt, -o, /tmp/graph14511076604141388360.bin, -w, /tmp/graph14511076604141388360.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/graph14511076604141388360.bin, -l, -1, -v, -w, /tmp/graph14511076604141388360.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 01:26:08] [INFO ] Decomposing Gal with order
[2020-05-21 01:26:08] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 630 out of 690 initially.
// Phase 1: matrix 630 rows 480 cols
[2020-05-21 01:26:08] [INFO ] Removed a total of 474 redundant transitions.
[2020-05-21 01:26:08] [INFO ] Computed 19 place invariants in 8 ms
inv : Turn_2_2 + Turn_2_3 + Turn_2_0 + Turn_2_1 + Turn_2_4 = 1
inv : WantSection_1_F - Idle_1 = 0
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_2_2 + IsEndLoop_3_3_2 + IsEndLoop_3_1_3 + IsEndLoop_3_0_3 + IsEndLoop_3_2_3 + IsEndLoop_3_0_4 + IsEndLoop_3_3_3 + IsEndLoop_3_1_4 + IsEndLoop_3_3_4 + IsEndLoop_3_2_4 + EndTurn_3_1 + EndTurn_3_0 + EndTurn_3_2 + BeginLoop_3_0_0 + EndTurn_3_3 + BeginLoop_3_2_0 + BeginLoop_3_3_0 + BeginLoop_3_1_0 + BeginLoop_3_2_1 + BeginLoop_3_0_1 + BeginLoop_3_1_1 + BeginLoop_3_1_2 + BeginLoop_3_3_1 + BeginLoop_3_0_2 + BeginLoop_3_0_3 + BeginLoop_3_1_3 + BeginLoop_3_2_2 + BeginLoop_3_3_2 + BeginLoop_3_0_4 + BeginLoop_3_3_3 + BeginLoop_3_2_3 + BeginLoop_3_3_4 + BeginLoop_3_2_4 + BeginLoop_3_1_4 + TestAlone_3_1_0 + TestAlone_3_0_0 + TestAlone_3_1_1 + TestAlone_3_0_1 + TestAlone_3_3_0 + TestAlone_3_2_0 + TestAlone_3_2_2 + TestAlone_3_3_2 + TestAlone_3_2_1 + TestAlone_3_3_1 + TestAlone_3_0_2 + TestAlone_3_1_2 + TestAlone_3_1_4 + TestAlone_3_2_4 + TestAlone_3_3_4 + TestTurn_3_0 + TestAlone_3_0_4 + TestIdentity_3_1_0 + TestIdentity_3_0_0 + TestIdentity_3_3_0 + TestIdentity_3_2_0 + TestTurn_3_2 + TestTurn_3_1 + TestTurn_3_3 + TestIdentity_3_3_1 + TestIdentity_3_1_2 + TestIdentity_3_0_2 + TestIdentity_3_0_1 + TestIdentity_3_2_1 + TestIdentity_3_1_1 + TestIdentity_3_3_3 + TestIdentity_3_1_3 + TestIdentity_3_2_3 + TestIdentity_3_0_3 + TestIdentity_3_2_2 + TestIdentity_3_3_2 + TestIdentity_3_2_4 + TestIdentity_3_3_4 + TestIdentity_3_0_4 + TestIdentity_3_1_4 + AskForSection_3_3 + AskForSection_3_2 + AskForSection_3_1 + AskForSection_3_0 + Idle_3 + CS_3 = 1
inv : WantSection_4_T + Idle_4 = 1
inv : WantSection_0_T + Idle_0 = 1
inv : WantSection_2_F - Idle_2 = 0
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_2 + IsEndLoop_2_2_2 + IsEndLoop_2_3_2 + IsEndLoop_2_1_3 + IsEndLoop_2_0_3 + IsEndLoop_2_2_3 + IsEndLoop_2_0_4 + IsEndLoop_2_3_3 + IsEndLoop_2_2_4 + IsEndLoop_2_1_4 + IsEndLoop_2_3_4 + EndTurn_2_1 + EndTurn_2_0 + EndTurn_2_2 + BeginLoop_2_0_0 + EndTurn_2_3 + BeginLoop_2_3_0 + BeginLoop_2_1_0 + BeginLoop_2_2_0 + BeginLoop_2_2_1 + BeginLoop_2_0_1 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_2_2_2 + BeginLoop_2_3_1 + BeginLoop_2_0_2 + BeginLoop_2_0_3 + BeginLoop_2_1_3 + BeginLoop_2_3_2 + BeginLoop_2_0_4 + BeginLoop_2_3_3 + BeginLoop_2_2_3 + BeginLoop_2_3_4 + BeginLoop_2_2_4 + BeginLoop_2_1_4 + TestAlone_2_1_0 + TestAlone_2_0_0 + TestAlone_2_1_1 + TestAlone_2_0_1 + TestAlone_2_3_0 + TestAlone_2_2_0 + TestAlone_2_0_3 + TestAlone_2_1_3 + TestAlone_2_2_1 + TestAlone_2_3_1 + TestAlone_2_2_4 + TestAlone_2_3_4 + TestTurn_2_0 + TestAlone_2_2_3 + TestAlone_2_3_3 + TestAlone_2_0_4 + TestAlone_2_1_4 + TestIdentity_2_1_0 + TestIdentity_2_3_0 + TestIdentity_2_2_0 + TestTurn_2_2 + TestTurn_2_1 + TestIdentity_2_0_0 + TestTurn_2_3 + TestIdentity_2_0_2 + TestIdentity_2_3_1 + TestIdentity_2_1_2 + TestIdentity_2_0_1 + TestIdentity_2_2_1 + TestIdentity_2_1_1 + TestIdentity_2_3_3 + TestIdentity_2_0_4 + TestIdentity_2_1_3 + TestIdentity_2_2_3 + TestIdentity_2_0_3 + TestIdentity_2_2_2 + TestIdentity_2_3_2 + TestIdentity_2_2_4 + TestIdentity_2_3_4 + TestIdentity_2_1_4 + AskForSection_2_3 + AskForSection_2_2 + AskForSection_2_1 + AskForSection_2_0 + Idle_2 + CS_2 = 1
inv : WantSection_3_F - Idle_3 = 0
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_0_2 + IsEndLoop_4_1_2 + IsEndLoop_4_2_2 + IsEndLoop_4_3_2 + IsEndLoop_4_0_3 + IsEndLoop_4_2_3 + IsEndLoop_4_1_3 + IsEndLoop_4_0_4 + IsEndLoop_4_3_3 + IsEndLoop_4_1_4 + IsEndLoop_4_3_4 + IsEndLoop_4_2_4 + EndTurn_4_0 + EndTurn_4_2 + EndTurn_4_1 + BeginLoop_4_0_0 + EndTurn_4_3 + BeginLoop_4_2_0 + BeginLoop_4_3_0 + BeginLoop_4_1_0 + BeginLoop_4_1_1 + BeginLoop_4_2_1 + BeginLoop_4_0_1 + BeginLoop_4_1_2 + BeginLoop_4_3_1 + BeginLoop_4_0_2 + BeginLoop_4_0_3 + BeginLoop_4_2_2 + BeginLoop_4_3_2 + BeginLoop_4_0_4 + BeginLoop_4_3_3 + BeginLoop_4_2_3 + BeginLoop_4_1_3 + BeginLoop_4_3_4 + BeginLoop_4_2_4 + BeginLoop_4_1_4 + TestAlone_4_0_0 + TestAlone_4_0_1 + TestAlone_4_3_0 + TestAlone_4_2_0 + TestAlone_4_1_0 + TestAlone_4_1_2 + TestAlone_4_2_2 + TestAlone_4_3_2 + TestAlone_4_0_3 + TestAlone_4_1_1 + TestAlone_4_2_1 + TestAlone_4_3_1 + TestAlone_4_0_2 + TestTurn_4_0 + TestAlone_4_1_3 + TestAlone_4_2_3 + TestAlone_4_3_3 + TestIdentity_4_1_0 + TestIdentity_4_0_0 + TestIdentity_4_2_0 + TestTurn_4_2 + TestTurn_4_1 + TestTurn_4_3 + TestIdentity_4_3_1 + TestIdentity_4_1_2 + TestIdentity_4_0_2 + TestIdentity_4_0_1 + TestIdentity_4_3_0 + TestIdentity_4_2_1 + TestIdentity_4_1_1 + TestIdentity_4_3_3 + TestIdentity_4_1_3 + TestIdentity_4_2_3 + TestIdentity_4_3_2 + TestIdentity_4_0_3 + TestIdentity_4_2_2 + TestIdentity_4_3_4 + TestIdentity_4_2_4 + TestIdentity_4_0_4 + TestIdentity_4_1_4 + AskForSection_4_3 + AskForSection_4_2 + AskForSection_4_1 + AskForSection_4_0 + Idle_4 + CS_4 = 1
inv : Turn_1_2 + Turn_1_3 + Turn_1_0 + Turn_1_1 + Turn_1_4 = 1
inv : IsEndLoop_0_0_0 + IsEndLoop_0_1_0 + IsEndLoop_0_2_0 + IsEndLoop_0_3_0 + IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_3_2 + IsEndLoop_0_0_3 + IsEndLoop_0_1_3 + IsEndLoop_0_3_3 + IsEndLoop_0_2_3 + IsEndLoop_0_0_4 + IsEndLoop_0_2_4 + IsEndLoop_0_1_4 + EndTurn_0_0 + IsEndLoop_0_3_4 + EndTurn_0_1 + EndTurn_0_3 + EndTurn_0_2 + BeginLoop_0_0_0 + BeginLoop_0_3_0 + BeginLoop_0_0_1 + BeginLoop_0_1_0 + BeginLoop_0_2_0 + BeginLoop_0_2_1 + BeginLoop_0_3_1 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_0_2_2 + BeginLoop_0_0_2 + BeginLoop_0_1_3 + BeginLoop_0_3_2 + BeginLoop_0_0_3 + BeginLoop_0_0_4 + BeginLoop_0_3_3 + BeginLoop_0_2_3 + BeginLoop_0_3_4 + BeginLoop_0_2_4 + BeginLoop_0_1_4 + TestAlone_0_1_1 + TestAlone_0_0_1 + TestAlone_0_2_2 + TestAlone_0_3_2 + TestAlone_0_0_3 + TestAlone_0_1_3 + TestAlone_0_2_1 + TestAlone_0_3_1 + TestAlone_0_0_2 + TestAlone_0_1_2 + TestAlone_0_2_4 + TestAlone_0_3_4 + TestTurn_0_0 + TestTurn_0_1 + TestAlone_0_2_3 + TestAlone_0_3_3 + TestAlone_0_0_4 + TestAlone_0_1_4 + TestIdentity_0_2_0 + TestIdentity_0_1_0 + TestIdentity_0_3_0 + TestTurn_0_2 + TestIdentity_0_0_0 + TestTurn_0_3 + TestIdentity_0_0_2 + TestIdentity_0_3_1 + TestIdentity_0_2_2 + TestIdentity_0_1_2 + TestIdentity_0_1_1 + TestIdentity_0_0_1 + TestIdentity_0_2_1 + TestIdentity_0_3_3 + TestIdentity_0_0_4 + TestIdentity_0_2_3 + TestIdentity_0_0_3 + TestIdentity_0_1_3 + TestIdentity_0_3_2 + TestIdentity_0_3_4 + TestIdentity_0_1_4 + TestIdentity_0_2_4 + CS_0 + AskForSection_0_3 + AskForSection_0_2 + AskForSection_0_1 + AskForSection_0_0 + Idle_0 = 1
inv : WantSection_2_T + Idle_2 = 1
inv : WantSection_1_T + Idle_1 = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_0_1 + IsEndLoop_1_1_1 + IsEndLoop_1_2_1 + IsEndLoop_1_3_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_1_3 + IsEndLoop_1_0_3 + IsEndLoop_1_3_3 + IsEndLoop_1_2_3 + IsEndLoop_1_0_4 + IsEndLoop_1_2_4 + IsEndLoop_1_1_4 + IsEndLoop_1_3_4 + EndTurn_1_1 + EndTurn_1_0 + EndTurn_1_3 + EndTurn_1_2 + BeginLoop_1_0_0 + BeginLoop_1_3_0 + BeginLoop_1_1_0 + BeginLoop_1_2_0 + BeginLoop_1_2_1 + BeginLoop_1_3_1 + BeginLoop_1_0_1 + BeginLoop_1_1_1 + BeginLoop_1_1_2 + BeginLoop_1_2_2 + BeginLoop_1_0_2 + BeginLoop_1_0_3 + BeginLoop_1_1_3 + BeginLoop_1_3_2 + BeginLoop_1_0_4 + BeginLoop_1_3_3 + BeginLoop_1_2_3 + BeginLoop_1_3_4 + BeginLoop_1_2_4 + BeginLoop_1_1_4 + TestAlone_1_1_0 + TestAlone_1_0_0 + TestAlone_1_3_0 + TestAlone_1_2_0 + TestAlone_1_2_2 + TestAlone_1_3_2 + TestAlone_1_0_3 + TestAlone_1_1_3 + TestAlone_1_0_2 + TestAlone_1_1_2 + TestAlone_1_2_4 + TestAlone_1_3_4 + TestTurn_1_0 + TestTurn_1_1 + TestAlone_1_2_3 + TestAlone_1_3_3 + TestAlone_1_0_4 + TestAlone_1_1_4 + TestIdentity_1_1_0 + TestIdentity_1_3_0 + TestIdentity_1_2_0 + TestTurn_1_2 + TestIdentity_1_0_0 + TestTurn_1_3 + TestIdentity_1_0_2 + TestIdentity_1_3_1 + TestIdentity_1_1_2 + TestIdentity_1_1_1 + TestIdentity_1_0_1 + TestIdentity_1_2_1 + TestIdentity_1_3_3 + TestIdentity_1_0_4 + TestIdentity_1_2_3 + TestIdentity_1_0_3 + TestIdentity_1_1_3 + TestIdentity_1_2_2 + TestIdentity_1_3_2 + TestIdentity_1_2_4 + TestIdentity_1_3_4 + TestIdentity_1_1_4 + CS_1 + AskForSection_1_3 + AskForSection_1_2 + AskForSection_1_1 + AskForSection_1_0 + Idle_1 = 1
inv : Turn_0_2 + Turn_0_3 + Turn_0_0 + Turn_0_1 + Turn_0_4 = 1
inv : WantSection_4_F - Idle_4 = 0
inv : WantSection_3_T + Idle_3 = 1
inv : WantSection_0_F - Idle_0 = 0
inv : Turn_3_1 + Turn_3_2 + Turn_3_0 + Turn_3_4 + Turn_3_3 = 1
Total of 19 invariants.
[2020-05-21 01:26:08] [INFO ] Computed 19 place invariants in 12 ms
[2020-05-21 01:26:08] [INFO ] Flatten gal took : 179 ms
[2020-05-21 01:26:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 20 ms.
[2020-05-21 01:26:08] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 12 ms
[2020-05-21 01:26:08] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 14 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !((X((F(X((X("(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i4.u14.Turn_1_3>=1)&&(i4.u12.AskForSection_2_1>=1))||((i7.u22.AskForSection_0_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i4.u12.AskForSection_2_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i7.u82.AskForSection_2_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i14.u17.AskForSection_1_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u23.AskForSection_4_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i17.u87.AskForSection_0_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i17.u23.AskForSection_4_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i7.u19.AskForSection_4_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u13.AskForSection_3_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i14.u15.AskForSection_3_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i4.u14.AskForSection_1_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i7.u20.AskForSection_3_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i17.u18.AskForSection_1_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i14.u66.AskForSection_2_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u18.AskForSection_1_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i7.u21.AskForSection_1_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u67.AskForSection_0_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i17.u24.AskForSection_3_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i17.u24.AskForSection_3_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i14.u65.AskForSection_0_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i17.u87.AskForSection_0_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i14.u16.AskForSection_4_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i4.u83.AskForSection_4_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i17.u25.AskForSection_2_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i17.u25.AskForSection_2_3>=1)&&(i17.u87.Turn_3_3>=1)))"))&&("(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i4.u14.Turn_1_3>=1)&&(i4.u12.AskForSection_2_1>=1))||((i7.u22.AskForSection_0_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i4.u12.AskForSection_2_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i7.u82.AskForSection_2_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i14.u17.AskForSection_1_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u23.AskForSection_4_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i17.u87.AskForSection_0_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i17.u23.AskForSection_4_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i7.u19.AskForSection_4_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u13.AskForSection_3_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i14.u15.AskForSection_3_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i4.u14.AskForSection_1_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i7.u20.AskForSection_3_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i17.u18.AskForSection_1_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i14.u66.AskForSection_2_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u18.AskForSection_1_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i7.u21.AskForSection_1_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u67.AskForSection_0_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i17.u24.AskForSection_3_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i17.u24.AskForSection_3_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i14.u65.AskForSection_0_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i17.u87.AskForSection_0_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i14.u16.AskForSection_4_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i4.u83.AskForSection_4_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i17.u25.AskForSection_2_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i17.u25.AskForSection_2_3>=1)&&(i17.u87.Turn_3_3>=1)))"))))&&(G(X(G("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i7.u22.TestTurn_0_2>=1)&&(i7.u20.Turn_2_3>=1))||((i7.u22.TestTurn_0_2>=1)&&(i7.u20.Turn_2_2>=1)))||((i17.u23.TestTurn_4_3>=1)&&(i17.u87.Turn_3_2>=1)))||((i14.u15.TestTurn_3_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i7.u22.TestTurn_0_2>=1)&&(i7.u20.Turn_2_1>=1)))||((i17.u23.TestTurn_4_3>=1)&&(i17.u87.Turn_3_1>=1)))||((i14.u15.TestTurn_3_0>=1)&&(i14.u66.Turn_0_2>=1)))||((i17.u23.TestTurn_4_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i14.u15.TestTurn_3_0>=1)&&(i14.u66.Turn_0_0>=1)))||((i14.u15.TestTurn_3_0>=1)&&(i14.u66.Turn_0_1>=1)))||((i17.u25.TestTurn_2_3>=1)&&(i17.u87.Turn_3_0>=1)))||((i7.u22.TestTurn_0_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u17.TestTurn_1_0>=1)&&(i14.u66.Turn_0_2>=1)))||((i14.u17.TestTurn_1_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i14.u16.TestTurn_4_0>=1)&&(i14.u66.Turn_0_1>=1)))||((i14.u17.TestTurn_1_0>=1)&&(i14.u66.Turn_0_0>=1)))||((i17.u25.TestTurn_2_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u17.TestTurn_1_0>=1)&&(i14.u66.Turn_0_3>=1)))||((i17.u25.TestTurn_2_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i17.u25.TestTurn_2_3>=1)&&(i17.u87.Turn_3_1>=1)))||((i14.u16.TestTurn_4_0>=1)&&(i14.u66.Turn_0_2>=1)))||((i14.u16.TestTurn_4_0>=1)&&(i14.u66.Turn_0_0>=1)))||((i17.u23.TestTurn_4_3>=1)&&(i17.u87.Turn_3_0>=1)))||((i14.u16.TestTurn_4_0>=1)&&(i14.u66.Turn_0_3>=1)))||((i17.u87.TestTurn_0_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i7.u20.TestTurn_3_2>=1)&&(i7.u20.Turn_2_2>=1)))||((i4.u14.TestTurn_1_1>=1)&&(i4.u14.Turn_1_0>=1)))||((i7.u19.TestTurn_4_2>=1)&&(i7.u20.Turn_2_1>=1)))||((i7.u20.TestTurn_3_2>=1)&&(i7.u20.Turn_2_0>=1)))||((i17.u87.TestTurn_0_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i17.u18.TestTurn_1_3>=1)&&(i17.u87.Turn_3_0>=1)))||((i7.u19.TestTurn_4_2>=1)&&(i7.u20.Turn_2_0>=1)))||((i4.u67.TestTurn_0_1>=1)&&(i4.u14.Turn_1_1>=1)))||((i7.u20.TestTurn_3_2>=1)&&(i7.u20.Turn_2_1>=1)))||((i14.u66.TestTurn_2_0>=1)&&(i14.u66.Turn_0_1>=1)))||((i17.u87.TestTurn_0_3>=1)&&(i17.u87.Turn_3_2>=1)))||((i7.u19.TestTurn_4_2>=1)&&(i7.u20.Turn_2_3>=1)))||((i17.u87.TestTurn_0_3>=1)&&(i17.u87.Turn_3_1>=1)))||((i7.u19.TestTurn_4_2>=1)&&(i7.u20.Turn_2_2>=1)))||((i4.u83.TestTurn_4_1>=1)&&(i4.u14.Turn_1_0>=1)))||((i4.u67.TestTurn_0_1>=1)&&(i4.u14.Turn_1_3>=1)))||((i17.u24.TestTurn_3_3>=1)&&(i17.u87.Turn_3_1>=1)))||((i14.u66.TestTurn_2_0>=1)&&(i14.u66.Turn_0_3>=1)))||((i4.u14.TestTurn_1_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i4.u83.TestTurn_4_1>=1)&&(i4.u14.Turn_1_1>=1)))||((i4.u67.TestTurn_0_1>=1)&&(i4.u14.Turn_1_2>=1)))||((i14.u66.TestTurn_2_0>=1)&&(i14.u66.Turn_0_0>=1)))||((i7.u20.TestTurn_3_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i4.u83.TestTurn_4_1>=1)&&(i4.u14.Turn_1_2>=1)))||((i4.u67.TestTurn_0_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i4.u14.TestTurn_1_1>=1)&&(i4.u14.Turn_1_2>=1)))||((i17.u24.TestTurn_3_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u66.TestTurn_2_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i4.u83.TestTurn_4_1>=1)&&(i4.u14.Turn_1_3>=1)))||((i17.u24.TestTurn_3_3>=1)&&(i17.u87.Turn_3_2>=1)))||((i4.u14.TestTurn_1_1>=1)&&(i4.u14.Turn_1_3>=1)))||((i4.u13.TestTurn_3_1>=1)&&(i4.u14.Turn_1_2>=1)))||((i7.u82.TestTurn_2_2>=1)&&(i7.u20.Turn_2_0>=1)))||((i7.u21.TestTurn_1_2>=1)&&(i7.u20.Turn_2_2>=1)))||((i17.u24.TestTurn_3_3>=1)&&(i17.u87.Turn_3_0>=1)))||((i7.u21.TestTurn_1_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i7.u82.TestTurn_2_2>=1)&&(i7.u20.Turn_2_1>=1)))||((i4.u12.TestTurn_2_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i4.u13.TestTurn_3_1>=1)&&(i4.u14.Turn_1_0>=1)))||((i4.u13.TestTurn_3_1>=1)&&(i4.u14.Turn_1_1>=1)))||((i7.u82.TestTurn_2_2>=1)&&(i7.u20.Turn_2_3>=1)))||((i17.u18.TestTurn_1_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i4.u12.TestTurn_2_1>=1)&&(i4.u14.Turn_1_3>=1)))||((i7.u82.TestTurn_2_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u65.TestTurn_0_0>=1)&&(i14.u66.Turn_0_1>=1)))||((i4.u12.TestTurn_2_1>=1)&&(i4.u14.Turn_1_1>=1)))||((i7.u21.TestTurn_1_2>=1)&&(i7.u20.Turn_2_0>=1)))||((i14.u65.TestTurn_0_0>=1)&&(i14.u66.Turn_0_3>=1)))||((i17.u18.TestTurn_1_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i4.u13.TestTurn_3_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i14.u65.TestTurn_0_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i4.u12.TestTurn_2_1>=1)&&(i4.u14.Turn_1_0>=1)))||((i17.u18.TestTurn_1_3>=1)&&(i17.u87.Turn_3_2>=1)))||((i14.u65.TestTurn_0_0>=1)&&(i14.u66.Turn_0_2>=1)))||((i7.u21.TestTurn_1_2>=1)&&(i7.u20.Turn_2_3>=1)))&&(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i4.u14.Turn_1_3>=1)&&(i4.u12.AskForSection_2_1>=1))||((i7.u22.AskForSection_0_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i4.u12.AskForSection_2_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i7.u82.AskForSection_2_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i14.u17.AskForSection_1_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u23.AskForSection_4_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i17.u87.AskForSection_0_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i17.u23.AskForSection_4_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i7.u19.AskForSection_4_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u13.AskForSection_3_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i14.u15.AskForSection_3_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i4.u14.AskForSection_1_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i7.u20.AskForSection_3_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i17.u18.AskForSection_1_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i14.u66.AskForSection_2_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u18.AskForSection_1_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i7.u21.AskForSection_1_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u67.AskForSection_0_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i17.u24.AskForSection_3_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i17.u24.AskForSection_3_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i14.u65.AskForSection_0_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i17.u87.AskForSection_0_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i14.u16.AskForSection_4_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i4.u83.AskForSection_4_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i17.u25.AskForSection_2_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i17.u25.AskForSection_2_3>=1)&&(i17.u87.Turn_3_3>=1))))")))))))
Formula 0 simplified : !X(FX("(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i4.u14.Turn_1_3>=1)&&(i4.u12.AskForSection_2_1>=1))||((i7.u22.AskForSection_0_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i4.u12.AskForSection_2_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i7.u82.AskForSection_2_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i14.u17.AskForSection_1_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u23.AskForSection_4_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i17.u87.AskForSection_0_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i17.u23.AskForSection_4_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i7.u19.AskForSection_4_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u13.AskForSection_3_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i14.u15.AskForSection_3_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i4.u14.AskForSection_1_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i7.u20.AskForSection_3_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i17.u18.AskForSection_1_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i14.u66.AskForSection_2_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u18.AskForSection_1_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i7.u21.AskForSection_1_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u67.AskForSection_0_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i17.u24.AskForSection_3_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i17.u24.AskForSection_3_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i14.u65.AskForSection_0_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i17.u87.AskForSection_0_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i14.u16.AskForSection_4_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i4.u83.AskForSection_4_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i17.u25.AskForSection_2_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i17.u25.AskForSection_2_3>=1)&&(i17.u87.Turn_3_3>=1)))" & X"(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i4.u14.Turn_1_3>=1)&&(i4.u12.AskForSection_2_1>=1))||((i7.u22.AskForSection_0_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i4.u12.AskForSection_2_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i7.u82.AskForSection_2_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i14.u17.AskForSection_1_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u23.AskForSection_4_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i17.u87.AskForSection_0_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i17.u23.AskForSection_4_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i7.u19.AskForSection_4_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u13.AskForSection_3_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i14.u15.AskForSection_3_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i4.u14.AskForSection_1_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i7.u20.AskForSection_3_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i17.u18.AskForSection_1_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i14.u66.AskForSection_2_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u18.AskForSection_1_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i7.u21.AskForSection_1_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u67.AskForSection_0_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i17.u24.AskForSection_3_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i17.u24.AskForSection_3_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i14.u65.AskForSection_0_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i17.u87.AskForSection_0_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i14.u16.AskForSection_4_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i4.u83.AskForSection_4_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i17.u25.AskForSection_2_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i17.u25.AskForSection_2_3>=1)&&(i17.u87.Turn_3_3>=1)))") & GXG"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i7.u22.TestTurn_0_2>=1)&&(i7.u20.Turn_2_3>=1))||((i7.u22.TestTurn_0_2>=1)&&(i7.u20.Turn_2_2>=1)))||((i17.u23.TestTurn_4_3>=1)&&(i17.u87.Turn_3_2>=1)))||((i14.u15.TestTurn_3_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i7.u22.TestTurn_0_2>=1)&&(i7.u20.Turn_2_1>=1)))||((i17.u23.TestTurn_4_3>=1)&&(i17.u87.Turn_3_1>=1)))||((i14.u15.TestTurn_3_0>=1)&&(i14.u66.Turn_0_2>=1)))||((i17.u23.TestTurn_4_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i14.u15.TestTurn_3_0>=1)&&(i14.u66.Turn_0_0>=1)))||((i14.u15.TestTurn_3_0>=1)&&(i14.u66.Turn_0_1>=1)))||((i17.u25.TestTurn_2_3>=1)&&(i17.u87.Turn_3_0>=1)))||((i7.u22.TestTurn_0_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u17.TestTurn_1_0>=1)&&(i14.u66.Turn_0_2>=1)))||((i14.u17.TestTurn_1_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i14.u16.TestTurn_4_0>=1)&&(i14.u66.Turn_0_1>=1)))||((i14.u17.TestTurn_1_0>=1)&&(i14.u66.Turn_0_0>=1)))||((i17.u25.TestTurn_2_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u17.TestTurn_1_0>=1)&&(i14.u66.Turn_0_3>=1)))||((i17.u25.TestTurn_2_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i17.u25.TestTurn_2_3>=1)&&(i17.u87.Turn_3_1>=1)))||((i14.u16.TestTurn_4_0>=1)&&(i14.u66.Turn_0_2>=1)))||((i14.u16.TestTurn_4_0>=1)&&(i14.u66.Turn_0_0>=1)))||((i17.u23.TestTurn_4_3>=1)&&(i17.u87.Turn_3_0>=1)))||((i14.u16.TestTurn_4_0>=1)&&(i14.u66.Turn_0_3>=1)))||((i17.u87.TestTurn_0_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i7.u20.TestTurn_3_2>=1)&&(i7.u20.Turn_2_2>=1)))||((i4.u14.TestTurn_1_1>=1)&&(i4.u14.Turn_1_0>=1)))||((i7.u19.TestTurn_4_2>=1)&&(i7.u20.Turn_2_1>=1)))||((i7.u20.TestTurn_3_2>=1)&&(i7.u20.Turn_2_0>=1)))||((i17.u87.TestTurn_0_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i17.u18.TestTurn_1_3>=1)&&(i17.u87.Turn_3_0>=1)))||((i7.u19.TestTurn_4_2>=1)&&(i7.u20.Turn_2_0>=1)))||((i4.u67.TestTurn_0_1>=1)&&(i4.u14.Turn_1_1>=1)))||((i7.u20.TestTurn_3_2>=1)&&(i7.u20.Turn_2_1>=1)))||((i14.u66.TestTurn_2_0>=1)&&(i14.u66.Turn_0_1>=1)))||((i17.u87.TestTurn_0_3>=1)&&(i17.u87.Turn_3_2>=1)))||((i7.u19.TestTurn_4_2>=1)&&(i7.u20.Turn_2_3>=1)))||((i17.u87.TestTurn_0_3>=1)&&(i17.u87.Turn_3_1>=1)))||((i7.u19.TestTurn_4_2>=1)&&(i7.u20.Turn_2_2>=1)))||((i4.u83.TestTurn_4_1>=1)&&(i4.u14.Turn_1_0>=1)))||((i4.u67.TestTurn_0_1>=1)&&(i4.u14.Turn_1_3>=1)))||((i17.u24.TestTurn_3_3>=1)&&(i17.u87.Turn_3_1>=1)))||((i14.u66.TestTurn_2_0>=1)&&(i14.u66.Turn_0_3>=1)))||((i4.u14.TestTurn_1_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i4.u83.TestTurn_4_1>=1)&&(i4.u14.Turn_1_1>=1)))||((i4.u67.TestTurn_0_1>=1)&&(i4.u14.Turn_1_2>=1)))||((i14.u66.TestTurn_2_0>=1)&&(i14.u66.Turn_0_0>=1)))||((i7.u20.TestTurn_3_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i4.u83.TestTurn_4_1>=1)&&(i4.u14.Turn_1_2>=1)))||((i4.u67.TestTurn_0_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i4.u14.TestTurn_1_1>=1)&&(i4.u14.Turn_1_2>=1)))||((i17.u24.TestTurn_3_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u66.TestTurn_2_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i4.u83.TestTurn_4_1>=1)&&(i4.u14.Turn_1_3>=1)))||((i17.u24.TestTurn_3_3>=1)&&(i17.u87.Turn_3_2>=1)))||((i4.u14.TestTurn_1_1>=1)&&(i4.u14.Turn_1_3>=1)))||((i4.u13.TestTurn_3_1>=1)&&(i4.u14.Turn_1_2>=1)))||((i7.u82.TestTurn_2_2>=1)&&(i7.u20.Turn_2_0>=1)))||((i7.u21.TestTurn_1_2>=1)&&(i7.u20.Turn_2_2>=1)))||((i17.u24.TestTurn_3_3>=1)&&(i17.u87.Turn_3_0>=1)))||((i7.u21.TestTurn_1_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i7.u82.TestTurn_2_2>=1)&&(i7.u20.Turn_2_1>=1)))||((i4.u12.TestTurn_2_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i4.u13.TestTurn_3_1>=1)&&(i4.u14.Turn_1_0>=1)))||((i4.u13.TestTurn_3_1>=1)&&(i4.u14.Turn_1_1>=1)))||((i7.u82.TestTurn_2_2>=1)&&(i7.u20.Turn_2_3>=1)))||((i17.u18.TestTurn_1_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i4.u12.TestTurn_2_1>=1)&&(i4.u14.Turn_1_3>=1)))||((i7.u82.TestTurn_2_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u65.TestTurn_0_0>=1)&&(i14.u66.Turn_0_1>=1)))||((i4.u12.TestTurn_2_1>=1)&&(i4.u14.Turn_1_1>=1)))||((i7.u21.TestTurn_1_2>=1)&&(i7.u20.Turn_2_0>=1)))||((i14.u65.TestTurn_0_0>=1)&&(i14.u66.Turn_0_3>=1)))||((i17.u18.TestTurn_1_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i4.u13.TestTurn_3_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i14.u65.TestTurn_0_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i4.u12.TestTurn_2_1>=1)&&(i4.u14.Turn_1_0>=1)))||((i17.u18.TestTurn_1_3>=1)&&(i17.u87.Turn_3_2>=1)))||((i14.u65.TestTurn_0_0>=1)&&(i14.u66.Turn_0_2>=1)))||((i7.u21.TestTurn_1_2>=1)&&(i7.u20.Turn_2_3>=1)))&&(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i4.u14.Turn_1_3>=1)&&(i4.u12.AskForSection_2_1>=1))||((i7.u22.AskForSection_0_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i4.u12.AskForSection_2_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i7.u82.AskForSection_2_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i14.u17.AskForSection_1_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u23.AskForSection_4_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i17.u87.AskForSection_0_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i17.u23.AskForSection_4_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i7.u19.AskForSection_4_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u13.AskForSection_3_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i14.u15.AskForSection_3_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i4.u14.AskForSection_1_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i7.u20.AskForSection_3_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i17.u18.AskForSection_1_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i14.u66.AskForSection_2_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u18.AskForSection_1_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i7.u21.AskForSection_1_2>=1)&&(i7.u20.Turn_2_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u67.AskForSection_0_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i17.u24.AskForSection_3_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u67.AskForSection_0_1>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u13.AskForSection_3_1>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u18.AskForSection_1_3>=1)))||((i17.u24.AskForSection_3_3>=1)&&(i17.u87.Turn_3_3>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i14.u65.AskForSection_0_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u24.AskForSection_3_3>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u15.AskForSection_3_0>=1)))||((i4.u14.Turn_1_3>=1)&&(i4.u14.AskForSection_1_1>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u19.AskForSection_4_2>=1)))||((i14.u66.Turn_0_2>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i17.u87.Turn_3_1>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i7.u20.Turn_2_3>=1)&&(i7.u82.AskForSection_2_2>=1)))||((i4.u14.Turn_1_0>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i7.u20.Turn_2_1>=1)&&(i7.u22.AskForSection_0_2>=1)))||((i7.u20.Turn_2_0>=1)&&(i7.u20.AskForSection_3_2>=1)))||((i4.u14.Turn_1_2>=1)&&(i4.u83.AskForSection_4_1>=1)))||((i17.u87.AskForSection_0_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i14.u66.Turn_0_0>=1)&&(i14.u17.AskForSection_1_0>=1)))||((i14.u16.AskForSection_4_0>=1)&&(i14.u66.Turn_0_4>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u23.AskForSection_4_3>=1)))||((i7.u20.Turn_2_2>=1)&&(i7.u21.AskForSection_1_2>=1)))||((i4.u14.Turn_1_1>=1)&&(i4.u12.AskForSection_2_1>=1)))||((i14.u66.Turn_0_3>=1)&&(i14.u66.AskForSection_2_0>=1)))||((i17.u87.Turn_3_0>=1)&&(i17.u87.AskForSection_0_3>=1)))||((i17.u87.Turn_3_2>=1)&&(i17.u25.AskForSection_2_3>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u65.AskForSection_0_0>=1)))||((i4.u83.AskForSection_4_1>=1)&&(i4.u14.Turn_1_4>=1)))||((i14.u66.Turn_0_1>=1)&&(i14.u16.AskForSection_4_0>=1)))||((i17.u25.AskForSection_2_3>=1)&&(i17.u87.Turn_3_4>=1)))||((i17.u25.AskForSection_2_3>=1)&&(i17.u87.Turn_3_3>=1))))")
built 107 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 34 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 34 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 43 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 43 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
[2020-05-21 01:26:08] [INFO ] Proved 480 variables to be positive in 709 ms
[2020-05-21 01:26:08] [INFO ] Computing symmetric may disable matrix : 690 transitions.
[2020-05-21 01:26:08] [INFO ] Computation of disable matrix completed :0/690 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:26:08] [INFO ] Computation of Complete disable matrix. took 60 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:26:08] [INFO ] Computing symmetric may enable matrix : 690 transitions.
[2020-05-21 01:26:08] [INFO ] Computation of Complete enable matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:26:32] [INFO ] Computing symmetric co enabling matrix : 690 transitions.
[2020-05-21 01:26:32] [INFO ] Computation of co-enabling matrix(0/690) took 69 ms. Total solver calls (SAT/UNSAT): 137(0/137)
[2020-05-21 01:26:35] [INFO ] Computation of co-enabling matrix(35/690) took 3116 ms. Total solver calls (SAT/UNSAT): 4820(0/4820)
[2020-05-21 01:26:40] [INFO ] Computation of co-enabling matrix(64/690) took 8097 ms. Total solver calls (SAT/UNSAT): 8555(8/8547)
[2020-05-21 01:26:43] [INFO ] Computation of co-enabling matrix(67/690) took 11882 ms. Total solver calls (SAT/UNSAT): 9041(29/9012)
[2020-05-21 01:26:48] [INFO ] Computation of co-enabling matrix(71/690) took 16518 ms. Total solver calls (SAT/UNSAT): 9676(53/9623)
[2020-05-21 01:26:52] [INFO ] Computation of co-enabling matrix(73/690) took 20585 ms. Total solver calls (SAT/UNSAT): 9987(68/9919)
[2020-05-21 01:26:55] [INFO ] Computation of co-enabling matrix(75/690) took 23653 ms. Total solver calls (SAT/UNSAT): 10295(79/10216)
[2020-05-21 01:26:58] [INFO ] Computation of co-enabling matrix(78/690) took 26946 ms. Total solver calls (SAT/UNSAT): 10748(97/10651)
[2020-05-21 01:27:02] [INFO ] Computation of co-enabling matrix(88/690) took 30375 ms. Total solver calls (SAT/UNSAT): 12009(107/11902)
[2020-05-21 01:27:06] [INFO ] Computation of co-enabling matrix(92/690) took 34928 ms. Total solver calls (SAT/UNSAT): 12585(131/12454)
[2020-05-21 01:27:11] [INFO ] Computation of co-enabling matrix(95/690) took 39100 ms. Total solver calls (SAT/UNSAT): 13007(146/12861)
[2020-05-21 01:27:14] [INFO ] Computation of co-enabling matrix(123/690) took 42145 ms. Total solver calls (SAT/UNSAT): 16241(146/16095)
[2020-05-21 01:27:19] [INFO ] Computation of co-enabling matrix(146/690) took 47135 ms. Total solver calls (SAT/UNSAT): 18829(194/18635)
[2020-05-21 01:27:22] [INFO ] Computation of co-enabling matrix(147/690) took 50248 ms. Total solver calls (SAT/UNSAT): 18953(210/18743)
[2020-05-21 01:27:26] [INFO ] Computation of co-enabling matrix(148/690) took 54391 ms. Total solver calls (SAT/UNSAT): 19077(226/18851)
[2020-05-21 01:27:29] [INFO ] Computation of co-enabling matrix(187/690) took 57402 ms. Total solver calls (SAT/UNSAT): 23123(226/22897)
[2020-05-21 01:27:32] [INFO ] Computation of co-enabling matrix(221/690) took 60472 ms. Total solver calls (SAT/UNSAT): 26404(226/26178)
[2020-05-21 01:27:37] [INFO ] Computation of co-enabling matrix(242/690) took 65299 ms. Total solver calls (SAT/UNSAT): 28330(240/28090)
[2020-05-21 01:27:40] [INFO ] Computation of co-enabling matrix(244/690) took 68574 ms. Total solver calls (SAT/UNSAT): 28532(267/28265)
[2020-05-21 01:27:43] [INFO ] Computation of co-enabling matrix(245/690) took 71602 ms. Total solver calls (SAT/UNSAT): 28632(279/28353)
[2020-05-21 01:27:46] [INFO ] Computation of co-enabling matrix(246/690) took 74730 ms. Total solver calls (SAT/UNSAT): 28732(292/28440)
[2020-05-21 01:27:49] [INFO ] Computation of co-enabling matrix(248/690) took 77740 ms. Total solver calls (SAT/UNSAT): 28932(318/28614)
[2020-05-21 01:27:55] [INFO ] Computation of co-enabling matrix(250/690) took 83559 ms. Total solver calls (SAT/UNSAT): 29129(342/28787)
[2020-05-21 01:27:58] [INFO ] Computation of co-enabling matrix(252/690) took 86743 ms. Total solver calls (SAT/UNSAT): 29327(368/28959)
[2020-05-21 01:28:04] [INFO ] Computation of co-enabling matrix(254/690) took 92636 ms. Total solver calls (SAT/UNSAT): 29523(392/29131)
[2020-05-21 01:28:08] [INFO ] Computation of co-enabling matrix(255/690) took 96087 ms. Total solver calls (SAT/UNSAT): 29622(406/29216)
[2020-05-21 01:28:13] [INFO ] Computation of co-enabling matrix(257/690) took 101791 ms. Total solver calls (SAT/UNSAT): 29814(429/29385)
[2020-05-21 01:28:17] [INFO ] Computation of co-enabling matrix(259/690) took 105039 ms. Total solver calls (SAT/UNSAT): 30008(453/29555)
[2020-05-21 01:28:22] [INFO ] Computation of co-enabling matrix(261/690) took 110745 ms. Total solver calls (SAT/UNSAT): 30200(476/29724)
[2020-05-21 01:28:28] [INFO ] Computation of co-enabling matrix(264/690) took 116009 ms. Total solver calls (SAT/UNSAT): 30484(508/29976)
[2020-05-21 01:28:32] [INFO ] Computation of co-enabling matrix(267/690) took 120795 ms. Total solver calls (SAT/UNSAT): 30763(538/30225)
[2020-05-21 01:28:37] [INFO ] Computation of co-enabling matrix(269/690) took 124998 ms. Total solver calls (SAT/UNSAT): 30946(555/30391)
[2020-05-21 01:28:41] [INFO ] Computation of co-enabling matrix(272/690) took 129943 ms. Total solver calls (SAT/UNSAT): 31222(585/30637)
[2020-05-21 01:28:47] [INFO ] Computation of co-enabling matrix(281/690) took 135096 ms. Total solver calls (SAT/UNSAT): 31977(604/31373)
[2020-05-21 01:28:51] [INFO ] Computation of co-enabling matrix(283/690) took 139805 ms. Total solver calls (SAT/UNSAT): 32156(623/31533)
[2020-05-21 01:28:55] [INFO ] Computation of co-enabling matrix(286/690) took 143965 ms. Total solver calls (SAT/UNSAT): 32418(647/31771)
[2020-05-21 01:28:59] [INFO ] Computation of co-enabling matrix(288/690) took 147244 ms. Total solver calls (SAT/UNSAT): 32588(660/31928)
[2020-05-21 01:29:02] [INFO ] Computation of co-enabling matrix(291/690) took 150683 ms. Total solver calls (SAT/UNSAT): 32845(681/32164)
[2020-05-21 01:29:05] [INFO ] Computation of co-enabling matrix(294/690) took 153834 ms. Total solver calls (SAT/UNSAT): 33098(701/32397)
[2020-05-21 01:29:11] [INFO ] Computation of co-enabling matrix(298/690) took 159032 ms. Total solver calls (SAT/UNSAT): 33437(732/32705)
[2020-05-21 01:29:15] [INFO ] Computation of co-enabling matrix(300/690) took 163100 ms. Total solver calls (SAT/UNSAT): 33606(748/32858)
[2020-05-21 01:29:18] [INFO ] Computation of co-enabling matrix(302/690) took 166675 ms. Total solver calls (SAT/UNSAT): 33773(762/33011)
[2020-05-21 01:29:21] [INFO ] Computation of co-enabling matrix(306/690) took 169748 ms. Total solver calls (SAT/UNSAT): 34105(790/33315)
[2020-05-21 01:29:24] [INFO ] Computation of co-enabling matrix(307/690) took 172882 ms. Total solver calls (SAT/UNSAT): 34193(802/33391)
[2020-05-21 01:29:30] [INFO ] Computation of co-enabling matrix(309/690) took 178403 ms. Total solver calls (SAT/UNSAT): 34368(823/33545)
[2020-05-21 01:29:33] [INFO ] Computation of co-enabling matrix(311/690) took 181509 ms. Total solver calls (SAT/UNSAT): 34542(844/33698)
[2020-05-21 01:29:36] [INFO ] Computation of co-enabling matrix(313/690) took 184530 ms. Total solver calls (SAT/UNSAT): 34715(865/33850)
[2020-05-21 01:29:39] [INFO ] Computation of co-enabling matrix(315/690) took 187609 ms. Total solver calls (SAT/UNSAT): 34887(886/34001)
[2020-05-21 01:29:45] [INFO ] Computation of co-enabling matrix(317/690) took 193013 ms. Total solver calls (SAT/UNSAT): 35058(907/34151)
[2020-05-21 01:29:48] [INFO ] Computation of co-enabling matrix(319/690) took 196191 ms. Total solver calls (SAT/UNSAT): 35228(928/34300)
[2020-05-21 01:29:53] [INFO ] Computation of co-enabling matrix(322/690) took 201474 ms. Total solver calls (SAT/UNSAT): 35481(958/34523)
[2020-05-21 01:29:57] [INFO ] Computation of co-enabling matrix(326/690) took 205801 ms. Total solver calls (SAT/UNSAT): 35806(991/34815)
[2020-05-21 01:30:01] [INFO ] Computation of co-enabling matrix(329/690) took 209640 ms. Total solver calls (SAT/UNSAT): 36045(1012/35033)
[2020-05-21 01:30:06] [INFO ] Computation of co-enabling matrix(333/690) took 214251 ms. Total solver calls (SAT/UNSAT): 36366(1045/35321)
[2020-05-21 01:30:11] [INFO ] Computation of co-enabling matrix(336/690) took 219428 ms. Total solver calls (SAT/UNSAT): 36608(1072/35536)
[2020-05-21 01:30:14] [INFO ] Computation of co-enabling matrix(338/690) took 222945 ms. Total solver calls (SAT/UNSAT): 36763(1086/35677)
[2020-05-21 01:30:18] [INFO ] Computation of co-enabling matrix(342/690) took 226184 ms. Total solver calls (SAT/UNSAT): 37052(1103/35949)
[2020-05-21 01:30:21] [INFO ] Computation of co-enabling matrix(346/690) took 229558 ms. Total solver calls (SAT/UNSAT): 37337(1117/36220)
[2020-05-21 01:30:25] [INFO ] Computation of co-enabling matrix(350/690) took 233173 ms. Total solver calls (SAT/UNSAT): 37621(1133/36488)
[2020-05-21 01:30:28] [INFO ] Computation of co-enabling matrix(353/690) took 236415 ms. Total solver calls (SAT/UNSAT): 37831(1146/36685)
[2020-05-21 01:30:32] [INFO ] Computation of co-enabling matrix(355/690) took 240749 ms. Total solver calls (SAT/UNSAT): 37983(1163/36820)
[2020-05-21 01:30:36] [INFO ] Computation of co-enabling matrix(358/690) took 244769 ms. Total solver calls (SAT/UNSAT): 38206(1184/37022)
[2020-05-21 01:30:40] [INFO ] Computation of co-enabling matrix(360/690) took 248284 ms. Total solver calls (SAT/UNSAT): 38351(1197/37154)
[2020-05-21 01:30:43] [INFO ] Computation of co-enabling matrix(364/690) took 251443 ms. Total solver calls (SAT/UNSAT): 38627(1215/37412)
[2020-05-21 01:30:46] [INFO ] Computation of co-enabling matrix(378/690) took 254493 ms. Total solver calls (SAT/UNSAT): 39531(1238/38293)
[2020-05-21 01:30:50] [INFO ] Computation of co-enabling matrix(381/690) took 258270 ms. Total solver calls (SAT/UNSAT): 39732(1253/38479)
[2020-05-21 01:30:53] [INFO ] Computation of co-enabling matrix(389/690) took 261487 ms. Total solver calls (SAT/UNSAT): 40230(1265/38965)
[2020-05-21 01:30:56] [INFO ] Computation of co-enabling matrix(405/690) took 264947 ms. Total solver calls (SAT/UNSAT): 41178(1283/39895)
[2020-05-21 01:31:00] [INFO ] Computation of co-enabling matrix(410/690) took 268032 ms. Total solver calls (SAT/UNSAT): 41476(1297/40179)
[2020-05-21 01:31:03] [INFO ] Computation of co-enabling matrix(414/690) took 271368 ms. Total solver calls (SAT/UNSAT): 41719(1315/40404)
[2020-05-21 01:31:06] [INFO ] Computation of co-enabling matrix(419/690) took 274625 ms. Total solver calls (SAT/UNSAT): 42009(1330/40679)
[2020-05-21 01:31:09] [INFO ] Computation of co-enabling matrix(449/690) took 277626 ms. Total solver calls (SAT/UNSAT): 43554(1346/42208)
[2020-05-21 01:31:14] [INFO ] Computation of co-enabling matrix(498/690) took 282555 ms. Total solver calls (SAT/UNSAT): 45681(1354/44327)
[2020-05-21 01:31:18] [INFO ] Computation of co-enabling matrix(503/690) took 286119 ms. Total solver calls (SAT/UNSAT): 46057(1388/44669)
[2020-05-21 01:31:21] [INFO ] Computation of co-enabling matrix(509/690) took 289888 ms. Total solver calls (SAT/UNSAT): 46488(1427/45061)
[2020-05-21 01:31:26] [INFO ] Computation of co-enabling matrix(514/690) took 294023 ms. Total solver calls (SAT/UNSAT): 46826(1461/45365)
[2020-05-21 01:31:29] [INFO ] Computation of co-enabling matrix(516/690) took 297726 ms. Total solver calls (SAT/UNSAT): 46966(1474/45492)
[2020-05-21 01:31:33] [INFO ] Computation of co-enabling matrix(519/690) took 301389 ms. Total solver calls (SAT/UNSAT): 47169(1495/45674)
[2020-05-21 01:31:36] [INFO ] Computation of co-enabling matrix(523/690) took 304870 ms. Total solver calls (SAT/UNSAT): 47426(1521/45905)
[2020-05-21 01:31:40] [INFO ] Computation of co-enabling matrix(527/690) took 308177 ms. Total solver calls (SAT/UNSAT): 47668(1547/46121)
[2020-05-21 01:31:43] [INFO ] Computation of co-enabling matrix(531/690) took 311900 ms. Total solver calls (SAT/UNSAT): 47924(1573/46351)
[2020-05-21 01:31:47] [INFO ] Computation of co-enabling matrix(533/690) took 315401 ms. Total solver calls (SAT/UNSAT): 48060(1586/46474)
[2020-05-21 01:31:51] [INFO ] Computation of co-enabling matrix(536/690) took 319005 ms. Total solver calls (SAT/UNSAT): 48257(1607/46650)
[2020-05-21 01:31:54] [INFO ] Computation of co-enabling matrix(539/690) took 322240 ms. Total solver calls (SAT/UNSAT): 48447(1627/46820)
[2020-05-21 01:31:57] [INFO ] Computation of co-enabling matrix(541/690) took 325269 ms. Total solver calls (SAT/UNSAT): 48569(1638/46931)
[2020-05-21 01:32:00] [INFO ] Computation of co-enabling matrix(544/690) took 328925 ms. Total solver calls (SAT/UNSAT): 48739(1656/47083)
[2020-05-21 01:32:04] [INFO ] Computation of co-enabling matrix(555/690) took 332622 ms. Total solver calls (SAT/UNSAT): 49096(1669/47427)
[2020-05-21 01:32:08] [INFO ] Computation of co-enabling matrix(560/690) took 336522 ms. Total solver calls (SAT/UNSAT): 49304(1687/47617)
[2020-05-21 01:32:12] [INFO ] Computation of co-enabling matrix(563/690) took 340337 ms. Total solver calls (SAT/UNSAT): 49448(1701/47747)
[2020-05-21 01:32:15] [INFO ] Computation of co-enabling matrix(569/690) took 343469 ms. Total solver calls (SAT/UNSAT): 49714(1720/47994)
[2020-05-21 01:32:19] [INFO ] Computation of co-enabling matrix(579/690) took 347688 ms. Total solver calls (SAT/UNSAT): 50044(1737/48307)
[2020-05-21 01:32:22] [INFO ] Computation of co-enabling matrix(583/690) took 350806 ms. Total solver calls (SAT/UNSAT): 50205(1756/48449)
[2020-05-21 01:32:25] [INFO ] Computation of co-enabling matrix(588/690) took 353867 ms. Total solver calls (SAT/UNSAT): 50419(1776/48643)
[2020-05-21 01:32:29] [INFO ] Computation of co-enabling matrix(594/690) took 357524 ms. Total solver calls (SAT/UNSAT): 50659(1800/48859)
[2020-05-21 01:32:32] [INFO ] Computation of co-enabling matrix(600/690) took 360677 ms. Total solver calls (SAT/UNSAT): 50847(1811/49036)
[2020-05-21 01:32:36] [INFO ] Computation of co-enabling matrix(608/690) took 364191 ms. Total solver calls (SAT/UNSAT): 51075(1823/49252)
[2020-05-21 01:32:39] [INFO ] Computation of co-enabling matrix(615/690) took 367331 ms. Total solver calls (SAT/UNSAT): 51221(1834/49387)
[2020-05-21 01:32:42] [INFO ] Computation of co-enabling matrix(620/690) took 370909 ms. Total solver calls (SAT/UNSAT): 51347(1853/49494)
[2020-05-21 01:32:46] [INFO ] Computation of co-enabling matrix(630/690) took 374018 ms. Total solver calls (SAT/UNSAT): 51669(1893/49776)
[2020-05-21 01:32:49] [INFO ] Computation of co-enabling matrix(646/690) took 377110 ms. Total solver calls (SAT/UNSAT): 51975(1923/50052)
[2020-05-21 01:32:53] [INFO ] Computation of co-enabling matrix(658/690) took 381008 ms. Total solver calls (SAT/UNSAT): 52188(1945/50243)
[2020-05-21 01:32:56] [INFO ] Computation of co-enabling matrix(668/690) took 384949 ms. Total solver calls (SAT/UNSAT): 52338(1968/50370)
[2020-05-21 01:33:00] [INFO ] Computation of co-enabling matrix(675/690) took 388613 ms. Total solver calls (SAT/UNSAT): 52401(1981/50420)
[2020-05-21 01:33:03] [INFO ] Computation of co-enabling matrix(686/690) took 391641 ms. Total solver calls (SAT/UNSAT): 52462(1997/50465)
[2020-05-21 01:33:04] [INFO ] Computation of Finished co-enabling matrix. took 392607 ms. Total solver calls (SAT/UNSAT): 52465(2000/50465)
[2020-05-21 01:33:04] [INFO ] Computing Do-Not-Accords matrix : 690 transitions.
[2020-05-21 01:33:05] [INFO ] Computation of Completed DNA matrix. took 270 ms. Total solver calls (SAT/UNSAT): 80(0/80)
[2020-05-21 01:33:05] [INFO ] Built C files in 417449ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 10321 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 88 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(( <>(X(( X((LTLAP0==true)) ) && ( (LTLAP0==true) ))) ) && ( [](X([]((LTLAP1==true)))) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(( <>(X(( X((LTLAP0==true)) ) && ( (LTLAP0==true) ))) ) && ( [](X([]((LTLAP1==true)))) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(( <>(X(( X((LTLAP0==true)) ) && ( (LTLAP0==true) ))) ) && ( [](X([]((LTLAP1==true)))) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2020-05-21 01:52:18] [INFO ] Flatten gal took : 42 ms
[2020-05-21 01:52:18] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
[2020-05-21 01:52:18] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 13 LTL properties
Checking formula 0 : !((X((F(X((X("(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((Turn_1_3>=1)&&(AskForSection_2_1>=1))||((AskForSection_0_2>=1)&&(Turn_2_4>=1)))||((AskForSection_2_1>=1)&&(Turn_1_4>=1)))||((Turn_3_1>=1)&&(AskForSection_1_3>=1)))||((Turn_0_2>=1)&&(AskForSection_3_0>=1)))||((Turn_2_3>=1)&&(AskForSection_3_2>=1)))||((AskForSection_2_2>=1)&&(Turn_2_4>=1)))||((Turn_1_0>=1)&&(AskForSection_1_1>=1)))||((Turn_1_2>=1)&&(AskForSection_0_1>=1)))||((AskForSection_1_0>=1)&&(Turn_0_4>=1)))||((AskForSection_4_3>=1)&&(Turn_3_3>=1)))||((Turn_1_2>=1)&&(AskForSection_3_1>=1)))||((AskForSection_0_3>=1)&&(Turn_3_3>=1)))||((AskForSection_4_3>=1)&&(Turn_3_4>=1)))||((Turn_2_0>=1)&&(AskForSection_2_2>=1)))||((Turn_2_1>=1)&&(AskForSection_1_2>=1)))||((Turn_2_2>=1)&&(AskForSection_4_2>=1)))||((Turn_0_0>=1)&&(AskForSection_4_0>=1)))||((Turn_2_2>=1)&&(AskForSection_0_2>=1)))||((Turn_3_0>=1)&&(AskForSection_3_3>=1)))||((Turn_1_1>=1)&&(AskForSection_1_1>=1)))||((Turn_0_0>=1)&&(AskForSection_0_0>=1)))||((Turn_0_3>=1)&&(AskForSection_3_0>=1)))||((Turn_3_2>=1)&&(AskForSection_1_3>=1)))||((AskForSection_4_2>=1)&&(Turn_2_4>=1)))||((Turn_0_1>=1)&&(AskForSection_1_0>=1)))||((Turn_1_3>=1)&&(AskForSection_3_1>=1)))||((Turn_2_0>=1)&&(AskForSection_1_2>=1)))||((Turn_3_1>=1)&&(AskForSection_2_3>=1)))||((Turn_0_2>=1)&&(AskForSection_4_0>=1)))||((Turn_2_3>=1)&&(AskForSection_0_2>=1)))||((Turn_1_0>=1)&&(AskForSection_4_1>=1)))||((Turn_0_2>=1)&&(AskForSection_0_0>=1)))||((Turn_2_1>=1)&&(AskForSection_2_2>=1)))||((Turn_1_3>=1)&&(AskForSection_0_1>=1)))||((Turn_2_3>=1)&&(AskForSection_4_2>=1)))||((Turn_1_2>=1)&&(AskForSection_2_1>=1)))||((Turn_0_0>=1)&&(AskForSection_3_0>=1)))||((Turn_2_2>=1)&&(AskForSection_3_2>=1)))||((AskForSection_3_1>=1)&&(Turn_1_4>=1)))||((Turn_1_1>=1)&&(AskForSection_4_1>=1)))||((Turn_0_3>=1)&&(AskForSection_0_0>=1)))||((Turn_3_0>=1)&&(AskForSection_2_3>=1)))||((Turn_0_3>=1)&&(AskForSection_4_0>=1)))||((Turn_3_2>=1)&&(AskForSection_4_3>=1)))||((AskForSection_3_0>=1)&&(Turn_0_4>=1)))||((Turn_3_2>=1)&&(AskForSection_0_3>=1)))||((Turn_0_1>=1)&&(AskForSection_2_0>=1)))||((Turn_1_3>=1)&&(AskForSection_4_1>=1)))||((AskForSection_1_1>=1)&&(Turn_1_4>=1)))||((AskForSection_3_2>=1)&&(Turn_2_4>=1)))||((Turn_0_2>=1)&&(AskForSection_1_0>=1)))||((AskForSection_1_3>=1)&&(Turn_3_4>=1)))||((Turn_3_1>=1)&&(AskForSection_3_3>=1)))||((AskForSection_2_0>=1)&&(Turn_0_4>=1)))||((AskForSection_1_3>=1)&&(Turn_3_3>=1)))||((Turn_1_0>=1)&&(AskForSection_0_1>=1)))||((Turn_1_0>=1)&&(AskForSection_3_1>=1)))||((Turn_2_3>=1)&&(AskForSection_1_2>=1)))||((AskForSection_1_2>=1)&&(Turn_2_4>=1)))||((Turn_2_0>=1)&&(AskForSection_4_2>=1)))||((Turn_2_1>=1)&&(AskForSection_3_2>=1)))||((AskForSection_0_1>=1)&&(Turn_1_4>=1)))||((Turn_2_0>=1)&&(AskForSection_0_2>=1)))||((Turn_1_2>=1)&&(AskForSection_1_1>=1)))||((AskForSection_3_3>=1)&&(Turn_3_4>=1)))||((Turn_0_0>=1)&&(AskForSection_2_0>=1)))||((Turn_1_1>=1)&&(AskForSection_0_1>=1)))||((Turn_2_2>=1)&&(AskForSection_2_2>=1)))||((Turn_1_1>=1)&&(AskForSection_3_1>=1)))||((Turn_3_0>=1)&&(AskForSection_1_3>=1)))||((AskForSection_3_3>=1)&&(Turn_3_3>=1)))||((Turn_0_3>=1)&&(AskForSection_1_0>=1)))||((AskForSection_0_0>=1)&&(Turn_0_4>=1)))||((Turn_3_2>=1)&&(AskForSection_3_3>=1)))||((Turn_3_1>=1)&&(AskForSection_0_3>=1)))||((Turn_0_1>=1)&&(AskForSection_3_0>=1)))||((Turn_1_3>=1)&&(AskForSection_1_1>=1)))||((Turn_2_1>=1)&&(AskForSection_4_2>=1)))||((Turn_0_2>=1)&&(AskForSection_2_0>=1)))||((Turn_3_1>=1)&&(AskForSection_4_3>=1)))||((Turn_2_3>=1)&&(AskForSection_2_2>=1)))||((Turn_1_0>=1)&&(AskForSection_2_1>=1)))||((Turn_2_1>=1)&&(AskForSection_0_2>=1)))||((Turn_2_0>=1)&&(AskForSection_3_2>=1)))||((Turn_1_2>=1)&&(AskForSection_4_1>=1)))||((AskForSection_0_3>=1)&&(Turn_3_4>=1)))||((Turn_0_0>=1)&&(AskForSection_1_0>=1)))||((AskForSection_4_0>=1)&&(Turn_0_4>=1)))||((Turn_3_0>=1)&&(AskForSection_4_3>=1)))||((Turn_2_2>=1)&&(AskForSection_1_2>=1)))||((Turn_1_1>=1)&&(AskForSection_2_1>=1)))||((Turn_0_3>=1)&&(AskForSection_2_0>=1)))||((Turn_3_0>=1)&&(AskForSection_0_3>=1)))||((Turn_3_2>=1)&&(AskForSection_2_3>=1)))||((Turn_0_1>=1)&&(AskForSection_0_0>=1)))||((AskForSection_4_1>=1)&&(Turn_1_4>=1)))||((Turn_0_1>=1)&&(AskForSection_4_0>=1)))||((AskForSection_2_3>=1)&&(Turn_3_4>=1)))||((AskForSection_2_3>=1)&&(Turn_3_3>=1)))"))&&("(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((Turn_1_3>=1)&&(AskForSection_2_1>=1))||((AskForSection_0_2>=1)&&(Turn_2_4>=1)))||((AskForSection_2_1>=1)&&(Turn_1_4>=1)))||((Turn_3_1>=1)&&(AskForSection_1_3>=1)))||((Turn_0_2>=1)&&(AskForSection_3_0>=1)))||((Turn_2_3>=1)&&(AskForSection_3_2>=1)))||((AskForSection_2_2>=1)&&(Turn_2_4>=1)))||((Turn_1_0>=1)&&(AskForSection_1_1>=1)))||((Turn_1_2>=1)&&(AskForSection_0_1>=1)))||((AskForSection_1_0>=1)&&(Turn_0_4>=1)))||((AskForSection_4_3>=1)&&(Turn_3_3>=1)))||((Turn_1_2>=1)&&(AskForSection_3_1>=1)))||((AskForSection_0_3>=1)&&(Turn_3_3>=1)))||((AskForSection_4_3>=1)&&(Turn_3_4>=1)))||((Turn_2_0>=1)&&(AskForSection_2_2>=1)))||((Turn_2_1>=1)&&(AskForSection_1_2>=1)))||((Turn_2_2>=1)&&(AskForSection_4_2>=1)))||((Turn_0_0>=1)&&(AskForSection_4_0>=1)))||((Turn_2_2>=1)&&(AskForSection_0_2>=1)))||((Turn_3_0>=1)&&(AskForSection_3_3>=1)))||((Turn_1_1>=1)&&(AskForSection_1_1>=1)))||((Turn_0_0>=1)&&(AskForSection_0_0>=1)))||((Turn_0_3>=1)&&(AskForSection_3_0>=1)))||((Turn_3_2>=1)&&(AskForSection_1_3>=1)))||((AskForSection_4_2>=1)&&(Turn_2_4>=1)))||((Turn_0_1>=1)&&(AskForSection_1_0>=1)))||((Turn_1_3>=1)&&(AskForSection_3_1>=1)))||((Turn_2_0>=1)&&(AskForSection_1_2>=1)))||((Turn_3_1>=1)&&(AskForSection_2_3>=1)))||((Turn_0_2>=1)&&(AskForSection_4_0>=1)))||((Turn_2_3>=1)&&(AskForSection_0_2>=1)))||((Turn_1_0>=1)&&(AskForSection_4_1>=1)))||((Turn_0_2>=1)&&(AskForSection_0_0>=1)))||((Turn_2_1>=1)&&(AskForSection_2_2>=1)))||((Turn_1_3>=1)&&(AskForSection_0_1>=1)))||((Turn_2_3>=1)&&(AskForSection_4_2>=1)))||((Turn_1_2>=1)&&(AskForSection_2_1>=1)))||((Turn_0_0>=1)&&(AskForSection_3_0>=1)))||((Turn_2_2>=1)&&(AskForSection_3_2>=1)))||((AskForSection_3_1>=1)&&(Turn_1_4>=1)))||((Turn_1_1>=1)&&(AskForSection_4_1>=1)))||((Turn_0_3>=1)&&(AskForSection_0_0>=1)))||((Turn_3_0>=1)&&(AskForSection_2_3>=1)))||((Turn_0_3>=1)&&(AskForSection_4_0>=1)))||((Turn_3_2>=1)&&(AskForSection_4_3>=1)))||((AskForSection_3_0>=1)&&(Turn_0_4>=1)))||((Turn_3_2>=1)&&(AskForSection_0_3>=1)))||((Turn_0_1>=1)&&(AskForSection_2_0>=1)))||((Turn_1_3>=1)&&(AskForSection_4_1>=1)))||((AskForSection_1_1>=1)&&(Turn_1_4>=1)))||((AskForSection_3_2>=1)&&(Turn_2_4>=1)))||((Turn_0_2>=1)&&(AskForSection_1_0>=1)))||((AskForSection_1_3>=1)&&(Turn_3_4>=1)))||((Turn_3_1>=1)&&(AskForSection_3_3>=1)))||((AskForSection_2_0>=1)&&(Turn_0_4>=1)))||((AskForSection_1_3>=1)&&(Turn_3_3>=1)))||((Turn_1_0>=1)&&(AskForSection_0_1>=1)))||((Turn_1_0>=1)&&(AskForSection_3_1>=1)))||((Turn_2_3>=1)&&(AskForSection_1_2>=1)))||((AskForSection_1_2>=1)&&(Turn_2_4>=1)))||((Turn_2_0>=1)&&(AskForSection_4_2>=1)))||((Turn_2_1>=1)&&(AskForSection_3_2>=1)))||((AskForSection_0_1>=1)&&(Turn_1_4>=1)))||((Turn_2_0>=1)&&(AskForSection_0_2>=1)))||((Turn_1_2>=1)&&(AskForSection_1_1>=1)))||((AskForSection_3_3>=1)&&(Turn_3_4>=1)))||((Turn_0_0>=1)&&(AskForSection_2_0>=1)))||((Turn_1_1>=1)&&(AskForSection_0_1>=1)))||((Turn_2_2>=1)&&(AskForSection_2_2>=1)))||((Turn_1_1>=1)&&(AskForSection_3_1>=1)))||((Turn_3_0>=1)&&(AskForSection_1_3>=1)))||((AskForSection_3_3>=1)&&(Turn_3_3>=1)))||((Turn_0_3>=1)&&(AskForSection_1_0>=1)))||((AskForSection_0_0>=1)&&(Turn_0_4>=1)))||((Turn_3_2>=1)&&(AskForSection_3_3>=1)))||((Turn_3_1>=1)&&(AskForSection_0_3>=1)))||((Turn_0_1>=1)&&(AskForSection_3_0>=1)))||((Turn_1_3>=1)&&(AskForSection_1_1>=1)))||((Turn_2_1>=1)&&(AskForSection_4_2>=1)))||((Turn_0_2>=1)&&(AskForSection_2_0>=1)))||((Turn_3_1>=1)&&(AskForSection_4_3>=1)))||((Turn_2_3>=1)&&(AskForSection_2_2>=1)))||((Turn_1_0>=1)&&(AskForSection_2_1>=1)))||((Turn_2_1>=1)&&(AskForSection_0_2>=1)))||((Turn_2_0>=1)&&(AskForSection_3_2>=1)))||((Turn_1_2>=1)&&(AskForSection_4_1>=1)))||((AskForSection_0_3>=1)&&(Turn_3_4>=1)))||((Turn_0_0>=1)&&(AskForSection_1_0>=1)))||((AskForSection_4_0>=1)&&(Turn_0_4>=1)))||((Turn_3_0>=1)&&(AskForSection_4_3>=1)))||((Turn_2_2>=1)&&(AskForSection_1_2>=1)))||((Turn_1_1>=1)&&(AskForSection_2_1>=1)))||((Turn_0_3>=1)&&(AskForSection_2_0>=1)))||((Turn_3_0>=1)&&(AskForSection_0_3>=1)))||((Turn_3_2>=1)&&(AskForSection_2_3>=1)))||((Turn_0_1>=1)&&(AskForSection_0_0>=1)))||((AskForSection_4_1>=1)&&(Turn_1_4>=1)))||((Turn_0_1>=1)&&(AskForSection_4_0>=1)))||((AskForSection_2_3>=1)&&(Turn_3_4>=1)))||((AskForSection_2_3>=1)&&(Turn_3_3>=1)))"))))&&(G(X(G("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((TestTurn_0_2>=1)&&(Turn_2_3>=1))||((TestTurn_0_2>=1)&&(Turn_2_2>=1)))||((TestTurn_4_3>=1)&&(Turn_3_2>=1)))||((TestTurn_3_0>=1)&&(Turn_0_4>=1)))||((TestTurn_0_2>=1)&&(Turn_2_1>=1)))||((TestTurn_4_3>=1)&&(Turn_3_1>=1)))||((TestTurn_3_0>=1)&&(Turn_0_2>=1)))||((TestTurn_4_3>=1)&&(Turn_3_3>=1)))||((TestTurn_3_0>=1)&&(Turn_0_0>=1)))||((TestTurn_3_0>=1)&&(Turn_0_1>=1)))||((TestTurn_2_3>=1)&&(Turn_3_0>=1)))||((TestTurn_0_2>=1)&&(Turn_2_4>=1)))||((TestTurn_1_0>=1)&&(Turn_0_2>=1)))||((TestTurn_1_0>=1)&&(Turn_0_4>=1)))||((TestTurn_4_0>=1)&&(Turn_0_1>=1)))||((TestTurn_1_0>=1)&&(Turn_0_0>=1)))||((TestTurn_2_3>=1)&&(Turn_3_4>=1)))||((TestTurn_1_0>=1)&&(Turn_0_3>=1)))||((TestTurn_2_3>=1)&&(Turn_3_3>=1)))||((TestTurn_2_3>=1)&&(Turn_3_1>=1)))||((TestTurn_4_0>=1)&&(Turn_0_2>=1)))||((TestTurn_4_0>=1)&&(Turn_0_0>=1)))||((TestTurn_4_3>=1)&&(Turn_3_0>=1)))||((TestTurn_4_0>=1)&&(Turn_0_3>=1)))||((TestTurn_0_3>=1)&&(Turn_3_3>=1)))||((TestTurn_3_2>=1)&&(Turn_2_2>=1)))||((TestTurn_1_1>=1)&&(Turn_1_0>=1)))||((TestTurn_4_2>=1)&&(Turn_2_1>=1)))||((TestTurn_3_2>=1)&&(Turn_2_0>=1)))||((TestTurn_0_3>=1)&&(Turn_3_4>=1)))||((TestTurn_1_3>=1)&&(Turn_3_0>=1)))||((TestTurn_4_2>=1)&&(Turn_2_0>=1)))||((TestTurn_0_1>=1)&&(Turn_1_1>=1)))||((TestTurn_3_2>=1)&&(Turn_2_1>=1)))||((TestTurn_2_0>=1)&&(Turn_0_1>=1)))||((TestTurn_0_3>=1)&&(Turn_3_2>=1)))||((TestTurn_4_2>=1)&&(Turn_2_3>=1)))||((TestTurn_0_3>=1)&&(Turn_3_1>=1)))||((TestTurn_4_2>=1)&&(Turn_2_2>=1)))||((TestTurn_4_1>=1)&&(Turn_1_0>=1)))||((TestTurn_0_1>=1)&&(Turn_1_3>=1)))||((TestTurn_3_3>=1)&&(Turn_3_1>=1)))||((TestTurn_2_0>=1)&&(Turn_0_3>=1)))||((TestTurn_1_1>=1)&&(Turn_1_4>=1)))||((TestTurn_4_1>=1)&&(Turn_1_1>=1)))||((TestTurn_0_1>=1)&&(Turn_1_2>=1)))||((TestTurn_2_0>=1)&&(Turn_0_0>=1)))||((TestTurn_3_2>=1)&&(Turn_2_4>=1)))||((TestTurn_4_1>=1)&&(Turn_1_2>=1)))||((TestTurn_0_1>=1)&&(Turn_1_4>=1)))||((TestTurn_1_1>=1)&&(Turn_1_2>=1)))||((TestTurn_3_3>=1)&&(Turn_3_4>=1)))||((TestTurn_2_0>=1)&&(Turn_0_4>=1)))||((TestTurn_4_1>=1)&&(Turn_1_3>=1)))||((TestTurn_3_3>=1)&&(Turn_3_2>=1)))||((TestTurn_1_1>=1)&&(Turn_1_3>=1)))||((TestTurn_3_1>=1)&&(Turn_1_2>=1)))||((TestTurn_2_2>=1)&&(Turn_2_0>=1)))||((TestTurn_1_2>=1)&&(Turn_2_2>=1)))||((TestTurn_3_3>=1)&&(Turn_3_0>=1)))||((TestTurn_1_2>=1)&&(Turn_2_4>=1)))||((TestTurn_2_2>=1)&&(Turn_2_1>=1)))||((TestTurn_2_1>=1)&&(Turn_1_4>=1)))||((TestTurn_3_1>=1)&&(Turn_1_0>=1)))||((TestTurn_3_1>=1)&&(Turn_1_1>=1)))||((TestTurn_2_2>=1)&&(Turn_2_3>=1)))||((TestTurn_1_3>=1)&&(Turn_3_4>=1)))||((TestTurn_2_1>=1)&&(Turn_1_3>=1)))||((TestTurn_2_2>=1)&&(Turn_2_4>=1)))||((TestTurn_0_0>=1)&&(Turn_0_1>=1)))||((TestTurn_2_1>=1)&&(Turn_1_1>=1)))||((TestTurn_1_2>=1)&&(Turn_2_0>=1)))||((TestTurn_0_0>=1)&&(Turn_0_3>=1)))||((TestTurn_1_3>=1)&&(Turn_3_3>=1)))||((TestTurn_3_1>=1)&&(Turn_1_4>=1)))||((TestTurn_0_0>=1)&&(Turn_0_4>=1)))||((TestTurn_2_1>=1)&&(Turn_1_0>=1)))||((TestTurn_1_3>=1)&&(Turn_3_2>=1)))||((TestTurn_0_0>=1)&&(Turn_0_2>=1)))||((TestTurn_1_2>=1)&&(Turn_2_3>=1)))&&(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((Turn_1_3>=1)&&(AskForSection_2_1>=1))||((AskForSection_0_2>=1)&&(Turn_2_4>=1)))||((AskForSection_2_1>=1)&&(Turn_1_4>=1)))||((Turn_3_1>=1)&&(AskForSection_1_3>=1)))||((Turn_0_2>=1)&&(AskForSection_3_0>=1)))||((Turn_2_3>=1)&&(AskForSection_3_2>=1)))||((AskForSection_2_2>=1)&&(Turn_2_4>=1)))||((Turn_1_0>=1)&&(AskForSection_1_1>=1)))||((Turn_1_2>=1)&&(AskForSection_0_1>=1)))||((AskForSection_1_0>=1)&&(Turn_0_4>=1)))||((AskForSection_4_3>=1)&&(Turn_3_3>=1)))||((Turn_1_2>=1)&&(AskForSection_3_1>=1)))||((AskForSection_0_3>=1)&&(Turn_3_3>=1)))||((AskForSection_4_3>=1)&&(Turn_3_4>=1)))||((Turn_2_0>=1)&&(AskForSection_2_2>=1)))||((Turn_2_1>=1)&&(AskForSection_1_2>=1)))||((Turn_2_2>=1)&&(AskForSection_4_2>=1)))||((Turn_0_0>=1)&&(AskForSection_4_0>=1)))||((Turn_2_2>=1)&&(AskForSection_0_2>=1)))||((Turn_3_0>=1)&&(AskForSection_3_3>=1)))||((Turn_1_1>=1)&&(AskForSection_1_1>=1)))||((Turn_0_0>=1)&&(AskForSection_0_0>=1)))||((Turn_0_3>=1)&&(AskForSection_3_0>=1)))||((Turn_3_2>=1)&&(AskForSection_1_3>=1)))||((AskForSection_4_2>=1)&&(Turn_2_4>=1)))||((Turn_0_1>=1)&&(AskForSection_1_0>=1)))||((Turn_1_3>=1)&&(AskForSection_3_1>=1)))||((Turn_2_0>=1)&&(AskForSection_1_2>=1)))||((Turn_3_1>=1)&&(AskForSection_2_3>=1)))||((Turn_0_2>=1)&&(AskForSection_4_0>=1)))||((Turn_2_3>=1)&&(AskForSection_0_2>=1)))||((Turn_1_0>=1)&&(AskForSection_4_1>=1)))||((Turn_0_2>=1)&&(AskForSection_0_0>=1)))||((Turn_2_1>=1)&&(AskForSection_2_2>=1)))||((Turn_1_3>=1)&&(AskForSection_0_1>=1)))||((Turn_2_3>=1)&&(AskForSection_4_2>=1)))||((Turn_1_2>=1)&&(AskForSection_2_1>=1)))||((Turn_0_0>=1)&&(AskForSection_3_0>=1)))||((Turn_2_2>=1)&&(AskForSection_3_2>=1)))||((AskForSection_3_1>=1)&&(Turn_1_4>=1)))||((Turn_1_1>=1)&&(AskForSection_4_1>=1)))||((Turn_0_3>=1)&&(AskForSection_0_0>=1)))||((Turn_3_0>=1)&&(AskForSection_2_3>=1)))||((Turn_0_3>=1)&&(AskForSection_4_0>=1)))||((Turn_3_2>=1)&&(AskForSection_4_3>=1)))||((AskForSection_3_0>=1)&&(Turn_0_4>=1)))||((Turn_3_2>=1)&&(AskForSection_0_3>=1)))||((Turn_0_1>=1)&&(AskForSection_2_0>=1)))||((Turn_1_3>=1)&&(AskForSection_4_1>=1)))||((AskForSection_1_1>=1)&&(Turn_1_4>=1)))||((AskForSection_3_2>=1)&&(Turn_2_4>=1)))||((Turn_0_2>=1)&&(AskForSection_1_0>=1)))||((AskForSection_1_3>=1)&&(Turn_3_4>=1)))||((Turn_3_1>=1)&&(AskForSection_3_3>=1)))||((AskForSection_2_0>=1)&&(Turn_0_4>=1)))||((AskForSection_1_3>=1)&&(Turn_3_3>=1)))||((Turn_1_0>=1)&&(AskForSection_0_1>=1)))||((Turn_1_0>=1)&&(AskForSection_3_1>=1)))||((Turn_2_3>=1)&&(AskForSection_1_2>=1)))||((AskForSection_1_2>=1)&&(Turn_2_4>=1)))||((Turn_2_0>=1)&&(AskForSection_4_2>=1)))||((Turn_2_1>=1)&&(AskForSection_3_2>=1)))||((AskForSection_0_1>=1)&&(Turn_1_4>=1)))||((Turn_2_0>=1)&&(AskForSection_0_2>=1)))||((Turn_1_2>=1)&&(AskForSection_1_1>=1)))||((AskForSection_3_3>=1)&&(Turn_3_4>=1)))||((Turn_0_0>=1)&&(AskForSection_2_0>=1)))||((Turn_1_1>=1)&&(AskForSection_0_1>=1)))||((Turn_2_2>=1)&&(AskForSection_2_2>=1)))||((Turn_1_1>=1)&&(AskForSection_3_1>=1)))||((Turn_3_0>=1)&&(AskForSection_1_3>=1)))||((AskForSection_3_3>=1)&&(Turn_3_3>=1)))||((Turn_0_3>=1)&&(AskForSection_1_0>=1)))||((AskForSection_0_0>=1)&&(Turn_0_4>=1)))||((Turn_3_2>=1)&&(AskForSection_3_3>=1)))||((Turn_3_1>=1)&&(AskForSection_0_3>=1)))||((Turn_0_1>=1)&&(AskForSection_3_0>=1)))||((Turn_1_3>=1)&&(AskForSection_1_1>=1)))||((Turn_2_1>=1)&&(AskForSection_4_2>=1)))||((Turn_0_2>=1)&&(AskForSection_2_0>=1)))||((Turn_3_1>=1)&&(AskForSection_4_3>=1)))||((Turn_2_3>=1)&&(AskForSection_2_2>=1)))||((Turn_1_0>=1)&&(AskForSection_2_1>=1)))||((Turn_2_1>=1)&&(AskForSection_0_2>=1)))||((Turn_2_0>=1)&&(AskForSection_3_2>=1)))||((Turn_1_2>=1)&&(AskForSection_4_1>=1)))||((AskForSection_0_3>=1)&&(Turn_3_4>=1)))||((Turn_0_0>=1)&&(AskForSection_1_0>=1)))||((AskForSection_4_0>=1)&&(Turn_0_4>=1)))||((Turn_3_0>=1)&&(AskForSection_4_3>=1)))||((Turn_2_2>=1)&&(AskForSection_1_2>=1)))||((Turn_1_1>=1)&&(AskForSection_2_1>=1)))||((Turn_0_3>=1)&&(AskForSection_2_0>=1)))||((Turn_3_0>=1)&&(AskForSection_0_3>=1)))||((Turn_3_2>=1)&&(AskForSection_2_3>=1)))||((Turn_0_1>=1)&&(AskForSection_0_0>=1)))||((AskForSection_4_1>=1)&&(Turn_1_4>=1)))||((Turn_0_1>=1)&&(AskForSection_4_0>=1)))||((AskForSection_2_3>=1)&&(Turn_3_4>=1)))||((AskForSection_2_3>=1)&&(Turn_3_3>=1))))")))))))
Formula 0 simplified : !X(FX("(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((Turn_1_3>=1)&&(AskForSection_2_1>=1))||((AskForSection_0_2>=1)&&(Turn_2_4>=1)))||((AskForSection_2_1>=1)&&(Turn_1_4>=1)))||((Turn_3_1>=1)&&(AskForSection_1_3>=1)))||((Turn_0_2>=1)&&(AskForSection_3_0>=1)))||((Turn_2_3>=1)&&(AskForSection_3_2>=1)))||((AskForSection_2_2>=1)&&(Turn_2_4>=1)))||((Turn_1_0>=1)&&(AskForSection_1_1>=1)))||((Turn_1_2>=1)&&(AskForSection_0_1>=1)))||((AskForSection_1_0>=1)&&(Turn_0_4>=1)))||((AskForSection_4_3>=1)&&(Turn_3_3>=1)))||((Turn_1_2>=1)&&(AskForSection_3_1>=1)))||((AskForSection_0_3>=1)&&(Turn_3_3>=1)))||((AskForSection_4_3>=1)&&(Turn_3_4>=1)))||((Turn_2_0>=1)&&(AskForSection_2_2>=1)))||((Turn_2_1>=1)&&(AskForSection_1_2>=1)))||((Turn_2_2>=1)&&(AskForSection_4_2>=1)))||((Turn_0_0>=1)&&(AskForSection_4_0>=1)))||((Turn_2_2>=1)&&(AskForSection_0_2>=1)))||((Turn_3_0>=1)&&(AskForSection_3_3>=1)))||((Turn_1_1>=1)&&(AskForSection_1_1>=1)))||((Turn_0_0>=1)&&(AskForSection_0_0>=1)))||((Turn_0_3>=1)&&(AskForSection_3_0>=1)))||((Turn_3_2>=1)&&(AskForSection_1_3>=1)))||((AskForSection_4_2>=1)&&(Turn_2_4>=1)))||((Turn_0_1>=1)&&(AskForSection_1_0>=1)))||((Turn_1_3>=1)&&(AskForSection_3_1>=1)))||((Turn_2_0>=1)&&(AskForSection_1_2>=1)))||((Turn_3_1>=1)&&(AskForSection_2_3>=1)))||((Turn_0_2>=1)&&(AskForSection_4_0>=1)))||((Turn_2_3>=1)&&(AskForSection_0_2>=1)))||((Turn_1_0>=1)&&(AskForSection_4_1>=1)))||((Turn_0_2>=1)&&(AskForSection_0_0>=1)))||((Turn_2_1>=1)&&(AskForSection_2_2>=1)))||((Turn_1_3>=1)&&(AskForSection_0_1>=1)))||((Turn_2_3>=1)&&(AskForSection_4_2>=1)))||((Turn_1_2>=1)&&(AskForSection_2_1>=1)))||((Turn_0_0>=1)&&(AskForSection_3_0>=1)))||((Turn_2_2>=1)&&(AskForSection_3_2>=1)))||((AskForSection_3_1>=1)&&(Turn_1_4>=1)))||((Turn_1_1>=1)&&(AskForSection_4_1>=1)))||((Turn_0_3>=1)&&(AskForSection_0_0>=1)))||((Turn_3_0>=1)&&(AskForSection_2_3>=1)))||((Turn_0_3>=1)&&(AskForSection_4_0>=1)))||((Turn_3_2>=1)&&(AskForSection_4_3>=1)))||((AskForSection_3_0>=1)&&(Turn_0_4>=1)))||((Turn_3_2>=1)&&(AskForSection_0_3>=1)))||((Turn_0_1>=1)&&(AskForSection_2_0>=1)))||((Turn_1_3>=1)&&(AskForSection_4_1>=1)))||((AskForSection_1_1>=1)&&(Turn_1_4>=1)))||((AskForSection_3_2>=1)&&(Turn_2_4>=1)))||((Turn_0_2>=1)&&(AskForSection_1_0>=1)))||((AskForSection_1_3>=1)&&(Turn_3_4>=1)))||((Turn_3_1>=1)&&(AskForSection_3_3>=1)))||((AskForSection_2_0>=1)&&(Turn_0_4>=1)))||((AskForSection_1_3>=1)&&(Turn_3_3>=1)))||((Turn_1_0>=1)&&(AskForSection_0_1>=1)))||((Turn_1_0>=1)&&(AskForSection_3_1>=1)))||((Turn_2_3>=1)&&(AskForSection_1_2>=1)))||((AskForSection_1_2>=1)&&(Turn_2_4>=1)))||((Turn_2_0>=1)&&(AskForSection_4_2>=1)))||((Turn_2_1>=1)&&(AskForSection_3_2>=1)))||((AskForSection_0_1>=1)&&(Turn_1_4>=1)))||((Turn_2_0>=1)&&(AskForSection_0_2>=1)))||((Turn_1_2>=1)&&(AskForSection_1_1>=1)))||((AskForSection_3_3>=1)&&(Turn_3_4>=1)))||((Turn_0_0>=1)&&(AskForSection_2_0>=1)))||((Turn_1_1>=1)&&(AskForSection_0_1>=1)))||((Turn_2_2>=1)&&(AskForSection_2_2>=1)))||((Turn_1_1>=1)&&(AskForSection_3_1>=1)))||((Turn_3_0>=1)&&(AskForSection_1_3>=1)))||((AskForSection_3_3>=1)&&(Turn_3_3>=1)))||((Turn_0_3>=1)&&(AskForSection_1_0>=1)))||((AskForSection_0_0>=1)&&(Turn_0_4>=1)))||((Turn_3_2>=1)&&(AskForSection_3_3>=1)))||((Turn_3_1>=1)&&(AskForSection_0_3>=1)))||((Turn_0_1>=1)&&(AskForSection_3_0>=1)))||((Turn_1_3>=1)&&(AskForSection_1_1>=1)))||((Turn_2_1>=1)&&(AskForSection_4_2>=1)))||((Turn_0_2>=1)&&(AskForSection_2_0>=1)))||((Turn_3_1>=1)&&(AskForSection_4_3>=1)))||((Turn_2_3>=1)&&(AskForSection_2_2>=1)))||((Turn_1_0>=1)&&(AskForSection_2_1>=1)))||((Turn_2_1>=1)&&(AskForSection_0_2>=1)))||((Turn_2_0>=1)&&(AskForSection_3_2>=1)))||((Turn_1_2>=1)&&(AskForSection_4_1>=1)))||((AskForSection_0_3>=1)&&(Turn_3_4>=1)))||((Turn_0_0>=1)&&(AskForSection_1_0>=1)))||((AskForSection_4_0>=1)&&(Turn_0_4>=1)))||((Turn_3_0>=1)&&(AskForSection_4_3>=1)))||((Turn_2_2>=1)&&(AskForSection_1_2>=1)))||((Turn_1_1>=1)&&(AskForSection_2_1>=1)))||((Turn_0_3>=1)&&(AskForSection_2_0>=1)))||((Turn_3_0>=1)&&(AskForSection_0_3>=1)))||((Turn_3_2>=1)&&(AskForSection_2_3>=1)))||((Turn_0_1>=1)&&(AskForSection_0_0>=1)))||((AskForSection_4_1>=1)&&(Turn_1_4>=1)))||((Turn_0_1>=1)&&(AskForSection_4_0>=1)))||((AskForSection_2_3>=1)&&(Turn_3_4>=1)))||((AskForSection_2_3>=1)&&(Turn_3_3>=1)))" & X"(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((Turn_1_3>=1)&&(AskForSection_2_1>=1))||((AskForSection_0_2>=1)&&(Turn_2_4>=1)))||((AskForSection_2_1>=1)&&(Turn_1_4>=1)))||((Turn_3_1>=1)&&(AskForSection_1_3>=1)))||((Turn_0_2>=1)&&(AskForSection_3_0>=1)))||((Turn_2_3>=1)&&(AskForSection_3_2>=1)))||((AskForSection_2_2>=1)&&(Turn_2_4>=1)))||((Turn_1_0>=1)&&(AskForSection_1_1>=1)))||((Turn_1_2>=1)&&(AskForSection_0_1>=1)))||((AskForSection_1_0>=1)&&(Turn_0_4>=1)))||((AskForSection_4_3>=1)&&(Turn_3_3>=1)))||((Turn_1_2>=1)&&(AskForSection_3_1>=1)))||((AskForSection_0_3>=1)&&(Turn_3_3>=1)))||((AskForSection_4_3>=1)&&(Turn_3_4>=1)))||((Turn_2_0>=1)&&(AskForSection_2_2>=1)))||((Turn_2_1>=1)&&(AskForSection_1_2>=1)))||((Turn_2_2>=1)&&(AskForSection_4_2>=1)))||((Turn_0_0>=1)&&(AskForSection_4_0>=1)))||((Turn_2_2>=1)&&(AskForSection_0_2>=1)))||((Turn_3_0>=1)&&(AskForSection_3_3>=1)))||((Turn_1_1>=1)&&(AskForSection_1_1>=1)))||((Turn_0_0>=1)&&(AskForSection_0_0>=1)))||((Turn_0_3>=1)&&(AskForSection_3_0>=1)))||((Turn_3_2>=1)&&(AskForSection_1_3>=1)))||((AskForSection_4_2>=1)&&(Turn_2_4>=1)))||((Turn_0_1>=1)&&(AskForSection_1_0>=1)))||((Turn_1_3>=1)&&(AskForSection_3_1>=1)))||((Turn_2_0>=1)&&(AskForSection_1_2>=1)))||((Turn_3_1>=1)&&(AskForSection_2_3>=1)))||((Turn_0_2>=1)&&(AskForSection_4_0>=1)))||((Turn_2_3>=1)&&(AskForSection_0_2>=1)))||((Turn_1_0>=1)&&(AskForSection_4_1>=1)))||((Turn_0_2>=1)&&(AskForSection_0_0>=1)))||((Turn_2_1>=1)&&(AskForSection_2_2>=1)))||((Turn_1_3>=1)&&(AskForSection_0_1>=1)))||((Turn_2_3>=1)&&(AskForSection_4_2>=1)))||((Turn_1_2>=1)&&(AskForSection_2_1>=1)))||((Turn_0_0>=1)&&(AskForSection_3_0>=1)))||((Turn_2_2>=1)&&(AskForSection_3_2>=1)))||((AskForSection_3_1>=1)&&(Turn_1_4>=1)))||((Turn_1_1>=1)&&(AskForSection_4_1>=1)))||((Turn_0_3>=1)&&(AskForSection_0_0>=1)))||((Turn_3_0>=1)&&(AskForSection_2_3>=1)))||((Turn_0_3>=1)&&(AskForSection_4_0>=1)))||((Turn_3_2>=1)&&(AskForSection_4_3>=1)))||((AskForSection_3_0>=1)&&(Turn_0_4>=1)))||((Turn_3_2>=1)&&(AskForSection_0_3>=1)))||((Turn_0_1>=1)&&(AskForSection_2_0>=1)))||((Turn_1_3>=1)&&(AskForSection_4_1>=1)))||((AskForSection_1_1>=1)&&(Turn_1_4>=1)))||((AskForSection_3_2>=1)&&(Turn_2_4>=1)))||((Turn_0_2>=1)&&(AskForSection_1_0>=1)))||((AskForSection_1_3>=1)&&(Turn_3_4>=1)))||((Turn_3_1>=1)&&(AskForSection_3_3>=1)))||((AskForSection_2_0>=1)&&(Turn_0_4>=1)))||((AskForSection_1_3>=1)&&(Turn_3_3>=1)))||((Turn_1_0>=1)&&(AskForSection_0_1>=1)))||((Turn_1_0>=1)&&(AskForSection_3_1>=1)))||((Turn_2_3>=1)&&(AskForSection_1_2>=1)))||((AskForSection_1_2>=1)&&(Turn_2_4>=1)))||((Turn_2_0>=1)&&(AskForSection_4_2>=1)))||((Turn_2_1>=1)&&(AskForSection_3_2>=1)))||((AskForSection_0_1>=1)&&(Turn_1_4>=1)))||((Turn_2_0>=1)&&(AskForSection_0_2>=1)))||((Turn_1_2>=1)&&(AskForSection_1_1>=1)))||((AskForSection_3_3>=1)&&(Turn_3_4>=1)))||((Turn_0_0>=1)&&(AskForSection_2_0>=1)))||((Turn_1_1>=1)&&(AskForSection_0_1>=1)))||((Turn_2_2>=1)&&(AskForSection_2_2>=1)))||((Turn_1_1>=1)&&(AskForSection_3_1>=1)))||((Turn_3_0>=1)&&(AskForSection_1_3>=1)))||((AskForSection_3_3>=1)&&(Turn_3_3>=1)))||((Turn_0_3>=1)&&(AskForSection_1_0>=1)))||((AskForSection_0_0>=1)&&(Turn_0_4>=1)))||((Turn_3_2>=1)&&(AskForSection_3_3>=1)))||((Turn_3_1>=1)&&(AskForSection_0_3>=1)))||((Turn_0_1>=1)&&(AskForSection_3_0>=1)))||((Turn_1_3>=1)&&(AskForSection_1_1>=1)))||((Turn_2_1>=1)&&(AskForSection_4_2>=1)))||((Turn_0_2>=1)&&(AskForSection_2_0>=1)))||((Turn_3_1>=1)&&(AskForSection_4_3>=1)))||((Turn_2_3>=1)&&(AskForSection_2_2>=1)))||((Turn_1_0>=1)&&(AskForSection_2_1>=1)))||((Turn_2_1>=1)&&(AskForSection_0_2>=1)))||((Turn_2_0>=1)&&(AskForSection_3_2>=1)))||((Turn_1_2>=1)&&(AskForSection_4_1>=1)))||((AskForSection_0_3>=1)&&(Turn_3_4>=1)))||((Turn_0_0>=1)&&(AskForSection_1_0>=1)))||((AskForSection_4_0>=1)&&(Turn_0_4>=1)))||((Turn_3_0>=1)&&(AskForSection_4_3>=1)))||((Turn_2_2>=1)&&(AskForSection_1_2>=1)))||((Turn_1_1>=1)&&(AskForSection_2_1>=1)))||((Turn_0_3>=1)&&(AskForSection_2_0>=1)))||((Turn_3_0>=1)&&(AskForSection_0_3>=1)))||((Turn_3_2>=1)&&(AskForSection_2_3>=1)))||((Turn_0_1>=1)&&(AskForSection_0_0>=1)))||((AskForSection_4_1>=1)&&(Turn_1_4>=1)))||((Turn_0_1>=1)&&(AskForSection_4_0>=1)))||((AskForSection_2_3>=1)&&(Turn_3_4>=1)))||((AskForSection_2_3>=1)&&(Turn_3_3>=1)))") & GXG"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((TestTurn_0_2>=1)&&(Turn_2_3>=1))||((TestTurn_0_2>=1)&&(Turn_2_2>=1)))||((TestTurn_4_3>=1)&&(Turn_3_2>=1)))||((TestTurn_3_0>=1)&&(Turn_0_4>=1)))||((TestTurn_0_2>=1)&&(Turn_2_1>=1)))||((TestTurn_4_3>=1)&&(Turn_3_1>=1)))||((TestTurn_3_0>=1)&&(Turn_0_2>=1)))||((TestTurn_4_3>=1)&&(Turn_3_3>=1)))||((TestTurn_3_0>=1)&&(Turn_0_0>=1)))||((TestTurn_3_0>=1)&&(Turn_0_1>=1)))||((TestTurn_2_3>=1)&&(Turn_3_0>=1)))||((TestTurn_0_2>=1)&&(Turn_2_4>=1)))||((TestTurn_1_0>=1)&&(Turn_0_2>=1)))||((TestTurn_1_0>=1)&&(Turn_0_4>=1)))||((TestTurn_4_0>=1)&&(Turn_0_1>=1)))||((TestTurn_1_0>=1)&&(Turn_0_0>=1)))||((TestTurn_2_3>=1)&&(Turn_3_4>=1)))||((TestTurn_1_0>=1)&&(Turn_0_3>=1)))||((TestTurn_2_3>=1)&&(Turn_3_3>=1)))||((TestTurn_2_3>=1)&&(Turn_3_1>=1)))||((TestTurn_4_0>=1)&&(Turn_0_2>=1)))||((TestTurn_4_0>=1)&&(Turn_0_0>=1)))||((TestTurn_4_3>=1)&&(Turn_3_0>=1)))||((TestTurn_4_0>=1)&&(Turn_0_3>=1)))||((TestTurn_0_3>=1)&&(Turn_3_3>=1)))||((TestTurn_3_2>=1)&&(Turn_2_2>=1)))||((TestTurn_1_1>=1)&&(Turn_1_0>=1)))||((TestTurn_4_2>=1)&&(Turn_2_1>=1)))||((TestTurn_3_2>=1)&&(Turn_2_0>=1)))||((TestTurn_0_3>=1)&&(Turn_3_4>=1)))||((TestTurn_1_3>=1)&&(Turn_3_0>=1)))||((TestTurn_4_2>=1)&&(Turn_2_0>=1)))||((TestTurn_0_1>=1)&&(Turn_1_1>=1)))||((TestTurn_3_2>=1)&&(Turn_2_1>=1)))||((TestTurn_2_0>=1)&&(Turn_0_1>=1)))||((TestTurn_0_3>=1)&&(Turn_3_2>=1)))||((TestTurn_4_2>=1)&&(Turn_2_3>=1)))||((TestTurn_0_3>=1)&&(Turn_3_1>=1)))||((TestTurn_4_2>=1)&&(Turn_2_2>=1)))||((TestTurn_4_1>=1)&&(Turn_1_0>=1)))||((TestTurn_0_1>=1)&&(Turn_1_3>=1)))||((TestTurn_3_3>=1)&&(Turn_3_1>=1)))||((TestTurn_2_0>=1)&&(Turn_0_3>=1)))||((TestTurn_1_1>=1)&&(Turn_1_4>=1)))||((TestTurn_4_1>=1)&&(Turn_1_1>=1)))||((TestTurn_0_1>=1)&&(Turn_1_2>=1)))||((TestTurn_2_0>=1)&&(Turn_0_0>=1)))||((TestTurn_3_2>=1)&&(Turn_2_4>=1)))||((TestTurn_4_1>=1)&&(Turn_1_2>=1)))||((TestTurn_0_1>=1)&&(Turn_1_4>=1)))||((TestTurn_1_1>=1)&&(Turn_1_2>=1)))||((TestTurn_3_3>=1)&&(Turn_3_4>=1)))||((TestTurn_2_0>=1)&&(Turn_0_4>=1)))||((TestTurn_4_1>=1)&&(Turn_1_3>=1)))||((TestTurn_3_3>=1)&&(Turn_3_2>=1)))||((TestTurn_1_1>=1)&&(Turn_1_3>=1)))||((TestTurn_3_1>=1)&&(Turn_1_2>=1)))||((TestTurn_2_2>=1)&&(Turn_2_0>=1)))||((TestTurn_1_2>=1)&&(Turn_2_2>=1)))||((TestTurn_3_3>=1)&&(Turn_3_0>=1)))||((TestTurn_1_2>=1)&&(Turn_2_4>=1)))||((TestTurn_2_2>=1)&&(Turn_2_1>=1)))||((TestTurn_2_1>=1)&&(Turn_1_4>=1)))||((TestTurn_3_1>=1)&&(Turn_1_0>=1)))||((TestTurn_3_1>=1)&&(Turn_1_1>=1)))||((TestTurn_2_2>=1)&&(Turn_2_3>=1)))||((TestTurn_1_3>=1)&&(Turn_3_4>=1)))||((TestTurn_2_1>=1)&&(Turn_1_3>=1)))||((TestTurn_2_2>=1)&&(Turn_2_4>=1)))||((TestTurn_0_0>=1)&&(Turn_0_1>=1)))||((TestTurn_2_1>=1)&&(Turn_1_1>=1)))||((TestTurn_1_2>=1)&&(Turn_2_0>=1)))||((TestTurn_0_0>=1)&&(Turn_0_3>=1)))||((TestTurn_1_3>=1)&&(Turn_3_3>=1)))||((TestTurn_3_1>=1)&&(Turn_1_4>=1)))||((TestTurn_0_0>=1)&&(Turn_0_4>=1)))||((TestTurn_2_1>=1)&&(Turn_1_0>=1)))||((TestTurn_1_3>=1)&&(Turn_3_2>=1)))||((TestTurn_0_0>=1)&&(Turn_0_2>=1)))||((TestTurn_1_2>=1)&&(Turn_2_3>=1)))&&(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((Turn_1_3>=1)&&(AskForSection_2_1>=1))||((AskForSection_0_2>=1)&&(Turn_2_4>=1)))||((AskForSection_2_1>=1)&&(Turn_1_4>=1)))||((Turn_3_1>=1)&&(AskForSection_1_3>=1)))||((Turn_0_2>=1)&&(AskForSection_3_0>=1)))||((Turn_2_3>=1)&&(AskForSection_3_2>=1)))||((AskForSection_2_2>=1)&&(Turn_2_4>=1)))||((Turn_1_0>=1)&&(AskForSection_1_1>=1)))||((Turn_1_2>=1)&&(AskForSection_0_1>=1)))||((AskForSection_1_0>=1)&&(Turn_0_4>=1)))||((AskForSection_4_3>=1)&&(Turn_3_3>=1)))||((Turn_1_2>=1)&&(AskForSection_3_1>=1)))||((AskForSection_0_3>=1)&&(Turn_3_3>=1)))||((AskForSection_4_3>=1)&&(Turn_3_4>=1)))||((Turn_2_0>=1)&&(AskForSection_2_2>=1)))||((Turn_2_1>=1)&&(AskForSection_1_2>=1)))||((Turn_2_2>=1)&&(AskForSection_4_2>=1)))||((Turn_0_0>=1)&&(AskForSection_4_0>=1)))||((Turn_2_2>=1)&&(AskForSection_0_2>=1)))||((Turn_3_0>=1)&&(AskForSection_3_3>=1)))||((Turn_1_1>=1)&&(AskForSection_1_1>=1)))||((Turn_0_0>=1)&&(AskForSection_0_0>=1)))||((Turn_0_3>=1)&&(AskForSection_3_0>=1)))||((Turn_3_2>=1)&&(AskForSection_1_3>=1)))||((AskForSection_4_2>=1)&&(Turn_2_4>=1)))||((Turn_0_1>=1)&&(AskForSection_1_0>=1)))||((Turn_1_3>=1)&&(AskForSection_3_1>=1)))||((Turn_2_0>=1)&&(AskForSection_1_2>=1)))||((Turn_3_1>=1)&&(AskForSection_2_3>=1)))||((Turn_0_2>=1)&&(AskForSection_4_0>=1)))||((Turn_2_3>=1)&&(AskForSection_0_2>=1)))||((Turn_1_0>=1)&&(AskForSection_4_1>=1)))||((Turn_0_2>=1)&&(AskForSection_0_0>=1)))||((Turn_2_1>=1)&&(AskForSection_2_2>=1)))||((Turn_1_3>=1)&&(AskForSection_0_1>=1)))||((Turn_2_3>=1)&&(AskForSection_4_2>=1)))||((Turn_1_2>=1)&&(AskForSection_2_1>=1)))||((Turn_0_0>=1)&&(AskForSection_3_0>=1)))||((Turn_2_2>=1)&&(AskForSection_3_2>=1)))||((AskForSection_3_1>=1)&&(Turn_1_4>=1)))||((Turn_1_1>=1)&&(AskForSection_4_1>=1)))||((Turn_0_3>=1)&&(AskForSection_0_0>=1)))||((Turn_3_0>=1)&&(AskForSection_2_3>=1)))||((Turn_0_3>=1)&&(AskForSection_4_0>=1)))||((Turn_3_2>=1)&&(AskForSection_4_3>=1)))||((AskForSection_3_0>=1)&&(Turn_0_4>=1)))||((Turn_3_2>=1)&&(AskForSection_0_3>=1)))||((Turn_0_1>=1)&&(AskForSection_2_0>=1)))||((Turn_1_3>=1)&&(AskForSection_4_1>=1)))||((AskForSection_1_1>=1)&&(Turn_1_4>=1)))||((AskForSection_3_2>=1)&&(Turn_2_4>=1)))||((Turn_0_2>=1)&&(AskForSection_1_0>=1)))||((AskForSection_1_3>=1)&&(Turn_3_4>=1)))||((Turn_3_1>=1)&&(AskForSection_3_3>=1)))||((AskForSection_2_0>=1)&&(Turn_0_4>=1)))||((AskForSection_1_3>=1)&&(Turn_3_3>=1)))||((Turn_1_0>=1)&&(AskForSection_0_1>=1)))||((Turn_1_0>=1)&&(AskForSection_3_1>=1)))||((Turn_2_3>=1)&&(AskForSection_1_2>=1)))||((AskForSection_1_2>=1)&&(Turn_2_4>=1)))||((Turn_2_0>=1)&&(AskForSection_4_2>=1)))||((Turn_2_1>=1)&&(AskForSection_3_2>=1)))||((AskForSection_0_1>=1)&&(Turn_1_4>=1)))||((Turn_2_0>=1)&&(AskForSection_0_2>=1)))||((Turn_1_2>=1)&&(AskForSection_1_1>=1)))||((AskForSection_3_3>=1)&&(Turn_3_4>=1)))||((Turn_0_0>=1)&&(AskForSection_2_0>=1)))||((Turn_1_1>=1)&&(AskForSection_0_1>=1)))||((Turn_2_2>=1)&&(AskForSection_2_2>=1)))||((Turn_1_1>=1)&&(AskForSection_3_1>=1)))||((Turn_3_0>=1)&&(AskForSection_1_3>=1)))||((AskForSection_3_3>=1)&&(Turn_3_3>=1)))||((Turn_0_3>=1)&&(AskForSection_1_0>=1)))||((AskForSection_0_0>=1)&&(Turn_0_4>=1)))||((Turn_3_2>=1)&&(AskForSection_3_3>=1)))||((Turn_3_1>=1)&&(AskForSection_0_3>=1)))||((Turn_0_1>=1)&&(AskForSection_3_0>=1)))||((Turn_1_3>=1)&&(AskForSection_1_1>=1)))||((Turn_2_1>=1)&&(AskForSection_4_2>=1)))||((Turn_0_2>=1)&&(AskForSection_2_0>=1)))||((Turn_3_1>=1)&&(AskForSection_4_3>=1)))||((Turn_2_3>=1)&&(AskForSection_2_2>=1)))||((Turn_1_0>=1)&&(AskForSection_2_1>=1)))||((Turn_2_1>=1)&&(AskForSection_0_2>=1)))||((Turn_2_0>=1)&&(AskForSection_3_2>=1)))||((Turn_1_2>=1)&&(AskForSection_4_1>=1)))||((AskForSection_0_3>=1)&&(Turn_3_4>=1)))||((Turn_0_0>=1)&&(AskForSection_1_0>=1)))||((AskForSection_4_0>=1)&&(Turn_0_4>=1)))||((Turn_3_0>=1)&&(AskForSection_4_3>=1)))||((Turn_2_2>=1)&&(AskForSection_1_2>=1)))||((Turn_1_1>=1)&&(AskForSection_2_1>=1)))||((Turn_0_3>=1)&&(AskForSection_2_0>=1)))||((Turn_3_0>=1)&&(AskForSection_0_3>=1)))||((Turn_3_2>=1)&&(AskForSection_2_3>=1)))||((Turn_0_1>=1)&&(AskForSection_0_0>=1)))||((AskForSection_4_1>=1)&&(Turn_1_4>=1)))||((Turn_0_1>=1)&&(AskForSection_4_0>=1)))||((AskForSection_2_3>=1)&&(Turn_3_4>=1)))||((AskForSection_2_3>=1)&&(Turn_3_3>=1))))")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-PT-4"
export BK_EXAMINATION="LTLFireability"
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-PT-4, examination is LTLFireability"
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-158961258100722"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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