fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987914100578
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BusinessProcesses-PT-17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15715.770 3600000.00 552614.00 123.20 FFFFFFFTFFFTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914100578.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 itslola
Input is BusinessProcesses-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100578
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 4.3K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 161K Mar 24 05:37 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 BusinessProcesses-PT-17-00
FORMULA_NAME BusinessProcesses-PT-17-01
FORMULA_NAME BusinessProcesses-PT-17-02
FORMULA_NAME BusinessProcesses-PT-17-03
FORMULA_NAME BusinessProcesses-PT-17-04
FORMULA_NAME BusinessProcesses-PT-17-05
FORMULA_NAME BusinessProcesses-PT-17-06
FORMULA_NAME BusinessProcesses-PT-17-07
FORMULA_NAME BusinessProcesses-PT-17-08
FORMULA_NAME BusinessProcesses-PT-17-09
FORMULA_NAME BusinessProcesses-PT-17-10
FORMULA_NAME BusinessProcesses-PT-17-11
FORMULA_NAME BusinessProcesses-PT-17-12
FORMULA_NAME BusinessProcesses-PT-17-13
FORMULA_NAME BusinessProcesses-PT-17-14
FORMULA_NAME BusinessProcesses-PT-17-15

=== Now, execution of the tool begins

BK_START 1591165419479

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:23:41] [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, -timeout, 3600, -rebuildPNML]
[2020-06-03 06:23:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:23:41] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2020-06-03 06:23:41] [INFO ] Transformed 650 places.
[2020-06-03 06:23:41] [INFO ] Transformed 580 transitions.
[2020-06-03 06:23:41] [INFO ] Found NUPN structural information;
[2020-06-03 06:23:41] [INFO ] Parsed PT model containing 650 places and 580 transitions in 178 ms.
Deduced a syphon composed of 4 places in 15 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 47 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 662 resets, run finished after 286 ms. (steps per millisecond=349 ) properties seen :[1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1]
// Phase 1: matrix 576 rows 646 cols
[2020-06-03 06:23:42] [INFO ] Computed 108 place invariants in 32 ms
[2020-06-03 06:23:42] [INFO ] [Real]Absence check using 62 positive place invariants in 51 ms returned sat
[2020-06-03 06:23:42] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:23:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:23:43] [INFO ] [Real]Absence check using state equation in 991 ms returned sat
[2020-06-03 06:23:43] [INFO ] Deduced a trap composed of 15 places in 293 ms
[2020-06-03 06:23:44] [INFO ] Deduced a trap composed of 8 places in 368 ms
[2020-06-03 06:23:44] [INFO ] Deduced a trap composed of 28 places in 237 ms
[2020-06-03 06:23:44] [INFO ] Deduced a trap composed of 11 places in 260 ms
[2020-06-03 06:23:45] [INFO ] Deduced a trap composed of 24 places in 235 ms
[2020-06-03 06:23:45] [INFO ] Deduced a trap composed of 19 places in 223 ms
[2020-06-03 06:23:45] [INFO ] Deduced a trap composed of 29 places in 230 ms
[2020-06-03 06:23:45] [INFO ] Deduced a trap composed of 18 places in 283 ms
[2020-06-03 06:23:46] [INFO ] Deduced a trap composed of 29 places in 218 ms
[2020-06-03 06:23:46] [INFO ] Deduced a trap composed of 27 places in 223 ms
[2020-06-03 06:23:46] [INFO ] Deduced a trap composed of 129 places in 228 ms
[2020-06-03 06:23:46] [INFO ] Deduced a trap composed of 131 places in 183 ms
[2020-06-03 06:23:47] [INFO ] Deduced a trap composed of 26 places in 187 ms
[2020-06-03 06:23:47] [INFO ] Deduced a trap composed of 27 places in 179 ms
[2020-06-03 06:23:47] [INFO ] Deduced a trap composed of 119 places in 191 ms
[2020-06-03 06:23:47] [INFO ] Deduced a trap composed of 49 places in 188 ms
[2020-06-03 06:23:48] [INFO ] Deduced a trap composed of 124 places in 358 ms
[2020-06-03 06:23:48] [INFO ] Deduced a trap composed of 40 places in 179 ms
[2020-06-03 06:23:48] [INFO ] Deduced a trap composed of 37 places in 218 ms
[2020-06-03 06:23:48] [INFO ] Deduced a trap composed of 25 places in 382 ms
[2020-06-03 06:23:49] [INFO ] Deduced a trap composed of 28 places in 184 ms
[2020-06-03 06:23:49] [INFO ] Deduced a trap composed of 30 places in 306 ms
[2020-06-03 06:23:49] [INFO ] Deduced a trap composed of 135 places in 458 ms
[2020-06-03 06:23:50] [INFO ] Deduced a trap composed of 138 places in 383 ms
[2020-06-03 06:23:50] [INFO ] Deduced a trap composed of 40 places in 196 ms
[2020-06-03 06:23:50] [INFO ] Deduced a trap composed of 26 places in 183 ms
[2020-06-03 06:23:51] [INFO ] Deduced a trap composed of 75 places in 185 ms
[2020-06-03 06:23:51] [INFO ] Deduced a trap composed of 74 places in 171 ms
[2020-06-03 06:23:51] [INFO ] Deduced a trap composed of 143 places in 174 ms
[2020-06-03 06:23:51] [INFO ] Deduced a trap composed of 72 places in 195 ms
[2020-06-03 06:23:51] [INFO ] Deduced a trap composed of 26 places in 180 ms
[2020-06-03 06:23:52] [INFO ] Deduced a trap composed of 139 places in 190 ms
[2020-06-03 06:23:52] [INFO ] Deduced a trap composed of 154 places in 184 ms
[2020-06-03 06:23:52] [INFO ] Deduced a trap composed of 155 places in 170 ms
[2020-06-03 06:23:52] [INFO ] Deduced a trap composed of 151 places in 166 ms
[2020-06-03 06:23:52] [INFO ] Deduced a trap composed of 153 places in 160 ms
[2020-06-03 06:23:53] [INFO ] Deduced a trap composed of 140 places in 152 ms
[2020-06-03 06:23:53] [INFO ] Deduced a trap composed of 141 places in 165 ms
[2020-06-03 06:23:53] [INFO ] Deduced a trap composed of 151 places in 170 ms
[2020-06-03 06:23:53] [INFO ] Deduced a trap composed of 146 places in 160 ms
[2020-06-03 06:23:53] [INFO ] Deduced a trap composed of 143 places in 153 ms
[2020-06-03 06:23:54] [INFO ] Deduced a trap composed of 136 places in 167 ms
[2020-06-03 06:23:54] [INFO ] Deduced a trap composed of 149 places in 167 ms
[2020-06-03 06:23:54] [INFO ] Deduced a trap composed of 154 places in 159 ms
[2020-06-03 06:23:54] [INFO ] Deduced a trap composed of 159 places in 181 ms
[2020-06-03 06:23:54] [INFO ] Deduced a trap composed of 152 places in 148 ms
[2020-06-03 06:23:54] [INFO ] Deduced a trap composed of 45 places in 147 ms
[2020-06-03 06:23:55] [INFO ] Deduced a trap composed of 146 places in 165 ms
[2020-06-03 06:23:55] [INFO ] Deduced a trap composed of 42 places in 186 ms
[2020-06-03 06:23:55] [INFO ] Deduced a trap composed of 148 places in 147 ms
[2020-06-03 06:23:55] [INFO ] Deduced a trap composed of 152 places in 144 ms
[2020-06-03 06:23:55] [INFO ] Deduced a trap composed of 33 places in 146 ms
[2020-06-03 06:23:56] [INFO ] Deduced a trap composed of 142 places in 152 ms
[2020-06-03 06:23:56] [INFO ] Deduced a trap composed of 154 places in 147 ms
[2020-06-03 06:23:56] [INFO ] Deduced a trap composed of 154 places in 162 ms
[2020-06-03 06:23:56] [INFO ] Deduced a trap composed of 35 places in 169 ms
[2020-06-03 06:23:56] [INFO ] Deduced a trap composed of 145 places in 186 ms
[2020-06-03 06:23:57] [INFO ] Deduced a trap composed of 155 places in 195 ms
[2020-06-03 06:23:57] [INFO ] Deduced a trap composed of 148 places in 159 ms
[2020-06-03 06:23:57] [INFO ] Deduced a trap composed of 151 places in 184 ms
[2020-06-03 06:23:57] [INFO ] Deduced a trap composed of 152 places in 159 ms
[2020-06-03 06:23:57] [INFO ] Deduced a trap composed of 174 places in 174 ms
[2020-06-03 06:23:58] [INFO ] Deduced a trap composed of 176 places in 145 ms
[2020-06-03 06:23:58] [INFO ] Deduced a trap composed of 150 places in 149 ms
[2020-06-03 06:23:58] [INFO ] Deduced a trap composed of 174 places in 169 ms
[2020-06-03 06:23:58] [INFO ] Deduced a trap composed of 156 places in 145 ms
[2020-06-03 06:23:58] [INFO ] Deduced a trap composed of 163 places in 145 ms
[2020-06-03 06:23:58] [INFO ] Deduced a trap composed of 154 places in 151 ms
[2020-06-03 06:23:59] [INFO ] Deduced a trap composed of 159 places in 161 ms
[2020-06-03 06:23:59] [INFO ] Deduced a trap composed of 162 places in 158 ms
[2020-06-03 06:23:59] [INFO ] Deduced a trap composed of 156 places in 188 ms
[2020-06-03 06:23:59] [INFO ] Deduced a trap composed of 172 places in 155 ms
[2020-06-03 06:23:59] [INFO ] Deduced a trap composed of 161 places in 170 ms
[2020-06-03 06:24:00] [INFO ] Deduced a trap composed of 172 places in 160 ms
[2020-06-03 06:24:00] [INFO ] Deduced a trap composed of 158 places in 188 ms
[2020-06-03 06:24:00] [INFO ] Deduced a trap composed of 150 places in 169 ms
[2020-06-03 06:24:00] [INFO ] Deduced a trap composed of 148 places in 157 ms
[2020-06-03 06:24:00] [INFO ] Deduced a trap composed of 151 places in 153 ms
[2020-06-03 06:24:01] [INFO ] Deduced a trap composed of 12 places in 173 ms
[2020-06-03 06:24:01] [INFO ] Deduced a trap composed of 18 places in 153 ms
[2020-06-03 06:24:01] [INFO ] Deduced a trap composed of 21 places in 170 ms
[2020-06-03 06:24:01] [INFO ] Deduced a trap composed of 28 places in 203 ms
[2020-06-03 06:24:01] [INFO ] Deduced a trap composed of 142 places in 178 ms
[2020-06-03 06:24:02] [INFO ] Deduced a trap composed of 18 places in 179 ms
[2020-06-03 06:24:02] [INFO ] Deduced a trap composed of 11 places in 155 ms
[2020-06-03 06:24:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s259 s262 s450 s451 s452 s456 s603 s604) 0)") while checking expression at index 0
[2020-06-03 06:24:02] [INFO ] [Real]Absence check using 62 positive place invariants in 49 ms returned sat
[2020-06-03 06:24:02] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-06-03 06:24:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:24:03] [INFO ] [Real]Absence check using state equation in 767 ms returned sat
[2020-06-03 06:24:03] [INFO ] Deduced a trap composed of 27 places in 178 ms
[2020-06-03 06:24:03] [INFO ] Deduced a trap composed of 25 places in 189 ms
[2020-06-03 06:24:03] [INFO ] Deduced a trap composed of 14 places in 215 ms
[2020-06-03 06:24:04] [INFO ] Deduced a trap composed of 23 places in 158 ms
[2020-06-03 06:24:04] [INFO ] Deduced a trap composed of 32 places in 145 ms
[2020-06-03 06:24:04] [INFO ] Deduced a trap composed of 125 places in 156 ms
[2020-06-03 06:24:04] [INFO ] Deduced a trap composed of 26 places in 160 ms
[2020-06-03 06:24:04] [INFO ] Deduced a trap composed of 11 places in 182 ms
[2020-06-03 06:24:05] [INFO ] Deduced a trap composed of 26 places in 194 ms
[2020-06-03 06:24:05] [INFO ] Deduced a trap composed of 17 places in 135 ms
[2020-06-03 06:24:05] [INFO ] Deduced a trap composed of 44 places in 181 ms
[2020-06-03 06:24:05] [INFO ] Deduced a trap composed of 48 places in 121 ms
[2020-06-03 06:24:05] [INFO ] Deduced a trap composed of 17 places in 155 ms
[2020-06-03 06:24:05] [INFO ] Deduced a trap composed of 131 places in 113 ms
[2020-06-03 06:24:05] [INFO ] Deduced a trap composed of 24 places in 119 ms
[2020-06-03 06:24:06] [INFO ] Deduced a trap composed of 20 places in 120 ms
[2020-06-03 06:24:06] [INFO ] Deduced a trap composed of 130 places in 124 ms
[2020-06-03 06:24:06] [INFO ] Deduced a trap composed of 138 places in 117 ms
[2020-06-03 06:24:06] [INFO ] Deduced a trap composed of 126 places in 126 ms
[2020-06-03 06:24:06] [INFO ] Deduced a trap composed of 130 places in 146 ms
[2020-06-03 06:24:06] [INFO ] Deduced a trap composed of 133 places in 151 ms
[2020-06-03 06:24:07] [INFO ] Deduced a trap composed of 135 places in 125 ms
[2020-06-03 06:24:07] [INFO ] Deduced a trap composed of 130 places in 123 ms
[2020-06-03 06:24:07] [INFO ] Deduced a trap composed of 122 places in 163 ms
[2020-06-03 06:24:07] [INFO ] Deduced a trap composed of 131 places in 132 ms
[2020-06-03 06:24:07] [INFO ] Deduced a trap composed of 131 places in 149 ms
[2020-06-03 06:24:07] [INFO ] Deduced a trap composed of 129 places in 135 ms
[2020-06-03 06:24:08] [INFO ] Deduced a trap composed of 128 places in 140 ms
[2020-06-03 06:24:08] [INFO ] Deduced a trap composed of 132 places in 138 ms
[2020-06-03 06:24:08] [INFO ] Deduced a trap composed of 129 places in 270 ms
[2020-06-03 06:24:08] [INFO ] Deduced a trap composed of 28 places in 146 ms
[2020-06-03 06:24:08] [INFO ] Deduced a trap composed of 58 places in 145 ms
[2020-06-03 06:24:09] [INFO ] Deduced a trap composed of 54 places in 129 ms
[2020-06-03 06:24:09] [INFO ] Deduced a trap composed of 146 places in 129 ms
[2020-06-03 06:24:09] [INFO ] Deduced a trap composed of 135 places in 204 ms
[2020-06-03 06:24:09] [INFO ] Deduced a trap composed of 132 places in 135 ms
[2020-06-03 06:24:09] [INFO ] Deduced a trap composed of 129 places in 115 ms
[2020-06-03 06:24:09] [INFO ] Deduced a trap composed of 132 places in 117 ms
[2020-06-03 06:24:09] [INFO ] Deduced a trap composed of 130 places in 109 ms
[2020-06-03 06:24:10] [INFO ] Deduced a trap composed of 131 places in 132 ms
[2020-06-03 06:24:10] [INFO ] Deduced a trap composed of 136 places in 133 ms
[2020-06-03 06:24:10] [INFO ] Deduced a trap composed of 131 places in 106 ms
[2020-06-03 06:24:10] [INFO ] Deduced a trap composed of 125 places in 114 ms
[2020-06-03 06:24:10] [INFO ] Deduced a trap composed of 129 places in 117 ms
[2020-06-03 06:24:10] [INFO ] Deduced a trap composed of 130 places in 108 ms
[2020-06-03 06:24:10] [INFO ] Deduced a trap composed of 131 places in 113 ms
[2020-06-03 06:24:11] [INFO ] Deduced a trap composed of 131 places in 110 ms
[2020-06-03 06:24:11] [INFO ] Deduced a trap composed of 131 places in 110 ms
[2020-06-03 06:24:11] [INFO ] Deduced a trap composed of 127 places in 118 ms
[2020-06-03 06:24:11] [INFO ] Deduced a trap composed of 133 places in 164 ms
[2020-06-03 06:24:11] [INFO ] Deduced a trap composed of 133 places in 113 ms
[2020-06-03 06:24:11] [INFO ] Deduced a trap composed of 58 places in 113 ms
[2020-06-03 06:24:11] [INFO ] Deduced a trap composed of 136 places in 112 ms
[2020-06-03 06:24:12] [INFO ] Deduced a trap composed of 57 places in 120 ms
[2020-06-03 06:24:12] [INFO ] Deduced a trap composed of 121 places in 111 ms
[2020-06-03 06:24:12] [INFO ] Deduced a trap composed of 128 places in 138 ms
[2020-06-03 06:24:12] [INFO ] Deduced a trap composed of 131 places in 137 ms
[2020-06-03 06:24:12] [INFO ] Deduced a trap composed of 134 places in 125 ms
[2020-06-03 06:24:12] [INFO ] Deduced a trap composed of 137 places in 151 ms
[2020-06-03 06:24:13] [INFO ] Deduced a trap composed of 136 places in 133 ms
[2020-06-03 06:24:13] [INFO ] Deduced a trap composed of 137 places in 138 ms
[2020-06-03 06:24:13] [INFO ] Deduced a trap composed of 135 places in 154 ms
[2020-06-03 06:24:13] [INFO ] Deduced a trap composed of 135 places in 131 ms
[2020-06-03 06:24:13] [INFO ] Deduced a trap composed of 139 places in 129 ms
[2020-06-03 06:24:13] [INFO ] Deduced a trap composed of 137 places in 131 ms
[2020-06-03 06:24:13] [INFO ] Deduced a trap composed of 126 places in 133 ms
[2020-06-03 06:24:14] [INFO ] Deduced a trap composed of 126 places in 127 ms
[2020-06-03 06:24:14] [INFO ] Deduced a trap composed of 127 places in 130 ms
[2020-06-03 06:24:14] [INFO ] Deduced a trap composed of 129 places in 114 ms
[2020-06-03 06:24:14] [INFO ] Deduced a trap composed of 132 places in 156 ms
[2020-06-03 06:24:14] [INFO ] Deduced a trap composed of 131 places in 134 ms
[2020-06-03 06:24:14] [INFO ] Deduced a trap composed of 134 places in 142 ms
[2020-06-03 06:24:15] [INFO ] Deduced a trap composed of 130 places in 177 ms
[2020-06-03 06:24:15] [INFO ] Deduced a trap composed of 129 places in 125 ms
[2020-06-03 06:24:15] [INFO ] Deduced a trap composed of 132 places in 136 ms
[2020-06-03 06:24:15] [INFO ] Deduced a trap composed of 137 places in 125 ms
[2020-06-03 06:24:15] [INFO ] Deduced a trap composed of 134 places in 130 ms
[2020-06-03 06:24:15] [INFO ] Deduced a trap composed of 134 places in 133 ms
[2020-06-03 06:24:16] [INFO ] Deduced a trap composed of 136 places in 121 ms
[2020-06-03 06:24:16] [INFO ] Deduced a trap composed of 137 places in 128 ms
[2020-06-03 06:24:16] [INFO ] Deduced a trap composed of 138 places in 125 ms
[2020-06-03 06:24:16] [INFO ] Deduced a trap composed of 122 places in 130 ms
[2020-06-03 06:24:16] [INFO ] Deduced a trap composed of 135 places in 126 ms
[2020-06-03 06:24:16] [INFO ] Deduced a trap composed of 132 places in 122 ms
[2020-06-03 06:24:17] [INFO ] Deduced a trap composed of 124 places in 122 ms
[2020-06-03 06:24:17] [INFO ] Deduced a trap composed of 132 places in 120 ms
[2020-06-03 06:24:17] [INFO ] Deduced a trap composed of 123 places in 125 ms
[2020-06-03 06:24:17] [INFO ] Deduced a trap composed of 132 places in 133 ms
[2020-06-03 06:24:17] [INFO ] Deduced a trap composed of 132 places in 115 ms
[2020-06-03 06:24:17] [INFO ] Deduced a trap composed of 126 places in 116 ms
[2020-06-03 06:24:17] [INFO ] Deduced a trap composed of 129 places in 107 ms
[2020-06-03 06:24:18] [INFO ] Deduced a trap composed of 125 places in 111 ms
[2020-06-03 06:24:18] [INFO ] Deduced a trap composed of 128 places in 113 ms
[2020-06-03 06:24:18] [INFO ] Deduced a trap composed of 124 places in 123 ms
[2020-06-03 06:24:18] [INFO ] Deduced a trap composed of 137 places in 112 ms
[2020-06-03 06:24:18] [INFO ] Deduced a trap composed of 126 places in 107 ms
[2020-06-03 06:24:18] [INFO ] Deduced a trap composed of 125 places in 106 ms
[2020-06-03 06:24:18] [INFO ] Deduced a trap composed of 130 places in 129 ms
[2020-06-03 06:24:19] [INFO ] Deduced a trap composed of 131 places in 124 ms
[2020-06-03 06:24:19] [INFO ] Deduced a trap composed of 131 places in 117 ms
[2020-06-03 06:24:19] [INFO ] Deduced a trap composed of 128 places in 114 ms
[2020-06-03 06:24:19] [INFO ] Deduced a trap composed of 132 places in 124 ms
[2020-06-03 06:24:19] [INFO ] Deduced a trap composed of 134 places in 125 ms
[2020-06-03 06:24:19] [INFO ] Deduced a trap composed of 130 places in 125 ms
[2020-06-03 06:24:20] [INFO ] Deduced a trap composed of 130 places in 127 ms
[2020-06-03 06:24:20] [INFO ] Deduced a trap composed of 135 places in 127 ms
[2020-06-03 06:24:20] [INFO ] Deduced a trap composed of 126 places in 130 ms
[2020-06-03 06:24:20] [INFO ] Deduced a trap composed of 135 places in 116 ms
[2020-06-03 06:24:20] [INFO ] Deduced a trap composed of 132 places in 115 ms
[2020-06-03 06:24:20] [INFO ] Deduced a trap composed of 132 places in 111 ms
[2020-06-03 06:24:20] [INFO ] Trap strengthening (SAT) tested/added 111/110 trap constraints in 17622 ms
[2020-06-03 06:24:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:24:20] [INFO ] [Nat]Absence check using 62 positive place invariants in 72 ms returned sat
[2020-06-03 06:24:20] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:24:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:24:21] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2020-06-03 06:24:21] [INFO ] Deduced a trap composed of 17 places in 256 ms
[2020-06-03 06:24:22] [INFO ] Deduced a trap composed of 24 places in 257 ms
[2020-06-03 06:24:22] [INFO ] Deduced a trap composed of 15 places in 209 ms
[2020-06-03 06:24:22] [INFO ] Deduced a trap composed of 28 places in 161 ms
[2020-06-03 06:24:22] [INFO ] Deduced a trap composed of 21 places in 189 ms
[2020-06-03 06:24:23] [INFO ] Deduced a trap composed of 27 places in 167 ms
[2020-06-03 06:24:23] [INFO ] Deduced a trap composed of 124 places in 173 ms
[2020-06-03 06:24:23] [INFO ] Deduced a trap composed of 25 places in 228 ms
[2020-06-03 06:24:23] [INFO ] Deduced a trap composed of 11 places in 136 ms
[2020-06-03 06:24:23] [INFO ] Deduced a trap composed of 12 places in 150 ms
[2020-06-03 06:24:24] [INFO ] Deduced a trap composed of 125 places in 135 ms
[2020-06-03 06:24:24] [INFO ] Deduced a trap composed of 27 places in 150 ms
[2020-06-03 06:24:24] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2484 ms
[2020-06-03 06:24:24] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 28 ms.
[2020-06-03 06:24:28] [INFO ] Added : 392 causal constraints over 79 iterations in 4150 ms. Result :sat
[2020-06-03 06:24:28] [INFO ] [Real]Absence check using 62 positive place invariants in 209 ms returned sat
[2020-06-03 06:24:28] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 33 ms returned sat
[2020-06-03 06:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:24:29] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2020-06-03 06:24:29] [INFO ] Deduced a trap composed of 10 places in 220 ms
[2020-06-03 06:24:30] [INFO ] Deduced a trap composed of 11 places in 179 ms
[2020-06-03 06:24:30] [INFO ] Deduced a trap composed of 8 places in 192 ms
[2020-06-03 06:24:30] [INFO ] Deduced a trap composed of 23 places in 409 ms
[2020-06-03 06:24:30] [INFO ] Deduced a trap composed of 18 places in 156 ms
[2020-06-03 06:24:31] [INFO ] Deduced a trap composed of 50 places in 169 ms
[2020-06-03 06:24:31] [INFO ] Deduced a trap composed of 36 places in 151 ms
[2020-06-03 06:24:31] [INFO ] Deduced a trap composed of 26 places in 149 ms
[2020-06-03 06:24:31] [INFO ] Deduced a trap composed of 13 places in 191 ms
[2020-06-03 06:24:31] [INFO ] Deduced a trap composed of 22 places in 196 ms
[2020-06-03 06:24:32] [INFO ] Deduced a trap composed of 15 places in 210 ms
[2020-06-03 06:24:32] [INFO ] Deduced a trap composed of 32 places in 164 ms
[2020-06-03 06:24:32] [INFO ] Deduced a trap composed of 37 places in 184 ms
[2020-06-03 06:24:32] [INFO ] Deduced a trap composed of 28 places in 153 ms
[2020-06-03 06:24:32] [INFO ] Deduced a trap composed of 36 places in 175 ms
[2020-06-03 06:24:33] [INFO ] Deduced a trap composed of 136 places in 202 ms
[2020-06-03 06:24:33] [INFO ] Deduced a trap composed of 37 places in 159 ms
[2020-06-03 06:24:33] [INFO ] Deduced a trap composed of 11 places in 168 ms
[2020-06-03 06:24:33] [INFO ] Deduced a trap composed of 29 places in 170 ms
[2020-06-03 06:24:33] [INFO ] Deduced a trap composed of 27 places in 157 ms
[2020-06-03 06:24:34] [INFO ] Deduced a trap composed of 146 places in 141 ms
[2020-06-03 06:24:34] [INFO ] Deduced a trap composed of 18 places in 153 ms
[2020-06-03 06:24:34] [INFO ] Deduced a trap composed of 35 places in 174 ms
[2020-06-03 06:24:34] [INFO ] Deduced a trap composed of 147 places in 198 ms
[2020-06-03 06:24:34] [INFO ] Deduced a trap composed of 30 places in 186 ms
[2020-06-03 06:24:35] [INFO ] Deduced a trap composed of 132 places in 156 ms
[2020-06-03 06:24:35] [INFO ] Deduced a trap composed of 35 places in 133 ms
[2020-06-03 06:24:35] [INFO ] Deduced a trap composed of 25 places in 159 ms
[2020-06-03 06:24:35] [INFO ] Deduced a trap composed of 131 places in 158 ms
[2020-06-03 06:24:35] [INFO ] Deduced a trap composed of 144 places in 155 ms
[2020-06-03 06:24:35] [INFO ] Deduced a trap composed of 41 places in 152 ms
[2020-06-03 06:24:36] [INFO ] Deduced a trap composed of 54 places in 153 ms
[2020-06-03 06:24:36] [INFO ] Deduced a trap composed of 18 places in 152 ms
[2020-06-03 06:24:36] [INFO ] Deduced a trap composed of 58 places in 170 ms
[2020-06-03 06:24:36] [INFO ] Deduced a trap composed of 147 places in 145 ms
[2020-06-03 06:24:36] [INFO ] Deduced a trap composed of 155 places in 146 ms
[2020-06-03 06:24:36] [INFO ] Deduced a trap composed of 51 places in 146 ms
[2020-06-03 06:24:37] [INFO ] Deduced a trap composed of 37 places in 156 ms
[2020-06-03 06:24:37] [INFO ] Deduced a trap composed of 43 places in 156 ms
[2020-06-03 06:24:37] [INFO ] Deduced a trap composed of 68 places in 139 ms
[2020-06-03 06:24:37] [INFO ] Deduced a trap composed of 58 places in 230 ms
[2020-06-03 06:24:37] [INFO ] Deduced a trap composed of 45 places in 164 ms
[2020-06-03 06:24:38] [INFO ] Deduced a trap composed of 143 places in 170 ms
[2020-06-03 06:24:38] [INFO ] Deduced a trap composed of 68 places in 138 ms
[2020-06-03 06:24:38] [INFO ] Deduced a trap composed of 141 places in 145 ms
[2020-06-03 06:24:38] [INFO ] Deduced a trap composed of 144 places in 159 ms
[2020-06-03 06:24:38] [INFO ] Deduced a trap composed of 137 places in 181 ms
[2020-06-03 06:24:38] [INFO ] Deduced a trap composed of 146 places in 131 ms
[2020-06-03 06:24:39] [INFO ] Deduced a trap composed of 133 places in 164 ms
[2020-06-03 06:24:39] [INFO ] Deduced a trap composed of 135 places in 164 ms
[2020-06-03 06:24:39] [INFO ] Deduced a trap composed of 137 places in 159 ms
[2020-06-03 06:24:39] [INFO ] Deduced a trap composed of 141 places in 159 ms
[2020-06-03 06:24:39] [INFO ] Deduced a trap composed of 136 places in 184 ms
[2020-06-03 06:24:40] [INFO ] Deduced a trap composed of 131 places in 154 ms
[2020-06-03 06:24:40] [INFO ] Deduced a trap composed of 145 places in 168 ms
[2020-06-03 06:24:40] [INFO ] Deduced a trap composed of 140 places in 158 ms
[2020-06-03 06:24:40] [INFO ] Deduced a trap composed of 137 places in 158 ms
[2020-06-03 06:24:40] [INFO ] Deduced a trap composed of 133 places in 159 ms
[2020-06-03 06:24:40] [INFO ] Deduced a trap composed of 135 places in 141 ms
[2020-06-03 06:24:41] [INFO ] Deduced a trap composed of 140 places in 160 ms
[2020-06-03 06:24:41] [INFO ] Deduced a trap composed of 138 places in 142 ms
[2020-06-03 06:24:41] [INFO ] Deduced a trap composed of 142 places in 142 ms
[2020-06-03 06:24:41] [INFO ] Deduced a trap composed of 139 places in 140 ms
[2020-06-03 06:24:41] [INFO ] Deduced a trap composed of 137 places in 134 ms
[2020-06-03 06:24:42] [INFO ] Deduced a trap composed of 141 places in 225 ms
[2020-06-03 06:24:42] [INFO ] Deduced a trap composed of 133 places in 187 ms
[2020-06-03 06:24:42] [INFO ] Deduced a trap composed of 137 places in 151 ms
[2020-06-03 06:24:42] [INFO ] Deduced a trap composed of 137 places in 181 ms
[2020-06-03 06:24:42] [INFO ] Deduced a trap composed of 144 places in 141 ms
[2020-06-03 06:24:43] [INFO ] Deduced a trap composed of 148 places in 161 ms
[2020-06-03 06:24:43] [INFO ] Deduced a trap composed of 139 places in 155 ms
[2020-06-03 06:24:43] [INFO ] Deduced a trap composed of 139 places in 139 ms
[2020-06-03 06:24:43] [INFO ] Deduced a trap composed of 144 places in 142 ms
[2020-06-03 06:24:43] [INFO ] Deduced a trap composed of 140 places in 144 ms
[2020-06-03 06:24:43] [INFO ] Deduced a trap composed of 142 places in 142 ms
[2020-06-03 06:24:43] [INFO ] Deduced a trap composed of 34 places in 38 ms
[2020-06-03 06:24:43] [INFO ] Trap strengthening (SAT) tested/added 77/76 trap constraints in 14309 ms
[2020-06-03 06:24:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:24:44] [INFO ] [Nat]Absence check using 62 positive place invariants in 65 ms returned sat
[2020-06-03 06:24:44] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:24:44] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2020-06-03 06:24:45] [INFO ] Deduced a trap composed of 11 places in 151 ms
[2020-06-03 06:24:45] [INFO ] Deduced a trap composed of 11 places in 145 ms
[2020-06-03 06:24:45] [INFO ] Deduced a trap composed of 8 places in 160 ms
[2020-06-03 06:24:45] [INFO ] Deduced a trap composed of 123 places in 152 ms
[2020-06-03 06:24:45] [INFO ] Deduced a trap composed of 21 places in 161 ms
[2020-06-03 06:24:45] [INFO ] Deduced a trap composed of 126 places in 159 ms
[2020-06-03 06:24:46] [INFO ] Deduced a trap composed of 15 places in 153 ms
[2020-06-03 06:24:46] [INFO ] Deduced a trap composed of 127 places in 145 ms
[2020-06-03 06:24:46] [INFO ] Deduced a trap composed of 35 places in 150 ms
[2020-06-03 06:24:46] [INFO ] Deduced a trap composed of 28 places in 159 ms
[2020-06-03 06:24:46] [INFO ] Deduced a trap composed of 30 places in 171 ms
[2020-06-03 06:24:46] [INFO ] Deduced a trap composed of 128 places in 172 ms
[2020-06-03 06:24:47] [INFO ] Deduced a trap composed of 47 places in 147 ms
[2020-06-03 06:24:47] [INFO ] Deduced a trap composed of 149 places in 164 ms
[2020-06-03 06:24:47] [INFO ] Deduced a trap composed of 22 places in 161 ms
[2020-06-03 06:24:47] [INFO ] Deduced a trap composed of 32 places in 168 ms
[2020-06-03 06:24:47] [INFO ] Deduced a trap composed of 29 places in 164 ms
[2020-06-03 06:24:48] [INFO ] Deduced a trap composed of 141 places in 152 ms
[2020-06-03 06:24:48] [INFO ] Deduced a trap composed of 27 places in 150 ms
[2020-06-03 06:24:48] [INFO ] Deduced a trap composed of 39 places in 170 ms
[2020-06-03 06:24:48] [INFO ] Deduced a trap composed of 40 places in 153 ms
[2020-06-03 06:24:48] [INFO ] Deduced a trap composed of 31 places in 160 ms
[2020-06-03 06:24:48] [INFO ] Deduced a trap composed of 130 places in 172 ms
[2020-06-03 06:24:49] [INFO ] Deduced a trap composed of 36 places in 140 ms
[2020-06-03 06:24:49] [INFO ] Deduced a trap composed of 17 places in 160 ms
[2020-06-03 06:24:49] [INFO ] Deduced a trap composed of 123 places in 133 ms
[2020-06-03 06:24:49] [INFO ] Deduced a trap composed of 44 places in 134 ms
[2020-06-03 06:24:49] [INFO ] Deduced a trap composed of 21 places in 153 ms
[2020-06-03 06:24:49] [INFO ] Deduced a trap composed of 28 places in 151 ms
[2020-06-03 06:24:50] [INFO ] Deduced a trap composed of 31 places in 143 ms
[2020-06-03 06:24:50] [INFO ] Deduced a trap composed of 31 places in 138 ms
[2020-06-03 06:24:50] [INFO ] Deduced a trap composed of 137 places in 158 ms
[2020-06-03 06:24:50] [INFO ] Deduced a trap composed of 47 places in 134 ms
[2020-06-03 06:24:50] [INFO ] Deduced a trap composed of 124 places in 159 ms
[2020-06-03 06:24:50] [INFO ] Deduced a trap composed of 38 places in 137 ms
[2020-06-03 06:24:51] [INFO ] Deduced a trap composed of 22 places in 140 ms
[2020-06-03 06:24:51] [INFO ] Deduced a trap composed of 27 places in 191 ms
[2020-06-03 06:24:51] [INFO ] Deduced a trap composed of 23 places in 144 ms
[2020-06-03 06:24:51] [INFO ] Deduced a trap composed of 38 places in 147 ms
[2020-06-03 06:24:51] [INFO ] Deduced a trap composed of 37 places in 157 ms
[2020-06-03 06:24:52] [INFO ] Deduced a trap composed of 127 places in 150 ms
[2020-06-03 06:24:52] [INFO ] Deduced a trap composed of 119 places in 162 ms
[2020-06-03 06:24:52] [INFO ] Deduced a trap composed of 132 places in 152 ms
[2020-06-03 06:24:52] [INFO ] Deduced a trap composed of 35 places in 145 ms
[2020-06-03 06:24:52] [INFO ] Deduced a trap composed of 36 places in 160 ms
[2020-06-03 06:24:52] [INFO ] Deduced a trap composed of 29 places in 168 ms
[2020-06-03 06:24:53] [INFO ] Deduced a trap composed of 22 places in 135 ms
[2020-06-03 06:24:53] [INFO ] Deduced a trap composed of 132 places in 150 ms
[2020-06-03 06:24:53] [INFO ] Deduced a trap composed of 55 places in 143 ms
[2020-06-03 06:24:53] [INFO ] Deduced a trap composed of 30 places in 142 ms
[2020-06-03 06:24:53] [INFO ] Deduced a trap composed of 35 places in 130 ms
[2020-06-03 06:24:53] [INFO ] Deduced a trap composed of 124 places in 133 ms
[2020-06-03 06:24:54] [INFO ] Deduced a trap composed of 60 places in 130 ms
[2020-06-03 06:24:54] [INFO ] Deduced a trap composed of 143 places in 127 ms
[2020-06-03 06:24:54] [INFO ] Deduced a trap composed of 132 places in 130 ms
[2020-06-03 06:24:54] [INFO ] Deduced a trap composed of 156 places in 185 ms
[2020-06-03 06:24:54] [INFO ] Deduced a trap composed of 144 places in 156 ms
[2020-06-03 06:24:54] [INFO ] Deduced a trap composed of 44 places in 168 ms
[2020-06-03 06:24:55] [INFO ] Deduced a trap composed of 31 places in 153 ms
[2020-06-03 06:24:55] [INFO ] Deduced a trap composed of 129 places in 134 ms
[2020-06-03 06:24:55] [INFO ] Deduced a trap composed of 142 places in 150 ms
[2020-06-03 06:24:55] [INFO ] Deduced a trap composed of 51 places in 157 ms
[2020-06-03 06:24:55] [INFO ] Deduced a trap composed of 75 places in 191 ms
[2020-06-03 06:24:55] [INFO ] Deduced a trap composed of 63 places in 145 ms
[2020-06-03 06:24:56] [INFO ] Deduced a trap composed of 55 places in 134 ms
[2020-06-03 06:24:56] [INFO ] Deduced a trap composed of 42 places in 143 ms
[2020-06-03 06:24:56] [INFO ] Deduced a trap composed of 43 places in 141 ms
[2020-06-03 06:24:56] [INFO ] Deduced a trap composed of 45 places in 132 ms
[2020-06-03 06:24:56] [INFO ] Deduced a trap composed of 46 places in 132 ms
[2020-06-03 06:24:56] [INFO ] Deduced a trap composed of 58 places in 135 ms
[2020-06-03 06:24:57] [INFO ] Deduced a trap composed of 119 places in 124 ms
[2020-06-03 06:24:57] [INFO ] Deduced a trap composed of 123 places in 148 ms
[2020-06-03 06:24:57] [INFO ] Deduced a trap composed of 138 places in 128 ms
[2020-06-03 06:24:57] [INFO ] Deduced a trap composed of 125 places in 141 ms
[2020-06-03 06:24:57] [INFO ] Deduced a trap composed of 34 places in 87 ms
[2020-06-03 06:24:57] [INFO ] Deduced a trap composed of 59 places in 73 ms
[2020-06-03 06:24:57] [INFO ] Deduced a trap composed of 53 places in 93 ms
[2020-06-03 06:24:58] [INFO ] Deduced a trap composed of 79 places in 164 ms
[2020-06-03 06:24:58] [INFO ] Deduced a trap composed of 144 places in 181 ms
[2020-06-03 06:24:58] [INFO ] Deduced a trap composed of 133 places in 137 ms
[2020-06-03 06:24:58] [INFO ] Deduced a trap composed of 129 places in 143 ms
[2020-06-03 06:24:58] [INFO ] Deduced a trap composed of 132 places in 142 ms
[2020-06-03 06:24:58] [INFO ] Deduced a trap composed of 144 places in 138 ms
[2020-06-03 06:24:59] [INFO ] Deduced a trap composed of 57 places in 136 ms
[2020-06-03 06:24:59] [INFO ] Deduced a trap composed of 60 places in 141 ms
[2020-06-03 06:24:59] [INFO ] Deduced a trap composed of 149 places in 144 ms
[2020-06-03 06:24:59] [INFO ] Deduced a trap composed of 74 places in 135 ms
[2020-06-03 06:24:59] [INFO ] Deduced a trap composed of 63 places in 172 ms
[2020-06-03 06:24:59] [INFO ] Deduced a trap composed of 57 places in 121 ms
[2020-06-03 06:25:00] [INFO ] Deduced a trap composed of 77 places in 139 ms
[2020-06-03 06:25:00] [INFO ] Deduced a trap composed of 130 places in 138 ms
[2020-06-03 06:25:00] [INFO ] Deduced a trap composed of 15 places in 142 ms
[2020-06-03 06:25:00] [INFO ] Deduced a trap composed of 128 places in 171 ms
[2020-06-03 06:25:00] [INFO ] Deduced a trap composed of 153 places in 140 ms
[2020-06-03 06:25:00] [INFO ] Deduced a trap composed of 132 places in 125 ms
[2020-06-03 06:25:00] [INFO ] Deduced a trap composed of 59 places in 64 ms
[2020-06-03 06:25:01] [INFO ] Deduced a trap composed of 63 places in 63 ms
[2020-06-03 06:25:01] [INFO ] Deduced a trap composed of 62 places in 56 ms
[2020-06-03 06:25:01] [INFO ] Deduced a trap composed of 77 places in 54 ms
[2020-06-03 06:25:01] [INFO ] Deduced a trap composed of 63 places in 145 ms
[2020-06-03 06:25:01] [INFO ] Deduced a trap composed of 69 places in 136 ms
[2020-06-03 06:25:01] [INFO ] Deduced a trap composed of 19 places in 170 ms
[2020-06-03 06:25:01] [INFO ] Deduced a trap composed of 36 places in 145 ms
[2020-06-03 06:25:02] [INFO ] Deduced a trap composed of 63 places in 133 ms
[2020-06-03 06:25:02] [INFO ] Deduced a trap composed of 75 places in 123 ms
[2020-06-03 06:25:02] [INFO ] Deduced a trap composed of 172 places in 147 ms
[2020-06-03 06:25:02] [INFO ] Deduced a trap composed of 123 places in 154 ms
[2020-06-03 06:25:02] [INFO ] Deduced a trap composed of 147 places in 127 ms
[2020-06-03 06:25:02] [INFO ] Deduced a trap composed of 81 places in 151 ms
[2020-06-03 06:25:02] [INFO ] Trap strengthening (SAT) tested/added 110/109 trap constraints in 18116 ms
[2020-06-03 06:25:03] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 29 ms.
[2020-06-03 06:25:03] [INFO ] Added : 140 causal constraints over 28 iterations in 989 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 06:25:04] [INFO ] [Real]Absence check using 62 positive place invariants in 38 ms returned sat
[2020-06-03 06:25:04] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:25:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:25:04] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2020-06-03 06:25:05] [INFO ] Deduced a trap composed of 29 places in 147 ms
[2020-06-03 06:25:05] [INFO ] Deduced a trap composed of 141 places in 162 ms
[2020-06-03 06:25:05] [INFO ] Deduced a trap composed of 15 places in 147 ms
[2020-06-03 06:25:05] [INFO ] Deduced a trap composed of 18 places in 147 ms
[2020-06-03 06:25:05] [INFO ] Deduced a trap composed of 20 places in 139 ms
[2020-06-03 06:25:05] [INFO ] Deduced a trap composed of 11 places in 138 ms
[2020-06-03 06:25:06] [INFO ] Deduced a trap composed of 22 places in 139 ms
[2020-06-03 06:25:06] [INFO ] Deduced a trap composed of 120 places in 135 ms
[2020-06-03 06:25:06] [INFO ] Deduced a trap composed of 31 places in 137 ms
[2020-06-03 06:25:06] [INFO ] Deduced a trap composed of 27 places in 155 ms
[2020-06-03 06:25:06] [INFO ] Deduced a trap composed of 19 places in 155 ms
[2020-06-03 06:25:06] [INFO ] Deduced a trap composed of 32 places in 137 ms
[2020-06-03 06:25:06] [INFO ] Deduced a trap composed of 133 places in 141 ms
[2020-06-03 06:25:07] [INFO ] Deduced a trap composed of 115 places in 131 ms
[2020-06-03 06:25:07] [INFO ] Deduced a trap composed of 120 places in 134 ms
[2020-06-03 06:25:07] [INFO ] Deduced a trap composed of 119 places in 133 ms
[2020-06-03 06:25:07] [INFO ] Deduced a trap composed of 118 places in 150 ms
[2020-06-03 06:25:07] [INFO ] Deduced a trap composed of 37 places in 140 ms
[2020-06-03 06:25:07] [INFO ] Deduced a trap composed of 28 places in 153 ms
[2020-06-03 06:25:08] [INFO ] Deduced a trap composed of 29 places in 134 ms
[2020-06-03 06:25:08] [INFO ] Deduced a trap composed of 25 places in 133 ms
[2020-06-03 06:25:08] [INFO ] Deduced a trap composed of 73 places in 139 ms
[2020-06-03 06:25:08] [INFO ] Deduced a trap composed of 44 places in 174 ms
[2020-06-03 06:25:08] [INFO ] Deduced a trap composed of 49 places in 144 ms
[2020-06-03 06:25:08] [INFO ] Deduced a trap composed of 43 places in 144 ms
[2020-06-03 06:25:09] [INFO ] Deduced a trap composed of 54 places in 131 ms
[2020-06-03 06:25:09] [INFO ] Deduced a trap composed of 12 places in 154 ms
[2020-06-03 06:25:09] [INFO ] Deduced a trap composed of 118 places in 124 ms
[2020-06-03 06:25:09] [INFO ] Deduced a trap composed of 121 places in 156 ms
[2020-06-03 06:25:09] [INFO ] Deduced a trap composed of 124 places in 152 ms
[2020-06-03 06:25:09] [INFO ] Deduced a trap composed of 119 places in 145 ms
[2020-06-03 06:25:10] [INFO ] Deduced a trap composed of 66 places in 147 ms
[2020-06-03 06:25:10] [INFO ] Deduced a trap composed of 141 places in 135 ms
[2020-06-03 06:25:10] [INFO ] Deduced a trap composed of 146 places in 124 ms
[2020-06-03 06:25:10] [INFO ] Deduced a trap composed of 133 places in 135 ms
[2020-06-03 06:25:10] [INFO ] Deduced a trap composed of 50 places in 130 ms
[2020-06-03 06:25:10] [INFO ] Deduced a trap composed of 132 places in 132 ms
[2020-06-03 06:25:11] [INFO ] Deduced a trap composed of 136 places in 136 ms
[2020-06-03 06:25:11] [INFO ] Deduced a trap composed of 138 places in 128 ms
[2020-06-03 06:25:11] [INFO ] Deduced a trap composed of 135 places in 131 ms
[2020-06-03 06:25:11] [INFO ] Deduced a trap composed of 133 places in 127 ms
[2020-06-03 06:25:11] [INFO ] Deduced a trap composed of 139 places in 134 ms
[2020-06-03 06:25:11] [INFO ] Deduced a trap composed of 147 places in 142 ms
[2020-06-03 06:25:11] [INFO ] Deduced a trap composed of 137 places in 139 ms
[2020-06-03 06:25:12] [INFO ] Deduced a trap composed of 155 places in 130 ms
[2020-06-03 06:25:12] [INFO ] Deduced a trap composed of 163 places in 149 ms
[2020-06-03 06:25:12] [INFO ] Deduced a trap composed of 152 places in 134 ms
[2020-06-03 06:25:12] [INFO ] Deduced a trap composed of 66 places in 134 ms
[2020-06-03 06:25:12] [INFO ] Deduced a trap composed of 42 places in 134 ms
[2020-06-03 06:25:12] [INFO ] Deduced a trap composed of 48 places in 130 ms
[2020-06-03 06:25:13] [INFO ] Deduced a trap composed of 68 places in 124 ms
[2020-06-03 06:25:13] [INFO ] Deduced a trap composed of 139 places in 126 ms
[2020-06-03 06:25:13] [INFO ] Deduced a trap composed of 141 places in 126 ms
[2020-06-03 06:25:13] [INFO ] Deduced a trap composed of 85 places in 133 ms
[2020-06-03 06:25:13] [INFO ] Deduced a trap composed of 142 places in 141 ms
[2020-06-03 06:25:13] [INFO ] Deduced a trap composed of 143 places in 128 ms
[2020-06-03 06:25:13] [INFO ] Deduced a trap composed of 133 places in 123 ms
[2020-06-03 06:25:14] [INFO ] Deduced a trap composed of 134 places in 152 ms
[2020-06-03 06:25:14] [INFO ] Deduced a trap composed of 30 places in 50 ms
[2020-06-03 06:25:14] [INFO ] Trap strengthening (SAT) tested/added 60/59 trap constraints in 9324 ms
[2020-06-03 06:25:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:25:14] [INFO ] [Nat]Absence check using 62 positive place invariants in 44 ms returned sat
[2020-06-03 06:25:14] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 33 ms returned sat
[2020-06-03 06:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:25:15] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2020-06-03 06:25:15] [INFO ] Deduced a trap composed of 11 places in 171 ms
[2020-06-03 06:25:15] [INFO ] Deduced a trap composed of 29 places in 169 ms
[2020-06-03 06:25:15] [INFO ] Deduced a trap composed of 12 places in 141 ms
[2020-06-03 06:25:15] [INFO ] Deduced a trap composed of 43 places in 152 ms
[2020-06-03 06:25:15] [INFO ] Deduced a trap composed of 15 places in 140 ms
[2020-06-03 06:25:16] [INFO ] Deduced a trap composed of 143 places in 145 ms
[2020-06-03 06:25:16] [INFO ] Deduced a trap composed of 116 places in 149 ms
[2020-06-03 06:25:16] [INFO ] Deduced a trap composed of 119 places in 143 ms
[2020-06-03 06:25:16] [INFO ] Deduced a trap composed of 109 places in 148 ms
[2020-06-03 06:25:16] [INFO ] Deduced a trap composed of 29 places in 173 ms
[2020-06-03 06:25:17] [INFO ] Deduced a trap composed of 17 places in 160 ms
[2020-06-03 06:25:17] [INFO ] Deduced a trap composed of 32 places in 138 ms
[2020-06-03 06:25:17] [INFO ] Deduced a trap composed of 114 places in 156 ms
[2020-06-03 06:25:17] [INFO ] Deduced a trap composed of 114 places in 149 ms
[2020-06-03 06:25:17] [INFO ] Deduced a trap composed of 30 places in 205 ms
[2020-06-03 06:25:17] [INFO ] Deduced a trap composed of 42 places in 162 ms
[2020-06-03 06:25:18] [INFO ] Deduced a trap composed of 119 places in 127 ms
[2020-06-03 06:25:18] [INFO ] Deduced a trap composed of 135 places in 141 ms
[2020-06-03 06:25:18] [INFO ] Deduced a trap composed of 44 places in 154 ms
[2020-06-03 06:25:18] [INFO ] Deduced a trap composed of 121 places in 187 ms
[2020-06-03 06:25:18] [INFO ] Deduced a trap composed of 113 places in 163 ms
[2020-06-03 06:25:18] [INFO ] Deduced a trap composed of 115 places in 138 ms
[2020-06-03 06:25:19] [INFO ] Deduced a trap composed of 118 places in 162 ms
[2020-06-03 06:25:19] [INFO ] Deduced a trap composed of 30 places in 132 ms
[2020-06-03 06:25:19] [INFO ] Deduced a trap composed of 52 places in 164 ms
[2020-06-03 06:25:19] [INFO ] Deduced a trap composed of 32 places in 154 ms
[2020-06-03 06:25:19] [INFO ] Deduced a trap composed of 132 places in 145 ms
[2020-06-03 06:25:19] [INFO ] Deduced a trap composed of 128 places in 128 ms
[2020-06-03 06:25:20] [INFO ] Deduced a trap composed of 123 places in 132 ms
[2020-06-03 06:25:20] [INFO ] Deduced a trap composed of 116 places in 123 ms
[2020-06-03 06:25:20] [INFO ] Deduced a trap composed of 24 places in 130 ms
[2020-06-03 06:25:20] [INFO ] Deduced a trap composed of 120 places in 129 ms
[2020-06-03 06:25:20] [INFO ] Deduced a trap composed of 118 places in 130 ms
[2020-06-03 06:25:20] [INFO ] Deduced a trap composed of 38 places in 137 ms
[2020-06-03 06:25:21] [INFO ] Deduced a trap composed of 121 places in 137 ms
[2020-06-03 06:25:21] [INFO ] Deduced a trap composed of 121 places in 198 ms
[2020-06-03 06:25:21] [INFO ] Deduced a trap composed of 32 places in 140 ms
[2020-06-03 06:25:21] [INFO ] Deduced a trap composed of 136 places in 130 ms
[2020-06-03 06:25:21] [INFO ] Deduced a trap composed of 134 places in 137 ms
[2020-06-03 06:25:21] [INFO ] Deduced a trap composed of 39 places in 150 ms
[2020-06-03 06:25:22] [INFO ] Deduced a trap composed of 21 places in 124 ms
[2020-06-03 06:25:22] [INFO ] Deduced a trap composed of 122 places in 122 ms
[2020-06-03 06:25:22] [INFO ] Deduced a trap composed of 118 places in 159 ms
[2020-06-03 06:25:22] [INFO ] Deduced a trap composed of 124 places in 130 ms
[2020-06-03 06:25:22] [INFO ] Deduced a trap composed of 128 places in 140 ms
[2020-06-03 06:25:22] [INFO ] Deduced a trap composed of 118 places in 122 ms
[2020-06-03 06:25:22] [INFO ] Deduced a trap composed of 33 places in 122 ms
[2020-06-03 06:25:23] [INFO ] Deduced a trap composed of 122 places in 129 ms
[2020-06-03 06:25:23] [INFO ] Deduced a trap composed of 126 places in 134 ms
[2020-06-03 06:25:23] [INFO ] Deduced a trap composed of 121 places in 125 ms
[2020-06-03 06:25:23] [INFO ] Deduced a trap composed of 48 places in 133 ms
[2020-06-03 06:25:23] [INFO ] Deduced a trap composed of 128 places in 129 ms
[2020-06-03 06:25:23] [INFO ] Deduced a trap composed of 121 places in 125 ms
[2020-06-03 06:25:24] [INFO ] Deduced a trap composed of 64 places in 128 ms
[2020-06-03 06:25:24] [INFO ] Deduced a trap composed of 118 places in 122 ms
[2020-06-03 06:25:24] [INFO ] Deduced a trap composed of 30 places in 123 ms
[2020-06-03 06:25:24] [INFO ] Deduced a trap composed of 125 places in 136 ms
[2020-06-03 06:25:24] [INFO ] Deduced a trap composed of 49 places in 132 ms
[2020-06-03 06:25:24] [INFO ] Deduced a trap composed of 134 places in 134 ms
[2020-06-03 06:25:24] [INFO ] Deduced a trap composed of 139 places in 135 ms
[2020-06-03 06:25:25] [INFO ] Deduced a trap composed of 140 places in 171 ms
[2020-06-03 06:25:25] [INFO ] Deduced a trap composed of 115 places in 127 ms
[2020-06-03 06:25:25] [INFO ] Deduced a trap composed of 122 places in 130 ms
[2020-06-03 06:25:25] [INFO ] Deduced a trap composed of 44 places in 128 ms
[2020-06-03 06:25:25] [INFO ] Deduced a trap composed of 127 places in 122 ms
[2020-06-03 06:25:25] [INFO ] Deduced a trap composed of 122 places in 136 ms
[2020-06-03 06:25:26] [INFO ] Deduced a trap composed of 44 places in 125 ms
[2020-06-03 06:25:26] [INFO ] Deduced a trap composed of 122 places in 122 ms
[2020-06-03 06:25:26] [INFO ] Deduced a trap composed of 138 places in 126 ms
[2020-06-03 06:25:26] [INFO ] Deduced a trap composed of 43 places in 128 ms
[2020-06-03 06:25:26] [INFO ] Deduced a trap composed of 137 places in 126 ms
[2020-06-03 06:25:26] [INFO ] Deduced a trap composed of 42 places in 128 ms
[2020-06-03 06:25:26] [INFO ] Deduced a trap composed of 122 places in 130 ms
[2020-06-03 06:25:27] [INFO ] Deduced a trap composed of 144 places in 132 ms
[2020-06-03 06:25:27] [INFO ] Deduced a trap composed of 139 places in 133 ms
[2020-06-03 06:25:27] [INFO ] Deduced a trap composed of 131 places in 123 ms
[2020-06-03 06:25:27] [INFO ] Deduced a trap composed of 148 places in 129 ms
[2020-06-03 06:25:27] [INFO ] Deduced a trap composed of 149 places in 119 ms
[2020-06-03 06:25:27] [INFO ] Deduced a trap composed of 139 places in 122 ms
[2020-06-03 06:25:27] [INFO ] Deduced a trap composed of 146 places in 118 ms
[2020-06-03 06:25:28] [INFO ] Deduced a trap composed of 145 places in 119 ms
[2020-06-03 06:25:28] [INFO ] Deduced a trap composed of 146 places in 118 ms
[2020-06-03 06:25:28] [INFO ] Deduced a trap composed of 139 places in 123 ms
[2020-06-03 06:25:28] [INFO ] Deduced a trap composed of 144 places in 125 ms
[2020-06-03 06:25:28] [INFO ] Deduced a trap composed of 145 places in 121 ms
[2020-06-03 06:25:28] [INFO ] Deduced a trap composed of 143 places in 135 ms
[2020-06-03 06:25:28] [INFO ] Deduced a trap composed of 30 places in 46 ms
[2020-06-03 06:25:28] [INFO ] Trap strengthening (SAT) tested/added 88/87 trap constraints in 13789 ms
[2020-06-03 06:25:28] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 36 ms.
[2020-06-03 06:25:31] [INFO ] Added : 350 causal constraints over 70 iterations in 3023 ms. Result :sat
[2020-06-03 06:25:32] [INFO ] [Real]Absence check using 62 positive place invariants in 55 ms returned sat
[2020-06-03 06:25:32] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-06-03 06:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:25:32] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2020-06-03 06:25:33] [INFO ] Deduced a trap composed of 29 places in 196 ms
[2020-06-03 06:25:33] [INFO ] Deduced a trap composed of 141 places in 158 ms
[2020-06-03 06:25:33] [INFO ] Deduced a trap composed of 15 places in 135 ms
[2020-06-03 06:25:33] [INFO ] Deduced a trap composed of 18 places in 153 ms
[2020-06-03 06:25:33] [INFO ] Deduced a trap composed of 20 places in 138 ms
[2020-06-03 06:25:33] [INFO ] Deduced a trap composed of 11 places in 145 ms
[2020-06-03 06:25:34] [INFO ] Deduced a trap composed of 22 places in 143 ms
[2020-06-03 06:25:34] [INFO ] Deduced a trap composed of 120 places in 141 ms
[2020-06-03 06:25:34] [INFO ] Deduced a trap composed of 31 places in 131 ms
[2020-06-03 06:25:34] [INFO ] Deduced a trap composed of 27 places in 142 ms
[2020-06-03 06:25:34] [INFO ] Deduced a trap composed of 19 places in 147 ms
[2020-06-03 06:25:34] [INFO ] Deduced a trap composed of 32 places in 141 ms
[2020-06-03 06:25:35] [INFO ] Deduced a trap composed of 133 places in 141 ms
[2020-06-03 06:25:35] [INFO ] Deduced a trap composed of 115 places in 130 ms
[2020-06-03 06:25:35] [INFO ] Deduced a trap composed of 120 places in 133 ms
[2020-06-03 06:25:35] [INFO ] Deduced a trap composed of 119 places in 134 ms
[2020-06-03 06:25:35] [INFO ] Deduced a trap composed of 118 places in 139 ms
[2020-06-03 06:25:35] [INFO ] Deduced a trap composed of 37 places in 134 ms
[2020-06-03 06:25:35] [INFO ] Deduced a trap composed of 28 places in 135 ms
[2020-06-03 06:25:36] [INFO ] Deduced a trap composed of 29 places in 134 ms
[2020-06-03 06:25:36] [INFO ] Deduced a trap composed of 25 places in 137 ms
[2020-06-03 06:25:36] [INFO ] Deduced a trap composed of 73 places in 134 ms
[2020-06-03 06:25:36] [INFO ] Deduced a trap composed of 44 places in 133 ms
[2020-06-03 06:25:36] [INFO ] Deduced a trap composed of 49 places in 122 ms
[2020-06-03 06:25:36] [INFO ] Deduced a trap composed of 43 places in 138 ms
[2020-06-03 06:25:37] [INFO ] Deduced a trap composed of 54 places in 134 ms
[2020-06-03 06:25:37] [INFO ] Deduced a trap composed of 12 places in 135 ms
[2020-06-03 06:25:37] [INFO ] Deduced a trap composed of 118 places in 139 ms
[2020-06-03 06:25:37] [INFO ] Deduced a trap composed of 121 places in 135 ms
[2020-06-03 06:25:37] [INFO ] Deduced a trap composed of 124 places in 136 ms
[2020-06-03 06:25:37] [INFO ] Deduced a trap composed of 119 places in 134 ms
[2020-06-03 06:25:37] [INFO ] Deduced a trap composed of 66 places in 120 ms
[2020-06-03 06:25:38] [INFO ] Deduced a trap composed of 141 places in 127 ms
[2020-06-03 06:25:38] [INFO ] Deduced a trap composed of 146 places in 132 ms
[2020-06-03 06:25:38] [INFO ] Deduced a trap composed of 133 places in 128 ms
[2020-06-03 06:25:38] [INFO ] Deduced a trap composed of 50 places in 140 ms
[2020-06-03 06:25:38] [INFO ] Deduced a trap composed of 132 places in 129 ms
[2020-06-03 06:25:38] [INFO ] Deduced a trap composed of 136 places in 132 ms
[2020-06-03 06:25:39] [INFO ] Deduced a trap composed of 138 places in 128 ms
[2020-06-03 06:25:39] [INFO ] Deduced a trap composed of 135 places in 139 ms
[2020-06-03 06:25:39] [INFO ] Deduced a trap composed of 133 places in 132 ms
[2020-06-03 06:25:39] [INFO ] Deduced a trap composed of 139 places in 135 ms
[2020-06-03 06:25:39] [INFO ] Deduced a trap composed of 147 places in 129 ms
[2020-06-03 06:25:39] [INFO ] Deduced a trap composed of 137 places in 122 ms
[2020-06-03 06:25:39] [INFO ] Deduced a trap composed of 155 places in 140 ms
[2020-06-03 06:25:40] [INFO ] Deduced a trap composed of 163 places in 138 ms
[2020-06-03 06:25:40] [INFO ] Deduced a trap composed of 152 places in 133 ms
[2020-06-03 06:25:40] [INFO ] Deduced a trap composed of 66 places in 134 ms
[2020-06-03 06:25:40] [INFO ] Deduced a trap composed of 42 places in 140 ms
[2020-06-03 06:25:40] [INFO ] Deduced a trap composed of 48 places in 137 ms
[2020-06-03 06:25:40] [INFO ] Deduced a trap composed of 68 places in 120 ms
[2020-06-03 06:25:41] [INFO ] Deduced a trap composed of 139 places in 131 ms
[2020-06-03 06:25:41] [INFO ] Deduced a trap composed of 141 places in 121 ms
[2020-06-03 06:25:41] [INFO ] Deduced a trap composed of 85 places in 152 ms
[2020-06-03 06:25:41] [INFO ] Deduced a trap composed of 142 places in 132 ms
[2020-06-03 06:25:41] [INFO ] Deduced a trap composed of 143 places in 134 ms
[2020-06-03 06:25:41] [INFO ] Deduced a trap composed of 133 places in 135 ms
[2020-06-03 06:25:41] [INFO ] Deduced a trap composed of 134 places in 121 ms
[2020-06-03 06:25:42] [INFO ] Deduced a trap composed of 30 places in 46 ms
[2020-06-03 06:25:42] [INFO ] Trap strengthening (SAT) tested/added 60/59 trap constraints in 9218 ms
[2020-06-03 06:25:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:25:42] [INFO ] [Nat]Absence check using 62 positive place invariants in 113 ms returned sat
[2020-06-03 06:25:42] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:25:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:25:43] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2020-06-03 06:25:43] [INFO ] Deduced a trap composed of 11 places in 148 ms
[2020-06-03 06:25:43] [INFO ] Deduced a trap composed of 29 places in 142 ms
[2020-06-03 06:25:43] [INFO ] Deduced a trap composed of 12 places in 149 ms
[2020-06-03 06:25:43] [INFO ] Deduced a trap composed of 43 places in 144 ms
[2020-06-03 06:25:43] [INFO ] Deduced a trap composed of 15 places in 151 ms
[2020-06-03 06:25:44] [INFO ] Deduced a trap composed of 143 places in 148 ms
[2020-06-03 06:25:44] [INFO ] Deduced a trap composed of 116 places in 137 ms
[2020-06-03 06:25:44] [INFO ] Deduced a trap composed of 119 places in 135 ms
[2020-06-03 06:25:44] [INFO ] Deduced a trap composed of 109 places in 134 ms
[2020-06-03 06:25:44] [INFO ] Deduced a trap composed of 29 places in 137 ms
[2020-06-03 06:25:44] [INFO ] Deduced a trap composed of 17 places in 135 ms
[2020-06-03 06:25:44] [INFO ] Deduced a trap composed of 32 places in 131 ms
[2020-06-03 06:25:45] [INFO ] Deduced a trap composed of 114 places in 197 ms
[2020-06-03 06:25:45] [INFO ] Deduced a trap composed of 114 places in 129 ms
[2020-06-03 06:25:45] [INFO ] Deduced a trap composed of 30 places in 130 ms
[2020-06-03 06:25:45] [INFO ] Deduced a trap composed of 42 places in 128 ms
[2020-06-03 06:25:45] [INFO ] Deduced a trap composed of 119 places in 133 ms
[2020-06-03 06:25:45] [INFO ] Deduced a trap composed of 135 places in 138 ms
[2020-06-03 06:25:46] [INFO ] Deduced a trap composed of 44 places in 134 ms
[2020-06-03 06:25:46] [INFO ] Deduced a trap composed of 121 places in 141 ms
[2020-06-03 06:25:46] [INFO ] Deduced a trap composed of 113 places in 138 ms
[2020-06-03 06:25:46] [INFO ] Deduced a trap composed of 115 places in 144 ms
[2020-06-03 06:25:46] [INFO ] Deduced a trap composed of 118 places in 131 ms
[2020-06-03 06:25:46] [INFO ] Deduced a trap composed of 30 places in 131 ms
[2020-06-03 06:25:47] [INFO ] Deduced a trap composed of 52 places in 133 ms
[2020-06-03 06:25:47] [INFO ] Deduced a trap composed of 32 places in 126 ms
[2020-06-03 06:25:47] [INFO ] Deduced a trap composed of 132 places in 137 ms
[2020-06-03 06:25:47] [INFO ] Deduced a trap composed of 128 places in 137 ms
[2020-06-03 06:25:47] [INFO ] Deduced a trap composed of 123 places in 136 ms
[2020-06-03 06:25:47] [INFO ] Deduced a trap composed of 116 places in 131 ms
[2020-06-03 06:25:47] [INFO ] Deduced a trap composed of 24 places in 135 ms
[2020-06-03 06:25:48] [INFO ] Deduced a trap composed of 120 places in 131 ms
[2020-06-03 06:25:48] [INFO ] Deduced a trap composed of 118 places in 133 ms
[2020-06-03 06:25:48] [INFO ] Deduced a trap composed of 38 places in 134 ms
[2020-06-03 06:25:48] [INFO ] Deduced a trap composed of 121 places in 136 ms
[2020-06-03 06:25:48] [INFO ] Deduced a trap composed of 121 places in 129 ms
[2020-06-03 06:25:48] [INFO ] Deduced a trap composed of 32 places in 121 ms
[2020-06-03 06:25:48] [INFO ] Deduced a trap composed of 136 places in 122 ms
[2020-06-03 06:25:49] [INFO ] Deduced a trap composed of 134 places in 133 ms
[2020-06-03 06:25:49] [INFO ] Deduced a trap composed of 39 places in 129 ms
[2020-06-03 06:25:49] [INFO ] Deduced a trap composed of 21 places in 130 ms
[2020-06-03 06:25:49] [INFO ] Deduced a trap composed of 122 places in 126 ms
[2020-06-03 06:25:49] [INFO ] Deduced a trap composed of 118 places in 138 ms
[2020-06-03 06:25:49] [INFO ] Deduced a trap composed of 124 places in 138 ms
[2020-06-03 06:25:50] [INFO ] Deduced a trap composed of 128 places in 139 ms
[2020-06-03 06:25:50] [INFO ] Deduced a trap composed of 118 places in 137 ms
[2020-06-03 06:25:50] [INFO ] Deduced a trap composed of 33 places in 132 ms
[2020-06-03 06:25:50] [INFO ] Deduced a trap composed of 122 places in 132 ms
[2020-06-03 06:25:50] [INFO ] Deduced a trap composed of 126 places in 133 ms
[2020-06-03 06:25:50] [INFO ] Deduced a trap composed of 121 places in 123 ms
[2020-06-03 06:25:50] [INFO ] Deduced a trap composed of 48 places in 126 ms
[2020-06-03 06:25:51] [INFO ] Deduced a trap composed of 128 places in 129 ms
[2020-06-03 06:25:51] [INFO ] Deduced a trap composed of 121 places in 132 ms
[2020-06-03 06:25:51] [INFO ] Deduced a trap composed of 64 places in 132 ms
[2020-06-03 06:25:51] [INFO ] Deduced a trap composed of 118 places in 133 ms
[2020-06-03 06:25:51] [INFO ] Deduced a trap composed of 30 places in 138 ms
[2020-06-03 06:25:51] [INFO ] Deduced a trap composed of 125 places in 123 ms
[2020-06-03 06:25:51] [INFO ] Deduced a trap composed of 49 places in 127 ms
[2020-06-03 06:25:52] [INFO ] Deduced a trap composed of 134 places in 125 ms
[2020-06-03 06:25:52] [INFO ] Deduced a trap composed of 139 places in 135 ms
[2020-06-03 06:25:52] [INFO ] Deduced a trap composed of 140 places in 131 ms
[2020-06-03 06:25:52] [INFO ] Deduced a trap composed of 115 places in 124 ms
[2020-06-03 06:25:52] [INFO ] Deduced a trap composed of 122 places in 132 ms
[2020-06-03 06:25:52] [INFO ] Deduced a trap composed of 44 places in 146 ms
[2020-06-03 06:25:53] [INFO ] Deduced a trap composed of 127 places in 135 ms
[2020-06-03 06:25:53] [INFO ] Deduced a trap composed of 122 places in 129 ms
[2020-06-03 06:25:53] [INFO ] Deduced a trap composed of 44 places in 150 ms
[2020-06-03 06:25:53] [INFO ] Deduced a trap composed of 122 places in 118 ms
[2020-06-03 06:25:53] [INFO ] Deduced a trap composed of 138 places in 121 ms
[2020-06-03 06:25:53] [INFO ] Deduced a trap composed of 43 places in 119 ms
[2020-06-03 06:25:53] [INFO ] Deduced a trap composed of 137 places in 123 ms
[2020-06-03 06:25:54] [INFO ] Deduced a trap composed of 42 places in 117 ms
[2020-06-03 06:25:54] [INFO ] Deduced a trap composed of 122 places in 118 ms
[2020-06-03 06:25:54] [INFO ] Deduced a trap composed of 144 places in 121 ms
[2020-06-03 06:25:54] [INFO ] Deduced a trap composed of 139 places in 119 ms
[2020-06-03 06:25:54] [INFO ] Deduced a trap composed of 131 places in 122 ms
[2020-06-03 06:25:54] [INFO ] Deduced a trap composed of 148 places in 124 ms
[2020-06-03 06:25:54] [INFO ] Deduced a trap composed of 149 places in 118 ms
[2020-06-03 06:25:55] [INFO ] Deduced a trap composed of 139 places in 121 ms
[2020-06-03 06:25:55] [INFO ] Deduced a trap composed of 146 places in 122 ms
[2020-06-03 06:25:55] [INFO ] Deduced a trap composed of 145 places in 132 ms
[2020-06-03 06:25:55] [INFO ] Deduced a trap composed of 146 places in 130 ms
[2020-06-03 06:25:55] [INFO ] Deduced a trap composed of 139 places in 121 ms
[2020-06-03 06:25:55] [INFO ] Deduced a trap composed of 144 places in 126 ms
[2020-06-03 06:25:55] [INFO ] Deduced a trap composed of 145 places in 130 ms
[2020-06-03 06:25:56] [INFO ] Deduced a trap composed of 143 places in 125 ms
[2020-06-03 06:25:56] [INFO ] Deduced a trap composed of 30 places in 46 ms
[2020-06-03 06:25:56] [INFO ] Trap strengthening (SAT) tested/added 88/87 trap constraints in 13144 ms
[2020-06-03 06:25:56] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 38 ms.
[2020-06-03 06:25:59] [INFO ] Added : 350 causal constraints over 70 iterations in 3207 ms. Result :sat
[2020-06-03 06:25:59] [INFO ] [Real]Absence check using 62 positive place invariants in 55 ms returned sat
[2020-06-03 06:25:59] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:25:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:26:00] [INFO ] [Real]Absence check using state equation in 593 ms returned unsat
[2020-06-03 06:26:00] [INFO ] [Real]Absence check using 62 positive place invariants in 39 ms returned sat
[2020-06-03 06:26:00] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 31 ms returned sat
[2020-06-03 06:26:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:26:01] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2020-06-03 06:26:01] [INFO ] Deduced a trap composed of 11 places in 162 ms
[2020-06-03 06:26:01] [INFO ] Deduced a trap composed of 15 places in 170 ms
[2020-06-03 06:26:01] [INFO ] Deduced a trap composed of 8 places in 178 ms
[2020-06-03 06:26:01] [INFO ] Deduced a trap composed of 125 places in 173 ms
[2020-06-03 06:26:02] [INFO ] Deduced a trap composed of 44 places in 172 ms
[2020-06-03 06:26:02] [INFO ] Deduced a trap composed of 124 places in 169 ms
[2020-06-03 06:26:02] [INFO ] Deduced a trap composed of 41 places in 173 ms
[2020-06-03 06:26:02] [INFO ] Deduced a trap composed of 30 places in 164 ms
[2020-06-03 06:26:02] [INFO ] Deduced a trap composed of 22 places in 168 ms
[2020-06-03 06:26:03] [INFO ] Deduced a trap composed of 23 places in 210 ms
[2020-06-03 06:26:03] [INFO ] Deduced a trap composed of 31 places in 157 ms
[2020-06-03 06:26:03] [INFO ] Deduced a trap composed of 19 places in 182 ms
[2020-06-03 06:26:03] [INFO ] Deduced a trap composed of 121 places in 170 ms
[2020-06-03 06:26:03] [INFO ] Deduced a trap composed of 33 places in 164 ms
[2020-06-03 06:26:03] [INFO ] Deduced a trap composed of 25 places in 169 ms
[2020-06-03 06:26:04] [INFO ] Deduced a trap composed of 50 places in 192 ms
[2020-06-03 06:26:04] [INFO ] Deduced a trap composed of 19 places in 157 ms
[2020-06-03 06:26:04] [INFO ] Deduced a trap composed of 26 places in 170 ms
[2020-06-03 06:26:04] [INFO ] Deduced a trap composed of 23 places in 172 ms
[2020-06-03 06:26:04] [INFO ] Deduced a trap composed of 131 places in 177 ms
[2020-06-03 06:26:05] [INFO ] Deduced a trap composed of 142 places in 150 ms
[2020-06-03 06:26:05] [INFO ] Deduced a trap composed of 25 places in 592 ms
[2020-06-03 06:26:05] [INFO ] Deduced a trap composed of 31 places in 182 ms
[2020-06-03 06:26:06] [INFO ] Deduced a trap composed of 123 places in 158 ms
[2020-06-03 06:26:06] [INFO ] Deduced a trap composed of 127 places in 152 ms
[2020-06-03 06:26:06] [INFO ] Deduced a trap composed of 123 places in 186 ms
[2020-06-03 06:26:06] [INFO ] Deduced a trap composed of 30 places in 176 ms
[2020-06-03 06:26:06] [INFO ] Deduced a trap composed of 26 places in 139 ms
[2020-06-03 06:26:07] [INFO ] Deduced a trap composed of 32 places in 172 ms
[2020-06-03 06:26:07] [INFO ] Deduced a trap composed of 136 places in 554 ms
[2020-06-03 06:26:07] [INFO ] Deduced a trap composed of 39 places in 159 ms
[2020-06-03 06:26:08] [INFO ] Deduced a trap composed of 143 places in 150 ms
[2020-06-03 06:26:08] [INFO ] Deduced a trap composed of 35 places in 151 ms
[2020-06-03 06:26:08] [INFO ] Deduced a trap composed of 39 places in 153 ms
[2020-06-03 06:26:08] [INFO ] Deduced a trap composed of 56 places in 188 ms
[2020-06-03 06:26:08] [INFO ] Deduced a trap composed of 43 places in 148 ms
[2020-06-03 06:26:08] [INFO ] Deduced a trap composed of 47 places in 174 ms
[2020-06-03 06:26:09] [INFO ] Deduced a trap composed of 44 places in 161 ms
[2020-06-03 06:26:09] [INFO ] Deduced a trap composed of 30 places in 160 ms
[2020-06-03 06:26:09] [INFO ] Deduced a trap composed of 49 places in 166 ms
[2020-06-03 06:26:09] [INFO ] Deduced a trap composed of 37 places in 156 ms
[2020-06-03 06:26:09] [INFO ] Deduced a trap composed of 38 places in 149 ms
[2020-06-03 06:26:10] [INFO ] Deduced a trap composed of 51 places in 172 ms
[2020-06-03 06:26:10] [INFO ] Deduced a trap composed of 138 places in 153 ms
[2020-06-03 06:26:10] [INFO ] Deduced a trap composed of 40 places in 148 ms
[2020-06-03 06:26:10] [INFO ] Deduced a trap composed of 49 places in 150 ms
[2020-06-03 06:26:10] [INFO ] Deduced a trap composed of 53 places in 141 ms
[2020-06-03 06:26:10] [INFO ] Deduced a trap composed of 35 places in 146 ms
[2020-06-03 06:26:11] [INFO ] Deduced a trap composed of 66 places in 154 ms
[2020-06-03 06:26:11] [INFO ] Deduced a trap composed of 51 places in 146 ms
[2020-06-03 06:26:11] [INFO ] Deduced a trap composed of 47 places in 157 ms
[2020-06-03 06:26:11] [INFO ] Deduced a trap composed of 41 places in 150 ms
[2020-06-03 06:26:11] [INFO ] Deduced a trap composed of 103 places in 144 ms
[2020-06-03 06:26:11] [INFO ] Deduced a trap composed of 143 places in 151 ms
[2020-06-03 06:26:12] [INFO ] Deduced a trap composed of 46 places in 156 ms
[2020-06-03 06:26:12] [INFO ] Deduced a trap composed of 140 places in 149 ms
[2020-06-03 06:26:12] [INFO ] Deduced a trap composed of 139 places in 147 ms
[2020-06-03 06:26:12] [INFO ] Deduced a trap composed of 130 places in 152 ms
[2020-06-03 06:26:12] [INFO ] Deduced a trap composed of 141 places in 148 ms
[2020-06-03 06:26:12] [INFO ] Deduced a trap composed of 142 places in 146 ms
[2020-06-03 06:26:13] [INFO ] Deduced a trap composed of 102 places in 147 ms
[2020-06-03 06:26:13] [INFO ] Deduced a trap composed of 55 places in 166 ms
[2020-06-03 06:26:13] [INFO ] Deduced a trap composed of 71 places in 144 ms
[2020-06-03 06:26:13] [INFO ] Deduced a trap composed of 38 places in 148 ms
[2020-06-03 06:26:13] [INFO ] Deduced a trap composed of 139 places in 149 ms
[2020-06-03 06:26:14] [INFO ] Deduced a trap composed of 53 places in 157 ms
[2020-06-03 06:26:14] [INFO ] Deduced a trap composed of 146 places in 148 ms
[2020-06-03 06:26:14] [INFO ] Deduced a trap composed of 132 places in 143 ms
[2020-06-03 06:26:14] [INFO ] Deduced a trap composed of 141 places in 156 ms
[2020-06-03 06:26:14] [INFO ] Deduced a trap composed of 143 places in 148 ms
[2020-06-03 06:26:14] [INFO ] Deduced a trap composed of 132 places in 152 ms
[2020-06-03 06:26:15] [INFO ] Deduced a trap composed of 145 places in 139 ms
[2020-06-03 06:26:15] [INFO ] Deduced a trap composed of 63 places in 113 ms
[2020-06-03 06:26:15] [INFO ] Deduced a trap composed of 54 places in 109 ms
[2020-06-03 06:26:15] [INFO ] Deduced a trap composed of 56 places in 101 ms
[2020-06-03 06:26:15] [INFO ] Deduced a trap composed of 27 places in 116 ms
[2020-06-03 06:26:15] [INFO ] Deduced a trap composed of 65 places in 94 ms
[2020-06-03 06:26:15] [INFO ] Deduced a trap composed of 72 places in 119 ms
[2020-06-03 06:26:15] [INFO ] Deduced a trap composed of 34 places in 50 ms
[2020-06-03 06:26:15] [INFO ] Deduced a trap composed of 46 places in 57 ms
[2020-06-03 06:26:16] [INFO ] Deduced a trap composed of 30 places in 159 ms
[2020-06-03 06:26:16] [INFO ] Deduced a trap composed of 153 places in 145 ms
[2020-06-03 06:26:16] [INFO ] Deduced a trap composed of 51 places in 168 ms
[2020-06-03 06:26:16] [INFO ] Deduced a trap composed of 58 places in 163 ms
[2020-06-03 06:26:16] [INFO ] Deduced a trap composed of 56 places in 141 ms
[2020-06-03 06:26:17] [INFO ] Deduced a trap composed of 49 places in 141 ms
[2020-06-03 06:26:17] [INFO ] Deduced a trap composed of 141 places in 150 ms
[2020-06-03 06:26:17] [INFO ] Deduced a trap composed of 146 places in 165 ms
[2020-06-03 06:26:17] [INFO ] Deduced a trap composed of 139 places in 153 ms
[2020-06-03 06:26:17] [INFO ] Deduced a trap composed of 146 places in 177 ms
[2020-06-03 06:26:17] [INFO ] Deduced a trap composed of 67 places in 156 ms
[2020-06-03 06:26:18] [INFO ] Deduced a trap composed of 145 places in 153 ms
[2020-06-03 06:26:18] [INFO ] Deduced a trap composed of 146 places in 462 ms
[2020-06-03 06:26:20] [INFO ] Deduced a trap composed of 139 places in 1606 ms
[2020-06-03 06:26:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s34 s35 s46 s47 s48 s98 s100 s103 s110 s111 s131 s134 s149 s150 s151 s168 s174 s175 s182 s183 s184 s194 s195 s196 s199 s200 s208 s238 s239 s240 s246 s247 s259 s262 s297 s307 s317 s322 s331 s341 s345 s346 s347 s351 s361 s366 s371 s376 s381 s386 s411 s416 s421 s425 s426 s427 s446 s451 s456 s460 s463 s464 s465 s466 s469 s470 s471 s472 s473 s474 s475 s476 s479 s484 s485 s486 s487 s488 s489 s496 s497 s498 s499 s500 s501 s502 s503 s504 s505 s506 s507 s508 s515 s516 s518 s520 s530 s533 s538 s539 s540 s541 s548 s549 s552 s553 s554 s555 s558 s559 s564 s565 s566 s567 s568 s569 s577 s578 s579 s580 s581 s582 s585 s586 s589 s590 s591 s592 s595 s596 s603 s604 s607 s608 s612 s621) 0)") while checking expression at index 6
[2020-06-03 06:26:20] [INFO ] [Real]Absence check using 62 positive place invariants in 48 ms returned sat
[2020-06-03 06:26:20] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 31 ms returned sat
[2020-06-03 06:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:26:21] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2020-06-03 06:26:21] [INFO ] Deduced a trap composed of 14 places in 148 ms
[2020-06-03 06:26:21] [INFO ] Deduced a trap composed of 25 places in 203 ms
[2020-06-03 06:26:21] [INFO ] Deduced a trap composed of 25 places in 140 ms
[2020-06-03 06:26:21] [INFO ] Deduced a trap composed of 26 places in 142 ms
[2020-06-03 06:26:22] [INFO ] Deduced a trap composed of 13 places in 81 ms
[2020-06-03 06:26:22] [INFO ] Deduced a trap composed of 11 places in 80 ms
[2020-06-03 06:26:22] [INFO ] Deduced a trap composed of 17 places in 77 ms
[2020-06-03 06:26:22] [INFO ] Deduced a trap composed of 29 places in 133 ms
[2020-06-03 06:26:22] [INFO ] Deduced a trap composed of 21 places in 73 ms
[2020-06-03 06:26:22] [INFO ] Deduced a trap composed of 50 places in 80 ms
[2020-06-03 06:26:22] [INFO ] Deduced a trap composed of 25 places in 73 ms
[2020-06-03 06:26:22] [INFO ] Deduced a trap composed of 52 places in 81 ms
[2020-06-03 06:26:22] [INFO ] Deduced a trap composed of 46 places in 85 ms
[2020-06-03 06:26:22] [INFO ] Deduced a trap composed of 22 places in 29 ms
[2020-06-03 06:26:23] [INFO ] Deduced a trap composed of 20 places in 40 ms
[2020-06-03 06:26:23] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1756 ms
[2020-06-03 06:26:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:26:23] [INFO ] [Nat]Absence check using 62 positive place invariants in 63 ms returned sat
[2020-06-03 06:26:23] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:26:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:26:23] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2020-06-03 06:26:24] [INFO ] Deduced a trap composed of 18 places in 148 ms
[2020-06-03 06:26:24] [INFO ] Deduced a trap composed of 15 places in 137 ms
[2020-06-03 06:26:24] [INFO ] Deduced a trap composed of 17 places in 157 ms
[2020-06-03 06:26:24] [INFO ] Deduced a trap composed of 11 places in 140 ms
[2020-06-03 06:26:24] [INFO ] Deduced a trap composed of 21 places in 134 ms
[2020-06-03 06:26:24] [INFO ] Deduced a trap composed of 124 places in 153 ms
[2020-06-03 06:26:25] [INFO ] Deduced a trap composed of 28 places in 136 ms
[2020-06-03 06:26:25] [INFO ] Deduced a trap composed of 14 places in 143 ms
[2020-06-03 06:26:25] [INFO ] Deduced a trap composed of 17 places in 193 ms
[2020-06-03 06:26:25] [INFO ] Deduced a trap composed of 23 places in 148 ms
[2020-06-03 06:26:25] [INFO ] Deduced a trap composed of 20 places in 139 ms
[2020-06-03 06:26:25] [INFO ] Deduced a trap composed of 28 places in 134 ms
[2020-06-03 06:26:26] [INFO ] Deduced a trap composed of 25 places in 135 ms
[2020-06-03 06:26:26] [INFO ] Deduced a trap composed of 125 places in 170 ms
[2020-06-03 06:26:26] [INFO ] Deduced a trap composed of 130 places in 153 ms
[2020-06-03 06:26:26] [INFO ] Deduced a trap composed of 124 places in 132 ms
[2020-06-03 06:26:26] [INFO ] Deduced a trap composed of 49 places in 137 ms
[2020-06-03 06:26:26] [INFO ] Deduced a trap composed of 122 places in 139 ms
[2020-06-03 06:26:26] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2977 ms
[2020-06-03 06:26:26] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 22 ms.
[2020-06-03 06:26:31] [INFO ] Added : 411 causal constraints over 83 iterations in 4318 ms. Result :sat
[2020-06-03 06:26:31] [INFO ] Deduced a trap composed of 142 places in 197 ms
[2020-06-03 06:26:31] [INFO ] Deduced a trap composed of 145 places in 184 ms
[2020-06-03 06:26:31] [INFO ] Deduced a trap composed of 139 places in 133 ms
[2020-06-03 06:26:32] [INFO ] Deduced a trap composed of 146 places in 122 ms
[2020-06-03 06:26:32] [INFO ] Deduced a trap composed of 144 places in 136 ms
[2020-06-03 06:26:32] [INFO ] Deduced a trap composed of 147 places in 128 ms
[2020-06-03 06:26:32] [INFO ] Deduced a trap composed of 138 places in 156 ms
[2020-06-03 06:26:32] [INFO ] Deduced a trap composed of 147 places in 187 ms
[2020-06-03 06:26:33] [INFO ] Deduced a trap composed of 148 places in 128 ms
[2020-06-03 06:26:33] [INFO ] Deduced a trap composed of 148 places in 149 ms
[2020-06-03 06:26:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2267 ms
[2020-06-03 06:26:33] [INFO ] [Real]Absence check using 62 positive place invariants in 35 ms returned sat
[2020-06-03 06:26:33] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 41 ms returned sat
[2020-06-03 06:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:26:34] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2020-06-03 06:26:34] [INFO ] Deduced a trap composed of 27 places in 204 ms
[2020-06-03 06:26:34] [INFO ] Deduced a trap composed of 19 places in 181 ms
[2020-06-03 06:26:35] [INFO ] Deduced a trap composed of 8 places in 147 ms
[2020-06-03 06:26:35] [INFO ] Deduced a trap composed of 14 places in 161 ms
[2020-06-03 06:26:35] [INFO ] Deduced a trap composed of 132 places in 147 ms
[2020-06-03 06:26:35] [INFO ] Deduced a trap composed of 11 places in 283 ms
[2020-06-03 06:26:35] [INFO ] Deduced a trap composed of 15 places in 157 ms
[2020-06-03 06:26:36] [INFO ] Deduced a trap composed of 16 places in 169 ms
[2020-06-03 06:26:36] [INFO ] Deduced a trap composed of 37 places in 156 ms
[2020-06-03 06:26:36] [INFO ] Deduced a trap composed of 26 places in 146 ms
[2020-06-03 06:26:36] [INFO ] Deduced a trap composed of 35 places in 156 ms
[2020-06-03 06:26:36] [INFO ] Deduced a trap composed of 41 places in 157 ms
[2020-06-03 06:26:36] [INFO ] Deduced a trap composed of 40 places in 143 ms
[2020-06-03 06:26:37] [INFO ] Deduced a trap composed of 15 places in 147 ms
[2020-06-03 06:26:37] [INFO ] Deduced a trap composed of 28 places in 143 ms
[2020-06-03 06:26:37] [INFO ] Deduced a trap composed of 29 places in 150 ms
[2020-06-03 06:26:37] [INFO ] Deduced a trap composed of 26 places in 138 ms
[2020-06-03 06:26:37] [INFO ] Deduced a trap composed of 21 places in 81 ms
[2020-06-03 06:26:37] [INFO ] Deduced a trap composed of 45 places in 97 ms
[2020-06-03 06:26:37] [INFO ] Deduced a trap composed of 33 places in 108 ms
[2020-06-03 06:26:38] [INFO ] Deduced a trap composed of 47 places in 97 ms
[2020-06-03 06:26:38] [INFO ] Deduced a trap composed of 55 places in 96 ms
[2020-06-03 06:26:38] [INFO ] Deduced a trap composed of 11 places in 93 ms
[2020-06-03 06:26:38] [INFO ] Deduced a trap composed of 58 places in 93 ms
[2020-06-03 06:26:38] [INFO ] Deduced a trap composed of 49 places in 102 ms
[2020-06-03 06:26:38] [INFO ] Deduced a trap composed of 18 places in 96 ms
[2020-06-03 06:26:38] [INFO ] Deduced a trap composed of 50 places in 91 ms
[2020-06-03 06:26:38] [INFO ] Deduced a trap composed of 53 places in 104 ms
[2020-06-03 06:26:38] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4471 ms
[2020-06-03 06:26:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:26:39] [INFO ] [Nat]Absence check using 62 positive place invariants in 65 ms returned sat
[2020-06-03 06:26:39] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 33 ms returned sat
[2020-06-03 06:26:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:26:39] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2020-06-03 06:26:39] [INFO ] Deduced a trap composed of 8 places in 89 ms
[2020-06-03 06:26:40] [INFO ] Deduced a trap composed of 14 places in 115 ms
[2020-06-03 06:26:40] [INFO ] Deduced a trap composed of 18 places in 122 ms
[2020-06-03 06:26:40] [INFO ] Deduced a trap composed of 22 places in 107 ms
[2020-06-03 06:26:40] [INFO ] Deduced a trap composed of 25 places in 105 ms
[2020-06-03 06:26:40] [INFO ] Deduced a trap composed of 11 places in 109 ms
[2020-06-03 06:26:40] [INFO ] Deduced a trap composed of 19 places in 122 ms
[2020-06-03 06:26:40] [INFO ] Deduced a trap composed of 29 places in 105 ms
[2020-06-03 06:26:40] [INFO ] Deduced a trap composed of 32 places in 94 ms
[2020-06-03 06:26:41] [INFO ] Deduced a trap composed of 30 places in 129 ms
[2020-06-03 06:26:41] [INFO ] Deduced a trap composed of 21 places in 118 ms
[2020-06-03 06:26:41] [INFO ] Deduced a trap composed of 24 places in 108 ms
[2020-06-03 06:26:41] [INFO ] Deduced a trap composed of 36 places in 97 ms
[2020-06-03 06:26:41] [INFO ] Deduced a trap composed of 30 places in 86 ms
[2020-06-03 06:26:41] [INFO ] Deduced a trap composed of 40 places in 113 ms
[2020-06-03 06:26:41] [INFO ] Deduced a trap composed of 28 places in 94 ms
[2020-06-03 06:26:41] [INFO ] Deduced a trap composed of 44 places in 102 ms
[2020-06-03 06:26:42] [INFO ] Deduced a trap composed of 44 places in 98 ms
[2020-06-03 06:26:42] [INFO ] Deduced a trap composed of 44 places in 74 ms
[2020-06-03 06:26:42] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2346 ms
[2020-06-03 06:26:42] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 21 ms.
[2020-06-03 06:26:45] [INFO ] Added : 374 causal constraints over 76 iterations in 3682 ms. Result :sat
[2020-06-03 06:26:46] [INFO ] [Real]Absence check using 62 positive place invariants in 44 ms returned sat
[2020-06-03 06:26:46] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:26:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:26:46] [INFO ] [Real]Absence check using state equation in 838 ms returned sat
[2020-06-03 06:26:47] [INFO ] Deduced a trap composed of 22 places in 209 ms
[2020-06-03 06:26:47] [INFO ] Deduced a trap composed of 19 places in 198 ms
[2020-06-03 06:26:47] [INFO ] Deduced a trap composed of 8 places in 164 ms
[2020-06-03 06:26:47] [INFO ] Deduced a trap composed of 16 places in 197 ms
[2020-06-03 06:26:47] [INFO ] Deduced a trap composed of 19 places in 184 ms
[2020-06-03 06:26:48] [INFO ] Deduced a trap composed of 18 places in 171 ms
[2020-06-03 06:26:48] [INFO ] Deduced a trap composed of 31 places in 169 ms
[2020-06-03 06:26:48] [INFO ] Deduced a trap composed of 15 places in 159 ms
[2020-06-03 06:26:48] [INFO ] Deduced a trap composed of 14 places in 178 ms
[2020-06-03 06:26:48] [INFO ] Deduced a trap composed of 29 places in 201 ms
[2020-06-03 06:26:49] [INFO ] Deduced a trap composed of 30 places in 159 ms
[2020-06-03 06:26:49] [INFO ] Deduced a trap composed of 41 places in 173 ms
[2020-06-03 06:26:49] [INFO ] Deduced a trap composed of 122 places in 206 ms
[2020-06-03 06:26:49] [INFO ] Deduced a trap composed of 33 places in 165 ms
[2020-06-03 06:26:49] [INFO ] Deduced a trap composed of 46 places in 156 ms
[2020-06-03 06:26:50] [INFO ] Deduced a trap composed of 20 places in 200 ms
[2020-06-03 06:26:50] [INFO ] Deduced a trap composed of 29 places in 157 ms
[2020-06-03 06:26:50] [INFO ] Deduced a trap composed of 40 places in 161 ms
[2020-06-03 06:26:50] [INFO ] Deduced a trap composed of 39 places in 156 ms
[2020-06-03 06:26:50] [INFO ] Deduced a trap composed of 43 places in 164 ms
[2020-06-03 06:26:51] [INFO ] Deduced a trap composed of 40 places in 173 ms
[2020-06-03 06:26:51] [INFO ] Deduced a trap composed of 11 places in 172 ms
[2020-06-03 06:26:51] [INFO ] Deduced a trap composed of 39 places in 160 ms
[2020-06-03 06:26:51] [INFO ] Deduced a trap composed of 61 places in 157 ms
[2020-06-03 06:26:51] [INFO ] Deduced a trap composed of 43 places in 160 ms
[2020-06-03 06:26:51] [INFO ] Deduced a trap composed of 30 places in 152 ms
[2020-06-03 06:26:52] [INFO ] Deduced a trap composed of 30 places in 170 ms
[2020-06-03 06:26:52] [INFO ] Deduced a trap composed of 124 places in 160 ms
[2020-06-03 06:26:52] [INFO ] Deduced a trap composed of 37 places in 164 ms
[2020-06-03 06:26:52] [INFO ] Deduced a trap composed of 28 places in 156 ms
[2020-06-03 06:26:52] [INFO ] Deduced a trap composed of 62 places in 166 ms
[2020-06-03 06:26:53] [INFO ] Deduced a trap composed of 52 places in 167 ms
[2020-06-03 06:26:53] [INFO ] Deduced a trap composed of 63 places in 164 ms
[2020-06-03 06:26:53] [INFO ] Deduced a trap composed of 53 places in 163 ms
[2020-06-03 06:26:53] [INFO ] Deduced a trap composed of 26 places in 159 ms
[2020-06-03 06:26:53] [INFO ] Deduced a trap composed of 61 places in 157 ms
[2020-06-03 06:26:54] [INFO ] Deduced a trap composed of 163 places in 159 ms
[2020-06-03 06:26:54] [INFO ] Deduced a trap composed of 147 places in 146 ms
[2020-06-03 06:26:54] [INFO ] Deduced a trap composed of 152 places in 155 ms
[2020-06-03 06:26:54] [INFO ] Deduced a trap composed of 150 places in 157 ms
[2020-06-03 06:26:54] [INFO ] Deduced a trap composed of 42 places in 142 ms
[2020-06-03 06:26:54] [INFO ] Deduced a trap composed of 144 places in 167 ms
[2020-06-03 06:26:55] [INFO ] Deduced a trap composed of 147 places in 203 ms
[2020-06-03 06:26:55] [INFO ] Deduced a trap composed of 34 places in 168 ms
[2020-06-03 06:26:55] [INFO ] Deduced a trap composed of 150 places in 161 ms
[2020-06-03 06:26:55] [INFO ] Deduced a trap composed of 136 places in 145 ms
[2020-06-03 06:26:55] [INFO ] Deduced a trap composed of 161 places in 167 ms
[2020-06-03 06:26:56] [INFO ] Deduced a trap composed of 149 places in 139 ms
[2020-06-03 06:26:56] [INFO ] Deduced a trap composed of 150 places in 164 ms
[2020-06-03 06:26:56] [INFO ] Deduced a trap composed of 144 places in 160 ms
[2020-06-03 06:26:56] [INFO ] Deduced a trap composed of 141 places in 144 ms
[2020-06-03 06:26:56] [INFO ] Deduced a trap composed of 145 places in 138 ms
[2020-06-03 06:26:56] [INFO ] Deduced a trap composed of 145 places in 140 ms
[2020-06-03 06:26:57] [INFO ] Deduced a trap composed of 135 places in 142 ms
[2020-06-03 06:26:57] [INFO ] Deduced a trap composed of 146 places in 187 ms
[2020-06-03 06:26:57] [INFO ] Deduced a trap composed of 149 places in 139 ms
[2020-06-03 06:26:57] [INFO ] Deduced a trap composed of 140 places in 144 ms
[2020-06-03 06:26:57] [INFO ] Deduced a trap composed of 155 places in 145 ms
[2020-06-03 06:26:57] [INFO ] Deduced a trap composed of 148 places in 141 ms
[2020-06-03 06:26:58] [INFO ] Deduced a trap composed of 146 places in 143 ms
[2020-06-03 06:26:58] [INFO ] Deduced a trap composed of 154 places in 133 ms
[2020-06-03 06:26:58] [INFO ] Deduced a trap composed of 152 places in 142 ms
[2020-06-03 06:26:58] [INFO ] Deduced a trap composed of 154 places in 151 ms
[2020-06-03 06:26:58] [INFO ] Deduced a trap composed of 145 places in 166 ms
[2020-06-03 06:26:58] [INFO ] Deduced a trap composed of 140 places in 136 ms
[2020-06-03 06:26:59] [INFO ] Deduced a trap composed of 154 places in 179 ms
[2020-06-03 06:26:59] [INFO ] Deduced a trap composed of 156 places in 132 ms
[2020-06-03 06:26:59] [INFO ] Deduced a trap composed of 143 places in 158 ms
[2020-06-03 06:26:59] [INFO ] Deduced a trap composed of 147 places in 152 ms
[2020-06-03 06:26:59] [INFO ] Deduced a trap composed of 137 places in 155 ms
[2020-06-03 06:26:59] [INFO ] Deduced a trap composed of 152 places in 144 ms
[2020-06-03 06:27:00] [INFO ] Deduced a trap composed of 150 places in 151 ms
[2020-06-03 06:27:01] [INFO ] Deduced a trap composed of 152 places in 890 ms
[2020-06-03 06:27:01] [INFO ] Deduced a trap composed of 138 places in 155 ms
[2020-06-03 06:27:01] [INFO ] Deduced a trap composed of 146 places in 142 ms
[2020-06-03 06:27:01] [INFO ] Deduced a trap composed of 147 places in 157 ms
[2020-06-03 06:27:01] [INFO ] Deduced a trap composed of 158 places in 139 ms
[2020-06-03 06:27:01] [INFO ] Deduced a trap composed of 146 places in 151 ms
[2020-06-03 06:27:02] [INFO ] Deduced a trap composed of 140 places in 132 ms
[2020-06-03 06:27:02] [INFO ] Deduced a trap composed of 136 places in 149 ms
[2020-06-03 06:27:02] [INFO ] Deduced a trap composed of 138 places in 139 ms
[2020-06-03 06:27:02] [INFO ] Deduced a trap composed of 144 places in 142 ms
[2020-06-03 06:27:02] [INFO ] Deduced a trap composed of 151 places in 139 ms
[2020-06-03 06:27:02] [INFO ] Deduced a trap composed of 161 places in 134 ms
[2020-06-03 06:27:03] [INFO ] Deduced a trap composed of 164 places in 138 ms
[2020-06-03 06:27:03] [INFO ] Deduced a trap composed of 149 places in 139 ms
[2020-06-03 06:27:03] [INFO ] Deduced a trap composed of 150 places in 126 ms
[2020-06-03 06:27:03] [INFO ] Deduced a trap composed of 145 places in 159 ms
[2020-06-03 06:27:03] [INFO ] Deduced a trap composed of 138 places in 169 ms
[2020-06-03 06:27:03] [INFO ] Deduced a trap composed of 148 places in 134 ms
[2020-06-03 06:27:03] [INFO ] Trap strengthening (SAT) tested/added 91/90 trap constraints in 17063 ms
[2020-06-03 06:27:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:27:04] [INFO ] [Nat]Absence check using 62 positive place invariants in 82 ms returned sat
[2020-06-03 06:27:04] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 19 ms returned sat
[2020-06-03 06:27:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:27:04] [INFO ] [Nat]Absence check using state equation in 760 ms returned sat
[2020-06-03 06:27:05] [INFO ] Deduced a trap composed of 121 places in 164 ms
[2020-06-03 06:27:05] [INFO ] Deduced a trap composed of 14 places in 256 ms
[2020-06-03 06:27:05] [INFO ] Deduced a trap composed of 20 places in 161 ms
[2020-06-03 06:27:05] [INFO ] Deduced a trap composed of 10 places in 162 ms
[2020-06-03 06:27:05] [INFO ] Deduced a trap composed of 19 places in 161 ms
[2020-06-03 06:27:06] [INFO ] Deduced a trap composed of 8 places in 156 ms
[2020-06-03 06:27:06] [INFO ] Deduced a trap composed of 19 places in 160 ms
[2020-06-03 06:27:06] [INFO ] Deduced a trap composed of 21 places in 166 ms
[2020-06-03 06:27:06] [INFO ] Deduced a trap composed of 21 places in 158 ms
[2020-06-03 06:27:06] [INFO ] Deduced a trap composed of 18 places in 170 ms
[2020-06-03 06:27:06] [INFO ] Deduced a trap composed of 15 places in 165 ms
[2020-06-03 06:27:07] [INFO ] Deduced a trap composed of 11 places in 158 ms
[2020-06-03 06:27:07] [INFO ] Deduced a trap composed of 24 places in 170 ms
[2020-06-03 06:27:07] [INFO ] Deduced a trap composed of 35 places in 155 ms
[2020-06-03 06:27:07] [INFO ] Deduced a trap composed of 25 places in 190 ms
[2020-06-03 06:27:07] [INFO ] Deduced a trap composed of 34 places in 161 ms
[2020-06-03 06:27:08] [INFO ] Deduced a trap composed of 28 places in 162 ms
[2020-06-03 06:27:08] [INFO ] Deduced a trap composed of 45 places in 154 ms
[2020-06-03 06:27:08] [INFO ] Deduced a trap composed of 130 places in 164 ms
[2020-06-03 06:27:08] [INFO ] Deduced a trap composed of 41 places in 169 ms
[2020-06-03 06:27:08] [INFO ] Deduced a trap composed of 40 places in 152 ms
[2020-06-03 06:27:09] [INFO ] Deduced a trap composed of 23 places in 166 ms
[2020-06-03 06:27:09] [INFO ] Deduced a trap composed of 46 places in 148 ms
[2020-06-03 06:27:09] [INFO ] Deduced a trap composed of 39 places in 146 ms
[2020-06-03 06:27:09] [INFO ] Deduced a trap composed of 42 places in 158 ms
[2020-06-03 06:27:09] [INFO ] Deduced a trap composed of 23 places in 246 ms
[2020-06-03 06:27:09] [INFO ] Deduced a trap composed of 141 places in 159 ms
[2020-06-03 06:27:10] [INFO ] Deduced a trap composed of 49 places in 149 ms
[2020-06-03 06:27:10] [INFO ] Deduced a trap composed of 58 places in 148 ms
[2020-06-03 06:27:10] [INFO ] Deduced a trap composed of 153 places in 157 ms
[2020-06-03 06:27:10] [INFO ] Deduced a trap composed of 26 places in 176 ms
[2020-06-03 06:27:10] [INFO ] Deduced a trap composed of 26 places in 173 ms
[2020-06-03 06:27:11] [INFO ] Deduced a trap composed of 148 places in 159 ms
[2020-06-03 06:27:11] [INFO ] Deduced a trap composed of 144 places in 148 ms
[2020-06-03 06:27:11] [INFO ] Deduced a trap composed of 61 places in 148 ms
[2020-06-03 06:27:11] [INFO ] Deduced a trap composed of 34 places in 188 ms
[2020-06-03 06:27:11] [INFO ] Deduced a trap composed of 36 places in 140 ms
[2020-06-03 06:27:11] [INFO ] Deduced a trap composed of 43 places in 155 ms
[2020-06-03 06:27:12] [INFO ] Deduced a trap composed of 26 places in 140 ms
[2020-06-03 06:27:12] [INFO ] Deduced a trap composed of 43 places in 140 ms
[2020-06-03 06:27:12] [INFO ] Deduced a trap composed of 143 places in 139 ms
[2020-06-03 06:27:12] [INFO ] Deduced a trap composed of 66 places in 138 ms
[2020-06-03 06:27:12] [INFO ] Deduced a trap composed of 141 places in 172 ms
[2020-06-03 06:27:12] [INFO ] Deduced a trap composed of 160 places in 145 ms
[2020-06-03 06:27:13] [INFO ] Deduced a trap composed of 53 places in 170 ms
[2020-06-03 06:27:13] [INFO ] Deduced a trap composed of 148 places in 150 ms
[2020-06-03 06:27:13] [INFO ] Deduced a trap composed of 150 places in 176 ms
[2020-06-03 06:27:13] [INFO ] Deduced a trap composed of 150 places in 183 ms
[2020-06-03 06:27:13] [INFO ] Deduced a trap composed of 147 places in 182 ms
[2020-06-03 06:27:14] [INFO ] Deduced a trap composed of 59 places in 181 ms
[2020-06-03 06:27:14] [INFO ] Deduced a trap composed of 151 places in 167 ms
[2020-06-03 06:27:14] [INFO ] Deduced a trap composed of 156 places in 171 ms
[2020-06-03 06:27:14] [INFO ] Deduced a trap composed of 22 places in 169 ms
[2020-06-03 06:27:14] [INFO ] Deduced a trap composed of 144 places in 192 ms
[2020-06-03 06:27:15] [INFO ] Deduced a trap composed of 43 places in 139 ms
[2020-06-03 06:27:15] [INFO ] Deduced a trap composed of 142 places in 168 ms
[2020-06-03 06:27:15] [INFO ] Deduced a trap composed of 150 places in 166 ms
[2020-06-03 06:27:15] [INFO ] Deduced a trap composed of 152 places in 188 ms
[2020-06-03 06:27:15] [INFO ] Deduced a trap composed of 147 places in 143 ms
[2020-06-03 06:27:15] [INFO ] Deduced a trap composed of 156 places in 175 ms
[2020-06-03 06:27:16] [INFO ] Deduced a trap composed of 147 places in 164 ms
[2020-06-03 06:27:16] [INFO ] Deduced a trap composed of 177 places in 136 ms
[2020-06-03 06:27:16] [INFO ] Deduced a trap composed of 163 places in 186 ms
[2020-06-03 06:27:16] [INFO ] Deduced a trap composed of 59 places in 171 ms
[2020-06-03 06:27:16] [INFO ] Deduced a trap composed of 141 places in 139 ms
[2020-06-03 06:27:17] [INFO ] Deduced a trap composed of 152 places in 142 ms
[2020-06-03 06:27:17] [INFO ] Deduced a trap composed of 142 places in 141 ms
[2020-06-03 06:27:17] [INFO ] Deduced a trap composed of 141 places in 134 ms
[2020-06-03 06:27:17] [INFO ] Deduced a trap composed of 145 places in 136 ms
[2020-06-03 06:27:17] [INFO ] Deduced a trap composed of 141 places in 136 ms
[2020-06-03 06:27:17] [INFO ] Deduced a trap composed of 143 places in 141 ms
[2020-06-03 06:27:18] [INFO ] Deduced a trap composed of 144 places in 146 ms
[2020-06-03 06:27:18] [INFO ] Deduced a trap composed of 138 places in 142 ms
[2020-06-03 06:27:18] [INFO ] Deduced a trap composed of 136 places in 187 ms
[2020-06-03 06:27:18] [INFO ] Deduced a trap composed of 140 places in 139 ms
[2020-06-03 06:27:18] [INFO ] Deduced a trap composed of 142 places in 141 ms
[2020-06-03 06:27:18] [INFO ] Deduced a trap composed of 139 places in 153 ms
[2020-06-03 06:27:18] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 14043 ms
[2020-06-03 06:27:18] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 20 ms.
[2020-06-03 06:27:23] [INFO ] Added : 380 causal constraints over 77 iterations in 4280 ms. Result :sat
[2020-06-03 06:27:23] [INFO ] Deduced a trap composed of 149 places in 206 ms
[2020-06-03 06:27:23] [INFO ] Deduced a trap composed of 153 places in 188 ms
[2020-06-03 06:27:23] [INFO ] Deduced a trap composed of 152 places in 147 ms
[2020-06-03 06:27:24] [INFO ] Deduced a trap composed of 152 places in 155 ms
[2020-06-03 06:27:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s30 s31 s34 s35 s41 s42 s89 s90 s91 s100 s103 s106 s109 s110 s111 s134 s157 s158 s168 s171 s172 s177 s178 s182 s183 s184 s194 s195 s196 s199 s200 s208 s214 s215 s216 s223 s226 s227 s228 s232 s233 s234 s297 s302 s307 s312 s317 s330 s332 s336 s341 s346 s351 s355 s357 s361 s366 s371 s381 s386 s391 s396 s411 s416 s421 s431 s446 s451 s456 s460 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s490 s491 s492 s493 s496 s497 s498 s503 s504 s505 s506 s507 s508 s511 s512 s517 s518 s519 s520 s521 s522 s525 s526 s538 s539 s540 s541 s542 s543 s550 s551 s552 s553 s556 s557 s566 s567 s581 s582 s587 s588 s591 s592 s593 s594 s595 s596 s599 s600 s603 s604 s607 s608 s609 s610 s611 s618 s619 s620 s624 s625 s626) 0)") while checking expression at index 9
[2020-06-03 06:27:24] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2020-06-03 06:27:24] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:27:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:27:25] [INFO ] [Real]Absence check using state equation in 793 ms returned sat
[2020-06-03 06:27:25] [INFO ] Deduced a trap composed of 8 places in 225 ms
[2020-06-03 06:27:25] [INFO ] Deduced a trap composed of 142 places in 180 ms
[2020-06-03 06:27:25] [INFO ] Deduced a trap composed of 15 places in 174 ms
[2020-06-03 06:27:25] [INFO ] Deduced a trap composed of 126 places in 204 ms
[2020-06-03 06:27:26] [INFO ] Deduced a trap composed of 11 places in 188 ms
[2020-06-03 06:27:26] [INFO ] Deduced a trap composed of 19 places in 202 ms
[2020-06-03 06:27:26] [INFO ] Deduced a trap composed of 47 places in 180 ms
[2020-06-03 06:27:26] [INFO ] Deduced a trap composed of 33 places in 169 ms
[2020-06-03 06:27:26] [INFO ] Deduced a trap composed of 22 places in 179 ms
[2020-06-03 06:27:27] [INFO ] Deduced a trap composed of 33 places in 184 ms
[2020-06-03 06:27:27] [INFO ] Deduced a trap composed of 27 places in 159 ms
[2020-06-03 06:27:27] [INFO ] Deduced a trap composed of 144 places in 194 ms
[2020-06-03 06:27:27] [INFO ] Deduced a trap composed of 38 places in 179 ms
[2020-06-03 06:27:27] [INFO ] Deduced a trap composed of 34 places in 163 ms
[2020-06-03 06:27:28] [INFO ] Deduced a trap composed of 37 places in 153 ms
[2020-06-03 06:27:28] [INFO ] Deduced a trap composed of 22 places in 153 ms
[2020-06-03 06:27:28] [INFO ] Deduced a trap composed of 126 places in 151 ms
[2020-06-03 06:27:28] [INFO ] Deduced a trap composed of 26 places in 179 ms
[2020-06-03 06:27:28] [INFO ] Deduced a trap composed of 36 places in 142 ms
[2020-06-03 06:27:29] [INFO ] Deduced a trap composed of 32 places in 158 ms
[2020-06-03 06:27:29] [INFO ] Deduced a trap composed of 46 places in 142 ms
[2020-06-03 06:27:29] [INFO ] Deduced a trap composed of 138 places in 155 ms
[2020-06-03 06:27:29] [INFO ] Deduced a trap composed of 142 places in 161 ms
[2020-06-03 06:27:29] [INFO ] Deduced a trap composed of 139 places in 148 ms
[2020-06-03 06:27:29] [INFO ] Deduced a trap composed of 141 places in 170 ms
[2020-06-03 06:27:30] [INFO ] Deduced a trap composed of 40 places in 137 ms
[2020-06-03 06:27:30] [INFO ] Deduced a trap composed of 39 places in 150 ms
[2020-06-03 06:27:30] [INFO ] Deduced a trap composed of 48 places in 141 ms
[2020-06-03 06:27:30] [INFO ] Deduced a trap composed of 43 places in 163 ms
[2020-06-03 06:27:30] [INFO ] Deduced a trap composed of 128 places in 167 ms
[2020-06-03 06:27:30] [INFO ] Deduced a trap composed of 39 places in 145 ms
[2020-06-03 06:27:31] [INFO ] Deduced a trap composed of 51 places in 156 ms
[2020-06-03 06:27:31] [INFO ] Deduced a trap composed of 42 places in 141 ms
[2020-06-03 06:27:31] [INFO ] Deduced a trap composed of 22 places in 161 ms
[2020-06-03 06:27:31] [INFO ] Deduced a trap composed of 133 places in 149 ms
[2020-06-03 06:27:31] [INFO ] Deduced a trap composed of 38 places in 158 ms
[2020-06-03 06:27:32] [INFO ] Deduced a trap composed of 142 places in 141 ms
[2020-06-03 06:27:32] [INFO ] Deduced a trap composed of 15 places in 135 ms
[2020-06-03 06:27:32] [INFO ] Deduced a trap composed of 23 places in 165 ms
[2020-06-03 06:27:32] [INFO ] Deduced a trap composed of 39 places in 156 ms
[2020-06-03 06:27:32] [INFO ] Deduced a trap composed of 138 places in 150 ms
[2020-06-03 06:27:32] [INFO ] Deduced a trap composed of 49 places in 144 ms
[2020-06-03 06:27:33] [INFO ] Deduced a trap composed of 62 places in 154 ms
[2020-06-03 06:27:33] [INFO ] Deduced a trap composed of 59 places in 147 ms
[2020-06-03 06:27:33] [INFO ] Deduced a trap composed of 70 places in 162 ms
[2020-06-03 06:27:33] [INFO ] Deduced a trap composed of 27 places in 170 ms
[2020-06-03 06:27:33] [INFO ] Deduced a trap composed of 40 places in 167 ms
[2020-06-03 06:27:34] [INFO ] Deduced a trap composed of 63 places in 177 ms
[2020-06-03 06:27:34] [INFO ] Deduced a trap composed of 148 places in 163 ms
[2020-06-03 06:27:34] [INFO ] Deduced a trap composed of 132 places in 138 ms
[2020-06-03 06:27:34] [INFO ] Deduced a trap composed of 76 places in 174 ms
[2020-06-03 06:27:34] [INFO ] Deduced a trap composed of 128 places in 132 ms
[2020-06-03 06:27:34] [INFO ] Deduced a trap composed of 59 places in 145 ms
[2020-06-03 06:27:35] [INFO ] Deduced a trap composed of 127 places in 153 ms
[2020-06-03 06:27:35] [INFO ] Deduced a trap composed of 71 places in 131 ms
[2020-06-03 06:27:35] [INFO ] Deduced a trap composed of 144 places in 138 ms
[2020-06-03 06:27:35] [INFO ] Deduced a trap composed of 71 places in 142 ms
[2020-06-03 06:27:35] [INFO ] Deduced a trap composed of 156 places in 150 ms
[2020-06-03 06:27:35] [INFO ] Deduced a trap composed of 132 places in 136 ms
[2020-06-03 06:27:36] [INFO ] Deduced a trap composed of 142 places in 161 ms
[2020-06-03 06:27:36] [INFO ] Deduced a trap composed of 145 places in 133 ms
[2020-06-03 06:27:36] [INFO ] Deduced a trap composed of 144 places in 170 ms
[2020-06-03 06:27:36] [INFO ] Deduced a trap composed of 143 places in 146 ms
[2020-06-03 06:27:36] [INFO ] Deduced a trap composed of 153 places in 154 ms
[2020-06-03 06:27:36] [INFO ] Deduced a trap composed of 146 places in 132 ms
[2020-06-03 06:27:37] [INFO ] Deduced a trap composed of 138 places in 140 ms
[2020-06-03 06:27:37] [INFO ] Deduced a trap composed of 161 places in 125 ms
[2020-06-03 06:27:37] [INFO ] Deduced a trap composed of 138 places in 129 ms
[2020-06-03 06:27:37] [INFO ] Deduced a trap composed of 139 places in 128 ms
[2020-06-03 06:27:37] [INFO ] Deduced a trap composed of 147 places in 140 ms
[2020-06-03 06:27:37] [INFO ] Deduced a trap composed of 133 places in 134 ms
[2020-06-03 06:27:37] [INFO ] Deduced a trap composed of 139 places in 130 ms
[2020-06-03 06:27:38] [INFO ] Deduced a trap composed of 42 places in 134 ms
[2020-06-03 06:27:38] [INFO ] Deduced a trap composed of 30 places in 130 ms
[2020-06-03 06:27:38] [INFO ] Deduced a trap composed of 140 places in 128 ms
[2020-06-03 06:27:38] [INFO ] Deduced a trap composed of 137 places in 134 ms
[2020-06-03 06:27:38] [INFO ] Deduced a trap composed of 138 places in 135 ms
[2020-06-03 06:27:38] [INFO ] Deduced a trap composed of 168 places in 130 ms
[2020-06-03 06:27:39] [INFO ] Deduced a trap composed of 141 places in 126 ms
[2020-06-03 06:27:39] [INFO ] Deduced a trap composed of 139 places in 145 ms
[2020-06-03 06:27:39] [INFO ] Deduced a trap composed of 138 places in 124 ms
[2020-06-03 06:27:39] [INFO ] Deduced a trap composed of 138 places in 115 ms
[2020-06-03 06:27:39] [INFO ] Deduced a trap composed of 141 places in 125 ms
[2020-06-03 06:27:39] [INFO ] Deduced a trap composed of 139 places in 116 ms
[2020-06-03 06:27:39] [INFO ] Deduced a trap composed of 140 places in 131 ms
[2020-06-03 06:27:40] [INFO ] Deduced a trap composed of 131 places in 133 ms
[2020-06-03 06:27:40] [INFO ] Deduced a trap composed of 140 places in 126 ms
[2020-06-03 06:27:40] [INFO ] Deduced a trap composed of 140 places in 130 ms
[2020-06-03 06:27:40] [INFO ] Deduced a trap composed of 154 places in 134 ms
[2020-06-03 06:27:40] [INFO ] Deduced a trap composed of 147 places in 125 ms
[2020-06-03 06:27:40] [INFO ] Deduced a trap composed of 139 places in 125 ms
[2020-06-03 06:27:40] [INFO ] Deduced a trap composed of 152 places in 127 ms
[2020-06-03 06:27:41] [INFO ] Deduced a trap composed of 140 places in 131 ms
[2020-06-03 06:27:41] [INFO ] Deduced a trap composed of 153 places in 138 ms
[2020-06-03 06:27:41] [INFO ] Deduced a trap composed of 146 places in 132 ms
[2020-06-03 06:27:41] [INFO ] Deduced a trap composed of 139 places in 139 ms
[2020-06-03 06:27:41] [INFO ] Deduced a trap composed of 138 places in 150 ms
[2020-06-03 06:27:41] [INFO ] Deduced a trap composed of 153 places in 126 ms
[2020-06-03 06:27:42] [INFO ] Deduced a trap composed of 139 places in 124 ms
[2020-06-03 06:27:42] [INFO ] Deduced a trap composed of 138 places in 130 ms
[2020-06-03 06:27:42] [INFO ] Deduced a trap composed of 153 places in 123 ms
[2020-06-03 06:27:42] [INFO ] Deduced a trap composed of 137 places in 115 ms
[2020-06-03 06:27:42] [INFO ] Deduced a trap composed of 141 places in 123 ms
[2020-06-03 06:27:42] [INFO ] Deduced a trap composed of 142 places in 119 ms
[2020-06-03 06:27:42] [INFO ] Deduced a trap composed of 134 places in 115 ms
[2020-06-03 06:27:43] [INFO ] Deduced a trap composed of 145 places in 121 ms
[2020-06-03 06:27:43] [INFO ] Deduced a trap composed of 44 places in 116 ms
[2020-06-03 06:27:43] [INFO ] Deduced a trap composed of 129 places in 114 ms
[2020-06-03 06:27:43] [INFO ] Deduced a trap composed of 145 places in 115 ms
[2020-06-03 06:27:43] [INFO ] Deduced a trap composed of 137 places in 138 ms
[2020-06-03 06:27:43] [INFO ] Deduced a trap composed of 141 places in 133 ms
[2020-06-03 06:27:43] [INFO ] Deduced a trap composed of 150 places in 127 ms
[2020-06-03 06:27:44] [INFO ] Deduced a trap composed of 138 places in 126 ms
[2020-06-03 06:27:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:27:44] [INFO ] Deduced a trap composed of 6 places in 236 ms
[2020-06-03 06:27:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s254) 0)") while checking expression at index 10
[2020-06-03 06:27:44] [INFO ] [Real]Absence check using 62 positive place invariants in 41 ms returned sat
[2020-06-03 06:27:44] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:27:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:27:45] [INFO ] [Real]Absence check using state equation in 757 ms returned sat
[2020-06-03 06:27:45] [INFO ] Deduced a trap composed of 14 places in 165 ms
[2020-06-03 06:27:45] [INFO ] Deduced a trap composed of 19 places in 156 ms
[2020-06-03 06:27:45] [INFO ] Deduced a trap composed of 16 places in 157 ms
[2020-06-03 06:27:45] [INFO ] Deduced a trap composed of 21 places in 159 ms
[2020-06-03 06:27:46] [INFO ] Deduced a trap composed of 12 places in 158 ms
[2020-06-03 06:27:46] [INFO ] Deduced a trap composed of 28 places in 151 ms
[2020-06-03 06:27:46] [INFO ] Deduced a trap composed of 26 places in 146 ms
[2020-06-03 06:27:46] [INFO ] Deduced a trap composed of 12 places in 151 ms
[2020-06-03 06:27:46] [INFO ] Deduced a trap composed of 32 places in 149 ms
[2020-06-03 06:27:47] [INFO ] Deduced a trap composed of 120 places in 145 ms
[2020-06-03 06:27:47] [INFO ] Deduced a trap composed of 130 places in 145 ms
[2020-06-03 06:27:47] [INFO ] Deduced a trap composed of 125 places in 156 ms
[2020-06-03 06:27:47] [INFO ] Deduced a trap composed of 57 places in 162 ms
[2020-06-03 06:27:47] [INFO ] Deduced a trap composed of 35 places in 149 ms
[2020-06-03 06:27:47] [INFO ] Deduced a trap composed of 137 places in 172 ms
[2020-06-03 06:27:48] [INFO ] Deduced a trap composed of 50 places in 165 ms
[2020-06-03 06:27:48] [INFO ] Deduced a trap composed of 14 places in 148 ms
[2020-06-03 06:27:48] [INFO ] Deduced a trap composed of 58 places in 162 ms
[2020-06-03 06:27:48] [INFO ] Deduced a trap composed of 158 places in 160 ms
[2020-06-03 06:27:48] [INFO ] Deduced a trap composed of 157 places in 146 ms
[2020-06-03 06:27:48] [INFO ] Deduced a trap composed of 152 places in 160 ms
[2020-06-03 06:27:49] [INFO ] Deduced a trap composed of 144 places in 139 ms
[2020-06-03 06:27:49] [INFO ] Deduced a trap composed of 160 places in 140 ms
[2020-06-03 06:27:49] [INFO ] Deduced a trap composed of 161 places in 149 ms
[2020-06-03 06:27:49] [INFO ] Deduced a trap composed of 154 places in 143 ms
[2020-06-03 06:27:49] [INFO ] Deduced a trap composed of 151 places in 140 ms
[2020-06-03 06:27:49] [INFO ] Deduced a trap composed of 142 places in 144 ms
[2020-06-03 06:27:50] [INFO ] Deduced a trap composed of 151 places in 144 ms
[2020-06-03 06:27:50] [INFO ] Deduced a trap composed of 146 places in 172 ms
[2020-06-03 06:27:50] [INFO ] Deduced a trap composed of 154 places in 147 ms
[2020-06-03 06:27:50] [INFO ] Deduced a trap composed of 160 places in 151 ms
[2020-06-03 06:27:50] [INFO ] Deduced a trap composed of 152 places in 140 ms
[2020-06-03 06:27:51] [INFO ] Deduced a trap composed of 149 places in 166 ms
[2020-06-03 06:27:51] [INFO ] Deduced a trap composed of 157 places in 149 ms
[2020-06-03 06:27:51] [INFO ] Deduced a trap composed of 154 places in 138 ms
[2020-06-03 06:27:51] [INFO ] Deduced a trap composed of 162 places in 143 ms
[2020-06-03 06:27:51] [INFO ] Deduced a trap composed of 152 places in 158 ms
[2020-06-03 06:27:51] [INFO ] Deduced a trap composed of 158 places in 138 ms
[2020-06-03 06:27:52] [INFO ] Deduced a trap composed of 160 places in 155 ms
[2020-06-03 06:27:52] [INFO ] Deduced a trap composed of 52 places in 147 ms
[2020-06-03 06:27:52] [INFO ] Deduced a trap composed of 52 places in 156 ms
[2020-06-03 06:27:52] [INFO ] Deduced a trap composed of 147 places in 151 ms
[2020-06-03 06:27:52] [INFO ] Deduced a trap composed of 149 places in 144 ms
[2020-06-03 06:27:52] [INFO ] Deduced a trap composed of 143 places in 145 ms
[2020-06-03 06:27:53] [INFO ] Deduced a trap composed of 152 places in 171 ms
[2020-06-03 06:27:53] [INFO ] Deduced a trap composed of 153 places in 159 ms
[2020-06-03 06:27:53] [INFO ] Deduced a trap composed of 162 places in 138 ms
[2020-06-03 06:27:53] [INFO ] Deduced a trap composed of 146 places in 156 ms
[2020-06-03 06:27:53] [INFO ] Deduced a trap composed of 145 places in 185 ms
[2020-06-03 06:27:53] [INFO ] Deduced a trap composed of 146 places in 146 ms
[2020-06-03 06:27:54] [INFO ] Deduced a trap composed of 146 places in 155 ms
[2020-06-03 06:27:54] [INFO ] Deduced a trap composed of 145 places in 153 ms
[2020-06-03 06:27:54] [INFO ] Deduced a trap composed of 146 places in 130 ms
[2020-06-03 06:27:54] [INFO ] Deduced a trap composed of 146 places in 133 ms
[2020-06-03 06:27:54] [INFO ] Deduced a trap composed of 156 places in 134 ms
[2020-06-03 06:27:54] [INFO ] Deduced a trap composed of 152 places in 137 ms
[2020-06-03 06:27:55] [INFO ] Deduced a trap composed of 155 places in 132 ms
[2020-06-03 06:27:55] [INFO ] Deduced a trap composed of 153 places in 142 ms
[2020-06-03 06:27:55] [INFO ] Deduced a trap composed of 164 places in 136 ms
[2020-06-03 06:27:55] [INFO ] Deduced a trap composed of 152 places in 143 ms
[2020-06-03 06:27:55] [INFO ] Deduced a trap composed of 143 places in 169 ms
[2020-06-03 06:27:56] [INFO ] Deduced a trap composed of 149 places in 248 ms
[2020-06-03 06:27:56] [INFO ] Deduced a trap composed of 32 places in 144 ms
[2020-06-03 06:27:56] [INFO ] Deduced a trap composed of 147 places in 147 ms
[2020-06-03 06:27:56] [INFO ] Deduced a trap composed of 160 places in 173 ms
[2020-06-03 06:27:56] [INFO ] Deduced a trap composed of 152 places in 143 ms
[2020-06-03 06:27:56] [INFO ] Deduced a trap composed of 152 places in 140 ms
[2020-06-03 06:27:57] [INFO ] Deduced a trap composed of 148 places in 137 ms
[2020-06-03 06:27:57] [INFO ] Deduced a trap composed of 155 places in 153 ms
[2020-06-03 06:27:57] [INFO ] Deduced a trap composed of 157 places in 144 ms
[2020-06-03 06:27:57] [INFO ] Deduced a trap composed of 158 places in 140 ms
[2020-06-03 06:27:57] [INFO ] Deduced a trap composed of 153 places in 133 ms
[2020-06-03 06:27:57] [INFO ] Deduced a trap composed of 154 places in 132 ms
[2020-06-03 06:27:58] [INFO ] Deduced a trap composed of 152 places in 135 ms
[2020-06-03 06:27:58] [INFO ] Deduced a trap composed of 151 places in 144 ms
[2020-06-03 06:27:58] [INFO ] Deduced a trap composed of 160 places in 145 ms
[2020-06-03 06:27:58] [INFO ] Deduced a trap composed of 160 places in 145 ms
[2020-06-03 06:27:58] [INFO ] Deduced a trap composed of 159 places in 140 ms
[2020-06-03 06:27:58] [INFO ] Deduced a trap composed of 151 places in 135 ms
[2020-06-03 06:27:59] [INFO ] Deduced a trap composed of 150 places in 140 ms
[2020-06-03 06:27:59] [INFO ] Deduced a trap composed of 160 places in 129 ms
[2020-06-03 06:27:59] [INFO ] Deduced a trap composed of 156 places in 129 ms
[2020-06-03 06:27:59] [INFO ] Deduced a trap composed of 161 places in 176 ms
[2020-06-03 06:27:59] [INFO ] Deduced a trap composed of 146 places in 125 ms
[2020-06-03 06:27:59] [INFO ] Deduced a trap composed of 140 places in 135 ms
[2020-06-03 06:28:00] [INFO ] Deduced a trap composed of 165 places in 134 ms
[2020-06-03 06:28:00] [INFO ] Deduced a trap composed of 154 places in 138 ms
[2020-06-03 06:28:00] [INFO ] Deduced a trap composed of 147 places in 128 ms
[2020-06-03 06:28:00] [INFO ] Deduced a trap composed of 160 places in 131 ms
[2020-06-03 06:28:00] [INFO ] Deduced a trap composed of 157 places in 126 ms
[2020-06-03 06:28:00] [INFO ] Deduced a trap composed of 153 places in 135 ms
[2020-06-03 06:28:00] [INFO ] Deduced a trap composed of 157 places in 132 ms
[2020-06-03 06:28:01] [INFO ] Deduced a trap composed of 156 places in 139 ms
[2020-06-03 06:28:01] [INFO ] Deduced a trap composed of 155 places in 142 ms
[2020-06-03 06:28:01] [INFO ] Deduced a trap composed of 22 places in 147 ms
[2020-06-03 06:28:01] [INFO ] Deduced a trap composed of 152 places in 141 ms
[2020-06-03 06:28:01] [INFO ] Deduced a trap composed of 157 places in 141 ms
[2020-06-03 06:28:02] [INFO ] Deduced a trap composed of 38 places in 131 ms
[2020-06-03 06:28:02] [INFO ] Deduced a trap composed of 41 places in 144 ms
[2020-06-03 06:28:02] [INFO ] Deduced a trap composed of 140 places in 133 ms
[2020-06-03 06:28:02] [INFO ] Deduced a trap composed of 150 places in 138 ms
[2020-06-03 06:28:02] [INFO ] Deduced a trap composed of 148 places in 132 ms
[2020-06-03 06:28:02] [INFO ] Deduced a trap composed of 139 places in 136 ms
[2020-06-03 06:28:02] [INFO ] Deduced a trap composed of 156 places in 134 ms
[2020-06-03 06:28:03] [INFO ] Deduced a trap composed of 21 places in 125 ms
[2020-06-03 06:28:03] [INFO ] Deduced a trap composed of 150 places in 132 ms
[2020-06-03 06:28:03] [INFO ] Deduced a trap composed of 18 places in 130 ms
[2020-06-03 06:28:03] [INFO ] Deduced a trap composed of 165 places in 133 ms
[2020-06-03 06:28:03] [INFO ] Deduced a trap composed of 148 places in 127 ms
[2020-06-03 06:28:03] [INFO ] Deduced a trap composed of 37 places in 129 ms
[2020-06-03 06:28:04] [INFO ] Deduced a trap composed of 150 places in 133 ms
[2020-06-03 06:28:04] [INFO ] Deduced a trap composed of 25 places in 130 ms
[2020-06-03 06:28:04] [INFO ] Deduced a trap composed of 160 places in 131 ms
[2020-06-03 06:28:04] [INFO ] Deduced a trap composed of 181 places in 148 ms
[2020-06-03 06:28:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s36 s41 s42 s46 s47 s48 s50 s51 s54 s55 s89 s90 s91 s92 s94 s96 s99 s100 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s122 s137 s138 s139 s143 s144 s145 s168 s174 s175 s177 s178 s182 s183 s184 s188 s189 s190 s199 s200 s201 s202 s226 s227 s228 s238 s239 s240 s297 s302 s307 s311 s312 s313 s331 s341 s361 s366 s371 s376 s381 s396 s401 s416 s421 s436 s441 s445 s446 s447 s456 s460 s463 s464 s465 s466 s469 s470 s471 s472 s473 s474 s475 s476 s479 s480 s481 s494 s495 s499 s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s517 s519 s521 s522 s525 s526 s548 s549 s552 s553 s554 s555 s560 s561 s568 s569 s570 s571 s577 s578 s579 s580 s581 s582 s599 s600 s601 s602 s603 s604 s607 s610 s611 s619 s620 s625 s626 s627 s628 s629) 0)") while checking expression at index 11
[2020-06-03 06:28:04] [INFO ] [Real]Absence check using 62 positive place invariants in 35 ms returned sat
[2020-06-03 06:28:04] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-06-03 06:28:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:28:05] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2020-06-03 06:28:05] [INFO ] Deduced a trap composed of 17 places in 163 ms
[2020-06-03 06:28:05] [INFO ] Deduced a trap composed of 18 places in 145 ms
[2020-06-03 06:28:05] [INFO ] Deduced a trap composed of 12 places in 163 ms
[2020-06-03 06:28:06] [INFO ] Deduced a trap composed of 21 places in 141 ms
[2020-06-03 06:28:06] [INFO ] Deduced a trap composed of 17 places in 154 ms
[2020-06-03 06:28:06] [INFO ] Deduced a trap composed of 19 places in 201 ms
[2020-06-03 06:28:06] [INFO ] Deduced a trap composed of 17 places in 186 ms
[2020-06-03 06:28:06] [INFO ] Deduced a trap composed of 26 places in 153 ms
[2020-06-03 06:28:07] [INFO ] Deduced a trap composed of 121 places in 155 ms
[2020-06-03 06:28:07] [INFO ] Deduced a trap composed of 21 places in 167 ms
[2020-06-03 06:28:07] [INFO ] Deduced a trap composed of 41 places in 153 ms
[2020-06-03 06:28:07] [INFO ] Deduced a trap composed of 50 places in 134 ms
[2020-06-03 06:28:07] [INFO ] Deduced a trap composed of 33 places in 146 ms
[2020-06-03 06:28:07] [INFO ] Deduced a trap composed of 12 places in 149 ms
[2020-06-03 06:28:08] [INFO ] Deduced a trap composed of 11 places in 130 ms
[2020-06-03 06:28:08] [INFO ] Deduced a trap composed of 119 places in 145 ms
[2020-06-03 06:28:08] [INFO ] Deduced a trap composed of 125 places in 131 ms
[2020-06-03 06:28:08] [INFO ] Deduced a trap composed of 15 places in 137 ms
[2020-06-03 06:28:08] [INFO ] Deduced a trap composed of 35 places in 132 ms
[2020-06-03 06:28:08] [INFO ] Deduced a trap composed of 29 places in 144 ms
[2020-06-03 06:28:08] [INFO ] Deduced a trap composed of 32 places in 124 ms
[2020-06-03 06:28:09] [INFO ] Deduced a trap composed of 120 places in 141 ms
[2020-06-03 06:28:09] [INFO ] Deduced a trap composed of 126 places in 133 ms
[2020-06-03 06:28:09] [INFO ] Deduced a trap composed of 132 places in 158 ms
[2020-06-03 06:28:09] [INFO ] Deduced a trap composed of 127 places in 167 ms
[2020-06-03 06:28:09] [INFO ] Deduced a trap composed of 22 places in 134 ms
[2020-06-03 06:28:09] [INFO ] Deduced a trap composed of 124 places in 156 ms
[2020-06-03 06:28:10] [INFO ] Deduced a trap composed of 28 places in 141 ms
[2020-06-03 06:28:10] [INFO ] Deduced a trap composed of 33 places in 153 ms
[2020-06-03 06:28:10] [INFO ] Deduced a trap composed of 124 places in 145 ms
[2020-06-03 06:28:10] [INFO ] Deduced a trap composed of 40 places in 153 ms
[2020-06-03 06:28:10] [INFO ] Deduced a trap composed of 22 places in 137 ms
[2020-06-03 06:28:10] [INFO ] Deduced a trap composed of 20 places in 150 ms
[2020-06-03 06:28:11] [INFO ] Deduced a trap composed of 127 places in 141 ms
[2020-06-03 06:28:11] [INFO ] Deduced a trap composed of 38 places in 127 ms
[2020-06-03 06:28:11] [INFO ] Deduced a trap composed of 26 places in 125 ms
[2020-06-03 06:28:11] [INFO ] Deduced a trap composed of 26 places in 145 ms
[2020-06-03 06:28:11] [INFO ] Deduced a trap composed of 27 places in 98 ms
[2020-06-03 06:28:11] [INFO ] Deduced a trap composed of 26 places in 89 ms
[2020-06-03 06:28:11] [INFO ] Deduced a trap composed of 29 places in 73 ms
[2020-06-03 06:28:12] [INFO ] Deduced a trap composed of 39 places in 80 ms
[2020-06-03 06:28:12] [INFO ] Deduced a trap composed of 25 places in 87 ms
[2020-06-03 06:28:12] [INFO ] Deduced a trap composed of 27 places in 77 ms
[2020-06-03 06:28:12] [INFO ] Deduced a trap composed of 40 places in 74 ms
[2020-06-03 06:28:12] [INFO ] Deduced a trap composed of 42 places in 89 ms
[2020-06-03 06:28:12] [INFO ] Deduced a trap composed of 36 places in 91 ms
[2020-06-03 06:28:12] [INFO ] Deduced a trap composed of 29 places in 71 ms
[2020-06-03 06:28:12] [INFO ] Deduced a trap composed of 57 places in 64 ms
[2020-06-03 06:28:12] [INFO ] Deduced a trap composed of 42 places in 56 ms
[2020-06-03 06:28:12] [INFO ] Deduced a trap composed of 45 places in 56 ms
[2020-06-03 06:28:12] [INFO ] Deduced a trap composed of 42 places in 58 ms
[2020-06-03 06:28:13] [INFO ] Deduced a trap composed of 21 places in 79 ms
[2020-06-03 06:28:13] [INFO ] Deduced a trap composed of 31 places in 65 ms
[2020-06-03 06:28:13] [INFO ] Deduced a trap composed of 43 places in 82 ms
[2020-06-03 06:28:13] [INFO ] Deduced a trap composed of 39 places in 77 ms
[2020-06-03 06:28:13] [INFO ] Deduced a trap composed of 26 places in 70 ms
[2020-06-03 06:28:13] [INFO ] Deduced a trap composed of 36 places in 74 ms
[2020-06-03 06:28:13] [INFO ] Deduced a trap composed of 42 places in 81 ms
[2020-06-03 06:28:13] [INFO ] Deduced a trap composed of 43 places in 84 ms
[2020-06-03 06:28:13] [INFO ] Deduced a trap composed of 47 places in 83 ms
[2020-06-03 06:28:13] [INFO ] Deduced a trap composed of 39 places in 87 ms
[2020-06-03 06:28:14] [INFO ] Deduced a trap composed of 44 places in 83 ms
[2020-06-03 06:28:14] [INFO ] Deduced a trap composed of 45 places in 59 ms
[2020-06-03 06:28:14] [INFO ] Deduced a trap composed of 28 places in 87 ms
[2020-06-03 06:28:14] [INFO ] Deduced a trap composed of 56 places in 86 ms
[2020-06-03 06:28:14] [INFO ] Deduced a trap composed of 40 places in 80 ms
[2020-06-03 06:28:14] [INFO ] Deduced a trap composed of 35 places in 73 ms
[2020-06-03 06:28:14] [INFO ] Deduced a trap composed of 51 places in 73 ms
[2020-06-03 06:28:14] [INFO ] Deduced a trap composed of 53 places in 58 ms
[2020-06-03 06:28:14] [INFO ] Deduced a trap composed of 29 places in 104 ms
[2020-06-03 06:28:14] [INFO ] Deduced a trap composed of 28 places in 103 ms
[2020-06-03 06:28:15] [INFO ] Deduced a trap composed of 37 places in 77 ms
[2020-06-03 06:28:15] [INFO ] Deduced a trap composed of 30 places in 78 ms
[2020-06-03 06:28:15] [INFO ] Deduced a trap composed of 29 places in 92 ms
[2020-06-03 06:28:15] [INFO ] Deduced a trap composed of 31 places in 76 ms
[2020-06-03 06:28:15] [INFO ] Deduced a trap composed of 37 places in 76 ms
[2020-06-03 06:28:15] [INFO ] Deduced a trap composed of 57 places in 72 ms
[2020-06-03 06:28:15] [INFO ] Deduced a trap composed of 42 places in 86 ms
[2020-06-03 06:28:15] [INFO ] Deduced a trap composed of 57 places in 80 ms
[2020-06-03 06:28:15] [INFO ] Deduced a trap composed of 48 places in 74 ms
[2020-06-03 06:28:15] [INFO ] Deduced a trap composed of 49 places in 89 ms
[2020-06-03 06:28:16] [INFO ] Deduced a trap composed of 69 places in 76 ms
[2020-06-03 06:28:16] [INFO ] Deduced a trap composed of 69 places in 84 ms
[2020-06-03 06:28:16] [INFO ] Trap strengthening (SAT) tested/added 84/83 trap constraints in 10725 ms
[2020-06-03 06:28:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:28:16] [INFO ] [Nat]Absence check using 62 positive place invariants in 65 ms returned sat
[2020-06-03 06:28:16] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-06-03 06:28:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:28:17] [INFO ] [Nat]Absence check using state equation in 750 ms returned sat
[2020-06-03 06:28:17] [INFO ] Deduced a trap composed of 11 places in 147 ms
[2020-06-03 06:28:17] [INFO ] Deduced a trap composed of 14 places in 159 ms
[2020-06-03 06:28:17] [INFO ] Deduced a trap composed of 13 places in 184 ms
[2020-06-03 06:28:17] [INFO ] Deduced a trap composed of 12 places in 183 ms
[2020-06-03 06:28:17] [INFO ] Deduced a trap composed of 15 places in 153 ms
[2020-06-03 06:28:18] [INFO ] Deduced a trap composed of 11 places in 143 ms
[2020-06-03 06:28:18] [INFO ] Deduced a trap composed of 16 places in 148 ms
[2020-06-03 06:28:18] [INFO ] Deduced a trap composed of 19 places in 188 ms
[2020-06-03 06:28:18] [INFO ] Deduced a trap composed of 20 places in 159 ms
[2020-06-03 06:28:18] [INFO ] Deduced a trap composed of 23 places in 189 ms
[2020-06-03 06:28:19] [INFO ] Deduced a trap composed of 27 places in 141 ms
[2020-06-03 06:28:19] [INFO ] Deduced a trap composed of 32 places in 132 ms
[2020-06-03 06:28:19] [INFO ] Deduced a trap composed of 25 places in 139 ms
[2020-06-03 06:28:19] [INFO ] Deduced a trap composed of 120 places in 133 ms
[2020-06-03 06:28:19] [INFO ] Deduced a trap composed of 23 places in 173 ms
[2020-06-03 06:28:19] [INFO ] Deduced a trap composed of 21 places in 163 ms
[2020-06-03 06:28:20] [INFO ] Deduced a trap composed of 18 places in 152 ms
[2020-06-03 06:28:20] [INFO ] Deduced a trap composed of 21 places in 174 ms
[2020-06-03 06:28:20] [INFO ] Deduced a trap composed of 125 places in 197 ms
[2020-06-03 06:28:20] [INFO ] Deduced a trap composed of 21 places in 185 ms
[2020-06-03 06:28:20] [INFO ] Deduced a trap composed of 25 places in 136 ms
[2020-06-03 06:28:20] [INFO ] Deduced a trap composed of 35 places in 145 ms
[2020-06-03 06:28:21] [INFO ] Deduced a trap composed of 117 places in 157 ms
[2020-06-03 06:28:21] [INFO ] Deduced a trap composed of 120 places in 154 ms
[2020-06-03 06:28:21] [INFO ] Deduced a trap composed of 21 places in 142 ms
[2020-06-03 06:28:21] [INFO ] Deduced a trap composed of 25 places in 155 ms
[2020-06-03 06:28:21] [INFO ] Deduced a trap composed of 25 places in 159 ms
[2020-06-03 06:28:22] [INFO ] Deduced a trap composed of 119 places in 166 ms
[2020-06-03 06:28:22] [INFO ] Deduced a trap composed of 123 places in 133 ms
[2020-06-03 06:28:22] [INFO ] Deduced a trap composed of 36 places in 131 ms
[2020-06-03 06:28:22] [INFO ] Deduced a trap composed of 134 places in 127 ms
[2020-06-03 06:28:22] [INFO ] Deduced a trap composed of 121 places in 134 ms
[2020-06-03 06:28:22] [INFO ] Deduced a trap composed of 46 places in 134 ms
[2020-06-03 06:28:22] [INFO ] Deduced a trap composed of 27 places in 132 ms
[2020-06-03 06:28:23] [INFO ] Deduced a trap composed of 26 places in 143 ms
[2020-06-03 06:28:23] [INFO ] Deduced a trap composed of 30 places in 81 ms
[2020-06-03 06:28:23] [INFO ] Deduced a trap composed of 37 places in 131 ms
[2020-06-03 06:28:23] [INFO ] Deduced a trap composed of 14 places in 91 ms
[2020-06-03 06:28:23] [INFO ] Deduced a trap composed of 28 places in 79 ms
[2020-06-03 06:28:23] [INFO ] Deduced a trap composed of 32 places in 78 ms
[2020-06-03 06:28:23] [INFO ] Deduced a trap composed of 23 places in 88 ms
[2020-06-03 06:28:23] [INFO ] Deduced a trap composed of 26 places in 72 ms
[2020-06-03 06:28:23] [INFO ] Deduced a trap composed of 32 places in 72 ms
[2020-06-03 06:28:24] [INFO ] Deduced a trap composed of 30 places in 75 ms
[2020-06-03 06:28:24] [INFO ] Deduced a trap composed of 46 places in 92 ms
[2020-06-03 06:28:24] [INFO ] Deduced a trap composed of 42 places in 94 ms
[2020-06-03 06:28:24] [INFO ] Deduced a trap composed of 40 places in 98 ms
[2020-06-03 06:28:24] [INFO ] Deduced a trap composed of 24 places in 86 ms
[2020-06-03 06:28:24] [INFO ] Deduced a trap composed of 50 places in 92 ms
[2020-06-03 06:28:24] [INFO ] Deduced a trap composed of 32 places in 100 ms
[2020-06-03 06:28:24] [INFO ] Deduced a trap composed of 22 places in 88 ms
[2020-06-03 06:28:24] [INFO ] Deduced a trap composed of 22 places in 86 ms
[2020-06-03 06:28:25] [INFO ] Deduced a trap composed of 46 places in 99 ms
[2020-06-03 06:28:25] [INFO ] Deduced a trap composed of 15 places in 74 ms
[2020-06-03 06:28:25] [INFO ] Deduced a trap composed of 39 places in 99 ms
[2020-06-03 06:28:25] [INFO ] Deduced a trap composed of 35 places in 64 ms
[2020-06-03 06:28:25] [INFO ] Deduced a trap composed of 29 places in 77 ms
[2020-06-03 06:28:25] [INFO ] Deduced a trap composed of 30 places in 72 ms
[2020-06-03 06:28:25] [INFO ] Deduced a trap composed of 28 places in 71 ms
[2020-06-03 06:28:25] [INFO ] Deduced a trap composed of 45 places in 100 ms
[2020-06-03 06:28:25] [INFO ] Deduced a trap composed of 52 places in 76 ms
[2020-06-03 06:28:25] [INFO ] Deduced a trap composed of 58 places in 71 ms
[2020-06-03 06:28:26] [INFO ] Deduced a trap composed of 57 places in 80 ms
[2020-06-03 06:28:26] [INFO ] Deduced a trap composed of 54 places in 82 ms
[2020-06-03 06:28:26] [INFO ] Deduced a trap composed of 75 places in 70 ms
[2020-06-03 06:28:26] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 9198 ms
[2020-06-03 06:28:26] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 19 ms.
[2020-06-03 06:28:30] [INFO ] Added : 420 causal constraints over 84 iterations in 3971 ms. Result :sat
[2020-06-03 06:28:30] [INFO ] [Real]Absence check using 62 positive place invariants in 52 ms returned sat
[2020-06-03 06:28:30] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 29 ms returned sat
[2020-06-03 06:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:28:31] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2020-06-03 06:28:31] [INFO ] Deduced a trap composed of 11 places in 195 ms
[2020-06-03 06:28:31] [INFO ] Deduced a trap composed of 22 places in 141 ms
[2020-06-03 06:28:31] [INFO ] Deduced a trap composed of 30 places in 140 ms
[2020-06-03 06:28:31] [INFO ] Deduced a trap composed of 14 places in 156 ms
[2020-06-03 06:28:32] [INFO ] Deduced a trap composed of 12 places in 153 ms
[2020-06-03 06:28:32] [INFO ] Deduced a trap composed of 17 places in 147 ms
[2020-06-03 06:28:32] [INFO ] Deduced a trap composed of 25 places in 161 ms
[2020-06-03 06:28:32] [INFO ] Deduced a trap composed of 36 places in 142 ms
[2020-06-03 06:28:32] [INFO ] Deduced a trap composed of 12 places in 146 ms
[2020-06-03 06:28:32] [INFO ] Deduced a trap composed of 11 places in 149 ms
[2020-06-03 06:28:33] [INFO ] Deduced a trap composed of 27 places in 140 ms
[2020-06-03 06:28:33] [INFO ] Deduced a trap composed of 136 places in 147 ms
[2020-06-03 06:28:33] [INFO ] Deduced a trap composed of 30 places in 149 ms
[2020-06-03 06:28:33] [INFO ] Deduced a trap composed of 47 places in 134 ms
[2020-06-03 06:28:33] [INFO ] Deduced a trap composed of 41 places in 140 ms
[2020-06-03 06:28:33] [INFO ] Deduced a trap composed of 41 places in 138 ms
[2020-06-03 06:28:34] [INFO ] Deduced a trap composed of 44 places in 134 ms
[2020-06-03 06:28:34] [INFO ] Deduced a trap composed of 27 places in 142 ms
[2020-06-03 06:28:34] [INFO ] Deduced a trap composed of 28 places in 138 ms
[2020-06-03 06:28:34] [INFO ] Deduced a trap composed of 38 places in 134 ms
[2020-06-03 06:28:34] [INFO ] Deduced a trap composed of 33 places in 126 ms
[2020-06-03 06:28:34] [INFO ] Deduced a trap composed of 27 places in 124 ms
[2020-06-03 06:28:34] [INFO ] Deduced a trap composed of 26 places in 127 ms
[2020-06-03 06:28:35] [INFO ] Deduced a trap composed of 39 places in 136 ms
[2020-06-03 06:28:35] [INFO ] Deduced a trap composed of 136 places in 129 ms
[2020-06-03 06:28:35] [INFO ] Deduced a trap composed of 140 places in 138 ms
[2020-06-03 06:28:35] [INFO ] Deduced a trap composed of 44 places in 118 ms
[2020-06-03 06:28:35] [INFO ] Deduced a trap composed of 135 places in 128 ms
[2020-06-03 06:28:35] [INFO ] Deduced a trap composed of 138 places in 135 ms
[2020-06-03 06:28:36] [INFO ] Deduced a trap composed of 51 places in 132 ms
[2020-06-03 06:28:36] [INFO ] Deduced a trap composed of 37 places in 137 ms
[2020-06-03 06:28:36] [INFO ] Deduced a trap composed of 30 places in 140 ms
[2020-06-03 06:28:36] [INFO ] Deduced a trap composed of 25 places in 128 ms
[2020-06-03 06:28:36] [INFO ] Deduced a trap composed of 34 places in 49 ms
[2020-06-03 06:28:36] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 5372 ms
[2020-06-03 06:28:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:28:36] [INFO ] [Nat]Absence check using 62 positive place invariants in 67 ms returned sat
[2020-06-03 06:28:36] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 29 ms returned sat
[2020-06-03 06:28:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:28:37] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2020-06-03 06:28:37] [INFO ] Deduced a trap composed of 27 places in 173 ms
[2020-06-03 06:28:37] [INFO ] Deduced a trap composed of 17 places in 150 ms
[2020-06-03 06:28:38] [INFO ] Deduced a trap composed of 12 places in 250 ms
[2020-06-03 06:28:38] [INFO ] Deduced a trap composed of 36 places in 147 ms
[2020-06-03 06:28:38] [INFO ] Deduced a trap composed of 12 places in 149 ms
[2020-06-03 06:28:38] [INFO ] Deduced a trap composed of 17 places in 164 ms
[2020-06-03 06:28:38] [INFO ] Deduced a trap composed of 25 places in 169 ms
[2020-06-03 06:28:39] [INFO ] Deduced a trap composed of 140 places in 181 ms
[2020-06-03 06:28:39] [INFO ] Deduced a trap composed of 16 places in 100 ms
[2020-06-03 06:28:39] [INFO ] Deduced a trap composed of 17 places in 119 ms
[2020-06-03 06:28:39] [INFO ] Deduced a trap composed of 25 places in 107 ms
[2020-06-03 06:28:39] [INFO ] Deduced a trap composed of 21 places in 100 ms
[2020-06-03 06:28:39] [INFO ] Deduced a trap composed of 21 places in 87 ms
[2020-06-03 06:28:39] [INFO ] Deduced a trap composed of 35 places in 99 ms
[2020-06-03 06:28:39] [INFO ] Deduced a trap composed of 22 places in 93 ms
[2020-06-03 06:28:40] [INFO ] Deduced a trap composed of 22 places in 91 ms
[2020-06-03 06:28:40] [INFO ] Deduced a trap composed of 24 places in 84 ms
[2020-06-03 06:28:40] [INFO ] Deduced a trap composed of 31 places in 81 ms
[2020-06-03 06:28:40] [INFO ] Deduced a trap composed of 40 places in 84 ms
[2020-06-03 06:28:40] [INFO ] Deduced a trap composed of 32 places in 99 ms
[2020-06-03 06:28:40] [INFO ] Deduced a trap composed of 35 places in 68 ms
[2020-06-03 06:28:40] [INFO ] Deduced a trap composed of 30 places in 198 ms
[2020-06-03 06:28:40] [INFO ] Deduced a trap composed of 27 places in 123 ms
[2020-06-03 06:28:41] [INFO ] Deduced a trap composed of 38 places in 149 ms
[2020-06-03 06:28:41] [INFO ] Deduced a trap composed of 65 places in 141 ms
[2020-06-03 06:28:41] [INFO ] Deduced a trap composed of 33 places in 119 ms
[2020-06-03 06:28:41] [INFO ] Deduced a trap composed of 47 places in 91 ms
[2020-06-03 06:28:41] [INFO ] Deduced a trap composed of 31 places in 103 ms
[2020-06-03 06:28:41] [INFO ] Deduced a trap composed of 34 places in 42 ms
[2020-06-03 06:28:41] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4126 ms
[2020-06-03 06:28:41] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 22 ms.
[2020-06-03 06:28:44] [INFO ] Added : 376 causal constraints over 76 iterations in 3226 ms. Result :sat
[2020-06-03 06:28:45] [INFO ] Deduced a trap composed of 52 places in 95 ms
[2020-06-03 06:28:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2020-06-03 06:28:45] [INFO ] [Real]Absence check using 62 positive place invariants in 35 ms returned sat
[2020-06-03 06:28:45] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 34 ms returned sat
[2020-06-03 06:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:28:46] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2020-06-03 06:28:46] [INFO ] Deduced a trap composed of 126 places in 157 ms
[2020-06-03 06:28:46] [INFO ] Deduced a trap composed of 14 places in 150 ms
[2020-06-03 06:28:46] [INFO ] Deduced a trap composed of 12 places in 151 ms
[2020-06-03 06:28:46] [INFO ] Deduced a trap composed of 18 places in 146 ms
[2020-06-03 06:28:46] [INFO ] Deduced a trap composed of 12 places in 172 ms
[2020-06-03 06:28:47] [INFO ] Deduced a trap composed of 18 places in 154 ms
[2020-06-03 06:28:47] [INFO ] Deduced a trap composed of 22 places in 185 ms
[2020-06-03 06:28:47] [INFO ] Deduced a trap composed of 14 places in 149 ms
[2020-06-03 06:28:47] [INFO ] Deduced a trap composed of 25 places in 162 ms
[2020-06-03 06:28:47] [INFO ] Deduced a trap composed of 15 places in 147 ms
[2020-06-03 06:28:48] [INFO ] Deduced a trap composed of 24 places in 163 ms
[2020-06-03 06:28:48] [INFO ] Deduced a trap composed of 17 places in 154 ms
[2020-06-03 06:28:48] [INFO ] Deduced a trap composed of 27 places in 153 ms
[2020-06-03 06:28:48] [INFO ] Deduced a trap composed of 23 places in 146 ms
[2020-06-03 06:28:48] [INFO ] Deduced a trap composed of 28 places in 142 ms
[2020-06-03 06:28:48] [INFO ] Deduced a trap composed of 25 places in 148 ms
[2020-06-03 06:28:49] [INFO ] Deduced a trap composed of 23 places in 153 ms
[2020-06-03 06:28:49] [INFO ] Deduced a trap composed of 26 places in 143 ms
[2020-06-03 06:28:49] [INFO ] Deduced a trap composed of 129 places in 159 ms
[2020-06-03 06:28:49] [INFO ] Deduced a trap composed of 31 places in 142 ms
[2020-06-03 06:28:49] [INFO ] Deduced a trap composed of 43 places in 154 ms
[2020-06-03 06:28:49] [INFO ] Deduced a trap composed of 46 places in 135 ms
[2020-06-03 06:28:49] [INFO ] Deduced a trap composed of 37 places in 62 ms
[2020-06-03 06:28:50] [INFO ] Deduced a trap composed of 36 places in 81 ms
[2020-06-03 06:28:50] [INFO ] Deduced a trap composed of 36 places in 64 ms
[2020-06-03 06:28:50] [INFO ] Deduced a trap composed of 28 places in 53 ms
[2020-06-03 06:28:50] [INFO ] Deduced a trap composed of 19 places in 71 ms
[2020-06-03 06:28:50] [INFO ] Deduced a trap composed of 43 places in 70 ms
[2020-06-03 06:28:50] [INFO ] Deduced a trap composed of 34 places in 58 ms
[2020-06-03 06:28:50] [INFO ] Deduced a trap composed of 38 places in 74 ms
[2020-06-03 06:28:50] [INFO ] Deduced a trap composed of 36 places in 60 ms
[2020-06-03 06:28:50] [INFO ] Deduced a trap composed of 37 places in 69 ms
[2020-06-03 06:28:50] [INFO ] Deduced a trap composed of 134 places in 149 ms
[2020-06-03 06:28:51] [INFO ] Deduced a trap composed of 72 places in 177 ms
[2020-06-03 06:28:51] [INFO ] Deduced a trap composed of 46 places in 136 ms
[2020-06-03 06:28:51] [INFO ] Deduced a trap composed of 28 places in 131 ms
[2020-06-03 06:28:51] [INFO ] Deduced a trap composed of 133 places in 161 ms
[2020-06-03 06:28:51] [INFO ] Deduced a trap composed of 17 places in 141 ms
[2020-06-03 06:28:51] [INFO ] Deduced a trap composed of 57 places in 137 ms
[2020-06-03 06:28:52] [INFO ] Deduced a trap composed of 127 places in 137 ms
[2020-06-03 06:28:52] [INFO ] Deduced a trap composed of 131 places in 124 ms
[2020-06-03 06:28:52] [INFO ] Deduced a trap composed of 134 places in 124 ms
[2020-06-03 06:28:52] [INFO ] Deduced a trap composed of 45 places in 136 ms
[2020-06-03 06:28:52] [INFO ] Deduced a trap composed of 57 places in 161 ms
[2020-06-03 06:28:52] [INFO ] Deduced a trap composed of 119 places in 150 ms
[2020-06-03 06:28:53] [INFO ] Deduced a trap composed of 127 places in 156 ms
[2020-06-03 06:28:53] [INFO ] Deduced a trap composed of 125 places in 143 ms
[2020-06-03 06:28:53] [INFO ] Deduced a trap composed of 124 places in 161 ms
[2020-06-03 06:28:53] [INFO ] Deduced a trap composed of 125 places in 150 ms
[2020-06-03 06:28:53] [INFO ] Deduced a trap composed of 126 places in 123 ms
[2020-06-03 06:28:53] [INFO ] Deduced a trap composed of 20 places in 126 ms
[2020-06-03 06:28:54] [INFO ] Deduced a trap composed of 47 places in 137 ms
[2020-06-03 06:28:54] [INFO ] Deduced a trap composed of 39 places in 217 ms
[2020-06-03 06:28:54] [INFO ] Deduced a trap composed of 135 places in 145 ms
[2020-06-03 06:28:54] [INFO ] Deduced a trap composed of 57 places in 154 ms
[2020-06-03 06:28:54] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 8666 ms
[2020-06-03 06:28:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:28:54] [INFO ] [Nat]Absence check using 62 positive place invariants in 84 ms returned sat
[2020-06-03 06:28:54] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:28:55] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2020-06-03 06:28:55] [INFO ] Deduced a trap composed of 18 places in 153 ms
[2020-06-03 06:28:55] [INFO ] Deduced a trap composed of 18 places in 174 ms
[2020-06-03 06:28:56] [INFO ] Deduced a trap composed of 21 places in 152 ms
[2020-06-03 06:28:56] [INFO ] Deduced a trap composed of 14 places in 143 ms
[2020-06-03 06:28:56] [INFO ] Deduced a trap composed of 18 places in 173 ms
[2020-06-03 06:28:56] [INFO ] Deduced a trap composed of 119 places in 143 ms
[2020-06-03 06:28:56] [INFO ] Deduced a trap composed of 12 places in 161 ms
[2020-06-03 06:28:57] [INFO ] Deduced a trap composed of 29 places in 145 ms
[2020-06-03 06:28:57] [INFO ] Deduced a trap composed of 26 places in 147 ms
[2020-06-03 06:28:57] [INFO ] Deduced a trap composed of 16 places in 175 ms
[2020-06-03 06:28:57] [INFO ] Deduced a trap composed of 21 places in 154 ms
[2020-06-03 06:28:57] [INFO ] Deduced a trap composed of 123 places in 136 ms
[2020-06-03 06:28:57] [INFO ] Deduced a trap composed of 26 places in 137 ms
[2020-06-03 06:28:58] [INFO ] Deduced a trap composed of 26 places in 145 ms
[2020-06-03 06:28:58] [INFO ] Deduced a trap composed of 31 places in 172 ms
[2020-06-03 06:28:58] [INFO ] Deduced a trap composed of 33 places in 167 ms
[2020-06-03 06:28:58] [INFO ] Deduced a trap composed of 125 places in 150 ms
[2020-06-03 06:28:58] [INFO ] Deduced a trap composed of 130 places in 147 ms
[2020-06-03 06:28:58] [INFO ] Deduced a trap composed of 31 places in 149 ms
[2020-06-03 06:28:59] [INFO ] Deduced a trap composed of 59 places in 134 ms
[2020-06-03 06:28:59] [INFO ] Deduced a trap composed of 121 places in 150 ms
[2020-06-03 06:28:59] [INFO ] Deduced a trap composed of 43 places in 142 ms
[2020-06-03 06:28:59] [INFO ] Deduced a trap composed of 123 places in 144 ms
[2020-06-03 06:28:59] [INFO ] Deduced a trap composed of 54 places in 80 ms
[2020-06-03 06:28:59] [INFO ] Deduced a trap composed of 47 places in 139 ms
[2020-06-03 06:29:00] [INFO ] Deduced a trap composed of 119 places in 147 ms
[2020-06-03 06:29:00] [INFO ] Deduced a trap composed of 127 places in 135 ms
[2020-06-03 06:29:00] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4597 ms
[2020-06-03 06:29:00] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 31 ms.
[2020-06-03 06:29:04] [INFO ] Added : 419 causal constraints over 84 iterations in 4120 ms. Result :sat
[2020-06-03 06:29:04] [INFO ] Deduced a trap composed of 164 places in 146 ms
[2020-06-03 06:29:04] [INFO ] Deduced a trap composed of 167 places in 139 ms
[2020-06-03 06:29:05] [INFO ] Deduced a trap composed of 153 places in 250 ms
[2020-06-03 06:29:05] [INFO ] Deduced a trap composed of 162 places in 189 ms
[2020-06-03 06:29:05] [INFO ] Deduced a trap composed of 155 places in 213 ms
[2020-06-03 06:29:05] [INFO ] Deduced a trap composed of 163 places in 182 ms
[2020-06-03 06:29:06] [INFO ] Deduced a trap composed of 162 places in 192 ms
[2020-06-03 06:29:06] [INFO ] Deduced a trap composed of 179 places in 190 ms
[2020-06-03 06:29:06] [INFO ] Deduced a trap composed of 177 places in 144 ms
[2020-06-03 06:29:06] [INFO ] Deduced a trap composed of 145 places in 184 ms
[2020-06-03 06:29:07] [INFO ] Deduced a trap composed of 151 places in 170 ms
[2020-06-03 06:29:07] [INFO ] Deduced a trap composed of 155 places in 184 ms
[2020-06-03 06:29:07] [INFO ] Deduced a trap composed of 148 places in 190 ms
[2020-06-03 06:29:07] [INFO ] Deduced a trap composed of 139 places in 158 ms
[2020-06-03 06:29:08] [INFO ] Deduced a trap composed of 145 places in 156 ms
[2020-06-03 06:29:08] [INFO ] Deduced a trap composed of 42 places in 51 ms
[2020-06-03 06:29:08] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3922 ms
[2020-06-03 06:29:08] [INFO ] [Real]Absence check using 62 positive place invariants in 37 ms returned sat
[2020-06-03 06:29:08] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-06-03 06:29:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:29:09] [INFO ] [Real]Absence check using state equation in 741 ms returned sat
[2020-06-03 06:29:09] [INFO ] Deduced a trap composed of 29 places in 154 ms
[2020-06-03 06:29:09] [INFO ] Deduced a trap composed of 14 places in 197 ms
[2020-06-03 06:29:09] [INFO ] Deduced a trap composed of 120 places in 159 ms
[2020-06-03 06:29:09] [INFO ] Deduced a trap composed of 31 places in 152 ms
[2020-06-03 06:29:10] [INFO ] Deduced a trap composed of 129 places in 165 ms
[2020-06-03 06:29:10] [INFO ] Deduced a trap composed of 134 places in 165 ms
[2020-06-03 06:29:10] [INFO ] Deduced a trap composed of 131 places in 160 ms
[2020-06-03 06:29:10] [INFO ] Deduced a trap composed of 124 places in 158 ms
[2020-06-03 06:29:10] [INFO ] Deduced a trap composed of 12 places in 157 ms
[2020-06-03 06:29:10] [INFO ] Deduced a trap composed of 130 places in 151 ms
[2020-06-03 06:29:11] [INFO ] Deduced a trap composed of 25 places in 147 ms
[2020-06-03 06:29:11] [INFO ] Deduced a trap composed of 26 places in 162 ms
[2020-06-03 06:29:11] [INFO ] Deduced a trap composed of 50 places in 157 ms
[2020-06-03 06:29:11] [INFO ] Deduced a trap composed of 28 places in 167 ms
[2020-06-03 06:29:11] [INFO ] Deduced a trap composed of 53 places in 157 ms
[2020-06-03 06:29:11] [INFO ] Deduced a trap composed of 26 places in 133 ms
[2020-06-03 06:29:12] [INFO ] Deduced a trap composed of 17 places in 140 ms
[2020-06-03 06:29:12] [INFO ] Deduced a trap composed of 58 places in 143 ms
[2020-06-03 06:29:12] [INFO ] Deduced a trap composed of 63 places in 150 ms
[2020-06-03 06:29:12] [INFO ] Deduced a trap composed of 17 places in 141 ms
[2020-06-03 06:29:12] [INFO ] Deduced a trap composed of 20 places in 144 ms
[2020-06-03 06:29:12] [INFO ] Deduced a trap composed of 20 places in 146 ms
[2020-06-03 06:29:13] [INFO ] Deduced a trap composed of 24 places in 123 ms
[2020-06-03 06:29:13] [INFO ] Deduced a trap composed of 130 places in 162 ms
[2020-06-03 06:29:13] [INFO ] Deduced a trap composed of 27 places in 136 ms
[2020-06-03 06:29:13] [INFO ] Deduced a trap composed of 124 places in 170 ms
[2020-06-03 06:29:13] [INFO ] Deduced a trap composed of 55 places in 134 ms
[2020-06-03 06:29:13] [INFO ] Deduced a trap composed of 127 places in 120 ms
[2020-06-03 06:29:14] [INFO ] Deduced a trap composed of 125 places in 125 ms
[2020-06-03 06:29:14] [INFO ] Deduced a trap composed of 126 places in 138 ms
[2020-06-03 06:29:14] [INFO ] Deduced a trap composed of 119 places in 121 ms
[2020-06-03 06:29:14] [INFO ] Deduced a trap composed of 127 places in 197 ms
[2020-06-03 06:29:14] [INFO ] Deduced a trap composed of 57 places in 86 ms
[2020-06-03 06:29:14] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 5653 ms
[2020-06-03 06:29:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:29:14] [INFO ] [Nat]Absence check using 62 positive place invariants in 77 ms returned sat
[2020-06-03 06:29:14] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 19 ms returned sat
[2020-06-03 06:29:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:29:15] [INFO ] [Nat]Absence check using state equation in 736 ms returned sat
[2020-06-03 06:29:15] [INFO ] Deduced a trap composed of 11 places in 192 ms
[2020-06-03 06:29:16] [INFO ] Deduced a trap composed of 17 places in 160 ms
[2020-06-03 06:29:16] [INFO ] Deduced a trap composed of 15 places in 137 ms
[2020-06-03 06:29:16] [INFO ] Deduced a trap composed of 17 places in 144 ms
[2020-06-03 06:29:16] [INFO ] Deduced a trap composed of 19 places in 181 ms
[2020-06-03 06:29:16] [INFO ] Deduced a trap composed of 20 places in 162 ms
[2020-06-03 06:29:16] [INFO ] Deduced a trap composed of 28 places in 149 ms
[2020-06-03 06:29:17] [INFO ] Deduced a trap composed of 12 places in 182 ms
[2020-06-03 06:29:17] [INFO ] Deduced a trap composed of 25 places in 144 ms
[2020-06-03 06:29:17] [INFO ] Deduced a trap composed of 129 places in 157 ms
[2020-06-03 06:29:17] [INFO ] Deduced a trap composed of 8 places in 151 ms
[2020-06-03 06:29:17] [INFO ] Deduced a trap composed of 21 places in 150 ms
[2020-06-03 06:29:17] [INFO ] Deduced a trap composed of 24 places in 151 ms
[2020-06-03 06:29:18] [INFO ] Deduced a trap composed of 47 places in 152 ms
[2020-06-03 06:29:18] [INFO ] Deduced a trap composed of 140 places in 152 ms
[2020-06-03 06:29:18] [INFO ] Deduced a trap composed of 128 places in 168 ms
[2020-06-03 06:29:18] [INFO ] Deduced a trap composed of 136 places in 165 ms
[2020-06-03 06:29:18] [INFO ] Deduced a trap composed of 134 places in 156 ms
[2020-06-03 06:29:19] [INFO ] Deduced a trap composed of 135 places in 136 ms
[2020-06-03 06:29:19] [INFO ] Deduced a trap composed of 129 places in 133 ms
[2020-06-03 06:29:19] [INFO ] Deduced a trap composed of 26 places in 151 ms
[2020-06-03 06:29:19] [INFO ] Deduced a trap composed of 127 places in 143 ms
[2020-06-03 06:29:19] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3869 ms
[2020-06-03 06:29:19] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 21 ms.
[2020-06-03 06:29:23] [INFO ] Added : 399 causal constraints over 80 iterations in 3950 ms. Result :sat
[2020-06-03 06:29:23] [INFO ] Deduced a trap composed of 137 places in 178 ms
[2020-06-03 06:29:23] [INFO ] Deduced a trap composed of 137 places in 137 ms
[2020-06-03 06:29:24] [INFO ] Deduced a trap composed of 135 places in 125 ms
[2020-06-03 06:29:24] [INFO ] Deduced a trap composed of 145 places in 150 ms
[2020-06-03 06:29:24] [INFO ] Deduced a trap composed of 142 places in 132 ms
[2020-06-03 06:29:24] [INFO ] Deduced a trap composed of 142 places in 128 ms
[2020-06-03 06:29:24] [INFO ] Deduced a trap composed of 140 places in 139 ms
[2020-06-03 06:29:25] [INFO ] Deduced a trap composed of 142 places in 129 ms
[2020-06-03 06:29:25] [INFO ] Deduced a trap composed of 137 places in 155 ms
[2020-06-03 06:29:25] [INFO ] Deduced a trap composed of 138 places in 133 ms
[2020-06-03 06:29:25] [INFO ] Deduced a trap composed of 137 places in 133 ms
[2020-06-03 06:29:25] [INFO ] Deduced a trap composed of 145 places in 134 ms
[2020-06-03 06:29:26] [INFO ] Deduced a trap composed of 147 places in 137 ms
[2020-06-03 06:29:26] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2620 ms
[2020-06-03 06:29:26] [INFO ] [Real]Absence check using 62 positive place invariants in 56 ms returned sat
[2020-06-03 06:29:26] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:29:26] [INFO ] [Real]Absence check using state equation in 617 ms returned unsat
[2020-06-03 06:29:26] [INFO ] [Real]Absence check using 62 positive place invariants in 38 ms returned sat
[2020-06-03 06:29:26] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-06-03 06:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:29:27] [INFO ] [Real]Absence check using state equation in 571 ms returned unsat
[2020-06-03 06:29:27] [INFO ] [Real]Absence check using 62 positive place invariants in 46 ms returned sat
[2020-06-03 06:29:27] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-06-03 06:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:29:28] [INFO ] [Real]Absence check using state equation in 756 ms returned sat
[2020-06-03 06:29:28] [INFO ] Deduced a trap composed of 17 places in 137 ms
[2020-06-03 06:29:28] [INFO ] Deduced a trap composed of 16 places in 132 ms
[2020-06-03 06:29:28] [INFO ] Deduced a trap composed of 19 places in 132 ms
[2020-06-03 06:29:29] [INFO ] Deduced a trap composed of 31 places in 177 ms
[2020-06-03 06:29:29] [INFO ] Deduced a trap composed of 34 places in 157 ms
[2020-06-03 06:29:29] [INFO ] Deduced a trap composed of 28 places in 164 ms
[2020-06-03 06:29:29] [INFO ] Deduced a trap composed of 27 places in 159 ms
[2020-06-03 06:29:29] [INFO ] Deduced a trap composed of 24 places in 146 ms
[2020-06-03 06:29:30] [INFO ] Deduced a trap composed of 24 places in 116 ms
[2020-06-03 06:29:30] [INFO ] Deduced a trap composed of 25 places in 116 ms
[2020-06-03 06:29:30] [INFO ] Deduced a trap composed of 12 places in 135 ms
[2020-06-03 06:29:30] [INFO ] Deduced a trap composed of 51 places in 127 ms
[2020-06-03 06:29:30] [INFO ] Deduced a trap composed of 55 places in 160 ms
[2020-06-03 06:29:30] [INFO ] Deduced a trap composed of 75 places in 151 ms
[2020-06-03 06:29:30] [INFO ] Deduced a trap composed of 152 places in 147 ms
[2020-06-03 06:29:31] [INFO ] Deduced a trap composed of 18 places in 141 ms
[2020-06-03 06:29:31] [INFO ] Deduced a trap composed of 141 places in 116 ms
[2020-06-03 06:29:31] [INFO ] Deduced a trap composed of 22 places in 113 ms
[2020-06-03 06:29:31] [INFO ] Deduced a trap composed of 139 places in 115 ms
[2020-06-03 06:29:31] [INFO ] Deduced a trap composed of 48 places in 124 ms
[2020-06-03 06:29:31] [INFO ] Deduced a trap composed of 67 places in 127 ms
[2020-06-03 06:29:31] [INFO ] Deduced a trap composed of 147 places in 141 ms
[2020-06-03 06:29:32] [INFO ] Deduced a trap composed of 142 places in 152 ms
[2020-06-03 06:29:32] [INFO ] Deduced a trap composed of 44 places in 132 ms
[2020-06-03 06:29:32] [INFO ] Deduced a trap composed of 143 places in 144 ms
[2020-06-03 06:29:32] [INFO ] Deduced a trap composed of 15 places in 149 ms
[2020-06-03 06:29:32] [INFO ] Deduced a trap composed of 24 places in 139 ms
[2020-06-03 06:29:32] [INFO ] Deduced a trap composed of 148 places in 138 ms
[2020-06-03 06:29:32] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4497 ms
[2020-06-03 06:29:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:29:33] [INFO ] [Nat]Absence check using 62 positive place invariants in 66 ms returned sat
[2020-06-03 06:29:33] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:29:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:29:33] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2020-06-03 06:29:34] [INFO ] Deduced a trap composed of 19 places in 146 ms
[2020-06-03 06:29:34] [INFO ] Deduced a trap composed of 19 places in 140 ms
[2020-06-03 06:29:34] [INFO ] Deduced a trap composed of 11 places in 179 ms
[2020-06-03 06:29:34] [INFO ] Deduced a trap composed of 22 places in 147 ms
[2020-06-03 06:29:34] [INFO ] Deduced a trap composed of 11 places in 185 ms
[2020-06-03 06:29:34] [INFO ] Deduced a trap composed of 19 places in 143 ms
[2020-06-03 06:29:35] [INFO ] Deduced a trap composed of 14 places in 154 ms
[2020-06-03 06:29:35] [INFO ] Deduced a trap composed of 22 places in 150 ms
[2020-06-03 06:29:35] [INFO ] Deduced a trap composed of 28 places in 143 ms
[2020-06-03 06:29:35] [INFO ] Deduced a trap composed of 26 places in 125 ms
[2020-06-03 06:29:35] [INFO ] Deduced a trap composed of 23 places in 143 ms
[2020-06-03 06:29:35] [INFO ] Deduced a trap composed of 25 places in 123 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 20 places in 120 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 18 places in 125 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 30 places in 131 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 17 places in 118 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 29 places in 127 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 135 places in 136 ms
[2020-06-03 06:29:36] [INFO ] Deduced a trap composed of 53 places in 123 ms
[2020-06-03 06:29:37] [INFO ] Deduced a trap composed of 130 places in 151 ms
[2020-06-03 06:29:37] [INFO ] Deduced a trap composed of 21 places in 132 ms
[2020-06-03 06:29:37] [INFO ] Deduced a trap composed of 50 places in 155 ms
[2020-06-03 06:29:37] [INFO ] Deduced a trap composed of 152 places in 169 ms
[2020-06-03 06:29:37] [INFO ] Deduced a trap composed of 151 places in 147 ms
[2020-06-03 06:29:37] [INFO ] Deduced a trap composed of 134 places in 124 ms
[2020-06-03 06:29:38] [INFO ] Deduced a trap composed of 131 places in 115 ms
[2020-06-03 06:29:38] [INFO ] Deduced a trap composed of 129 places in 117 ms
[2020-06-03 06:29:38] [INFO ] Deduced a trap composed of 154 places in 128 ms
[2020-06-03 06:29:38] [INFO ] Deduced a trap composed of 152 places in 131 ms
[2020-06-03 06:29:38] [INFO ] Deduced a trap composed of 32 places in 135 ms
[2020-06-03 06:29:38] [INFO ] Deduced a trap composed of 17 places in 71 ms
[2020-06-03 06:29:38] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 4829 ms
[2020-06-03 06:29:38] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 21 ms.
[2020-06-03 06:29:42] [INFO ] Added : 360 causal constraints over 72 iterations in 3354 ms. Result :sat
[2020-06-03 06:29:42] [INFO ] [Real]Absence check using 62 positive place invariants in 43 ms returned sat
[2020-06-03 06:29:42] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 19 ms returned sat
[2020-06-03 06:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:29:42] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2020-06-03 06:29:43] [INFO ] Deduced a trap composed of 15 places in 215 ms
[2020-06-03 06:29:43] [INFO ] Deduced a trap composed of 22 places in 154 ms
[2020-06-03 06:29:43] [INFO ] Deduced a trap composed of 21 places in 151 ms
[2020-06-03 06:29:43] [INFO ] Deduced a trap composed of 24 places in 168 ms
[2020-06-03 06:29:43] [INFO ] Deduced a trap composed of 12 places in 143 ms
[2020-06-03 06:29:44] [INFO ] Deduced a trap composed of 12 places in 166 ms
[2020-06-03 06:29:44] [INFO ] Deduced a trap composed of 14 places in 153 ms
[2020-06-03 06:29:44] [INFO ] Deduced a trap composed of 24 places in 146 ms
[2020-06-03 06:29:44] [INFO ] Deduced a trap composed of 19 places in 75 ms
[2020-06-03 06:29:44] [INFO ] Deduced a trap composed of 28 places in 86 ms
[2020-06-03 06:29:44] [INFO ] Deduced a trap composed of 17 places in 67 ms
[2020-06-03 06:29:44] [INFO ] Deduced a trap composed of 21 places in 68 ms
[2020-06-03 06:29:44] [INFO ] Deduced a trap composed of 48 places in 70 ms
[2020-06-03 06:29:44] [INFO ] Deduced a trap composed of 21 places in 68 ms
[2020-06-03 06:29:44] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2022 ms
[2020-06-03 06:29:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:29:45] [INFO ] [Nat]Absence check using 62 positive place invariants in 64 ms returned sat
[2020-06-03 06:29:45] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 34 ms returned sat
[2020-06-03 06:29:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:29:45] [INFO ] [Nat]Absence check using state equation in 755 ms returned sat
[2020-06-03 06:29:46] [INFO ] Deduced a trap composed of 11 places in 209 ms
[2020-06-03 06:29:46] [INFO ] Deduced a trap composed of 14 places in 140 ms
[2020-06-03 06:29:46] [INFO ] Deduced a trap composed of 15 places in 159 ms
[2020-06-03 06:29:46] [INFO ] Deduced a trap composed of 17 places in 176 ms
[2020-06-03 06:29:46] [INFO ] Deduced a trap composed of 23 places in 158 ms
[2020-06-03 06:29:47] [INFO ] Deduced a trap composed of 21 places in 136 ms
[2020-06-03 06:29:47] [INFO ] Deduced a trap composed of 21 places in 147 ms
[2020-06-03 06:29:47] [INFO ] Deduced a trap composed of 28 places in 158 ms
[2020-06-03 06:29:47] [INFO ] Deduced a trap composed of 20 places in 138 ms
[2020-06-03 06:29:47] [INFO ] Deduced a trap composed of 17 places in 158 ms
[2020-06-03 06:29:47] [INFO ] Deduced a trap composed of 130 places in 145 ms
[2020-06-03 06:29:48] [INFO ] Deduced a trap composed of 47 places in 141 ms
[2020-06-03 06:29:48] [INFO ] Deduced a trap composed of 47 places in 185 ms
[2020-06-03 06:29:48] [INFO ] Deduced a trap composed of 69 places in 142 ms
[2020-06-03 06:29:48] [INFO ] Deduced a trap composed of 143 places in 130 ms
[2020-06-03 06:29:48] [INFO ] Deduced a trap composed of 50 places in 159 ms
[2020-06-03 06:29:48] [INFO ] Deduced a trap composed of 71 places in 147 ms
[2020-06-03 06:29:49] [INFO ] Deduced a trap composed of 73 places in 138 ms
[2020-06-03 06:29:49] [INFO ] Deduced a trap composed of 24 places in 155 ms
[2020-06-03 06:29:49] [INFO ] Deduced a trap composed of 146 places in 162 ms
[2020-06-03 06:29:49] [INFO ] Deduced a trap composed of 144 places in 155 ms
[2020-06-03 06:29:49] [INFO ] Deduced a trap composed of 144 places in 122 ms
[2020-06-03 06:29:49] [INFO ] Deduced a trap composed of 142 places in 127 ms
[2020-06-03 06:29:50] [INFO ] Deduced a trap composed of 138 places in 125 ms
[2020-06-03 06:29:50] [INFO ] Deduced a trap composed of 139 places in 119 ms
[2020-06-03 06:29:50] [INFO ] Deduced a trap composed of 142 places in 125 ms
[2020-06-03 06:29:50] [INFO ] Deduced a trap composed of 139 places in 135 ms
[2020-06-03 06:29:50] [INFO ] Deduced a trap composed of 143 places in 187 ms
[2020-06-03 06:29:50] [INFO ] Deduced a trap composed of 142 places in 139 ms
[2020-06-03 06:29:50] [INFO ] Deduced a trap composed of 143 places in 140 ms
[2020-06-03 06:29:51] [INFO ] Deduced a trap composed of 143 places in 158 ms
[2020-06-03 06:29:51] [INFO ] Deduced a trap composed of 140 places in 119 ms
[2020-06-03 06:29:51] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5389 ms
[2020-06-03 06:29:51] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 24 ms.
[2020-06-03 06:29:54] [INFO ] Added : 375 causal constraints over 75 iterations in 3400 ms. Result :sat
[2020-06-03 06:29:54] [INFO ] [Real]Absence check using 62 positive place invariants in 35 ms returned sat
[2020-06-03 06:29:54] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-06-03 06:29:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:29:55] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2020-06-03 06:29:55] [INFO ] Deduced a trap composed of 11 places in 230 ms
[2020-06-03 06:29:56] [INFO ] Deduced a trap composed of 19 places in 203 ms
[2020-06-03 06:29:56] [INFO ] Deduced a trap composed of 15 places in 235 ms
[2020-06-03 06:29:56] [INFO ] Deduced a trap composed of 119 places in 196 ms
[2020-06-03 06:29:56] [INFO ] Deduced a trap composed of 11 places in 200 ms
[2020-06-03 06:29:57] [INFO ] Deduced a trap composed of 18 places in 196 ms
[2020-06-03 06:29:57] [INFO ] Deduced a trap composed of 24 places in 178 ms
[2020-06-03 06:29:57] [INFO ] Deduced a trap composed of 21 places in 179 ms
[2020-06-03 06:29:57] [INFO ] Deduced a trap composed of 26 places in 164 ms
[2020-06-03 06:29:57] [INFO ] Deduced a trap composed of 22 places in 196 ms
[2020-06-03 06:29:58] [INFO ] Deduced a trap composed of 22 places in 183 ms
[2020-06-03 06:29:58] [INFO ] Deduced a trap composed of 28 places in 175 ms
[2020-06-03 06:29:58] [INFO ] Deduced a trap composed of 142 places in 158 ms
[2020-06-03 06:29:58] [INFO ] Deduced a trap composed of 37 places in 183 ms
[2020-06-03 06:29:58] [INFO ] Deduced a trap composed of 143 places in 195 ms
[2020-06-03 06:29:59] [INFO ] Deduced a trap composed of 28 places in 168 ms
[2020-06-03 06:29:59] [INFO ] Deduced a trap composed of 130 places in 160 ms
[2020-06-03 06:29:59] [INFO ] Deduced a trap composed of 27 places in 151 ms
[2020-06-03 06:29:59] [INFO ] Deduced a trap composed of 128 places in 160 ms
[2020-06-03 06:29:59] [INFO ] Deduced a trap composed of 36 places in 163 ms
[2020-06-03 06:29:59] [INFO ] Deduced a trap composed of 50 places in 152 ms
[2020-06-03 06:30:00] [INFO ] Deduced a trap composed of 130 places in 147 ms
[2020-06-03 06:30:00] [INFO ] Deduced a trap composed of 124 places in 149 ms
[2020-06-03 06:30:00] [INFO ] Deduced a trap composed of 44 places in 150 ms
[2020-06-03 06:30:00] [INFO ] Deduced a trap composed of 57 places in 160 ms
[2020-06-03 06:30:00] [INFO ] Deduced a trap composed of 30 places in 147 ms
[2020-06-03 06:30:01] [INFO ] Deduced a trap composed of 30 places in 166 ms
[2020-06-03 06:30:01] [INFO ] Deduced a trap composed of 130 places in 145 ms
[2020-06-03 06:30:01] [INFO ] Deduced a trap composed of 43 places in 148 ms
[2020-06-03 06:30:01] [INFO ] Deduced a trap composed of 45 places in 150 ms
[2020-06-03 06:30:01] [INFO ] Deduced a trap composed of 146 places in 151 ms
[2020-06-03 06:30:01] [INFO ] Deduced a trap composed of 30 places in 158 ms
[2020-06-03 06:30:02] [INFO ] Deduced a trap composed of 26 places in 142 ms
[2020-06-03 06:30:02] [INFO ] Deduced a trap composed of 56 places in 159 ms
[2020-06-03 06:30:02] [INFO ] Deduced a trap composed of 144 places in 144 ms
[2020-06-03 06:30:02] [INFO ] Deduced a trap composed of 149 places in 146 ms
[2020-06-03 06:30:02] [INFO ] Deduced a trap composed of 29 places in 146 ms
[2020-06-03 06:30:02] [INFO ] Deduced a trap composed of 30 places in 138 ms
[2020-06-03 06:30:03] [INFO ] Deduced a trap composed of 155 places in 148 ms
[2020-06-03 06:30:03] [INFO ] Deduced a trap composed of 39 places in 146 ms
[2020-06-03 06:30:03] [INFO ] Deduced a trap composed of 146 places in 140 ms
[2020-06-03 06:30:03] [INFO ] Deduced a trap composed of 145 places in 148 ms
[2020-06-03 06:30:03] [INFO ] Deduced a trap composed of 150 places in 142 ms
[2020-06-03 06:30:03] [INFO ] Deduced a trap composed of 147 places in 144 ms
[2020-06-03 06:30:04] [INFO ] Deduced a trap composed of 36 places in 143 ms
[2020-06-03 06:30:04] [INFO ] Deduced a trap composed of 49 places in 137 ms
[2020-06-03 06:30:04] [INFO ] Deduced a trap composed of 43 places in 153 ms
[2020-06-03 06:30:04] [INFO ] Deduced a trap composed of 160 places in 142 ms
[2020-06-03 06:30:04] [INFO ] Deduced a trap composed of 42 places in 160 ms
[2020-06-03 06:30:04] [INFO ] Deduced a trap composed of 141 places in 143 ms
[2020-06-03 06:30:05] [INFO ] Deduced a trap composed of 141 places in 175 ms
[2020-06-03 06:30:05] [INFO ] Deduced a trap composed of 148 places in 137 ms
[2020-06-03 06:30:05] [INFO ] Deduced a trap composed of 167 places in 140 ms
[2020-06-03 06:30:05] [INFO ] Deduced a trap composed of 144 places in 141 ms
[2020-06-03 06:30:05] [INFO ] Deduced a trap composed of 144 places in 148 ms
[2020-06-03 06:30:05] [INFO ] Deduced a trap composed of 144 places in 145 ms
[2020-06-03 06:30:06] [INFO ] Deduced a trap composed of 138 places in 154 ms
[2020-06-03 06:30:06] [INFO ] Deduced a trap composed of 138 places in 141 ms
[2020-06-03 06:30:06] [INFO ] Deduced a trap composed of 141 places in 128 ms
[2020-06-03 06:30:06] [INFO ] Deduced a trap composed of 143 places in 149 ms
[2020-06-03 06:30:06] [INFO ] Deduced a trap composed of 160 places in 139 ms
[2020-06-03 06:30:06] [INFO ] Deduced a trap composed of 145 places in 145 ms
[2020-06-03 06:30:07] [INFO ] Deduced a trap composed of 141 places in 138 ms
[2020-06-03 06:30:07] [INFO ] Deduced a trap composed of 143 places in 128 ms
[2020-06-03 06:30:07] [INFO ] Deduced a trap composed of 139 places in 144 ms
[2020-06-03 06:30:07] [INFO ] Deduced a trap composed of 148 places in 134 ms
[2020-06-03 06:30:07] [INFO ] Deduced a trap composed of 149 places in 135 ms
[2020-06-03 06:30:07] [INFO ] Deduced a trap composed of 142 places in 139 ms
[2020-06-03 06:30:08] [INFO ] Deduced a trap composed of 153 places in 131 ms
[2020-06-03 06:30:08] [INFO ] Deduced a trap composed of 147 places in 129 ms
[2020-06-03 06:30:08] [INFO ] Deduced a trap composed of 153 places in 141 ms
[2020-06-03 06:30:08] [INFO ] Deduced a trap composed of 164 places in 135 ms
[2020-06-03 06:30:08] [INFO ] Deduced a trap composed of 144 places in 143 ms
[2020-06-03 06:30:08] [INFO ] Deduced a trap composed of 136 places in 135 ms
[2020-06-03 06:30:09] [INFO ] Deduced a trap composed of 150 places in 132 ms
[2020-06-03 06:30:09] [INFO ] Trap strengthening (SAT) tested/added 76/75 trap constraints in 13343 ms
[2020-06-03 06:30:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:30:09] [INFO ] [Nat]Absence check using 62 positive place invariants in 64 ms returned sat
[2020-06-03 06:30:09] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 19 ms returned sat
[2020-06-03 06:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:30:09] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2020-06-03 06:30:10] [INFO ] Deduced a trap composed of 16 places in 204 ms
[2020-06-03 06:30:10] [INFO ] Deduced a trap composed of 19 places in 212 ms
[2020-06-03 06:30:10] [INFO ] Deduced a trap composed of 10 places in 179 ms
[2020-06-03 06:30:10] [INFO ] Deduced a trap composed of 22 places in 166 ms
[2020-06-03 06:30:10] [INFO ] Deduced a trap composed of 13 places in 188 ms
[2020-06-03 06:30:11] [INFO ] Deduced a trap composed of 8 places in 160 ms
[2020-06-03 06:30:11] [INFO ] Deduced a trap composed of 125 places in 175 ms
[2020-06-03 06:30:11] [INFO ] Deduced a trap composed of 151 places in 193 ms
[2020-06-03 06:30:11] [INFO ] Deduced a trap composed of 63 places in 153 ms
[2020-06-03 06:30:11] [INFO ] Deduced a trap composed of 28 places in 151 ms
[2020-06-03 06:30:12] [INFO ] Deduced a trap composed of 22 places in 216 ms
[2020-06-03 06:30:12] [INFO ] Deduced a trap composed of 19 places in 181 ms
[2020-06-03 06:30:12] [INFO ] Deduced a trap composed of 18 places in 187 ms
[2020-06-03 06:30:12] [INFO ] Deduced a trap composed of 19 places in 177 ms
[2020-06-03 06:30:13] [INFO ] Deduced a trap composed of 20 places in 196 ms
[2020-06-03 06:30:13] [INFO ] Deduced a trap composed of 21 places in 160 ms
[2020-06-03 06:30:13] [INFO ] Deduced a trap composed of 22 places in 213 ms
[2020-06-03 06:30:13] [INFO ] Deduced a trap composed of 38 places in 180 ms
[2020-06-03 06:30:13] [INFO ] Deduced a trap composed of 115 places in 170 ms
[2020-06-03 06:30:14] [INFO ] Deduced a trap composed of 18 places in 174 ms
[2020-06-03 06:30:14] [INFO ] Deduced a trap composed of 121 places in 173 ms
[2020-06-03 06:30:14] [INFO ] Deduced a trap composed of 125 places in 173 ms
[2020-06-03 06:30:14] [INFO ] Deduced a trap composed of 28 places in 165 ms
[2020-06-03 06:30:14] [INFO ] Deduced a trap composed of 24 places in 174 ms
[2020-06-03 06:30:15] [INFO ] Deduced a trap composed of 33 places in 163 ms
[2020-06-03 06:30:15] [INFO ] Deduced a trap composed of 23 places in 171 ms
[2020-06-03 06:30:15] [INFO ] Deduced a trap composed of 43 places in 185 ms
[2020-06-03 06:30:15] [INFO ] Deduced a trap composed of 35 places in 171 ms
[2020-06-03 06:30:15] [INFO ] Deduced a trap composed of 34 places in 149 ms
[2020-06-03 06:30:15] [INFO ] Deduced a trap composed of 130 places in 176 ms
[2020-06-03 06:30:16] [INFO ] Deduced a trap composed of 26 places in 178 ms
[2020-06-03 06:30:16] [INFO ] Deduced a trap composed of 46 places in 177 ms
[2020-06-03 06:30:16] [INFO ] Deduced a trap composed of 30 places in 158 ms
[2020-06-03 06:30:16] [INFO ] Deduced a trap composed of 40 places in 179 ms
[2020-06-03 06:30:16] [INFO ] Deduced a trap composed of 146 places in 155 ms
[2020-06-03 06:30:17] [INFO ] Deduced a trap composed of 144 places in 180 ms
[2020-06-03 06:30:17] [INFO ] Deduced a trap composed of 30 places in 157 ms
[2020-06-03 06:30:17] [INFO ] Deduced a trap composed of 140 places in 146 ms
[2020-06-03 06:30:17] [INFO ] Deduced a trap composed of 142 places in 175 ms
[2020-06-03 06:30:17] [INFO ] Deduced a trap composed of 149 places in 207 ms
[2020-06-03 06:30:18] [INFO ] Deduced a trap composed of 49 places in 150 ms
[2020-06-03 06:30:18] [INFO ] Deduced a trap composed of 43 places in 200 ms
[2020-06-03 06:30:18] [INFO ] Deduced a trap composed of 28 places in 168 ms
[2020-06-03 06:30:18] [INFO ] Deduced a trap composed of 146 places in 148 ms
[2020-06-03 06:30:18] [INFO ] Deduced a trap composed of 27 places in 143 ms
[2020-06-03 06:30:18] [INFO ] Deduced a trap composed of 42 places in 142 ms
[2020-06-03 06:30:19] [INFO ] Deduced a trap composed of 143 places in 151 ms
[2020-06-03 06:30:19] [INFO ] Deduced a trap composed of 30 places in 151 ms
[2020-06-03 06:30:19] [INFO ] Deduced a trap composed of 156 places in 153 ms
[2020-06-03 06:30:19] [INFO ] Deduced a trap composed of 151 places in 140 ms
[2020-06-03 06:30:19] [INFO ] Deduced a trap composed of 151 places in 152 ms
[2020-06-03 06:30:20] [INFO ] Deduced a trap composed of 50 places in 197 ms
[2020-06-03 06:30:20] [INFO ] Deduced a trap composed of 144 places in 164 ms
[2020-06-03 06:30:20] [INFO ] Deduced a trap composed of 49 places in 144 ms
[2020-06-03 06:30:20] [INFO ] Deduced a trap composed of 29 places in 146 ms
[2020-06-03 06:30:20] [INFO ] Deduced a trap composed of 137 places in 145 ms
[2020-06-03 06:30:20] [INFO ] Deduced a trap composed of 42 places in 144 ms
[2020-06-03 06:30:21] [INFO ] Deduced a trap composed of 149 places in 169 ms
[2020-06-03 06:30:21] [INFO ] Deduced a trap composed of 36 places in 145 ms
[2020-06-03 06:30:21] [INFO ] Deduced a trap composed of 46 places in 167 ms
[2020-06-03 06:30:21] [INFO ] Deduced a trap composed of 51 places in 155 ms
[2020-06-03 06:30:21] [INFO ] Deduced a trap composed of 57 places in 146 ms
[2020-06-03 06:30:21] [INFO ] Deduced a trap composed of 152 places in 151 ms
[2020-06-03 06:30:22] [INFO ] Deduced a trap composed of 142 places in 157 ms
[2020-06-03 06:30:22] [INFO ] Deduced a trap composed of 134 places in 175 ms
[2020-06-03 06:30:22] [INFO ] Deduced a trap composed of 153 places in 140 ms
[2020-06-03 06:30:22] [INFO ] Deduced a trap composed of 138 places in 172 ms
[2020-06-03 06:30:22] [INFO ] Deduced a trap composed of 143 places in 135 ms
[2020-06-03 06:30:22] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 12888 ms
[2020-06-03 06:30:22] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 20 ms.
[2020-06-03 06:30:27] [INFO ] Added : 410 causal constraints over 82 iterations in 4162 ms. Result :sat
[2020-06-03 06:30:27] [INFO ] Deduced a trap composed of 150 places in 128 ms
[2020-06-03 06:30:27] [INFO ] Deduced a trap composed of 155 places in 141 ms
[2020-06-03 06:30:27] [INFO ] Deduced a trap composed of 152 places in 149 ms
[2020-06-03 06:30:27] [INFO ] Deduced a trap composed of 156 places in 155 ms
[2020-06-03 06:30:28] [INFO ] Deduced a trap composed of 151 places in 136 ms
[2020-06-03 06:30:28] [INFO ] Deduced a trap composed of 156 places in 142 ms
[2020-06-03 06:30:28] [INFO ] Deduced a trap composed of 145 places in 151 ms
[2020-06-03 06:30:28] [INFO ] Deduced a trap composed of 149 places in 162 ms
[2020-06-03 06:30:29] [INFO ] Deduced a trap composed of 137 places in 145 ms
[2020-06-03 06:30:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:30:29] [INFO ] Deduced a trap composed of 6 places in 249 ms
[2020-06-03 06:30:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s254) 0)") while checking expression at index 20
[2020-06-03 06:30:29] [INFO ] [Real]Absence check using 62 positive place invariants in 53 ms returned sat
[2020-06-03 06:30:29] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:30:30] [INFO ] [Real]Absence check using state equation in 752 ms returned sat
[2020-06-03 06:30:30] [INFO ] Deduced a trap composed of 8 places in 147 ms
[2020-06-03 06:30:30] [INFO ] Deduced a trap composed of 16 places in 136 ms
[2020-06-03 06:30:30] [INFO ] Deduced a trap composed of 121 places in 142 ms
[2020-06-03 06:30:30] [INFO ] Deduced a trap composed of 118 places in 161 ms
[2020-06-03 06:30:31] [INFO ] Deduced a trap composed of 19 places in 138 ms
[2020-06-03 06:30:31] [INFO ] Deduced a trap composed of 11 places in 143 ms
[2020-06-03 06:30:31] [INFO ] Deduced a trap composed of 16 places in 140 ms
[2020-06-03 06:30:31] [INFO ] Deduced a trap composed of 139 places in 133 ms
[2020-06-03 06:30:31] [INFO ] Deduced a trap composed of 120 places in 135 ms
[2020-06-03 06:30:31] [INFO ] Deduced a trap composed of 19 places in 133 ms
[2020-06-03 06:30:31] [INFO ] Deduced a trap composed of 23 places in 132 ms
[2020-06-03 06:30:32] [INFO ] Deduced a trap composed of 21 places in 130 ms
[2020-06-03 06:30:32] [INFO ] Deduced a trap composed of 20 places in 128 ms
[2020-06-03 06:30:32] [INFO ] Deduced a trap composed of 26 places in 128 ms
[2020-06-03 06:30:32] [INFO ] Deduced a trap composed of 11 places in 131 ms
[2020-06-03 06:30:32] [INFO ] Deduced a trap composed of 29 places in 126 ms
[2020-06-03 06:30:32] [INFO ] Deduced a trap composed of 18 places in 143 ms
[2020-06-03 06:30:32] [INFO ] Deduced a trap composed of 21 places in 123 ms
[2020-06-03 06:30:33] [INFO ] Deduced a trap composed of 129 places in 127 ms
[2020-06-03 06:30:33] [INFO ] Deduced a trap composed of 32 places in 125 ms
[2020-06-03 06:30:33] [INFO ] Deduced a trap composed of 31 places in 123 ms
[2020-06-03 06:30:33] [INFO ] Deduced a trap composed of 42 places in 131 ms
[2020-06-03 06:30:33] [INFO ] Deduced a trap composed of 45 places in 123 ms
[2020-06-03 06:30:33] [INFO ] Deduced a trap composed of 23 places in 124 ms
[2020-06-03 06:30:33] [INFO ] Deduced a trap composed of 35 places in 131 ms
[2020-06-03 06:30:34] [INFO ] Deduced a trap composed of 127 places in 121 ms
[2020-06-03 06:30:34] [INFO ] Deduced a trap composed of 143 places in 130 ms
[2020-06-03 06:30:34] [INFO ] Deduced a trap composed of 28 places in 123 ms
[2020-06-03 06:30:34] [INFO ] Deduced a trap composed of 115 places in 118 ms
[2020-06-03 06:30:34] [INFO ] Deduced a trap composed of 29 places in 119 ms
[2020-06-03 06:30:34] [INFO ] Deduced a trap composed of 38 places in 123 ms
[2020-06-03 06:30:35] [INFO ] Deduced a trap composed of 48 places in 136 ms
[2020-06-03 06:30:35] [INFO ] Deduced a trap composed of 27 places in 117 ms
[2020-06-03 06:30:35] [INFO ] Deduced a trap composed of 35 places in 125 ms
[2020-06-03 06:30:35] [INFO ] Deduced a trap composed of 124 places in 123 ms
[2020-06-03 06:30:35] [INFO ] Deduced a trap composed of 33 places in 123 ms
[2020-06-03 06:30:35] [INFO ] Deduced a trap composed of 24 places in 136 ms
[2020-06-03 06:30:35] [INFO ] Deduced a trap composed of 121 places in 119 ms
[2020-06-03 06:30:36] [INFO ] Deduced a trap composed of 37 places in 112 ms
[2020-06-03 06:30:36] [INFO ] Deduced a trap composed of 28 places in 121 ms
[2020-06-03 06:30:36] [INFO ] Deduced a trap composed of 25 places in 116 ms
[2020-06-03 06:30:36] [INFO ] Deduced a trap composed of 26 places in 123 ms
[2020-06-03 06:30:36] [INFO ] Deduced a trap composed of 24 places in 120 ms
[2020-06-03 06:30:36] [INFO ] Deduced a trap composed of 48 places in 85 ms
[2020-06-03 06:30:36] [INFO ] Deduced a trap composed of 59 places in 73 ms
[2020-06-03 06:30:36] [INFO ] Deduced a trap composed of 68 places in 69 ms
[2020-06-03 06:30:36] [INFO ] Deduced a trap composed of 51 places in 82 ms
[2020-06-03 06:30:37] [INFO ] Deduced a trap composed of 59 places in 71 ms
[2020-06-03 06:30:37] [INFO ] Deduced a trap composed of 50 places in 70 ms
[2020-06-03 06:30:37] [INFO ] Deduced a trap composed of 49 places in 79 ms
[2020-06-03 06:30:37] [INFO ] Deduced a trap composed of 22 places in 68 ms
[2020-06-03 06:30:37] [INFO ] Deduced a trap composed of 34 places in 73 ms
[2020-06-03 06:30:37] [INFO ] Deduced a trap composed of 21 places in 75 ms
[2020-06-03 06:30:37] [INFO ] Deduced a trap composed of 29 places in 79 ms
[2020-06-03 06:30:37] [INFO ] Deduced a trap composed of 34 places in 67 ms
[2020-06-03 06:30:37] [INFO ] Deduced a trap composed of 66 places in 79 ms
[2020-06-03 06:30:37] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 7708 ms
[2020-06-03 06:30:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:30:38] [INFO ] [Nat]Absence check using 62 positive place invariants in 82 ms returned sat
[2020-06-03 06:30:38] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:30:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:30:38] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2020-06-03 06:30:38] [INFO ] Deduced a trap composed of 8 places in 149 ms
[2020-06-03 06:30:39] [INFO ] Deduced a trap composed of 16 places in 169 ms
[2020-06-03 06:30:39] [INFO ] Deduced a trap composed of 11 places in 154 ms
[2020-06-03 06:30:39] [INFO ] Deduced a trap composed of 21 places in 182 ms
[2020-06-03 06:30:39] [INFO ] Deduced a trap composed of 20 places in 173 ms
[2020-06-03 06:30:39] [INFO ] Deduced a trap composed of 16 places in 159 ms
[2020-06-03 06:30:40] [INFO ] Deduced a trap composed of 28 places in 166 ms
[2020-06-03 06:30:40] [INFO ] Deduced a trap composed of 21 places in 168 ms
[2020-06-03 06:30:40] [INFO ] Deduced a trap composed of 143 places in 161 ms
[2020-06-03 06:30:40] [INFO ] Deduced a trap composed of 15 places in 204 ms
[2020-06-03 06:30:40] [INFO ] Deduced a trap composed of 22 places in 137 ms
[2020-06-03 06:30:41] [INFO ] Deduced a trap composed of 22 places in 146 ms
[2020-06-03 06:30:41] [INFO ] Deduced a trap composed of 21 places in 142 ms
[2020-06-03 06:30:41] [INFO ] Deduced a trap composed of 24 places in 126 ms
[2020-06-03 06:30:41] [INFO ] Deduced a trap composed of 34 places in 132 ms
[2020-06-03 06:30:41] [INFO ] Deduced a trap composed of 35 places in 135 ms
[2020-06-03 06:30:41] [INFO ] Deduced a trap composed of 129 places in 131 ms
[2020-06-03 06:30:41] [INFO ] Deduced a trap composed of 122 places in 130 ms
[2020-06-03 06:30:42] [INFO ] Deduced a trap composed of 120 places in 134 ms
[2020-06-03 06:30:42] [INFO ] Deduced a trap composed of 36 places in 142 ms
[2020-06-03 06:30:42] [INFO ] Deduced a trap composed of 142 places in 137 ms
[2020-06-03 06:30:42] [INFO ] Deduced a trap composed of 22 places in 130 ms
[2020-06-03 06:30:42] [INFO ] Deduced a trap composed of 36 places in 132 ms
[2020-06-03 06:30:42] [INFO ] Deduced a trap composed of 39 places in 131 ms
[2020-06-03 06:30:42] [INFO ] Deduced a trap composed of 49 places in 132 ms
[2020-06-03 06:30:43] [INFO ] Deduced a trap composed of 25 places in 135 ms
[2020-06-03 06:30:43] [INFO ] Deduced a trap composed of 37 places in 130 ms
[2020-06-03 06:30:43] [INFO ] Deduced a trap composed of 33 places in 84 ms
[2020-06-03 06:30:43] [INFO ] Deduced a trap composed of 55 places in 78 ms
[2020-06-03 06:30:43] [INFO ] Deduced a trap composed of 40 places in 69 ms
[2020-06-03 06:30:43] [INFO ] Deduced a trap composed of 41 places in 86 ms
[2020-06-03 06:30:43] [INFO ] Deduced a trap composed of 39 places in 73 ms
[2020-06-03 06:30:43] [INFO ] Deduced a trap composed of 42 places in 68 ms
[2020-06-03 06:30:43] [INFO ] Deduced a trap composed of 26 places in 77 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 31 places in 68 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 54 places in 67 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 35 places in 75 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 29 places in 74 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 42 places in 90 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 46 places in 87 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 52 places in 87 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 64 places in 82 ms
[2020-06-03 06:30:44] [INFO ] Deduced a trap composed of 37 places in 81 ms
[2020-06-03 06:30:45] [INFO ] Deduced a trap composed of 67 places in 88 ms
[2020-06-03 06:30:45] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 6197 ms
[2020-06-03 06:30:45] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 21 ms.
[2020-06-03 06:30:48] [INFO ] Added : 376 causal constraints over 76 iterations in 3359 ms. Result :sat
[2020-06-03 06:30:48] [INFO ] Deduced a trap composed of 47 places in 56 ms
[2020-06-03 06:30:48] [INFO ] Deduced a trap composed of 46 places in 57 ms
[2020-06-03 06:30:48] [INFO ] Deduced a trap composed of 43 places in 71 ms
[2020-06-03 06:30:48] [INFO ] Deduced a trap composed of 42 places in 59 ms
[2020-06-03 06:30:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 519 ms
[2020-06-03 06:30:48] [INFO ] [Real]Absence check using 62 positive place invariants in 34 ms returned sat
[2020-06-03 06:30:49] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-06-03 06:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:30:49] [INFO ] [Real]Absence check using state equation in 789 ms returned sat
[2020-06-03 06:30:49] [INFO ] Deduced a trap composed of 14 places in 148 ms
[2020-06-03 06:30:50] [INFO ] Deduced a trap composed of 23 places in 196 ms
[2020-06-03 06:30:50] [INFO ] Deduced a trap composed of 28 places in 155 ms
[2020-06-03 06:30:50] [INFO ] Deduced a trap composed of 11 places in 145 ms
[2020-06-03 06:30:50] [INFO ] Deduced a trap composed of 11 places in 143 ms
[2020-06-03 06:30:50] [INFO ] Deduced a trap composed of 129 places in 151 ms
[2020-06-03 06:30:50] [INFO ] Deduced a trap composed of 16 places in 104 ms
[2020-06-03 06:30:51] [INFO ] Deduced a trap composed of 28 places in 98 ms
[2020-06-03 06:30:51] [INFO ] Deduced a trap composed of 30 places in 139 ms
[2020-06-03 06:30:51] [INFO ] Deduced a trap composed of 25 places in 141 ms
[2020-06-03 06:30:51] [INFO ] Deduced a trap composed of 22 places in 137 ms
[2020-06-03 06:30:51] [INFO ] Deduced a trap composed of 19 places in 137 ms
[2020-06-03 06:30:51] [INFO ] Deduced a trap composed of 52 places in 133 ms
[2020-06-03 06:30:52] [INFO ] Deduced a trap composed of 21 places in 142 ms
[2020-06-03 06:30:52] [INFO ] Deduced a trap composed of 33 places in 140 ms
[2020-06-03 06:30:52] [INFO ] Deduced a trap composed of 29 places in 144 ms
[2020-06-03 06:30:52] [INFO ] Deduced a trap composed of 127 places in 144 ms
[2020-06-03 06:30:52] [INFO ] Deduced a trap composed of 26 places in 141 ms
[2020-06-03 06:30:52] [INFO ] Deduced a trap composed of 121 places in 132 ms
[2020-06-03 06:30:52] [INFO ] Deduced a trap composed of 121 places in 124 ms
[2020-06-03 06:30:53] [INFO ] Deduced a trap composed of 23 places in 135 ms
[2020-06-03 06:30:53] [INFO ] Deduced a trap composed of 20 places in 121 ms
[2020-06-03 06:30:53] [INFO ] Deduced a trap composed of 143 places in 122 ms
[2020-06-03 06:30:53] [INFO ] Deduced a trap composed of 18 places in 71 ms
[2020-06-03 06:30:53] [INFO ] Deduced a trap composed of 17 places in 52 ms
[2020-06-03 06:30:53] [INFO ] Deduced a trap composed of 28 places in 49 ms
[2020-06-03 06:30:53] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3867 ms
[2020-06-03 06:30:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:30:53] [INFO ] [Nat]Absence check using 62 positive place invariants in 65 ms returned sat
[2020-06-03 06:30:53] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 19 ms returned sat
[2020-06-03 06:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:30:54] [INFO ] [Nat]Absence check using state equation in 759 ms returned sat
[2020-06-03 06:30:54] [INFO ] Deduced a trap composed of 14 places in 221 ms
[2020-06-03 06:30:55] [INFO ] Deduced a trap composed of 28 places in 197 ms
[2020-06-03 06:30:55] [INFO ] Deduced a trap composed of 11 places in 163 ms
[2020-06-03 06:30:55] [INFO ] Deduced a trap composed of 18 places in 190 ms
[2020-06-03 06:30:55] [INFO ] Deduced a trap composed of 29 places in 161 ms
[2020-06-03 06:30:55] [INFO ] Deduced a trap composed of 26 places in 189 ms
[2020-06-03 06:30:56] [INFO ] Deduced a trap composed of 45 places in 154 ms
[2020-06-03 06:30:56] [INFO ] Deduced a trap composed of 44 places in 147 ms
[2020-06-03 06:30:56] [INFO ] Deduced a trap composed of 16 places in 133 ms
[2020-06-03 06:30:56] [INFO ] Deduced a trap composed of 25 places in 129 ms
[2020-06-03 06:30:56] [INFO ] Deduced a trap composed of 124 places in 146 ms
[2020-06-03 06:30:56] [INFO ] Deduced a trap composed of 17 places in 128 ms
[2020-06-03 06:30:56] [INFO ] Deduced a trap composed of 15 places in 125 ms
[2020-06-03 06:30:57] [INFO ] Deduced a trap composed of 21 places in 123 ms
[2020-06-03 06:30:57] [INFO ] Deduced a trap composed of 17 places in 123 ms
[2020-06-03 06:30:57] [INFO ] Deduced a trap composed of 20 places in 121 ms
[2020-06-03 06:30:57] [INFO ] Deduced a trap composed of 126 places in 122 ms
[2020-06-03 06:30:57] [INFO ] Deduced a trap composed of 22 places in 131 ms
[2020-06-03 06:30:57] [INFO ] Deduced a trap composed of 49 places in 145 ms
[2020-06-03 06:30:57] [INFO ] Deduced a trap composed of 129 places in 173 ms
[2020-06-03 06:30:58] [INFO ] Deduced a trap composed of 125 places in 148 ms
[2020-06-03 06:30:58] [INFO ] Deduced a trap composed of 46 places in 142 ms
[2020-06-03 06:30:58] [INFO ] Deduced a trap composed of 123 places in 124 ms
[2020-06-03 06:30:58] [INFO ] Deduced a trap composed of 137 places in 130 ms
[2020-06-03 06:30:58] [INFO ] Deduced a trap composed of 129 places in 130 ms
[2020-06-03 06:30:58] [INFO ] Deduced a trap composed of 124 places in 125 ms
[2020-06-03 06:30:59] [INFO ] Deduced a trap composed of 130 places in 138 ms
[2020-06-03 06:30:59] [INFO ] Deduced a trap composed of 122 places in 130 ms
[2020-06-03 06:30:59] [INFO ] Deduced a trap composed of 26 places in 166 ms
[2020-06-03 06:30:59] [INFO ] Deduced a trap composed of 148 places in 161 ms
[2020-06-03 06:30:59] [INFO ] Deduced a trap composed of 130 places in 126 ms
[2020-06-03 06:30:59] [INFO ] Deduced a trap composed of 27 places in 140 ms
[2020-06-03 06:31:00] [INFO ] Deduced a trap composed of 62 places in 143 ms
[2020-06-03 06:31:00] [INFO ] Deduced a trap composed of 60 places in 159 ms
[2020-06-03 06:31:00] [INFO ] Deduced a trap composed of 135 places in 144 ms
[2020-06-03 06:31:00] [INFO ] Deduced a trap composed of 129 places in 141 ms
[2020-06-03 06:31:00] [INFO ] Deduced a trap composed of 132 places in 120 ms
[2020-06-03 06:31:00] [INFO ] Deduced a trap composed of 42 places in 148 ms
[2020-06-03 06:31:01] [INFO ] Deduced a trap composed of 129 places in 159 ms
[2020-06-03 06:31:01] [INFO ] Deduced a trap composed of 127 places in 194 ms
[2020-06-03 06:31:01] [INFO ] Deduced a trap composed of 128 places in 163 ms
[2020-06-03 06:31:01] [INFO ] Deduced a trap composed of 139 places in 152 ms
[2020-06-03 06:31:01] [INFO ] Deduced a trap composed of 129 places in 143 ms
[2020-06-03 06:31:01] [INFO ] Deduced a trap composed of 30 places in 147 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 139 places in 171 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 150 places in 141 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 146 places in 140 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 127 places in 141 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 140 places in 148 ms
[2020-06-03 06:31:02] [INFO ] Deduced a trap composed of 131 places in 140 ms
[2020-06-03 06:31:03] [INFO ] Deduced a trap composed of 140 places in 141 ms
[2020-06-03 06:31:03] [INFO ] Deduced a trap composed of 132 places in 131 ms
[2020-06-03 06:31:03] [INFO ] Deduced a trap composed of 137 places in 146 ms
[2020-06-03 06:31:03] [INFO ] Deduced a trap composed of 134 places in 149 ms
[2020-06-03 06:31:03] [INFO ] Deduced a trap composed of 146 places in 145 ms
[2020-06-03 06:31:03] [INFO ] Deduced a trap composed of 21 places in 148 ms
[2020-06-03 06:31:04] [INFO ] Deduced a trap composed of 129 places in 143 ms
[2020-06-03 06:31:04] [INFO ] Deduced a trap composed of 146 places in 126 ms
[2020-06-03 06:31:04] [INFO ] Deduced a trap composed of 127 places in 129 ms
[2020-06-03 06:31:04] [INFO ] Deduced a trap composed of 147 places in 145 ms
[2020-06-03 06:31:04] [INFO ] Deduced a trap composed of 141 places in 134 ms
[2020-06-03 06:31:04] [INFO ] Deduced a trap composed of 45 places in 133 ms
[2020-06-03 06:31:05] [INFO ] Deduced a trap composed of 131 places in 137 ms
[2020-06-03 06:31:05] [INFO ] Deduced a trap composed of 138 places in 130 ms
[2020-06-03 06:31:05] [INFO ] Deduced a trap composed of 131 places in 143 ms
[2020-06-03 06:31:05] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 10823 ms
[2020-06-03 06:31:05] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 21 ms.
[2020-06-03 06:31:09] [INFO ] Added : 429 causal constraints over 86 iterations in 4463 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
[2020-06-03 06:31:10] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 06:31:10] [INFO ] Flatten gal took : 139 ms
FORMULA BusinessProcesses-PT-17-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 06:31:10] [INFO ] Applying decomposition
[2020-06-03 06:31:10] [INFO ] Flatten gal took : 49 ms
[2020-06-03 06:31:10] [INFO ] Decomposing Gal with order
[2020-06-03 06:31:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 06:31:10] [INFO ] Removed a total of 117 redundant transitions.
[2020-06-03 06:31:10] [INFO ] Flatten gal took : 140 ms
[2020-06-03 06:31:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 210 ms.
[2020-06-03 06:31:11] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 30 ms.
[2020-06-03 06:31:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ BusinessProcesses-PT-17 @ 3570 seconds

FORMULA BusinessProcesses-PT-17-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3563
rslt: Output for LTLFireability @ BusinessProcesses-PT-17

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 06:31:11 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((G (((p408 <= 0))) OR X (X (((1 <= p181))))))",
"processed_size": 48,
"rewrites": 51
},
"result":
{
"edges": 288,
"markings": 288,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p33))))",
"processed_size": 20,
"rewrites": 51
},
"result":
{
"edges": 288,
"markings": 288,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 2,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((X (G (((1 <= p399)))) AND ((((p73 <= 1) AND (1 <= p73)) R ((2 <= p521) OR (p521 <= 0))) OR ((p399 <= 0)))) U ((1 <= p110) AND (1 <= p534)))",
"processed_size": 142,
"rewrites": 51
},
"result":
{
"edges": 288,
"markings": 288,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p295)) U (X (G (((p88 <= 0)))) OR F ((X (((1 <= p489))) AND ((1 <= p295))))))",
"processed_size": 85,
"rewrites": 51
},
"result":
{
"edges": 394,
"markings": 382,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((X (F (((1 <= p594)))) AND G (((p329 <= 0)))) U G (((1 <= p594)))))",
"processed_size": 71,
"rewrites": 51
},
"result":
{
"edges": 165,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p526))))",
"processed_size": 21,
"rewrites": 51
},
"result":
{
"edges": 288,
"markings": 288,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F (((2 <= p491) OR (p491 <= 0))))",
"processed_size": 37,
"rewrites": 51
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (G ((F (G (((1 <= p541)))) AND ((1 <= p23))))))",
"processed_size": 52,
"rewrites": 51
},
"result":
{
"edges": 288,
"markings": 288,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p394))",
"processed_size": 13,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 4,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X ((X (X (F (((1 <= p31))))) AND G (((1 <= p506))))))",
"processed_size": 56,
"rewrites": 51
},
"result":
{
"edges": 288,
"markings": 288,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p244 <= 0))",
"processed_size": 13,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (F ((((1 <= p388)) OR ((1 <= p86) AND (1 <= p351) AND (1 <= p607))))))",
"processed_size": 76,
"rewrites": 51
},
"result":
{
"edges": 724,
"markings": 577,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p139))))",
"processed_size": 21,
"rewrites": 51
},
"result":
{
"edges": 141,
"markings": 141,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p631 <= 0) OR (p634 <= 0)))",
"processed_size": 33,
"rewrites": 51
},
"result":
{
"edges": 618,
"markings": 535,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((((p46 <= 0) OR (p303 <= 0) OR (p490 <= 0)) OR F ((G (((1 <= p46) AND (1 <= p303) AND (1 <= p490))) OR F (((1 <= p12))))))))",
"processed_size": 132,
"rewrites": 51
},
"result":
{
"edges": 3526,
"markings": 2854,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p101))) AND (((1 <= p237)) OR ((1 <= p232) AND (1 <= p427) AND (1 <= p589))))))",
"processed_size": 97,
"rewrites": 51
},
"result":
{
"edges": 140,
"markings": 140,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 37720,
"runtime": 7.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((G(*) OR X(X(*)))) : (X(G(**)) AND (X(G(**)) U **)) : F(G((** OR F((G(**) OR F(**)))))) : ((X(G(**)) AND ((* R *) OR **)) U **) : G(F((G(**) AND **))) : (** U (X(G(*)) OR F((X(**) AND **)))) : X(((X(F(**)) AND G(*)) U G(**))) : G(*) : X(G(**)) : X(F(*)) : X(X(G((F(G(**)) AND **)))) : G(F(**)) : (F(**) AND X(X((X(X(F(**))) AND G(**))))) : (X(X(F(**))) AND **)"
},
"net":
{
"arcs": 1701,
"conflict_clusters": 487,
"places": 646,
"places_significant": 538,
"singleton_clusters": 0,
"transitions": 576
},
"result":
{
"preliminary_value": "no no no no no no no no no yes no no no no ",
"value": "no no no no no no no no no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1222/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 646
lola: finding significant places
lola: 646 places, 576 transitions, 538 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p408 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p531 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p303 <= 1)
lola: LP says that atomic proposition is always true: (p490 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p303 <= 1)
lola: LP says that atomic proposition is always true: (p490 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p399 <= 1)
lola: LP says that atomic proposition is always true: (p399 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p534 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p426 <= 1)
lola: LP says that atomic proposition is always true: (p607 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p427 <= 1)
lola: LP says that atomic proposition is always true: (p589 <= 1)
lola: LP says that atomic proposition is always true: (p295 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p489 <= 1)
lola: LP says that atomic proposition is always true: (p295 <= 1)
lola: LP says that atomic proposition is always true: (p594 <= 1)
lola: LP says that atomic proposition is always true: (p594 <= 1)
lola: LP says that atomic proposition is always true: (p329 <= 1)
lola: LP says that atomic proposition is always true: (p594 <= 1)
lola: LP says that atomic proposition is always true: (p631 <= 1)
lola: LP says that atomic proposition is always true: (p634 <= 1)
lola: LP says that atomic proposition is always true: (p526 <= 1)
lola: LP says that atomic proposition is always true: (p541 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p394 <= 1)
lola: LP says that atomic proposition is always true: (p440 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p388 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p351 <= 1)
lola: LP says that atomic proposition is always true: (p607 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: G ((NOT(F (((1 <= p408)))) OR NOT(X (X (((p181 <= 0))))))) : (X (G (((1 <= p33)))) AND (X (G (((1 <= p531)))) U ((1 <= p45)))) : F (G ((X (((p46 <= 0) OR (p303 <= 0) OR (p490 <= 0))) OR X (F ((G (((1 <= p46) AND (1 <= p303) AND (1 <= p490))) OR (((1 <= p252)) U F (((1 <= p12)))))))))) : ((G (X (((1 <= 0) U ((1 <= p399))))) AND (NOT((((2 <= p73) OR (p73 <= 0)) U ((p521 <= 1) AND (1 <= p521)))) OR ((p399 <= 0)))) U ((1 <= p110) AND (1 <= p534))) : (((p49 <= 0) OR (p426 <= 0) OR (p607 <= 0)) U F (X (G (F ((G (((1 <= p101))) AND (((1 <= p237)) OR ((1 <= p232) AND (1 <= p427) AND (1 <= p589))))))))) : (((1 <= p295)) U (NOT(X ((((1 <= p88)) U F (((1 <= p88)))))) OR F ((X (((1 <= p489))) AND ((1 <= p295)))))) : X (((X (F (((1 <= p594)))) AND G (NOT((((p594 <= 0)) U F (((1 <= p329))))))) U G (((1 <= p594))))) : NOT(F (((1 <= p631) AND (1 <= p634)))) : X (G (((1 <= p526)))) : NOT(G (X (((p491 <= 1) AND (1 <= p491))))) : G (X (G (X ((F (G (((1 <= p541)))) AND ((1 <= p23))))))) : F (NOT(F (G (NOT(F (((1 <= p139)))))))) : (F (((p394 <= 0))) AND X (X ((F (X ((((1 <= p440)) U X (((1 <= p31)))))) AND G (((1 <= p506))))))) : (F (X (F (X ((((1 <= p388)) OR ((1 <= p86) AND (1 <= p351) AND (1 <= p607))))))) AND ((p244 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((p408 <= 0))) OR X (X (((1 <= p181))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p408 <= 0))) OR X (X (((1 <= p181))))))
lola: processed formula length: 48
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 288 markings, 288 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p33)))) AND (X (G (((1 <= p531)))) U ((1 <= p45))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p33))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p33))))
lola: processed formula length: 20
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 288 markings, 288 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (G (((1 <= p399)))) AND ((((p73 <= 1) AND (1 <= p73)) R ((2 <= p521) OR (p521 <= 0))) OR ((p399 <= 0)))) U ((1 <= p110) AND (1 <= p534)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (G (((1 <= p399)))) AND ((((p73 <= 1) AND (1 <= p73)) R ((2 <= p521) OR (p521 <= 0))) OR ((p399 <= 0)))) U ((1 <= p110) AND (1 <= p534)))
lola: processed formula length: 142
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 288 markings, 288 edges
lola: ========================================
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p295)) U (X (G (((p88 <= 0)))) OR F ((X (((1 <= p489))) AND ((1 <= p295))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p295)) U (X (G (((p88 <= 0)))) OR F ((X (((1 <= p489))) AND ((1 <= p295))))))
lola: processed formula length: 85
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 382 markings, 394 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (F (((1 <= p594)))) AND G (((p329 <= 0)))) U G (((1 <= p594)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (F (((1 <= p594)))) AND G (((p329 <= 0)))) U G (((1 <= p594)))))
lola: processed formula length: 71
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 165 markings, 165 edges
lola: ========================================
lola: subprocess 5 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p526))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p526))))
lola: processed formula length: 21
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 288 markings, 288 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((2 <= p491) OR (p491 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((2 <= p491) OR (p491 <= 0))))
lola: processed formula length: 37
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F (G (((1 <= p541)))) AND ((1 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F (G (((1 <= p541)))) AND ((1 <= p23))))))
lola: processed formula length: 52
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 288 markings, 288 edges
lola: ========================================
lola: subprocess 8 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p394 <= 0))) AND X (X ((X (X (F (((1 <= p31))))) AND G (((1 <= p506)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p394 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p394))
lola: processed formula length: 13
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (X (F (((1 <= p31))))) AND G (((1 <= p506))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (X (F (((1 <= p31))))) AND G (((1 <= p506))))))
lola: processed formula length: 56
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 288 markings, 288 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((((1 <= p388)) OR ((1 <= p86) AND (1 <= p351) AND (1 <= p607)))))) AND ((p244 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p244 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p244 <= 0))
lola: processed formula length: 13
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((1 <= p388)) OR ((1 <= p86) AND (1 <= p351) AND (1 <= p607))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((1 <= p388)) OR ((1 <= p86) AND (1 <= p351) AND (1 <= p607))))))
lola: processed formula length: 76
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 577 markings, 724 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p139))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p139))))
lola: processed formula length: 21
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 141 markings, 141 edges
lola: ========================================
lola: subprocess 11 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p631 <= 0) OR (p634 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p631 <= 0) OR (p634 <= 0)))
lola: processed formula length: 33
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 535 markings, 618 edges
lola: ========================================
lola: subprocess 12 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p46 <= 0) OR (p303 <= 0) OR (p490 <= 0)) OR F ((G (((1 <= p46) AND (1 <= p303) AND (1 <= p490))) OR F (((1 <= p12))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p46 <= 0) OR (p303 <= 0) OR (p490 <= 0)) OR F ((G (((1 <= p46) AND (1 <= p303) AND (1 <= p490))) OR F (((1 <= p12))))))))
lola: processed formula length: 132
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2854 markings, 3526 edges
lola: ========================================
lola: subprocess 13 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p101))) AND (((1 <= p237)) OR ((1 <= p232) AND (1 <= p427) AND (1 <= p589))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p101))) AND (((1 <= p237)) OR ((1 <= p232) AND (1 <= p427) AND (1 <= p589))))))
lola: processed formula length: 97
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 140 markings, 140 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no yes no no no no
lola:
preliminary result: no no no no no no no no no yes no no no no
lola: memory consumption: 37720 KB
lola: time consumption: 7 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

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

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="BusinessProcesses-PT-17"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is BusinessProcesses-PT-17, 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 r182-oct2-158987914100578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-17.tgz
mv BusinessProcesses-PT-17 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 ;