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.r021-oct2-158897699200538.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 itstools
Input is BusinessProcesses-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200538
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.5K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 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 2.3K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 146K 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-12-00
FORMULA_NAME BusinessProcesses-PT-12-01
FORMULA_NAME BusinessProcesses-PT-12-02
FORMULA_NAME BusinessProcesses-PT-12-03
FORMULA_NAME BusinessProcesses-PT-12-04
FORMULA_NAME BusinessProcesses-PT-12-05
FORMULA_NAME BusinessProcesses-PT-12-06
FORMULA_NAME BusinessProcesses-PT-12-07
FORMULA_NAME BusinessProcesses-PT-12-08
FORMULA_NAME BusinessProcesses-PT-12-09
FORMULA_NAME BusinessProcesses-PT-12-10
FORMULA_NAME BusinessProcesses-PT-12-11
FORMULA_NAME BusinessProcesses-PT-12-12
FORMULA_NAME BusinessProcesses-PT-12-13
FORMULA_NAME BusinessProcesses-PT-12-14
FORMULA_NAME BusinessProcesses-PT-12-15

=== Now, execution of the tool begins

BK_START 1589253318597

[2020-05-12 03:15:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 03:15:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:15:21] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2020-05-12 03:15:21] [INFO ] Transformed 586 places.
[2020-05-12 03:15:21] [INFO ] Transformed 525 transitions.
[2020-05-12 03:15:21] [INFO ] Found NUPN structural information;
[2020-05-12 03:15:21] [INFO ] Parsed PT model containing 586 places and 525 transitions in 113 ms.
Deduced a syphon composed of 4 places in 18 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 720 resets, run finished after 348 ms. (steps per millisecond=287 ) properties seen :[1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0]
// Phase 1: matrix 521 rows 582 cols
[2020-05-12 03:15:22] [INFO ] Computed 98 place invariants in 30 ms
[2020-05-12 03:15:22] [INFO ] [Real]Absence check using 55 positive place invariants in 44 ms returned sat
[2020-05-12 03:15:22] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 27 ms returned sat
[2020-05-12 03:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:15:23] [INFO ] [Real]Absence check using state equation in 885 ms returned sat
[2020-05-12 03:15:24] [INFO ] Deduced a trap composed of 20 places in 683 ms
[2020-05-12 03:15:24] [INFO ] Deduced a trap composed of 129 places in 414 ms
[2020-05-12 03:15:25] [INFO ] Deduced a trap composed of 122 places in 335 ms
[2020-05-12 03:15:25] [INFO ] Deduced a trap composed of 15 places in 228 ms
[2020-05-12 03:15:25] [INFO ] Deduced a trap composed of 22 places in 224 ms
[2020-05-12 03:15:26] [INFO ] Deduced a trap composed of 114 places in 1076 ms
[2020-05-12 03:15:27] [INFO ] Deduced a trap composed of 20 places in 969 ms
[2020-05-12 03:15:28] [INFO ] Deduced a trap composed of 23 places in 233 ms
[2020-05-12 03:15:28] [INFO ] Deduced a trap composed of 47 places in 169 ms
[2020-05-12 03:15:28] [INFO ] Deduced a trap composed of 16 places in 568 ms
[2020-05-12 03:15:29] [INFO ] Deduced a trap composed of 46 places in 316 ms
[2020-05-12 03:15:29] [INFO ] Deduced a trap composed of 25 places in 437 ms
[2020-05-12 03:15:30] [INFO ] Deduced a trap composed of 32 places in 302 ms
[2020-05-12 03:15:30] [INFO ] Deduced a trap composed of 22 places in 167 ms
[2020-05-12 03:15:31] [INFO ] Deduced a trap composed of 123 places in 678 ms
[2020-05-12 03:15:31] [INFO ] Deduced a trap composed of 123 places in 200 ms
[2020-05-12 03:15:31] [INFO ] Deduced a trap composed of 22 places in 540 ms
[2020-05-12 03:15:31] [INFO ] Deduced a trap composed of 35 places in 153 ms
[2020-05-12 03:15:33] [INFO ] Deduced a trap composed of 119 places in 959 ms
[2020-05-12 03:15:33] [INFO ] Deduced a trap composed of 20 places in 843 ms
[2020-05-12 03:15:34] [INFO ] Deduced a trap composed of 123 places in 217 ms
[2020-05-12 03:15:34] [INFO ] Deduced a trap composed of 25 places in 137 ms
[2020-05-12 03:15:34] [INFO ] Deduced a trap composed of 125 places in 162 ms
[2020-05-12 03:15:34] [INFO ] Deduced a trap composed of 26 places in 442 ms
[2020-05-12 03:15:35] [INFO ] Deduced a trap composed of 40 places in 149 ms
[2020-05-12 03:15:35] [INFO ] Deduced a trap composed of 126 places in 132 ms
[2020-05-12 03:15:35] [INFO ] Deduced a trap composed of 134 places in 122 ms
[2020-05-12 03:15:35] [INFO ] Deduced a trap composed of 124 places in 132 ms
[2020-05-12 03:15:35] [INFO ] Deduced a trap composed of 28 places in 142 ms
[2020-05-12 03:15:36] [INFO ] Deduced a trap composed of 125 places in 221 ms
[2020-05-12 03:15:36] [INFO ] Deduced a trap composed of 43 places in 160 ms
[2020-05-12 03:15:36] [INFO ] Deduced a trap composed of 30 places in 123 ms
[2020-05-12 03:15:36] [INFO ] Deduced a trap composed of 46 places in 123 ms
[2020-05-12 03:15:36] [INFO ] Deduced a trap composed of 122 places in 149 ms
[2020-05-12 03:15:36] [INFO ] Deduced a trap composed of 121 places in 143 ms
[2020-05-12 03:15:37] [INFO ] Deduced a trap composed of 123 places in 149 ms
[2020-05-12 03:15:37] [INFO ] Deduced a trap composed of 44 places in 322 ms
[2020-05-12 03:15:37] [INFO ] Deduced a trap composed of 125 places in 196 ms
[2020-05-12 03:15:37] [INFO ] Deduced a trap composed of 135 places in 259 ms
[2020-05-12 03:15:38] [INFO ] Deduced a trap composed of 117 places in 403 ms
[2020-05-12 03:15:38] [INFO ] Deduced a trap composed of 32 places in 133 ms
[2020-05-12 03:15:38] [INFO ] Deduced a trap composed of 32 places in 256 ms
[2020-05-12 03:15:39] [INFO ] Deduced a trap composed of 129 places in 288 ms
[2020-05-12 03:15:39] [INFO ] Deduced a trap composed of 140 places in 436 ms
[2020-05-12 03:15:39] [INFO ] Deduced a trap composed of 36 places in 147 ms
[2020-05-12 03:15:40] [INFO ] Deduced a trap composed of 27 places in 196 ms
[2020-05-12 03:15:40] [INFO ] Deduced a trap composed of 30 places in 193 ms
[2020-05-12 03:15:40] [INFO ] Deduced a trap composed of 122 places in 175 ms
[2020-05-12 03:15:40] [INFO ] Deduced a trap composed of 125 places in 214 ms
[2020-05-12 03:15:40] [INFO ] Deduced a trap composed of 26 places in 130 ms
[2020-05-12 03:15:41] [INFO ] Deduced a trap composed of 125 places in 243 ms
[2020-05-12 03:15:41] [INFO ] Deduced a trap composed of 31 places in 116 ms
[2020-05-12 03:15:41] [INFO ] Deduced a trap composed of 46 places in 130 ms
[2020-05-12 03:15:41] [INFO ] Deduced a trap composed of 34 places in 219 ms
[2020-05-12 03:15:41] [INFO ] Deduced a trap composed of 147 places in 243 ms
[2020-05-12 03:15:42] [INFO ] Deduced a trap composed of 126 places in 497 ms
[2020-05-12 03:15:42] [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 s27 s28 s31 s32 s71 s73 s77 s80 s83 s96 s102 s114 s120 s121 s122 s126 s127 s128 s134 s135 s139 s140 s141 s145 s151 s152 s154 s155 s159 s160 s161 s165 s166 s167 s176 s177 s185 s228 s229 s230 s236 s239 s269 s271 s275 s279 s293 s295 s299 s304 s308 s309 s310 s314 s319 s329 s339 s349 s369 s379 s384 s389 s394 s404 s409 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s430 s431 s437 s438 s439 s440 s441 s442 s445 s446 s447 s448 s449 s450 s451 s452 s458 s469 s470 s471 s482 s483 s490 s491 s504 s505 s506 s507 s508 s513 s514 s517 s518 s525 s526 s529 s530 s533 s534 s535 s536 s543 s560 s580 s581) 0)") while checking expression at index 0
[2020-05-12 03:15:42] [INFO ] [Real]Absence check using 55 positive place invariants in 238 ms returned sat
[2020-05-12 03:15:42] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 33 ms returned sat
[2020-05-12 03:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:15:43] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2020-05-12 03:15:43] [INFO ] Deduced a trap composed of 13 places in 254 ms
[2020-05-12 03:15:43] [INFO ] Deduced a trap composed of 16 places in 199 ms
[2020-05-12 03:15:44] [INFO ] Deduced a trap composed of 13 places in 150 ms
[2020-05-12 03:15:44] [INFO ] Deduced a trap composed of 12 places in 154 ms
[2020-05-12 03:15:44] [INFO ] Deduced a trap composed of 11 places in 181 ms
[2020-05-12 03:15:44] [INFO ] Deduced a trap composed of 17 places in 169 ms
[2020-05-12 03:15:44] [INFO ] Deduced a trap composed of 19 places in 207 ms
[2020-05-12 03:15:45] [INFO ] Deduced a trap composed of 11 places in 367 ms
[2020-05-12 03:15:45] [INFO ] Deduced a trap composed of 22 places in 326 ms
[2020-05-12 03:15:46] [INFO ] Deduced a trap composed of 20 places in 304 ms
[2020-05-12 03:15:46] [INFO ] Deduced a trap composed of 112 places in 318 ms
[2020-05-12 03:15:46] [INFO ] Deduced a trap composed of 119 places in 298 ms
[2020-05-12 03:15:47] [INFO ] Deduced a trap composed of 19 places in 314 ms
[2020-05-12 03:15:47] [INFO ] Deduced a trap composed of 114 places in 220 ms
[2020-05-12 03:15:47] [INFO ] Deduced a trap composed of 26 places in 230 ms
[2020-05-12 03:15:47] [INFO ] Deduced a trap composed of 126 places in 164 ms
[2020-05-12 03:15:47] [INFO ] Deduced a trap composed of 36 places in 175 ms
[2020-05-12 03:15:48] [INFO ] Deduced a trap composed of 26 places in 161 ms
[2020-05-12 03:15:48] [INFO ] Deduced a trap composed of 27 places in 172 ms
[2020-05-12 03:15:48] [INFO ] Deduced a trap composed of 38 places in 215 ms
[2020-05-12 03:15:49] [INFO ] Deduced a trap composed of 44 places in 528 ms
[2020-05-12 03:15:49] [INFO ] Deduced a trap composed of 31 places in 501 ms
[2020-05-12 03:15:50] [INFO ] Deduced a trap composed of 120 places in 456 ms
[2020-05-12 03:15:50] [INFO ] Deduced a trap composed of 119 places in 213 ms
[2020-05-12 03:15:50] [INFO ] Deduced a trap composed of 40 places in 282 ms
[2020-05-12 03:15:51] [INFO ] Deduced a trap composed of 38 places in 343 ms
[2020-05-12 03:15:51] [INFO ] Deduced a trap composed of 24 places in 236 ms
[2020-05-12 03:15:51] [INFO ] Deduced a trap composed of 48 places in 162 ms
[2020-05-12 03:15:51] [INFO ] Deduced a trap composed of 130 places in 286 ms
[2020-05-12 03:15:52] [INFO ] Deduced a trap composed of 24 places in 270 ms
[2020-05-12 03:15:52] [INFO ] Deduced a trap composed of 35 places in 732 ms
[2020-05-12 03:15:53] [INFO ] Deduced a trap composed of 145 places in 173 ms
[2020-05-12 03:15:53] [INFO ] Deduced a trap composed of 138 places in 291 ms
[2020-05-12 03:15:53] [INFO ] Deduced a trap composed of 128 places in 290 ms
[2020-05-12 03:15:54] [INFO ] Deduced a trap composed of 130 places in 306 ms
[2020-05-12 03:15:54] [INFO ] Deduced a trap composed of 139 places in 450 ms
[2020-05-12 03:15:54] [INFO ] Deduced a trap composed of 140 places in 408 ms
[2020-05-12 03:15:55] [INFO ] Deduced a trap composed of 130 places in 127 ms
[2020-05-12 03:15:55] [INFO ] Deduced a trap composed of 139 places in 187 ms
[2020-05-12 03:15:55] [INFO ] Deduced a trap composed of 125 places in 284 ms
[2020-05-12 03:15:55] [INFO ] Deduced a trap composed of 133 places in 274 ms
[2020-05-12 03:15:56] [INFO ] Deduced a trap composed of 133 places in 215 ms
[2020-05-12 03:15:56] [INFO ] Deduced a trap composed of 128 places in 179 ms
[2020-05-12 03:15:56] [INFO ] Deduced a trap composed of 142 places in 181 ms
[2020-05-12 03:15:56] [INFO ] Deduced a trap composed of 131 places in 154 ms
[2020-05-12 03:15:56] [INFO ] Deduced a trap composed of 132 places in 158 ms
[2020-05-12 03:15:57] [INFO ] Deduced a trap composed of 127 places in 150 ms
[2020-05-12 03:15:57] [INFO ] Deduced a trap composed of 141 places in 203 ms
[2020-05-12 03:15:57] [INFO ] Deduced a trap composed of 142 places in 155 ms
[2020-05-12 03:15:58] [INFO ] Deduced a trap composed of 125 places in 425 ms
[2020-05-12 03:15:58] [INFO ] Deduced a trap composed of 124 places in 342 ms
[2020-05-12 03:15:58] [INFO ] Deduced a trap composed of 130 places in 282 ms
[2020-05-12 03:15:59] [INFO ] Deduced a trap composed of 127 places in 366 ms
[2020-05-12 03:15:59] [INFO ] Deduced a trap composed of 121 places in 337 ms
[2020-05-12 03:15:59] [INFO ] Deduced a trap composed of 128 places in 256 ms
[2020-05-12 03:16:00] [INFO ] Deduced a trap composed of 127 places in 264 ms
[2020-05-12 03:16:00] [INFO ] Deduced a trap composed of 131 places in 286 ms
[2020-05-12 03:16:00] [INFO ] Deduced a trap composed of 123 places in 301 ms
[2020-05-12 03:16:01] [INFO ] Deduced a trap composed of 145 places in 302 ms
[2020-05-12 03:16:01] [INFO ] Deduced a trap composed of 154 places in 335 ms
[2020-05-12 03:16:01] [INFO ] Deduced a trap composed of 129 places in 294 ms
[2020-05-12 03:16:02] [INFO ] Deduced a trap composed of 135 places in 278 ms
[2020-05-12 03:16:02] [INFO ] Deduced a trap composed of 138 places in 342 ms
[2020-05-12 03:16:02] [INFO ] Deduced a trap composed of 6 places in 237 ms
[2020-05-12 03:16: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 s3 s4 s231) 0)") while checking expression at index 1
[2020-05-12 03:16:02] [INFO ] [Real]Absence check using 55 positive place invariants in 56 ms returned sat
[2020-05-12 03:16:02] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:03] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2020-05-12 03:16:03] [INFO ] Deduced a trap composed of 11 places in 332 ms
[2020-05-12 03:16:04] [INFO ] Deduced a trap composed of 16 places in 635 ms
[2020-05-12 03:16:04] [INFO ] Deduced a trap composed of 124 places in 143 ms
[2020-05-12 03:16:05] [INFO ] Deduced a trap composed of 18 places in 378 ms
[2020-05-12 03:16:05] [INFO ] Deduced a trap composed of 25 places in 162 ms
[2020-05-12 03:16:05] [INFO ] Deduced a trap composed of 36 places in 293 ms
[2020-05-12 03:16:06] [INFO ] Deduced a trap composed of 28 places in 298 ms
[2020-05-12 03:16:06] [INFO ] Deduced a trap composed of 45 places in 445 ms
[2020-05-12 03:16:06] [INFO ] Deduced a trap composed of 40 places in 289 ms
[2020-05-12 03:16:07] [INFO ] Deduced a trap composed of 109 places in 292 ms
[2020-05-12 03:16:07] [INFO ] Deduced a trap composed of 20 places in 169 ms
[2020-05-12 03:16:07] [INFO ] Deduced a trap composed of 26 places in 322 ms
[2020-05-12 03:16:08] [INFO ] Deduced a trap composed of 134 places in 463 ms
[2020-05-12 03:16:08] [INFO ] Deduced a trap composed of 114 places in 173 ms
[2020-05-12 03:16:08] [INFO ] Deduced a trap composed of 22 places in 216 ms
[2020-05-12 03:16:08] [INFO ] Deduced a trap composed of 28 places in 292 ms
[2020-05-12 03:16:09] [INFO ] Deduced a trap composed of 26 places in 172 ms
[2020-05-12 03:16:09] [INFO ] Deduced a trap composed of 122 places in 184 ms
[2020-05-12 03:16:09] [INFO ] Deduced a trap composed of 17 places in 256 ms
[2020-05-12 03:16:10] [INFO ] Deduced a trap composed of 20 places in 354 ms
[2020-05-12 03:16:10] [INFO ] Deduced a trap composed of 29 places in 274 ms
[2020-05-12 03:16:10] [INFO ] Deduced a trap composed of 114 places in 149 ms
[2020-05-12 03:16:10] [INFO ] Deduced a trap composed of 28 places in 167 ms
[2020-05-12 03:16:10] [INFO ] Deduced a trap composed of 27 places in 143 ms
[2020-05-12 03:16:11] [INFO ] Deduced a trap composed of 110 places in 170 ms
[2020-05-12 03:16:11] [INFO ] Deduced a trap composed of 31 places in 172 ms
[2020-05-12 03:16:11] [INFO ] Deduced a trap composed of 32 places in 149 ms
[2020-05-12 03:16:11] [INFO ] Deduced a trap composed of 26 places in 143 ms
[2020-05-12 03:16:11] [INFO ] Deduced a trap composed of 21 places in 139 ms
[2020-05-12 03:16:11] [INFO ] Deduced a trap composed of 114 places in 155 ms
[2020-05-12 03:16:12] [INFO ] Deduced a trap composed of 20 places in 139 ms
[2020-05-12 03:16:12] [INFO ] Deduced a trap composed of 37 places in 133 ms
[2020-05-12 03:16:12] [INFO ] Deduced a trap composed of 127 places in 150 ms
[2020-05-12 03:16:12] [INFO ] Deduced a trap composed of 117 places in 158 ms
[2020-05-12 03:16:12] [INFO ] Deduced a trap composed of 114 places in 173 ms
[2020-05-12 03:16:12] [INFO ] Deduced a trap composed of 27 places in 164 ms
[2020-05-12 03:16:13] [INFO ] Deduced a trap composed of 106 places in 152 ms
[2020-05-12 03:16:13] [INFO ] Deduced a trap composed of 102 places in 130 ms
[2020-05-12 03:16:13] [INFO ] Deduced a trap composed of 107 places in 134 ms
[2020-05-12 03:16:13] [INFO ] Deduced a trap composed of 107 places in 279 ms
[2020-05-12 03:16:14] [INFO ] Deduced a trap composed of 21 places in 559 ms
[2020-05-12 03:16:16] [INFO ] Deduced a trap composed of 110 places in 2107 ms
[2020-05-12 03:16:16] [INFO ] Deduced a trap composed of 28 places in 363 ms
[2020-05-12 03:16:17] [INFO ] Deduced a trap composed of 15 places in 158 ms
[2020-05-12 03:16:17] [INFO ] Deduced a trap composed of 111 places in 149 ms
[2020-05-12 03:16:17] [INFO ] Deduced a trap composed of 115 places in 198 ms
[2020-05-12 03:16:17] [INFO ] Deduced a trap composed of 33 places in 368 ms
[2020-05-12 03:16:18] [INFO ] Deduced a trap composed of 26 places in 182 ms
[2020-05-12 03:16:18] [INFO ] Deduced a trap composed of 31 places in 282 ms
[2020-05-12 03:16:18] [INFO ] Deduced a trap composed of 22 places in 302 ms
[2020-05-12 03:16:18] [INFO ] Deduced a trap composed of 33 places in 171 ms
[2020-05-12 03:16:19] [INFO ] Deduced a trap composed of 26 places in 369 ms
[2020-05-12 03:16:19] [INFO ] Deduced a trap composed of 123 places in 256 ms
[2020-05-12 03:16:19] [INFO ] Deduced a trap composed of 25 places in 389 ms
[2020-05-12 03:16:20] [INFO ] Deduced a trap composed of 129 places in 218 ms
[2020-05-12 03:16:20] [INFO ] Deduced a trap composed of 21 places in 140 ms
[2020-05-12 03:16:20] [INFO ] Deduced a trap composed of 126 places in 426 ms
[2020-05-12 03:16:21] [INFO ] Deduced a trap composed of 125 places in 147 ms
[2020-05-12 03:16:21] [INFO ] Deduced a trap composed of 127 places in 138 ms
[2020-05-12 03:16:21] [INFO ] Deduced a trap composed of 22 places in 133 ms
[2020-05-12 03:16:21] [INFO ] Deduced a trap composed of 118 places in 161 ms
[2020-05-12 03:16:21] [INFO ] Deduced a trap composed of 31 places in 137 ms
[2020-05-12 03:16:21] [INFO ] Deduced a trap composed of 33 places in 166 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 26 places in 135 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 126 places in 137 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 132 places in 310 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 33 places in 293 ms
[2020-05-12 03:16:22] [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 s191 s192 s193 s203 s204 s205 s209 s210 s211 s236 s239 s270 s368 s369 s370 s374 s379 s393 s394 s395 s399 s404 s409 s428 s429 s432 s535 s536 s539 s540) 0)") while checking expression at index 2
[2020-05-12 03:16:23] [INFO ] [Real]Absence check using 55 positive place invariants in 194 ms returned sat
[2020-05-12 03:16:23] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 223 ms returned sat
[2020-05-12 03:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:24] [INFO ] [Real]Absence check using state equation in 992 ms returned sat
[2020-05-12 03:16:25] [INFO ] Deduced a trap composed of 13 places in 568 ms
[2020-05-12 03:16:25] [INFO ] Deduced a trap composed of 26 places in 482 ms
[2020-05-12 03:16:25] [INFO ] Deduced a trap composed of 19 places in 329 ms
[2020-05-12 03:16:26] [INFO ] Deduced a trap composed of 117 places in 316 ms
[2020-05-12 03:16:26] [INFO ] Deduced a trap composed of 22 places in 294 ms
[2020-05-12 03:16:26] [INFO ] Deduced a trap composed of 30 places in 169 ms
[2020-05-12 03:16:27] [INFO ] Deduced a trap composed of 127 places in 148 ms
[2020-05-12 03:16:27] [INFO ] Deduced a trap composed of 18 places in 359 ms
[2020-05-12 03:16:27] [INFO ] Deduced a trap composed of 21 places in 304 ms
[2020-05-12 03:16:28] [INFO ] Deduced a trap composed of 21 places in 494 ms
[2020-05-12 03:16:28] [INFO ] Deduced a trap composed of 22 places in 289 ms
[2020-05-12 03:16:28] [INFO ] Deduced a trap composed of 27 places in 133 ms
[2020-05-12 03:16:29] [INFO ] Deduced a trap composed of 35 places in 297 ms
[2020-05-12 03:16:29] [INFO ] Deduced a trap composed of 27 places in 199 ms
[2020-05-12 03:16:29] [INFO ] Deduced a trap composed of 17 places in 394 ms
[2020-05-12 03:16:29] [INFO ] Deduced a trap composed of 125 places in 223 ms
[2020-05-12 03:16:30] [INFO ] Deduced a trap composed of 128 places in 781 ms
[2020-05-12 03:16:30] [INFO ] Deduced a trap composed of 20 places in 225 ms
[2020-05-12 03:16:31] [INFO ] Deduced a trap composed of 128 places in 308 ms
[2020-05-12 03:16:31] [INFO ] Deduced a trap composed of 22 places in 303 ms
[2020-05-12 03:16:32] [INFO ] Deduced a trap composed of 21 places in 455 ms
[2020-05-12 03:16:32] [INFO ] Deduced a trap composed of 31 places in 180 ms
[2020-05-12 03:16:32] [INFO ] Deduced a trap composed of 122 places in 150 ms
[2020-05-12 03:16:32] [INFO ] Deduced a trap composed of 38 places in 361 ms
[2020-05-12 03:16:33] [INFO ] Deduced a trap composed of 30 places in 146 ms
[2020-05-12 03:16:33] [INFO ] Deduced a trap composed of 46 places in 311 ms
[2020-05-12 03:16:33] [INFO ] Deduced a trap composed of 23 places in 194 ms
[2020-05-12 03:16:34] [INFO ] Deduced a trap composed of 27 places in 354 ms
[2020-05-12 03:16:35] [INFO ] Deduced a trap composed of 33 places in 993 ms
[2020-05-12 03:16:35] [INFO ] Deduced a trap composed of 120 places in 185 ms
[2020-05-12 03:16:35] [INFO ] Deduced a trap composed of 35 places in 155 ms
[2020-05-12 03:16:35] [INFO ] Deduced a trap composed of 38 places in 209 ms
[2020-05-12 03:16:36] [INFO ] Deduced a trap composed of 125 places in 323 ms
[2020-05-12 03:16:36] [INFO ] Deduced a trap composed of 41 places in 224 ms
[2020-05-12 03:16:36] [INFO ] Deduced a trap composed of 29 places in 272 ms
[2020-05-12 03:16:36] [INFO ] Deduced a trap composed of 22 places in 294 ms
[2020-05-12 03:16:37] [INFO ] Deduced a trap composed of 16 places in 287 ms
[2020-05-12 03:16:37] [INFO ] Deduced a trap composed of 22 places in 226 ms
[2020-05-12 03:16:37] [INFO ] Deduced a trap composed of 40 places in 206 ms
[2020-05-12 03:16:38] [INFO ] Deduced a trap composed of 124 places in 280 ms
[2020-05-12 03:16:38] [INFO ] Deduced a trap composed of 33 places in 312 ms
[2020-05-12 03:16:38] [INFO ] Deduced a trap composed of 127 places in 125 ms
[2020-05-12 03:16:38] [INFO ] Deduced a trap composed of 28 places in 156 ms
[2020-05-12 03:16:39] [INFO ] Deduced a trap composed of 47 places in 909 ms
[2020-05-12 03:16:39] [INFO ] Deduced a trap composed of 35 places in 178 ms
[2020-05-12 03:16:40] [INFO ] Deduced a trap composed of 44 places in 148 ms
[2020-05-12 03:16:40] [INFO ] Deduced a trap composed of 47 places in 312 ms
[2020-05-12 03:16:40] [INFO ] Deduced a trap composed of 128 places in 525 ms
[2020-05-12 03:16:41] [INFO ] Deduced a trap composed of 35 places in 144 ms
[2020-05-12 03:16:41] [INFO ] Deduced a trap composed of 33 places in 119 ms
[2020-05-12 03:16:41] [INFO ] Deduced a trap composed of 25 places in 112 ms
[2020-05-12 03:16:42] [INFO ] Deduced a trap composed of 133 places in 1621 ms
[2020-05-12 03:16:42] [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 s27 s28 s31 s73 s75 s80 s99 s105 s139 s140 s141 s145 s148 s149 s154 s155 s159 s160 s161 s165 s166 s167 s171 s172 s173 s176 s177 s178 s182 s225 s275 s283 s285 s289 s294 s308 s309 s310 s314 s319 s323 s324 s325 s329 s334 s339 s344 s359 s374 s379 s404 s409 s413 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s430 s431 s432 s433 s434 s439 s440 s441 s442 s443 s444 s447 s448 s451 s452 s454 s459 s460 s464 s465 s466 s467 s468 s469 s470 s471 s474 s475 s484 s485 s492 s493 s500 s501 s511 s512 s513 s514 s515 s516 s517 s518 s521 s522 s525 s526 s527 s528 s529 s530 s531 s532 s533 s534 s535 s536 s539 s540 s543 s544 s545 s569 s570 s571) 0)") while checking expression at index 3
[2020-05-12 03:16:43] [INFO ] [Real]Absence check using 55 positive place invariants in 152 ms returned sat
[2020-05-12 03:16:43] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 98 ms returned sat
[2020-05-12 03:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:44] [INFO ] [Real]Absence check using state equation in 866 ms returned unsat
[2020-05-12 03:16:44] [INFO ] [Real]Absence check using 55 positive place invariants in 31 ms returned sat
[2020-05-12 03:16:44] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-05-12 03:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:45] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2020-05-12 03:16:45] [INFO ] Deduced a trap composed of 20 places in 330 ms
[2020-05-12 03:16:45] [INFO ] Deduced a trap composed of 21 places in 281 ms
[2020-05-12 03:16:45] [INFO ] Deduced a trap composed of 20 places in 270 ms
[2020-05-12 03:16:46] [INFO ] Deduced a trap composed of 29 places in 183 ms
[2020-05-12 03:16:46] [INFO ] Deduced a trap composed of 36 places in 95 ms
[2020-05-12 03:16:46] [INFO ] Deduced a trap composed of 12 places in 299 ms
[2020-05-12 03:16:46] [INFO ] Deduced a trap composed of 20 places in 203 ms
[2020-05-12 03:16:47] [INFO ] Deduced a trap composed of 32 places in 177 ms
[2020-05-12 03:16:47] [INFO ] Deduced a trap composed of 31 places in 102 ms
[2020-05-12 03:16:47] [INFO ] Deduced a trap composed of 26 places in 186 ms
[2020-05-12 03:16:47] [INFO ] Deduced a trap composed of 34 places in 80 ms
[2020-05-12 03:16:47] [INFO ] Deduced a trap composed of 23 places in 110 ms
[2020-05-12 03:16:47] [INFO ] Deduced a trap composed of 28 places in 73 ms
[2020-05-12 03:16:48] [INFO ] Deduced a trap composed of 34 places in 599 ms
[2020-05-12 03:16:48] [INFO ] Deduced a trap composed of 42 places in 148 ms
[2020-05-12 03:16:48] [INFO ] Deduced a trap composed of 30 places in 152 ms
[2020-05-12 03:16:48] [INFO ] Deduced a trap composed of 28 places in 145 ms
[2020-05-12 03:16:49] [INFO ] Deduced a trap composed of 42 places in 158 ms
[2020-05-12 03:16:49] [INFO ] Deduced a trap composed of 30 places in 188 ms
[2020-05-12 03:16:49] [INFO ] Deduced a trap composed of 32 places in 109 ms
[2020-05-12 03:16:49] [INFO ] Deduced a trap composed of 39 places in 72 ms
[2020-05-12 03:16:49] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4456 ms
[2020-05-12 03:16:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:16:49] [INFO ] [Nat]Absence check using 55 positive place invariants in 121 ms returned sat
[2020-05-12 03:16:49] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 34 ms returned sat
[2020-05-12 03:16:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:50] [INFO ] [Nat]Absence check using state equation in 1063 ms returned sat
[2020-05-12 03:16:51] [INFO ] Deduced a trap composed of 22 places in 295 ms
[2020-05-12 03:16:51] [INFO ] Deduced a trap composed of 17 places in 198 ms
[2020-05-12 03:16:51] [INFO ] Deduced a trap composed of 22 places in 174 ms
[2020-05-12 03:16:51] [INFO ] Deduced a trap composed of 29 places in 126 ms
[2020-05-12 03:16:51] [INFO ] Deduced a trap composed of 25 places in 226 ms
[2020-05-12 03:16:52] [INFO ] Deduced a trap composed of 128 places in 139 ms
[2020-05-12 03:16:52] [INFO ] Deduced a trap composed of 20 places in 137 ms
[2020-05-12 03:16:52] [INFO ] Deduced a trap composed of 29 places in 84 ms
[2020-05-12 03:16:52] [INFO ] Deduced a trap composed of 30 places in 183 ms
[2020-05-12 03:16:52] [INFO ] Deduced a trap composed of 38 places in 155 ms
[2020-05-12 03:16:52] [INFO ] Deduced a trap composed of 34 places in 66 ms
[2020-05-12 03:16:52] [INFO ] Deduced a trap composed of 40 places in 69 ms
[2020-05-12 03:16:53] [INFO ] Deduced a trap composed of 37 places in 67 ms
[2020-05-12 03:16:53] [INFO ] Deduced a trap composed of 11 places in 66 ms
[2020-05-12 03:16:53] [INFO ] Deduced a trap composed of 24 places in 64 ms
[2020-05-12 03:16:53] [INFO ] Deduced a trap composed of 20 places in 60 ms
[2020-05-12 03:16:53] [INFO ] Deduced a trap composed of 40 places in 64 ms
[2020-05-12 03:16:53] [INFO ] Deduced a trap composed of 43 places in 63 ms
[2020-05-12 03:16:53] [INFO ] Deduced a trap composed of 37 places in 109 ms
[2020-05-12 03:16:53] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2878 ms
[2020-05-12 03:16:53] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 39 ms.
[2020-05-12 03:16:56] [INFO ] Added : 262 causal constraints over 54 iterations in 2532 ms. Result :sat
[2020-05-12 03:16:56] [INFO ] [Real]Absence check using 55 positive place invariants in 63 ms returned sat
[2020-05-12 03:16:56] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 189 ms returned sat
[2020-05-12 03:16:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:58] [INFO ] [Real]Absence check using state equation in 1938 ms returned sat
[2020-05-12 03:16:59] [INFO ] Deduced a trap composed of 117 places in 432 ms
[2020-05-12 03:16:59] [INFO ] Deduced a trap composed of 13 places in 703 ms
[2020-05-12 03:16:59] [INFO ] Deduced a trap composed of 12 places in 140 ms
[2020-05-12 03:17:00] [INFO ] Deduced a trap composed of 14 places in 143 ms
[2020-05-12 03:17:00] [INFO ] Deduced a trap composed of 39 places in 109 ms
[2020-05-12 03:17:00] [INFO ] Deduced a trap composed of 15 places in 174 ms
[2020-05-12 03:17:00] [INFO ] Deduced a trap composed of 28 places in 176 ms
[2020-05-12 03:17:00] [INFO ] Deduced a trap composed of 24 places in 174 ms
[2020-05-12 03:17:00] [INFO ] Deduced a trap composed of 21 places in 108 ms
[2020-05-12 03:17:01] [INFO ] Deduced a trap composed of 25 places in 91 ms
[2020-05-12 03:17:01] [INFO ] Deduced a trap composed of 21 places in 166 ms
[2020-05-12 03:17:01] [INFO ] Deduced a trap composed of 26 places in 95 ms
[2020-05-12 03:17:01] [INFO ] Deduced a trap composed of 25 places in 105 ms
[2020-05-12 03:17:01] [INFO ] Deduced a trap composed of 30 places in 86 ms
[2020-05-12 03:17:01] [INFO ] Deduced a trap composed of 22 places in 86 ms
[2020-05-12 03:17:01] [INFO ] Deduced a trap composed of 29 places in 87 ms
[2020-05-12 03:17:02] [INFO ] Deduced a trap composed of 29 places in 213 ms
[2020-05-12 03:17:02] [INFO ] Deduced a trap composed of 32 places in 101 ms
[2020-05-12 03:17:02] [INFO ] Deduced a trap composed of 32 places in 84 ms
[2020-05-12 03:17:02] [INFO ] Deduced a trap composed of 30 places in 221 ms
[2020-05-12 03:17:03] [INFO ] Deduced a trap composed of 115 places in 725 ms
[2020-05-12 03:17:03] [INFO ] Deduced a trap composed of 119 places in 166 ms
[2020-05-12 03:17:03] [INFO ] Deduced a trap composed of 43 places in 494 ms
[2020-05-12 03:17:04] [INFO ] Deduced a trap composed of 27 places in 126 ms
[2020-05-12 03:17:04] [INFO ] Deduced a trap composed of 39 places in 85 ms
[2020-05-12 03:17:04] [INFO ] Deduced a trap composed of 32 places in 63 ms
[2020-05-12 03:17:05] [INFO ] Deduced a trap composed of 20 places in 1351 ms
[2020-05-12 03:17:05] [INFO ] Deduced a trap composed of 32 places in 138 ms
[2020-05-12 03:17:07] [INFO ] Deduced a trap composed of 24 places in 1104 ms
[2020-05-12 03:17:07] [INFO ] Deduced a trap composed of 25 places in 127 ms
[2020-05-12 03:17:07] [INFO ] Deduced a trap composed of 21 places in 162 ms
[2020-05-12 03:17:07] [INFO ] Deduced a trap composed of 21 places in 252 ms
[2020-05-12 03:17:07] [INFO ] Deduced a trap composed of 47 places in 120 ms
[2020-05-12 03:17:07] [INFO ] Deduced a trap composed of 41 places in 139 ms
[2020-05-12 03:17:08] [INFO ] Deduced a trap composed of 48 places in 148 ms
[2020-05-12 03:17:08] [INFO ] Deduced a trap composed of 52 places in 117 ms
[2020-05-12 03:17:08] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 9710 ms
[2020-05-12 03:17:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:17:08] [INFO ] [Nat]Absence check using 55 positive place invariants in 111 ms returned sat
[2020-05-12 03:17:08] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2020-05-12 03:17:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:17:10] [INFO ] [Nat]Absence check using state equation in 1766 ms returned sat
[2020-05-12 03:17:10] [INFO ] Deduced a trap composed of 12 places in 394 ms
[2020-05-12 03:17:10] [INFO ] Deduced a trap composed of 22 places in 209 ms
[2020-05-12 03:17:11] [INFO ] Deduced a trap composed of 21 places in 249 ms
[2020-05-12 03:17:11] [INFO ] Deduced a trap composed of 21 places in 221 ms
[2020-05-12 03:17:12] [INFO ] Deduced a trap composed of 24 places in 673 ms
[2020-05-12 03:17:12] [INFO ] Deduced a trap composed of 24 places in 216 ms
[2020-05-12 03:17:12] [INFO ] Deduced a trap composed of 21 places in 274 ms
[2020-05-12 03:17:12] [INFO ] Deduced a trap composed of 24 places in 109 ms
[2020-05-12 03:17:12] [INFO ] Deduced a trap composed of 24 places in 136 ms
[2020-05-12 03:17:13] [INFO ] Deduced a trap composed of 32 places in 110 ms
[2020-05-12 03:17:13] [INFO ] Deduced a trap composed of 15 places in 99 ms
[2020-05-12 03:17:13] [INFO ] Deduced a trap composed of 36 places in 134 ms
[2020-05-12 03:17:13] [INFO ] Deduced a trap composed of 46 places in 91 ms
[2020-05-12 03:17:13] [INFO ] Deduced a trap composed of 20 places in 92 ms
[2020-05-12 03:17:13] [INFO ] Deduced a trap composed of 31 places in 88 ms
[2020-05-12 03:17:13] [INFO ] Deduced a trap composed of 43 places in 92 ms
[2020-05-12 03:17:13] [INFO ] Deduced a trap composed of 30 places in 93 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 26 places in 90 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 23 places in 91 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 33 places in 93 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 25 places in 99 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 29 places in 93 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 30 places in 92 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 32 places in 89 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 61 places in 92 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 81 places in 91 ms
[2020-05-12 03:17:15] [INFO ] Deduced a trap composed of 82 places in 87 ms
[2020-05-12 03:17:15] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4741 ms
[2020-05-12 03:17:15] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 24 ms.
[2020-05-12 03:17:17] [INFO ] Added : 352 causal constraints over 71 iterations in 2737 ms. Result :sat
[2020-05-12 03:17:18] [INFO ] Deduced a trap composed of 44 places in 779 ms
[2020-05-12 03:17:18] [INFO ] Deduced a trap composed of 43 places in 29 ms
[2020-05-12 03:17:18] [INFO ] Deduced a trap composed of 42 places in 175 ms
[2020-05-12 03:17:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1173 ms
[2020-05-12 03:17:19] [INFO ] [Real]Absence check using 55 positive place invariants in 31 ms returned sat
[2020-05-12 03:17:19] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-05-12 03:17:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:17:19] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2020-05-12 03:17:19] [INFO ] Deduced a trap composed of 15 places in 115 ms
[2020-05-12 03:17:19] [INFO ] Deduced a trap composed of 18 places in 99 ms
[2020-05-12 03:17:20] [INFO ] Deduced a trap composed of 20 places in 136 ms
[2020-05-12 03:17:20] [INFO ] Deduced a trap composed of 12 places in 109 ms
[2020-05-12 03:17:20] [INFO ] Deduced a trap composed of 18 places in 111 ms
[2020-05-12 03:17:20] [INFO ] Deduced a trap composed of 22 places in 144 ms
[2020-05-12 03:17:20] [INFO ] Deduced a trap composed of 21 places in 165 ms
[2020-05-12 03:17:20] [INFO ] Deduced a trap composed of 24 places in 107 ms
[2020-05-12 03:17:20] [INFO ] Deduced a trap composed of 22 places in 96 ms
[2020-05-12 03:17:21] [INFO ] Deduced a trap composed of 20 places in 109 ms
[2020-05-12 03:17:21] [INFO ] Deduced a trap composed of 17 places in 129 ms
[2020-05-12 03:17:21] [INFO ] Deduced a trap composed of 26 places in 105 ms
[2020-05-12 03:17:21] [INFO ] Deduced a trap composed of 13 places in 99 ms
[2020-05-12 03:17:21] [INFO ] Deduced a trap composed of 28 places in 76 ms
[2020-05-12 03:17:21] [INFO ] Deduced a trap composed of 36 places in 79 ms
[2020-05-12 03:17:21] [INFO ] Deduced a trap composed of 30 places in 77 ms
[2020-05-12 03:17:21] [INFO ] Deduced a trap composed of 39 places in 74 ms
[2020-05-12 03:17:22] [INFO ] Deduced a trap composed of 32 places in 139 ms
[2020-05-12 03:17:22] [INFO ] Deduced a trap composed of 45 places in 70 ms
[2020-05-12 03:17:22] [INFO ] Deduced a trap composed of 35 places in 85 ms
[2020-05-12 03:17:22] [INFO ] Deduced a trap composed of 33 places in 61 ms
[2020-05-12 03:17:22] [INFO ] Deduced a trap composed of 26 places in 62 ms
[2020-05-12 03:17:22] [INFO ] Deduced a trap composed of 25 places in 71 ms
[2020-05-12 03:17:22] [INFO ] Deduced a trap composed of 21 places in 131 ms
[2020-05-12 03:17:22] [INFO ] Deduced a trap composed of 64 places in 108 ms
[2020-05-12 03:17:23] [INFO ] Deduced a trap composed of 68 places in 83 ms
[2020-05-12 03:17:23] [INFO ] Deduced a trap composed of 32 places in 56 ms
[2020-05-12 03:17:23] [INFO ] Deduced a trap composed of 30 places in 45 ms
[2020-05-12 03:17:23] [INFO ] Deduced a trap composed of 28 places in 33 ms
[2020-05-12 03:17:23] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3542 ms
[2020-05-12 03:17:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:17:23] [INFO ] [Nat]Absence check using 55 positive place invariants in 70 ms returned sat
[2020-05-12 03:17:23] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2020-05-12 03:17:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:17:24] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2020-05-12 03:17:24] [INFO ] Deduced a trap composed of 19 places in 251 ms
[2020-05-12 03:17:24] [INFO ] Deduced a trap composed of 13 places in 594 ms
[2020-05-12 03:17:25] [INFO ] Deduced a trap composed of 11 places in 157 ms
[2020-05-12 03:17:25] [INFO ] Deduced a trap composed of 24 places in 166 ms
[2020-05-12 03:17:25] [INFO ] Deduced a trap composed of 111 places in 141 ms
[2020-05-12 03:17:25] [INFO ] Deduced a trap composed of 21 places in 150 ms
[2020-05-12 03:17:25] [INFO ] Deduced a trap composed of 15 places in 166 ms
[2020-05-12 03:17:25] [INFO ] Deduced a trap composed of 12 places in 150 ms
[2020-05-12 03:17:26] [INFO ] Deduced a trap composed of 23 places in 557 ms
[2020-05-12 03:17:26] [INFO ] Deduced a trap composed of 103 places in 223 ms
[2020-05-12 03:17:27] [INFO ] Deduced a trap composed of 34 places in 588 ms
[2020-05-12 03:17:27] [INFO ] Deduced a trap composed of 25 places in 153 ms
[2020-05-12 03:17:27] [INFO ] Deduced a trap composed of 22 places in 146 ms
[2020-05-12 03:17:27] [INFO ] Deduced a trap composed of 21 places in 149 ms
[2020-05-12 03:17:28] [INFO ] Deduced a trap composed of 19 places in 286 ms
[2020-05-12 03:17:29] [INFO ] Deduced a trap composed of 34 places in 905 ms
[2020-05-12 03:17:29] [INFO ] Deduced a trap composed of 33 places in 545 ms
[2020-05-12 03:17:30] [INFO ] Deduced a trap composed of 28 places in 279 ms
[2020-05-12 03:17:30] [INFO ] Deduced a trap composed of 43 places in 142 ms
[2020-05-12 03:17:30] [INFO ] Deduced a trap composed of 32 places in 302 ms
[2020-05-12 03:17:30] [INFO ] Deduced a trap composed of 28 places in 276 ms
[2020-05-12 03:17:31] [INFO ] Deduced a trap composed of 107 places in 410 ms
[2020-05-12 03:17:31] [INFO ] Deduced a trap composed of 43 places in 252 ms
[2020-05-12 03:17:31] [INFO ] Deduced a trap composed of 100 places in 159 ms
[2020-05-12 03:17:32] [INFO ] Deduced a trap composed of 43 places in 624 ms
[2020-05-12 03:17:32] [INFO ] Deduced a trap composed of 12 places in 141 ms
[2020-05-12 03:17:32] [INFO ] Deduced a trap composed of 24 places in 143 ms
[2020-05-12 03:17:33] [INFO ] Deduced a trap composed of 35 places in 606 ms
[2020-05-12 03:17:33] [INFO ] Deduced a trap composed of 35 places in 155 ms
[2020-05-12 03:17:33] [INFO ] Deduced a trap composed of 28 places in 122 ms
[2020-05-12 03:17:34] [INFO ] Deduced a trap composed of 33 places in 690 ms
[2020-05-12 03:17:34] [INFO ] Deduced a trap composed of 107 places in 298 ms
[2020-05-12 03:17:34] [INFO ] Deduced a trap composed of 34 places in 136 ms
[2020-05-12 03:17:36] [INFO ] Deduced a trap composed of 44 places in 1192 ms
[2020-05-12 03:17:36] [INFO ] Deduced a trap composed of 20 places in 254 ms
[2020-05-12 03:17:37] [INFO ] Deduced a trap composed of 41 places in 937 ms
[2020-05-12 03:17:37] [INFO ] Deduced a trap composed of 26 places in 634 ms
[2020-05-12 03:17:38] [INFO ] Deduced a trap composed of 54 places in 139 ms
[2020-05-12 03:17:38] [INFO ] Deduced a trap composed of 64 places in 269 ms
[2020-05-12 03:17:38] [INFO ] Deduced a trap composed of 112 places in 176 ms
[2020-05-12 03:17:38] [INFO ] Deduced a trap composed of 50 places in 359 ms
[2020-05-12 03:17:39] [INFO ] Deduced a trap composed of 26 places in 346 ms
[2020-05-12 03:17:39] [INFO ] Deduced a trap composed of 61 places in 247 ms
[2020-05-12 03:17:39] [INFO ] Deduced a trap composed of 33 places in 127 ms
[2020-05-12 03:17:40] [INFO ] Deduced a trap composed of 31 places in 239 ms
[2020-05-12 03:17:40] [INFO ] Deduced a trap composed of 60 places in 121 ms
[2020-05-12 03:17:40] [INFO ] Deduced a trap composed of 25 places in 171 ms
[2020-05-12 03:17:40] [INFO ] Deduced a trap composed of 110 places in 124 ms
[2020-05-12 03:17:40] [INFO ] Deduced a trap composed of 117 places in 255 ms
[2020-05-12 03:17:41] [INFO ] Deduced a trap composed of 120 places in 560 ms
[2020-05-12 03:17:41] [INFO ] Deduced a trap composed of 107 places in 241 ms
[2020-05-12 03:17:41] [INFO ] Deduced a trap composed of 108 places in 247 ms
[2020-05-12 03:17:42] [INFO ] Deduced a trap composed of 113 places in 515 ms
[2020-05-12 03:17:42] [INFO ] Deduced a trap composed of 110 places in 140 ms
[2020-05-12 03:17:43] [INFO ] Deduced a trap composed of 126 places in 652 ms
[2020-05-12 03:17:43] [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 s27 s28 s31 s32 s86 s87 s88 s126 s127 s128 s139 s140 s141 s145 s148 s149 s151 s152 s171 s172 s173 s223 s224 s225 s228 s229 s230 s270 s279 s284 s288 s289 s290 s293 s294 s295 s299 s304 s309 s318 s319 s320 s334 s339 s349 s354 s379 s389 s404 s409 s413 s416 s417 s418 s419 s422 s423 s424 s425 s426 s427 s437 s438 s439 s440 s447 s448 s451 s452 s454 s456 s458 s460 s461 s462 s463 s466 s482 s483 s484 s485 s486 s487 s494 s495 s498 s499 s502 s503 s504 s505 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s525 s526 s529 s530 s531 s532 s533 s534 s543 s551 s557 s563 s569 s572 s573) 0)") while checking expression at index 7
[2020-05-12 03:17:43] [INFO ] [Real]Absence check using 55 positive place invariants in 30 ms returned sat
[2020-05-12 03:17:43] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2020-05-12 03:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:17:44] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2020-05-12 03:17:44] [INFO ] Deduced a trap composed of 12 places in 482 ms
[2020-05-12 03:17:45] [INFO ] Deduced a trap composed of 30 places in 392 ms
[2020-05-12 03:17:45] [INFO ] Deduced a trap composed of 24 places in 131 ms
[2020-05-12 03:17:45] [INFO ] Deduced a trap composed of 31 places in 645 ms
[2020-05-12 03:17:46] [INFO ] Deduced a trap composed of 18 places in 117 ms
[2020-05-12 03:17:46] [INFO ] Deduced a trap composed of 30 places in 101 ms
[2020-05-12 03:17:46] [INFO ] Deduced a trap composed of 23 places in 245 ms
[2020-05-12 03:17:46] [INFO ] Deduced a trap composed of 18 places in 266 ms
[2020-05-12 03:17:46] [INFO ] Deduced a trap composed of 26 places in 180 ms
[2020-05-12 03:17:47] [INFO ] Deduced a trap composed of 27 places in 114 ms
[2020-05-12 03:17:47] [INFO ] Deduced a trap composed of 23 places in 165 ms
[2020-05-12 03:17:47] [INFO ] Deduced a trap composed of 19 places in 205 ms
[2020-05-12 03:17:47] [INFO ] Deduced a trap composed of 25 places in 194 ms
[2020-05-12 03:17:47] [INFO ] Deduced a trap composed of 21 places in 219 ms
[2020-05-12 03:17:48] [INFO ] Deduced a trap composed of 29 places in 169 ms
[2020-05-12 03:17:48] [INFO ] Deduced a trap composed of 13 places in 220 ms
[2020-05-12 03:17:48] [INFO ] Deduced a trap composed of 24 places in 123 ms
[2020-05-12 03:17:48] [INFO ] Deduced a trap composed of 34 places in 127 ms
[2020-05-12 03:17:48] [INFO ] Deduced a trap composed of 24 places in 106 ms
[2020-05-12 03:17:48] [INFO ] Deduced a trap composed of 35 places in 131 ms
[2020-05-12 03:17:49] [INFO ] Deduced a trap composed of 24 places in 105 ms
[2020-05-12 03:17:49] [INFO ] Deduced a trap composed of 43 places in 168 ms
[2020-05-12 03:17:49] [INFO ] Deduced a trap composed of 30 places in 449 ms
[2020-05-12 03:17:49] [INFO ] Deduced a trap composed of 35 places in 90 ms
[2020-05-12 03:17:49] [INFO ] Deduced a trap composed of 38 places in 74 ms
[2020-05-12 03:17:50] [INFO ] Deduced a trap composed of 25 places in 38 ms
[2020-05-12 03:17:50] [INFO ] Deduced a trap composed of 43 places in 38 ms
[2020-05-12 03:17:50] [INFO ] Deduced a trap composed of 42 places in 30 ms
[2020-05-12 03:17:50] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6080 ms
[2020-05-12 03:17:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:17:50] [INFO ] [Nat]Absence check using 55 positive place invariants in 307 ms returned sat
[2020-05-12 03:17:50] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 58 ms returned sat
[2020-05-12 03:17:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:17:51] [INFO ] [Nat]Absence check using state equation in 775 ms returned sat
[2020-05-12 03:17:51] [INFO ] Deduced a trap composed of 21 places in 194 ms
[2020-05-12 03:17:51] [INFO ] Deduced a trap composed of 11 places in 268 ms
[2020-05-12 03:17:52] [INFO ] Deduced a trap composed of 23 places in 464 ms
[2020-05-12 03:17:52] [INFO ] Deduced a trap composed of 19 places in 196 ms
[2020-05-12 03:17:52] [INFO ] Deduced a trap composed of 18 places in 120 ms
[2020-05-12 03:17:52] [INFO ] Deduced a trap composed of 23 places in 121 ms
[2020-05-12 03:17:53] [INFO ] Deduced a trap composed of 14 places in 100 ms
[2020-05-12 03:17:53] [INFO ] Deduced a trap composed of 19 places in 117 ms
[2020-05-12 03:17:53] [INFO ] Deduced a trap composed of 33 places in 161 ms
[2020-05-12 03:17:53] [INFO ] Deduced a trap composed of 20 places in 186 ms
[2020-05-12 03:17:53] [INFO ] Deduced a trap composed of 20 places in 185 ms
[2020-05-12 03:17:53] [INFO ] Deduced a trap composed of 25 places in 106 ms
[2020-05-12 03:17:54] [INFO ] Deduced a trap composed of 28 places in 97 ms
[2020-05-12 03:17:54] [INFO ] Deduced a trap composed of 28 places in 113 ms
[2020-05-12 03:17:54] [INFO ] Deduced a trap composed of 27 places in 109 ms
[2020-05-12 03:17:54] [INFO ] Deduced a trap composed of 29 places in 106 ms
[2020-05-12 03:17:54] [INFO ] Deduced a trap composed of 25 places in 109 ms
[2020-05-12 03:17:54] [INFO ] Deduced a trap composed of 26 places in 115 ms
[2020-05-12 03:17:54] [INFO ] Deduced a trap composed of 30 places in 95 ms
[2020-05-12 03:17:55] [INFO ] Deduced a trap composed of 42 places in 95 ms
[2020-05-12 03:17:55] [INFO ] Deduced a trap composed of 34 places in 91 ms
[2020-05-12 03:17:55] [INFO ] Deduced a trap composed of 25 places in 73 ms
[2020-05-12 03:17:55] [INFO ] Deduced a trap composed of 30 places in 50 ms
[2020-05-12 03:17:55] [INFO ] Deduced a trap composed of 25 places in 106 ms
[2020-05-12 03:17:55] [INFO ] Deduced a trap composed of 40 places in 91 ms
[2020-05-12 03:17:55] [INFO ] Deduced a trap composed of 62 places in 136 ms
[2020-05-12 03:17:55] [INFO ] Deduced a trap composed of 27 places in 112 ms
[2020-05-12 03:17:56] [INFO ] Deduced a trap composed of 43 places in 58 ms
[2020-05-12 03:17:56] [INFO ] Deduced a trap composed of 42 places in 88 ms
[2020-05-12 03:17:56] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4795 ms
[2020-05-12 03:17:56] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 25 ms.
[2020-05-12 03:17:59] [INFO ] Added : 328 causal constraints over 66 iterations in 3501 ms. Result :sat
[2020-05-12 03:17:59] [INFO ] [Real]Absence check using 55 positive place invariants in 95 ms returned sat
[2020-05-12 03:17:59] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 36 ms returned sat
[2020-05-12 03:17:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:00] [INFO ] [Real]Absence check using state equation in 867 ms returned unsat
[2020-05-12 03:18:01] [INFO ] [Real]Absence check using 55 positive place invariants in 62 ms returned sat
[2020-05-12 03:18:01] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:01] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2020-05-12 03:18:02] [INFO ] Deduced a trap composed of 16 places in 449 ms
[2020-05-12 03:18:02] [INFO ] Deduced a trap composed of 24 places in 248 ms
[2020-05-12 03:18:02] [INFO ] Deduced a trap composed of 16 places in 313 ms
[2020-05-12 03:18:03] [INFO ] Deduced a trap composed of 22 places in 156 ms
[2020-05-12 03:18:03] [INFO ] Deduced a trap composed of 18 places in 129 ms
[2020-05-12 03:18:03] [INFO ] Deduced a trap composed of 20 places in 155 ms
[2020-05-12 03:18:03] [INFO ] Deduced a trap composed of 19 places in 127 ms
[2020-05-12 03:18:03] [INFO ] Deduced a trap composed of 20 places in 136 ms
[2020-05-12 03:18:03] [INFO ] Deduced a trap composed of 13 places in 311 ms
[2020-05-12 03:18:04] [INFO ] Deduced a trap composed of 25 places in 208 ms
[2020-05-12 03:18:04] [INFO ] Deduced a trap composed of 35 places in 195 ms
[2020-05-12 03:18:04] [INFO ] Deduced a trap composed of 117 places in 297 ms
[2020-05-12 03:18:05] [INFO ] Deduced a trap composed of 17 places in 379 ms
[2020-05-12 03:18:05] [INFO ] Deduced a trap composed of 127 places in 164 ms
[2020-05-12 03:18:05] [INFO ] Deduced a trap composed of 35 places in 161 ms
[2020-05-12 03:18:05] [INFO ] Deduced a trap composed of 23 places in 161 ms
[2020-05-12 03:18:05] [INFO ] Deduced a trap composed of 121 places in 156 ms
[2020-05-12 03:18:06] [INFO ] Deduced a trap composed of 41 places in 149 ms
[2020-05-12 03:18:06] [INFO ] Deduced a trap composed of 34 places in 170 ms
[2020-05-12 03:18:06] [INFO ] Deduced a trap composed of 27 places in 294 ms
[2020-05-12 03:18:06] [INFO ] Deduced a trap composed of 46 places in 282 ms
[2020-05-12 03:18:07] [INFO ] Deduced a trap composed of 40 places in 268 ms
[2020-05-12 03:18:07] [INFO ] Deduced a trap composed of 126 places in 184 ms
[2020-05-12 03:18:07] [INFO ] Deduced a trap composed of 35 places in 263 ms
[2020-05-12 03:18:07] [INFO ] Deduced a trap composed of 41 places in 118 ms
[2020-05-12 03:18:08] [INFO ] Deduced a trap composed of 43 places in 137 ms
[2020-05-12 03:18:08] [INFO ] Deduced a trap composed of 130 places in 286 ms
[2020-05-12 03:18:08] [INFO ] Deduced a trap composed of 35 places in 298 ms
[2020-05-12 03:18:08] [INFO ] Deduced a trap composed of 122 places in 168 ms
[2020-05-12 03:18:09] [INFO ] Deduced a trap composed of 122 places in 138 ms
[2020-05-12 03:18:09] [INFO ] Deduced a trap composed of 132 places in 133 ms
[2020-05-12 03:18:09] [INFO ] Deduced a trap composed of 129 places in 135 ms
[2020-05-12 03:18:09] [INFO ] Deduced a trap composed of 40 places in 133 ms
[2020-05-12 03:18:09] [INFO ] Deduced a trap composed of 42 places in 253 ms
[2020-05-12 03:18:09] [INFO ] Deduced a trap composed of 88 places in 137 ms
[2020-05-12 03:18:10] [INFO ] Deduced a trap composed of 126 places in 292 ms
[2020-05-12 03:18:10] [INFO ] Deduced a trap composed of 134 places in 316 ms
[2020-05-12 03:18:10] [INFO ] Deduced a trap composed of 129 places in 160 ms
[2020-05-12 03:18:10] [INFO ] Deduced a trap composed of 50 places in 137 ms
[2020-05-12 03:18:11] [INFO ] Deduced a trap composed of 76 places in 134 ms
[2020-05-12 03:18:11] [INFO ] Deduced a trap composed of 129 places in 135 ms
[2020-05-12 03:18:11] [INFO ] Deduced a trap composed of 133 places in 132 ms
[2020-05-12 03:18:11] [INFO ] Deduced a trap composed of 37 places in 341 ms
[2020-05-12 03:18:11] [INFO ] Deduced a trap composed of 56 places in 137 ms
[2020-05-12 03:18:12] [INFO ] Deduced a trap composed of 30 places in 249 ms
[2020-05-12 03:18:13] [INFO ] Deduced a trap composed of 123 places in 1121 ms
[2020-05-12 03:18:13] [INFO ] Deduced a trap composed of 126 places in 127 ms
[2020-05-12 03:18:13] [INFO ] Deduced a trap composed of 124 places in 184 ms
[2020-05-12 03:18:13] [INFO ] Deduced a trap composed of 123 places in 155 ms
[2020-05-12 03:18:14] [INFO ] Deduced a trap composed of 127 places in 142 ms
[2020-05-12 03:18:14] [INFO ] Deduced a trap composed of 123 places in 140 ms
[2020-05-12 03:18:14] [INFO ] Deduced a trap composed of 35 places in 141 ms
[2020-05-12 03:18:14] [INFO ] Deduced a trap composed of 125 places in 141 ms
[2020-05-12 03:18:14] [INFO ] Deduced a trap composed of 56 places in 139 ms
[2020-05-12 03:18:14] [INFO ] Deduced a trap composed of 119 places in 147 ms
[2020-05-12 03:18:15] [INFO ] Deduced a trap composed of 125 places in 152 ms
[2020-05-12 03:18:15] [INFO ] Deduced a trap composed of 124 places in 144 ms
[2020-05-12 03:18:15] [INFO ] Deduced a trap composed of 48 places in 145 ms
[2020-05-12 03:18:15] [INFO ] Deduced a trap composed of 142 places in 161 ms
[2020-05-12 03:18:15] [INFO ] Deduced a trap composed of 146 places in 143 ms
[2020-05-12 03:18:16] [INFO ] Deduced a trap composed of 133 places in 174 ms
[2020-05-12 03:18:16] [INFO ] Deduced a trap composed of 149 places in 156 ms
[2020-05-12 03:18:16] [INFO ] Deduced a trap composed of 120 places in 156 ms
[2020-05-12 03:18:16] [INFO ] Deduced a trap composed of 44 places in 157 ms
[2020-05-12 03:18:16] [INFO ] Deduced a trap composed of 118 places in 185 ms
[2020-05-12 03:18:16] [INFO ] Deduced a trap composed of 32 places in 150 ms
[2020-05-12 03:18:17] [INFO ] Deduced a trap composed of 122 places in 135 ms
[2020-05-12 03:18:17] [INFO ] Deduced a trap composed of 47 places in 167 ms
[2020-05-12 03:18:17] [INFO ] Deduced a trap composed of 140 places in 145 ms
[2020-05-12 03:18:17] [INFO ] Deduced a trap composed of 48 places in 216 ms
[2020-05-12 03:18:17] [INFO ] Deduced a trap composed of 141 places in 189 ms
[2020-05-12 03:18:18] [INFO ] Deduced a trap composed of 122 places in 169 ms
[2020-05-12 03:18:18] [INFO ] Deduced a trap composed of 121 places in 173 ms
[2020-05-12 03:18:18] [INFO ] Deduced a trap composed of 28 places in 169 ms
[2020-05-12 03:18:18] [INFO ] Deduced a trap composed of 53 places in 171 ms
[2020-05-12 03:18:18] [INFO ] Deduced a trap composed of 29 places in 159 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 24 places in 157 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 47 places in 167 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 47 places in 404 ms
[2020-05-12 03:18:20] [INFO ] Deduced a trap composed of 32 places in 433 ms
[2020-05-12 03:18:20] [INFO ] Deduced a trap composed of 48 places in 632 ms
[2020-05-12 03:18: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 s27 s28 s31 s32 s145 s151 s152 s171 s172 s173 s228 s229 s230 s236 s239 s270 s333 s334 s335 s344 s364 s369 s374 s379 s384 s389 s394 s399 s404 s409 s509 s510 s513 s514 s517 s518 s521 s522 s525 s526 s529 s530 s535 s536 s579) 0)") while checking expression at index 10
[2020-05-12 03:18:20] [INFO ] [Real]Absence check using 55 positive place invariants in 30 ms returned sat
[2020-05-12 03:18:21] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-05-12 03:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:21] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 18 places in 1057 ms
[2020-05-12 03:18:23] [INFO ] Deduced a trap composed of 13 places in 615 ms
[2020-05-12 03:18:23] [INFO ] Deduced a trap composed of 22 places in 166 ms
[2020-05-12 03:18:23] [INFO ] Deduced a trap composed of 105 places in 153 ms
[2020-05-12 03:18:23] [INFO ] Deduced a trap composed of 20 places in 161 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 17 places in 182 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 11 places in 313 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 15 places in 256 ms
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 13 places in 217 ms
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 27 places in 268 ms
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 99 places in 136 ms
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 110 places in 145 ms
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 20 places in 294 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 24 places in 146 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 26 places in 268 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 25 places in 268 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 28 places in 320 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 28 places in 169 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 25 places in 163 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 33 places in 139 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 32 places in 136 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 36 places in 152 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 26 places in 133 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 21 places in 260 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 22 places in 76 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 28 places in 82 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 32 places in 104 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 32 places in 75 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 34 places in 90 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 29 places in 113 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 43 places in 72 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 28 places in 142 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 24 places in 240 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 18 places in 77 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 39 places in 72 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 43 places in 79 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 31 places in 66 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 46 places in 67 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 49 places in 67 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 22 places in 69 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 56 places in 66 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 25 places in 104 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 66 places in 77 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 43 places in 170 ms
[2020-05-12 03:18:31] [INFO ] Deduced a trap composed of 59 places in 126 ms
[2020-05-12 03:18:31] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 9397 ms
[2020-05-12 03:18:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:18:31] [INFO ] [Nat]Absence check using 55 positive place invariants in 39 ms returned sat
[2020-05-12 03:18:31] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:18:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:31] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2020-05-12 03:18:32] [INFO ] Deduced a trap composed of 26 places in 170 ms
[2020-05-12 03:18:32] [INFO ] Deduced a trap composed of 12 places in 129 ms
[2020-05-12 03:18:32] [INFO ] Deduced a trap composed of 11 places in 154 ms
[2020-05-12 03:18:32] [INFO ] Deduced a trap composed of 20 places in 156 ms
[2020-05-12 03:18:32] [INFO ] Deduced a trap composed of 17 places in 144 ms
[2020-05-12 03:18:32] [INFO ] Deduced a trap composed of 25 places in 142 ms
[2020-05-12 03:18:33] [INFO ] Deduced a trap composed of 21 places in 146 ms
[2020-05-12 03:18:33] [INFO ] Deduced a trap composed of 104 places in 127 ms
[2020-05-12 03:18:33] [INFO ] Deduced a trap composed of 105 places in 138 ms
[2020-05-12 03:18:33] [INFO ] Deduced a trap composed of 104 places in 150 ms
[2020-05-12 03:18:33] [INFO ] Deduced a trap composed of 22 places in 124 ms
[2020-05-12 03:18:33] [INFO ] Deduced a trap composed of 25 places in 137 ms
[2020-05-12 03:18:34] [INFO ] Deduced a trap composed of 109 places in 149 ms
[2020-05-12 03:18:34] [INFO ] Deduced a trap composed of 108 places in 143 ms
[2020-05-12 03:18:34] [INFO ] Deduced a trap composed of 110 places in 142 ms
[2020-05-12 03:18:34] [INFO ] Deduced a trap composed of 118 places in 142 ms
[2020-05-12 03:18:34] [INFO ] Deduced a trap composed of 40 places in 140 ms
[2020-05-12 03:18:34] [INFO ] Deduced a trap composed of 23 places in 137 ms
[2020-05-12 03:18:35] [INFO ] Deduced a trap composed of 14 places in 144 ms
[2020-05-12 03:18:35] [INFO ] Deduced a trap composed of 104 places in 147 ms
[2020-05-12 03:18:35] [INFO ] Deduced a trap composed of 106 places in 157 ms
[2020-05-12 03:18:35] [INFO ] Deduced a trap composed of 28 places in 162 ms
[2020-05-12 03:18:35] [INFO ] Deduced a trap composed of 106 places in 144 ms
[2020-05-12 03:18:35] [INFO ] Deduced a trap composed of 28 places in 113 ms
[2020-05-12 03:18:36] [INFO ] Deduced a trap composed of 31 places in 121 ms
[2020-05-12 03:18:36] [INFO ] Deduced a trap composed of 24 places in 182 ms
[2020-05-12 03:18:36] [INFO ] Deduced a trap composed of 112 places in 179 ms
[2020-05-12 03:18:36] [INFO ] Deduced a trap composed of 27 places in 165 ms
[2020-05-12 03:18:36] [INFO ] Deduced a trap composed of 28 places in 155 ms
[2020-05-12 03:18:37] [INFO ] Deduced a trap composed of 19 places in 845 ms
[2020-05-12 03:18:38] [INFO ] Deduced a trap composed of 110 places in 397 ms
[2020-05-12 03:18:38] [INFO ] Deduced a trap composed of 29 places in 467 ms
[2020-05-12 03:18:38] [INFO ] Deduced a trap composed of 112 places in 152 ms
[2020-05-12 03:18:38] [INFO ] Deduced a trap composed of 116 places in 148 ms
[2020-05-12 03:18:39] [INFO ] Deduced a trap composed of 15 places in 272 ms
[2020-05-12 03:18:39] [INFO ] Deduced a trap composed of 108 places in 153 ms
[2020-05-12 03:18:39] [INFO ] Deduced a trap composed of 35 places in 147 ms
[2020-05-12 03:18:39] [INFO ] Deduced a trap composed of 45 places in 120 ms
[2020-05-12 03:18:39] [INFO ] Deduced a trap composed of 24 places in 135 ms
[2020-05-12 03:18:40] [INFO ] Deduced a trap composed of 24 places in 263 ms
[2020-05-12 03:18:40] [INFO ] Deduced a trap composed of 45 places in 139 ms
[2020-05-12 03:18:40] [INFO ] Deduced a trap composed of 108 places in 144 ms
[2020-05-12 03:18:40] [INFO ] Deduced a trap composed of 33 places in 204 ms
[2020-05-12 03:18:41] [INFO ] Deduced a trap composed of 108 places in 244 ms
[2020-05-12 03:18:41] [INFO ] Deduced a trap composed of 111 places in 113 ms
[2020-05-12 03:18:41] [INFO ] Deduced a trap composed of 108 places in 104 ms
[2020-05-12 03:18:41] [INFO ] Deduced a trap composed of 108 places in 128 ms
[2020-05-12 03:18:41] [INFO ] Deduced a trap composed of 111 places in 143 ms
[2020-05-12 03:18:42] [INFO ] Deduced a trap composed of 111 places in 631 ms
[2020-05-12 03:18:42] [INFO ] Deduced a trap composed of 25 places in 125 ms
[2020-05-12 03:18:43] [INFO ] Deduced a trap composed of 40 places in 566 ms
[2020-05-12 03:18:43] [INFO ] Deduced a trap composed of 27 places in 322 ms
[2020-05-12 03:18:43] [INFO ] Deduced a trap composed of 109 places in 298 ms
[2020-05-12 03:18:43] [INFO ] Deduced a trap composed of 26 places in 140 ms
[2020-05-12 03:18:44] [INFO ] Deduced a trap composed of 111 places in 142 ms
[2020-05-12 03:18:44] [INFO ] Deduced a trap composed of 29 places in 168 ms
[2020-05-12 03:18:44] [INFO ] Deduced a trap composed of 112 places in 143 ms
[2020-05-12 03:18:44] [INFO ] Deduced a trap composed of 44 places in 401 ms
[2020-05-12 03:18:45] [INFO ] Deduced a trap composed of 28 places in 385 ms
[2020-05-12 03:18:45] [INFO ] Deduced a trap composed of 25 places in 237 ms
[2020-05-12 03:18:45] [INFO ] Deduced a trap composed of 25 places in 339 ms
[2020-05-12 03:18:46] [INFO ] Deduced a trap composed of 29 places in 118 ms
[2020-05-12 03:18:46] [INFO ] Deduced a trap composed of 43 places in 148 ms
[2020-05-12 03:18:46] [INFO ] Deduced a trap composed of 53 places in 206 ms
[2020-05-12 03:18:46] [INFO ] Deduced a trap composed of 121 places in 138 ms
[2020-05-12 03:18:47] [INFO ] Deduced a trap composed of 109 places in 930 ms
[2020-05-12 03:18:47] [INFO ] Deduced a trap composed of 44 places in 151 ms
[2020-05-12 03:18:48] [INFO ] Deduced a trap composed of 31 places in 338 ms
[2020-05-12 03:18:48] [INFO ] Deduced a trap composed of 103 places in 486 ms
[2020-05-12 03:18:48] [INFO ] Deduced a trap composed of 109 places in 216 ms
[2020-05-12 03:18:49] [INFO ] Deduced a trap composed of 112 places in 177 ms
[2020-05-12 03:18:49] [INFO ] Deduced a trap composed of 117 places in 260 ms
[2020-05-12 03:18:50] [INFO ] Deduced a trap composed of 50 places in 683 ms
[2020-05-12 03:18:50] [INFO ] Deduced a trap composed of 51 places in 200 ms
[2020-05-12 03:18:50] [INFO ] Deduced a trap composed of 36 places in 136 ms
[2020-05-12 03:18:50] [INFO ] Deduced a trap composed of 36 places in 140 ms
[2020-05-12 03:18:50] [INFO ] Deduced a trap composed of 33 places in 372 ms
[2020-05-12 03:18:51] [INFO ] Deduced a trap composed of 114 places in 214 ms
[2020-05-12 03:18:51] [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 s66 s67 s68 s139 s140 s141 s159 s160 s161 s228 s229 s230 s236 s239 s279 s289 s294 s309 s313 s314 s315 s318 s320 s344 s349 s374 s384 s389 s399 s409 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s430 s431 s432 s433 s434 s437 s438 s439 s440 s441 s442 s443 s444 s447 s448 s478 s479 s480 s481 s482 s483 s484 s485 s486 s487 s490 s491 s492 s493 s494 s495 s496 s497 s502 s503 s506 s507 s508 s509 s510 s511 s512 s513 s514 s517 s518 s521 s522 s523 s524 s525 s526 s529 s530 s531 s532 s535 s536 s537 s538 s543 s579 s580 s581) 0)") while checking expression at index 11
[2020-05-12 03:18:51] [INFO ] [Real]Absence check using 55 positive place invariants in 33 ms returned sat
[2020-05-12 03:18:51] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-05-12 03:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:51] [INFO ] [Real]Absence check using state equation in 528 ms returned unsat
[2020-05-12 03:18:51] [INFO ] [Real]Absence check using 55 positive place invariants in 66 ms returned sat
[2020-05-12 03:18:51] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:52] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2020-05-12 03:18:52] [INFO ] Deduced a trap composed of 8 places in 93 ms
[2020-05-12 03:18:52] [INFO ] Deduced a trap composed of 11 places in 105 ms
[2020-05-12 03:18:53] [INFO ] Deduced a trap composed of 23 places in 101 ms
[2020-05-12 03:18:53] [INFO ] Deduced a trap composed of 26 places in 104 ms
[2020-05-12 03:18:53] [INFO ] Deduced a trap composed of 18 places in 100 ms
[2020-05-12 03:18:53] [INFO ] Deduced a trap composed of 17 places in 96 ms
[2020-05-12 03:18:53] [INFO ] Deduced a trap composed of 40 places in 101 ms
[2020-05-12 03:18:53] [INFO ] Deduced a trap composed of 35 places in 105 ms
[2020-05-12 03:18:54] [INFO ] Deduced a trap composed of 37 places in 462 ms
[2020-05-12 03:18:54] [INFO ] Deduced a trap composed of 23 places in 118 ms
[2020-05-12 03:18:54] [INFO ] Deduced a trap composed of 29 places in 81 ms
[2020-05-12 03:18:54] [INFO ] Deduced a trap composed of 30 places in 455 ms
[2020-05-12 03:18:54] [INFO ] Deduced a trap composed of 30 places in 93 ms
[2020-05-12 03:18:55] [INFO ] Deduced a trap composed of 33 places in 179 ms
[2020-05-12 03:18:55] [INFO ] Deduced a trap composed of 46 places in 181 ms
[2020-05-12 03:18:55] [INFO ] Deduced a trap composed of 29 places in 165 ms
[2020-05-12 03:18:55] [INFO ] Deduced a trap composed of 15 places in 169 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 24 places in 237 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 39 places in 173 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 34 places in 158 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 39 places in 181 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 41 places in 95 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 26 places in 75 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 49 places in 154 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 56 places in 128 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 29 places in 74 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 42 places in 127 ms
[2020-05-12 03:18:57] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4819 ms
[2020-05-12 03:18:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:18:57] [INFO ] [Nat]Absence check using 55 positive place invariants in 38 ms returned sat
[2020-05-12 03:18:57] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2020-05-12 03:18:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:58] [INFO ] [Nat]Absence check using state equation in 1310 ms returned sat
[2020-05-12 03:18:59] [INFO ] Deduced a trap composed of 8 places in 285 ms
[2020-05-12 03:18:59] [INFO ] Deduced a trap composed of 30 places in 268 ms
[2020-05-12 03:18:59] [INFO ] Deduced a trap composed of 11 places in 294 ms
[2020-05-12 03:19:00] [INFO ] Deduced a trap composed of 11 places in 177 ms
[2020-05-12 03:19:01] [INFO ] Deduced a trap composed of 18 places in 1156 ms
[2020-05-12 03:19:01] [INFO ] Deduced a trap composed of 24 places in 151 ms
[2020-05-12 03:19:01] [INFO ] Deduced a trap composed of 34 places in 268 ms
[2020-05-12 03:19:02] [INFO ] Deduced a trap composed of 35 places in 324 ms
[2020-05-12 03:19:02] [INFO ] Deduced a trap composed of 39 places in 625 ms
[2020-05-12 03:19:02] [INFO ] Deduced a trap composed of 31 places in 186 ms
[2020-05-12 03:19:03] [INFO ] Deduced a trap composed of 121 places in 138 ms
[2020-05-12 03:19:03] [INFO ] Deduced a trap composed of 29 places in 139 ms
[2020-05-12 03:19:03] [INFO ] Deduced a trap composed of 23 places in 339 ms
[2020-05-12 03:19:03] [INFO ] Deduced a trap composed of 22 places in 148 ms
[2020-05-12 03:19:04] [INFO ] Deduced a trap composed of 30 places in 385 ms
[2020-05-12 03:19:04] [INFO ] Deduced a trap composed of 16 places in 148 ms
[2020-05-12 03:19:04] [INFO ] Deduced a trap composed of 26 places in 197 ms
[2020-05-12 03:19:04] [INFO ] Deduced a trap composed of 25 places in 173 ms
[2020-05-12 03:19:04] [INFO ] Deduced a trap composed of 32 places in 212 ms
[2020-05-12 03:19:05] [INFO ] Deduced a trap composed of 36 places in 164 ms
[2020-05-12 03:19:05] [INFO ] Deduced a trap composed of 30 places in 165 ms
[2020-05-12 03:19:06] [INFO ] Deduced a trap composed of 37 places in 1052 ms
[2020-05-12 03:19:06] [INFO ] Deduced a trap composed of 39 places in 153 ms
[2020-05-12 03:19:07] [INFO ] Deduced a trap composed of 60 places in 568 ms
[2020-05-12 03:19:07] [INFO ] Deduced a trap composed of 50 places in 418 ms
[2020-05-12 03:19:07] [INFO ] Deduced a trap composed of 25 places in 178 ms
[2020-05-12 03:19:08] [INFO ] Deduced a trap composed of 32 places in 202 ms
[2020-05-12 03:19:08] [INFO ] Deduced a trap composed of 116 places in 744 ms
[2020-05-12 03:19:09] [INFO ] Deduced a trap composed of 38 places in 560 ms
[2020-05-12 03:19:09] [INFO ] Deduced a trap composed of 41 places in 180 ms
[2020-05-12 03:19:09] [INFO ] Deduced a trap composed of 118 places in 134 ms
[2020-05-12 03:19:09] [INFO ] Deduced a trap composed of 124 places in 134 ms
[2020-05-12 03:19:10] [INFO ] Deduced a trap composed of 22 places in 126 ms
[2020-05-12 03:19:10] [INFO ] Deduced a trap composed of 51 places in 294 ms
[2020-05-12 03:19:10] [INFO ] Deduced a trap composed of 110 places in 419 ms
[2020-05-12 03:19:11] [INFO ] Deduced a trap composed of 52 places in 278 ms
[2020-05-12 03:19:11] [INFO ] Deduced a trap composed of 33 places in 288 ms
[2020-05-12 03:19:11] [INFO ] Deduced a trap composed of 123 places in 242 ms
[2020-05-12 03:19:12] [INFO ] Deduced a trap composed of 29 places in 250 ms
[2020-05-12 03:19:12] [INFO ] Deduced a trap composed of 51 places in 249 ms
[2020-05-12 03:19:12] [INFO ] Deduced a trap composed of 28 places in 531 ms
[2020-05-12 03:19:13] [INFO ] Deduced a trap composed of 108 places in 327 ms
[2020-05-12 03:19:13] [INFO ] Deduced a trap composed of 144 places in 219 ms
[2020-05-12 03:19:13] [INFO ] Deduced a trap composed of 38 places in 137 ms
[2020-05-12 03:19:13] [INFO ] Deduced a trap composed of 35 places in 299 ms
[2020-05-12 03:19:14] [INFO ] Deduced a trap composed of 119 places in 120 ms
[2020-05-12 03:19:14] [INFO ] Deduced a trap composed of 20 places in 299 ms
[2020-05-12 03:19:14] [INFO ] Deduced a trap composed of 26 places in 275 ms
[2020-05-12 03:19:15] [INFO ] Deduced a trap composed of 139 places in 742 ms
[2020-05-12 03:19:16] [INFO ] Deduced a trap composed of 123 places in 662 ms
[2020-05-12 03:19:16] [INFO ] Deduced a trap composed of 124 places in 145 ms
[2020-05-12 03:19:16] [INFO ] Deduced a trap composed of 129 places in 381 ms
[2020-05-12 03:19:17] [INFO ] Deduced a trap composed of 131 places in 408 ms
[2020-05-12 03:19:17] [INFO ] Deduced a trap composed of 139 places in 183 ms
[2020-05-12 03:19:17] [INFO ] Deduced a trap composed of 139 places in 159 ms
[2020-05-12 03:19:17] [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 s36 s37 s38 s66 s67 s68 s80 s126 s127 s128 s139 s140 s141 s145 s154 s155 s228 s229 s230 s236 s239 s270 s274 s276 s279 s294 s299 s314 s329 s334 s339 s344 s349 s354 s369 s388 s390 s394 s404 s409 s413 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s432 s433 s434 s441 s442 s443 s444 s445 s446 s447 s448 s453 s454 s455 s456 s457 s458 s460 s461 s462 s466 s467 s468 s469 s470 s471 s474 s475 s476 s477 s480 s481 s482 s483 s484 s485 s490 s491 s492 s493 s498 s499 s502 s503 s506 s507 s509 s510 s513 s514 s519 s520 s521 s522 s523 s524 s525 s526 s527 s528 s529 s530 s533 s534 s535 s536 s543 s546 s547 s551 s552 s553 s554 s555 s556 s560 s561 s562 s566 s572 s573) 0)") while checking expression at index 13
[2020-05-12 03:19:17] [INFO ] [Real]Absence check using 55 positive place invariants in 30 ms returned sat
[2020-05-12 03:19:17] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2020-05-12 03:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:19:18] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2020-05-12 03:19:19] [INFO ] Deduced a trap composed of 120 places in 633 ms
[2020-05-12 03:19:19] [INFO ] Deduced a trap composed of 18 places in 158 ms
[2020-05-12 03:19:19] [INFO ] Deduced a trap composed of 13 places in 258 ms
[2020-05-12 03:19:19] [INFO ] Deduced a trap composed of 12 places in 151 ms
[2020-05-12 03:19:19] [INFO ] Deduced a trap composed of 17 places in 116 ms
[2020-05-12 03:19:19] [INFO ] Deduced a trap composed of 21 places in 124 ms
[2020-05-12 03:19:20] [INFO ] Deduced a trap composed of 11 places in 125 ms
[2020-05-12 03:19:20] [INFO ] Deduced a trap composed of 34 places in 502 ms
[2020-05-12 03:19:20] [INFO ] Deduced a trap composed of 25 places in 184 ms
[2020-05-12 03:19:20] [INFO ] Deduced a trap composed of 26 places in 167 ms
[2020-05-12 03:19:21] [INFO ] Deduced a trap composed of 30 places in 239 ms
[2020-05-12 03:19:21] [INFO ] Deduced a trap composed of 22 places in 632 ms
[2020-05-12 03:19:22] [INFO ] Deduced a trap composed of 34 places in 256 ms
[2020-05-12 03:19:22] [INFO ] Deduced a trap composed of 111 places in 123 ms
[2020-05-12 03:19:22] [INFO ] Deduced a trap composed of 112 places in 251 ms
[2020-05-12 03:19:22] [INFO ] Deduced a trap composed of 37 places in 123 ms
[2020-05-12 03:19:22] [INFO ] Deduced a trap composed of 21 places in 164 ms
[2020-05-12 03:19:23] [INFO ] Deduced a trap composed of 121 places in 410 ms
[2020-05-12 03:19:23] [INFO ] Deduced a trap composed of 125 places in 267 ms
[2020-05-12 03:19:24] [INFO ] Deduced a trap composed of 109 places in 476 ms
[2020-05-12 03:19:24] [INFO ] Deduced a trap composed of 112 places in 218 ms
[2020-05-12 03:19:24] [INFO ] Deduced a trap composed of 24 places in 224 ms
[2020-05-12 03:19:25] [INFO ] Deduced a trap composed of 128 places in 827 ms
[2020-05-12 03:19:25] [INFO ] Deduced a trap composed of 40 places in 157 ms
[2020-05-12 03:19:25] [INFO ] Deduced a trap composed of 22 places in 272 ms
[2020-05-12 03:19:26] [INFO ] Deduced a trap composed of 114 places in 156 ms
[2020-05-12 03:19:26] [INFO ] Deduced a trap composed of 118 places in 474 ms
[2020-05-12 03:19:26] [INFO ] Deduced a trap composed of 130 places in 180 ms
[2020-05-12 03:19:27] [INFO ] Deduced a trap composed of 117 places in 332 ms
[2020-05-12 03:19:27] [INFO ] Deduced a trap composed of 121 places in 678 ms
[2020-05-12 03:19:27] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 9602 ms
[2020-05-12 03:19:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:19:28] [INFO ] [Nat]Absence check using 55 positive place invariants in 67 ms returned sat
[2020-05-12 03:19:28] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 35 ms returned sat
[2020-05-12 03:19:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:19:29] [INFO ] [Nat]Absence check using state equation in 1342 ms returned sat
[2020-05-12 03:19:29] [INFO ] Deduced a trap composed of 17 places in 407 ms
[2020-05-12 03:19:30] [INFO ] Deduced a trap composed of 12 places in 282 ms
[2020-05-12 03:19:30] [INFO ] Deduced a trap composed of 11 places in 283 ms
[2020-05-12 03:19:30] [INFO ] Deduced a trap composed of 111 places in 153 ms
[2020-05-12 03:19:32] [INFO ] Deduced a trap composed of 21 places in 1610 ms
[2020-05-12 03:19:32] [INFO ] Deduced a trap composed of 108 places in 540 ms
[2020-05-12 03:19:33] [INFO ] Deduced a trap composed of 32 places in 145 ms
[2020-05-12 03:19:33] [INFO ] Deduced a trap composed of 112 places in 142 ms
[2020-05-12 03:19:33] [INFO ] Deduced a trap composed of 113 places in 134 ms
[2020-05-12 03:19:33] [INFO ] Deduced a trap composed of 21 places in 128 ms
[2020-05-12 03:19:33] [INFO ] Deduced a trap composed of 25 places in 129 ms
[2020-05-12 03:19:35] [INFO ] Deduced a trap composed of 23 places in 1709 ms
[2020-05-12 03:19:35] [INFO ] Deduced a trap composed of 23 places in 142 ms
[2020-05-12 03:19:35] [INFO ] Deduced a trap composed of 23 places in 129 ms
[2020-05-12 03:19:36] [INFO ] Deduced a trap composed of 23 places in 157 ms
[2020-05-12 03:19:36] [INFO ] Deduced a trap composed of 21 places in 126 ms
[2020-05-12 03:19:36] [INFO ] Deduced a trap composed of 106 places in 150 ms
[2020-05-12 03:19:36] [INFO ] Deduced a trap composed of 18 places in 137 ms
[2020-05-12 03:19:36] [INFO ] Deduced a trap composed of 29 places in 145 ms
[2020-05-12 03:19:36] [INFO ] Deduced a trap composed of 35 places in 169 ms
[2020-05-12 03:19:37] [INFO ] Deduced a trap composed of 28 places in 134 ms
[2020-05-12 03:19:37] [INFO ] Deduced a trap composed of 101 places in 153 ms
[2020-05-12 03:19:37] [INFO ] Deduced a trap composed of 111 places in 158 ms
[2020-05-12 03:19:37] [INFO ] Deduced a trap composed of 126 places in 154 ms
[2020-05-12 03:19:37] [INFO ] Deduced a trap composed of 125 places in 140 ms
[2020-05-12 03:19:37] [INFO ] Deduced a trap composed of 111 places in 140 ms
[2020-05-12 03:19:38] [INFO ] Deduced a trap composed of 110 places in 126 ms
[2020-05-12 03:19:38] [INFO ] Deduced a trap composed of 109 places in 136 ms
[2020-05-12 03:19:38] [INFO ] Deduced a trap composed of 107 places in 127 ms
[2020-05-12 03:19:38] [INFO ] Deduced a trap composed of 109 places in 146 ms
[2020-05-12 03:19:38] [INFO ] Deduced a trap composed of 107 places in 150 ms
[2020-05-12 03:19:38] [INFO ] Deduced a trap composed of 117 places in 137 ms
[2020-05-12 03:19:38] [INFO ] Deduced a trap composed of 108 places in 163 ms
[2020-05-12 03:19:39] [INFO ] Deduced a trap composed of 124 places in 627 ms
[2020-05-12 03:19:39] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 10126 ms
[2020-05-12 03:19:39] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 22 ms.
[2020-05-12 03:19:43] [INFO ] Added : 302 causal constraints over 61 iterations in 3500 ms. Result :sat
[2020-05-12 03:19:43] [INFO ] Deduced a trap composed of 42 places in 707 ms
[2020-05-12 03:19:44] [INFO ] Deduced a trap composed of 120 places in 241 ms
[2020-05-12 03:19:44] [INFO ] Deduced a trap composed of 124 places in 316 ms
[2020-05-12 03:19:44] [INFO ] Deduced a trap composed of 113 places in 223 ms
[2020-05-12 03:19:45] [INFO ] Deduced a trap composed of 135 places in 141 ms
[2020-05-12 03:19:45] [INFO ] Deduced a trap composed of 129 places in 122 ms
[2020-05-12 03:19:45] [INFO ] Deduced a trap composed of 120 places in 291 ms
[2020-05-12 03:19:45] [INFO ] Deduced a trap composed of 127 places in 102 ms
[2020-05-12 03:19:45] [INFO ] Deduced a trap composed of 132 places in 116 ms
[2020-05-12 03:19:46] [INFO ] Deduced a trap composed of 143 places in 216 ms
[2020-05-12 03:19:46] [INFO ] Deduced a trap composed of 118 places in 116 ms
[2020-05-12 03:19:46] [INFO ] Deduced a trap composed of 137 places in 100 ms
[2020-05-12 03:19:46] [INFO ] Deduced a trap composed of 136 places in 230 ms
[2020-05-12 03:19:47] [INFO ] Deduced a trap composed of 136 places in 212 ms
[2020-05-12 03:19:47] [INFO ] Deduced a trap composed of 121 places in 152 ms
[2020-05-12 03:19:47] [INFO ] Deduced a trap composed of 130 places in 202 ms
[2020-05-12 03:19:47] [INFO ] Deduced a trap composed of 139 places in 161 ms
[2020-05-12 03:19:48] [INFO ] Deduced a trap composed of 137 places in 275 ms
[2020-05-12 03:19:48] [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 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s27 s28 s31 s32 s60 s61 s62 s66 s67 s68 s75 s80 s105 s126 s127 s128 s134 s135 s139 s140 s141 s176 s177 s185 s188 s191 s192 s193 s197 s198 s199 s209 s210 s211 s228 s229 s230 s275 s279 s294 s304 s319 s324 s329 s339 s349 s364 s369 s379 s384 s389 s399 s404 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s430 s431 s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s454 s456 s460 s464 s465 s466 s469 s470 s471 s472 s473 s474 s475 s476 s477 s490 s491 s492 s493 s494 s495 s498 s499 s502 s503 s504 s505 s506 s507 s519 s520 s521 s522 s529 s530 s531 s532 s535 s536 s541 s542 s543 s551 s554 s569) 0)") while checking expression at index 14
[2020-05-12 03:19:48] [INFO ] [Real]Absence check using 55 positive place invariants in 49 ms returned sat
[2020-05-12 03:19:48] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:19:49] [INFO ] [Real]Absence check using state equation in 692 ms returned sat
[2020-05-12 03:19:49] [INFO ] Deduced a trap composed of 12 places in 201 ms
[2020-05-12 03:19:49] [INFO ] Deduced a trap composed of 13 places in 288 ms
[2020-05-12 03:19:49] [INFO ] Deduced a trap composed of 14 places in 288 ms
[2020-05-12 03:19:50] [INFO ] Deduced a trap composed of 16 places in 249 ms
[2020-05-12 03:19:50] [INFO ] Deduced a trap composed of 21 places in 236 ms
[2020-05-12 03:19:50] [INFO ] Deduced a trap composed of 11 places in 173 ms
[2020-05-12 03:19:51] [INFO ] Deduced a trap composed of 23 places in 281 ms
[2020-05-12 03:19:51] [INFO ] Deduced a trap composed of 21 places in 182 ms
[2020-05-12 03:19:51] [INFO ] Deduced a trap composed of 21 places in 170 ms
[2020-05-12 03:19:51] [INFO ] Deduced a trap composed of 27 places in 294 ms
[2020-05-12 03:19:51] [INFO ] Deduced a trap composed of 22 places in 106 ms
[2020-05-12 03:19:52] [INFO ] Deduced a trap composed of 23 places in 445 ms
[2020-05-12 03:19:52] [INFO ] Deduced a trap composed of 26 places in 115 ms
[2020-05-12 03:19:52] [INFO ] Deduced a trap composed of 22 places in 95 ms
[2020-05-12 03:19:52] [INFO ] Deduced a trap composed of 30 places in 315 ms
[2020-05-12 03:19:53] [INFO ] Deduced a trap composed of 25 places in 156 ms
[2020-05-12 03:19:53] [INFO ] Deduced a trap composed of 23 places in 162 ms
[2020-05-12 03:19:53] [INFO ] Deduced a trap composed of 38 places in 101 ms
[2020-05-12 03:19:53] [INFO ] Deduced a trap composed of 28 places in 121 ms
[2020-05-12 03:19:53] [INFO ] Deduced a trap composed of 25 places in 106 ms
[2020-05-12 03:19:53] [INFO ] Deduced a trap composed of 24 places in 174 ms
[2020-05-12 03:19:54] [INFO ] Deduced a trap composed of 31 places in 144 ms
[2020-05-12 03:19:54] [INFO ] Deduced a trap composed of 32 places in 82 ms
[2020-05-12 03:19:54] [INFO ] Deduced a trap composed of 34 places in 74 ms
[2020-05-12 03:19:54] [INFO ] Deduced a trap composed of 42 places in 79 ms
[2020-05-12 03:19:54] [INFO ] Deduced a trap composed of 20 places in 43 ms
[2020-05-12 03:19:54] [INFO ] Deduced a trap composed of 24 places in 433 ms
[2020-05-12 03:19:54] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5752 ms
[2020-05-12 03:19:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:19:54] [INFO ] [Nat]Absence check using 55 positive place invariants in 39 ms returned sat
[2020-05-12 03:19:55] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2020-05-12 03:19:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:19:55] [INFO ] [Nat]Absence check using state equation in 855 ms returned sat
[2020-05-12 03:19:56] [INFO ] Deduced a trap composed of 17 places in 161 ms
[2020-05-12 03:19:56] [INFO ] Deduced a trap composed of 13 places in 159 ms
[2020-05-12 03:19:56] [INFO ] Deduced a trap composed of 12 places in 86 ms
[2020-05-12 03:19:56] [INFO ] Deduced a trap composed of 12 places in 70 ms
[2020-05-12 03:19:56] [INFO ] Deduced a trap composed of 20 places in 97 ms
[2020-05-12 03:19:56] [INFO ] Deduced a trap composed of 23 places in 90 ms
[2020-05-12 03:19:56] [INFO ] Deduced a trap composed of 26 places in 78 ms
[2020-05-12 03:19:56] [INFO ] Deduced a trap composed of 40 places in 216 ms
[2020-05-12 03:19:57] [INFO ] Deduced a trap composed of 15 places in 152 ms
[2020-05-12 03:19:57] [INFO ] Deduced a trap composed of 31 places in 154 ms
[2020-05-12 03:19:57] [INFO ] Deduced a trap composed of 20 places in 118 ms
[2020-05-12 03:19:57] [INFO ] Deduced a trap composed of 57 places in 142 ms
[2020-05-12 03:19:57] [INFO ] Deduced a trap composed of 28 places in 106 ms
[2020-05-12 03:19:58] [INFO ] Deduced a trap composed of 26 places in 395 ms
[2020-05-12 03:19:58] [INFO ] Deduced a trap composed of 48 places in 70 ms
[2020-05-12 03:19:58] [INFO ] Deduced a trap composed of 25 places in 127 ms
[2020-05-12 03:19:58] [INFO ] Deduced a trap composed of 44 places in 99 ms
[2020-05-12 03:19:58] [INFO ] Deduced a trap composed of 31 places in 265 ms
[2020-05-12 03:19:59] [INFO ] Deduced a trap composed of 31 places in 273 ms
[2020-05-12 03:19:59] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3275 ms
[2020-05-12 03:19:59] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 50 ms.
[2020-05-12 03:20:03] [INFO ] Added : 375 causal constraints over 76 iterations in 4026 ms. Result :sat
[2020-05-12 03:20:03] [INFO ] [Real]Absence check using 55 positive place invariants in 54 ms returned sat
[2020-05-12 03:20:03] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2020-05-12 03:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:04] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2020-05-12 03:20:04] [INFO ] Deduced a trap composed of 11 places in 338 ms
[2020-05-12 03:20:04] [INFO ] Deduced a trap composed of 13 places in 449 ms
[2020-05-12 03:20:05] [INFO ] Deduced a trap composed of 27 places in 151 ms
[2020-05-12 03:20:05] [INFO ] Deduced a trap composed of 17 places in 133 ms
[2020-05-12 03:20:05] [INFO ] Deduced a trap composed of 12 places in 192 ms
[2020-05-12 03:20:05] [INFO ] Deduced a trap composed of 12 places in 437 ms
[2020-05-12 03:20:06] [INFO ] Deduced a trap composed of 124 places in 166 ms
[2020-05-12 03:20:06] [INFO ] Deduced a trap composed of 18 places in 119 ms
[2020-05-12 03:20:06] [INFO ] Deduced a trap composed of 115 places in 235 ms
[2020-05-12 03:20:06] [INFO ] Deduced a trap composed of 15 places in 133 ms
[2020-05-12 03:20:06] [INFO ] Deduced a trap composed of 21 places in 129 ms
[2020-05-12 03:20:06] [INFO ] Deduced a trap composed of 20 places in 142 ms
[2020-05-12 03:20:07] [INFO ] Deduced a trap composed of 24 places in 163 ms
[2020-05-12 03:20:07] [INFO ] Deduced a trap composed of 38 places in 130 ms
[2020-05-12 03:20:07] [INFO ] Deduced a trap composed of 21 places in 140 ms
[2020-05-12 03:20:07] [INFO ] Deduced a trap composed of 41 places in 118 ms
[2020-05-12 03:20:07] [INFO ] Deduced a trap composed of 28 places in 123 ms
[2020-05-12 03:20:07] [INFO ] Deduced a trap composed of 21 places in 134 ms
[2020-05-12 03:20:07] [INFO ] Deduced a trap composed of 20 places in 131 ms
[2020-05-12 03:20:08] [INFO ] Deduced a trap composed of 25 places in 268 ms
[2020-05-12 03:20:08] [INFO ] Deduced a trap composed of 37 places in 265 ms
[2020-05-12 03:20:08] [INFO ] Deduced a trap composed of 23 places in 263 ms
[2020-05-12 03:20:09] [INFO ] Deduced a trap composed of 109 places in 179 ms
[2020-05-12 03:20:09] [INFO ] Deduced a trap composed of 111 places in 248 ms
[2020-05-12 03:20:09] [INFO ] Deduced a trap composed of 28 places in 111 ms
[2020-05-12 03:20:09] [INFO ] Deduced a trap composed of 35 places in 223 ms
[2020-05-12 03:20:09] [INFO ] Deduced a trap composed of 116 places in 110 ms
[2020-05-12 03:20:10] [INFO ] Deduced a trap composed of 52 places in 145 ms
[2020-05-12 03:20:10] [INFO ] Deduced a trap composed of 112 places in 110 ms
[2020-05-12 03:20:10] [INFO ] Deduced a trap composed of 114 places in 117 ms
[2020-05-12 03:20:10] [INFO ] Deduced a trap composed of 26 places in 126 ms
[2020-05-12 03:20:10] [INFO ] Deduced a trap composed of 112 places in 117 ms
[2020-05-12 03:20:12] [INFO ] Deduced a trap composed of 26 places in 2263 ms
[2020-05-12 03:20:14] [INFO ] Deduced a trap composed of 51 places in 1587 ms
[2020-05-12 03:20:14] [INFO ] Deduced a trap composed of 136 places in 245 ms
[2020-05-12 03:20:15] [INFO ] Deduced a trap composed of 50 places in 261 ms
[2020-05-12 03:20:15] [INFO ] Deduced a trap composed of 133 places in 389 ms
[2020-05-12 03:20:15] [INFO ] Deduced a trap composed of 131 places in 212 ms
[2020-05-12 03:20:15] [INFO ] Deduced a trap composed of 69 places in 189 ms
[2020-05-12 03:20:16] [INFO ] Deduced a trap composed of 134 places in 210 ms
[2020-05-12 03:20:16] [INFO ] Deduced a trap composed of 113 places in 120 ms
[2020-05-12 03:20:16] [INFO ] Deduced a trap composed of 109 places in 125 ms
[2020-05-12 03:20:16] [INFO ] Deduced a trap composed of 127 places in 106 ms
[2020-05-12 03:20:16] [INFO ] Deduced a trap composed of 129 places in 189 ms
[2020-05-12 03:20:16] [INFO ] Deduced a trap composed of 127 places in 123 ms
[2020-05-12 03:20:17] [INFO ] Deduced a trap composed of 105 places in 112 ms
[2020-05-12 03:20:18] [INFO ] Deduced a trap composed of 38 places in 917 ms
[2020-05-12 03:20:18] [INFO ] Deduced a trap composed of 129 places in 814 ms
[2020-05-12 03:20:19] [INFO ] Deduced a trap composed of 111 places in 801 ms
[2020-05-12 03:20:20] [INFO ] Deduced a trap composed of 43 places in 935 ms
[2020-05-12 03:20:20] [INFO ] Deduced a trap composed of 32 places in 116 ms
[2020-05-12 03:20:21] [INFO ] Deduced a trap composed of 27 places in 132 ms
[2020-05-12 03:20:21] [INFO ] Deduced a trap composed of 25 places in 267 ms
[2020-05-12 03:20:21] [INFO ] Deduced a trap composed of 115 places in 137 ms
[2020-05-12 03:20:21] [INFO ] Deduced a trap composed of 45 places in 148 ms
[2020-05-12 03:20:21] [INFO ] Deduced a trap composed of 38 places in 233 ms
[2020-05-12 03:20:22] [INFO ] Deduced a trap composed of 42 places in 720 ms
[2020-05-12 03:20:22] [INFO ] Deduced a trap composed of 45 places in 297 ms
[2020-05-12 03:20:23] [INFO ] Deduced a trap composed of 113 places in 284 ms
[2020-05-12 03:20:23] [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 s60 s61 s62 s145 s148 s149 s154 s155 s159 s160 s161 s165 s166 s167 s176 s177 s185 s215 s216 s217 s223 s224 s225 s228 s229 s230 s270 s284 s309 s313 s314 s315 s319 s324 s329 s334 s339 s344 s349 s364 s398 s399 s400 s409 s413 s416 s417 s418 s419 s422 s423 s424 s425 s426 s427 s428 s429 s432 s433 s434 s435 s436 s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s449 s450 s451 s452 s474 s475 s478 s479 s484 s485 s488 s489 s492 s493 s506 s507 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s527 s528 s531 s532 s537 s538 s543) 0)") while checking expression at index 16
[2020-05-12 03:20:23] [INFO ] [Real]Absence check using 55 positive place invariants in 43 ms returned sat
[2020-05-12 03:20:23] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:25] [INFO ] [Real]Absence check using state equation in 1876 ms returned sat
[2020-05-12 03:20:25] [INFO ] Deduced a trap composed of 13 places in 377 ms
[2020-05-12 03:20:26] [INFO ] Deduced a trap composed of 138 places in 420 ms
[2020-05-12 03:20:26] [INFO ] Deduced a trap composed of 15 places in 161 ms
[2020-05-12 03:20:26] [INFO ] Deduced a trap composed of 17 places in 515 ms
[2020-05-12 03:20:27] [INFO ] Deduced a trap composed of 26 places in 211 ms
[2020-05-12 03:20:27] [INFO ] Deduced a trap composed of 25 places in 273 ms
[2020-05-12 03:20:27] [INFO ] Deduced a trap composed of 35 places in 219 ms
[2020-05-12 03:20:27] [INFO ] Deduced a trap composed of 138 places in 244 ms
[2020-05-12 03:20:28] [INFO ] Deduced a trap composed of 14 places in 269 ms
[2020-05-12 03:20:28] [INFO ] Deduced a trap composed of 27 places in 143 ms
[2020-05-12 03:20:28] [INFO ] Deduced a trap composed of 138 places in 134 ms
[2020-05-12 03:20:28] [INFO ] Deduced a trap composed of 137 places in 303 ms
[2020-05-12 03:20:29] [INFO ] Deduced a trap composed of 24 places in 159 ms
[2020-05-12 03:20:29] [INFO ] Deduced a trap composed of 23 places in 129 ms
[2020-05-12 03:20:29] [INFO ] Deduced a trap composed of 24 places in 141 ms
[2020-05-12 03:20:29] [INFO ] Deduced a trap composed of 27 places in 125 ms
[2020-05-12 03:20:29] [INFO ] Deduced a trap composed of 32 places in 167 ms
[2020-05-12 03:20:29] [INFO ] Deduced a trap composed of 28 places in 200 ms
[2020-05-12 03:20:30] [INFO ] Deduced a trap composed of 44 places in 209 ms
[2020-05-12 03:20:30] [INFO ] Deduced a trap composed of 128 places in 369 ms
[2020-05-12 03:20:31] [INFO ] Deduced a trap composed of 37 places in 824 ms
[2020-05-12 03:20:31] [INFO ] Deduced a trap composed of 22 places in 269 ms
[2020-05-12 03:20:32] [INFO ] Deduced a trap composed of 133 places in 448 ms
[2020-05-12 03:20:32] [INFO ] Deduced a trap composed of 49 places in 296 ms
[2020-05-12 03:20:32] [INFO ] Deduced a trap composed of 47 places in 243 ms
[2020-05-12 03:20:33] [INFO ] Deduced a trap composed of 28 places in 320 ms
[2020-05-12 03:20:33] [INFO ] Deduced a trap composed of 47 places in 271 ms
[2020-05-12 03:20:33] [INFO ] Deduced a trap composed of 32 places in 285 ms
[2020-05-12 03:20:33] [INFO ] Deduced a trap composed of 123 places in 166 ms
[2020-05-12 03:20:34] [INFO ] Deduced a trap composed of 26 places in 157 ms
[2020-05-12 03:20:34] [INFO ] Deduced a trap composed of 30 places in 141 ms
[2020-05-12 03:20:34] [INFO ] Deduced a trap composed of 63 places in 140 ms
[2020-05-12 03:20:34] [INFO ] Deduced a trap composed of 127 places in 131 ms
[2020-05-12 03:20:34] [INFO ] Deduced a trap composed of 48 places in 280 ms
[2020-05-12 03:20:35] [INFO ] Deduced a trap composed of 27 places in 381 ms
[2020-05-12 03:20:35] [INFO ] Deduced a trap composed of 26 places in 269 ms
[2020-05-12 03:20:35] [INFO ] Deduced a trap composed of 126 places in 165 ms
[2020-05-12 03:20:36] [INFO ] Deduced a trap composed of 26 places in 565 ms
[2020-05-12 03:20:36] [INFO ] Deduced a trap composed of 128 places in 299 ms
[2020-05-12 03:20:36] [INFO ] Deduced a trap composed of 135 places in 170 ms
[2020-05-12 03:20:37] [INFO ] Deduced a trap composed of 22 places in 778 ms
[2020-05-12 03:20:38] [INFO ] Deduced a trap composed of 47 places in 287 ms
[2020-05-12 03:20:38] [INFO ] Deduced a trap composed of 49 places in 298 ms
[2020-05-12 03:20:38] [INFO ] Deduced a trap composed of 21 places in 272 ms
[2020-05-12 03:20:38] [INFO ] Deduced a trap composed of 52 places in 163 ms
[2020-05-12 03:20:39] [INFO ] Deduced a trap composed of 30 places in 167 ms
[2020-05-12 03:20:39] [INFO ] Deduced a trap composed of 28 places in 238 ms
[2020-05-12 03:20:39] [INFO ] Deduced a trap composed of 34 places in 189 ms
[2020-05-12 03:20:39] [INFO ] Deduced a trap composed of 43 places in 334 ms
[2020-05-12 03:20:40] [INFO ] Deduced a trap composed of 120 places in 289 ms
[2020-05-12 03:20:40] [INFO ] Deduced a trap composed of 39 places in 236 ms
[2020-05-12 03:20:40] [INFO ] Deduced a trap composed of 48 places in 269 ms
[2020-05-12 03:20:41] [INFO ] Deduced a trap composed of 133 places in 277 ms
[2020-05-12 03:20:41] [INFO ] Deduced a trap composed of 45 places in 661 ms
[2020-05-12 03:20:42] [INFO ] Deduced a trap composed of 132 places in 471 ms
[2020-05-12 03:20:42] [INFO ] Deduced a trap composed of 41 places in 389 ms
[2020-05-12 03:20:43] [INFO ] Deduced a trap composed of 38 places in 300 ms
[2020-05-12 03:20:43] [INFO ] Deduced a trap composed of 137 places in 354 ms
[2020-05-12 03:20:43] [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 s27 s28 s31 s32 s73 s75 s77 s83 s86 s99 s105 s111 s165 s166 s167 s171 s172 s173 s191 s192 s193 s197 s198 s199 s203 s204 s205 s209 s210 s211 s223 s224 s228 s229 s230 s236 s239 s274 s276 s279 s284 s293 s295 s299 s304 s319 s323 s324 s325 s334 s339 s344 s354 s374 s379 s389 s399 s409 s413 s416 s417 s418 s419 s422 s423 s424 s425 s426 s427 s430 s431 s437 s438 s441 s442 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s457 s461 s462 s463 s470 s471 s472 s473 s474 s475 s484 s485 s486 s487 s488 s489 s490 s491 s492 s493 s494 s495 s498 s499 s500 s501 s509 s510 s511 s512 s515 s516 s529 s530 s531 s532 s537 s538 s543 s546 s547 s551 s555 s556 s561 s562 s572 s573) 0)") while checking expression at index 17
[2020-05-12 03:20:43] [INFO ] [Real]Absence check using 55 positive place invariants in 265 ms returned sat
[2020-05-12 03:20:43] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 23 ms returned sat
[2020-05-12 03:20:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:44] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2020-05-12 03:20:44] [INFO ] Deduced a trap composed of 15 places in 146 ms
[2020-05-12 03:20:45] [INFO ] Deduced a trap composed of 27 places in 993 ms
[2020-05-12 03:20:45] [INFO ] Deduced a trap composed of 22 places in 80 ms
[2020-05-12 03:20:45] [INFO ] Deduced a trap composed of 20 places in 117 ms
[2020-05-12 03:20:46] [INFO ] Deduced a trap composed of 22 places in 109 ms
[2020-05-12 03:20:46] [INFO ] Deduced a trap composed of 29 places in 68 ms
[2020-05-12 03:20:46] [INFO ] Deduced a trap composed of 31 places in 113 ms
[2020-05-12 03:20:46] [INFO ] Deduced a trap composed of 15 places in 121 ms
[2020-05-12 03:20:46] [INFO ] Deduced a trap composed of 27 places in 541 ms
[2020-05-12 03:20:47] [INFO ] Deduced a trap composed of 26 places in 65 ms
[2020-05-12 03:20:47] [INFO ] Deduced a trap composed of 13 places in 418 ms
[2020-05-12 03:20:47] [INFO ] Deduced a trap composed of 22 places in 88 ms
[2020-05-12 03:20:47] [INFO ] Deduced a trap composed of 24 places in 114 ms
[2020-05-12 03:20:47] [INFO ] Deduced a trap composed of 33 places in 67 ms
[2020-05-12 03:20:47] [INFO ] Deduced a trap composed of 23 places in 83 ms
[2020-05-12 03:20:48] [INFO ] Deduced a trap composed of 30 places in 349 ms
[2020-05-12 03:20:48] [INFO ] Deduced a trap composed of 31 places in 81 ms
[2020-05-12 03:20:48] [INFO ] Deduced a trap composed of 25 places in 88 ms
[2020-05-12 03:20:48] [INFO ] Deduced a trap composed of 41 places in 108 ms
[2020-05-12 03:20:48] [INFO ] Deduced a trap composed of 19 places in 63 ms
[2020-05-12 03:20:48] [INFO ] Deduced a trap composed of 30 places in 102 ms
[2020-05-12 03:20:48] [INFO ] Deduced a trap composed of 45 places in 61 ms
[2020-05-12 03:20:49] [INFO ] Deduced a trap composed of 33 places in 94 ms
[2020-05-12 03:20:50] [INFO ] Deduced a trap composed of 24 places in 1215 ms
[2020-05-12 03:20:50] [INFO ] Deduced a trap composed of 47 places in 97 ms
[2020-05-12 03:20:50] [INFO ] Deduced a trap composed of 34 places in 150 ms
[2020-05-12 03:20:50] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6134 ms
[2020-05-12 03:20:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:20:50] [INFO ] [Nat]Absence check using 55 positive place invariants in 39 ms returned sat
[2020-05-12 03:20:50] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:51] [INFO ] [Nat]Absence check using state equation in 688 ms returned sat
[2020-05-12 03:20:51] [INFO ] Deduced a trap composed of 32 places in 212 ms
[2020-05-12 03:20:51] [INFO ] Deduced a trap composed of 44 places in 161 ms
[2020-05-12 03:20:52] [INFO ] Deduced a trap composed of 43 places in 141 ms
[2020-05-12 03:20:52] [INFO ] Deduced a trap composed of 16 places in 88 ms
[2020-05-12 03:20:52] [INFO ] Deduced a trap composed of 24 places in 207 ms
[2020-05-12 03:20:52] [INFO ] Deduced a trap composed of 20 places in 143 ms
[2020-05-12 03:20:52] [INFO ] Deduced a trap composed of 22 places in 87 ms
[2020-05-12 03:20:52] [INFO ] Deduced a trap composed of 31 places in 88 ms
[2020-05-12 03:20:52] [INFO ] Deduced a trap composed of 34 places in 88 ms
[2020-05-12 03:20:52] [INFO ] Deduced a trap composed of 30 places in 102 ms
[2020-05-12 03:20:53] [INFO ] Deduced a trap composed of 29 places in 99 ms
[2020-05-12 03:20:53] [INFO ] Deduced a trap composed of 23 places in 104 ms
[2020-05-12 03:20:53] [INFO ] Deduced a trap composed of 30 places in 87 ms
[2020-05-12 03:20:53] [INFO ] Deduced a trap composed of 38 places in 127 ms
[2020-05-12 03:20:53] [INFO ] Deduced a trap composed of 32 places in 109 ms
[2020-05-12 03:20:53] [INFO ] Deduced a trap composed of 34 places in 316 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 30 places in 138 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 22 places in 117 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 43 places in 111 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 46 places in 86 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 37 places in 77 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 39 places in 53 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 35 places in 82 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 44 places in 54 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 44 places in 107 ms
[2020-05-12 03:20:55] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3569 ms
[2020-05-12 03:20:55] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 18 ms.
[2020-05-12 03:20:58] [INFO ] Added : 336 causal constraints over 68 iterations in 3942 ms. Result :sat
[2020-05-12 03:20:59] [INFO ] [Real]Absence check using 55 positive place invariants in 258 ms returned sat
[2020-05-12 03:20:59] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 143 ms returned sat
[2020-05-12 03:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:21:00] [INFO ] [Real]Absence check using state equation in 1077 ms returned sat
[2020-05-12 03:21:00] [INFO ] Deduced a trap composed of 11 places in 304 ms
[2020-05-12 03:21:01] [INFO ] Deduced a trap composed of 15 places in 224 ms
[2020-05-12 03:21:01] [INFO ] Deduced a trap composed of 132 places in 294 ms
[2020-05-12 03:21:01] [INFO ] Deduced a trap composed of 18 places in 482 ms
[2020-05-12 03:21:02] [INFO ] Deduced a trap composed of 29 places in 294 ms
[2020-05-12 03:21:02] [INFO ] Deduced a trap composed of 24 places in 391 ms
[2020-05-12 03:21:03] [INFO ] Deduced a trap composed of 120 places in 1101 ms
[2020-05-12 03:21:04] [INFO ] Deduced a trap composed of 11 places in 329 ms
[2020-05-12 03:21:04] [INFO ] Deduced a trap composed of 15 places in 312 ms
[2020-05-12 03:21:04] [INFO ] Deduced a trap composed of 21 places in 276 ms
[2020-05-12 03:21:05] [INFO ] Deduced a trap composed of 13 places in 336 ms
[2020-05-12 03:21:05] [INFO ] Deduced a trap composed of 17 places in 257 ms
[2020-05-12 03:21:05] [INFO ] Deduced a trap composed of 17 places in 391 ms
[2020-05-12 03:21:06] [INFO ] Deduced a trap composed of 120 places in 145 ms
[2020-05-12 03:21:06] [INFO ] Deduced a trap composed of 23 places in 289 ms
[2020-05-12 03:21:06] [INFO ] Deduced a trap composed of 27 places in 148 ms
[2020-05-12 03:21:06] [INFO ] Deduced a trap composed of 21 places in 295 ms
[2020-05-12 03:21:07] [INFO ] Deduced a trap composed of 22 places in 269 ms
[2020-05-12 03:21:07] [INFO ] Deduced a trap composed of 30 places in 153 ms
[2020-05-12 03:21:07] [INFO ] Deduced a trap composed of 24 places in 289 ms
[2020-05-12 03:21:07] [INFO ] Deduced a trap composed of 28 places in 127 ms
[2020-05-12 03:21:08] [INFO ] Deduced a trap composed of 105 places in 501 ms
[2020-05-12 03:21:08] [INFO ] Deduced a trap composed of 23 places in 286 ms
[2020-05-12 03:21:08] [INFO ] Deduced a trap composed of 31 places in 211 ms
[2020-05-12 03:21:09] [INFO ] Deduced a trap composed of 41 places in 182 ms
[2020-05-12 03:21:09] [INFO ] Deduced a trap composed of 104 places in 311 ms
[2020-05-12 03:21:09] [INFO ] Deduced a trap composed of 40 places in 120 ms
[2020-05-12 03:21:10] [INFO ] Deduced a trap composed of 105 places in 495 ms
[2020-05-12 03:21:10] [INFO ] Deduced a trap composed of 39 places in 465 ms
[2020-05-12 03:21:11] [INFO ] Deduced a trap composed of 112 places in 442 ms
[2020-05-12 03:21:11] [INFO ] Deduced a trap composed of 26 places in 148 ms
[2020-05-12 03:21:11] [INFO ] Deduced a trap composed of 48 places in 695 ms
[2020-05-12 03:21:12] [INFO ] Deduced a trap composed of 116 places in 152 ms
[2020-05-12 03:21:12] [INFO ] Deduced a trap composed of 21 places in 398 ms
[2020-05-12 03:21:13] [INFO ] Deduced a trap composed of 125 places in 373 ms
[2020-05-12 03:21:13] [INFO ] Deduced a trap composed of 121 places in 131 ms
[2020-05-12 03:21:13] [INFO ] Deduced a trap composed of 128 places in 170 ms
[2020-05-12 03:21:13] [INFO ] Deduced a trap composed of 131 places in 291 ms
[2020-05-12 03:21:13] [INFO ] Deduced a trap composed of 43 places in 269 ms
[2020-05-12 03:21:14] [INFO ] Deduced a trap composed of 24 places in 149 ms
[2020-05-12 03:21:14] [INFO ] Deduced a trap composed of 28 places in 266 ms
[2020-05-12 03:21:14] [INFO ] Deduced a trap composed of 120 places in 123 ms
[2020-05-12 03:21:14] [INFO ] Deduced a trap composed of 48 places in 128 ms
[2020-05-12 03:21:15] [INFO ] Deduced a trap composed of 27 places in 861 ms
[2020-05-12 03:21:15] [INFO ] Deduced a trap composed of 46 places in 271 ms
[2020-05-12 03:21:16] [INFO ] Deduced a trap composed of 46 places in 185 ms
[2020-05-12 03:21:16] [INFO ] Deduced a trap composed of 55 places in 210 ms
[2020-05-12 03:21:16] [INFO ] Deduced a trap composed of 29 places in 296 ms
[2020-05-12 03:21:16] [INFO ] Deduced a trap composed of 60 places in 155 ms
[2020-05-12 03:21:17] [INFO ] Deduced a trap composed of 32 places in 243 ms
[2020-05-12 03:21:17] [INFO ] Deduced a trap composed of 115 places in 134 ms
[2020-05-12 03:21:17] [INFO ] Deduced a trap composed of 119 places in 383 ms
[2020-05-12 03:21:17] [INFO ] Deduced a trap composed of 105 places in 224 ms
[2020-05-12 03:21:18] [INFO ] Deduced a trap composed of 35 places in 139 ms
[2020-05-12 03:21:18] [INFO ] Deduced a trap composed of 31 places in 210 ms
[2020-05-12 03:21:18] [INFO ] Deduced a trap composed of 77 places in 144 ms
[2020-05-12 03:21:18] [INFO ] Deduced a trap composed of 49 places in 142 ms
[2020-05-12 03:21:18] [INFO ] Deduced a trap composed of 27 places in 160 ms
[2020-05-12 03:21:19] [INFO ] Deduced a trap composed of 27 places in 229 ms
[2020-05-12 03:21:19] [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 s63 s303 s304 s305) 0)") while checking expression at index 19
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
[2020-05-12 03:21:20] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-12 03:21:20] [INFO ] Flatten gal took : 155 ms
FORMULA BusinessProcesses-PT-12-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 03:21:20] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 03:21:20] [INFO ] Applying decomposition
[2020-05-12 03:21:20] [INFO ] Flatten gal took : 50 ms
[2020-05-12 03:21:20] [INFO ] Input system was already deterministic with 521 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph10720095234936000941.txt, -o, /tmp/graph10720095234936000941.bin, -w, /tmp/graph10720095234936000941.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph10720095234936000941.bin, -l, -1, -v, -w, /tmp/graph10720095234936000941.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 03:21:21] [INFO ] Decomposing Gal with order
[2020-05-12 03:21:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 03:21:21] [INFO ] Removed a total of 263 redundant transitions.
[2020-05-12 03:21:21] [INFO ] Flatten gal took : 150 ms
[2020-05-12 03:21:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 22 ms.
[2020-05-12 03:21:21] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 12 ms
[2020-05-12 03:21:21] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
// Phase 1: matrix 521 rows 582 cols
[2020-05-12 03:21:21] [INFO ] Computed 98 place invariants in 26 ms
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p123 + p124 + p125 + p482 + p483 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p212 + p213 + p214 + p533 + p534 = 1
inv : p228 + p229 + p230 - p543 - p544 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p174 + p175 + p186 + p187 + p513 + p514 + p583 = 1
inv : -p105 - p106 - p107 + p108 + p109 + p110 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p351 + p352 + p353 + p354 + p355 = 1
inv : p576 + p577 + p578 + p579 - p583 - p584 - p585 = 0
inv : p0 + p1 + p243 + p411 + p412 + p413 + p414 + p415 = 1
inv : p126 + p127 + p128 - p482 - p483 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p33 + p34 + p35 + p441 + p442 = 1
inv : p66 + p67 + p68 - p455 - p456 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p306 + p307 + p308 + p309 + p310 = 1
inv : p0 + p1 + p2 + p3 + p235 + p236 + p237 + p238 = 1
inv : p176 + p177 + p178 + p179 - p513 - p514 + p578 + p579 - p583 - p584 - p585 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p346 + p347 + p348 + p349 + p350 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p296 + p297 + p298 + p299 + p300 = 1
inv : p209 + p210 + p211 - p529 - p530 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p386 + p387 + p388 + p389 + p390 = 1
inv : p203 + p204 + p205 - p525 - p526 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p142 + p143 + p144 + p145 + p146 + p147 + p154 + p155 + p254 + p256 + p257 + p341 + p342 + p344 + p345 - p351 - p352 - p354 - p355 + p356 + p357 + p359 + p360 - p361 - p362 - p364 - p365 - p502 - p503 + p506 + p507 + p578 + p579 - p581 - p582 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p218 + p219 + p220 + p221 + p222 + p539 + p540 = 1
inv : p139 + p140 + p141 - p492 - p493 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p63 + p64 + p65 + p455 + p456 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p376 + p377 + p378 + p379 + p380 = 1
inv : p0 + p1 + p2 + p3 + p4 + p231 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p331 + p332 + p333 + p334 + p335 = 1
inv : p71 + p73 + p75 + p80 + p89 + p90 - p100 - p101 + p102 + p103 + p104 + p105 - p458 - p460 - p462 - p467 + p550 + p551 - p555 - p556 - p557 + p559 + p560 - p561 - p562 - p563 + p565 + p566 - p567 - p568 - p569 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p136 + p137 + p138 + p492 + p493 = 1
inv : p548 + p549 + p550 + p551 - p555 - p556 - p557 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p286 + p287 + p288 + p289 + p290 = 1
inv : p215 + p216 + p217 - p533 - p534 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p69 + p70 + p72 + p74 + p76 + p77 + p78 + p79 + p81 + p82 + p83 + p84 + p85 + p86 + p91 + p92 + p100 + p101 + p106 + p107 + p114 + p115 + p116 - p416 - p417 - p418 - p419 - p420 - p421 - p422 - p423 - p424 - p425 - p426 - p427 - p428 - p429 - p430 - p431 - p432 - p433 - p434 - p435 - p436 - p437 - p438 - p439 - p440 - p441 - p442 - p443 - p444 - p445 - p446 - p447 - p448 - p449 - p450 - p451 - p452 - p453 - p454 - p455 - p456 - p457 - p459 - p461 - p463 - p464 - p465 - p466 - p468 - p469 - p470 - p471 - p472 - p473 - p476 - p477 - p478 - p479 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 - p522 - p523 - p524 - p525 - p526 - p527 - p528 - p529 - p530 - p531 - p532 - p533 - p534 - p535 - p536 - p537 - p538 - p539 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p550 - p551 - p559 - p560 - p565 - p566 - p573 - p574 - p575 - p583 - p584 - p585 = 0
inv : p120 + p121 + p122 - p478 - p479 = 0
inv : p576 + p580 + p581 + p582 - p583 - p584 - p585 = 0
inv : p0 + p1 + p243 + p244 + p406 + p407 + p408 + p409 + p410 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p206 + p207 + p208 + p529 + p530 = 1
inv : p570 + p571 + p572 - p573 - p574 - p575 = 0
inv : p176 + p177 + p185 - p513 - p514 - p583 = 0
inv : p71 + p75 + p77 + p86 + p96 + p105 + p106 + p107 - p109 - p110 + p114 - p458 - p462 - p464 - p473 - p555 - p567 - p573 = 0
inv : p71 + p73 + p77 + p83 + p89 + p93 + p102 - p112 - p113 + p114 + p115 + p116 - p458 - p460 - p464 - p470 + p553 + p554 - p555 - p556 - p557 - p561 - p570 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p142 + p143 + p144 + p145 + p153 + p154 + p155 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p341 + p342 + p343 + p344 + p345 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p174 + p175 + p183 + p184 + p513 + p514 - p581 - p582 + p583 + p584 + p585 = 1
inv : p191 + p192 + p193 - p517 - p518 = 0
inv : p0 + p1 + p2 + p239 + p240 + p241 + p242 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p291 + p292 + p293 + p294 + p295 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p336 + p337 + p338 + p339 + p340 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 = 1
inv : p558 + p559 + p560 - p561 - p562 - p563 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p301 + p302 + p303 + p304 + p305 = 1
inv : p548 + p552 + p553 + p554 - p555 - p556 - p557 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p200 + p201 + p202 + p525 + p526 = 1
inv : p0 + p1 + p243 + p244 + p245 + p401 + p402 + p403 + p404 + p405 = 1
inv : p36 + p37 + p38 - p441 - p442 = 0
inv : p159 + p160 + p161 - p502 - p503 = 0
inv : p0 + p87 + p88 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p555 + p556 + p557 + p561 + p562 + p563 + p567 + p568 + p569 + p573 + p574 + p575 + p583 + p584 + p585 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p316 + p317 + p318 + p319 + p320 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p57 + p58 + p59 + p451 + p452 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p381 + p382 + p383 + p384 + p385 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p174 + p175 + p180 + p181 + p513 + p514 - p578 - p579 + p583 + p584 + p585 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p356 + p357 + p358 + p359 + p360 = 1
inv : p197 + p198 + p199 - p521 - p522 = 0
inv : p165 + p166 + p167 - p506 - p507 = 0
inv : p151 + p152 - p154 - p155 + p253 - p256 - p346 - p347 - p349 - p350 + p351 + p352 + p354 + p355 + p361 + p362 + p364 + p365 - p366 - p367 - p369 - p370 - p506 - p507 + p510 + p511 + p581 + p582 - p584 - p585 = 0
inv : p134 + p135 - p488 - p489 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p162 + p163 + p164 + p506 + p507 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p194 + p195 + p196 + p521 + p522 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p156 + p157 + p158 + p502 + p503 = 1
inv : p171 + p172 + p173 - p510 - p511 = 0
inv : p0 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p555 + p556 + p557 + p561 + p562 + p563 + p567 + p568 + p569 + p573 + p574 + p575 + p583 + p584 + p585 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p366 + p367 + p368 + p369 + p370 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p391 + p392 + p393 + p394 + p395 = 1
inv : p60 + p61 + p62 - p451 - p452 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p281 + p283 + p284 + p285 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p396 + p397 + p398 + p399 + p400 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p326 + p327 + p328 + p329 + p330 = 1
inv : p27 + p28 + p31 + p32 - p432 - p433 - p436 - p437 - p438 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p276 + p277 + p278 + p279 + p280 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p371 + p372 + p373 + p374 + p375 = 1
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p69 + p70 + p72 + p74 + p75 + p76 + p78 + p79 + p80 + p81 + p82 + p84 + p85 + p86 + p94 + p95 + p103 + p104 + p105 + p106 + p107 + p112 + p113 - p416 - p417 - p418 - p419 - p420 - p421 - p422 - p423 - p424 - p425 - p426 - p427 - p428 - p429 - p430 - p431 - p432 - p433 - p434 - p435 - p436 - p437 - p438 - p439 - p440 - p441 - p442 - p443 - p444 - p445 - p446 - p447 - p448 - p449 - p450 - p451 - p452 - p453 - p454 - p455 - p456 - p457 - p459 - p461 - p462 - p463 - p465 - p466 - p467 - p468 - p469 - p471 - p472 - p473 - p476 - p477 - p478 - p479 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 - p522 - p523 - p524 - p525 - p526 - p527 - p528 - p529 - p530 - p531 - p532 - p533 - p534 - p535 - p536 - p537 - p538 - p539 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p553 - p554 - p562 - p563 - p567 - p568 - p569 + p570 - p573 - p574 - p575 - p583 - p584 - p585 = 0
inv : p176 + p177 + p178 + p182 - p513 - p514 + p581 + p582 - p583 - p584 - p585 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p117 + p118 + p119 + p478 + p479 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p129 + p130 + p131 + p132 + p133 + p488 + p489 = 1
inv : p223 + p224 - p539 - p540 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p69 + p70 + p72 + p73 + p74 + p76 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p97 + p98 + p102 + p103 + p104 + p109 + p110 + p115 + p116 - p416 - p417 - p418 - p419 - p420 - p421 - p422 - p423 - p424 - p425 - p426 - p427 - p428 - p429 - p430 - p431 - p432 - p433 - p434 - p435 - p436 - p437 - p438 - p439 - p440 - p441 - p442 - p443 - p444 - p445 - p446 - p447 - p448 - p449 - p450 - p451 - p452 - p453 - p454 - p455 - p456 - p457 - p459 - p460 - p461 - p463 - p465 - p466 - p467 - p468 - p469 - p470 - p471 - p472 - p476 - p477 - p478 - p479 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 - p522 - p523 - p524 - p525 - p526 - p527 - p528 - p529 - p530 - p531 - p532 - p533 - p534 - p535 - p536 - p537 - p538 - p539 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p556 - p557 - p561 - p562 - p563 - p568 - p569 - p574 - p575 - p583 - p584 - p585 = 0
inv : p111 + p112 + p113 - p114 - p115 - p116 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p311 + p312 + p313 + p314 + p315 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p361 + p362 + p363 + p364 + p365 = 1
inv : p564 + p565 + p566 - p567 - p568 - p569 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p321 + p322 + p323 + p324 + p325 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p168 + p169 + p170 + p510 + p511 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p142 + p143 + p144 + p145 + p146 + p150 + p154 + p155 - p253 + p256 + p346 + p347 + p349 + p350 - p351 - p352 - p354 - p355 - p361 - p362 - p364 - p365 + p366 + p367 + p369 + p370 + p506 + p507 - p510 - p511 - p581 - p582 + p584 + p585 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p29 + p30 + p432 + p433 + p436 + p437 + p438 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p225 + p226 + p227 + p543 + p544 = 1
inv : p148 + p149 - p154 - p155 - p254 - p256 - p257 - p341 - p342 - p344 - p345 + p351 + p352 + p354 + p355 - p356 - p357 - p359 - p360 + p361 + p362 + p364 + p365 + p502 + p503 - p506 - p507 - p578 - p579 + p581 + p582 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p188 + p189 + p190 + p517 + p518 = 1
inv : p99 + p100 + p101 - p102 - p103 - p104 = 0
Total of 98 invariants.
[2020-05-12 03:21:21] [INFO ] Computed 98 place invariants in 28 ms

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 11 LTL properties
Checking formula 0 : !((X((F("(i1.i3.u237.p585==1)"))&&((X(G((X(!(X(F("(i9.i4.u137.p351==1)")))))&&("(i11.i1.u114.p292==1)"))))||("(i1.i3.u237.p585==1)")))))
Formula 0 simplified : !X(F"(i1.i3.u237.p585==1)" & ("(i1.i3.u237.p585==1)" | XG("(i11.i1.u114.p292==1)" & X!XF"(i9.i4.u137.p351==1)")))
built 55 ordering constraints for composite.
built 28 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 21 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 35 ordering constraints for composite.
built 19 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 11 ordering constraints for composite.
built 20 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 22 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 73 ordering constraints for composite.
built 22 ordering constraints for composite.
built 19 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 20 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 56 ordering constraints for composite.
built 47 ordering constraints for composite.
built 25 ordering constraints for composite.
built 41 ordering constraints for composite.
[2020-05-12 03:21:22] [INFO ] Proved 582 variables to be positive in 1379 ms
[2020-05-12 03:21:22] [INFO ] Computing symmetric may disable matrix : 521 transitions.
[2020-05-12 03:21:22] [INFO ] Computation of disable matrix completed :0/521 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 03:21:22] [INFO ] Computation of Complete disable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 03:21:22] [INFO ] Computing symmetric may enable matrix : 521 transitions.
[2020-05-12 03:21:22] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 03:21:24] [INFO ] Computing symmetric co enabling matrix : 521 transitions.
[2020-05-12 03:21:26] [INFO ] Computation of co-enabling matrix(3/521) took 2466 ms. Total solver calls (SAT/UNSAT): 1052(1052/0)
[2020-05-12 03:21:32] [INFO ] Computation of co-enabling matrix(7/521) took 8210 ms. Total solver calls (SAT/UNSAT): 1690(1210/480)
[2020-05-12 03:21:35] [INFO ] Computation of co-enabling matrix(8/521) took 11384 ms. Total solver calls (SAT/UNSAT): 1962(1270/692)
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown' twice, overapproximating result to 1.
[2020-05-12 03:21:37] [INFO ] Computation of Finished co-enabling matrix. took 13360 ms. Total solver calls (SAT/UNSAT): 2037(1271/766)
[2020-05-12 03:21:37] [INFO ] Computing Do-Not-Accords matrix : 521 transitions.
[2020-05-12 03:21:41] [INFO ] Computation of Completed DNA matrix. took 4301 ms. Total solver calls (SAT/UNSAT): 3111(0/3111)
[2020-05-12 03:21:41] [INFO ] Built C files in 21385ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Reverse transition relation is NOT exact ! Due to transitions t76, t80, t264, t270, t282, t339, i0.t274, i0.u77.t281, i0.u79.t277, i1.i0.u67.t297, i1.i0.u73.t289, i1.i2.t171, i1.i2.u146.t172, i2.u24.t369, i2.u26.t365, i3.i0.t388, i3.i0.u12.t394, i3.i0.u14.t391, i3.i1.t396, i3.i1.u13.t392, i3.i2.t115, i3.i2.u168.t119, i4.t374, i4.i0.t372, i4.i0.t387, i4.i1.t377, i4.i1.t381, i4.i1.t383, i4.i1.u21.t379, i5.i0.u54.t321, i5.i0.u56.t317, i5.i2.t199, i5.i2.u132.t200, i6.i0.u75.t285, i6.i1.t155, i6.i1.u153.t156, i7.i0.t260, i7.i0.u81.t273, i7.i0.u86.t263, i7.i1.u89.t256, i7.i2.t139, i7.i2.u162.t140, i8.i1.t179, i8.i1.u142.t180, i8.i2.t175, i8.i2.u143.t176, i8.i3.t167, i8.i3.u147.t168, i8.i4.t163, i8.i4.u149.t164, i8.i5.t159, i8.i5.u151.t160, i9.i0.u61.t309, i9.i0.u63.t305, i9.i0.u65.t301, i9.i2.t195, i9.i2.u133.t196, i9.i3.t191, i9.i3.u135.t192, i9.i4.t187, i9.i4.u138.t188, i9.i5.t183, i9.i5.u140.t184, i10.i0.t325, i10.i0.u51.t327, i10.i2.t211, i10.i2.u125.t212, i10.i3.t207, i10.i3.u128.t208, i10.i4.t203, i10.i4.u130.t204, i11.i1.t235, i11.i1.u114.t236, i11.i2.t231, i11.i2.u116.t232, i11.i3.t219, i11.i3.u122.t220, i11.i4.t215, i11.i4.u123.t216, i12.i1.t250, i12.i1.u106.t251, i12.i2.t239, i12.i2.u112.t240, i13.t343, i13.i0.t247, i13.i0.u109.t248, i13.i1.t227, i13.i1.t341, i13.i1.u28.t347, i13.i1.u28.t351, i13.i1.u28.t355, i13.i1.u28.t361, i13.i1.u117.t228, i14.t223, i14.u119.t224, i15.u47.t335, i15.u49.t331, i16.i0.t267, i16.i0.u83.t269, i16.i2.t151, i16.i2.u156.t152, i16.i3.t147, i16.i3.u158.t148, i16.i4.t143, i16.i4.u160.t144, i17.t133, i17.t126, i17.t121, i17.t117, i17.t113, i17.t110, i17.t108, i17.t106, i17.t104, i17.t101, i17.t73, i17.t70, i17.t67, i17.t65, i17.t62, i17.t59, i17.t57, i17.t55, i17.t53, i17.t50, i17.t47, i17.t37, i17.t34, i17.t31, i17.t28, i17.t25, i17.t22, i17.t20, i17.t17, i17.t14, i17.u222.t12, i17.u222.t44, i17.u222.t84, i17.u222.t88, i17.u222.t92, i17.u222.t98, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/343/141/520
Computing Next relation with stutter on 1232 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2499 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,25.049,696152,1,0,1.2725e+06,880,8796,2.00725e+06,344,2601,3385030
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(("(i17.u171.p440==1)")U(G("((i16.i2.u155.p400==1)||(i0.u213.p530==1))"))))U((X(F(("(i17.u171.p440==1)")U("(i0.u213.p530==1)"))))U("(i16.i2.u155.p400==1)"))))
Formula 1 simplified : !(!("(i17.u171.p440==1)" U G"((i16.i2.u155.p400==1)||(i0.u213.p530==1))") U (XF("(i17.u171.p440==1)" U "(i0.u213.p530==1)") U "(i16.i2.u155.p400==1)"))
Computing Next relation with stutter on 1232 deadlock states
Compilation finished in 5519 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 64 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (!( ((LTLAP3==true))U([]((LTLAP4==true)))) )U((X(<>(((LTLAP3==true))U((LTLAP5==true)))))U((LTLAP6==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (!( ((LTLAP3==true))U([]((LTLAP4==true)))) )U((X(<>(((LTLAP3==true))U((LTLAP5==true)))))U((LTLAP6==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (!( ((LTLAP3==true))U([]((LTLAP4==true)))) )U((X(<>(((LTLAP3==true))U((LTLAP5==true)))))U((LTLAP6==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
122 unique states visited
122 strongly connected components in search stack
122 transitions explored
122 items max in DFS search stack
1920 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,44.2473,1025668,1,0,1.86543e+06,1030,9010,3.28708e+06,344,3310,4315367
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(F(G((F((X(F(X("(i17.u174.p446==1)"))))&&(X("(i1.i0.u67.p175==1)"))))||("(i1.i1.u235.p579==1)")))))))
Formula 2 simplified : !FXFG("(i1.i1.u235.p579==1)" | F(XFX"(i17.u174.p446==1)" & X"(i1.i0.u67.p175==1)"))
Computing Next relation with stutter on 1232 deadlock states
126 unique states visited
126 strongly connected components in search stack
127 transitions explored
126 items max in DFS search stack
5589 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,100.14,2091016,1,0,3.43942e+06,1110,9108,5.61454e+06,344,3824,6865283
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(((X("((((i2.u26.p63==1)&&(i14.u119.p308==1))&&(i17.u222.p547==1))&&(i3.i0.u14.p34==1))"))||(X(G("(i3.i0.u14.p34==1)"))))||(F("(i8.i1.u141.p365==1)")))))
Formula 3 simplified : !F(X"((((i2.u26.p63==1)&&(i14.u119.p308==1))&&(i17.u222.p547==1))&&(i3.i0.u14.p34==1))" | XG"(i3.i0.u14.p34==1)" | F"(i8.i1.u141.p365==1)")
Computing Next relation with stutter on 1232 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2900 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,129.143,2202952,1,0,3.78924e+06,1110,2870,5.80009e+06,139,3834,2120519
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!((F("(i12.i2.u111.p286==1)"))U(F(X("(i9.i3.u66.p173==1)")))))U("((i10.i0.u51.p131==1)||(i9.i0.u5.p15==1))")))
Formula 4 simplified : !(!(F"(i12.i2.u111.p286==1)" U FX"(i9.i3.u66.p173==1)") U "((i10.i0.u51.p131==1)||(i9.i0.u5.p15==1))")
Computing Next relation with stutter on 1232 deadlock states
104 unique states visited
104 strongly connected components in search stack
104 transitions explored
104 items max in DFS search stack
783 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,136.974,2202952,1,0,3.78924e+06,1110,4773,5.80009e+06,206,3834,3137139
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(!(((!(X("(i9.i3.u66.p173==1)")))&&("(i0.u80.p210==1)"))U(F("(((i0.u77.p200==1)&&(i12.i1.u106.p273==1))&&(i17.u222.p547==1))"))))))
Formula 5 simplified : !G!(("(i0.u80.p210==1)" & !X"(i9.i3.u66.p173==1)") U F"(((i0.u77.p200==1)&&(i12.i1.u106.p273==1))&&(i17.u222.p547==1))")
Computing Next relation with stutter on 1232 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
236 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,139.343,2202952,1,0,3.78924e+06,1110,4991,5.80009e+06,206,3834,3772144
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((((F(G("(((i9.i3.u66.p171==1)&&(i9.i3.u135.p349==1))&&(i9.i0.u204.p510==1))")))U(X("(i17.u165.p425==1)")))&&(X((G("(i17.u165.p425==1)"))&&("(i3.i2.u168.p432==1)")))))
Formula 6 simplified : !((FG"(((i9.i3.u66.p171==1)&&(i9.i3.u135.p349==1))&&(i9.i0.u204.p510==1))" U X"(i17.u165.p425==1)") & X("(i3.i2.u168.p432==1)" & G"(i17.u165.p425==1)"))
Computing Next relation with stutter on 1232 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
534 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,144.685,2202952,1,0,3.78924e+06,1110,5009,5.80009e+06,206,3834,4175448
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F("(i4.i0.u17.p40==1)")))
Formula 7 simplified : !F"(i4.i0.u17.p40==1)"
Computing Next relation with stutter on 1232 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
499 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,149.671,2202952,1,0,3.78924e+06,1110,5056,5.80009e+06,207,3834,4558177
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(X(G(F(!(F("(i7.i0.u2.p7==1)"))))))))
Formula 8 simplified : XGF!F"(i7.i0.u2.p7==1)"
Computing Next relation with stutter on 1232 deadlock states
125 unique states visited
125 strongly connected components in search stack
126 transitions explored
125 items max in DFS search stack
952 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,159.181,2202952,1,0,3.78924e+06,1110,5091,5.80009e+06,207,3834,4829193
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(X(!(X(F("(i9.i0.u5.p14==1)")))))))
Formula 9 simplified : X!XF"(i9.i0.u5.p14==1)"
Computing Next relation with stutter on 1232 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
174 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,160.922,2202952,1,0,3.78924e+06,1110,5105,5.80009e+06,207,3834,4908560
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F((((F((G("(i17.u221.p546==1)"))U("(i14.u44.p110!=1)")))&&("(i13.i0.u29.p102==1)"))&&("(i13.i1.u117.p304==1)"))&&("(i13.i0.u223.p552==1)"))))
Formula 10 simplified : !F("(i13.i0.u29.p102==1)" & "(i13.i0.u223.p552==1)" & "(i13.i1.u117.p304==1)" & F(G"(i17.u221.p546==1)" U "(i14.u44.p110!=1)"))
Computing Next relation with stutter on 1232 deadlock states
123 unique states visited
123 strongly connected components in search stack
123 transitions explored
123 items max in DFS search stack
65 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,161.581,2202952,1,0,3.78924e+06,1110,5166,5.80009e+06,207,3834,4965755
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-12-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589253851125

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-12, 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 r021-oct2-158897699200538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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