Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882900786.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DoubleExponent-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882900786
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 4.0K Mar 31 07:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 31 07:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 30 00:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 30 00:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:52 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:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 340K 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 DoubleExponent-PT-020-00
FORMULA_NAME DoubleExponent-PT-020-01
FORMULA_NAME DoubleExponent-PT-020-02
FORMULA_NAME DoubleExponent-PT-020-03
FORMULA_NAME DoubleExponent-PT-020-04
FORMULA_NAME DoubleExponent-PT-020-05
FORMULA_NAME DoubleExponent-PT-020-06
FORMULA_NAME DoubleExponent-PT-020-07
FORMULA_NAME DoubleExponent-PT-020-08
FORMULA_NAME DoubleExponent-PT-020-09
FORMULA_NAME DoubleExponent-PT-020-10
FORMULA_NAME DoubleExponent-PT-020-11
FORMULA_NAME DoubleExponent-PT-020-12
FORMULA_NAME DoubleExponent-PT-020-13
FORMULA_NAME DoubleExponent-PT-020-14
FORMULA_NAME DoubleExponent-PT-020-15

=== Now, execution of the tool begins

BK_START 1591240645170

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 03:17:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 03:17:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 03:17:29] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2020-06-04 03:17:29] [INFO ] Transformed 1064 places.
[2020-06-04 03:17:29] [INFO ] Transformed 998 transitions.
[2020-06-04 03:17:29] [INFO ] Parsed PT model containing 1064 places and 998 transitions in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 176 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3319 resets, run finished after 612 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 998 rows 1064 cols
[2020-06-04 03:17:31] [INFO ] Computed 104 place invariants in 530 ms
[2020-06-04 03:17:33] [INFO ] [Real]Absence check using 2 positive place invariants in 76 ms returned sat
[2020-06-04 03:17:33] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 256 ms returned sat
[2020-06-04 03:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:17:40] [INFO ] [Real]Absence check using state equation in 6558 ms returned sat
[2020-06-04 03:17:40] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 91 ms.
[2020-06-04 03:17:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:17:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 27 ms returned sat
[2020-06-04 03:17:41] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 133 ms returned sat
[2020-06-04 03:17:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:17:45] [INFO ] [Nat]Absence check using state equation in 3756 ms returned sat
[2020-06-04 03:17:45] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 48 ms.
[2020-06-04 03:17:54] [INFO ] Added : 393 causal constraints over 79 iterations in 9480 ms. Result :sat
[2020-06-04 03:17:55] [INFO ] Deduced a trap composed of 29 places in 798 ms
[2020-06-04 03:17:56] [INFO ] Deduced a trap composed of 43 places in 669 ms
[2020-06-04 03:17:57] [INFO ] Deduced a trap composed of 25 places in 687 ms
[2020-06-04 03:17:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2572 ms
[2020-06-04 03:17:57] [INFO ] [Real]Absence check using 2 positive place invariants in 21 ms returned sat
[2020-06-04 03:17:57] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 131 ms returned sat
[2020-06-04 03:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:18:00] [INFO ] [Real]Absence check using state equation in 3064 ms returned sat
[2020-06-04 03:18:01] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 90 ms.
[2020-06-04 03:18:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:18:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 17 ms returned sat
[2020-06-04 03:18:01] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 132 ms returned sat
[2020-06-04 03:18:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:18:04] [INFO ] [Nat]Absence check using state equation in 3199 ms returned sat
[2020-06-04 03:18:05] [INFO ] Deduced a trap composed of 209 places in 329 ms
[2020-06-04 03:18:05] [INFO ] Deduced a trap composed of 281 places in 312 ms
[2020-06-04 03:18:05] [INFO ] Deduced a trap composed of 197 places in 342 ms
[2020-06-04 03:18:06] [INFO ] Deduced a trap composed of 187 places in 308 ms
[2020-06-04 03:18:06] [INFO ] Deduced a trap composed of 205 places in 339 ms
[2020-06-04 03:18:07] [INFO ] Deduced a trap composed of 163 places in 378 ms
[2020-06-04 03:18:08] [INFO ] Deduced a trap composed of 149 places in 367 ms
[2020-06-04 03:18:08] [INFO ] Deduced a trap composed of 151 places in 333 ms
[2020-06-04 03:18:08] [INFO ] Deduced a trap composed of 137 places in 310 ms
[2020-06-04 03:18:09] [INFO ] Deduced a trap composed of 139 places in 291 ms
[2020-06-04 03:18:09] [INFO ] Deduced a trap composed of 179 places in 304 ms
[2020-06-04 03:18:09] [INFO ] Deduced a trap composed of 175 places in 323 ms
[2020-06-04 03:18:10] [INFO ] Deduced a trap composed of 173 places in 292 ms
[2020-06-04 03:18:11] [INFO ] Deduced a trap composed of 113 places in 427 ms
[2020-06-04 03:18:11] [INFO ] Deduced a trap composed of 211 places in 397 ms
[2020-06-04 03:18:12] [INFO ] Deduced a trap composed of 187 places in 419 ms
[2020-06-04 03:18:12] [INFO ] Deduced a trap composed of 115 places in 391 ms
[2020-06-04 03:18:13] [INFO ] Deduced a trap composed of 103 places in 388 ms
[2020-06-04 03:18:13] [INFO ] Deduced a trap composed of 101 places in 387 ms
[2020-06-04 03:18:14] [INFO ] Deduced a trap composed of 89 places in 428 ms
[2020-06-04 03:18:14] [INFO ] Deduced a trap composed of 205 places in 434 ms
[2020-06-04 03:18:15] [INFO ] Deduced a trap composed of 77 places in 419 ms
[2020-06-04 03:18:15] [INFO ] Deduced a trap composed of 79 places in 443 ms
[2020-06-04 03:18:16] [INFO ] Deduced a trap composed of 65 places in 459 ms
[2020-06-04 03:18:16] [INFO ] Deduced a trap composed of 67 places in 463 ms
[2020-06-04 03:18:17] [INFO ] Deduced a trap composed of 53 places in 472 ms
[2020-06-04 03:18:17] [INFO ] Deduced a trap composed of 55 places in 475 ms
[2020-06-04 03:18:18] [INFO ] Deduced a trap composed of 41 places in 437 ms
[2020-06-04 03:18:18] [INFO ] Deduced a trap composed of 43 places in 587 ms
[2020-06-04 03:18:19] [INFO ] Deduced a trap composed of 202 places in 440 ms
[2020-06-04 03:18:19] [INFO ] Deduced a trap composed of 91 places in 427 ms
[2020-06-04 03:18:20] [INFO ] Deduced a trap composed of 127 places in 392 ms
[2020-06-04 03:18:20] [INFO ] Deduced a trap composed of 188 places in 348 ms
[2020-06-04 03:18:21] [INFO ] Deduced a trap composed of 167 places in 330 ms
[2020-06-04 03:18:21] [INFO ] Deduced a trap composed of 125 places in 357 ms
[2020-06-04 03:18:21] [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 s82 s83 s84 s85 s86 s87 s89 s90 s91 s92 s93 s94 s110 s121 s132 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s154 s165 s176 s177 s188 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s221 s232 s258 s259 s260 s261 s262 s263 s264 s266 s267 s268 s269 s270 s287 s317 s318 s319 s320 s322 s323 s324 s325 s326 s327 s328 s329 s375 s377 s378 s379 s380 s381 s382 s383 s384 s385 s386 s388 s398 s435 s436 s437 s438 s439 s440 s488 s496 s497 s499 s500 s501 s506 s507 s508 s509 s511 s513 s514 s595 s596 s597 s599 s620 s632 s643 s654 s665 s676 s687 s698 s709 s720 s731 s732 s743 s754) 0)") while checking expression at index 1
[2020-06-04 03:18:21] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:18:21] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 94 ms returned sat
[2020-06-04 03:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:18:24] [INFO ] [Real]Absence check using state equation in 2467 ms returned sat
[2020-06-04 03:18:24] [INFO ] Deduced a trap composed of 43 places in 658 ms
[2020-06-04 03:18:25] [INFO ] Deduced a trap composed of 41 places in 629 ms
[2020-06-04 03:18:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1421 ms
[2020-06-04 03:18:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:18:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:18:26] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 148 ms returned sat
[2020-06-04 03:18:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:18:28] [INFO ] [Nat]Absence check using state equation in 2654 ms returned sat
[2020-06-04 03:18:29] [INFO ] Deduced a trap composed of 43 places in 596 ms
[2020-06-04 03:18:30] [INFO ] Deduced a trap composed of 41 places in 646 ms
[2020-06-04 03:18:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1355 ms
[2020-06-04 03:18:30] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 65 ms.
[2020-06-04 03:18:36] [INFO ] Added : 184 causal constraints over 37 iterations in 6863 ms. Result :sat
[2020-06-04 03:18:37] [INFO ] Deduced a trap composed of 24 places in 711 ms
[2020-06-04 03:18:38] [INFO ] Deduced a trap composed of 25 places in 707 ms
[2020-06-04 03:18:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1640 ms
[2020-06-04 03:18:38] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2020-06-04 03:18:38] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 140 ms returned sat
[2020-06-04 03:18:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:18:41] [INFO ] [Real]Absence check using state equation in 2933 ms returned sat
[2020-06-04 03:18:42] [INFO ] Deduced a trap composed of 395 places in 748 ms
[2020-06-04 03:18:43] [INFO ] Deduced a trap composed of 402 places in 726 ms
[2020-06-04 03:18:44] [INFO ] Deduced a trap composed of 394 places in 676 ms
[2020-06-04 03:18:45] [INFO ] Deduced a trap composed of 65 places in 686 ms
[2020-06-04 03:18:46] [INFO ] Deduced a trap composed of 391 places in 726 ms
[2020-06-04 03:18:47] [INFO ] Deduced a trap composed of 422 places in 678 ms
[2020-06-04 03:18:47] [INFO ] Deduced a trap composed of 417 places in 698 ms
[2020-06-04 03:18:48] [INFO ] Deduced a trap composed of 388 places in 653 ms
[2020-06-04 03:18:49] [INFO ] Deduced a trap composed of 367 places in 661 ms
[2020-06-04 03:18:49] [INFO ] Deduced a trap composed of 393 places in 716 ms
[2020-06-04 03:18:50] [INFO ] Deduced a trap composed of 409 places in 624 ms
[2020-06-04 03:18:51] [INFO ] Deduced a trap composed of 382 places in 480 ms
[2020-06-04 03:18:51] [INFO ] Deduced a trap composed of 381 places in 667 ms
[2020-06-04 03:18:52] [INFO ] Deduced a trap composed of 425 places in 635 ms
[2020-06-04 03:18:53] [INFO ] Deduced a trap composed of 408 places in 537 ms
[2020-06-04 03:18:53] [INFO ] Deduced a trap composed of 394 places in 530 ms
[2020-06-04 03:18:54] [INFO ] Deduced a trap composed of 405 places in 563 ms
[2020-06-04 03:18:54] [INFO ] Deduced a trap composed of 379 places in 522 ms
[2020-06-04 03:18:55] [INFO ] Deduced a trap composed of 406 places in 531 ms
[2020-06-04 03:18:56] [INFO ] Deduced a trap composed of 414 places in 516 ms
[2020-06-04 03:18:56] [INFO ] Deduced a trap composed of 381 places in 500 ms
[2020-06-04 03:18:57] [INFO ] Deduced a trap composed of 397 places in 551 ms
[2020-06-04 03:18:57] [INFO ] Deduced a trap composed of 399 places in 561 ms
[2020-06-04 03:18:58] [INFO ] Deduced a trap composed of 415 places in 613 ms
[2020-06-04 03:18:59] [INFO ] Deduced a trap composed of 407 places in 598 ms
[2020-06-04 03:18:59] [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 s9 s10 s11 s12 s19 s20 s21 s22 s23 s29 s30 s31 s44 s49 s57 s58 s60 s61 s62 s63 s64 s65 s66 s67 s68 s70 s71 s74 s77 s79 s82 s83 s92 s93 s94 s107 s110 s114 s115 s116 s117 s118 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s132 s133 s137 s140 s141 s143 s150 s151 s152 s166 s172 s173 s174 s175 s176 s178 s180 s181 s182 s190 s191 s192 s196 s200 s201 s209 s210 s211 s212 s221 s225 s231 s232 s233 s234 s235 s236 s238 s239 s240 s248 s249 s250 s258 s259 s260 s261 s262 s263 s264 s266 s267 s268 s269 s270 s283 s287 s297 s298 s299 s300 s307 s308 s309 s310 s314 s317 s318 s321 s327 s328 s329 s332 s342 s343 s349 s350 s351 s352 s353 s354 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s372 s375 s377 s385 s388 s398 s402 s403 s404 s405 s406 s407 s408 s409 s411 s412 s413 s415 s416 s417 s425 s426 s427 s431 s435 s436 s445 s447 s460 s461 s462 s463 s464 s466 s467 s468 s469 s470 s471 s473 s474 s475 s483 s485 s491 s493 s494 s495 s496 s503 s504 s505 s509 s513 s514 s515 s516 s517 s519 s533 s534 s535 s542 s545 s549 s552 s553 s562 s563 s564 s578 s584 s585 s586 s588 s589 s591 s592 s593 s594 s595 s601 s602 s603 s604 s607 s611 s612 s620 s622 s624 s632 s637 s638 s639 s640 s641 s643 s644 s645 s650 s651 s652 s654 s660 s661 s662 s663 s665 s667 s670 s671 s676 s680 s681 s682 s687 s695 s698 s700 s703 s708 s709 s711 s718 s720 s721 s728 s729 s730 s731 s732 s733 s734 s735 s736 s737 s738 s739 s740 s741 s754 s755 s768 s769 s770 s778 s779 s780 s784 s788 s789 s797 s799 s800 s813 s819 s821 s822 s823 s824 s826 s827 s828 s829 s830 s832 s833 s834 s835 s836 s837 s838 s840 s845 s847 s848 s849 s850 s857 s858 s859 s863 s867 s872 s885 s886 s887 s888 s895 s896 s897 s898 s899 s902 s905 s906 s909 s915 s916 s917 s920 s930 s931 s935 s938 s942 s944 s945 s946 s947 s948 s954 s955 s956 s957 s958 s961 s964 s965 s966 s974 s975 s976 s977 s987 s990 s994 s997 s998 s1003 s1004 s1005 s1013 s1014 s1015 s1016 s1020 s1023 s1024 s1025 s1026 s1027 s1031 s1033 s1035 s1042 s1048 s1049 s1050 s1051 s1052 s1053 s1055 s1056 s1061 s1062 s1063) 0)") while checking expression at index 3
[2020-06-04 03:18:59] [INFO ] [Real]Absence check using 2 positive place invariants in 24 ms returned sat
[2020-06-04 03:18:59] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 136 ms returned sat
[2020-06-04 03:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:19:01] [INFO ] [Real]Absence check using state equation in 2583 ms returned sat
[2020-06-04 03:19:02] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 98 ms.
[2020-06-04 03:19:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:19:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:19:02] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 129 ms returned sat
[2020-06-04 03:19:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:19:05] [INFO ] [Nat]Absence check using state equation in 2536 ms returned sat
[2020-06-04 03:19:05] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 74 ms.
[2020-06-04 03:19:11] [INFO ] Added : 276 causal constraints over 56 iterations in 6543 ms. Result :sat
[2020-06-04 03:19:12] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:19:12] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 133 ms returned sat
[2020-06-04 03:19:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:19:14] [INFO ] [Real]Absence check using state equation in 2734 ms returned sat
[2020-06-04 03:19:15] [INFO ] Deduced a trap composed of 361 places in 615 ms
[2020-06-04 03:19:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 912 ms
[2020-06-04 03:19:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:19:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:19:16] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 128 ms returned sat
[2020-06-04 03:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:19:18] [INFO ] [Nat]Absence check using state equation in 2654 ms returned sat
[2020-06-04 03:19:19] [INFO ] Deduced a trap composed of 361 places in 686 ms
[2020-06-04 03:19:20] [INFO ] Deduced a trap composed of 127 places in 499 ms
[2020-06-04 03:19:20] [INFO ] Deduced a trap composed of 333 places in 432 ms
[2020-06-04 03:19:21] [INFO ] Deduced a trap composed of 113 places in 467 ms
[2020-06-04 03:19:21] [INFO ] Deduced a trap composed of 115 places in 472 ms
[2020-06-04 03:19:22] [INFO ] Deduced a trap composed of 397 places in 676 ms
[2020-06-04 03:19:23] [INFO ] Deduced a trap composed of 385 places in 543 ms
[2020-06-04 03:19:23] [INFO ] Deduced a trap composed of 89 places in 483 ms
[2020-06-04 03:19:24] [INFO ] Deduced a trap composed of 142 places in 454 ms
[2020-06-04 03:19:25] [INFO ] Deduced a trap composed of 103 places in 523 ms
[2020-06-04 03:19:25] [INFO ] Deduced a trap composed of 101 places in 440 ms
[2020-06-04 03:19:26] [INFO ] Deduced a trap composed of 91 places in 389 ms
[2020-06-04 03:19:26] [INFO ] Deduced a trap composed of 79 places in 557 ms
[2020-06-04 03:19:27] [INFO ] Deduced a trap composed of 298 places in 384 ms
[2020-06-04 03:19:27] [INFO ] Deduced a trap composed of 77 places in 423 ms
[2020-06-04 03:19:28] [INFO ] Deduced a trap composed of 65 places in 556 ms
[2020-06-04 03:19:28] [INFO ] Deduced a trap composed of 67 places in 559 ms
[2020-06-04 03:19:29] [INFO ] Deduced a trap composed of 53 places in 562 ms
[2020-06-04 03:19:30] [INFO ] Deduced a trap composed of 55 places in 453 ms
[2020-06-04 03:19:30] [INFO ] Deduced a trap composed of 41 places in 559 ms
[2020-06-04 03:19:31] [INFO ] Deduced a trap composed of 43 places in 421 ms
[2020-06-04 03:19:31] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 12554 ms
[2020-06-04 03:19:31] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 69 ms.
[2020-06-04 03:19:35] [INFO ] Added : 220 causal constraints over 44 iterations in 4542 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 03:19:36] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:19:36] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 132 ms returned sat
[2020-06-04 03:19:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:19:38] [INFO ] [Real]Absence check using state equation in 2625 ms returned sat
[2020-06-04 03:19:39] [INFO ] Deduced a trap composed of 388 places in 658 ms
[2020-06-04 03:19:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 956 ms
[2020-06-04 03:19:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:19:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:19:40] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 140 ms returned sat
[2020-06-04 03:19:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:19:43] [INFO ] [Nat]Absence check using state equation in 2876 ms returned sat
[2020-06-04 03:19:43] [INFO ] Deduced a trap composed of 388 places in 716 ms
[2020-06-04 03:19:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1056 ms
[2020-06-04 03:19:44] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 76 ms.
[2020-06-04 03:19:48] [INFO ] Added : 198 causal constraints over 40 iterations in 4385 ms. Result :sat
[2020-06-04 03:19:48] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:19:48] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 130 ms returned sat
[2020-06-04 03:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:19:51] [INFO ] [Real]Absence check using state equation in 3102 ms returned sat
[2020-06-04 03:19:52] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 72 ms.
[2020-06-04 03:19:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:19:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:19:52] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 122 ms returned sat
[2020-06-04 03:19:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:19:55] [INFO ] [Nat]Absence check using state equation in 3252 ms returned sat
[2020-06-04 03:19:56] [INFO ] Deduced a trap composed of 137 places in 333 ms
[2020-06-04 03:19:56] [INFO ] Deduced a trap composed of 139 places in 389 ms
[2020-06-04 03:19:56] [INFO ] Deduced a trap composed of 151 places in 306 ms
[2020-06-04 03:19:57] [INFO ] Deduced a trap composed of 149 places in 363 ms
[2020-06-04 03:19:57] [INFO ] Deduced a trap composed of 204 places in 413 ms
[2020-06-04 03:19:58] [INFO ] Deduced a trap composed of 115 places in 419 ms
[2020-06-04 03:19:58] [INFO ] Deduced a trap composed of 101 places in 412 ms
[2020-06-04 03:19:59] [INFO ] Deduced a trap composed of 233 places in 428 ms
[2020-06-04 03:19:59] [INFO ] Deduced a trap composed of 89 places in 446 ms
[2020-06-04 03:20:00] [INFO ] Deduced a trap composed of 91 places in 438 ms
[2020-06-04 03:20:00] [INFO ] Deduced a trap composed of 77 places in 351 ms
[2020-06-04 03:20:01] [INFO ] Deduced a trap composed of 79 places in 375 ms
[2020-06-04 03:20:01] [INFO ] Deduced a trap composed of 65 places in 374 ms
[2020-06-04 03:20:02] [INFO ] Deduced a trap composed of 67 places in 385 ms
[2020-06-04 03:20:02] [INFO ] Deduced a trap composed of 53 places in 380 ms
[2020-06-04 03:20:02] [INFO ] Deduced a trap composed of 55 places in 373 ms
[2020-06-04 03:20:03] [INFO ] Deduced a trap composed of 41 places in 360 ms
[2020-06-04 03:20:03] [INFO ] Deduced a trap composed of 43 places in 348 ms
[2020-06-04 03:20:04] [INFO ] Deduced a trap composed of 203 places in 346 ms
[2020-06-04 03:20:04] [INFO ] Deduced a trap composed of 173 places in 292 ms
[2020-06-04 03:20:04] [INFO ] Deduced a trap composed of 193 places in 313 ms
[2020-06-04 03:20:05] [INFO ] Deduced a trap composed of 120 places in 352 ms
[2020-06-04 03:20:05] [INFO ] Deduced a trap composed of 257 places in 363 ms
[2020-06-04 03:20:06] [INFO ] Deduced a trap composed of 197 places in 356 ms
[2020-06-04 03:20:06] [INFO ] Deduced a trap composed of 195 places in 326 ms
[2020-06-04 03:20:06] [INFO ] Deduced a trap composed of 185 places in 286 ms
[2020-06-04 03:20:07] [INFO ] Deduced a trap composed of 285 places in 417 ms
[2020-06-04 03:20:07] [INFO ] Deduced a trap composed of 125 places in 312 ms
[2020-06-04 03:20:08] [INFO ] Deduced a trap composed of 103 places in 494 ms
[2020-06-04 03:20:09] [INFO ] Deduced a trap composed of 211 places in 318 ms
[2020-06-04 03:20:09] [INFO ] Deduced a trap composed of 216 places in 424 ms
[2020-06-04 03:20:09] [INFO ] Deduced a trap composed of 275 places in 432 ms
[2020-06-04 03:20:10] [INFO ] Deduced a trap composed of 187 places in 414 ms
[2020-06-04 03:20:11] [INFO ] Deduced a trap composed of 219 places in 428 ms
[2020-06-04 03:20:11] [INFO ] Deduced a trap composed of 205 places in 404 ms
[2020-06-04 03:20:12] [INFO ] Deduced a trap composed of 213 places in 456 ms
[2020-06-04 03:20:12] [INFO ] Deduced a trap composed of 127 places in 390 ms
[2020-06-04 03:20:12] [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 s82 s83 s84 s85 s86 s87 s89 s90 s91 s92 s93 s94 s110 s121 s132 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s154 s165 s176 s177 s188 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s221 s232 s258 s259 s260 s261 s262 s263 s264 s266 s267 s268 s269 s270 s287 s317 s318 s319 s320 s322 s323 s324 s325 s326 s327 s328 s329 s375 s377 s378 s379 s380 s381 s382 s383 s384 s385 s386 s388 s398 s435 s436 s437 s438 s439 s440 s441 s489 s509 s513 s514 s515 s516 s517 s526 s527 s528 s529 s530 s534 s535 s536 s537 s538 s539 s620 s632 s643 s654 s665 s676 s687 s698 s709 s720 s731 s732 s743 s754) 0)") while checking expression at index 7
[2020-06-04 03:20:12] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:20:12] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 123 ms returned sat
[2020-06-04 03:20:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:20:15] [INFO ] [Real]Absence check using state equation in 2967 ms returned sat
[2020-06-04 03:20:16] [INFO ] Deduced a trap composed of 385 places in 492 ms
[2020-06-04 03:20:17] [INFO ] Deduced a trap composed of 363 places in 514 ms
[2020-06-04 03:20:17] [INFO ] Deduced a trap composed of 393 places in 590 ms
[2020-06-04 03:20:18] [INFO ] Deduced a trap composed of 55 places in 469 ms
[2020-06-04 03:20:18] [INFO ] Deduced a trap composed of 377 places in 459 ms
[2020-06-04 03:20:19] [INFO ] Deduced a trap composed of 365 places in 691 ms
[2020-06-04 03:20:20] [INFO ] Deduced a trap composed of 403 places in 690 ms
[2020-06-04 03:20:21] [INFO ] Deduced a trap composed of 382 places in 673 ms
[2020-06-04 03:20:21] [INFO ] Deduced a trap composed of 405 places in 638 ms
[2020-06-04 03:20:22] [INFO ] Deduced a trap composed of 59 places in 531 ms
[2020-06-04 03:20:22] [INFO ] Deduced a trap composed of 386 places in 429 ms
[2020-06-04 03:20:23] [INFO ] Deduced a trap composed of 374 places in 428 ms
[2020-06-04 03:20:23] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 7575 ms
[2020-06-04 03:20:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:20:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned sat
[2020-06-04 03:20:23] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 105 ms returned sat
[2020-06-04 03:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:20:27] [INFO ] [Nat]Absence check using state equation in 3190 ms returned sat
[2020-06-04 03:20:27] [INFO ] Deduced a trap composed of 385 places in 730 ms
[2020-06-04 03:20:28] [INFO ] Deduced a trap composed of 373 places in 743 ms
[2020-06-04 03:20:29] [INFO ] Deduced a trap composed of 41 places in 614 ms
[2020-06-04 03:20:30] [INFO ] Deduced a trap composed of 43 places in 564 ms
[2020-06-04 03:20:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3234 ms
[2020-06-04 03:20:30] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 70 ms.
[2020-06-04 03:20:37] [INFO ] Added : 261 causal constraints over 53 iterations in 7027 ms. Result :sat
[2020-06-04 03:20:37] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:20:37] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 132 ms returned sat
[2020-06-04 03:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:20:40] [INFO ] [Real]Absence check using state equation in 2614 ms returned sat
[2020-06-04 03:20:41] [INFO ] Deduced a trap composed of 377 places in 639 ms
[2020-06-04 03:20:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1229 ms
[2020-06-04 03:20:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:20:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 17 ms returned sat
[2020-06-04 03:20:41] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 130 ms returned sat
[2020-06-04 03:20:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:20:44] [INFO ] [Nat]Absence check using state equation in 2874 ms returned sat
[2020-06-04 03:20:45] [INFO ] Deduced a trap composed of 377 places in 646 ms
[2020-06-04 03:20:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1108 ms
[2020-06-04 03:20:45] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 71 ms.
[2020-06-04 03:20:51] [INFO ] Added : 283 causal constraints over 57 iterations in 5443 ms. Result :sat
[2020-06-04 03:20:52] [INFO ] Deduced a trap composed of 25 places in 737 ms
[2020-06-04 03:20:52] [INFO ] Deduced a trap composed of 41 places in 720 ms
[2020-06-04 03:20:53] [INFO ] Deduced a trap composed of 424 places in 584 ms
[2020-06-04 03:20:54] [INFO ] Deduced a trap composed of 405 places in 600 ms
[2020-06-04 03:20:54] [INFO ] Deduced a trap composed of 390 places in 555 ms
[2020-06-04 03:20:55] [INFO ] Deduced a trap composed of 394 places in 598 ms
[2020-06-04 03:20:56] [INFO ] Deduced a trap composed of 385 places in 735 ms
[2020-06-04 03:20:57] [INFO ] Deduced a trap composed of 414 places in 972 ms
[2020-06-04 03:20:58] [INFO ] Deduced a trap composed of 410 places in 996 ms
[2020-06-04 03:20:59] [INFO ] Deduced a trap composed of 420 places in 998 ms
[2020-06-04 03:21:00] [INFO ] Deduced a trap composed of 441 places in 1036 ms
[2020-06-04 03:21:02] [INFO ] Deduced a trap composed of 408 places in 1057 ms
[2020-06-04 03:21: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 s9 s11 s19 s20 s21 s22 s23 s29 s30 s31 s44 s58 s60 s67 s70 s71 s75 s80 s81 s82 s83 s84 s85 s92 s94 s102 s103 s107 s108 s109 s110 s111 s112 s114 s115 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s132 s133 s138 s140 s141 s142 s143 s144 s150 s151 s152 s154 s159 s160 s161 s162 s163 s165 s166 s176 s177 s180 s181 s182 s183 s184 s188 s190 s192 s194 s199 s200 s201 s202 s203 s204 s205 s206 s207 s209 s210 s212 s213 s214 s215 s216 s218 s219 s221 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s238 s239 s240 s241 s242 s248 s249 s250 s255 s257 s258 s259 s268 s270 s283 s284 s285 s286 s287 s289 s290 s291 s292 s293 s297 s298 s300 s301 s302 s303 s304 s305 s307 s309 s313 s314 s316 s317 s318 s327 s329 s336 s337 s338 s340 s342 s344 s345 s346 s347 s348 s349 s350 s351 s353 s356 s357 s358 s362 s366 s368 s372 s375 s377 s385 s386 s388 s398 s402 s408 s409 s411 s412 s413 s415 s416 s417 s425 s427 s429 s433 s435 s436 s437 s438 s445 s446 s447 s451 s455 s460 s473 s474 s475 s483 s484 s485 s493 s494 s495 s496 s497 s503 s504 s505 s509 s519 s533 s534 s535 s536 s537 s542 s544 s545 s546 s549 s552 s553 s562 s564 s578 s579 s580 s581 s582 s584 s585 s591 s592 s593 s594 s595 s596 s597 s599 s600 s601 s602 s603 s605 s608 s611 s612 s613 s614 s620 s622 s623 s624 s628 s631 s632 s637 s643 s650 s652 s654 s660 s662 s663 s665 s667 s670 s671 s676 s680 s681 s682 s695 s700 s703 s708 s710 s711 s712 s713 s718 s719 s721 s722 s725 s728 s729 s731 s739 s740 s741 s754 s755 s759 s762 s768 s769 s770 s778 s779 s780 s784 s788 s789 s797 s799 s800 s813 s819 s821 s822 s823 s824 s826 s827 s828 s836 s837 s838 s839 s844 s847 s848 s857 s859 s872 s873 s874 s875 s877 s879 s880 s885 s886 s888 s895 s896 s897 s898 s905 s906 s907 s908 s909 s910 s915 s916 s917 s920 s930 s931 s942 s944 s946 s954 s955 s957 s958 s961 s964 s965 s966 s974 s976 s977 s987 s990 s991 s992 s993 s994 s996 s997 s998 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1019 s1020 s1023 s1024 s1033 s1035 s1048 s1049 s1050 s1051 s1052 s1055 s1056 s1061 s1063) 0)") while checking expression at index 9
[2020-06-04 03:21:02] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:21:02] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 133 ms returned sat
[2020-06-04 03:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:21:05] [INFO ] [Real]Absence check using state equation in 2681 ms returned sat
[2020-06-04 03:21:06] [INFO ] Deduced a trap composed of 392 places in 1110 ms
[2020-06-04 03:21:07] [INFO ] Deduced a trap composed of 399 places in 1623 ms
[2020-06-04 03:21:08] [INFO ] Deduced a trap composed of 103 places in 893 ms
[2020-06-04 03:21:09] [INFO ] Deduced a trap composed of 101 places in 738 ms
[2020-06-04 03:21:11] [INFO ] Deduced a trap composed of 349 places in 1410 ms
[2020-06-04 03:21:12] [INFO ] Deduced a trap composed of 367 places in 805 ms
[2020-06-04 03:21:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 7142 ms
[2020-06-04 03:21:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:21:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 51 ms returned sat
[2020-06-04 03:21:12] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 241 ms returned sat
[2020-06-04 03:21:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:21:18] [INFO ] [Nat]Absence check using state equation in 5415 ms returned sat
[2020-06-04 03:21:18] [INFO ] Deduced a trap composed of 392 places in 646 ms
[2020-06-04 03:21:19] [INFO ] Deduced a trap composed of 41 places in 645 ms
[2020-06-04 03:21:20] [INFO ] Deduced a trap composed of 101 places in 678 ms
[2020-06-04 03:21:21] [INFO ] Deduced a trap composed of 379 places in 660 ms
[2020-06-04 03:21:21] [INFO ] Deduced a trap composed of 89 places in 585 ms
[2020-06-04 03:21:22] [INFO ] Deduced a trap composed of 393 places in 553 ms
[2020-06-04 03:21:23] [INFO ] Deduced a trap composed of 91 places in 637 ms
[2020-06-04 03:21:23] [INFO ] Deduced a trap composed of 394 places in 626 ms
[2020-06-04 03:21:24] [INFO ] Deduced a trap composed of 79 places in 508 ms
[2020-06-04 03:21:25] [INFO ] Deduced a trap composed of 103 places in 500 ms
[2020-06-04 03:21:25] [INFO ] Deduced a trap composed of 77 places in 452 ms
[2020-06-04 03:21:26] [INFO ] Deduced a trap composed of 65 places in 683 ms
[2020-06-04 03:21:27] [INFO ] Deduced a trap composed of 67 places in 1042 ms
[2020-06-04 03:21:28] [INFO ] Deduced a trap composed of 53 places in 946 ms
[2020-06-04 03:21:29] [INFO ] Deduced a trap composed of 55 places in 1053 ms
[2020-06-04 03:21:30] [INFO ] Deduced a trap composed of 43 places in 965 ms
[2020-06-04 03:21:30] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 12784 ms
[2020-06-04 03:21:30] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 66 ms.
[2020-06-04 03:21:32] [INFO ] Added : 45 causal constraints over 9 iterations in 1359 ms. Result :unknown
[2020-06-04 03:21:32] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:21:32] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 129 ms returned sat
[2020-06-04 03:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:21:35] [INFO ] [Real]Absence check using state equation in 2835 ms returned sat
[2020-06-04 03:21:35] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 105 ms.
[2020-06-04 03:21:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:21:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:21:36] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 131 ms returned sat
[2020-06-04 03:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:21:39] [INFO ] [Nat]Absence check using state equation in 3331 ms returned sat
[2020-06-04 03:21:39] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 81 ms.
[2020-06-04 03:21:55] [INFO ] Added : 550 causal constraints over 110 iterations in 16268 ms. Result :unknown
[2020-06-04 03:21:55] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:21:56] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 135 ms returned sat
[2020-06-04 03:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:21:59] [INFO ] [Real]Absence check using state equation in 2960 ms returned sat
[2020-06-04 03:21:59] [INFO ] Deduced a trap composed of 67 places in 545 ms
[2020-06-04 03:22:00] [INFO ] Deduced a trap composed of 65 places in 492 ms
[2020-06-04 03:22:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1215 ms
[2020-06-04 03:22:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:22:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:22:00] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 132 ms returned sat
[2020-06-04 03:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:22:03] [INFO ] [Nat]Absence check using state equation in 2883 ms returned sat
[2020-06-04 03:22:04] [INFO ] Deduced a trap composed of 67 places in 579 ms
[2020-06-04 03:22:04] [INFO ] Deduced a trap composed of 65 places in 547 ms
[2020-06-04 03:22:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1341 ms
[2020-06-04 03:22:04] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 78 ms.
[2020-06-04 03:22:18] [INFO ] Added : 495 causal constraints over 99 iterations in 13244 ms. Result :sat
[2020-06-04 03:22:18] [INFO ] Deduced a trap composed of 433 places in 647 ms
[2020-06-04 03:22:19] [INFO ] Deduced a trap composed of 409 places in 647 ms
[2020-06-04 03:22:20] [INFO ] Deduced a trap composed of 425 places in 654 ms
[2020-06-04 03:22: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 s2 s9 s11 s17 s19 s20 s21 s22 s24 s29 s30 s31 s35 s38 s39 s40 s41 s42 s44 s46 s57 s58 s59 s60 s67 s68 s70 s74 s77 s79 s81 s82 s83 s88 s92 s93 s94 s107 s110 s115 s116 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s132 s133 s138 s140 s141 s142 s143 s144 s150 s151 s152 s159 s160 s161 s162 s163 s166 s176 s180 s181 s182 s190 s191 s192 s196 s200 s201 s209 s210 s211 s212 s221 s225 s231 s232 s233 s234 s235 s236 s238 s239 s240 s241 s242 s248 s249 s250 s255 s258 s259 s268 s269 s270 s283 s287 s291 s292 s293 s294 s295 s297 s298 s300 s307 s308 s309 s310 s315 s317 s318 s319 s320 s321 s327 s329 s336 s337 s338 s339 s340 s342 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s356 s357 s358 s365 s366 s367 s368 s373 s374 s375 s377 s378 s379 s385 s388 s395 s396 s398 s402 s403 s404 s405 s406 s407 s408 s409 s411 s415 s416 s417 s418 s419 s422 s423 s424 s425 s427 s435 s436 s437 s438 s439 s445 s446 s447 s460 s473 s474 s475 s477 s478 s483 s485 s486 s488 s491 s493 s494 s495 s496 s498 s503 s505 s509 s511 s514 s519 s520 s521 s522 s523 s524 s526 s527 s532 s533 s534 s535 s536 s537 s538 s539 s540 s541 s542 s543 s544 s545 s546 s549 s552 s553 s554 s562 s564 s578 s579 s580 s581 s582 s584 s585 s591 s593 s594 s595 s601 s603 s608 s611 s612 s613 s614 s620 s621 s622 s623 s624 s630 s631 s632 s633 s634 s635 s636 s637 s643 s650 s652 s654 s660 s662 s664 s665 s668 s670 s671 s672 s673 s676 s680 s681 s682 s686 s687 s690 s695 s698 s708 s709 s710 s711 s712 s713 s718 s719 s720 s721 s725 s728 s729 s731 s732 s739 s740 s741 s754 s755 s761 s762 s763 s764 s766 s768 s769 s770 s771 s772 s778 s779 s780 s781 s784 s788 s789 s797 s800 s813 s814 s815 s816 s817 s819 s821 s826 s827 s828 s836 s837 s838 s839 s844 s847 s848 s857 s858 s859 s872 s877 s880 s885 s887 s888 s895 s897 s898 s900 s903 s905 s906 s907 s908 s909 s915 s916 s917 s920 s922 s925 s930 s931 s942 s944 s945 s946 s954 s955 s956 s957 s958 s961 s964 s965 s966 s974 s976 s977 s990 s991 s992 s993 s994 s996 s997 s1003 s1004 s1005 s1006 s1007 s1013 s1014 s1015 s1016 s1019 s1020 s1023 s1024 s1031 s1033 s1035 s1042 s1048 s1049 s1050 s1051 s1052 s1053 s1055 s1056 s1061 s1063) 0)") while checking expression at index 12
[2020-06-04 03:22:20] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:22:20] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 119 ms returned sat
[2020-06-04 03:22:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:22:23] [INFO ] [Real]Absence check using state equation in 2436 ms returned sat
[2020-06-04 03:22:23] [INFO ] Deduced a trap composed of 31 places in 694 ms
[2020-06-04 03:22:24] [INFO ] Deduced a trap composed of 388 places in 607 ms
[2020-06-04 03:22:25] [INFO ] Deduced a trap composed of 350 places in 639 ms
[2020-06-04 03:22:26] [INFO ] Deduced a trap composed of 382 places in 625 ms
[2020-06-04 03:22:26] [INFO ] Deduced a trap composed of 379 places in 599 ms
[2020-06-04 03:22:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3858 ms
[2020-06-04 03:22:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:22:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned sat
[2020-06-04 03:22:27] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 129 ms returned sat
[2020-06-04 03:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:22:29] [INFO ] [Nat]Absence check using state equation in 2669 ms returned sat
[2020-06-04 03:22:30] [INFO ] Deduced a trap composed of 31 places in 643 ms
[2020-06-04 03:22:31] [INFO ] Deduced a trap composed of 388 places in 472 ms
[2020-06-04 03:22:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1715 ms
[2020-06-04 03:22:31] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 88 ms.
[2020-06-04 03:22:38] [INFO ] Added : 240 causal constraints over 48 iterations in 7062 ms. Result :sat
[2020-06-04 03:22:39] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:22:39] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 138 ms returned sat
[2020-06-04 03:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:22:42] [INFO ] [Real]Absence check using state equation in 3053 ms returned sat
[2020-06-04 03:22:42] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 68 ms.
[2020-06-04 03:22:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:22:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned sat
[2020-06-04 03:22:42] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 167 ms returned sat
[2020-06-04 03:22:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:22:45] [INFO ] [Nat]Absence check using state equation in 2724 ms returned sat
[2020-06-04 03:22:45] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 78 ms.
[2020-06-04 03:23:02] [INFO ] Added : 605 causal constraints over 121 iterations in 16858 ms. Result :unknown
[2020-06-04 03:23:02] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:23:02] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 128 ms returned sat
[2020-06-04 03:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:23:05] [INFO ] [Real]Absence check using state equation in 2974 ms returned sat
[2020-06-04 03:23:05] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 32 ms.
[2020-06-04 03:23:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:23:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:23:06] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 132 ms returned sat
[2020-06-04 03:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:23:09] [INFO ] [Nat]Absence check using state equation in 3228 ms returned sat
[2020-06-04 03:23:10] [INFO ] Deduced a trap composed of 115 places in 474 ms
[2020-06-04 03:23:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 606 ms
[2020-06-04 03:23:10] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 63 ms.
[2020-06-04 03:23:24] [INFO ] Added : 505 causal constraints over 101 iterations in 13934 ms. Result :sat
[2020-06-04 03:23:24] [INFO ] Deduced a trap composed of 43 places in 594 ms
[2020-06-04 03:23:25] [INFO ] Deduced a trap composed of 47 places in 587 ms
[2020-06-04 03:23:26] [INFO ] Deduced a trap composed of 48 places in 595 ms
[2020-06-04 03:23:26] [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 s75 s83 s84 s85 s86 s87 s89 s90 s91 s92 s108 s109 s110 s111 s112 s114 s115 s121 s132 s143 s154 s165 s176 s177 s182 s183 s184 s185 s186 s187 s188 s189 s190 s199 s210 s221 s232 s287 s398 s509 s620 s632 s643 s654 s665 s676 s731) 0)") while checking expression at index 15
[2020-06-04 03:23:26] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:23:26] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 133 ms returned sat
[2020-06-04 03:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:23:30] [INFO ] [Real]Absence check using state equation in 3783 ms returned sat
[2020-06-04 03:23:30] [INFO ] Deduced a trap composed of 77 places in 539 ms
[2020-06-04 03:23:31] [INFO ] Deduced a trap composed of 65 places in 518 ms
[2020-06-04 03:23:32] [INFO ] Deduced a trap composed of 79 places in 536 ms
[2020-06-04 03:23:32] [INFO ] Deduced a trap composed of 91 places in 517 ms
[2020-06-04 03:23:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2413 ms
[2020-06-04 03:23:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:23:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:23:32] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 128 ms returned sat
[2020-06-04 03:23:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:23:35] [INFO ] [Nat]Absence check using state equation in 2998 ms returned sat
[2020-06-04 03:23:36] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 64 ms.
[2020-06-04 03:23:48] [INFO ] Added : 490 causal constraints over 98 iterations in 12193 ms. Result :sat
[2020-06-04 03:23:48] [INFO ] Deduced a trap composed of 48 places in 605 ms
[2020-06-04 03:23:49] [INFO ] Deduced a trap composed of 79 places in 579 ms
[2020-06-04 03:23:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1522 ms
[2020-06-04 03:23:49] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:23:50] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 132 ms returned sat
[2020-06-04 03:23:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:23:53] [INFO ] [Real]Absence check using state equation in 3163 ms returned sat
[2020-06-04 03:23:53] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 78 ms.
[2020-06-04 03:23:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:23:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:23:53] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 133 ms returned sat
[2020-06-04 03:23:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:23:57] [INFO ] [Nat]Absence check using state equation in 3066 ms returned sat
[2020-06-04 03:23:57] [INFO ] Deduced a trap composed of 401 places in 652 ms
[2020-06-04 03:23:58] [INFO ] Deduced a trap composed of 91 places in 457 ms
[2020-06-04 03:23:58] [INFO ] Deduced a trap composed of 115 places in 465 ms
[2020-06-04 03:23:59] [INFO ] Deduced a trap composed of 125 places in 482 ms
[2020-06-04 03:23:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2501 ms
[2020-06-04 03:23:59] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 63 ms.
[2020-06-04 03:24:13] [INFO ] Added : 510 causal constraints over 102 iterations in 14169 ms. Result :unknown
[2020-06-04 03:24:13] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:24:14] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 168 ms returned sat
[2020-06-04 03:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:24:17] [INFO ] [Real]Absence check using state equation in 3052 ms returned sat
[2020-06-04 03:24:17] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 105 ms.
[2020-06-04 03:24:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:24:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:24:17] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 130 ms returned sat
[2020-06-04 03:24:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:24:20] [INFO ] [Nat]Absence check using state equation in 3046 ms returned sat
[2020-06-04 03:24:20] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 58 ms.
[2020-06-04 03:24:37] [INFO ] Added : 645 causal constraints over 129 iterations in 16599 ms. Result :unknown
[2020-06-04 03:24:37] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:24:37] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 130 ms returned sat
[2020-06-04 03:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:24:40] [INFO ] [Real]Absence check using state equation in 2666 ms returned sat
[2020-06-04 03:24:40] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 77 ms.
[2020-06-04 03:24:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:24:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned sat
[2020-06-04 03:24:41] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 143 ms returned sat
[2020-06-04 03:24:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:24:43] [INFO ] [Nat]Absence check using state equation in 2819 ms returned sat
[2020-06-04 03:24:44] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 65 ms.
[2020-06-04 03:24:58] [INFO ] Added : 560 causal constraints over 113 iterations in 14581 ms. Result :sat
[2020-06-04 03:24:59] [INFO ] Deduced a trap composed of 79 places in 523 ms
[2020-06-04 03:24:59] [INFO ] Deduced a trap composed of 101 places in 481 ms
[2020-06-04 03:25:00] [INFO ] Deduced a trap composed of 77 places in 535 ms
[2020-06-04 03:25:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2007 ms
[2020-06-04 03:25:00] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:25:01] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 136 ms returned sat
[2020-06-04 03:25:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:25:03] [INFO ] [Real]Absence check using state equation in 2623 ms returned sat
[2020-06-04 03:25:04] [INFO ] Deduced a trap composed of 392 places in 689 ms
[2020-06-04 03:25:05] [INFO ] Deduced a trap composed of 386 places in 742 ms
[2020-06-04 03:25:06] [INFO ] Deduced a trap composed of 421 places in 734 ms
[2020-06-04 03:25:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2705 ms
[2020-06-04 03:25:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:25:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:25:06] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 135 ms returned sat
[2020-06-04 03:25:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:25:09] [INFO ] [Nat]Absence check using state equation in 2478 ms returned sat
[2020-06-04 03:25:09] [INFO ] Deduced a trap composed of 392 places in 636 ms
[2020-06-04 03:25:10] [INFO ] Deduced a trap composed of 41 places in 655 ms
[2020-06-04 03:25:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1714 ms
[2020-06-04 03:25:10] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 72 ms.
[2020-06-04 03:25:16] [INFO ] Added : 242 causal constraints over 49 iterations in 5465 ms. Result :sat
[2020-06-04 03:25:16] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2020-06-04 03:25:16] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 132 ms returned sat
[2020-06-04 03:25:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:25:19] [INFO ] [Real]Absence check using state equation in 2952 ms returned sat
[2020-06-04 03:25:19] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 52 ms.
[2020-06-04 03:25:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:25:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned sat
[2020-06-04 03:25:20] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 129 ms returned sat
[2020-06-04 03:25:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:25:23] [INFO ] [Nat]Absence check using state equation in 3094 ms returned sat
[2020-06-04 03:25:23] [INFO ] Deduced a trap composed of 345 places in 412 ms
[2020-06-04 03:25:24] [INFO ] Deduced a trap composed of 145 places in 457 ms
[2020-06-04 03:25:24] [INFO ] Deduced a trap composed of 125 places in 424 ms
[2020-06-04 03:25:25] [INFO ] Deduced a trap composed of 127 places in 433 ms
[2020-06-04 03:25:25] [INFO ] Deduced a trap composed of 137 places in 471 ms
[2020-06-04 03:25:26] [INFO ] Deduced a trap composed of 115 places in 448 ms
[2020-06-04 03:25:26] [INFO ] Deduced a trap composed of 101 places in 396 ms
[2020-06-04 03:25:27] [INFO ] Deduced a trap composed of 113 places in 414 ms
[2020-06-04 03:25:27] [INFO ] Deduced a trap composed of 103 places in 398 ms
[2020-06-04 03:25:28] [INFO ] Deduced a trap composed of 291 places in 413 ms
[2020-06-04 03:25:28] [INFO ] Deduced a trap composed of 369 places in 412 ms
[2020-06-04 03:25:29] [INFO ] Deduced a trap composed of 303 places in 415 ms
[2020-06-04 03:25:29] [INFO ] Deduced a trap composed of 277 places in 442 ms
[2020-06-04 03:25:30] [INFO ] Deduced a trap composed of 284 places in 406 ms
[2020-06-04 03:25:31] [INFO ] Deduced a trap composed of 258 places in 418 ms
[2020-06-04 03:25:32] [INFO ] Deduced a trap composed of 163 places in 479 ms
[2020-06-04 03:25:32] [INFO ] Deduced a trap composed of 256 places in 496 ms
[2020-06-04 03:25:33] [INFO ] Deduced a trap composed of 184 places in 473 ms
[2020-06-04 03:25:33] [INFO ] Deduced a trap composed of 77 places in 501 ms
[2020-06-04 03:25:34] [INFO ] Deduced a trap composed of 91 places in 448 ms
[2020-06-04 03:25:34] [INFO ] Deduced a trap composed of 89 places in 442 ms
[2020-06-04 03:25:35] [INFO ] Deduced a trap composed of 65 places in 488 ms
[2020-06-04 03:25:36] [INFO ] Deduced a trap composed of 67 places in 497 ms
[2020-06-04 03:25:36] [INFO ] Deduced a trap composed of 53 places in 471 ms
[2020-06-04 03:25:37] [INFO ] Deduced a trap composed of 55 places in 477 ms
[2020-06-04 03:25:38] [INFO ] Deduced a trap composed of 41 places in 496 ms
[2020-06-04 03:25:38] [INFO ] Deduced a trap composed of 43 places in 503 ms
[2020-06-04 03:25:39] [INFO ] Deduced a trap composed of 79 places in 485 ms
[2020-06-04 03:25:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:25:40] [INFO ] Deduced a trap composed of 8 places in 599 ms
[2020-06-04 03:25:40] [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 s77 s143 s176 s276 s310) 0)") while checking expression at index 21
[2020-06-04 03:25:40] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:25:40] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 131 ms returned sat
[2020-06-04 03:25:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:25:43] [INFO ] [Real]Absence check using state equation in 2933 ms returned sat
[2020-06-04 03:25:44] [INFO ] Deduced a trap composed of 416 places in 697 ms
[2020-06-04 03:25:45] [INFO ] Deduced a trap composed of 59 places in 700 ms
[2020-06-04 03:25:46] [INFO ] Deduced a trap composed of 367 places in 521 ms
[2020-06-04 03:25:46] [INFO ] Deduced a trap composed of 337 places in 532 ms
[2020-06-04 03:25:47] [INFO ] Deduced a trap composed of 387 places in 543 ms
[2020-06-04 03:25:47] [INFO ] Deduced a trap composed of 363 places in 517 ms
[2020-06-04 03:25:48] [INFO ] Deduced a trap composed of 393 places in 534 ms
[2020-06-04 03:25:49] [INFO ] Deduced a trap composed of 388 places in 522 ms
[2020-06-04 03:25:49] [INFO ] Deduced a trap composed of 364 places in 522 ms
[2020-06-04 03:25:50] [INFO ] Deduced a trap composed of 401 places in 569 ms
[2020-06-04 03:25:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6644 ms
[2020-06-04 03:25:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:25:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:25:50] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 131 ms returned sat
[2020-06-04 03:25:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:25:53] [INFO ] [Nat]Absence check using state equation in 2694 ms returned sat
[2020-06-04 03:25:54] [INFO ] Deduced a trap composed of 416 places in 669 ms
[2020-06-04 03:25:55] [INFO ] Deduced a trap composed of 59 places in 689 ms
[2020-06-04 03:25:55] [INFO ] Deduced a trap composed of 367 places in 593 ms
[2020-06-04 03:25:56] [INFO ] Deduced a trap composed of 85 places in 562 ms
[2020-06-04 03:25:57] [INFO ] Deduced a trap composed of 89 places in 568 ms
[2020-06-04 03:25:57] [INFO ] Deduced a trap composed of 77 places in 587 ms
[2020-06-04 03:25:58] [INFO ] Deduced a trap composed of 79 places in 567 ms
[2020-06-04 03:25:59] [INFO ] Deduced a trap composed of 351 places in 575 ms
[2020-06-04 03:25:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5728 ms
[2020-06-04 03:25:59] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 96 ms.
[2020-06-04 03:26:09] [INFO ] Added : 412 causal constraints over 83 iterations in 10756 ms. Result :sat
[2020-06-04 03:26:10] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:26:10] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 132 ms returned sat
[2020-06-04 03:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:26:13] [INFO ] [Real]Absence check using state equation in 3114 ms returned sat
[2020-06-04 03:26:13] [INFO ] Deduced a trap composed of 91 places in 424 ms
[2020-06-04 03:26:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 538 ms
[2020-06-04 03:26:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:26:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:26:14] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 132 ms returned sat
[2020-06-04 03:26:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:26:17] [INFO ] [Nat]Absence check using state equation in 2922 ms returned sat
[2020-06-04 03:26:17] [INFO ] Deduced a trap composed of 91 places in 440 ms
[2020-06-04 03:26:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 532 ms
[2020-06-04 03:26:17] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 57 ms.
[2020-06-04 03:26:30] [INFO ] Added : 435 causal constraints over 87 iterations in 12862 ms. Result :sat
[2020-06-04 03:26:31] [INFO ] Deduced a trap composed of 53 places in 551 ms
[2020-06-04 03:26:31] [INFO ] Deduced a trap composed of 83 places in 523 ms
[2020-06-04 03:26:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1396 ms
[2020-06-04 03:26:32] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:26:32] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 143 ms returned sat
[2020-06-04 03:26:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:26:34] [INFO ] [Real]Absence check using state equation in 2659 ms returned sat
[2020-06-04 03:26:35] [INFO ] Deduced a trap composed of 389 places in 443 ms
[2020-06-04 03:26:36] [INFO ] Deduced a trap composed of 55 places in 478 ms
[2020-06-04 03:26:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1314 ms
[2020-06-04 03:26:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:26:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:26:36] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 102 ms returned sat
[2020-06-04 03:26:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:26:38] [INFO ] [Nat]Absence check using state equation in 2348 ms returned sat
[2020-06-04 03:26:39] [INFO ] Deduced a trap composed of 389 places in 449 ms
[2020-06-04 03:26:40] [INFO ] Deduced a trap composed of 397 places in 578 ms
[2020-06-04 03:26:40] [INFO ] Deduced a trap composed of 55 places in 465 ms
[2020-06-04 03:26:41] [INFO ] Deduced a trap composed of 436 places in 454 ms
[2020-06-04 03:26:41] [INFO ] Deduced a trap composed of 53 places in 446 ms
[2020-06-04 03:26:42] [INFO ] Deduced a trap composed of 59 places in 426 ms
[2020-06-04 03:26:42] [INFO ] Deduced a trap composed of 43 places in 423 ms
[2020-06-04 03:26:43] [INFO ] Deduced a trap composed of 377 places in 429 ms
[2020-06-04 03:26:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4550 ms
[2020-06-04 03:26:43] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 76 ms.
[2020-06-04 03:26:49] [INFO ] Added : 313 causal constraints over 63 iterations in 6355 ms. Result :sat
[2020-06-04 03:26:50] [INFO ] Deduced a trap composed of 345 places in 709 ms
[2020-06-04 03:26:51] [INFO ] Deduced a trap composed of 373 places in 516 ms
[2020-06-04 03:26:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1425 ms
[2020-06-04 03:26:51] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2020-06-04 03:26:51] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 104 ms returned sat
[2020-06-04 03:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:26:56] [INFO ] [Real]Absence check using state equation in 5112 ms returned sat
[2020-06-04 03:26:56] [INFO ] Deduced a trap composed of 183 places in 253 ms
[2020-06-04 03:26:57] [INFO ] Deduced a trap composed of 175 places in 376 ms
[2020-06-04 03:26:57] [INFO ] Deduced a trap composed of 144 places in 394 ms
[2020-06-04 03:26:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1208 ms
[2020-06-04 03:26:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:26:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:26:57] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 130 ms returned sat
[2020-06-04 03:26:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:03] [INFO ] [Nat]Absence check using state equation in 5130 ms returned sat
[2020-06-04 03:27:03] [INFO ] Deduced a trap composed of 101 places in 399 ms
[2020-06-04 03:27:03] [INFO ] Deduced a trap composed of 194 places in 404 ms
[2020-06-04 03:27:04] [INFO ] Deduced a trap composed of 103 places in 362 ms
[2020-06-04 03:27:04] [INFO ] Deduced a trap composed of 174 places in 362 ms
[2020-06-04 03:27:05] [INFO ] Deduced a trap composed of 175 places in 420 ms
[2020-06-04 03:27:05] [INFO ] Deduced a trap composed of 210 places in 351 ms
[2020-06-04 03:27:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2759 ms
[2020-06-04 03:27:05] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 81 ms.
[2020-06-04 03:27:17] [INFO ] Added : 435 causal constraints over 87 iterations in 11857 ms. Result :(error "Failed to check-sat")
[2020-06-04 03:27:17] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:27:17] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 97 ms returned unsat
[2020-06-04 03:27:18] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:27:18] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 139 ms returned sat
[2020-06-04 03:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:21] [INFO ] [Real]Absence check using state equation in 3685 ms returned sat
[2020-06-04 03:27:22] [INFO ] Deduced a trap composed of 115 places in 456 ms
[2020-06-04 03:27:22] [INFO ] Deduced a trap composed of 247 places in 378 ms
[2020-06-04 03:27:23] [INFO ] Deduced a trap composed of 175 places in 441 ms
[2020-06-04 03:27:23] [INFO ] Deduced a trap composed of 180 places in 408 ms
[2020-06-04 03:27:24] [INFO ] Deduced a trap composed of 170 places in 396 ms
[2020-06-04 03:27:24] [INFO ] Deduced a trap composed of 153 places in 362 ms
[2020-06-04 03:27:25] [INFO ] Deduced a trap composed of 149 places in 356 ms
[2020-06-04 03:27:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3264 ms
[2020-06-04 03:27:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:27:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:27:25] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 137 ms returned sat
[2020-06-04 03:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:28] [INFO ] [Nat]Absence check using state equation in 3486 ms returned sat
[2020-06-04 03:27:29] [INFO ] Deduced a trap composed of 156 places in 317 ms
[2020-06-04 03:27:29] [INFO ] Deduced a trap composed of 325 places in 300 ms
[2020-06-04 03:27:30] [INFO ] Deduced a trap composed of 156 places in 371 ms
[2020-06-04 03:27:30] [INFO ] Deduced a trap composed of 330 places in 443 ms
[2020-06-04 03:27:31] [INFO ] Deduced a trap composed of 115 places in 478 ms
[2020-06-04 03:27:31] [INFO ] Deduced a trap composed of 169 places in 386 ms
[2020-06-04 03:27:32] [INFO ] Deduced a trap composed of 139 places in 387 ms
[2020-06-04 03:27:33] [INFO ] Deduced a trap composed of 113 places in 459 ms
[2020-06-04 03:27:33] [INFO ] Deduced a trap composed of 127 places in 401 ms
[2020-06-04 03:27:33] [INFO ] Deduced a trap composed of 149 places in 340 ms
[2020-06-04 03:27:34] [INFO ] Deduced a trap composed of 340 places in 437 ms
[2020-06-04 03:27:34] [INFO ] Deduced a trap composed of 125 places in 410 ms
[2020-06-04 03:27:35] [INFO ] Deduced a trap composed of 142 places in 400 ms
[2020-06-04 03:27:35] [INFO ] Deduced a trap composed of 145 places in 395 ms
[2020-06-04 03:27:37] [INFO ] Deduced a trap composed of 137 places in 489 ms
[2020-06-04 03:27:37] [INFO ] Deduced a trap composed of 89 places in 498 ms
[2020-06-04 03:27:38] [INFO ] Deduced a trap composed of 321 places in 479 ms
[2020-06-04 03:27:39] [INFO ] Deduced a trap composed of 337 places in 480 ms
[2020-06-04 03:27:39] [INFO ] Deduced a trap composed of 335 places in 488 ms
[2020-06-04 03:27:40] [INFO ] Deduced a trap composed of 329 places in 480 ms
[2020-06-04 03:27:40] [INFO ] Deduced a trap composed of 328 places in 493 ms
[2020-06-04 03:27:41] [INFO ] Deduced a trap composed of 325 places in 479 ms
[2020-06-04 03:27:41] [INFO ] Deduced a trap composed of 91 places in 475 ms
[2020-06-04 03:27:42] [INFO ] Deduced a trap composed of 151 places in 330 ms
[2020-06-04 03:27:42] [INFO ] Deduced a trap composed of 103 places in 444 ms
[2020-06-04 03:27:43] [INFO ] Deduced a trap composed of 101 places in 407 ms
[2020-06-04 03:27:44] [INFO ] Deduced a trap composed of 79 places in 434 ms
[2020-06-04 03:27:44] [INFO ] Deduced a trap composed of 77 places in 455 ms
[2020-06-04 03:27:45] [INFO ] Deduced a trap composed of 67 places in 408 ms
[2020-06-04 03:27:45] [INFO ] Deduced a trap composed of 65 places in 353 ms
[2020-06-04 03:27:45] [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 s82 s83 s84 s85 s86 s87 s89 s90 s91 s92 s93 s94 s110 s121 s132 s140 s141 s142 s143 s144 s145 s146 s154 s165 s176 s177 s188 s194 s199 s203 s204 s205 s206 s207 s210 s213 s214 s215 s216 s218 s219 s221 s232 s287 s302 s303 s304 s305 s398 s509 s620 s632 s643 s654 s665 s676 s687 s698 s709 s720 s731 s732 s743 s754) 0)") while checking expression at index 27
[2020-06-04 03:27:45] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:27:45] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 87 ms returned sat
[2020-06-04 03:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:48] [INFO ] [Real]Absence check using state equation in 3034 ms returned sat
[2020-06-04 03:27:49] [INFO ] Deduced a trap composed of 115 places in 457 ms
[2020-06-04 03:27:49] [INFO ] Deduced a trap composed of 247 places in 410 ms
[2020-06-04 03:27:50] [INFO ] Deduced a trap composed of 175 places in 369 ms
[2020-06-04 03:27:50] [INFO ] Deduced a trap composed of 180 places in 307 ms
[2020-06-04 03:27:50] [INFO ] Deduced a trap composed of 170 places in 313 ms
[2020-06-04 03:27:51] [INFO ] Deduced a trap composed of 153 places in 317 ms
[2020-06-04 03:27:51] [INFO ] Deduced a trap composed of 149 places in 344 ms
[2020-06-04 03:27:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2988 ms
[2020-06-04 03:27:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:27:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:27:51] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 91 ms returned sat
[2020-06-04 03:27:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:55] [INFO ] [Nat]Absence check using state equation in 3336 ms returned sat
[2020-06-04 03:27:55] [INFO ] Deduced a trap composed of 156 places in 416 ms
[2020-06-04 03:27:56] [INFO ] Deduced a trap composed of 325 places in 369 ms
[2020-06-04 03:27:56] [INFO ] Deduced a trap composed of 156 places in 395 ms
[2020-06-04 03:27:57] [INFO ] Deduced a trap composed of 330 places in 363 ms
[2020-06-04 03:27:57] [INFO ] Deduced a trap composed of 115 places in 411 ms
[2020-06-04 03:27:58] [INFO ] Deduced a trap composed of 169 places in 360 ms
[2020-06-04 03:27:58] [INFO ] Deduced a trap composed of 139 places in 331 ms
[2020-06-04 03:27:58] [INFO ] Deduced a trap composed of 113 places in 296 ms
[2020-06-04 03:27:59] [INFO ] Deduced a trap composed of 127 places in 318 ms
[2020-06-04 03:27:59] [INFO ] Deduced a trap composed of 149 places in 331 ms
[2020-06-04 03:28:00] [INFO ] Deduced a trap composed of 340 places in 385 ms
[2020-06-04 03:28:00] [INFO ] Deduced a trap composed of 125 places in 374 ms
[2020-06-04 03:28:01] [INFO ] Deduced a trap composed of 142 places in 357 ms
[2020-06-04 03:28:01] [INFO ] Deduced a trap composed of 145 places in 416 ms
[2020-06-04 03:28:02] [INFO ] Deduced a trap composed of 137 places in 481 ms
[2020-06-04 03:28:03] [INFO ] Deduced a trap composed of 89 places in 410 ms
[2020-06-04 03:28:04] [INFO ] Deduced a trap composed of 321 places in 392 ms
[2020-06-04 03:28:04] [INFO ] Deduced a trap composed of 337 places in 301 ms
[2020-06-04 03:28:04] [INFO ] Deduced a trap composed of 335 places in 403 ms
[2020-06-04 03:28:05] [INFO ] Deduced a trap composed of 329 places in 343 ms
[2020-06-04 03:28:05] [INFO ] Deduced a trap composed of 328 places in 342 ms
[2020-06-04 03:28:06] [INFO ] Deduced a trap composed of 325 places in 332 ms
[2020-06-04 03:28:06] [INFO ] Deduced a trap composed of 91 places in 374 ms
[2020-06-04 03:28:06] [INFO ] Deduced a trap composed of 151 places in 324 ms
[2020-06-04 03:28:07] [INFO ] Deduced a trap composed of 103 places in 515 ms
[2020-06-04 03:28:08] [INFO ] Deduced a trap composed of 101 places in 462 ms
[2020-06-04 03:28:09] [INFO ] Deduced a trap composed of 79 places in 499 ms
[2020-06-04 03:28:09] [INFO ] Deduced a trap composed of 77 places in 479 ms
[2020-06-04 03:28:10] [INFO ] Deduced a trap composed of 67 places in 467 ms
[2020-06-04 03:28:10] [INFO ] Deduced a trap composed of 65 places in 406 ms
[2020-06-04 03:28:11] [INFO ] Deduced a trap composed of 53 places in 424 ms
[2020-06-04 03:28:11] [INFO ] Deduced a trap composed of 55 places in 439 ms
[2020-06-04 03:28:11] [INFO ] Deduced a trap composed of 41 places in 354 ms
[2020-06-04 03:28:11] [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 s76 s85 s86 s87 s89 s90 s95 s96 s97 s98 s101 s102 s110 s121 s132 s143 s154 s165 s176 s177 s184 s185 s186 s187 s188 s199 s210 s221 s232 s287 s398 s509 s620 s632 s643 s654 s665 s676 s687 s731) 0)") while checking expression at index 28
[2020-06-04 03:28:12] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:28:12] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 86 ms returned sat
[2020-06-04 03:28:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:28:14] [INFO ] [Real]Absence check using state equation in 2216 ms returned sat
[2020-06-04 03:28:14] [INFO ] Deduced a trap composed of 400 places in 528 ms
[2020-06-04 03:28:15] [INFO ] Deduced a trap composed of 392 places in 633 ms
[2020-06-04 03:28:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1533 ms
[2020-06-04 03:28:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:28:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:28:16] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 104 ms returned sat
[2020-06-04 03:28:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:28:19] [INFO ] [Nat]Absence check using state equation in 3262 ms returned sat
[2020-06-04 03:28:19] [INFO ] Deduced a trap composed of 400 places in 484 ms
[2020-06-04 03:28:20] [INFO ] Deduced a trap composed of 399 places in 590 ms
[2020-06-04 03:28:21] [INFO ] Deduced a trap composed of 392 places in 618 ms
[2020-06-04 03:28:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2179 ms
[2020-06-04 03:28:21] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 66 ms.
[2020-06-04 03:28:25] [INFO ] Added : 181 causal constraints over 37 iterations in 3873 ms. Result :sat
[2020-06-04 03:28:25] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:28:25] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 128 ms returned sat
[2020-06-04 03:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:28:28] [INFO ] [Real]Absence check using state equation in 2737 ms returned sat
[2020-06-04 03:28:29] [INFO ] Deduced a trap composed of 392 places in 502 ms
[2020-06-04 03:28:29] [INFO ] Deduced a trap composed of 386 places in 499 ms
[2020-06-04 03:28:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1369 ms
[2020-06-04 03:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:28:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:28:30] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 85 ms returned sat
[2020-06-04 03:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:28:32] [INFO ] [Nat]Absence check using state equation in 2532 ms returned sat
[2020-06-04 03:28:33] [INFO ] Deduced a trap composed of 392 places in 687 ms
[2020-06-04 03:28:34] [INFO ] Deduced a trap composed of 41 places in 556 ms
[2020-06-04 03:28:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1702 ms
[2020-06-04 03:28:34] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 55 ms.
[2020-06-04 03:28:38] [INFO ] Added : 179 causal constraints over 36 iterations in 3754 ms. Result :sat
[2020-06-04 03:28:38] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:28:38] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 123 ms returned sat
[2020-06-04 03:28:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:28:41] [INFO ] [Real]Absence check using state equation in 2982 ms returned sat
[2020-06-04 03:28:42] [INFO ] Deduced a trap composed of 65 places in 576 ms
[2020-06-04 03:28:42] [INFO ] Deduced a trap composed of 416 places in 501 ms
[2020-06-04 03:28:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1419 ms
[2020-06-04 03:28:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:28:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:28:43] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 91 ms returned sat
[2020-06-04 03:28:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:28:45] [INFO ] [Nat]Absence check using state equation in 2561 ms returned sat
[2020-06-04 03:28:46] [INFO ] Deduced a trap composed of 65 places in 425 ms
[2020-06-04 03:28:46] [INFO ] Deduced a trap composed of 384 places in 457 ms
[2020-06-04 03:28:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1309 ms
[2020-06-04 03:28:47] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 57 ms.
[2020-06-04 03:28:51] [INFO ] Added : 214 causal constraints over 43 iterations in 4610 ms. Result :sat
[2020-06-04 03:28:51] [INFO ] [Real]Absence check using 2 positive place invariants in 27 ms returned sat
[2020-06-04 03:28:52] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 128 ms returned sat
[2020-06-04 03:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:28:56] [INFO ] [Real]Absence check using state equation in 4148 ms returned sat
[2020-06-04 03:28:56] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 85 ms.
[2020-06-04 03:28:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:28:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:28:56] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 137 ms returned sat
[2020-06-04 03:28:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:29:00] [INFO ] [Nat]Absence check using state equation in 3465 ms returned sat
[2020-06-04 03:29:00] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 50 ms.
[2020-06-04 03:29:16] [INFO ] Added : 655 causal constraints over 131 iterations in 16195 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 03:29:16] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:29:16] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 143 ms returned sat
[2020-06-04 03:29:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:29:19] [INFO ] [Real]Absence check using state equation in 2907 ms returned sat
[2020-06-04 03:29:20] [INFO ] Deduced a trap composed of 149 places in 345 ms
[2020-06-04 03:29:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 479 ms
[2020-06-04 03:29:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:29:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2020-06-04 03:29:20] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 121 ms returned sat
[2020-06-04 03:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:29:24] [INFO ] [Nat]Absence check using state equation in 3615 ms returned sat
[2020-06-04 03:29:24] [INFO ] Deduced a trap composed of 65 places in 370 ms
[2020-06-04 03:29:24] [INFO ] Deduced a trap composed of 67 places in 401 ms
[2020-06-04 03:29:25] [INFO ] Deduced a trap composed of 53 places in 385 ms
[2020-06-04 03:29:25] [INFO ] Deduced a trap composed of 55 places in 398 ms
[2020-06-04 03:29:26] [INFO ] Deduced a trap composed of 115 places in 367 ms
[2020-06-04 03:29:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2205 ms
[2020-06-04 03:29:26] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 62 ms.
[2020-06-04 03:29:40] [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 (=> (> t581 0) (and (> t580 0) (< o580 o581)))") while checking expression at index 33
[2020-06-04 03:29:40] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:29:40] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 127 ms returned sat
[2020-06-04 03:29:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:29:43] [INFO ] [Real]Absence check using state equation in 2915 ms returned sat
[2020-06-04 03:29:43] [INFO ] Deduced a trap composed of 373 places in 524 ms
[2020-06-04 03:29:44] [INFO ] Deduced a trap composed of 67 places in 466 ms
[2020-06-04 03:29:45] [INFO ] Deduced a trap composed of 65 places in 431 ms
[2020-06-04 03:29:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1731 ms
[2020-06-04 03:29:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:29:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:29:45] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 97 ms returned sat
[2020-06-04 03:29:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:29:48] [INFO ] [Nat]Absence check using state equation in 2987 ms returned sat
[2020-06-04 03:29:49] [INFO ] Deduced a trap composed of 373 places in 633 ms
[2020-06-04 03:29:49] [INFO ] Deduced a trap composed of 67 places in 516 ms
[2020-06-04 03:29:50] [INFO ] Deduced a trap composed of 65 places in 455 ms
[2020-06-04 03:29:50] [INFO ] Deduced a trap composed of 151 places in 267 ms
[2020-06-04 03:29:50] [INFO ] Deduced a trap composed of 417 places in 419 ms
[2020-06-04 03:29:51] [INFO ] Deduced a trap composed of 430 places in 444 ms
[2020-06-04 03:29:51] [INFO ] Deduced a trap composed of 29 places in 409 ms
[2020-06-04 03:29:52] [INFO ] Deduced a trap composed of 149 places in 414 ms
[2020-06-04 03:29:52] [INFO ] Deduced a trap composed of 31 places in 427 ms
[2020-06-04 03:29:53] [INFO ] Deduced a trap composed of 411 places in 437 ms
[2020-06-04 03:29:53] [INFO ] Deduced a trap composed of 418 places in 433 ms
[2020-06-04 03:29:54] [INFO ] Deduced a trap composed of 113 places in 434 ms
[2020-06-04 03:29:54] [INFO ] Deduced a trap composed of 101 places in 486 ms
[2020-06-04 03:29:55] [INFO ] Deduced a trap composed of 411 places in 403 ms
[2020-06-04 03:29:55] [INFO ] Deduced a trap composed of 91 places in 475 ms
[2020-06-04 03:29:56] [INFO ] Deduced a trap composed of 77 places in 424 ms
[2020-06-04 03:29:56] [INFO ] Deduced a trap composed of 431 places in 435 ms
[2020-06-04 03:29:57] [INFO ] Deduced a trap composed of 407 places in 414 ms
[2020-06-04 03:29:57] [INFO ] Deduced a trap composed of 392 places in 398 ms
[2020-06-04 03:29:58] [INFO ] Deduced a trap composed of 421 places in 426 ms
[2020-06-04 03:29:58] [INFO ] Deduced a trap composed of 431 places in 411 ms
[2020-06-04 03:29:59] [INFO ] Deduced a trap composed of 79 places in 447 ms
[2020-06-04 03:29:59] [INFO ] Deduced a trap composed of 398 places in 444 ms
[2020-06-04 03:30:00] [INFO ] Deduced a trap composed of 103 places in 419 ms
[2020-06-04 03:30:00] [INFO ] Deduced a trap composed of 427 places in 438 ms
[2020-06-04 03:30:01] [INFO ] Deduced a trap composed of 36 places in 424 ms
[2020-06-04 03:30:01] [INFO ] Deduced a trap composed of 431 places in 407 ms
[2020-06-04 03:30:02] [INFO ] Deduced a trap composed of 407 places in 458 ms
[2020-06-04 03:30:02] [INFO ] Deduced a trap composed of 405 places in 404 ms
[2020-06-04 03:30:03] [INFO ] Deduced a trap composed of 428 places in 420 ms
[2020-06-04 03:30:03] [INFO ] Deduced a trap composed of 417 places in 391 ms
[2020-06-04 03:30:03] [INFO ] Deduced a trap composed of 438 places in 408 ms
[2020-06-04 03:30:04] [INFO ] Deduced a trap composed of 424 places in 446 ms
[2020-06-04 03:30:04] [INFO ] Deduced a trap composed of 89 places in 417 ms
[2020-06-04 03:30:05] [INFO ] Deduced a trap composed of 448 places in 454 ms
[2020-06-04 03:30:05] [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 s9 s10 s11 s19 s20 s21 s22 s23 s29 s30 s31 s44 s57 s58 s59 s60 s67 s68 s70 s71 s74 s77 s79 s82 s83 s92 s93 s94 s107 s110 s114 s115 s116 s117 s118 s120 s121 s122 s123 s124 s125 s126 s127 s128 s130 s132 s133 s137 s140 s141 s143 s150 s152 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s178 s180 s181 s182 s190 s191 s192 s197 s198 s200 s201 s202 s203 s209 s210 s212 s219 s220 s221 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s238 s239 s240 s241 s242 s244 s245 s246 s247 s248 s250 s256 s258 s259 s260 s261 s268 s269 s270 s277 s278 s279 s280 s281 s283 s287 s297 s298 s299 s300 s301 s302 s307 s309 s310 s314 s316 s317 s318 s321 s327 s328 s329 s332 s342 s343 s350 s351 s354 s356 s357 s358 s359 s360 s362 s363 s364 s365 s366 s367 s368 s372 s375 s377 s385 s386 s388 s398 s402 s408 s409 s411 s412 s413 s415 s416 s417 s425 s426 s427 s431 s434 s435 s436 s445 s446 s447 s460 s468 s469 s473 s474 s475 s477 s478 s479 s480 s481 s482 s483 s484 s485 s493 s494 s495 s496 s497 s499 s500 s501 s502 s503 s504 s505 s509 s519 s533 s534 s535 s542 s544 s545 s552 s553 s555 s556 s557 s562 s563 s564 s578 s591 s592 s593 s594 s595 s596 s597 s599 s600 s601 s602 s603 s604 s608 s611 s612 s613 s614 s620 s622 s624 s630 s631 s632 s633 s634 s635 s637 s638 s639 s640 s641 s643 s644 s645 s650 s651 s652 s653 s654 s655 s656 s657 s658 s659 s660 s661 s662 s665 s670 s671 s672 s673 s674 s675 s676 s677 s678 s679 s680 s681 s682 s687 s695 s698 s708 s709 s711 s712 s713 s718 s721 s726 s727 s728 s729 s730 s731 s732 s733 s739 s740 s741 s749 s750 s754 s755 s765 s768 s769 s770 s771 s772 s773 s774 s775 s776 s777 s778 s779 s780 s782 s785 s787 s788 s789 s790 s791 s797 s798 s799 s800 s804 s807 s809 s813 s820 s826 s827 s828 s829 s830 s831 s836 s837 s838 s843 s847 s848 s849 s850 s851 s854 s857 s858 s859 s865 s872 s885 s886 s887 s888 s889 s890 s895 s896 s897 s898 s899 s902 s905 s906 s909 s915 s916 s917 s920 s930 s931 s935 s938 s942 s944 s945 s946 s947 s948 s949 s950 s951 s952 s954 s955 s956 s957 s961 s963 s964 s965 s966 s974 s975 s976 s977 s987 s990 s997 s998 s999 s1003 s1004 s1005 s1006 s1007 s1008 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1019 s1020 s1023 s1024 s1031 s1033 s1035 s1042 s1048 s1049 s1050 s1051 s1052 s1053 s1054 s1055 s1056 s1061 s1062 s1063) 0)") while checking expression at index 34
[2020-06-04 03:30:05] [INFO ] [Real]Absence check using 2 positive place invariants in 22 ms returned sat
[2020-06-04 03:30:05] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 87 ms returned sat
[2020-06-04 03:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:30:08] [INFO ] [Real]Absence check using state equation in 3099 ms returned sat
[2020-06-04 03:30:09] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 68 ms.
[2020-06-04 03:30:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:30:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:30:09] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 151 ms returned sat
[2020-06-04 03:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:30:12] [INFO ] [Nat]Absence check using state equation in 3123 ms returned sat
[2020-06-04 03:30:12] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 74 ms.
[2020-06-04 03:30:20] [INFO ] Added : 348 causal constraints over 70 iterations in 7923 ms. Result :sat
[2020-06-04 03:30:21] [INFO ] Deduced a trap composed of 41 places in 583 ms
[2020-06-04 03:30:22] [INFO ] Deduced a trap composed of 55 places in 590 ms
[2020-06-04 03:30:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1410 ms
[2020-06-04 03:30:22] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:30:22] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 125 ms returned sat
[2020-06-04 03:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:30:25] [INFO ] [Real]Absence check using state equation in 2923 ms returned sat
[2020-06-04 03:30:25] [INFO ] Deduced a trap composed of 67 places in 407 ms
[2020-06-04 03:30:26] [INFO ] Deduced a trap composed of 53 places in 421 ms
[2020-06-04 03:30:26] [INFO ] Deduced a trap composed of 377 places in 454 ms
[2020-06-04 03:30:27] [INFO ] Deduced a trap composed of 374 places in 602 ms
[2020-06-04 03:30:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2232 ms
[2020-06-04 03:30:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:30:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:30:27] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 131 ms returned sat
[2020-06-04 03:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:30:30] [INFO ] [Nat]Absence check using state equation in 2896 ms returned sat
[2020-06-04 03:30:31] [INFO ] Deduced a trap composed of 67 places in 605 ms
[2020-06-04 03:30:31] [INFO ] Deduced a trap composed of 53 places in 524 ms
[2020-06-04 03:30:32] [INFO ] Deduced a trap composed of 378 places in 482 ms
[2020-06-04 03:30:33] [INFO ] Deduced a trap composed of 377 places in 479 ms
[2020-06-04 03:30:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2627 ms
[2020-06-04 03:30:33] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 73 ms.
[2020-06-04 03:30:38] [INFO ] Added : 236 causal constraints over 48 iterations in 5201 ms. Result :sat
[2020-06-04 03:30:38] [INFO ] [Real]Absence check using 2 positive place invariants in 25 ms returned sat
[2020-06-04 03:30:38] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 156 ms returned sat
[2020-06-04 03:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:30:41] [INFO ] [Real]Absence check using state equation in 2982 ms returned sat
[2020-06-04 03:30:42] [INFO ] Deduced a trap composed of 199 places in 277 ms
[2020-06-04 03:30:42] [INFO ] Deduced a trap composed of 280 places in 247 ms
[2020-06-04 03:30:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 711 ms
[2020-06-04 03:30:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:30:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 23 ms returned sat
[2020-06-04 03:30:43] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 123 ms returned sat
[2020-06-04 03:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:30:46] [INFO ] [Nat]Absence check using state equation in 3168 ms returned sat
[2020-06-04 03:30:46] [INFO ] Deduced a trap composed of 276 places in 299 ms
[2020-06-04 03:30:46] [INFO ] Deduced a trap composed of 209 places in 266 ms
[2020-06-04 03:30:47] [INFO ] Deduced a trap composed of 211 places in 248 ms
[2020-06-04 03:30:47] [INFO ] Deduced a trap composed of 197 places in 306 ms
[2020-06-04 03:30:47] [INFO ] Deduced a trap composed of 213 places in 303 ms
[2020-06-04 03:30:48] [INFO ] Deduced a trap composed of 185 places in 284 ms
[2020-06-04 03:30:48] [INFO ] Deduced a trap composed of 173 places in 330 ms
[2020-06-04 03:30:48] [INFO ] Deduced a trap composed of 175 places in 262 ms
[2020-06-04 03:30:49] [INFO ] Deduced a trap composed of 161 places in 298 ms
[2020-06-04 03:30:49] [INFO ] Deduced a trap composed of 163 places in 291 ms
[2020-06-04 03:30:49] [INFO ] Deduced a trap composed of 195 places in 342 ms
[2020-06-04 03:30:50] [INFO ] Deduced a trap composed of 149 places in 308 ms
[2020-06-04 03:30:50] [INFO ] Deduced a trap composed of 137 places in 311 ms
[2020-06-04 03:30:51] [INFO ] Deduced a trap composed of 139 places in 380 ms
[2020-06-04 03:30:51] [INFO ] Deduced a trap composed of 277 places in 332 ms
[2020-06-04 03:30:51] [INFO ] Deduced a trap composed of 125 places in 303 ms
[2020-06-04 03:30:52] [INFO ] Deduced a trap composed of 127 places in 329 ms
[2020-06-04 03:30:52] [INFO ] Deduced a trap composed of 113 places in 300 ms
[2020-06-04 03:30:52] [INFO ] Deduced a trap composed of 115 places in 330 ms
[2020-06-04 03:30:53] [INFO ] Deduced a trap composed of 101 places in 353 ms
[2020-06-04 03:30:53] [INFO ] Deduced a trap composed of 103 places in 337 ms
[2020-06-04 03:30:54] [INFO ] Deduced a trap composed of 89 places in 320 ms
[2020-06-04 03:30:54] [INFO ] Deduced a trap composed of 91 places in 321 ms
[2020-06-04 03:30:54] [INFO ] Deduced a trap composed of 77 places in 382 ms
[2020-06-04 03:30:55] [INFO ] Deduced a trap composed of 79 places in 411 ms
[2020-06-04 03:30:55] [INFO ] Deduced a trap composed of 65 places in 337 ms
[2020-06-04 03:30:56] [INFO ] Deduced a trap composed of 67 places in 348 ms
[2020-06-04 03:30:56] [INFO ] Deduced a trap composed of 233 places in 316 ms
[2020-06-04 03:30:57] [INFO ] Deduced a trap composed of 205 places in 302 ms
[2020-06-04 03:30:57] [INFO ] Deduced a trap composed of 204 places in 289 ms
[2020-06-04 03:30:58] [INFO ] Deduced a trap composed of 187 places in 304 ms
[2020-06-04 03:30:59] [INFO ] Deduced a trap composed of 55 places in 497 ms
[2020-06-04 03:31:00] [INFO ] Deduced a trap composed of 323 places in 456 ms
[2020-06-04 03:31:00] [INFO ] Deduced a trap composed of 239 places in 344 ms
[2020-06-04 03:31:02] [INFO ] Deduced a trap composed of 43 places in 314 ms
[2020-06-04 03:31:02] [INFO ] Deduced a trap composed of 41 places in 320 ms
[2020-06-04 03:31:02] [INFO ] Deduced a trap composed of 53 places in 361 ms
[2020-06-04 03:31: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 s82 s83 s84 s85 s86 s87 s110 s121 s132 s135 s143 s144 s145 s146 s147 s148 s153 s154 s155 s156 s157 s159 s160 s165 s176 s177 s188 s199 s210 s221 s232 s242 s244 s245 s246 s287 s398 s509 s620 s632 s643 s654 s665 s676 s687 s698 s709 s720 s731 s732 s743 s754) 0)") while checking expression at index 37
[2020-06-04 03:31:02] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:31:02] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 102 ms returned sat
[2020-06-04 03:31:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:31:05] [INFO ] [Real]Absence check using state equation in 2969 ms returned sat
[2020-06-04 03:31:06] [INFO ] Deduced a trap composed of 398 places in 499 ms
[2020-06-04 03:31:07] [INFO ] Deduced a trap composed of 39 places in 456 ms
[2020-06-04 03:31:07] [INFO ] Deduced a trap composed of 22 places in 470 ms
[2020-06-04 03:31:08] [INFO ] Deduced a trap composed of 31 places in 534 ms
[2020-06-04 03:31:08] [INFO ] Deduced a trap composed of 376 places in 440 ms
[2020-06-04 03:31:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2736 ms
[2020-06-04 03:31:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:31:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:31:08] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 115 ms returned sat
[2020-06-04 03:31:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:31:12] [INFO ] [Nat]Absence check using state equation in 3574 ms returned sat
[2020-06-04 03:31:13] [INFO ] Deduced a trap composed of 398 places in 632 ms
[2020-06-04 03:31:13] [INFO ] Deduced a trap composed of 18 places in 566 ms
[2020-06-04 03:31:14] [INFO ] Deduced a trap composed of 31 places in 472 ms
[2020-06-04 03:31:14] [INFO ] Deduced a trap composed of 447 places in 463 ms
[2020-06-04 03:31:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2506 ms
[2020-06-04 03:31:15] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 76 ms.
[2020-06-04 03:31:28] [INFO ] Added : 535 causal constraints over 107 iterations in 13711 ms. Result :unknown
[2020-06-04 03:31:28] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:31:29] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 185 ms returned unsat
[2020-06-04 03:31:29] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2020-06-04 03:31:29] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 137 ms returned sat
[2020-06-04 03:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:31:31] [INFO ] [Real]Absence check using state equation in 2559 ms returned sat
[2020-06-04 03:31:32] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 63 ms.
[2020-06-04 03:31:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:31:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 18 ms returned sat
[2020-06-04 03:31:32] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 101 ms returned sat
[2020-06-04 03:31:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:31:35] [INFO ] [Nat]Absence check using state equation in 2639 ms returned sat
[2020-06-04 03:31:35] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 56 ms.
[2020-06-04 03:31:52] [INFO ] Added : 655 causal constraints over 131 iterations in 17097 ms. Result :(error "Failed to check-sat")
[2020-06-04 03:31:52] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:31:52] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 125 ms returned sat
[2020-06-04 03:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:31:55] [INFO ] [Real]Absence check using state equation in 3185 ms returned sat
[2020-06-04 03:31:55] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 32 ms.
[2020-06-04 03:31:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:31:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:31:56] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 122 ms returned sat
[2020-06-04 03:31:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:31:59] [INFO ] [Nat]Absence check using state equation in 3058 ms returned sat
[2020-06-04 03:31:59] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 69 ms.
1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
[2020-06-04 03:32:16] [INFO ] Added : 570 causal constraints over 114 iterations in 16597 ms. Result :(error "Failed to check-sat")
[2020-06-04 03:32:16] [INFO ] [Real]Absence check using 2 positive place invariants in 20 ms returned sat
[2020-06-04 03:32:16] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 127 ms returned sat
[2020-06-04 03:32:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:32:19] [INFO ] [Real]Absence check using state equation in 3245 ms returned sat
[2020-06-04 03:32:20] [INFO ] Deduced a trap composed of 67 places in 642 ms
[2020-06-04 03:32:20] [INFO ] Deduced a trap composed of 362 places in 413 ms
[2020-06-04 03:32:22] [INFO ] Deduced a trap composed of 410 places in 378 ms
[2020-06-04 03:32:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3636 ms
[2020-06-04 03:32:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:32:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:32:23] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 127 ms returned sat
[2020-06-04 03:32:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:32:26] [INFO ] [Nat]Absence check using state equation in 2790 ms returned sat
[2020-06-04 03:32:26] [INFO ] Deduced a trap composed of 67 places in 428 ms
[2020-06-04 03:32:27] [INFO ] Deduced a trap composed of 53 places in 476 ms
[2020-06-04 03:32:27] [INFO ] Deduced a trap composed of 55 places in 497 ms
[2020-06-04 03:32:29] [INFO ] Deduced a trap composed of 41 places in 1159 ms
[2020-06-04 03:32:29] [INFO ] Deduced a trap composed of 43 places in 589 ms
[2020-06-04 03:32:30] [INFO ] Deduced a trap composed of 362 places in 500 ms
[2020-06-04 03:32:31] [INFO ] Deduced a trap composed of 366 places in 451 ms
[2020-06-04 03:32:31] [INFO ] Deduced a trap composed of 361 places in 428 ms
[2020-06-04 03:32:32] [INFO ] Deduced a trap composed of 381 places in 449 ms
[2020-06-04 03:32:33] [INFO ] Deduced a trap composed of 374 places in 459 ms
[2020-06-04 03:32:34] [INFO ] Deduced a trap composed of 382 places in 507 ms
[2020-06-04 03:32:34] [INFO ] Deduced a trap composed of 362 places in 419 ms
[2020-06-04 03:32:34] [INFO ] Deduced a trap composed of 385 places in 396 ms
[2020-06-04 03:32:35] [INFO ] Deduced a trap composed of 275 places in 364 ms
[2020-06-04 03:32:35] [INFO ] Deduced a trap composed of 394 places in 369 ms
[2020-06-04 03:32:36] [INFO ] Deduced a trap composed of 376 places in 411 ms
[2020-06-04 03:32:36] [INFO ] Deduced a trap composed of 371 places in 419 ms
[2020-06-04 03:32:37] [INFO ] Deduced a trap composed of 79 places in 473 ms
[2020-06-04 03:32:38] [INFO ] Deduced a trap composed of 77 places in 444 ms
[2020-06-04 03:32:38] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 11974 ms
[2020-06-04 03:32:38] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 78 ms.
[2020-06-04 03:32:43] [INFO ] Added : 195 causal constraints over 39 iterations in 4983 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 03:32:43] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-06-04 03:32:43] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 102 ms returned sat
[2020-06-04 03:32:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:32:46] [INFO ] [Real]Absence check using state equation in 2993 ms returned sat
[2020-06-04 03:32:47] [INFO ] Deduced a trap composed of 25 places in 391 ms
[2020-06-04 03:32:47] [INFO ] Deduced a trap composed of 18 places in 377 ms
[2020-06-04 03:32:47] [INFO ] Deduced a trap composed of 31 places in 368 ms
[2020-06-04 03:32:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1387 ms
[2020-06-04 03:32:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:32:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:32:48] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 133 ms returned sat
[2020-06-04 03:32:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:32:51] [INFO ] [Nat]Absence check using state equation in 2994 ms returned sat
[2020-06-04 03:32:51] [INFO ] Deduced a trap composed of 25 places in 383 ms
[2020-06-04 03:32:52] [INFO ] Deduced a trap composed of 18 places in 384 ms
[2020-06-04 03:32:52] [INFO ] Deduced a trap composed of 31 places in 416 ms
[2020-06-04 03:32:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1383 ms
[2020-06-04 03:32:52] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 73 ms.
[2020-06-04 03:33:08] [INFO ] Added : 645 causal constraints over 129 iterations in 15371 ms. Result :unknown
[2020-06-04 03:33:08] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:33:08] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 166 ms returned sat
[2020-06-04 03:33:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:33:11] [INFO ] [Real]Absence check using state equation in 2631 ms returned sat
[2020-06-04 03:33:11] [INFO ] Deduced a trap composed of 440 places in 534 ms
[2020-06-04 03:33:12] [INFO ] Deduced a trap composed of 77 places in 735 ms
[2020-06-04 03:33:13] [INFO ] Deduced a trap composed of 65 places in 552 ms
[2020-06-04 03:33:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2293 ms
[2020-06-04 03:33:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:33:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:33:13] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 157 ms returned sat
[2020-06-04 03:33:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:33:16] [INFO ] [Nat]Absence check using state equation in 2829 ms returned sat
[2020-06-04 03:33:17] [INFO ] Deduced a trap composed of 415 places in 609 ms
[2020-06-04 03:33:18] [INFO ] Deduced a trap composed of 77 places in 724 ms
[2020-06-04 03:33:19] [INFO ] Deduced a trap composed of 65 places in 529 ms
[2020-06-04 03:33:19] [INFO ] Deduced a trap composed of 67 places in 609 ms
[2020-06-04 03:33:20] [INFO ] Deduced a trap composed of 53 places in 574 ms
[2020-06-04 03:33:21] [INFO ] Deduced a trap composed of 55 places in 568 ms
[2020-06-04 03:33:21] [INFO ] Deduced a trap composed of 41 places in 564 ms
[2020-06-04 03:33:22] [INFO ] Deduced a trap composed of 43 places in 576 ms
[2020-06-04 03:33:22] [INFO ] Deduced a trap composed of 386 places in 652 ms
[2020-06-04 03:33:23] [INFO ] Deduced a trap composed of 84 places in 696 ms
[2020-06-04 03:33:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 7519 ms
[2020-06-04 03:33:24] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 86 ms.
[2020-06-04 03:33:33] [INFO ] Added : 345 causal constraints over 69 iterations in 9343 ms. Result :unknown
[2020-06-04 03:33:33] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:33:33] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 160 ms returned sat
[2020-06-04 03:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:33:36] [INFO ] [Real]Absence check using state equation in 2944 ms returned sat
[2020-06-04 03:33:36] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 60 ms.
[2020-06-04 03:33:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:33:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:33:37] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 123 ms returned sat
[2020-06-04 03:33:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:33:39] [INFO ] [Nat]Absence check using state equation in 2389 ms returned sat
[2020-06-04 03:33:40] [INFO ] Deduced a trap composed of 67 places in 618 ms
[2020-06-04 03:33:40] [INFO ] Deduced a trap composed of 53 places in 594 ms
[2020-06-04 03:33:41] [INFO ] Deduced a trap composed of 55 places in 579 ms
[2020-06-04 03:33:42] [INFO ] Deduced a trap composed of 362 places in 551 ms
[2020-06-04 03:33:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2816 ms
[2020-06-04 03:33:42] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 67 ms.
[2020-06-04 03:33:50] [INFO ] Added : 314 causal constraints over 63 iterations in 7782 ms. Result :sat
[2020-06-04 03:33:50] [INFO ] Deduced a trap composed of 53 places in 689 ms
[2020-06-04 03:33:51] [INFO ] Deduced a trap composed of 25 places in 658 ms
[2020-06-04 03:33:52] [INFO ] Deduced a trap composed of 48 places in 465 ms
[2020-06-04 03:33:52] [INFO ] Deduced a trap composed of 65 places in 419 ms
[2020-06-04 03:33:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2634 ms
[2020-06-04 03:33:52] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:33:53] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 133 ms returned sat
[2020-06-04 03:33:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:33:55] [INFO ] [Real]Absence check using state equation in 2777 ms returned sat
[2020-06-04 03:33:56] [INFO ] Deduced a trap composed of 67 places in 424 ms
[2020-06-04 03:33:56] [INFO ] Deduced a trap composed of 362 places in 561 ms
[2020-06-04 03:33:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1439 ms
[2020-06-04 03:33:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:33:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:33:57] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 154 ms returned sat
[2020-06-04 03:33:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:34:00] [INFO ] [Nat]Absence check using state equation in 2613 ms returned sat
[2020-06-04 03:34:00] [INFO ] Deduced a trap composed of 67 places in 584 ms
[2020-06-04 03:34:01] [INFO ] Deduced a trap composed of 53 places in 601 ms
[2020-06-04 03:34:02] [INFO ] Deduced a trap composed of 55 places in 619 ms
[2020-06-04 03:34:02] [INFO ] Deduced a trap composed of 362 places in 699 ms
[2020-06-04 03:34:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3040 ms
[2020-06-04 03:34:03] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 82 ms.
[2020-06-04 03:34:15] [INFO ] Added : 337 causal constraints over 68 iterations in 12248 ms. Result :sat
[2020-06-04 03:34:15] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:34:15] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 134 ms returned sat
[2020-06-04 03:34:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:34:19] [INFO ] [Real]Absence check using state equation in 3211 ms returned sat
[2020-06-04 03:34:19] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 83 ms.
[2020-06-04 03:34:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:34:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-06-04 03:34:19] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 132 ms returned sat
[2020-06-04 03:34:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:34:23] [INFO ] [Nat]Absence check using state equation in 3634 ms returned sat
[2020-06-04 03:34:23] [INFO ] Deduced a trap composed of 228 places in 347 ms
[2020-06-04 03:34:24] [INFO ] Deduced a trap composed of 211 places in 295 ms
[2020-06-04 03:34:24] [INFO ] Deduced a trap composed of 197 places in 303 ms
[2020-06-04 03:34:24] [INFO ] Deduced a trap composed of 187 places in 320 ms
[2020-06-04 03:34:25] [INFO ] Deduced a trap composed of 186 places in 306 ms
[2020-06-04 03:34:25] [INFO ] Deduced a trap composed of 173 places in 322 ms
[2020-06-04 03:34:26] [INFO ] Deduced a trap composed of 265 places in 319 ms
[2020-06-04 03:34:26] [INFO ] Deduced a trap composed of 212 places in 314 ms
[2020-06-04 03:34:26] [INFO ] Deduced a trap composed of 163 places in 331 ms
[2020-06-04 03:34:27] [INFO ] Deduced a trap composed of 211 places in 332 ms
[2020-06-04 03:34:27] [INFO ] Deduced a trap composed of 149 places in 276 ms
[2020-06-04 03:34:28] [INFO ] Deduced a trap composed of 231 places in 381 ms
[2020-06-04 03:34:28] [INFO ] Deduced a trap composed of 139 places in 344 ms
[2020-06-04 03:34:28] [INFO ] Deduced a trap composed of 125 places in 396 ms
[2020-06-04 03:34:29] [INFO ] Deduced a trap composed of 127 places in 388 ms
[2020-06-04 03:34:29] [INFO ] Deduced a trap composed of 113 places in 391 ms
[2020-06-04 03:34:30] [INFO ] Deduced a trap composed of 115 places in 368 ms
[2020-06-04 03:34:30] [INFO ] Deduced a trap composed of 101 places in 349 ms
[2020-06-04 03:34:31] [INFO ] Deduced a trap composed of 103 places in 386 ms
[2020-06-04 03:34:31] [INFO ] Deduced a trap composed of 89 places in 414 ms
[2020-06-04 03:34:32] [INFO ] Deduced a trap composed of 91 places in 402 ms
[2020-06-04 03:34:32] [INFO ] Deduced a trap composed of 77 places in 413 ms
[2020-06-04 03:34:32] [INFO ] Deduced a trap composed of 79 places in 424 ms
[2020-06-04 03:34:33] [INFO ] Deduced a trap composed of 65 places in 431 ms
[2020-06-04 03:34:33] [INFO ] Deduced a trap composed of 67 places in 412 ms
[2020-06-04 03:34:34] [INFO ] Deduced a trap composed of 218 places in 363 ms
[2020-06-04 03:34:34] [INFO ] Deduced a trap composed of 201 places in 339 ms
[2020-06-04 03:34:35] [INFO ] Deduced a trap composed of 213 places in 344 ms
[2020-06-04 03:34:35] [INFO ] Deduced a trap composed of 200 places in 365 ms
[2020-06-04 03:34:36] [INFO ] Deduced a trap composed of 55 places in 453 ms
[2020-06-04 03:34:37] [INFO ] Deduced a trap composed of 53 places in 481 ms
[2020-06-04 03:34:38] [INFO ] Deduced a trap composed of 41 places in 555 ms
[2020-06-04 03:34:38] [INFO ] Deduced a trap composed of 43 places in 512 ms
[2020-06-04 03:34:39] [INFO ] Deduced a trap composed of 211 places in 351 ms
[2020-06-04 03:34:39] [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 s82 s83 s84 s85 s86 s87 s89 s90 s91 s92 s93 s94 s110 s121 s132 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s154 s165 s176 s177 s188 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s221 s232 s258 s259 s260 s261 s262 s263 s264 s266 s267 s268 s269 s270 s287 s317 s318 s319 s320 s322 s323 s324 s325 s326 s327 s328 s329 s375 s377 s378 s379 s380 s381 s382 s383 s384 s385 s386 s388 s398 s435 s436 s437 s438 s439 s440 s441 s442 s444 s445 s446 s447 s493 s494 s495 s496 s497 s499 s500 s501 s502 s503 s504 s505 s509 s552 s553 s555 s556 s557 s558 s559 s560 s561 s562 s563 s564 s611 s612 s613 s614 s615 s616 s617 s618 s619 s620 s622 s623 s624 s632 s643 s654 s664 s665 s670 s671 s672 s673 s674 s675 s676 s677 s678 s679 s680 s681 s682 s683 s684 s685 s686 s687 s689 s690 s698 s709 s720 s726 s727 s728 s729 s730 s731 s732 s733 s739 s740 s741 s743 s748 s749 s750 s751 s752 s753 s754 s755 s756 s757 s758 s759 s760 s761 s762 s763 s772 s773 s774 s775 s784 s788 s789 s819 s821 s822 s823 s824 s827 s828 s829 s830 s836) 0)") while checking expression at index 47
[2020-06-04 03:34:39] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:34:39] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 115 ms returned sat
[2020-06-04 03:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:34:43] [INFO ] [Real]Absence check using state equation in 3256 ms returned sat
[2020-06-04 03:34:43] [INFO ] Deduced a trap composed of 409 places in 483 ms
[2020-06-04 03:34:44] [INFO ] Deduced a trap composed of 419 places in 615 ms
[2020-06-04 03:34:44] [INFO ] Deduced a trap composed of 25 places in 540 ms
[2020-06-04 03:34:45] [INFO ] Deduced a trap composed of 18 places in 536 ms
[2020-06-04 03:34:46] [INFO ] Deduced a trap composed of 31 places in 510 ms
[2020-06-04 03:34:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3083 ms
[2020-06-04 03:34:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:34:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:34:46] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 151 ms returned sat
[2020-06-04 03:34:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:34:49] [INFO ] [Nat]Absence check using state equation in 3150 ms returned sat
[2020-06-04 03:34:49] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 66 ms.
[2020-06-04 03:35:06] [INFO ] Added : 525 causal constraints over 105 iterations in 16419 ms. Result :(error "Failed to check-sat")
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-04 03:35:06] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-04 03:35:06] [INFO ] Flatten gal took : 210 ms
FORMULA DoubleExponent-PT-020-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 03:35:06] [INFO ] Flatten gal took : 71 ms
[2020-06-04 03:35:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleExponent-PT-020-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 03:35:06] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-04 03:35:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DoubleExponent-PT-020 @ 3570 seconds

FORMULA DoubleExponent-PT-020-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-020-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-020-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-020-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-020-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-020-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-020-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-020-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-020-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-020-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-020-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-020-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1100
rslt: Output for LTLFireability @ DoubleExponent-PT-020

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

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

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

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

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

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 808
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p220)) AND (((1 <= p135) AND (1 <= p156)) OR (1 <= p220)))))",
"processed_size": 76,
"rewrites": 70
},
"result":
{
"edges": 27,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p677)))",
"processed_size": 19,
"rewrites": 70
},
"result":
{
"edges": 27,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p92)))",
"processed_size": 18,
"rewrites": 70
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3868,
"runtime": 2470.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((X((G(**) OR **)) OR (F(**) AND F(**))) U **) : F(G((F(**) AND (** OR **)))) : G((G(*) AND X(((F(*) OR X(*)) AND X(*))))) : (G(F(*)) OR F(G(**))) : G(F((F(G(**)) AND (** AND **)))) : ((F(**) AND **) U X(F((X(**) OR G(**))))) : X(X(G(((* R X(*)) AND (* AND *))))) : X(X((G(**) R X(X(G(*)))))) : ((X(X(X(**))) U **) OR (F(**) OR **)) : X((F(**) OR ((X(F(**)) U **) AND **))) : G((G(F(**)) OR (F(**) OR (** OR **)))) : X(F(**))"
},
"net":
{
"arcs": 2814,
"conflict_clusters": 687,
"places": 1064,
"places_significant": 960,
"singleton_clusters": 0,
"transitions": 998
},
"result":
{
"preliminary_value": "no no unknown no no yes no no no no unknown no ",
"value": "no no unknown no no yes no no no no unknown no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2062/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 34048
lola: finding significant places
lola: 1064 places, 998 transitions, 960 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: ((X ((G (((1 <= p504) AND (1 <= p525))) OR (1 <= p998))) OR (F ((1 <= p857)) AND F ((1 <= p998)))) U ((1 <= p504) AND (1 <= p525))) : F (G ((((1 <= p135) AND (1 <= p156)) U (1 <= p220)))) : G (((NOT(F ((1 <= p448))) AND NOT(X ((G ((1 <= p624)) AND X ((1 <= p624)))))) AND NOT(X (X ((1 <= p413)))))) : (NOT(F (G ((p92 <= 0)))) OR F (G ((1 <= p677)))) : F (G (F (X (((F (G (((p1028 <= 0) AND (1 <= p415) AND (1 <= p484)))) AND (1 <= p415)) AND (1 <= p484)))))) : ((F (((1 <= p904) AND (1 <= p949))) AND (1 <= p517)) U NOT(X (NOT(F ((X (((p81 <= 0) OR (p126 <= 0))) OR G ((1 <= p593)))))))) : G (NOT(F (X (X ((((p561 <= 0) OR (p578 <= 0)) U (((((1 <= p561) AND (1 <= p578)) U X (((1 <= p561) AND (1 <= p578)))) OR (p81 <= 0)) OR (p126 <= 0)))))))) : X (X (NOT((NOT(G (((1 <= p138) AND (1 <= p159)))) U X (X (F (((p30 <= 0) OR (p58 <= 0))))))))) : (((X (X (X (((1 <= p138) AND (1 <= p159))))) U ((1 <= p946) OR ((1 <= p637) AND (1 <= p717)))) OR F (((1 <= p623) AND (1 <= p642)))) OR ((1 <= p138) AND (1 <= p159))) : X ((((1 <= p248) U F (((1 <= p131) AND (1 <= p1020)))) OR ((F (X ((1 <= p874))) U ((1 <= p131) AND (1 <= p1020))) AND (1 <= p874)))) : G ((((F (G (F ((p1063 <= 0)))) OR F ((1 <= p229))) OR (1 <= p674)) OR (1 <= p229))) : X (F (((1 <= p926) OR (1 <= p566))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((G (((1 <= p504) AND (1 <= p525))) OR (1 <= p998))) OR (F ((1 <= p857)) AND F ((1 <= p998)))) U ((1 <= p504) AND (1 <= p525)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X ((G (((1 <= p504) AND (1 <= p525))) OR (1 <= p998))) OR (F ((1 <= p857)) AND F ((1 <= p998)))) U ((1 <= p504) AND (1 <= p525)))
lola: processed formula length: 131
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 1 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((p448 <= 0)) AND X (((F ((p624 <= 0)) OR X ((p624 <= 0))) AND X ((p413 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((p448 <= 0)) AND X (((F ((p624 <= 0)) OR X ((p624 <= 0))) AND X ((p413 <= 0))))))
lola: processed formula length: 88
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 638389 markings, 706191 edges, 127678 markings/sec, 0 secs
lola: 1321966 markings, 1462397 edges, 136715 markings/sec, 5 secs
lola: 2004972 markings, 2218040 edges, 136601 markings/sec, 10 secs
lola: 2686197 markings, 2971417 edges, 136245 markings/sec, 15 secs
lola: 3362382 markings, 3719382 edges, 135237 markings/sec, 20 secs
lola: 3995109 markings, 4419392 edges, 126545 markings/sec, 25 secs
lola: 4668805 markings, 5164762 edges, 134739 markings/sec, 30 secs
lola: 5338886 markings, 5906145 edges, 134016 markings/sec, 35 secs
lola: 6001348 markings, 6639101 edges, 132492 markings/sec, 40 secs
lola: 6628050 markings, 7332508 edges, 125340 markings/sec, 45 secs
lola: 7298481 markings, 8074357 edges, 134086 markings/sec, 50 secs
lola: 7968287 markings, 8815429 edges, 133961 markings/sec, 55 secs
lola: 8637957 markings, 9556467 edges, 133934 markings/sec, 60 secs
lola: 9304433 markings, 10293858 edges, 133295 markings/sec, 65 secs
lola: 9972000 markings, 11032548 edges, 133513 markings/sec, 70 secs
lola: 10601978 markings, 11729558 edges, 125996 markings/sec, 75 secs
lola: 11267283 markings, 12465757 edges, 133061 markings/sec, 80 secs
lola: 11927678 markings, 13196413 edges, 132079 markings/sec, 85 secs
lola: 12593081 markings, 13932723 edges, 133081 markings/sec, 90 secs
lola: 13261108 markings, 14671863 edges, 133605 markings/sec, 95 secs
lola: 13929168 markings, 15411058 edges, 133612 markings/sec, 100 secs
lola: 14595361 markings, 16148241 edges, 133239 markings/sec, 105 secs
lola: 15264394 markings, 16888447 edges, 133807 markings/sec, 110 secs
lola: 15881172 markings, 17570946 edges, 123356 markings/sec, 115 secs
lola: 16550720 markings, 18311828 edges, 133910 markings/sec, 120 secs
lola: 17199453 markings, 19029572 edges, 129747 markings/sec, 125 secs
lola: 17842126 markings, 19740712 edges, 128535 markings/sec, 130 secs
lola: 18441007 markings, 20403402 edges, 119776 markings/sec, 135 secs
lola: 19080467 markings, 21110952 edges, 127892 markings/sec, 140 secs
lola: 19748015 markings, 21849557 edges, 133510 markings/sec, 145 secs
lola: 20375619 markings, 22544030 edges, 125521 markings/sec, 150 secs
lola: 21042724 markings, 23282200 edges, 133421 markings/sec, 155 secs
lola: 21635134 markings, 23937629 edges, 118482 markings/sec, 160 secs
lola: 22304755 markings, 24678591 edges, 133924 markings/sec, 165 secs
lola: 22972774 markings, 25417791 edges, 133604 markings/sec, 170 secs
lola: 23643111 markings, 26159490 edges, 134067 markings/sec, 175 secs
lola: 24314361 markings, 26902179 edges, 134250 markings/sec, 180 secs
lola: 24941581 markings, 27596239 edges, 125444 markings/sec, 185 secs
lola: 25608060 markings, 28333704 edges, 133296 markings/sec, 190 secs
lola: 26274617 markings, 29071266 edges, 133311 markings/sec, 195 secs
lola: 26946861 markings, 29815032 edges, 134449 markings/sec, 200 secs
lola: 27619366 markings, 30559199 edges, 134501 markings/sec, 205 secs
lola: 28288962 markings, 31300116 edges, 133919 markings/sec, 210 secs
lola: 28958233 markings, 32040677 edges, 133854 markings/sec, 215 secs
lola: 29631941 markings, 32786117 edges, 134742 markings/sec, 220 secs
lola: 30263693 markings, 33485115 edges, 126350 markings/sec, 225 secs
lola: 30932610 markings, 34225313 edges, 133783 markings/sec, 230 secs
lola: 31560175 markings, 34919729 edges, 125513 markings/sec, 235 secs
lola: 32229165 markings, 35659972 edges, 133798 markings/sec, 240 secs
lola: 32901256 markings, 36403622 edges, 134418 markings/sec, 245 secs
lola: 33572283 markings, 37146107 edges, 134205 markings/sec, 250 secs
lola: 34240577 markings, 37885599 edges, 133659 markings/sec, 255 secs
lola: 34908651 markings, 38624803 edges, 133615 markings/sec, 260 secs
lola: 35538058 markings, 39321296 edges, 125881 markings/sec, 265 secs
lola: 36167072 markings, 40017292 edges, 125803 markings/sec, 270 secs
lola: 36837523 markings, 40759112 edges, 134090 markings/sec, 275 secs
lola: 37504830 markings, 41497535 edges, 133461 markings/sec, 280 secs
lola: 38171681 markings, 42235417 edges, 133370 markings/sec, 285 secs
lola: 38838483 markings, 42973239 edges, 133360 markings/sec, 290 secs
lola: 39506715 markings, 43712630 edges, 133646 markings/sec, 295 secs
lola: 40176930 markings, 44454251 edges, 134043 markings/sec, 300 secs
lola: 40848160 markings, 45196950 edges, 134246 markings/sec, 305 secs
lola: 41516974 markings, 45937026 edges, 133763 markings/sec, 310 secs
lola: 42142027 markings, 46628671 edges, 125011 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 10852372 KB
lola: time consumption: 336 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p904) AND (1 <= p949))) AND (1 <= p517)) U X (F ((X (((p81 <= 0) OR (p126 <= 0))) OR G ((1 <= p593))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F (((1 <= p904) AND (1 <= p949))) AND (1 <= p517)) U X (F ((X (((p81 <= 0) OR (p126 <= 0))) OR G ((1 <= p593))))))
lola: processed formula length: 117
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 8 edges
lola: ========================================
lola: subprocess 3 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((((p561 <= 0) OR (p578 <= 0)) R X (((p561 <= 0) OR (p578 <= 0)))) AND ((1 <= p81) AND (1 <= p126))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((((p561 <= 0) OR (p578 <= 0)) R X (((p561 <= 0) OR (p578 <= 0)))) AND ((1 <= p81) AND (1 <= p126))))))
lola: processed formula length: 114
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 4 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G (((1 <= p138) AND (1 <= p159))) R X (X (G (((1 <= p30) AND (1 <= p58))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G (((1 <= p138) AND (1 <= p159))) R X (X (G (((1 <= p30) AND (1 <= p58))))))))
lola: processed formula length: 85
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 5 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (X (X (((1 <= p138) AND (1 <= p159))))) U ((1 <= p946) OR ((1 <= p637) AND (1 <= p717)))) OR (F (((1 <= p623) AND (1 <= p642))) OR ((1 <= p138) AND (1 <= p159))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (((1 <= p138) AND (1 <= p159))))) U ((1 <= p946) OR ((1 <= p637) AND (1 <= p717))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (X (((1 <= p138) AND (1 <= p159))))) U ((1 <= p946) OR ((1 <= p637) AND (1 <= p717))))
lola: processed formula length: 93
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 6 will run for 539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p138) AND (1 <= p159))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p138) AND (1 <= p159))
lola: processed formula length: 29
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 646 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p623) AND (1 <= p642)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p623 <= 0) OR (p642 <= 0))
lola: processed formula length: 29
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 25 markings, 24 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p131) AND (1 <= p1020))) OR ((X (F ((1 <= p874))) U ((1 <= p131) AND (1 <= p1020))) AND (1 <= p874))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p131) AND (1 <= p1020))) OR ((X (F ((1 <= p874))) U ((1 <= p131) AND (1 <= p1020))) AND (1 <= p874))))
lola: processed formula length: 116
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 7 will run for 646 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p926) OR (1 <= p566))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p926) OR (1 <= p566))))
lola: processed formula length: 37
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 8 will run for 808 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p220)) AND (((1 <= p135) AND (1 <= p156)) OR (1 <= p220)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p220)) AND (((1 <= p135) AND (1 <= p156)) OR (1 <= p220)))))
lola: processed formula length: 76
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 27 edges
lola: ========================================
lola: subprocess 9 will run for 1078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (F ((p1063 <= 0))) OR (F ((1 <= p229)) OR ((1 <= p674) OR (1 <= p229)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (F ((p1063 <= 0))) OR (F ((1 <= p229)) OR ((1 <= p674) OR (1 <= p229)))))
lola: processed formula length: 79
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 450036 markings, 497144 edges, 90007 markings/sec, 0 secs
lola: 934038 markings, 1032283 edges, 96800 markings/sec, 5 secs
lola: 1473742 markings, 1629279 edges, 107941 markings/sec, 10 secs
lola: 2011856 markings, 2224594 edges, 107623 markings/sec, 15 secs
lola: 2550286 markings, 2820278 edges, 107686 markings/sec, 20 secs
lola: 3087800 markings, 3414971 edges, 107503 markings/sec, 25 secs
lola: 3626322 markings, 4010870 edges, 107704 markings/sec, 30 secs
lola: 4133176 markings, 4571629 edges, 101371 markings/sec, 35 secs
lola: 4673305 markings, 5169272 edges, 108026 markings/sec, 40 secs
lola: 5211392 markings, 5764646 edges, 107617 markings/sec, 45 secs
lola: 5749392 markings, 6359913 edges, 107600 markings/sec, 50 secs
lola: 6285740 markings, 6953375 edges, 107270 markings/sec, 55 secs
lola: 6823394 markings, 7548320 edges, 107531 markings/sec, 60 secs
lola: 7360900 markings, 8142976 edges, 107501 markings/sec, 65 secs
lola: 7897872 markings, 8737190 edges, 107394 markings/sec, 70 secs
lola: 8436799 markings, 9333446 edges, 107785 markings/sec, 75 secs
lola: 8975293 markings, 9929292 edges, 107699 markings/sec, 80 secs
lola: 9513381 markings, 10524736 edges, 107618 markings/sec, 85 secs
lola: 10051342 markings, 11119910 edges, 107592 markings/sec, 90 secs
lola: 10552416 markings, 11674371 edges, 100215 markings/sec, 95 secs
lola: 11086078 markings, 12264887 edges, 106732 markings/sec, 100 secs
lola: 11621389 markings, 12857135 edges, 107062 markings/sec, 105 secs
lola: 12155063 markings, 13447678 edges, 106735 markings/sec, 110 secs
lola: 12656616 markings, 14002664 edges, 100311 markings/sec, 115 secs
lola: 13174368 markings, 14575537 edges, 103550 markings/sec, 120 secs
lola: 13632249 markings, 15082135 edges, 91576 markings/sec, 125 secs
lola: 14165657 markings, 15672378 edges, 106682 markings/sec, 130 secs
lola: 14666726 markings, 16226830 edges, 100214 markings/sec, 135 secs
lola: 15200145 markings, 16817023 edges, 106684 markings/sec, 140 secs
lola: 15734657 markings, 17408433 edges, 106902 markings/sec, 145 secs
lola: 16265979 markings, 17996381 edges, 106264 markings/sec, 150 secs
lola: 16799069 markings, 18586268 edges, 106618 markings/sec, 155 secs
lola: 17333426 markings, 19177468 edges, 106871 markings/sec, 160 secs
lola: 17868356 markings, 19769363 edges, 106986 markings/sec, 165 secs
lola: 18369661 markings, 20324096 edges, 100261 markings/sec, 170 secs
lola: 18903837 markings, 20915152 edges, 106835 markings/sec, 175 secs
lola: 19407383 markings, 21472339 edges, 100709 markings/sec, 180 secs
lola: 19878358 markings, 21993419 edges, 94195 markings/sec, 185 secs
lola: 20393995 markings, 22563999 edges, 103127 markings/sec, 190 secs
lola: 20912705 markings, 23137957 edges, 103742 markings/sec, 195 secs
lola: 21443366 markings, 23725159 edges, 106132 markings/sec, 200 secs
lola: 21975588 markings, 24314056 edges, 106444 markings/sec, 205 secs
lola: 22509353 markings, 24904604 edges, 106753 markings/sec, 210 secs
lola: 23041269 markings, 25493196 edges, 106383 markings/sec, 215 secs
lola: 23570920 markings, 26079260 edges, 105930 markings/sec, 220 secs
lola: 24100131 markings, 26664850 edges, 105842 markings/sec, 225 secs
lola: 24557959 markings, 27171449 edges, 91566 markings/sec, 230 secs
lola: 25049699 markings, 27715493 edges, 98348 markings/sec, 235 secs
lola: 25583450 markings, 28306082 edges, 106750 markings/sec, 240 secs
lola: 26087833 markings, 28864238 edges, 100877 markings/sec, 245 secs
lola: 26625489 markings, 29459145 edges, 107531 markings/sec, 250 secs
lola: 27163902 markings, 30054856 edges, 107683 markings/sec, 255 secs
lola: 27704666 markings, 30653292 edges, 108153 markings/sec, 260 secs
lola: 28243740 markings, 31249672 edges, 107815 markings/sec, 265 secs
lola: 28781182 markings, 31844420 edges, 107488 markings/sec, 270 secs
lola: 29317076 markings, 32437380 edges, 107179 markings/sec, 275 secs
lola: 29853755 markings, 33031244 edges, 107336 markings/sec, 280 secs
lola: 30389680 markings, 33624235 edges, 107185 markings/sec, 285 secs
lola: 30894837 markings, 34183221 edges, 101031 markings/sec, 290 secs
lola: 31430057 markings, 34775382 edges, 107044 markings/sec, 295 secs
lola: 31964278 markings, 35366520 edges, 106844 markings/sec, 300 secs
lola: 32453783 markings, 35908164 edges, 97901 markings/sec, 305 secs
lola: 32957871 markings, 36465896 edges, 100818 markings/sec, 310 secs
lola: 33481473 markings, 37045316 edges, 104720 markings/sec, 315 secs
lola: 34015434 markings, 37636138 edges, 106792 markings/sec, 320 secs
lola: 34551120 markings, 38228893 edges, 107137 markings/sec, 325 secs
lola: 35085094 markings, 38819726 edges, 106795 markings/sec, 330 secs
lola: 35618471 markings, 39409925 edges, 106675 markings/sec, 335 secs
lola: 36150750 markings, 39998902 edges, 106456 markings/sec, 340 secs
lola: 36652728 markings, 40554307 edges, 100396 markings/sec, 345 secs
lola: 37184055 markings, 41142288 edges, 106265 markings/sec, 350 secs
lola: 37717259 markings, 41732236 edges, 106641 markings/sec, 355 secs
lola: 38219823 markings, 42288429 edges, 100513 markings/sec, 360 secs
lola: 38758745 markings, 42884663 edges, 107784 markings/sec, 365 secs
lola: 39294795 markings, 43477831 edges, 107210 markings/sec, 370 secs
lola: 39830911 markings, 44071064 edges, 107223 markings/sec, 375 secs
lola: 40367574 markings, 44664902 edges, 107333 markings/sec, 380 secs
lola: 40904157 markings, 45258630 edges, 107317 markings/sec, 385 secs
lola: 41440306 markings, 45851910 edges, 107230 markings/sec, 390 secs
lola: 41977071 markings, 46445866 edges, 107353 markings/sec, 395 secs
lola: 42477443 markings, 46999479 edges, 100074 markings/sec, 400 secs
lola: 42970169 markings, 47544691 edges, 98545 markings/sec, 405 secs
lola: 43502325 markings, 48133546 edges, 106431 markings/sec, 410 secs
lola: 44034650 markings, 48722570 edges, 106465 markings/sec, 415 secs
lola: 44568287 markings, 49313062 edges, 106727 markings/sec, 420 secs
lola: 45099535 markings, 49900846 edges, 106250 markings/sec, 425 secs
lola: 45633168 markings, 50491346 edges, 106727 markings/sec, 430 secs
lola: 46166881 markings, 51081926 edges, 106743 markings/sec, 435 secs
lola: 46658767 markings, 51626271 edges, 98377 markings/sec, 440 secs
lola: 47193957 markings, 52218398 edges, 107038 markings/sec, 445 secs
lola: 47725343 markings, 52806367 edges, 106277 markings/sec, 450 secs
lola: 48258211 markings, 53396047 edges, 106574 markings/sec, 455 secs
lola: 48788196 markings, 53982474 edges, 105997 markings/sec, 460 secs
lola: 49321151 markings, 54572211 edges, 106591 markings/sec, 465 secs
lola: 49851504 markings, 55159073 edges, 106071 markings/sec, 470 secs
lola: 50383765 markings, 55748052 edges, 106452 markings/sec, 475 secs
lola: 50916695 markings, 56337776 edges, 106586 markings/sec, 480 secs
lola: 51452112 markings, 56930167 edges, 107083 markings/sec, 485 secs
lola: 51976553 markings, 57510462 edges, 104888 markings/sec, 490 secs
lola: 52451324 markings, 58035835 edges, 94954 markings/sec, 495 secs
lola: 52980910 markings, 58621824 edges, 105917 markings/sec, 500 secs
lola: 53511519 markings, 59208947 edges, 106122 markings/sec, 505 secs
lola: 54042145 markings, 59796045 edges, 106125 markings/sec, 510 secs
lola: 54573485 markings, 60383995 edges, 106268 markings/sec, 515 secs
lola: 55104600 markings, 60971708 edges, 106223 markings/sec, 520 secs
lola: 55604820 markings, 61525307 edges, 100044 markings/sec, 525 secs
lola: 56139362 markings, 62116794 edges, 106908 markings/sec, 530 secs
lola: 56676470 markings, 62711047 edges, 107422 markings/sec, 535 secs
lola: 57212305 markings, 63303982 edges, 107167 markings/sec, 540 secs
lola: 57700378 markings, 63843991 edges, 97615 markings/sec, 545 secs
lola: 58171559 markings, 64365374 edges, 94236 markings/sec, 550 secs
lola: 58648517 markings, 64893173 edges, 95392 markings/sec, 555 secs
lola: 59177086 markings, 65478019 edges, 105714 markings/sec, 560 secs
lola: 59704979 markings, 66062184 edges, 105579 markings/sec, 565 secs
lola: 60234100 markings, 66647716 edges, 105824 markings/sec, 570 secs
lola: 60768990 markings, 67239594 edges, 106978 markings/sec, 575 secs
lola: 61305393 markings, 67833143 edges, 107281 markings/sec, 580 secs
lola: 61840784 markings, 68425498 edges, 107078 markings/sec, 585 secs
lola: 62375666 markings, 69017368 edges, 106976 markings/sec, 590 secs
lola: 62851091 markings, 69543457 edges, 95085 markings/sec, 595 secs
lola: 63371938 markings, 70120029 edges, 104169 markings/sec, 600 secs
lola: 63870902 markings, 70671891 edges, 99793 markings/sec, 605 secs
lola: 64373689 markings, 71228202 edges, 100557 markings/sec, 610 secs
lola: 64821718 markings, 71724006 edges, 89606 markings/sec, 615 secs
lola: 65337688 markings, 72294956 edges, 103194 markings/sec, 620 secs
lola: 65855821 markings, 72868261 edges, 103627 markings/sec, 625 secs
lola: 66362789 markings, 73429237 edges, 101394 markings/sec, 630 secs
lola: 66827861 markings, 73943918 edges, 93014 markings/sec, 635 secs
lola: 67347623 markings, 74518971 edges, 103952 markings/sec, 640 secs
lola: 67866183 markings, 75092787 edges, 103712 markings/sec, 645 secs
lola: 68384133 markings, 75665895 edges, 103590 markings/sec, 650 secs
lola: 68902791 markings, 76239789 edges, 103732 markings/sec, 655 secs
lola: 69401578 markings, 76791710 edges, 99757 markings/sec, 660 secs
lola: 69912186 markings, 77356683 edges, 102122 markings/sec, 665 secs
lola: 70433770 markings, 77933843 edges, 104317 markings/sec, 670 secs
lola: 70889627 markings, 78438337 edges, 91171 markings/sec, 675 secs
lola: 71413485 markings, 79018021 edges, 104772 markings/sec, 680 secs
lola: 71856055 markings, 79507687 edges, 88514 markings/sec, 685 secs
lola: 72381048 markings, 80088670 edges, 104999 markings/sec, 690 secs
lola: 72908528 markings, 80672266 edges, 105496 markings/sec, 695 secs
lola: 73409001 markings, 81226063 edges, 100095 markings/sec, 700 secs
lola: 73871956 markings, 81738329 edges, 92591 markings/sec, 705 secs
lola: 74337180 markings, 82253077 edges, 93045 markings/sec, 710 secs
lola: 74817090 markings, 82784128 edges, 95982 markings/sec, 715 secs
lola: 75338839 markings, 83361480 edges, 104350 markings/sec, 720 secs
lola: 75769920 markings, 83838436 edges, 86216 markings/sec, 725 secs
lola: 76286825 markings, 84410423 edges, 103381 markings/sec, 730 secs
lola: 76806078 markings, 84985002 edges, 103851 markings/sec, 735 secs
lola: 77322824 markings, 85556818 edges, 103349 markings/sec, 740 secs
lola: 77808629 markings, 86094453 edges, 97161 markings/sec, 745 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 1240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G (((p1028 <= 0) AND (1 <= p415) AND (1 <= p484)))) AND ((1 <= p415) AND (1 <= p484)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G (((p1028 <= 0) AND (1 <= p415) AND (1 <= p484)))) AND ((1 <= p415) AND (1 <= p484)))))
lola: processed formula length: 98
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 11 will run for 2480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((1 <= p92))) OR F (G ((1 <= p677))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 2480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p677)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p677)))
lola: processed formula length: 19
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 27 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((G ((p448 <= 0)) AND X (((F ((p624 <= 0)) OR X ((p624 <= 0))) AND X ((p413 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((p448 <= 0)) AND X (((F ((p624 <= 0)) OR X ((p624 <= 0))) AND X ((p413 <= 0))))))
lola: processed formula length: 88
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 645215 markings, 713738 edges, 129043 markings/sec, 0 secs
lola: 1323741 markings, 1464361 edges, 135705 markings/sec, 5 secs
lola: 2002275 markings, 2215040 edges, 135707 markings/sec, 10 secs
lola: 2636911 markings, 2916929 edges, 126927 markings/sec, 15 secs
lola: 3308335 markings, 3659608 edges, 134285 markings/sec, 20 secs
lola: 3980313 markings, 4403020 edges, 134396 markings/sec, 25 secs
lola: 4649471 markings, 5143367 edges, 133832 markings/sec, 30 secs
lola: 5317103 markings, 5882038 edges, 133526 markings/sec, 35 secs
lola: 5986551 markings, 6622711 edges, 133890 markings/sec, 40 secs
lola: 6656174 markings, 7363623 edges, 133925 markings/sec, 45 secs
lola: 7322692 markings, 8101148 edges, 133304 markings/sec, 50 secs
lola: 7992034 markings, 8841712 edges, 133868 markings/sec, 55 secs
lola: 8660023 markings, 9580879 edges, 133598 markings/sec, 60 secs
lola: 9326452 markings, 10318206 edges, 133286 markings/sec, 65 secs
lola: 9994753 markings, 11057737 edges, 133660 markings/sec, 70 secs
lola: 10664306 markings, 11798514 edges, 133911 markings/sec, 75 secs
lola: 11333333 markings, 12538842 edges, 133805 markings/sec, 80 secs
lola: 12000309 markings, 13276780 edges, 133395 markings/sec, 85 secs
lola: 12664528 markings, 14011786 edges, 132844 markings/sec, 90 secs
lola: 13323886 markings, 14741311 edges, 131872 markings/sec, 95 secs
lola: 13951240 markings, 15435488 edges, 125471 markings/sec, 100 secs
lola: 14555772 markings, 16104408 edges, 120906 markings/sec, 105 secs
lola: 15203682 markings, 16821270 edges, 129582 markings/sec, 110 secs
lola: 15853669 markings, 17540518 edges, 129997 markings/sec, 115 secs
lola: 16517906 markings, 18275515 edges, 132847 markings/sec, 120 secs
lola: 17184003 markings, 19012485 edges, 133219 markings/sec, 125 secs
lola: 17850888 markings, 19750418 edges, 133377 markings/sec, 130 secs
lola: 18517864 markings, 20488464 edges, 133395 markings/sec, 135 secs
lola: 19188661 markings, 21230631 edges, 134159 markings/sec, 140 secs
lola: 19856650 markings, 21969767 edges, 133598 markings/sec, 145 secs
lola: 20522427 markings, 22706476 edges, 133155 markings/sec, 150 secs
lola: 21189605 markings, 23444726 edges, 133436 markings/sec, 155 secs
lola: 21807011 markings, 24127805 edges, 123481 markings/sec, 160 secs
lola: 22398886 markings, 24782758 edges, 118375 markings/sec, 165 secs
lola: 23008971 markings, 25457833 edges, 122017 markings/sec, 170 secs
lola: 23662772 markings, 26181236 edges, 130760 markings/sec, 175 secs
lola: 24261390 markings, 26843572 edges, 119724 markings/sec, 180 secs
lola: 24843075 markings, 27487232 edges, 116337 markings/sec, 185 secs
lola: 25446256 markings, 28154678 edges, 120636 markings/sec, 190 secs
lola: 26082158 markings, 28858300 edges, 127180 markings/sec, 195 secs
lola: 26747833 markings, 29594829 edges, 133135 markings/sec, 200 secs
lola: 27414752 markings, 30332771 edges, 133384 markings/sec, 205 secs
lola: 28052428 markings, 31038395 edges, 127535 markings/sec, 210 secs
lola: 28717667 markings, 31774469 edges, 133048 markings/sec, 215 secs
lola: 29387285 markings, 32515428 edges, 133924 markings/sec, 220 secs
lola: 30048235 markings, 33246700 edges, 132190 markings/sec, 225 secs
lola: 30713521 markings, 33982893 edges, 133057 markings/sec, 230 secs
lola: 31376264 markings, 34716195 edges, 132549 markings/sec, 235 secs
lola: 32041869 markings, 35452723 edges, 133121 markings/sec, 240 secs
lola: 32707565 markings, 36189307 edges, 133139 markings/sec, 245 secs
lola: 33377298 markings, 36930333 edges, 133947 markings/sec, 250 secs
lola: 34041750 markings, 37665596 edges, 132890 markings/sec, 255 secs
lola: 34706352 markings, 38400979 edges, 132920 markings/sec, 260 secs
lola: 35369625 markings, 39134910 edges, 132655 markings/sec, 265 secs
lola: 36039243 markings, 39875873 edges, 133924 markings/sec, 270 secs
lola: 36706214 markings, 40613817 edges, 133394 markings/sec, 275 secs
lola: 37372506 markings, 41351106 edges, 133258 markings/sec, 280 secs
lola: 38038179 markings, 42087701 edges, 133135 markings/sec, 285 secs
lola: 38702676 markings, 42822969 edges, 132899 markings/sec, 290 secs
lola: 39366651 markings, 43557681 edges, 132795 markings/sec, 295 secs
lola: 40032537 markings, 44294469 edges, 133177 markings/sec, 300 secs
lola: 40699608 markings, 45032573 edges, 133414 markings/sec, 305 secs
lola: 41364415 markings, 45768224 edges, 132961 markings/sec, 310 secs
lola: 42028442 markings, 46502948 edges, 132805 markings/sec, 315 secs
lola: 42692952 markings, 47238264 edges, 132902 markings/sec, 320 secs
lola: 43359651 markings, 47975992 edges, 133340 markings/sec, 325 secs
lola: 44029129 markings, 48716782 edges, 133896 markings/sec, 330 secs
lola: 44698117 markings, 49456982 edges, 133798 markings/sec, 335 secs
lola: 45365305 markings, 50195283 edges, 133438 markings/sec, 340 secs
lola: 46031877 markings, 50932862 edges, 133314 markings/sec, 345 secs
lola: 46698604 markings, 51670590 edges, 133345 markings/sec, 350 secs
lola: 47364799 markings, 52407723 edges, 133239 markings/sec, 355 secs
lola: 48033860 markings, 53148140 edges, 133812 markings/sec, 360 secs
lola: 48704114 markings, 53889736 edges, 134051 markings/sec, 365 secs
lola: 49372130 markings, 54628914 edges, 133603 markings/sec, 370 secs
lola: 50035955 markings, 55363452 edges, 132765 markings/sec, 375 secs
lola: 50700267 markings, 56098516 edges, 132862 markings/sec, 380 secs
lola: 51292653 markings, 56754008 edges, 118477 markings/sec, 385 secs
lola: 51874843 markings, 57398194 edges, 116438 markings/sec, 390 secs
lola: 52485744 markings, 58074199 edges, 122180 markings/sec, 395 secs
lola: 53149205 markings, 58808386 edges, 132692 markings/sec, 400 secs
lola: 53812587 markings, 59542371 edges, 132676 markings/sec, 405 secs
lola: 54474218 markings, 60274504 edges, 132326 markings/sec, 410 secs
lola: 55136138 markings, 61006931 edges, 132384 markings/sec, 415 secs
lola: 55795960 markings, 61736990 edges, 131964 markings/sec, 420 secs
lola: 56458524 markings, 62470197 edges, 132513 markings/sec, 425 secs
lola: 57119506 markings, 63201574 edges, 132196 markings/sec, 430 secs
lola: 57786365 markings, 63939539 edges, 133372 markings/sec, 435 secs
lola: 58452617 markings, 64676679 edges, 133250 markings/sec, 440 secs
lola: 59122672 markings, 65418134 edges, 134011 markings/sec, 445 secs
lola: 59786694 markings, 66152904 edges, 132804 markings/sec, 450 secs
lola: 60398222 markings, 66829558 edges, 122306 markings/sec, 455 secs
lola: 60999405 markings, 67494794 edges, 120237 markings/sec, 460 secs
lola: 61616652 markings, 68177808 edges, 123449 markings/sec, 465 secs
lola: 62270540 markings, 68901338 edges, 130778 markings/sec, 470 secs
lola: 62934747 markings, 69636310 edges, 132841 markings/sec, 475 secs
lola: 63579580 markings, 70350056 edges, 128967 markings/sec, 480 secs
lola: 64191013 markings, 71026387 edges, 122287 markings/sec, 485 secs
lola: 64778914 markings, 71676928 edges, 117580 markings/sec, 490 secs
lola: 65364160 markings, 72324475 edges, 117049 markings/sec, 495 secs
lola: 65926515 markings, 72946726 edges, 112471 markings/sec, 500 secs
lola: 66526109 markings, 73610235 edges, 119919 markings/sec, 505 secs
lola: 67073467 markings, 74215930 edges, 109472 markings/sec, 510 secs
lola: 67580111 markings, 74776575 edges, 101329 markings/sec, 515 secs
lola: 68143957 markings, 75400506 edges, 112769 markings/sec, 520 secs
lola: 68677190 markings, 75990494 edges, 106647 markings/sec, 525 secs
lola: 69274962 markings, 76651906 edges, 119554 markings/sec, 530 secs
lola: 69907300 markings, 77351623 edges, 126468 markings/sec, 535 secs
lola: 70540336 markings, 78052095 edges, 126607 markings/sec, 540 secs
lola: 71181306 markings, 78761327 edges, 128194 markings/sec, 545 secs
lola: 71751661 markings, 79392452 edges, 114071 markings/sec, 550 secs
lola: 72386829 markings, 80095261 edges, 127034 markings/sec, 555 secs
lola: 73030721 markings, 80807781 edges, 128778 markings/sec, 560 secs
lola: 73673294 markings, 81518859 edges, 128515 markings/sec, 565 secs
lola: 74275216 markings, 82184913 edges, 120384 markings/sec, 570 secs
lola: 74916315 markings, 82894213 edges, 128220 markings/sec, 575 secs
lola: 75549593 markings, 83594991 edges, 126656 markings/sec, 580 secs
lola: 76176573 markings, 84288754 edges, 125396 markings/sec, 585 secs
lola: 76754089 markings, 84927791 edges, 115503 markings/sec, 590 secs
lola: 77388226 markings, 85629436 edges, 126827 markings/sec, 595 secs
lola: 78000818 markings, 86307334 edges, 122518 markings/sec, 600 secs
lola: 78114960 markings, 86433641 edges, 22828 markings/sec, 605 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G ((G (F ((p1063 <= 0))) OR (F ((1 <= p229)) OR ((1 <= p674) OR (1 <= p229)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (F ((p1063 <= 0))) OR (F ((1 <= p229)) OR ((1 <= p674) OR (1 <= p229)))))
lola: processed formula length: 79
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 470592 markings, 519862 edges, 94118 markings/sec, 0 secs
lola: 974128 markings, 1076611 edges, 100707 markings/sec, 5 secs
lola: 1505701 markings, 1664628 edges, 106315 markings/sec, 10 secs
lola: 2037057 markings, 2252468 edges, 106271 markings/sec, 15 secs
lola: 2565570 markings, 2837195 edges, 105703 markings/sec, 20 secs
lola: 3097291 markings, 3425485 edges, 106344 markings/sec, 25 secs
lola: 3625924 markings, 4010422 edges, 105727 markings/sec, 30 secs
lola: 4155795 markings, 4596663 edges, 105974 markings/sec, 35 secs
lola: 4686722 markings, 5184106 edges, 106185 markings/sec, 40 secs
lola: 5215482 markings, 5769165 edges, 105752 markings/sec, 45 secs
lola: 5745177 markings, 6355251 edges, 105939 markings/sec, 50 secs
lola: 6272966 markings, 6939239 edges, 105558 markings/sec, 55 secs
lola: 6802039 markings, 7524687 edges, 105815 markings/sec, 60 secs
lola: 7294309 markings, 8069291 edges, 98454 markings/sec, 65 secs
lola: 7817588 markings, 8648333 edges, 104656 markings/sec, 70 secs
lola: 8342305 markings, 9228888 edges, 104943 markings/sec, 75 secs
lola: 8836089 markings, 9775240 edges, 98757 markings/sec, 80 secs
lola: 9340420 markings, 10333346 edges, 100866 markings/sec, 85 secs
lola: 9861900 markings, 10910303 edges, 104296 markings/sec, 90 secs
lola: 10351961 markings, 11452541 edges, 98012 markings/sec, 95 secs
lola: 10880022 markings, 12036880 edges, 105612 markings/sec, 100 secs
lola: 11408624 markings, 12621742 edges, 105720 markings/sec, 105 secs
lola: 11939032 markings, 13208636 edges, 106082 markings/sec, 110 secs
lola: 12467928 markings, 13793881 edges, 105779 markings/sec, 115 secs
lola: 12999450 markings, 14382006 edges, 106304 markings/sec, 120 secs
lola: 13500264 markings, 14936095 edges, 100163 markings/sec, 125 secs
lola: 14022492 markings, 15513960 edges, 104446 markings/sec, 130 secs
lola: 14525185 markings, 16070225 edges, 100539 markings/sec, 135 secs
lola: 15055064 markings, 16656555 edges, 105976 markings/sec, 140 secs
lola: 15584282 markings, 17242049 edges, 105844 markings/sec, 145 secs
lola: 16114258 markings, 17828507 edges, 105995 markings/sec, 150 secs
lola: 16642062 markings, 18412530 edges, 105561 markings/sec, 155 secs
lola: 17173027 markings, 19000059 edges, 106193 markings/sec, 160 secs
lola: 17701055 markings, 19584226 edges, 105606 markings/sec, 165 secs
lola: 18228269 markings, 20167651 edges, 105443 markings/sec, 170 secs
lola: 18754310 markings, 20749710 edges, 105208 markings/sec, 175 secs
lola: 19282344 markings, 21334001 edges, 105607 markings/sec, 180 secs
lola: 19812511 markings, 21920536 edges, 106033 markings/sec, 185 secs
lola: 20307821 markings, 22468611 edges, 99062 markings/sec, 190 secs
lola: 20831488 markings, 23048100 edges, 104733 markings/sec, 195 secs
lola: 21355763 markings, 23628166 edges, 104855 markings/sec, 200 secs
lola: 21874013 markings, 24201603 edges, 103650 markings/sec, 205 secs
lola: 22384267 markings, 24766193 edges, 102051 markings/sec, 210 secs
lola: 22912873 markings, 25351128 edges, 105721 markings/sec, 215 secs
lola: 23440023 markings, 25934430 edges, 105430 markings/sec, 220 secs
lola: 23967325 markings, 26517907 edges, 105460 markings/sec, 225 secs
lola: 24496234 markings, 27103124 edges, 105782 markings/sec, 230 secs
lola: 25028484 markings, 27692000 edges, 106450 markings/sec, 235 secs
lola: 25559818 markings, 28279932 edges, 106267 markings/sec, 240 secs
lola: 26090538 markings, 28867234 edges, 106144 markings/sec, 245 secs
lola: 26621801 markings, 29455059 edges, 106253 markings/sec, 250 secs
lola: 27152832 markings, 30042613 edges, 106206 markings/sec, 255 secs
lola: 27651747 markings, 30594717 edges, 99783 markings/sec, 260 secs
lola: 28180533 markings, 31179755 edges, 105757 markings/sec, 265 secs
lola: 28707152 markings, 31762477 edges, 105324 markings/sec, 270 secs
lola: 29172971 markings, 32277936 edges, 93164 markings/sec, 275 secs
lola: 29662103 markings, 32819166 edges, 97826 markings/sec, 280 secs
lola: 30166288 markings, 33377052 edges, 100837 markings/sec, 285 secs
lola: 30678105 markings, 33943410 edges, 102363 markings/sec, 290 secs
lola: 31198883 markings, 34519580 edges, 104156 markings/sec, 295 secs
lola: 31709854 markings, 35084987 edges, 102194 markings/sec, 300 secs
lola: 32227965 markings, 35658302 edges, 103622 markings/sec, 305 secs
lola: 32735451 markings, 36219845 edges, 101497 markings/sec, 310 secs
lola: 33230602 markings, 36767725 edges, 99030 markings/sec, 315 secs
lola: 33706305 markings, 37294100 edges, 95141 markings/sec, 320 secs
lola: 34189657 markings, 37828950 edges, 96670 markings/sec, 325 secs
lola: 34701070 markings, 38394782 edges, 102283 markings/sec, 330 secs
lola: 35188817 markings, 38934496 edges, 97549 markings/sec, 335 secs
lola: 35655380 markings, 39450764 edges, 93313 markings/sec, 340 secs
lola: 36145646 markings, 39993257 edges, 98053 markings/sec, 345 secs
lola: 36668424 markings, 40571715 edges, 104556 markings/sec, 350 secs
lola: 37191637 markings, 41150678 edges, 104643 markings/sec, 355 secs
lola: 37674310 markings, 41684769 edges, 96535 markings/sec, 360 secs
lola: 38136416 markings, 42196114 edges, 92421 markings/sec, 365 secs
lola: 38597813 markings, 42706588 edges, 92279 markings/sec, 370 secs
lola: 39092506 markings, 43254000 edges, 98939 markings/sec, 375 secs
lola: 39548802 markings, 43758915 edges, 91259 markings/sec, 380 secs
lola: 40011857 markings, 44271293 edges, 92611 markings/sec, 385 secs
lola: 40512986 markings, 44825795 edges, 100226 markings/sec, 390 secs
lola: 41019036 markings, 45385693 edges, 101210 markings/sec, 395 secs
lola: 41490628 markings, 45907524 edges, 94318 markings/sec, 400 secs
lola: 41975590 markings, 46444241 edges, 96992 markings/sec, 405 secs
lola: 42453971 markings, 46973516 edges, 95676 markings/sec, 410 secs
lola: 42956223 markings, 47529233 edges, 100450 markings/sec, 415 secs
lola: 43427621 markings, 48050887 edges, 94280 markings/sec, 420 secs
lola: 43908589 markings, 48583089 edges, 96194 markings/sec, 425 secs
lola: 44428745 markings, 49158663 edges, 104031 markings/sec, 430 secs
lola: 44926566 markings, 49709493 edges, 99564 markings/sec, 435 secs
lola: 45409576 markings, 50243924 edges, 96602 markings/sec, 440 secs
lola: 45887110 markings, 50772336 edges, 95507 markings/sec, 445 secs
lola: 46394942 markings, 51334286 edges, 101566 markings/sec, 450 secs
lola: 46926099 markings, 51922013 edges, 106231 markings/sec, 455 secs
lola: 47457169 markings, 52509646 edges, 106214 markings/sec, 460 secs
lola: 47986342 markings, 53095227 edges, 105835 markings/sec, 465 secs
lola: 48515903 markings, 53681167 edges, 105912 markings/sec, 470 secs
lola: 49045524 markings, 54267166 edges, 105924 markings/sec, 475 secs
lola: 49575157 markings, 54853279 edges, 105927 markings/sec, 480 secs
lola: 50104958 markings, 55439520 edges, 105960 markings/sec, 485 secs
lola: 50635157 markings, 56026237 edges, 106040 markings/sec, 490 secs
lola: 51166219 markings, 56613872 edges, 106212 markings/sec, 495 secs
lola: 51697517 markings, 57201689 edges, 106260 markings/sec, 500 secs
lola: 52227705 markings, 57788362 edges, 106038 markings/sec, 505 secs
lola: 52757139 markings, 58374229 edges, 105887 markings/sec, 510 secs
lola: 53237257 markings, 58905472 edges, 96024 markings/sec, 515 secs
lola: 53747563 markings, 59470132 edges, 102061 markings/sec, 520 secs
lola: 54276900 markings, 60055793 edges, 105867 markings/sec, 525 secs
lola: 54805770 markings, 60641025 edges, 105774 markings/sec, 530 secs
lola: 55335011 markings, 61226746 edges, 105848 markings/sec, 535 secs
lola: 55864418 markings, 61812559 edges, 105881 markings/sec, 540 secs
lola: 56395048 markings, 62399639 edges, 106126 markings/sec, 545 secs
lola: 56927159 markings, 62988450 edges, 106422 markings/sec, 550 secs
lola: 57458512 markings, 63576502 edges, 106271 markings/sec, 555 secs
lola: 57988990 markings, 64163389 edges, 106096 markings/sec, 560 secs
lola: 58518413 markings, 64749198 edges, 105885 markings/sec, 565 secs
lola: 59047322 markings, 65334435 edges, 105782 markings/sec, 570 secs
lola: 59577240 markings, 65920842 edges, 105984 markings/sec, 575 secs
lola: 60106654 markings, 66506629 edges, 105883 markings/sec, 580 secs
lola: 60636626 markings, 67093058 edges, 105994 markings/sec, 585 secs
lola: 61168923 markings, 67682065 edges, 106459 markings/sec, 590 secs
lola: 61698914 markings, 68268503 edges, 105998 markings/sec, 595 secs
lola: 62228645 markings, 68854688 edges, 105946 markings/sec, 600 secs
lola: 62755638 markings, 69437775 edges, 105399 markings/sec, 605 secs
lola: 63282020 markings, 70020273 edges, 105276 markings/sec, 610 secs
lola: 63714593 markings, 70499013 edges, 86515 markings/sec, 615 secs
lola: 64174334 markings, 71007574 edges, 91948 markings/sec, 620 secs
lola: 64598470 markings, 71476975 edges, 84827 markings/sec, 625 secs
lola: 65109735 markings, 72042700 edges, 102253 markings/sec, 630 secs
lola: 65523312 markings, 72500313 edges, 82715 markings/sec, 635 secs
lola: 66009623 markings, 73038505 edges, 97262 markings/sec, 640 secs
lola: 66495752 markings, 73576417 edges, 97226 markings/sec, 645 secs
lola: 67010220 markings, 74145645 edges, 102894 markings/sec, 650 secs
lola: 67527522 markings, 74718018 edges, 103460 markings/sec, 655 secs
lola: 68039345 markings, 75284401 edges, 102365 markings/sec, 660 secs
lola: 68536438 markings, 75834415 edges, 99419 markings/sec, 665 secs
lola: 69012496 markings, 76361199 edges, 95212 markings/sec, 670 secs
lola: 69525125 markings, 76928433 edges, 102526 markings/sec, 675 secs
lola: 70031106 markings, 77488323 edges, 101196 markings/sec, 680 secs
lola: 70484682 markings, 77990176 edges, 90715 markings/sec, 685 secs
lola: 70995901 markings, 78555879 edges, 102244 markings/sec, 690 secs
lola: 71454098 markings, 79062966 edges, 91639 markings/sec, 695 secs
lola: 71939256 markings, 79599767 edges, 97032 markings/sec, 700 secs
lola: 72393737 markings, 80102675 edges, 90896 markings/sec, 705 secs
lola: 72909548 markings, 80673400 edges, 103162 markings/sec, 710 secs
lola: 73408439 markings, 81225437 edges, 99778 markings/sec, 715 secs
lola: 73885908 markings, 81753735 edges, 95494 markings/sec, 720 secs
lola: 74398733 markings, 82321228 edges, 102565 markings/sec, 725 secs
lola: 74912212 markings, 82889407 edges, 102696 markings/sec, 730 secs
lola: 75426165 markings, 83458046 edges, 102791 markings/sec, 735 secs
lola: 75895441 markings, 83977361 edges, 93855 markings/sec, 740 secs
lola: 76408231 markings, 84544820 edges, 102558 markings/sec, 745 secs
lola: 76898054 markings, 85086841 edges, 97965 markings/sec, 750 secs
lola: 77385314 markings, 85625961 edges, 97452 markings/sec, 755 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G (F ((1 <= p92))) OR F (G ((1 <= p677))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p677)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p677)))
lola: processed formula length: 19
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 27 edges
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p92)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p92)))
lola: processed formula length: 18
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: ========================================
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown no no yes no no no no unknown no
lola:
preliminary result: no no unknown no no yes no no no no unknown no
lola: memory consumption: 3868 KB
lola: time consumption: 2470 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DoubleExponent-PT-020, 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 r178-tajo-158987882900786"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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