Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961258100729.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258100729
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 63K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 54K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 49K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 169K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 911K Apr 27 15:14 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-5-00
FORMULA_NAME Peterson-PT-5-01
FORMULA_NAME Peterson-PT-5-02
FORMULA_NAME Peterson-PT-5-03
FORMULA_NAME Peterson-PT-5-04
FORMULA_NAME Peterson-PT-5-05
FORMULA_NAME Peterson-PT-5-06
FORMULA_NAME Peterson-PT-5-07
FORMULA_NAME Peterson-PT-5-08
FORMULA_NAME Peterson-PT-5-09
FORMULA_NAME Peterson-PT-5-10
FORMULA_NAME Peterson-PT-5-11
FORMULA_NAME Peterson-PT-5-12
FORMULA_NAME Peterson-PT-5-13
FORMULA_NAME Peterson-PT-5-14
FORMULA_NAME Peterson-PT-5-15

=== Now, execution of the tool begins

BK_START 1590024130502

[2020-05-21 01:22:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-21 01:22:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 01:22:13] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2020-05-21 01:22:13] [INFO ] Transformed 834 places.
[2020-05-21 01:22:13] [INFO ] Transformed 1242 transitions.
[2020-05-21 01:22:13] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 229 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 105 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 936 ms. (steps per millisecond=106 ) properties seen :[1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0]
[2020-05-21 01:22:14] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2020-05-21 01:22:14] [INFO ] Computed 23 place invariants in 43 ms
[2020-05-21 01:22:14] [INFO ] [Real]Absence check using 17 positive place invariants in 31 ms returned unsat
[2020-05-21 01:22:14] [INFO ] [Real]Absence check using 17 positive place invariants in 40 ms returned sat
[2020-05-21 01:22:14] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:22:16] [INFO ] [Real]Absence check using state equation in 2020 ms returned sat
[2020-05-21 01:22:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:22:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 40 ms returned sat
[2020-05-21 01:22:17] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:22:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:22:18] [INFO ] [Nat]Absence check using state equation in 1875 ms returned sat
[2020-05-21 01:22:18] [INFO ] State equation strengthened by 230 read => feed constraints.
[2020-05-21 01:22:19] [INFO ] [Nat]Added 230 Read/Feed constraints in 96 ms returned sat
[2020-05-21 01:22:19] [INFO ] Deduced a trap composed of 27 places in 768 ms
[2020-05-21 01:22:20] [INFO ] Deduced a trap composed of 27 places in 630 ms
[2020-05-21 01:22:21] [INFO ] Deduced a trap composed of 27 places in 836 ms
[2020-05-21 01:22:22] [INFO ] Deduced a trap composed of 27 places in 744 ms
[2020-05-21 01:22:22] [INFO ] Deduced a trap composed of 11 places in 637 ms
[2020-05-21 01:22:23] [INFO ] Deduced a trap composed of 11 places in 624 ms
[2020-05-21 01:22:24] [INFO ] Deduced a trap composed of 11 places in 644 ms
[2020-05-21 01:22:24] [INFO ] Deduced a trap composed of 27 places in 601 ms
[2020-05-21 01:22:25] [INFO ] Deduced a trap composed of 27 places in 632 ms
[2020-05-21 01:22:26] [INFO ] Deduced a trap composed of 32 places in 585 ms
[2020-05-21 01:22:26] [INFO ] Deduced a trap composed of 27 places in 599 ms
[2020-05-21 01:22:27] [INFO ] Deduced a trap composed of 37 places in 600 ms
[2020-05-21 01:22:28] [INFO ] Deduced a trap composed of 11 places in 657 ms
[2020-05-21 01:22:28] [INFO ] Deduced a trap composed of 27 places in 606 ms
[2020-05-21 01:22:29] [INFO ] Deduced a trap composed of 27 places in 697 ms
[2020-05-21 01:22:30] [INFO ] Deduced a trap composed of 28 places in 645 ms
[2020-05-21 01:22:31] [INFO ] Deduced a trap composed of 15 places in 557 ms
[2020-05-21 01:22:31] [INFO ] Deduced a trap composed of 11 places in 638 ms
[2020-05-21 01:22:32] [INFO ] Deduced a trap composed of 133 places in 512 ms
[2020-05-21 01:22:32] [INFO ] Deduced a trap composed of 78 places in 465 ms
[2020-05-21 01:22:33] [INFO ] Deduced a trap composed of 101 places in 488 ms
[2020-05-21 01:22:33] [INFO ] Deduced a trap composed of 82 places in 472 ms
[2020-05-21 01:22:34] [INFO ] Deduced a trap composed of 82 places in 441 ms
[2020-05-21 01:22:34] [INFO ] Deduced a trap composed of 82 places in 469 ms
[2020-05-21 01:22:35] [INFO ] Deduced a trap composed of 104 places in 438 ms
[2020-05-21 01:22:35] [INFO ] Deduced a trap composed of 269 places in 416 ms
[2020-05-21 01:22:36] [INFO ] Deduced a trap composed of 67 places in 240 ms
[2020-05-21 01:22:36] [INFO ] Deduced a trap composed of 74 places in 298 ms
[2020-05-21 01:22:36] [INFO ] Deduced a trap composed of 78 places in 230 ms
[2020-05-21 01:22:37] [INFO ] Deduced a trap composed of 74 places in 214 ms
[2020-05-21 01:22:37] [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 (> (+ s3 s9 s13 s35 s37 s42 s67 s70 s73 s93 s99 s118 s138 s145 s166 s173 s202 s207 s209 s233 s239 s245 s260 s262 s265 s272 s288 s294 s297 s318 s324 s350 s375 s387 s389 s394 s414 s421 s426 s438 s462 s467 s477 s494 s517 s528 s539 s546 s557 s572 s581 s592 s595 s617 s624 s627 s640 s646 s668 s672 s674 s700 s704 s710 s722 s736 s746 s770 s781 s795 s801 s812 s815 s821) 0)") while checking expression at index 1
[2020-05-21 01:22:37] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2020-05-21 01:22:37] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:22:38] [INFO ] [Real]Absence check using state equation in 1685 ms returned sat
[2020-05-21 01:22:38] [INFO ] [Real]Added 230 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:22:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:22:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 31 ms returned sat
[2020-05-21 01:22:39] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2020-05-21 01:22:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:22:40] [INFO ] [Nat]Absence check using state equation in 1771 ms returned sat
[2020-05-21 01:22:40] [INFO ] [Nat]Added 230 Read/Feed constraints in 64 ms returned sat
[2020-05-21 01:22:41] [INFO ] Deduced a trap composed of 32 places in 478 ms
[2020-05-21 01:22:41] [INFO ] Deduced a trap composed of 11 places in 489 ms
[2020-05-21 01:22:42] [INFO ] Deduced a trap composed of 51 places in 594 ms
[2020-05-21 01:22:43] [INFO ] Deduced a trap composed of 27 places in 479 ms
[2020-05-21 01:22:43] [INFO ] Deduced a trap composed of 49 places in 437 ms
[2020-05-21 01:22:44] [INFO ] Deduced a trap composed of 27 places in 474 ms
[2020-05-21 01:22:44] [INFO ] Deduced a trap composed of 27 places in 496 ms
[2020-05-21 01:22:45] [INFO ] Deduced a trap composed of 27 places in 484 ms
[2020-05-21 01:22:45] [INFO ] Deduced a trap composed of 27 places in 509 ms
[2020-05-21 01:22:46] [INFO ] Deduced a trap composed of 27 places in 477 ms
[2020-05-21 01:22:46] [INFO ] Deduced a trap composed of 11 places in 494 ms
[2020-05-21 01:22:47] [INFO ] Deduced a trap composed of 82 places in 460 ms
[2020-05-21 01:22:47] [INFO ] Deduced a trap composed of 82 places in 458 ms
[2020-05-21 01:22:48] [INFO ] Deduced a trap composed of 37 places in 459 ms
[2020-05-21 01:22:48] [INFO ] Deduced a trap composed of 27 places in 501 ms
[2020-05-21 01:22:49] [INFO ] Deduced a trap composed of 27 places in 516 ms
[2020-05-21 01:22:49] [INFO ] Deduced a trap composed of 11 places in 467 ms
[2020-05-21 01:22:50] [INFO ] Deduced a trap composed of 11 places in 461 ms
[2020-05-21 01:22:51] [INFO ] Deduced a trap composed of 11 places in 524 ms
[2020-05-21 01:22:51] [INFO ] Deduced a trap composed of 28 places in 470 ms
[2020-05-21 01:22:52] [INFO ] Deduced a trap composed of 104 places in 409 ms
[2020-05-21 01:22:52] [INFO ] Deduced a trap composed of 63 places in 368 ms
[2020-05-21 01:22:52] [INFO ] Deduced a trap composed of 103 places in 370 ms
[2020-05-21 01:22:53] [INFO ] Deduced a trap composed of 78 places in 404 ms
[2020-05-21 01:22:53] [INFO ] Deduced a trap composed of 115 places in 469 ms
[2020-05-21 01:22:54] [INFO ] Deduced a trap composed of 108 places in 341 ms
[2020-05-21 01:22:54] [INFO ] Deduced a trap composed of 108 places in 360 ms
[2020-05-21 01:22:54] [INFO ] Deduced a trap composed of 56 places in 343 ms
[2020-05-21 01:22:55] [INFO ] Deduced a trap composed of 162 places in 382 ms
[2020-05-21 01:22:55] [INFO ] Deduced a trap composed of 59 places in 495 ms
[2020-05-21 01:22:56] [INFO ] Deduced a trap composed of 105 places in 436 ms
[2020-05-21 01:22:56] [INFO ] Deduced a trap composed of 105 places in 423 ms
[2020-05-21 01:22:57] [INFO ] Deduced a trap composed of 161 places in 273 ms
[2020-05-21 01:22:57] [INFO ] Deduced a trap composed of 188 places in 351 ms
[2020-05-21 01:22:58] [INFO ] Deduced a trap composed of 59 places in 326 ms
[2020-05-21 01:22:58] [INFO ] Deduced a trap composed of 89 places in 251 ms
[2020-05-21 01:22:58] [INFO ] Deduced a trap composed of 37 places in 306 ms
[2020-05-21 01:22:59] [INFO ] Deduced a trap composed of 63 places in 261 ms
[2020-05-21 01:22: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 s6 s32 s34 s57 s62 s85 s98 s121 s133 s142 s148 s180 s186 s212 s214 s232 s244 s250 s255 s257 s289 s316 s321 s344 s353 s380 s401 s424 s436 s437 s464 s469 s479 s482 s501 s506 s522 s531 s538 s559 s564 s578 s588 s614 s620 s630 s643 s649 s675 s677 s715 s722 s741 s747 s756 s784 s786 s790 s801 s812 s815 s828) 0)") while checking expression at index 2
[2020-05-21 01:22:59] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned unsat
[2020-05-21 01:22:59] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned unsat
[2020-05-21 01:22:59] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned unsat
[2020-05-21 01:22:59] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned unsat
[2020-05-21 01:22:59] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned unsat
[2020-05-21 01:22:59] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2020-05-21 01:22:59] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:22:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:23:01] [INFO ] [Real]Absence check using state equation in 1693 ms returned sat
[2020-05-21 01:23:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:23:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 32 ms returned sat
[2020-05-21 01:23:01] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:23:03] [INFO ] [Nat]Absence check using state equation in 1756 ms returned sat
[2020-05-21 01:23:03] [INFO ] [Nat]Added 230 Read/Feed constraints in 97 ms returned sat
[2020-05-21 01:23:04] [INFO ] Deduced a trap composed of 11 places in 563 ms
[2020-05-21 01:23:04] [INFO ] Deduced a trap composed of 11 places in 503 ms
[2020-05-21 01:23:05] [INFO ] Deduced a trap composed of 74 places in 509 ms
[2020-05-21 01:23:05] [INFO ] Deduced a trap composed of 18 places in 527 ms
[2020-05-21 01:23:06] [INFO ] Deduced a trap composed of 106 places in 555 ms
[2020-05-21 01:23:06] [INFO ] Deduced a trap composed of 41 places in 531 ms
[2020-05-21 01:23:07] [INFO ] Deduced a trap composed of 51 places in 553 ms
[2020-05-21 01:23:08] [INFO ] Deduced a trap composed of 11 places in 590 ms
[2020-05-21 01:23:08] [INFO ] Deduced a trap composed of 51 places in 537 ms
[2020-05-21 01:23:09] [INFO ] Deduced a trap composed of 11 places in 529 ms
[2020-05-21 01:23:09] [INFO ] Deduced a trap composed of 11 places in 548 ms
[2020-05-21 01:23:10] [INFO ] Deduced a trap composed of 14 places in 538 ms
[2020-05-21 01:23:11] [INFO ] Deduced a trap composed of 69 places in 513 ms
[2020-05-21 01:23:11] [INFO ] Deduced a trap composed of 76 places in 460 ms
[2020-05-21 01:23:12] [INFO ] Deduced a trap composed of 82 places in 545 ms
[2020-05-21 01:23:12] [INFO ] Deduced a trap composed of 79 places in 515 ms
[2020-05-21 01:23:13] [INFO ] Deduced a trap composed of 75 places in 501 ms
[2020-05-21 01:23:13] [INFO ] Deduced a trap composed of 78 places in 516 ms
[2020-05-21 01:23:14] [INFO ] Deduced a trap composed of 56 places in 621 ms
[2020-05-21 01:23:15] [INFO ] Deduced a trap composed of 56 places in 485 ms
[2020-05-21 01:23:15] [INFO ] Deduced a trap composed of 56 places in 449 ms
[2020-05-21 01:23:16] [INFO ] Deduced a trap composed of 31 places in 574 ms
[2020-05-21 01:23:16] [INFO ] Deduced a trap composed of 110 places in 408 ms
[2020-05-21 01:23:17] [INFO ] Deduced a trap composed of 110 places in 375 ms
[2020-05-21 01:23:17] [INFO ] Deduced a trap composed of 110 places in 374 ms
[2020-05-21 01:23:18] [INFO ] Deduced a trap composed of 117 places in 401 ms
[2020-05-21 01:23:18] [INFO ] Deduced a trap composed of 149 places in 381 ms
[2020-05-21 01:23:18] [INFO ] Deduced a trap composed of 67 places in 332 ms
[2020-05-21 01:23:19] [INFO ] Deduced a trap composed of 67 places in 330 ms
[2020-05-21 01:23:19] [INFO ] Deduced a trap composed of 126 places in 361 ms
[2020-05-21 01:23:19] [INFO ] Deduced a trap composed of 108 places in 234 ms
[2020-05-21 01:23:20] [INFO ] Deduced a trap composed of 108 places in 237 ms
[2020-05-21 01:23:20] [INFO ] Deduced a trap composed of 108 places in 207 ms
[2020-05-21 01:23:20] [INFO ] Deduced a trap composed of 108 places in 257 ms
[2020-05-21 01:23:21] [INFO ] Deduced a trap composed of 147 places in 211 ms
[2020-05-21 01:23:21] [INFO ] Deduced a trap composed of 15 places in 219 ms
[2020-05-21 01:23:21] [INFO ] Deduced a trap composed of 55 places in 203 ms
[2020-05-21 01:23: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 (> (+ s2 s4 s6 s30 s34 s36 s66 s87 s174 s176 s210 s212 s216 s244 s246 s248 s253 s257 s259 s285 s342 s383 s390 s392 s393 s422 s424 s435 s464 s466 s484 s508 s518 s520 s531 s582 s584 s588 s616 s618 s620 s647 s673 s675 s679 s743 s782 s788 s794 s796 s797 s802 s818 s824 s827) 0)") while checking expression at index 8
[2020-05-21 01:23:21] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2020-05-21 01:23:21] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:23:23] [INFO ] [Real]Absence check using state equation in 1691 ms returned sat
[2020-05-21 01:23:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:23:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 34 ms returned sat
[2020-05-21 01:23:23] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-21 01:23:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:23:25] [INFO ] [Nat]Absence check using state equation in 1670 ms returned sat
[2020-05-21 01:23:25] [INFO ] [Nat]Added 230 Read/Feed constraints in 74 ms returned sat
[2020-05-21 01:23:25] [INFO ] Deduced a trap composed of 44 places in 390 ms
[2020-05-21 01:23:26] [INFO ] Deduced a trap composed of 32 places in 444 ms
[2020-05-21 01:23:26] [INFO ] Deduced a trap composed of 45 places in 398 ms
[2020-05-21 01:23:27] [INFO ] Deduced a trap composed of 45 places in 397 ms
[2020-05-21 01:23:27] [INFO ] Deduced a trap composed of 45 places in 392 ms
[2020-05-21 01:23:27] [INFO ] Deduced a trap composed of 55 places in 388 ms
[2020-05-21 01:23:28] [INFO ] Deduced a trap composed of 44 places in 404 ms
[2020-05-21 01:23:28] [INFO ] Deduced a trap composed of 11 places in 418 ms
[2020-05-21 01:23:29] [INFO ] Deduced a trap composed of 11 places in 412 ms
[2020-05-21 01:23:29] [INFO ] Deduced a trap composed of 11 places in 438 ms
[2020-05-21 01:23:30] [INFO ] Deduced a trap composed of 18 places in 381 ms
[2020-05-21 01:23:30] [INFO ] Deduced a trap composed of 11 places in 428 ms
[2020-05-21 01:23:31] [INFO ] Deduced a trap composed of 30 places in 411 ms
[2020-05-21 01:23:31] [INFO ] Deduced a trap composed of 11 places in 422 ms
[2020-05-21 01:23:31] [INFO ] Deduced a trap composed of 98 places in 358 ms
[2020-05-21 01:23:32] [INFO ] Deduced a trap composed of 72 places in 371 ms
[2020-05-21 01:23:32] [INFO ] Deduced a trap composed of 111 places in 317 ms
[2020-05-21 01:23:33] [INFO ] Deduced a trap composed of 92 places in 385 ms
[2020-05-21 01:23:33] [INFO ] Deduced a trap composed of 71 places in 320 ms
[2020-05-21 01:23:33] [INFO ] Deduced a trap composed of 70 places in 306 ms
[2020-05-21 01:23:34] [INFO ] Deduced a trap composed of 70 places in 337 ms
[2020-05-21 01:23:34] [INFO ] Deduced a trap composed of 133 places in 220 ms
[2020-05-21 01:23:34] [INFO ] Deduced a trap composed of 97 places in 217 ms
[2020-05-21 01:23:35] [INFO ] Deduced a trap composed of 96 places in 254 ms
[2020-05-21 01:23:35] [INFO ] Deduced a trap composed of 97 places in 206 ms
[2020-05-21 01:23:35] [INFO ] Deduced a trap composed of 97 places in 246 ms
[2020-05-21 01:23:35] [INFO ] Deduced a trap composed of 125 places in 216 ms
[2020-05-21 01:23:36] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 10741 ms
[2020-05-21 01:23:36] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 66 ms.
[2020-05-21 01:23:43] [INFO ] Added : 480 causal constraints over 96 iterations in 7408 ms. Result :(error "Failed to check-sat")
[2020-05-21 01:23:43] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned sat
[2020-05-21 01:23:43] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:23:45] [INFO ] [Real]Absence check using state equation in 1695 ms returned sat
[2020-05-21 01:23:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:23:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 40 ms returned sat
[2020-05-21 01:23:45] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:23:47] [INFO ] [Nat]Absence check using state equation in 1669 ms returned sat
[2020-05-21 01:23:47] [INFO ] [Nat]Added 230 Read/Feed constraints in 79 ms returned sat
[2020-05-21 01:23:47] [INFO ] Deduced a trap composed of 14 places in 479 ms
[2020-05-21 01:23:48] [INFO ] Deduced a trap composed of 28 places in 492 ms
[2020-05-21 01:23:48] [INFO ] Deduced a trap composed of 11 places in 476 ms
[2020-05-21 01:23:49] [INFO ] Deduced a trap composed of 11 places in 472 ms
[2020-05-21 01:23:49] [INFO ] Deduced a trap composed of 41 places in 478 ms
[2020-05-21 01:23:50] [INFO ] Deduced a trap composed of 41 places in 523 ms
[2020-05-21 01:23:50] [INFO ] Deduced a trap composed of 155 places in 485 ms
[2020-05-21 01:23:51] [INFO ] Deduced a trap composed of 112 places in 486 ms
[2020-05-21 01:23:51] [INFO ] Deduced a trap composed of 76 places in 499 ms
[2020-05-21 01:23:52] [INFO ] Deduced a trap composed of 41 places in 497 ms
[2020-05-21 01:23:53] [INFO ] Deduced a trap composed of 86 places in 452 ms
[2020-05-21 01:23:53] [INFO ] Deduced a trap composed of 109 places in 463 ms
[2020-05-21 01:23:54] [INFO ] Deduced a trap composed of 123 places in 515 ms
[2020-05-21 01:23:54] [INFO ] Deduced a trap composed of 86 places in 452 ms
[2020-05-21 01:23:55] [INFO ] Deduced a trap composed of 28 places in 434 ms
[2020-05-21 01:23:55] [INFO ] Deduced a trap composed of 82 places in 412 ms
[2020-05-21 01:23:56] [INFO ] Deduced a trap composed of 15 places in 428 ms
[2020-05-21 01:23:56] [INFO ] Deduced a trap composed of 15 places in 462 ms
[2020-05-21 01:23:57] [INFO ] Deduced a trap composed of 15 places in 473 ms
[2020-05-21 01:23:57] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 9932 ms
[2020-05-21 01:23:57] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 73 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2020-05-21 01:24:05] [INFO ] Added : 520 causal constraints over 104 iterations in 8188 ms. Result :(error "Failed to check-sat")
[2020-05-21 01:24:05] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned unsat
[2020-05-21 01:24:05] [INFO ] [Real]Absence check using 17 positive place invariants in 30 ms returned sat
[2020-05-21 01:24:05] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2020-05-21 01:24:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:07] [INFO ] [Real]Absence check using state equation in 1776 ms returned sat
[2020-05-21 01:24:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:24:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 31 ms returned sat
[2020-05-21 01:24:07] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:24:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:09] [INFO ] [Nat]Absence check using state equation in 1683 ms returned sat
[2020-05-21 01:24:09] [INFO ] [Nat]Added 230 Read/Feed constraints in 72 ms returned sat
[2020-05-21 01:24:09] [INFO ] Deduced a trap composed of 49 places in 536 ms
[2020-05-21 01:24:10] [INFO ] Deduced a trap composed of 50 places in 485 ms
[2020-05-21 01:24:10] [INFO ] Deduced a trap composed of 50 places in 513 ms
[2020-05-21 01:24:11] [INFO ] Deduced a trap composed of 50 places in 516 ms
[2020-05-21 01:24:12] [INFO ] Deduced a trap composed of 159 places in 557 ms
[2020-05-21 01:24:12] [INFO ] Deduced a trap composed of 11 places in 616 ms
[2020-05-21 01:24:13] [INFO ] Deduced a trap composed of 18 places in 577 ms
[2020-05-21 01:24:13] [INFO ] Deduced a trap composed of 11 places in 538 ms
[2020-05-21 01:24:14] [INFO ] Deduced a trap composed of 11 places in 538 ms
[2020-05-21 01:24:15] [INFO ] Deduced a trap composed of 11 places in 505 ms
[2020-05-21 01:24:15] [INFO ] Deduced a trap composed of 49 places in 493 ms
[2020-05-21 01:24:16] [INFO ] Deduced a trap composed of 49 places in 510 ms
[2020-05-21 01:24:16] [INFO ] Deduced a trap composed of 155 places in 527 ms
[2020-05-21 01:24:17] [INFO ] Deduced a trap composed of 11 places in 573 ms
[2020-05-21 01:24:17] [INFO ] Deduced a trap composed of 56 places in 459 ms
[2020-05-21 01:24:18] [INFO ] Deduced a trap composed of 60 places in 447 ms
[2020-05-21 01:24:18] [INFO ] Deduced a trap composed of 51 places in 497 ms
[2020-05-21 01:24:19] [INFO ] Deduced a trap composed of 51 places in 528 ms
[2020-05-21 01:24:19] [INFO ] Deduced a trap composed of 88 places in 472 ms
[2020-05-21 01:24:20] [INFO ] Deduced a trap composed of 51 places in 526 ms
[2020-05-21 01:24:21] [INFO ] Deduced a trap composed of 51 places in 482 ms
[2020-05-21 01:24:21] [INFO ] Deduced a trap composed of 56 places in 477 ms
[2020-05-21 01:24:22] [INFO ] Deduced a trap composed of 56 places in 478 ms
[2020-05-21 01:24:22] [INFO ] Deduced a trap composed of 78 places in 486 ms
[2020-05-21 01:24:23] [INFO ] Deduced a trap composed of 82 places in 604 ms
[2020-05-21 01:24:23] [INFO ] Deduced a trap composed of 70 places in 494 ms
[2020-05-21 01:24:24] [INFO ] Deduced a trap composed of 70 places in 456 ms
[2020-05-21 01:24:25] [INFO ] Deduced a trap composed of 167 places in 735 ms
[2020-05-21 01:24:25] [INFO ] Deduced a trap composed of 193 places in 543 ms
[2020-05-21 01:24:26] [INFO ] Deduced a trap composed of 115 places in 465 ms
[2020-05-21 01:24:26] [INFO ] Deduced a trap composed of 46 places in 515 ms
[2020-05-21 01:24:27] [INFO ] Deduced a trap composed of 37 places in 513 ms
[2020-05-21 01:24:27] [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 s32 s57 s85 s121 s142 s186 s206 s214 s250 s255 s316 s344 s380 s382 s401 s436 s469 s482 s506 s522 s529 s564 s578 s614 s621 s649 s677 s721 s741 s756 s784 s786 s797 s802 s818 s824) 0)") while checking expression at index 12
[2020-05-21 01:24:27] [INFO ] [Real]Absence check using 17 positive place invariants in 36 ms returned sat
[2020-05-21 01:24:27] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:24:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:29] [INFO ] [Real]Absence check using state equation in 1784 ms returned sat
[2020-05-21 01:24:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:24:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 30 ms returned sat
[2020-05-21 01:24:29] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:24:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:31] [INFO ] [Nat]Absence check using state equation in 1708 ms returned sat
[2020-05-21 01:24:31] [INFO ] [Nat]Added 230 Read/Feed constraints in 76 ms returned sat
[2020-05-21 01:24:31] [INFO ] Deduced a trap composed of 49 places in 523 ms
[2020-05-21 01:24:32] [INFO ] Deduced a trap composed of 50 places in 480 ms
[2020-05-21 01:24:32] [INFO ] Deduced a trap composed of 50 places in 509 ms
[2020-05-21 01:24:33] [INFO ] Deduced a trap composed of 50 places in 509 ms
[2020-05-21 01:24:34] [INFO ] Deduced a trap composed of 159 places in 496 ms
[2020-05-21 01:24:34] [INFO ] Deduced a trap composed of 11 places in 503 ms
[2020-05-21 01:24:35] [INFO ] Deduced a trap composed of 18 places in 521 ms
[2020-05-21 01:24:35] [INFO ] Deduced a trap composed of 11 places in 521 ms
[2020-05-21 01:24:36] [INFO ] Deduced a trap composed of 11 places in 498 ms
[2020-05-21 01:24:36] [INFO ] Deduced a trap composed of 11 places in 542 ms
[2020-05-21 01:24:37] [INFO ] Deduced a trap composed of 49 places in 492 ms
[2020-05-21 01:24:38] [INFO ] Deduced a trap composed of 49 places in 579 ms
[2020-05-21 01:24:38] [INFO ] Deduced a trap composed of 155 places in 545 ms
[2020-05-21 01:24:39] [INFO ] Deduced a trap composed of 11 places in 538 ms
[2020-05-21 01:24:39] [INFO ] Deduced a trap composed of 56 places in 480 ms
[2020-05-21 01:24:40] [INFO ] Deduced a trap composed of 60 places in 463 ms
[2020-05-21 01:24:40] [INFO ] Deduced a trap composed of 51 places in 497 ms
[2020-05-21 01:24:41] [INFO ] Deduced a trap composed of 51 places in 511 ms
[2020-05-21 01:24:41] [INFO ] Deduced a trap composed of 88 places in 431 ms
[2020-05-21 01:24:42] [INFO ] Deduced a trap composed of 51 places in 473 ms
[2020-05-21 01:24:42] [INFO ] Deduced a trap composed of 51 places in 420 ms
[2020-05-21 01:24:43] [INFO ] Deduced a trap composed of 56 places in 524 ms
[2020-05-21 01:24:44] [INFO ] Deduced a trap composed of 56 places in 531 ms
[2020-05-21 01:24:44] [INFO ] Deduced a trap composed of 78 places in 473 ms
[2020-05-21 01:24:45] [INFO ] Deduced a trap composed of 82 places in 502 ms
[2020-05-21 01:24:45] [INFO ] Deduced a trap composed of 70 places in 479 ms
[2020-05-21 01:24:46] [INFO ] Deduced a trap composed of 70 places in 479 ms
[2020-05-21 01:24:46] [INFO ] Deduced a trap composed of 167 places in 487 ms
[2020-05-21 01:24:47] [INFO ] Deduced a trap composed of 193 places in 450 ms
[2020-05-21 01:24:47] [INFO ] Deduced a trap composed of 115 places in 496 ms
[2020-05-21 01:24:48] [INFO ] Deduced a trap composed of 46 places in 428 ms
[2020-05-21 01:24:48] [INFO ] Deduced a trap composed of 37 places in 514 ms
[2020-05-21 01:24:49] [INFO ] Deduced a trap composed of 46 places in 458 ms
[2020-05-21 01:24:49] [INFO ] Deduced a trap composed of 72 places in 474 ms
[2020-05-21 01:24:49] [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 (> (+ s2 s8 s16 s30 s40 s48 s64 s66 s87 s96 s119 s135 s144 s167 s176 s178 s206 s216 s232 s242 s248 s253 s263 s269 s285 s291 s301 s319 s342 s355 s374 s382 s392 s393 s415 s425 s435 s437 s458 s484 s503 s508 s520 s529 s538 s545 s558 s569 s584 s586 s594 s616 s621 s630 s641 s647 s669 s679 s693 s711 s713 s722 s733 s743 s788 s792 s794 s801 s807 s812 s815 s828) 0)") while checking expression at index 13
[2020-05-21 01:24:49] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2020-05-21 01:24:49] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:51] [INFO ] [Real]Absence check using state equation in 1679 ms returned sat
[2020-05-21 01:24:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:24:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 39 ms returned sat
[2020-05-21 01:24:51] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-21 01:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:24:53] [INFO ] [Nat]Absence check using state equation in 1646 ms returned sat
[2020-05-21 01:24:53] [INFO ] [Nat]Added 230 Read/Feed constraints in 70 ms returned sat
[2020-05-21 01:24:54] [INFO ] Deduced a trap composed of 37 places in 491 ms
[2020-05-21 01:24:54] [INFO ] Deduced a trap composed of 37 places in 480 ms
[2020-05-21 01:24:55] [INFO ] Deduced a trap composed of 52 places in 456 ms
[2020-05-21 01:24:55] [INFO ] Deduced a trap composed of 15 places in 466 ms
[2020-05-21 01:24:56] [INFO ] Deduced a trap composed of 67 places in 401 ms
[2020-05-21 01:24:56] [INFO ] Deduced a trap composed of 87 places in 472 ms
[2020-05-21 01:24:57] [INFO ] Deduced a trap composed of 83 places in 485 ms
[2020-05-21 01:24:57] [INFO ] Deduced a trap composed of 11 places in 415 ms
[2020-05-21 01:24:58] [INFO ] Deduced a trap composed of 66 places in 410 ms
[2020-05-21 01:24:58] [INFO ] Deduced a trap composed of 95 places in 390 ms
[2020-05-21 01:24:58] [INFO ] Deduced a trap composed of 63 places in 461 ms
[2020-05-21 01:24:59] [INFO ] Deduced a trap composed of 95 places in 479 ms
[2020-05-21 01:24:59] [INFO ] Deduced a trap composed of 63 places in 412 ms
[2020-05-21 01:25:00] [INFO ] Deduced a trap composed of 11 places in 471 ms
[2020-05-21 01:25:01] [INFO ] Deduced a trap composed of 39 places in 485 ms
[2020-05-21 01:25:01] [INFO ] Deduced a trap composed of 66 places in 442 ms
[2020-05-21 01:25:02] [INFO ] Deduced a trap composed of 15 places in 478 ms
[2020-05-21 01:25:02] [INFO ] Deduced a trap composed of 15 places in 438 ms
[2020-05-21 01:25:03] [INFO ] Deduced a trap composed of 41 places in 492 ms
[2020-05-21 01:25:03] [INFO ] Deduced a trap composed of 51 places in 453 ms
[2020-05-21 01:25:04] [INFO ] Deduced a trap composed of 11 places in 484 ms
[2020-05-21 01:25:04] [INFO ] Deduced a trap composed of 40 places in 491 ms
[2020-05-21 01:25:05] [INFO ] Deduced a trap composed of 53 places in 420 ms
[2020-05-21 01:25:05] [INFO ] Deduced a trap composed of 89 places in 390 ms
[2020-05-21 01:25:06] [INFO ] Deduced a trap composed of 125 places in 408 ms
[2020-05-21 01:25:06] [INFO ] Deduced a trap composed of 41 places in 357 ms
[2020-05-21 01:25:06] [INFO ] Deduced a trap composed of 63 places in 346 ms
[2020-05-21 01:25:07] [INFO ] Deduced a trap composed of 108 places in 238 ms
[2020-05-21 01:25:07] [INFO ] Deduced a trap composed of 89 places in 263 ms
[2020-05-21 01:25:07] [INFO ] Deduced a trap composed of 93 places in 222 ms
[2020-05-21 01:25:07] [INFO ] Deduced a trap composed of 93 places in 207 ms
[2020-05-21 01:25:08] [INFO ] Deduced a trap composed of 123 places in 213 ms
[2020-05-21 01:25:08] [INFO ] Deduced a trap composed of 124 places in 148 ms
[2020-05-21 01:25:08] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 14969 ms
[2020-05-21 01:25:08] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 68 ms.
[2020-05-21 01:25: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 (=> (> t249 0) (and (> t1079 0) (< o1079 o249)))") while checking expression at index 14
[2020-05-21 01:25:11] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2020-05-21 01:25:11] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2020-05-21 01:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:13] [INFO ] [Real]Absence check using state equation in 1654 ms returned sat
[2020-05-21 01:25:13] [INFO ] [Real]Added 230 Read/Feed constraints in 41 ms returned sat
[2020-05-21 01:25:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:25:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 38 ms returned sat
[2020-05-21 01:25:13] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 9 ms returned sat
[2020-05-21 01:25:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:15] [INFO ] [Nat]Absence check using state equation in 1702 ms returned sat
[2020-05-21 01:25:15] [INFO ] [Nat]Added 230 Read/Feed constraints in 122 ms returned sat
[2020-05-21 01:25:15] [INFO ] Deduced a trap composed of 50 places in 403 ms
[2020-05-21 01:25:16] [INFO ] Deduced a trap composed of 52 places in 466 ms
[2020-05-21 01:25:16] [INFO ] Deduced a trap composed of 52 places in 391 ms
[2020-05-21 01:25:17] [INFO ] Deduced a trap composed of 52 places in 448 ms
[2020-05-21 01:25:17] [INFO ] Deduced a trap composed of 84 places in 409 ms
[2020-05-21 01:25:18] [INFO ] Deduced a trap composed of 53 places in 392 ms
[2020-05-21 01:25:18] [INFO ] Deduced a trap composed of 18 places in 481 ms
[2020-05-21 01:25:19] [INFO ] Deduced a trap composed of 82 places in 277 ms
[2020-05-21 01:25:19] [INFO ] Deduced a trap composed of 78 places in 259 ms
[2020-05-21 01:25:19] [INFO ] Deduced a trap composed of 11 places in 408 ms
[2020-05-21 01:25:20] [INFO ] Deduced a trap composed of 78 places in 391 ms
[2020-05-21 01:25:20] [INFO ] Deduced a trap composed of 20 places in 383 ms
[2020-05-21 01:25:21] [INFO ] Deduced a trap composed of 79 places in 381 ms
[2020-05-21 01:25:21] [INFO ] Deduced a trap composed of 104 places in 405 ms
[2020-05-21 01:25:22] [INFO ] Deduced a trap composed of 11 places in 411 ms
[2020-05-21 01:25:22] [INFO ] Deduced a trap composed of 19 places in 384 ms
[2020-05-21 01:25:23] [INFO ] Deduced a trap composed of 78 places in 330 ms
[2020-05-21 01:25:23] [INFO ] Deduced a trap composed of 56 places in 345 ms
[2020-05-21 01:25:23] [INFO ] Deduced a trap composed of 104 places in 258 ms
[2020-05-21 01:25:24] [INFO ] Deduced a trap composed of 104 places in 295 ms
[2020-05-21 01:25:24] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 8576 ms
[2020-05-21 01:25:24] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 56 ms.
[2020-05-21 01:25:33] [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: Broken pipe (=> (> t526 0) (and (> t126 0) (< o126 o526)))") while checking expression at index 15
[2020-05-21 01:25:33] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned unsat
[2020-05-21 01:25:33] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2020-05-21 01:25:33] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2020-05-21 01:25:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:35] [INFO ] [Real]Absence check using state equation in 1721 ms returned sat
[2020-05-21 01:25:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:25:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 38 ms returned sat
[2020-05-21 01:25:35] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:25:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:37] [INFO ] [Nat]Absence check using state equation in 1691 ms returned sat
[2020-05-21 01:25:37] [INFO ] [Nat]Added 230 Read/Feed constraints in 67 ms returned sat
[2020-05-21 01:25:37] [INFO ] Deduced a trap composed of 51 places in 435 ms
[2020-05-21 01:25:38] [INFO ] Deduced a trap composed of 13 places in 459 ms
[2020-05-21 01:25:38] [INFO ] Deduced a trap composed of 11 places in 477 ms
[2020-05-21 01:25:39] [INFO ] Deduced a trap composed of 51 places in 536 ms
[2020-05-21 01:25:40] [INFO ] Deduced a trap composed of 23 places in 527 ms
[2020-05-21 01:25:40] [INFO ] Deduced a trap composed of 56 places in 497 ms
[2020-05-21 01:25:41] [INFO ] Deduced a trap composed of 71 places in 441 ms
[2020-05-21 01:25:41] [INFO ] Deduced a trap composed of 82 places in 447 ms
[2020-05-21 01:25:42] [INFO ] Deduced a trap composed of 82 places in 474 ms
[2020-05-21 01:25:42] [INFO ] Deduced a trap composed of 41 places in 507 ms
[2020-05-21 01:25:43] [INFO ] Deduced a trap composed of 32 places in 518 ms
[2020-05-21 01:25:43] [INFO ] Deduced a trap composed of 41 places in 464 ms
[2020-05-21 01:25:44] [INFO ] Deduced a trap composed of 11 places in 448 ms
[2020-05-21 01:25:44] [INFO ] Deduced a trap composed of 77 places in 397 ms
[2020-05-21 01:25:45] [INFO ] Deduced a trap composed of 60 places in 448 ms
[2020-05-21 01:25:45] [INFO ] Deduced a trap composed of 77 places in 426 ms
[2020-05-21 01:25:46] [INFO ] Deduced a trap composed of 51 places in 369 ms
[2020-05-21 01:25:46] [INFO ] Deduced a trap composed of 51 places in 404 ms
[2020-05-21 01:25:47] [INFO ] Deduced a trap composed of 101 places in 369 ms
[2020-05-21 01:25:47] [INFO ] Deduced a trap composed of 108 places in 308 ms
[2020-05-21 01:25:47] [INFO ] Deduced a trap composed of 49 places in 313 ms
[2020-05-21 01:25:48] [INFO ] Deduced a trap composed of 45 places in 295 ms
[2020-05-21 01:25:48] [INFO ] Deduced a trap composed of 71 places in 309 ms
[2020-05-21 01:25:48] [INFO ] Deduced a trap composed of 74 places in 300 ms
[2020-05-21 01:25:49] [INFO ] Deduced a trap composed of 56 places in 439 ms
[2020-05-21 01:25:49] [INFO ] Deduced a trap composed of 13 places in 390 ms
[2020-05-21 01:25:50] [INFO ] Deduced a trap composed of 13 places in 395 ms
[2020-05-21 01:25:50] [INFO ] Deduced a trap composed of 48 places in 425 ms
[2020-05-21 01:25:51] [INFO ] Deduced a trap composed of 114 places in 283 ms
[2020-05-21 01:25:51] [INFO ] Deduced a trap composed of 150 places in 268 ms
[2020-05-21 01:25:51] [INFO ] Deduced a trap composed of 97 places in 290 ms
[2020-05-21 01:25:52] [INFO ] Deduced a trap composed of 96 places in 264 ms
[2020-05-21 01:25:52] [INFO ] Deduced a trap composed of 80 places in 191 ms
[2020-05-21 01:25:52] [INFO ] Deduced a trap composed of 114 places in 374 ms
[2020-05-21 01:25:53] [INFO ] Deduced a trap composed of 78 places in 288 ms
[2020-05-21 01:25:53] [INFO ] Deduced a trap composed of 51 places in 356 ms
[2020-05-21 01:25:54] [INFO ] Deduced a trap composed of 62 places in 367 ms
[2020-05-21 01:25:54] [INFO ] Deduced a trap composed of 55 places in 390 ms
[2020-05-21 01:25:54] [INFO ] Deduced a trap composed of 82 places in 264 ms
[2020-05-21 01:25:55] [INFO ] Deduced a trap composed of 28 places in 450 ms
[2020-05-21 01:25:55] [INFO ] Deduced a trap composed of 86 places in 358 ms
[2020-05-21 01:25:55] [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 s6 s12 s17 s23 s32 s34 s44 s45 s55 s176 s178 s180 s186 s191 s193 s203 s206 s212 s214 s216 s223 s229 s235 s238 s244 s250 s255 s257 s267 s276 s278 s304 s310 s382 s392 s393 s401 s413 s418 s424 s436 s450 s453 s460 s464 s469 s474 s520 s522 s525 s529 s531 s535 s576 s578 s588 s589 s599 s601 s608 s614 s616 s620 s621 s625 s631 s675 s677 s686 s696 s698 s771 s775 s777 s784 s786 s788 s790 s792 s794 s801 s812 s815 s821 s828) 0)") while checking expression at index 17
[2020-05-21 01:25:55] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2020-05-21 01:25:55] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:57] [INFO ] [Real]Absence check using state equation in 1654 ms returned sat
[2020-05-21 01:25:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:25:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 35 ms returned sat
[2020-05-21 01:25:57] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2020-05-21 01:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:25:59] [INFO ] [Nat]Absence check using state equation in 1717 ms returned sat
[2020-05-21 01:25:59] [INFO ] [Nat]Added 230 Read/Feed constraints in 64 ms returned sat
[2020-05-21 01:26:00] [INFO ] Deduced a trap composed of 50 places in 549 ms
[2020-05-21 01:26:00] [INFO ] Deduced a trap composed of 37 places in 528 ms
[2020-05-21 01:26:01] [INFO ] Deduced a trap composed of 50 places in 511 ms
[2020-05-21 01:26:01] [INFO ] Deduced a trap composed of 50 places in 560 ms
[2020-05-21 01:26:02] [INFO ] Deduced a trap composed of 49 places in 611 ms
[2020-05-21 01:26:03] [INFO ] Deduced a trap composed of 11 places in 534 ms
[2020-05-21 01:26:03] [INFO ] Deduced a trap composed of 11 places in 567 ms
[2020-05-21 01:26:04] [INFO ] Deduced a trap composed of 50 places in 560 ms
[2020-05-21 01:26:05] [INFO ] Deduced a trap composed of 50 places in 529 ms
[2020-05-21 01:26:05] [INFO ] Deduced a trap composed of 37 places in 578 ms
[2020-05-21 01:26:06] [INFO ] Deduced a trap composed of 50 places in 511 ms
[2020-05-21 01:26:06] [INFO ] Deduced a trap composed of 49 places in 483 ms
[2020-05-21 01:26:07] [INFO ] Deduced a trap composed of 50 places in 611 ms
[2020-05-21 01:26:07] [INFO ] Deduced a trap composed of 142 places in 489 ms
[2020-05-21 01:26:08] [INFO ] Deduced a trap composed of 172 places in 483 ms
[2020-05-21 01:26:08] [INFO ] Deduced a trap composed of 244 places in 459 ms
[2020-05-21 01:26:09] [INFO ] Deduced a trap composed of 103 places in 448 ms
[2020-05-21 01:26:09] [INFO ] Deduced a trap composed of 103 places in 479 ms
[2020-05-21 01:26:10] [INFO ] Deduced a trap composed of 15 places in 435 ms
[2020-05-21 01:26:11] [INFO ] Deduced a trap composed of 19 places in 521 ms
[2020-05-21 01:26:11] [INFO ] Deduced a trap composed of 38 places in 572 ms
[2020-05-21 01:26:12] [INFO ] Deduced a trap composed of 15 places in 413 ms
[2020-05-21 01:26:12] [INFO ] Deduced a trap composed of 39 places in 524 ms
[2020-05-21 01:26:13] [INFO ] Deduced a trap composed of 27 places in 517 ms
[2020-05-21 01:26:13] [INFO ] Deduced a trap composed of 195 places in 453 ms
[2020-05-21 01:26:14] [INFO ] Deduced a trap composed of 81 places in 528 ms
[2020-05-21 01:26:14] [INFO ] Deduced a trap composed of 11 places in 438 ms
[2020-05-21 01:26:15] [INFO ] Deduced a trap composed of 11 places in 499 ms
[2020-05-21 01:26:15] [INFO ] Deduced a trap composed of 74 places in 480 ms
[2020-05-21 01:26:16] [INFO ] Deduced a trap composed of 45 places in 437 ms
[2020-05-21 01:26:16] [INFO ] Deduced a trap composed of 136 places in 431 ms
[2020-05-21 01:26:17] [INFO ] Deduced a trap composed of 51 places in 456 ms
[2020-05-21 01:26:17] [INFO ] Deduced a trap composed of 51 places in 463 ms
[2020-05-21 01:26:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s6 s32 s34 s176 s178 s180 s186 s206 s212 s214 s216 s233 s244 s250 s255 s257 s382 s392 s393 s401 s424 s436 s438 s464 s469 s520 s522 s529 s531 s539 s578 s588 s614 s616 s620 s621 s627 s675 s677 s722 s784 s786 s788 s790 s792 s794 s801 s812 s815 s821) 0)") while checking expression at index 18
[2020-05-21 01:26:17] [INFO ] [Real]Absence check using 17 positive place invariants in 35 ms returned sat
[2020-05-21 01:26:17] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-05-21 01:26:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:26:19] [INFO ] [Real]Absence check using state equation in 1685 ms returned sat
[2020-05-21 01:26:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:26:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 38 ms returned sat
[2020-05-21 01:26:19] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-21 01:26:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:26:21] [INFO ] [Nat]Absence check using state equation in 1810 ms returned sat
[2020-05-21 01:26:21] [INFO ] [Nat]Added 230 Read/Feed constraints in 99 ms returned sat
[2020-05-21 01:26:22] [INFO ] Deduced a trap composed of 50 places in 559 ms
[2020-05-21 01:26:22] [INFO ] Deduced a trap composed of 37 places in 584 ms
[2020-05-21 01:26:23] [INFO ] Deduced a trap composed of 50 places in 543 ms
[2020-05-21 01:26:24] [INFO ] Deduced a trap composed of 50 places in 538 ms
[2020-05-21 01:26:24] [INFO ] Deduced a trap composed of 49 places in 487 ms
[2020-05-21 01:26:25] [INFO ] Deduced a trap composed of 11 places in 465 ms
[2020-05-21 01:26:25] [INFO ] Deduced a trap composed of 11 places in 552 ms
[2020-05-21 01:26:26] [INFO ] Deduced a trap composed of 50 places in 574 ms
[2020-05-21 01:26:26] [INFO ] Deduced a trap composed of 50 places in 506 ms
[2020-05-21 01:26:27] [INFO ] Deduced a trap composed of 37 places in 529 ms
[2020-05-21 01:26:28] [INFO ] Deduced a trap composed of 50 places in 559 ms
[2020-05-21 01:26:28] [INFO ] Deduced a trap composed of 49 places in 552 ms
[2020-05-21 01:26:29] [INFO ] Deduced a trap composed of 50 places in 550 ms
[2020-05-21 01:26:29] [INFO ] Deduced a trap composed of 142 places in 495 ms
[2020-05-21 01:26:30] [INFO ] Deduced a trap composed of 172 places in 464 ms
[2020-05-21 01:26:30] [INFO ] Deduced a trap composed of 244 places in 494 ms
[2020-05-21 01:26:31] [INFO ] Deduced a trap composed of 103 places in 461 ms
[2020-05-21 01:26:31] [INFO ] Deduced a trap composed of 103 places in 476 ms
[2020-05-21 01:26:32] [INFO ] Deduced a trap composed of 15 places in 480 ms
[2020-05-21 01:26:33] [INFO ] Deduced a trap composed of 19 places in 578 ms
[2020-05-21 01:26:33] [INFO ] Deduced a trap composed of 38 places in 584 ms
[2020-05-21 01:26:34] [INFO ] Deduced a trap composed of 15 places in 434 ms
[2020-05-21 01:26:34] [INFO ] Deduced a trap composed of 39 places in 596 ms
[2020-05-21 01:26:35] [INFO ] Deduced a trap composed of 27 places in 491 ms
[2020-05-21 01:26:36] [INFO ] Deduced a trap composed of 195 places in 473 ms
[2020-05-21 01:26:36] [INFO ] Deduced a trap composed of 81 places in 453 ms
[2020-05-21 01:26:36] [INFO ] Deduced a trap composed of 11 places in 443 ms
[2020-05-21 01:26:37] [INFO ] Deduced a trap composed of 11 places in 479 ms
[2020-05-21 01:26:38] [INFO ] Deduced a trap composed of 74 places in 513 ms
[2020-05-21 01:26:38] [INFO ] Deduced a trap composed of 45 places in 477 ms
[2020-05-21 01:26:39] [INFO ] Deduced a trap composed of 136 places in 396 ms
[2020-05-21 01:26:39] [INFO ] Deduced a trap composed of 51 places in 420 ms
[2020-05-21 01:26:39] [INFO ] Deduced a trap composed of 51 places in 421 ms
[2020-05-21 01:26: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 s6 s32 s34 s176 s178 s180 s186 s206 s212 s214 s216 s233 s244 s250 s255 s257 s382 s392 s393 s401 s424 s436 s438 s464 s469 s520 s522 s529 s531 s539 s578 s588 s614 s616 s620 s621 s627 s675 s677 s722 s784 s786 s788 s790 s792 s794 s801 s812 s815 s821) 0)") while checking expression at index 19
[2020-05-21 01:26:40] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned sat
[2020-05-21 01:26:40] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-21 01:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:26:41] [INFO ] [Real]Absence check using state equation in 1848 ms returned sat
[2020-05-21 01:26:41] [INFO ] [Real]Added 230 Read/Feed constraints in 39 ms returned sat
[2020-05-21 01:26:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:26:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 32 ms returned sat
[2020-05-21 01:26:42] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2020-05-21 01:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:26:43] [INFO ] [Nat]Absence check using state equation in 1720 ms returned sat
[2020-05-21 01:26:43] [INFO ] [Nat]Added 230 Read/Feed constraints in 65 ms returned sat
[2020-05-21 01:26:44] [INFO ] Deduced a trap composed of 62 places in 561 ms
[2020-05-21 01:26:45] [INFO ] Deduced a trap composed of 63 places in 531 ms
[2020-05-21 01:26:45] [INFO ] Deduced a trap composed of 11 places in 543 ms
[2020-05-21 01:26:46] [INFO ] Deduced a trap composed of 63 places in 530 ms
[2020-05-21 01:26:46] [INFO ] Deduced a trap composed of 102 places in 502 ms
[2020-05-21 01:26:47] [INFO ] Deduced a trap composed of 102 places in 504 ms
[2020-05-21 01:26:47] [INFO ] Deduced a trap composed of 102 places in 509 ms
[2020-05-21 01:26:48] [INFO ] Deduced a trap composed of 71 places in 478 ms
[2020-05-21 01:26:48] [INFO ] Deduced a trap composed of 97 places in 491 ms
[2020-05-21 01:26:49] [INFO ] Deduced a trap composed of 97 places in 454 ms
[2020-05-21 01:26:49] [INFO ] Deduced a trap composed of 99 places in 472 ms
[2020-05-21 01:26:50] [INFO ] Deduced a trap composed of 45 places in 454 ms
[2020-05-21 01:26:51] [INFO ] Deduced a trap composed of 11 places in 526 ms
[2020-05-21 01:26:51] [INFO ] Deduced a trap composed of 150 places in 496 ms
[2020-05-21 01:26:52] [INFO ] Deduced a trap composed of 96 places in 473 ms
[2020-05-21 01:26:52] [INFO ] Deduced a trap composed of 97 places in 518 ms
[2020-05-21 01:26:53] [INFO ] Deduced a trap composed of 19 places in 521 ms
[2020-05-21 01:26:53] [INFO ] Deduced a trap composed of 19 places in 549 ms
[2020-05-21 01:26:54] [INFO ] Deduced a trap composed of 44 places in 515 ms
[2020-05-21 01:26:54] [INFO ] Deduced a trap composed of 18 places in 467 ms
[2020-05-21 01:26:55] [INFO ] Deduced a trap composed of 19 places in 498 ms
[2020-05-21 01:26:55] [INFO ] Deduced a trap composed of 52 places in 441 ms
[2020-05-21 01:26:56] [INFO ] Deduced a trap composed of 45 places in 446 ms
[2020-05-21 01:26:56] [INFO ] Deduced a trap composed of 56 places in 446 ms
[2020-05-21 01:26:57] [INFO ] Deduced a trap composed of 78 places in 376 ms
[2020-05-21 01:26:57] [INFO ] Deduced a trap composed of 78 places in 374 ms
[2020-05-21 01:26:58] [INFO ] Deduced a trap composed of 104 places in 401 ms
[2020-05-21 01:26:58] [INFO ] Deduced a trap composed of 37 places in 533 ms
[2020-05-21 01:26:59] [INFO ] Deduced a trap composed of 37 places in 492 ms
[2020-05-21 01:26:59] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 15485 ms
[2020-05-21 01:26:59] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 90 ms.
[2020-05-21 01:27:01] [INFO ] Added : 210 causal constraints over 42 iterations in 2635 ms. Result :(error "Failed to check-sat")
[2020-05-21 01:27:02] [INFO ] [Real]Absence check using 17 positive place invariants in 30 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
[2020-05-21 01:27:02] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-21 01:27:02] [INFO ] Flatten gal took : 247 ms
FORMULA Peterson-PT-5-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 01:27:02] [INFO ] Flatten gal took : 110 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 01:27:02] [INFO ] Applying decomposition
[2020-05-21 01:27:03] [INFO ] Flatten gal took : 104 ms
[2020-05-21 01:27:03] [INFO ] Input system was already deterministic with 1242 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph3006054084855741346.txt, -o, /tmp/graph3006054084855741346.bin, -w, /tmp/graph3006054084855741346.weights], workingDir=null]
Normalized transition count is 1122 out of 1242 initially.
// Phase 1: matrix 1122 rows 834 cols
[2020-05-21 01:27:04] [INFO ] Computed 23 place invariants in 22 ms
inv : WantSection_5_F - Idle_5 = 0
inv : Turn_2_0 + Turn_2_4 + Turn_2_5 + Turn_2_1 + Turn_2_3 + Turn_2_2 = 1
inv : WantSection_0_T + Idle_0 = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_0_2 + IsEndLoop_3_2_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_4_2 + IsEndLoop_3_1_3 + IsEndLoop_3_0_3 + IsEndLoop_3_2_3 + IsEndLoop_3_3_3 + IsEndLoop_3_0_4 + IsEndLoop_3_4_3 + IsEndLoop_3_2_4 + IsEndLoop_3_1_4 + IsEndLoop_3_0_5 + IsEndLoop_3_3_4 + IsEndLoop_3_4_4 + IsEndLoop_3_2_5 + IsEndLoop_3_3_5 + IsEndLoop_3_1_5 + EndTurn_3_0 + IsEndLoop_3_4_5 + EndTurn_3_3 + EndTurn_3_2 + EndTurn_3_1 + BeginLoop_3_1_0 + BeginLoop_3_0_0 + EndTurn_3_4 + BeginLoop_3_3_0 + BeginLoop_3_2_0 + BeginLoop_3_1_1 + BeginLoop_3_0_1 + BeginLoop_3_4_0 + BeginLoop_3_0_2 + BeginLoop_3_1_2 + BeginLoop_3_2_1 + BeginLoop_3_3_1 + BeginLoop_3_4_1 + BeginLoop_3_0_3 + BeginLoop_3_1_3 + BeginLoop_3_2_3 + BeginLoop_3_2_2 + BeginLoop_3_3_2 + BeginLoop_3_4_2 + BeginLoop_3_1_4 + BeginLoop_3_0_4 + BeginLoop_3_2_4 + BeginLoop_3_3_3 + BeginLoop_3_4_3 + BeginLoop_3_1_5 + BeginLoop_3_2_5 + BeginLoop_3_3_4 + BeginLoop_3_0_5 + BeginLoop_3_4_4 + TestAlone_3_1_0 + WantSection_3_F + TestAlone_3_0_0 + BeginLoop_3_3_5 + BeginLoop_3_4_5 + TestAlone_3_2_1 + TestAlone_3_3_1 + TestAlone_3_0_1 + TestAlone_3_1_1 + TestAlone_3_4_0 + TestAlone_3_2_0 + TestAlone_3_3_0 + TestAlone_3_4_2 + TestAlone_3_3_2 + TestAlone_3_2_2 + TestAlone_3_1_2 + TestAlone_3_0_2 + TestAlone_3_4_1 + TestAlone_3_0_4 + TestAlone_3_3_5 + TestTurn_3_0 + TestAlone_3_4_5 + TestTurn_3_1 + TestTurn_3_2 + TestAlone_3_2_4 + TestAlone_3_1_4 + TestAlone_3_3_4 + TestAlone_3_0_5 + TestAlone_3_4_4 + TestAlone_3_2_5 + TestAlone_3_1_5 + TestIdentity_3_4_0 + TestIdentity_3_0_1 + TestIdentity_3_1_1 + TestIdentity_3_2_1 + TestIdentity_3_3_1 + TestTurn_3_3 + TestTurn_3_4 + TestIdentity_3_0_0 + TestIdentity_3_1_0 + TestIdentity_3_2_0 + TestIdentity_3_3_0 + TestIdentity_3_1_3 + TestIdentity_3_0_3 + TestIdentity_3_4_2 + TestIdentity_3_4_3 + TestIdentity_3_3_3 + TestIdentity_3_2_3 + TestIdentity_3_1_2 + TestIdentity_3_0_2 + TestIdentity_3_4_1 + TestIdentity_3_3_2 + TestIdentity_3_2_2 + TestIdentity_3_1_5 + TestIdentity_3_2_5 + TestIdentity_3_0_5 + TestIdentity_3_4_5 + TestIdentity_3_3_5 + TestIdentity_3_1_4 + TestIdentity_3_0_4 + TestIdentity_3_4_4 + TestIdentity_3_2_4 + TestIdentity_3_3_4 + AskForSection_3_3 + AskForSection_3_2 + AskForSection_3_4 + AskForSection_3_0 + AskForSection_3_1 + CS_3 = 1
inv : Turn_4_4 + Turn_4_3 + Turn_4_5 + Turn_4_1 + Turn_4_0 + Turn_4_2 = 1
inv : IsEndLoop_0_0_0 + IsEndLoop_0_1_0 + IsEndLoop_0_2_0 + IsEndLoop_0_3_0 + IsEndLoop_0_4_0 + IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_4_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_4_2 + IsEndLoop_0_3_2 + IsEndLoop_0_0_3 + IsEndLoop_0_1_3 + IsEndLoop_0_3_3 + IsEndLoop_0_2_3 + IsEndLoop_0_4_3 + IsEndLoop_0_0_4 + IsEndLoop_0_3_4 + IsEndLoop_0_1_4 + IsEndLoop_0_2_4 + IsEndLoop_0_0_5 + IsEndLoop_0_1_5 + IsEndLoop_0_4_4 + IsEndLoop_0_3_5 + IsEndLoop_0_2_5 + EndTurn_0_1 + IsEndLoop_0_4_5 + EndTurn_0_0 + EndTurn_0_4 + EndTurn_0_3 + EndTurn_0_2 + BeginLoop_0_1_0 + BeginLoop_0_0_0 + BeginLoop_0_4_0 + BeginLoop_0_3_0 + BeginLoop_0_2_0 + BeginLoop_0_2_1 + BeginLoop_0_1_1 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_2 + BeginLoop_0_2_2 + BeginLoop_0_3_1 + BeginLoop_0_4_1 + BeginLoop_0_1_3 + BeginLoop_0_2_3 + BeginLoop_0_3_2 + BeginLoop_0_4_2 + BeginLoop_0_0_3 + BeginLoop_0_1_4 + BeginLoop_0_3_4 + BeginLoop_0_2_4 + BeginLoop_0_4_3 + BeginLoop_0_3_3 + BeginLoop_0_0_4 + BeginLoop_0_2_5 + BeginLoop_0_1_5 + BeginLoop_0_3_5 + BeginLoop_0_4_4 + BeginLoop_0_0_5 + BeginLoop_0_4_5 + TestAlone_0_2_1 + TestAlone_0_3_1 + TestAlone_0_1_1 + TestAlone_0_0_1 + TestAlone_0_4_2 + TestAlone_0_3_2 + TestAlone_0_2_2 + TestAlone_0_1_2 + TestAlone_0_0_2 + TestAlone_0_4_1 + TestAlone_0_1_4 + TestAlone_0_0_4 + TestAlone_0_4_3 + TestAlone_0_3_3 + TestAlone_0_2_3 + TestAlone_0_1_3 + TestAlone_0_0_3 + TestAlone_0_4_5 + TestAlone_0_3_5 + TestTurn_0_0 + TestTurn_0_2 + TestTurn_0_1 + TestTurn_0_3 + TestAlone_0_2_4 + TestAlone_0_4_4 + TestAlone_0_3_4 + TestAlone_0_1_5 + TestAlone_0_0_5 + TestAlone_0_2_5 + TestIdentity_0_4_0 + TestIdentity_0_0_1 + TestIdentity_0_1_1 + TestIdentity_0_2_1 + TestIdentity_0_3_1 + TestIdentity_0_4_1 + TestTurn_0_4 + TestIdentity_0_0_0 + TestIdentity_0_1_0 + TestIdentity_0_2_0 + TestIdentity_0_3_0 + TestIdentity_0_2_3 + TestIdentity_0_1_3 + TestIdentity_0_0_3 + TestIdentity_0_4_3 + TestIdentity_0_3_3 + TestIdentity_0_1_2 + TestIdentity_0_0_2 + TestIdentity_0_4_2 + TestIdentity_0_3_2 + TestIdentity_0_2_2 + TestIdentity_0_2_5 + TestIdentity_0_1_5 + TestIdentity_0_3_5 + TestIdentity_0_4_5 + TestIdentity_0_2_4 + TestIdentity_0_0_4 + TestIdentity_0_1_4 + TestIdentity_0_4_4 + TestIdentity_0_0_5 + TestIdentity_0_3_4 + AskForSection_0_3 + CS_0 + AskForSection_0_4 + AskForSection_0_1 + AskForSection_0_0 + AskForSection_0_2 + Idle_0 = 1
inv : -IsEndLoop_1_0_0 - IsEndLoop_1_1_0 - IsEndLoop_1_2_0 - IsEndLoop_1_3_0 - IsEndLoop_1_4_0 - IsEndLoop_1_0_1 - IsEndLoop_1_1_1 - IsEndLoop_1_2_1 - IsEndLoop_1_3_1 - IsEndLoop_1_4_1 - IsEndLoop_1_1_2 - IsEndLoop_1_0_2 - IsEndLoop_1_2_2 - IsEndLoop_1_3_2 - IsEndLoop_1_0_3 - IsEndLoop_1_4_2 - IsEndLoop_1_1_3 - IsEndLoop_1_2_3 - IsEndLoop_1_4_3 - IsEndLoop_1_3_3 - IsEndLoop_1_0_4 - IsEndLoop_1_2_4 - IsEndLoop_1_3_4 - IsEndLoop_1_1_4 - IsEndLoop_1_0_5 - IsEndLoop_1_4_4 - IsEndLoop_1_3_5 - IsEndLoop_1_1_5 - IsEndLoop_1_2_5 - EndTurn_1_0 - EndTurn_1_1 - IsEndLoop_1_4_5 - EndTurn_1_3 - EndTurn_1_2 - BeginLoop_1_1_0 - BeginLoop_1_0_0 - EndTurn_1_4 - BeginLoop_1_4_0 - BeginLoop_1_3_0 - BeginLoop_1_2_0 - BeginLoop_1_1_1 - BeginLoop_1_0_1 - BeginLoop_1_0_2 - BeginLoop_1_1_2 - BeginLoop_1_2_2 - BeginLoop_1_2_1 - BeginLoop_1_3_1 - BeginLoop_1_4_1 - BeginLoop_1_0_3 - BeginLoop_1_1_3 - BeginLoop_1_2_3 - BeginLoop_1_3_2 - BeginLoop_1_4_2 - BeginLoop_1_1_4 - BeginLoop_1_2_4 - BeginLoop_1_3_3 - BeginLoop_1_0_4 - BeginLoop_1_4_3 - BeginLoop_1_1_5 - BeginLoop_1_3_5 - BeginLoop_1_2_5 - BeginLoop_1_4_4 - BeginLoop_1_3_4 - BeginLoop_1_0_5 - TestAlone_1_1_0 - TestAlone_1_2_0 - TestAlone_1_0_0 + WantSection_1_T - BeginLoop_1_4_5 - TestAlone_1_4_0 - TestAlone_1_3_0 - TestAlone_1_4_2 - TestAlone_1_3_2 - TestAlone_1_2_2 - TestAlone_1_1_2 - TestAlone_1_0_2 - TestAlone_1_1_4 - TestAlone_1_0_4 - TestAlone_1_4_3 - TestAlone_1_3_3 - TestAlone_1_2_3 - TestAlone_1_1_3 - TestAlone_1_0_3 - TestAlone_1_4_5 - TestAlone_1_3_5 - TestTurn_1_0 - TestTurn_1_1 - TestTurn_1_3 - TestTurn_1_2 - TestAlone_1_2_4 - TestAlone_1_4_4 - TestAlone_1_3_4 - TestAlone_1_0_5 - TestAlone_1_2_5 - TestAlone_1_1_5 - TestIdentity_1_4_0 - TestIdentity_1_0_1 - TestIdentity_1_1_1 - TestIdentity_1_2_1 - TestIdentity_1_3_1 - TestTurn_1_4 - TestIdentity_1_0_0 - TestIdentity_1_1_0 - TestIdentity_1_2_0 - TestIdentity_1_3_0 - TestIdentity_1_1_3 - TestIdentity_1_0_3 - TestIdentity_1_4_3 - TestIdentity_1_3_3 - TestIdentity_1_2_3 - TestIdentity_1_1_2 - TestIdentity_1_0_2 - TestIdentity_1_4_1 - TestIdentity_1_4_2 - TestIdentity_1_3_2 - TestIdentity_1_2_2 - TestIdentity_1_2_5 - TestIdentity_1_0_5 - TestIdentity_1_1_5 - TestIdentity_1_4_5 - TestIdentity_1_3_5 - TestIdentity_1_1_4 - TestIdentity_1_2_4 - TestIdentity_1_0_4 - TestIdentity_1_4_4 - TestIdentity_1_3_4 - AskForSection_1_3 - AskForSection_1_4 - AskForSection_1_0 - AskForSection_1_2 - AskForSection_1_1 - CS_1 = 0
inv : WantSection_4_T + Idle_4 = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_0_2 + IsEndLoop_3_2_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_4_2 + IsEndLoop_3_1_3 + IsEndLoop_3_0_3 + IsEndLoop_3_2_3 + IsEndLoop_3_3_3 + IsEndLoop_3_0_4 + IsEndLoop_3_4_3 + IsEndLoop_3_2_4 + IsEndLoop_3_1_4 + IsEndLoop_3_0_5 + IsEndLoop_3_3_4 + IsEndLoop_3_4_4 + IsEndLoop_3_2_5 + IsEndLoop_3_3_5 + IsEndLoop_3_1_5 + EndTurn_3_0 + IsEndLoop_3_4_5 + EndTurn_3_3 + EndTurn_3_2 + EndTurn_3_1 + BeginLoop_3_1_0 + BeginLoop_3_0_0 + EndTurn_3_4 + BeginLoop_3_3_0 + BeginLoop_3_2_0 + BeginLoop_3_1_1 + BeginLoop_3_0_1 + BeginLoop_3_4_0 + BeginLoop_3_0_2 + BeginLoop_3_1_2 + BeginLoop_3_2_1 + BeginLoop_3_3_1 + BeginLoop_3_4_1 + BeginLoop_3_0_3 + BeginLoop_3_1_3 + BeginLoop_3_2_3 + BeginLoop_3_2_2 + BeginLoop_3_3_2 + BeginLoop_3_4_2 + BeginLoop_3_1_4 + BeginLoop_3_0_4 + BeginLoop_3_2_4 + BeginLoop_3_3_3 + BeginLoop_3_4_3 + BeginLoop_3_1_5 + BeginLoop_3_2_5 + BeginLoop_3_3_4 + BeginLoop_3_0_5 + BeginLoop_3_4_4 + TestAlone_3_1_0 + TestAlone_3_0_0 + BeginLoop_3_3_5 + BeginLoop_3_4_5 + TestAlone_3_2_1 + TestAlone_3_3_1 + TestAlone_3_0_1 + TestAlone_3_1_1 + TestAlone_3_4_0 + TestAlone_3_2_0 + TestAlone_3_3_0 + TestAlone_3_4_2 + TestAlone_3_3_2 + TestAlone_3_2_2 + TestAlone_3_1_2 + TestAlone_3_0_2 + TestAlone_3_4_1 + TestAlone_3_0_4 + TestAlone_3_3_5 + TestTurn_3_0 + TestAlone_3_4_5 + TestTurn_3_1 + TestTurn_3_2 + TestAlone_3_2_4 + TestAlone_3_1_4 + TestAlone_3_3_4 + TestAlone_3_0_5 + TestAlone_3_4_4 + TestAlone_3_2_5 + TestAlone_3_1_5 + TestIdentity_3_4_0 + TestIdentity_3_0_1 + TestIdentity_3_1_1 + TestIdentity_3_2_1 + TestIdentity_3_3_1 + TestTurn_3_3 + TestTurn_3_4 + TestIdentity_3_0_0 + TestIdentity_3_1_0 + TestIdentity_3_2_0 + TestIdentity_3_3_0 + TestIdentity_3_1_3 + TestIdentity_3_0_3 + TestIdentity_3_4_2 + TestIdentity_3_4_3 + TestIdentity_3_3_3 + TestIdentity_3_2_3 + TestIdentity_3_1_2 + TestIdentity_3_0_2 + TestIdentity_3_4_1 + TestIdentity_3_3_2 + TestIdentity_3_2_2 + TestIdentity_3_1_5 + TestIdentity_3_2_5 + TestIdentity_3_0_5 + TestIdentity_3_4_5 + TestIdentity_3_3_5 + TestIdentity_3_1_4 + TestIdentity_3_0_4 + TestIdentity_3_4_4 + TestIdentity_3_2_4 + TestIdentity_3_3_4 + AskForSection_3_3 + AskForSection_3_2 + AskForSection_3_4 + AskForSection_3_0 + AskForSection_3_1 + Idle_3 + CS_3 = 1
inv : WantSection_0_F - Idle_0 = 0
inv : -IsEndLoop_3_0_0 - IsEndLoop_3_1_0 - IsEndLoop_3_2_0 - IsEndLoop_3_3_0 - IsEndLoop_3_4_0 - IsEndLoop_3_0_1 - IsEndLoop_3_1_1 - IsEndLoop_3_2_1 - IsEndLoop_3_3_1 - IsEndLoop_3_4_1 - IsEndLoop_3_0_2 - IsEndLoop_3_2_2 - IsEndLoop_3_1_2 - IsEndLoop_3_3_2 - IsEndLoop_3_4_2 - IsEndLoop_3_1_3 - IsEndLoop_3_0_3 - IsEndLoop_3_2_3 - IsEndLoop_3_3_3 - IsEndLoop_3_0_4 - IsEndLoop_3_4_3 - IsEndLoop_3_2_4 - IsEndLoop_3_1_4 - IsEndLoop_3_0_5 - IsEndLoop_3_3_4 - IsEndLoop_3_4_4 - IsEndLoop_3_2_5 - IsEndLoop_3_3_5 - IsEndLoop_3_1_5 - EndTurn_3_0 - IsEndLoop_3_4_5 - EndTurn_3_3 - EndTurn_3_2 - EndTurn_3_1 - BeginLoop_3_1_0 - BeginLoop_3_0_0 - EndTurn_3_4 - BeginLoop_3_3_0 - BeginLoop_3_2_0 - BeginLoop_3_1_1 - BeginLoop_3_0_1 - BeginLoop_3_4_0 - BeginLoop_3_0_2 - BeginLoop_3_1_2 - BeginLoop_3_2_1 - BeginLoop_3_3_1 - BeginLoop_3_4_1 - BeginLoop_3_0_3 - BeginLoop_3_1_3 - BeginLoop_3_2_3 - BeginLoop_3_2_2 - BeginLoop_3_3_2 - BeginLoop_3_4_2 - BeginLoop_3_1_4 - BeginLoop_3_0_4 - BeginLoop_3_2_4 - BeginLoop_3_3_3 - BeginLoop_3_4_3 - BeginLoop_3_1_5 - BeginLoop_3_2_5 - BeginLoop_3_3_4 - BeginLoop_3_0_5 - BeginLoop_3_4_4 - TestAlone_3_1_0 - TestAlone_3_0_0 + WantSection_3_T - BeginLoop_3_3_5 - BeginLoop_3_4_5 - TestAlone_3_2_1 - TestAlone_3_3_1 - TestAlone_3_0_1 - TestAlone_3_1_1 - TestAlone_3_4_0 - TestAlone_3_2_0 - TestAlone_3_3_0 - TestAlone_3_4_2 - TestAlone_3_3_2 - TestAlone_3_2_2 - TestAlone_3_1_2 - TestAlone_3_0_2 - TestAlone_3_4_1 - TestAlone_3_0_4 - TestAlone_3_3_5 - TestTurn_3_0 - TestAlone_3_4_5 - TestTurn_3_1 - TestTurn_3_2 - TestAlone_3_2_4 - TestAlone_3_1_4 - TestAlone_3_3_4 - TestAlone_3_0_5 - TestAlone_3_4_4 - TestAlone_3_2_5 - TestAlone_3_1_5 - TestIdentity_3_4_0 - TestIdentity_3_0_1 - TestIdentity_3_1_1 - TestIdentity_3_2_1 - TestIdentity_3_3_1 - TestTurn_3_3 - TestTurn_3_4 - TestIdentity_3_0_0 - TestIdentity_3_1_0 - TestIdentity_3_2_0 - TestIdentity_3_3_0 - TestIdentity_3_1_3 - TestIdentity_3_0_3 - TestIdentity_3_4_2 - TestIdentity_3_4_3 - TestIdentity_3_3_3 - TestIdentity_3_2_3 - TestIdentity_3_1_2 - TestIdentity_3_0_2 - TestIdentity_3_4_1 - TestIdentity_3_3_2 - TestIdentity_3_2_2 - TestIdentity_3_1_5 - TestIdentity_3_2_5 - TestIdentity_3_0_5 - TestIdentity_3_4_5 - TestIdentity_3_3_5 - TestIdentity_3_1_4 - TestIdentity_3_0_4 - TestIdentity_3_4_4 - TestIdentity_3_2_4 - TestIdentity_3_3_4 - AskForSection_3_3 - AskForSection_3_2 - AskForSection_3_4 - AskForSection_3_0 - AskForSection_3_1 - CS_3 = 0
inv : WantSection_4_F - Idle_4 = 0
inv : Turn_3_4 + Turn_3_5 + Turn_3_1 + Turn_3_0 + Turn_3_3 + Turn_3_2 = 1
inv : WantSection_5_T + Idle_5 = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_0_1 + IsEndLoop_1_1_1 + IsEndLoop_1_2_1 + IsEndLoop_1_3_1 + IsEndLoop_1_4_1 + IsEndLoop_1_1_2 + IsEndLoop_1_0_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_0_3 + IsEndLoop_1_4_2 + IsEndLoop_1_1_3 + IsEndLoop_1_2_3 + IsEndLoop_1_4_3 + IsEndLoop_1_3_3 + IsEndLoop_1_0_4 + IsEndLoop_1_2_4 + IsEndLoop_1_3_4 + IsEndLoop_1_1_4 + IsEndLoop_1_0_5 + IsEndLoop_1_4_4 + IsEndLoop_1_3_5 + IsEndLoop_1_1_5 + IsEndLoop_1_2_5 + EndTurn_1_0 + EndTurn_1_1 + IsEndLoop_1_4_5 + EndTurn_1_3 + EndTurn_1_2 + BeginLoop_1_1_0 + BeginLoop_1_0_0 + EndTurn_1_4 + BeginLoop_1_4_0 + BeginLoop_1_3_0 + BeginLoop_1_2_0 + BeginLoop_1_1_1 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_2 + BeginLoop_1_2_2 + BeginLoop_1_2_1 + BeginLoop_1_3_1 + BeginLoop_1_4_1 + BeginLoop_1_0_3 + BeginLoop_1_1_3 + BeginLoop_1_2_3 + BeginLoop_1_3_2 + BeginLoop_1_4_2 + BeginLoop_1_1_4 + BeginLoop_1_2_4 + BeginLoop_1_3_3 + BeginLoop_1_0_4 + BeginLoop_1_4_3 + BeginLoop_1_1_5 + BeginLoop_1_3_5 + BeginLoop_1_2_5 + BeginLoop_1_4_4 + BeginLoop_1_3_4 + BeginLoop_1_0_5 + TestAlone_1_1_0 + TestAlone_1_2_0 + WantSection_1_F + TestAlone_1_0_0 + BeginLoop_1_4_5 + TestAlone_1_4_0 + TestAlone_1_3_0 + TestAlone_1_4_2 + TestAlone_1_3_2 + TestAlone_1_2_2 + TestAlone_1_1_2 + TestAlone_1_0_2 + TestAlone_1_1_4 + TestAlone_1_0_4 + TestAlone_1_4_3 + TestAlone_1_3_3 + TestAlone_1_2_3 + TestAlone_1_1_3 + TestAlone_1_0_3 + TestAlone_1_4_5 + TestAlone_1_3_5 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_1_3 + TestTurn_1_2 + TestAlone_1_2_4 + TestAlone_1_4_4 + TestAlone_1_3_4 + TestAlone_1_0_5 + TestAlone_1_2_5 + TestAlone_1_1_5 + TestIdentity_1_4_0 + TestIdentity_1_0_1 + TestIdentity_1_1_1 + TestIdentity_1_2_1 + TestIdentity_1_3_1 + TestTurn_1_4 + TestIdentity_1_0_0 + TestIdentity_1_1_0 + TestIdentity_1_2_0 + TestIdentity_1_3_0 + TestIdentity_1_1_3 + TestIdentity_1_0_3 + TestIdentity_1_4_3 + TestIdentity_1_3_3 + TestIdentity_1_2_3 + TestIdentity_1_1_2 + TestIdentity_1_0_2 + TestIdentity_1_4_1 + TestIdentity_1_4_2 + TestIdentity_1_3_2 + TestIdentity_1_2_2 + TestIdentity_1_2_5 + TestIdentity_1_0_5 + TestIdentity_1_1_5 + TestIdentity_1_4_5 + TestIdentity_1_3_5 + TestIdentity_1_1_4 + TestIdentity_1_2_4 + TestIdentity_1_0_4 + TestIdentity_1_4_4 + TestIdentity_1_3_4 + AskForSection_1_3 + AskForSection_1_4 + AskForSection_1_0 + AskForSection_1_2 + AskForSection_1_1 + CS_1 = 1
inv : Turn_0_0 + Turn_0_5 + Turn_0_4 + Turn_0_2 + Turn_0_1 + Turn_0_3 = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_0_1 + IsEndLoop_1_1_1 + IsEndLoop_1_2_1 + IsEndLoop_1_3_1 + IsEndLoop_1_4_1 + IsEndLoop_1_1_2 + IsEndLoop_1_0_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_0_3 + IsEndLoop_1_4_2 + IsEndLoop_1_1_3 + IsEndLoop_1_2_3 + IsEndLoop_1_4_3 + IsEndLoop_1_3_3 + IsEndLoop_1_0_4 + IsEndLoop_1_2_4 + IsEndLoop_1_3_4 + IsEndLoop_1_1_4 + IsEndLoop_1_0_5 + IsEndLoop_1_4_4 + IsEndLoop_1_3_5 + IsEndLoop_1_1_5 + IsEndLoop_1_2_5 + EndTurn_1_0 + EndTurn_1_1 + IsEndLoop_1_4_5 + EndTurn_1_3 + EndTurn_1_2 + BeginLoop_1_1_0 + BeginLoop_1_0_0 + EndTurn_1_4 + BeginLoop_1_4_0 + BeginLoop_1_3_0 + BeginLoop_1_2_0 + BeginLoop_1_1_1 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_1_2 + BeginLoop_1_2_2 + BeginLoop_1_2_1 + BeginLoop_1_3_1 + BeginLoop_1_4_1 + BeginLoop_1_0_3 + BeginLoop_1_1_3 + BeginLoop_1_2_3 + BeginLoop_1_3_2 + BeginLoop_1_4_2 + BeginLoop_1_1_4 + BeginLoop_1_2_4 + BeginLoop_1_3_3 + BeginLoop_1_0_4 + BeginLoop_1_4_3 + BeginLoop_1_1_5 + BeginLoop_1_3_5 + BeginLoop_1_2_5 + BeginLoop_1_4_4 + BeginLoop_1_3_4 + BeginLoop_1_0_5 + TestAlone_1_1_0 + TestAlone_1_2_0 + TestAlone_1_0_0 + BeginLoop_1_4_5 + TestAlone_1_4_0 + TestAlone_1_3_0 + TestAlone_1_4_2 + TestAlone_1_3_2 + TestAlone_1_2_2 + TestAlone_1_1_2 + TestAlone_1_0_2 + TestAlone_1_1_4 + TestAlone_1_0_4 + TestAlone_1_4_3 + TestAlone_1_3_3 + TestAlone_1_2_3 + TestAlone_1_1_3 + TestAlone_1_0_3 + TestAlone_1_4_5 + TestAlone_1_3_5 + TestTurn_1_0 + TestTurn_1_1 + TestTurn_1_3 + TestTurn_1_2 + TestAlone_1_2_4 + TestAlone_1_4_4 + TestAlone_1_3_4 + TestAlone_1_0_5 + TestAlone_1_2_5 + TestAlone_1_1_5 + TestIdentity_1_4_0 + TestIdentity_1_0_1 + TestIdentity_1_1_1 + TestIdentity_1_2_1 + TestIdentity_1_3_1 + TestTurn_1_4 + TestIdentity_1_0_0 + TestIdentity_1_1_0 + TestIdentity_1_2_0 + TestIdentity_1_3_0 + TestIdentity_1_1_3 + TestIdentity_1_0_3 + TestIdentity_1_4_3 + TestIdentity_1_3_3 + TestIdentity_1_2_3 + TestIdentity_1_1_2 + TestIdentity_1_0_2 + TestIdentity_1_4_1 + TestIdentity_1_4_2 + TestIdentity_1_3_2 + TestIdentity_1_2_2 + TestIdentity_1_2_5 + TestIdentity_1_0_5 + TestIdentity_1_1_5 + TestIdentity_1_4_5 + TestIdentity_1_3_5 + TestIdentity_1_1_4 + TestIdentity_1_2_4 + TestIdentity_1_0_4 + TestIdentity_1_4_4 + TestIdentity_1_3_4 + AskForSection_1_3 + AskForSection_1_4 + AskForSection_1_0 + AskForSection_1_2 + AskForSection_1_1 + Idle_1 + CS_1 = 1
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_1_2 + IsEndLoop_2_0_2 + IsEndLoop_2_2_2 + IsEndLoop_2_3_2 + IsEndLoop_2_0_3 + IsEndLoop_2_4_2 + IsEndLoop_2_1_3 + IsEndLoop_2_2_3 + IsEndLoop_2_4_3 + IsEndLoop_2_3_3 + IsEndLoop_2_0_4 + IsEndLoop_2_2_4 + IsEndLoop_2_3_4 + IsEndLoop_2_1_4 + IsEndLoop_2_0_5 + IsEndLoop_2_4_4 + IsEndLoop_2_3_5 + IsEndLoop_2_1_5 + IsEndLoop_2_2_5 + EndTurn_2_0 + EndTurn_2_1 + IsEndLoop_2_4_5 + EndTurn_2_3 + EndTurn_2_2 + BeginLoop_2_1_0 + BeginLoop_2_0_0 + EndTurn_2_4 + BeginLoop_2_4_0 + BeginLoop_2_3_0 + BeginLoop_2_2_0 + BeginLoop_2_1_1 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_1_2 + BeginLoop_2_2_2 + BeginLoop_2_2_1 + BeginLoop_2_3_1 + BeginLoop_2_4_1 + BeginLoop_2_0_3 + BeginLoop_2_1_3 + BeginLoop_2_2_3 + BeginLoop_2_3_2 + BeginLoop_2_4_2 + BeginLoop_2_1_4 + BeginLoop_2_2_4 + BeginLoop_2_3_3 + BeginLoop_2_0_4 + BeginLoop_2_4_3 + BeginLoop_2_1_5 + BeginLoop_2_3_5 + BeginLoop_2_2_5 + BeginLoop_2_4_4 + BeginLoop_2_3_4 + BeginLoop_2_0_5 + TestAlone_2_1_0 + TestAlone_2_0_0 + BeginLoop_2_4_5 + TestAlone_2_2_1 + TestAlone_2_3_1 + TestAlone_2_1_1 + TestAlone_2_4_0 + TestAlone_2_0_1 + TestAlone_2_2_0 + TestAlone_2_3_0 + TestAlone_2_4_1 + TestAlone_2_0_4 + TestAlone_2_4_3 + TestAlone_2_3_3 + TestAlone_2_2_3 + TestAlone_2_1_3 + TestAlone_2_0_3 + TestAlone_2_3_5 + TestTurn_2_0 + TestAlone_2_4_5 + TestTurn_2_1 + TestTurn_2_3 + TestTurn_2_2 + TestAlone_2_2_4 + TestAlone_2_1_4 + TestAlone_2_4_4 + TestAlone_2_3_4 + TestAlone_2_0_5 + TestAlone_2_2_5 + TestAlone_2_1_5 + TestIdentity_2_4_0 + TestIdentity_2_0_1 + TestIdentity_2_1_1 + TestIdentity_2_2_1 + TestIdentity_2_3_1 + TestTurn_2_4 + TestIdentity_2_0_0 + TestIdentity_2_1_0 + TestIdentity_2_2_0 + TestIdentity_2_3_0 + TestIdentity_2_1_3 + TestIdentity_2_0_3 + TestIdentity_2_4_3 + TestIdentity_2_3_3 + TestIdentity_2_2_3 + TestIdentity_2_1_2 + TestIdentity_2_0_2 + TestIdentity_2_4_1 + TestIdentity_2_4_2 + TestIdentity_2_3_2 + TestIdentity_2_2_2 + TestIdentity_2_2_5 + TestIdentity_2_0_5 + TestIdentity_2_1_5 + TestIdentity_2_4_5 + TestIdentity_2_3_5 + TestIdentity_2_1_4 + TestIdentity_2_2_4 + TestIdentity_2_0_4 + TestIdentity_2_4_4 + TestIdentity_2_3_4 + AskForSection_2_3 + AskForSection_2_4 + AskForSection_2_0 + AskForSection_2_2 + AskForSection_2_1 + Idle_2 + CS_2 = 1
inv : WantSection_2_F - Idle_2 = 0
inv : Turn_1_0 + Turn_1_5 + Turn_1_4 + Turn_1_1 + Turn_1_3 + Turn_1_2 = 1
inv : WantSection_2_T + Idle_2 = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_2_1 + IsEndLoop_5_3_1 + IsEndLoop_5_4_1 + IsEndLoop_5_0_2 + IsEndLoop_5_1_2 + IsEndLoop_5_3_2 + IsEndLoop_5_2_2 + IsEndLoop_5_4_2 + IsEndLoop_5_0_3 + IsEndLoop_5_2_3 + IsEndLoop_5_1_3 + IsEndLoop_5_3_3 + IsEndLoop_5_4_3 + IsEndLoop_5_2_4 + IsEndLoop_5_0_4 + IsEndLoop_5_1_4 + IsEndLoop_5_4_4 + IsEndLoop_5_0_5 + IsEndLoop_5_3_4 + IsEndLoop_5_2_5 + IsEndLoop_5_1_5 + EndTurn_5_0 + IsEndLoop_5_3_5 + IsEndLoop_5_4_5 + EndTurn_5_3 + EndTurn_5_2 + EndTurn_5_1 + BeginLoop_5_0_0 + EndTurn_5_4 + BeginLoop_5_3_0 + BeginLoop_5_2_0 + BeginLoop_5_1_0 + BeginLoop_5_1_1 + BeginLoop_5_0_1 + BeginLoop_5_4_0 + BeginLoop_5_4_1 + BeginLoop_5_0_2 + BeginLoop_5_1_2 + BeginLoop_5_2_1 + BeginLoop_5_3_1 + BeginLoop_5_0_3 + BeginLoop_5_1_3 + BeginLoop_5_2_2 + BeginLoop_5_3_2 + BeginLoop_5_4_2 + BeginLoop_5_0_4 + BeginLoop_5_2_4 + BeginLoop_5_1_4 + BeginLoop_5_3_3 + BeginLoop_5_2_3 + BeginLoop_5_4_3 + BeginLoop_5_1_5 + BeginLoop_5_0_5 + BeginLoop_5_2_5 + BeginLoop_5_3_4 + BeginLoop_5_4_4 + TestAlone_5_0_0 + TestAlone_5_1_0 + BeginLoop_5_4_5 + BeginLoop_5_3_5 + TestAlone_5_2_1 + TestAlone_5_0_1 + TestAlone_5_1_1 + TestAlone_5_3_0 + TestAlone_5_4_0 + TestAlone_5_2_0 + TestAlone_5_4_2 + TestAlone_5_3_2 + TestAlone_5_2_2 + TestAlone_5_1_2 + TestAlone_5_0_2 + TestAlone_5_4_1 + TestAlone_5_3_1 + TestAlone_5_0_4 + TestAlone_5_4_3 + TestAlone_5_3_3 + TestAlone_5_2_3 + TestAlone_5_1_3 + TestAlone_5_0_3 + TestTurn_5_1 + TestTurn_5_0 + TestTurn_5_2 + TestAlone_5_2_4 + TestAlone_5_1_4 + TestAlone_5_3_4 + TestAlone_5_4_4 + TestIdentity_5_3_0 + TestIdentity_5_4_0 + TestIdentity_5_0_1 + TestIdentity_5_1_1 + TestIdentity_5_2_1 + TestIdentity_5_3_1 + TestTurn_5_3 + TestTurn_5_4 + TestIdentity_5_0_0 + TestIdentity_5_1_0 + TestIdentity_5_2_0 + TestIdentity_5_1_3 + TestIdentity_5_0_3 + TestIdentity_5_4_2 + TestIdentity_5_3_3 + TestIdentity_5_2_3 + TestIdentity_5_0_2 + TestIdentity_5_4_1 + TestIdentity_5_3_2 + TestIdentity_5_2_2 + TestIdentity_5_1_2 + TestIdentity_5_1_5 + TestIdentity_5_0_5 + TestIdentity_5_4_5 + TestIdentity_5_2_5 + TestIdentity_5_3_5 + TestIdentity_5_1_4 + TestIdentity_5_4_3 + TestIdentity_5_0_4 + TestIdentity_5_3_4 + TestIdentity_5_4_4 + TestIdentity_5_2_4 + AskForSection_5_2 + AskForSection_5_4 + AskForSection_5_3 + AskForSection_5_0 + Idle_5 + AskForSection_5_1 + CS_5 = 1
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_0_2 + IsEndLoop_4_2_2 + IsEndLoop_4_1_2 + IsEndLoop_4_3_2 + IsEndLoop_4_4_2 + IsEndLoop_4_1_3 + IsEndLoop_4_0_3 + IsEndLoop_4_2_3 + IsEndLoop_4_3_3 + IsEndLoop_4_0_4 + IsEndLoop_4_4_3 + IsEndLoop_4_2_4 + IsEndLoop_4_1_4 + IsEndLoop_4_0_5 + IsEndLoop_4_3_4 + IsEndLoop_4_4_4 + IsEndLoop_4_2_5 + IsEndLoop_4_3_5 + IsEndLoop_4_1_5 + EndTurn_4_0 + IsEndLoop_4_4_5 + EndTurn_4_3 + EndTurn_4_2 + EndTurn_4_1 + BeginLoop_4_1_0 + BeginLoop_4_0_0 + EndTurn_4_4 + BeginLoop_4_3_0 + BeginLoop_4_2_0 + BeginLoop_4_1_1 + BeginLoop_4_0_1 + BeginLoop_4_4_0 + BeginLoop_4_0_2 + BeginLoop_4_1_2 + BeginLoop_4_2_1 + BeginLoop_4_3_1 + BeginLoop_4_4_1 + BeginLoop_4_0_3 + BeginLoop_4_1_3 + BeginLoop_4_2_3 + BeginLoop_4_2_2 + BeginLoop_4_3_2 + BeginLoop_4_4_2 + BeginLoop_4_1_4 + BeginLoop_4_0_4 + BeginLoop_4_2_4 + BeginLoop_4_3_3 + BeginLoop_4_4_3 + BeginLoop_4_1_5 + BeginLoop_4_2_5 + BeginLoop_4_3_4 + BeginLoop_4_0_5 + BeginLoop_4_4_4 + TestAlone_4_0_0 + TestAlone_4_1_0 + BeginLoop_4_3_5 + BeginLoop_4_4_5 + TestAlone_4_2_1 + TestAlone_4_0_1 + TestAlone_4_1_1 + TestAlone_4_4_0 + TestAlone_4_2_0 + TestAlone_4_3_0 + TestAlone_4_4_2 + TestAlone_4_3_2 + TestAlone_4_2_2 + TestAlone_4_1_2 + TestAlone_4_0_2 + TestAlone_4_4_1 + TestAlone_4_3_1 + TestAlone_4_4_3 + TestAlone_4_3_3 + TestAlone_4_2_3 + TestAlone_4_1_3 + TestAlone_4_0_3 + TestAlone_4_3_5 + TestAlone_4_2_5 + TestTurn_4_0 + TestAlone_4_4_5 + TestTurn_4_1 + TestTurn_4_2 + TestAlone_4_0_5 + TestAlone_4_1_5 + TestIdentity_4_4_0 + TestIdentity_4_0_1 + TestIdentity_4_1_1 + TestIdentity_4_2_1 + TestIdentity_4_3_1 + TestTurn_4_3 + TestTurn_4_4 + TestIdentity_4_0_0 + TestIdentity_4_1_0 + TestIdentity_4_2_0 + TestIdentity_4_3_0 + TestIdentity_4_1_3 + TestIdentity_4_0_3 + TestIdentity_4_4_2 + TestIdentity_4_4_3 + TestIdentity_4_3_3 + TestIdentity_4_2_3 + TestIdentity_4_1_2 + TestIdentity_4_0_2 + TestIdentity_4_4_1 + TestIdentity_4_3_2 + TestIdentity_4_2_2 + TestIdentity_4_1_5 + TestIdentity_4_2_5 + TestIdentity_4_0_5 + TestIdentity_4_4_5 + TestIdentity_4_3_5 + TestIdentity_4_1_4 + TestIdentity_4_0_4 + TestIdentity_4_4_4 + TestIdentity_4_2_4 + TestIdentity_4_3_4 + AskForSection_4_3 + AskForSection_4_2 + AskForSection_4_4 + AskForSection_4_0 + AskForSection_4_1 + Idle_4 + CS_4 = 1
Total of 23 invariants.
[2020-05-21 01:27:04] [INFO ] Computed 23 place invariants in 24 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph3006054084855741346.bin, -l, -1, -v, -w, /tmp/graph3006054084855741346.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 01:27:04] [INFO ] Decomposing Gal with order
[2020-05-21 01:27:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 01:27:05] [INFO ] Removed a total of 589 redundant transitions.
[2020-05-21 01:27:05] [INFO ] Flatten gal took : 1467 ms
[2020-05-21 01:27:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 306 labels/synchronizations in 49 ms.
[2020-05-21 01:27:06] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 32 ms
[2020-05-21 01:27:06] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 8 LTL properties
Checking formula 0 : !(((F((G("((((((gu3.Idle_5+gu3.Idle_4)+gu3.Idle_3)+gu3.Idle_2)+gu3.Idle_1)+gu3.Idle_0)>=6)"))U("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_3_0_0)+gu0.IsEndLoop_4_0_0)+gu0.IsEndLoop_5_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_3_1_0)+gu0.IsEndLoop_4_1_0)+gu0.IsEndLoop_5_1_0)+gu0.IsEndLoop_0_2_0)+gu0.IsEndLoop_2_2_0)+gu0.IsEndLoop_1_2_0)+gu0.IsEndLoop_4_2_0)+gu0.IsEndLoop_3_2_0)+gu0.IsEndLoop_0_3_0)+gu0.IsEndLoop_5_2_0)+gu0.IsEndLoop_2_3_0)+gu0.IsEndLoop_1_3_0)+gu0.IsEndLoop_4_3_0)+gu0.IsEndLoop_3_3_0)+gu0.IsEndLoop_0_4_0)+gu0.IsEndLoop_5_3_0)+gu0.IsEndLoop_2_4_0)+gu0.IsEndLoop_1_4_0)+gu0.IsEndLoop_4_4_0)+gu0.IsEndLoop_3_4_0)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_5_4_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_5_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_3_0_1)+gu0.IsEndLoop_4_0_1)+gu0.IsEndLoop_3_1_1)+gu0.IsEndLoop_4_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_1_2_1)+gu0.IsEndLoop_2_2_1)+gu0.IsEndLoop_5_1_1)+gu0.IsEndLoop_0_2_1)+gu0.IsEndLoop_0_3_1)+gu0.IsEndLoop_5_2_1)+gu0.IsEndLoop_4_2_1)+gu0.IsEndLoop_3_2_1)+gu0.IsEndLoop_4_3_1)+gu0.IsEndLoop_3_3_1)+gu0.IsEndLoop_2_3_1)+gu0.IsEndLoop_1_3_1)+gu0.IsEndLoop_2_4_1)+gu0.IsEndLoop_1_4_1)+gu0.IsEndLoop_0_4_1)+gu0.IsEndLoop_5_3_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_5_4_1)+gu0.IsEndLoop_4_4_1)+gu0.IsEndLoop_3_4_1)+gu0.IsEndLoop_5_0_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_2_1_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_3_0_2)+gu0.IsEndLoop_4_0_2)+gu0.IsEndLoop_1_2_2)+gu0.IsEndLoop_2_2_2)+gu0.IsEndLoop_3_2_2)+gu0.IsEndLoop_4_2_2)+gu0.IsEndLoop_3_1_2)+gu0.IsEndLoop_4_1_2)+gu0.IsEndLoop_5_1_2)+gu0.IsEndLoop_0_2_2)+gu0.IsEndLoop_4_3_2)+gu0.IsEndLoop_3_3_2)+gu0.IsEndLoop_0_4_2)+gu0.IsEndLoop_5_3_2)+gu0.IsEndLoop_0_3_2)+gu0.IsEndLoop_5_2_2)+gu0.IsEndLoop_2_3_2)+gu0.IsEndLoop_1_3_2)+gu0.IsEndLoop_0_0_3)+gu0.IsEndLoop_5_4_2)+gu0.IsEndLoop_2_0_3)+gu0.IsEndLoop_1_0_3)+gu0.IsEndLoop_2_4_2)+gu0.IsEndLoop_1_4_2)+gu0.IsEndLoop_4_4_2)+gu0.IsEndLoop_3_4_2)+gu0.IsEndLoop_3_1_3)+gu0.IsEndLoop_4_1_3)+gu0.IsEndLoop_1_1_3)+gu0.IsEndLoop_2_1_3)+gu0.IsEndLoop_5_0_3)+gu0.IsEndLoop_0_1_3)+gu0.IsEndLoop_3_0_3)+gu0.IsEndLoop_4_0_3)+gu0.IsEndLoop_5_2_3)+gu0.IsEndLoop_0_3_3)+gu0.IsEndLoop_3_2_3)+gu0.IsEndLoop_4_2_3)+gu0.IsEndLoop_1_2_3)+gu0.IsEndLoop_2_2_3)+gu0.IsEndLoop_5_1_3)+gu0.IsEndLoop_0_2_3)+gu0.IsEndLoop_2_4_3)+gu0.IsEndLoop_1_4_3)+gu0.IsEndLoop_0_4_3)+gu0.IsEndLoop_5_3_3)+gu0.IsEndLoop_4_3_3)+gu0.IsEndLoop_3_3_3)+gu0.IsEndLoop_2_3_3)+gu0.IsEndLoop_1_3_3)+gu0.IsEndLoop_4_0_4)+gu0.IsEndLoop_3_0_4)+gu0.IsEndLoop_2_0_4)+gu0.IsEndLoop_1_0_4)+gu0.IsEndLoop_0_0_4)+gu0.IsEndLoop_5_4_3)+gu0.IsEndLoop_4_4_3)+gu0.IsEndLoop_3_4_3)+gu0.IsEndLoop_2_2_4)+gu0.IsEndLoop_1_2_4)+gu0.IsEndLoop_4_2_4)+gu0.IsEndLoop_3_2_4)+gu0.IsEndLoop_0_3_4)+gu0.IsEndLoop_5_2_4)+gu0.IsEndLoop_2_3_4)+gu0.IsEndLoop_1_3_4)+gu0.IsEndLoop_0_1_4)+gu0.IsEndLoop_5_0_4)+gu0.IsEndLoop_2_1_4)+gu0.IsEndLoop_1_1_4)+gu0.IsEndLoop_4_1_4)+gu0.IsEndLoop_3_1_4)+gu0.IsEndLoop_0_2_4)+gu0.IsEndLoop_5_1_4)+gu0.IsEndLoop_5_4_4)+gu0.IsEndLoop_0_0_5)+gu0.IsEndLoop_1_0_5)+gu0.IsEndLoop_2_0_5)+gu0.IsEndLoop_3_0_5)+gu0.IsEndLoop_4_0_5)+gu0.IsEndLoop_5_0_5)+gu0.IsEndLoop_0_1_5)+gu0.IsEndLoop_3_3_4)+gu0.IsEndLoop_4_3_4)+gu0.IsEndLoop_5_3_4)+gu0.IsEndLoop_0_4_4)+gu0.IsEndLoop_1_4_4)+gu0.IsEndLoop_2_4_4)+gu0.IsEndLoop_3_4_4)+gu0.IsEndLoop_4_4_4)+gu0.IsEndLoop_0_3_5)+gu0.IsEndLoop_5_2_5)+gu0.IsEndLoop_4_2_5)+gu0.IsEndLoop_3_2_5)+gu0.IsEndLoop_4_3_5)+gu0.IsEndLoop_3_3_5)+gu0.IsEndLoop_2_3_5)+gu0.IsEndLoop_1_3_5)+gu0.IsEndLoop_4_1_5)+gu0.IsEndLoop_3_1_5)+gu0.IsEndLoop_2_1_5)+gu0.IsEndLoop_1_1_5)+gu0.IsEndLoop_2_2_5)+gu0.IsEndLoop_1_2_5)+gu0.IsEndLoop_0_2_5)+gu0.IsEndLoop_5_1_5)+gu0.IsEndLoop_1_4_5)+gu0.IsEndLoop_2_4_5)+gu0.IsEndLoop_5_3_5)+gu0.IsEndLoop_0_4_5)+gu0.IsEndLoop_5_4_5)+gu0.IsEndLoop_3_4_5)+gu0.IsEndLoop_4_4_5)<=5)")))&&(G("(((((((gu3.Idle_5+gu3.Idle_4)+gu3.Idle_3)+gu3.Idle_2)+gu3.Idle_1)+gu3.Idle_0)>=6)||((((((((((((((((((((((((((((((gu0.AskForSection_2_3+gu0.AskForSection_1_3)+gu0.AskForSection_4_3)+gu0.AskForSection_3_3)+gu0.AskForSection_4_2)+gu0.AskForSection_3_2)+gu0.AskForSection_0_3)+gu0.AskForSection_5_2)+gu0.AskForSection_4_4)+gu0.AskForSection_3_4)+gu0.AskForSection_5_4)+gu0.AskForSection_0_4)+gu0.AskForSection_5_3)+gu0.AskForSection_2_4)+gu0.AskForSection_1_4)+gu0.AskForSection_3_0)+gu0.AskForSection_4_0)+gu0.AskForSection_5_0)+gu0.AskForSection_0_1)+gu0.AskForSection_0_0)+gu0.AskForSection_1_0)+gu0.AskForSection_2_0)+gu0.AskForSection_5_1)+gu0.AskForSection_0_2)+gu0.AskForSection_1_2)+gu0.AskForSection_2_2)+gu0.AskForSection_1_1)+gu0.AskForSection_2_1)+gu0.AskForSection_3_1)+gu0.AskForSection_4_1)>=5))"))))
Formula 0 simplified : !(F(G"((((((gu3.Idle_5+gu3.Idle_4)+gu3.Idle_3)+gu3.Idle_2)+gu3.Idle_1)+gu3.Idle_0)>=6)" U "((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_3_0_0)+gu0.IsEndLoop_4_0_0)+gu0.IsEndLoop_5_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_3_1_0)+gu0.IsEndLoop_4_1_0)+gu0.IsEndLoop_5_1_0)+gu0.IsEndLoop_0_2_0)+gu0.IsEndLoop_2_2_0)+gu0.IsEndLoop_1_2_0)+gu0.IsEndLoop_4_2_0)+gu0.IsEndLoop_3_2_0)+gu0.IsEndLoop_0_3_0)+gu0.IsEndLoop_5_2_0)+gu0.IsEndLoop_2_3_0)+gu0.IsEndLoop_1_3_0)+gu0.IsEndLoop_4_3_0)+gu0.IsEndLoop_3_3_0)+gu0.IsEndLoop_0_4_0)+gu0.IsEndLoop_5_3_0)+gu0.IsEndLoop_2_4_0)+gu0.IsEndLoop_1_4_0)+gu0.IsEndLoop_4_4_0)+gu0.IsEndLoop_3_4_0)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_5_4_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_5_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_3_0_1)+gu0.IsEndLoop_4_0_1)+gu0.IsEndLoop_3_1_1)+gu0.IsEndLoop_4_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_1_2_1)+gu0.IsEndLoop_2_2_1)+gu0.IsEndLoop_5_1_1)+gu0.IsEndLoop_0_2_1)+gu0.IsEndLoop_0_3_1)+gu0.IsEndLoop_5_2_1)+gu0.IsEndLoop_4_2_1)+gu0.IsEndLoop_3_2_1)+gu0.IsEndLoop_4_3_1)+gu0.IsEndLoop_3_3_1)+gu0.IsEndLoop_2_3_1)+gu0.IsEndLoop_1_3_1)+gu0.IsEndLoop_2_4_1)+gu0.IsEndLoop_1_4_1)+gu0.IsEndLoop_0_4_1)+gu0.IsEndLoop_5_3_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_5_4_1)+gu0.IsEndLoop_4_4_1)+gu0.IsEndLoop_3_4_1)+gu0.IsEndLoop_5_0_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_2_1_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_3_0_2)+gu0.IsEndLoop_4_0_2)+gu0.IsEndLoop_1_2_2)+gu0.IsEndLoop_2_2_2)+gu0.IsEndLoop_3_2_2)+gu0.IsEndLoop_4_2_2)+gu0.IsEndLoop_3_1_2)+gu0.IsEndLoop_4_1_2)+gu0.IsEndLoop_5_1_2)+gu0.IsEndLoop_0_2_2)+gu0.IsEndLoop_4_3_2)+gu0.IsEndLoop_3_3_2)+gu0.IsEndLoop_0_4_2)+gu0.IsEndLoop_5_3_2)+gu0.IsEndLoop_0_3_2)+gu0.IsEndLoop_5_2_2)+gu0.IsEndLoop_2_3_2)+gu0.IsEndLoop_1_3_2)+gu0.IsEndLoop_0_0_3)+gu0.IsEndLoop_5_4_2)+gu0.IsEndLoop_2_0_3)+gu0.IsEndLoop_1_0_3)+gu0.IsEndLoop_2_4_2)+gu0.IsEndLoop_1_4_2)+gu0.IsEndLoop_4_4_2)+gu0.IsEndLoop_3_4_2)+gu0.IsEndLoop_3_1_3)+gu0.IsEndLoop_4_1_3)+gu0.IsEndLoop_1_1_3)+gu0.IsEndLoop_2_1_3)+gu0.IsEndLoop_5_0_3)+gu0.IsEndLoop_0_1_3)+gu0.IsEndLoop_3_0_3)+gu0.IsEndLoop_4_0_3)+gu0.IsEndLoop_5_2_3)+gu0.IsEndLoop_0_3_3)+gu0.IsEndLoop_3_2_3)+gu0.IsEndLoop_4_2_3)+gu0.IsEndLoop_1_2_3)+gu0.IsEndLoop_2_2_3)+gu0.IsEndLoop_5_1_3)+gu0.IsEndLoop_0_2_3)+gu0.IsEndLoop_2_4_3)+gu0.IsEndLoop_1_4_3)+gu0.IsEndLoop_0_4_3)+gu0.IsEndLoop_5_3_3)+gu0.IsEndLoop_4_3_3)+gu0.IsEndLoop_3_3_3)+gu0.IsEndLoop_2_3_3)+gu0.IsEndLoop_1_3_3)+gu0.IsEndLoop_4_0_4)+gu0.IsEndLoop_3_0_4)+gu0.IsEndLoop_2_0_4)+gu0.IsEndLoop_1_0_4)+gu0.IsEndLoop_0_0_4)+gu0.IsEndLoop_5_4_3)+gu0.IsEndLoop_4_4_3)+gu0.IsEndLoop_3_4_3)+gu0.IsEndLoop_2_2_4)+gu0.IsEndLoop_1_2_4)+gu0.IsEndLoop_4_2_4)+gu0.IsEndLoop_3_2_4)+gu0.IsEndLoop_0_3_4)+gu0.IsEndLoop_5_2_4)+gu0.IsEndLoop_2_3_4)+gu0.IsEndLoop_1_3_4)+gu0.IsEndLoop_0_1_4)+gu0.IsEndLoop_5_0_4)+gu0.IsEndLoop_2_1_4)+gu0.IsEndLoop_1_1_4)+gu0.IsEndLoop_4_1_4)+gu0.IsEndLoop_3_1_4)+gu0.IsEndLoop_0_2_4)+gu0.IsEndLoop_5_1_4)+gu0.IsEndLoop_5_4_4)+gu0.IsEndLoop_0_0_5)+gu0.IsEndLoop_1_0_5)+gu0.IsEndLoop_2_0_5)+gu0.IsEndLoop_3_0_5)+gu0.IsEndLoop_4_0_5)+gu0.IsEndLoop_5_0_5)+gu0.IsEndLoop_0_1_5)+gu0.IsEndLoop_3_3_4)+gu0.IsEndLoop_4_3_4)+gu0.IsEndLoop_5_3_4)+gu0.IsEndLoop_0_4_4)+gu0.IsEndLoop_1_4_4)+gu0.IsEndLoop_2_4_4)+gu0.IsEndLoop_3_4_4)+gu0.IsEndLoop_4_4_4)+gu0.IsEndLoop_0_3_5)+gu0.IsEndLoop_5_2_5)+gu0.IsEndLoop_4_2_5)+gu0.IsEndLoop_3_2_5)+gu0.IsEndLoop_4_3_5)+gu0.IsEndLoop_3_3_5)+gu0.IsEndLoop_2_3_5)+gu0.IsEndLoop_1_3_5)+gu0.IsEndLoop_4_1_5)+gu0.IsEndLoop_3_1_5)+gu0.IsEndLoop_2_1_5)+gu0.IsEndLoop_1_1_5)+gu0.IsEndLoop_2_2_5)+gu0.IsEndLoop_1_2_5)+gu0.IsEndLoop_0_2_5)+gu0.IsEndLoop_5_1_5)+gu0.IsEndLoop_1_4_5)+gu0.IsEndLoop_2_4_5)+gu0.IsEndLoop_5_3_5)+gu0.IsEndLoop_0_4_5)+gu0.IsEndLoop_5_4_5)+gu0.IsEndLoop_3_4_5)+gu0.IsEndLoop_4_4_5)<=5)") & G"(((((((gu3.Idle_5+gu3.Idle_4)+gu3.Idle_3)+gu3.Idle_2)+gu3.Idle_1)+gu3.Idle_0)>=6)||((((((((((((((((((((((((((((((gu0.AskForSection_2_3+gu0.AskForSection_1_3)+gu0.AskForSection_4_3)+gu0.AskForSection_3_3)+gu0.AskForSection_4_2)+gu0.AskForSection_3_2)+gu0.AskForSection_0_3)+gu0.AskForSection_5_2)+gu0.AskForSection_4_4)+gu0.AskForSection_3_4)+gu0.AskForSection_5_4)+gu0.AskForSection_0_4)+gu0.AskForSection_5_3)+gu0.AskForSection_2_4)+gu0.AskForSection_1_4)+gu0.AskForSection_3_0)+gu0.AskForSection_4_0)+gu0.AskForSection_5_0)+gu0.AskForSection_0_1)+gu0.AskForSection_0_0)+gu0.AskForSection_1_0)+gu0.AskForSection_2_0)+gu0.AskForSection_5_1)+gu0.AskForSection_0_2)+gu0.AskForSection_1_2)+gu0.AskForSection_2_2)+gu0.AskForSection_1_1)+gu0.AskForSection_2_1)+gu0.AskForSection_3_1)+gu0.AskForSection_4_1)>=5))")
[2020-05-21 01:27:07] [INFO ] Proved 834 variables to be positive in 2918 ms
[2020-05-21 01:27:07] [INFO ] Computing symmetric may disable matrix : 1242 transitions.
[2020-05-21 01:27:07] [INFO ] Computation of disable matrix completed :0/1242 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:27:07] [INFO ] Computation of Complete disable matrix. took 87 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:27:07] [INFO ] Computing symmetric may enable matrix : 1242 transitions.
[2020-05-21 01:27:07] [INFO ] Computation of Complete enable matrix. took 73 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:28:45] [INFO ] Computing symmetric co enabling matrix : 1242 transitions.
[2020-05-21 01:28:46] [INFO ] Computation of co-enabling matrix(0/1242) took 121 ms. Total solver calls (SAT/UNSAT): 206(0/206)
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown' twice, overapproximating result to 1.
[2020-05-21 01:28:47] [INFO ] Computation of Finished co-enabling matrix. took 1835 ms. Total solver calls (SAT/UNSAT): 285(1/284)
[2020-05-21 01:28:47] [INFO ] Computing Do-Not-Accords matrix : 1242 transitions.
[2020-05-21 01:28:58] [INFO ] Computation of Completed DNA matrix. took 10440 ms. Total solver calls (SAT/UNSAT): 6104(0/6104)
[2020-05-21 01:28:58] [INFO ] Built C files in 115534ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 16220 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 125 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ( <>(([]((LTLAP0==true)))U((LTLAP1==true))) ) && ( []((LTLAP2==true)) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ( <>(([]((LTLAP0==true)))U((LTLAP1==true))) ) && ( []((LTLAP2==true)) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ( <>(([]((LTLAP0==true)))U((LTLAP1==true))) ) && ( []((LTLAP2==true)) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2020-05-21 01:48:44] [INFO ] Flatten gal took : 525 ms
[2020-05-21 01:48:45] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 93 ms
[2020-05-21 01:48:45] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 35 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 8 LTL properties
Checking formula 0 : !(((F((G("((((((Idle_5+Idle_4)+Idle_3)+Idle_2)+Idle_1)+Idle_0)>=6)"))U("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((IsEndLoop_0_0_0+IsEndLoop_1_0_0)+IsEndLoop_2_0_0)+IsEndLoop_3_0_0)+IsEndLoop_4_0_0)+IsEndLoop_5_0_0)+IsEndLoop_0_1_0)+IsEndLoop_1_1_0)+IsEndLoop_2_1_0)+IsEndLoop_3_1_0)+IsEndLoop_4_1_0)+IsEndLoop_5_1_0)+IsEndLoop_0_2_0)+IsEndLoop_2_2_0)+IsEndLoop_1_2_0)+IsEndLoop_4_2_0)+IsEndLoop_3_2_0)+IsEndLoop_0_3_0)+IsEndLoop_5_2_0)+IsEndLoop_2_3_0)+IsEndLoop_1_3_0)+IsEndLoop_4_3_0)+IsEndLoop_3_3_0)+IsEndLoop_0_4_0)+IsEndLoop_5_3_0)+IsEndLoop_2_4_0)+IsEndLoop_1_4_0)+IsEndLoop_4_4_0)+IsEndLoop_3_4_0)+IsEndLoop_1_0_1)+IsEndLoop_2_0_1)+IsEndLoop_5_4_0)+IsEndLoop_0_0_1)+IsEndLoop_5_0_1)+IsEndLoop_0_1_1)+IsEndLoop_3_0_1)+IsEndLoop_4_0_1)+IsEndLoop_3_1_1)+IsEndLoop_4_1_1)+IsEndLoop_1_1_1)+IsEndLoop_2_1_1)+IsEndLoop_1_2_1)+IsEndLoop_2_2_1)+IsEndLoop_5_1_1)+IsEndLoop_0_2_1)+IsEndLoop_0_3_1)+IsEndLoop_5_2_1)+IsEndLoop_4_2_1)+IsEndLoop_3_2_1)+IsEndLoop_4_3_1)+IsEndLoop_3_3_1)+IsEndLoop_2_3_1)+IsEndLoop_1_3_1)+IsEndLoop_2_4_1)+IsEndLoop_1_4_1)+IsEndLoop_0_4_1)+IsEndLoop_5_3_1)+IsEndLoop_0_0_2)+IsEndLoop_5_4_1)+IsEndLoop_4_4_1)+IsEndLoop_3_4_1)+IsEndLoop_5_0_2)+IsEndLoop_0_1_2)+IsEndLoop_1_1_2)+IsEndLoop_2_1_2)+IsEndLoop_1_0_2)+IsEndLoop_2_0_2)+IsEndLoop_3_0_2)+IsEndLoop_4_0_2)+IsEndLoop_1_2_2)+IsEndLoop_2_2_2)+IsEndLoop_3_2_2)+IsEndLoop_4_2_2)+IsEndLoop_3_1_2)+IsEndLoop_4_1_2)+IsEndLoop_5_1_2)+IsEndLoop_0_2_2)+IsEndLoop_4_3_2)+IsEndLoop_3_3_2)+IsEndLoop_0_4_2)+IsEndLoop_5_3_2)+IsEndLoop_0_3_2)+IsEndLoop_5_2_2)+IsEndLoop_2_3_2)+IsEndLoop_1_3_2)+IsEndLoop_0_0_3)+IsEndLoop_5_4_2)+IsEndLoop_2_0_3)+IsEndLoop_1_0_3)+IsEndLoop_2_4_2)+IsEndLoop_1_4_2)+IsEndLoop_4_4_2)+IsEndLoop_3_4_2)+IsEndLoop_3_1_3)+IsEndLoop_4_1_3)+IsEndLoop_1_1_3)+IsEndLoop_2_1_3)+IsEndLoop_5_0_3)+IsEndLoop_0_1_3)+IsEndLoop_3_0_3)+IsEndLoop_4_0_3)+IsEndLoop_5_2_3)+IsEndLoop_0_3_3)+IsEndLoop_3_2_3)+IsEndLoop_4_2_3)+IsEndLoop_1_2_3)+IsEndLoop_2_2_3)+IsEndLoop_5_1_3)+IsEndLoop_0_2_3)+IsEndLoop_2_4_3)+IsEndLoop_1_4_3)+IsEndLoop_0_4_3)+IsEndLoop_5_3_3)+IsEndLoop_4_3_3)+IsEndLoop_3_3_3)+IsEndLoop_2_3_3)+IsEndLoop_1_3_3)+IsEndLoop_4_0_4)+IsEndLoop_3_0_4)+IsEndLoop_2_0_4)+IsEndLoop_1_0_4)+IsEndLoop_0_0_4)+IsEndLoop_5_4_3)+IsEndLoop_4_4_3)+IsEndLoop_3_4_3)+IsEndLoop_2_2_4)+IsEndLoop_1_2_4)+IsEndLoop_4_2_4)+IsEndLoop_3_2_4)+IsEndLoop_0_3_4)+IsEndLoop_5_2_4)+IsEndLoop_2_3_4)+IsEndLoop_1_3_4)+IsEndLoop_0_1_4)+IsEndLoop_5_0_4)+IsEndLoop_2_1_4)+IsEndLoop_1_1_4)+IsEndLoop_4_1_4)+IsEndLoop_3_1_4)+IsEndLoop_0_2_4)+IsEndLoop_5_1_4)+IsEndLoop_5_4_4)+IsEndLoop_0_0_5)+IsEndLoop_1_0_5)+IsEndLoop_2_0_5)+IsEndLoop_3_0_5)+IsEndLoop_4_0_5)+IsEndLoop_5_0_5)+IsEndLoop_0_1_5)+IsEndLoop_3_3_4)+IsEndLoop_4_3_4)+IsEndLoop_5_3_4)+IsEndLoop_0_4_4)+IsEndLoop_1_4_4)+IsEndLoop_2_4_4)+IsEndLoop_3_4_4)+IsEndLoop_4_4_4)+IsEndLoop_0_3_5)+IsEndLoop_5_2_5)+IsEndLoop_4_2_5)+IsEndLoop_3_2_5)+IsEndLoop_4_3_5)+IsEndLoop_3_3_5)+IsEndLoop_2_3_5)+IsEndLoop_1_3_5)+IsEndLoop_4_1_5)+IsEndLoop_3_1_5)+IsEndLoop_2_1_5)+IsEndLoop_1_1_5)+IsEndLoop_2_2_5)+IsEndLoop_1_2_5)+IsEndLoop_0_2_5)+IsEndLoop_5_1_5)+IsEndLoop_1_4_5)+IsEndLoop_2_4_5)+IsEndLoop_5_3_5)+IsEndLoop_0_4_5)+IsEndLoop_5_4_5)+IsEndLoop_3_4_5)+IsEndLoop_4_4_5)<=5)")))&&(G("(((((((Idle_5+Idle_4)+Idle_3)+Idle_2)+Idle_1)+Idle_0)>=6)||((((((((((((((((((((((((((((((AskForSection_2_3+AskForSection_1_3)+AskForSection_4_3)+AskForSection_3_3)+AskForSection_4_2)+AskForSection_3_2)+AskForSection_0_3)+AskForSection_5_2)+AskForSection_4_4)+AskForSection_3_4)+AskForSection_5_4)+AskForSection_0_4)+AskForSection_5_3)+AskForSection_2_4)+AskForSection_1_4)+AskForSection_3_0)+AskForSection_4_0)+AskForSection_5_0)+AskForSection_0_1)+AskForSection_0_0)+AskForSection_1_0)+AskForSection_2_0)+AskForSection_5_1)+AskForSection_0_2)+AskForSection_1_2)+AskForSection_2_2)+AskForSection_1_1)+AskForSection_2_1)+AskForSection_3_1)+AskForSection_4_1)>=5))"))))
Formula 0 simplified : !(F(G"((((((Idle_5+Idle_4)+Idle_3)+Idle_2)+Idle_1)+Idle_0)>=6)" U "((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((IsEndLoop_0_0_0+IsEndLoop_1_0_0)+IsEndLoop_2_0_0)+IsEndLoop_3_0_0)+IsEndLoop_4_0_0)+IsEndLoop_5_0_0)+IsEndLoop_0_1_0)+IsEndLoop_1_1_0)+IsEndLoop_2_1_0)+IsEndLoop_3_1_0)+IsEndLoop_4_1_0)+IsEndLoop_5_1_0)+IsEndLoop_0_2_0)+IsEndLoop_2_2_0)+IsEndLoop_1_2_0)+IsEndLoop_4_2_0)+IsEndLoop_3_2_0)+IsEndLoop_0_3_0)+IsEndLoop_5_2_0)+IsEndLoop_2_3_0)+IsEndLoop_1_3_0)+IsEndLoop_4_3_0)+IsEndLoop_3_3_0)+IsEndLoop_0_4_0)+IsEndLoop_5_3_0)+IsEndLoop_2_4_0)+IsEndLoop_1_4_0)+IsEndLoop_4_4_0)+IsEndLoop_3_4_0)+IsEndLoop_1_0_1)+IsEndLoop_2_0_1)+IsEndLoop_5_4_0)+IsEndLoop_0_0_1)+IsEndLoop_5_0_1)+IsEndLoop_0_1_1)+IsEndLoop_3_0_1)+IsEndLoop_4_0_1)+IsEndLoop_3_1_1)+IsEndLoop_4_1_1)+IsEndLoop_1_1_1)+IsEndLoop_2_1_1)+IsEndLoop_1_2_1)+IsEndLoop_2_2_1)+IsEndLoop_5_1_1)+IsEndLoop_0_2_1)+IsEndLoop_0_3_1)+IsEndLoop_5_2_1)+IsEndLoop_4_2_1)+IsEndLoop_3_2_1)+IsEndLoop_4_3_1)+IsEndLoop_3_3_1)+IsEndLoop_2_3_1)+IsEndLoop_1_3_1)+IsEndLoop_2_4_1)+IsEndLoop_1_4_1)+IsEndLoop_0_4_1)+IsEndLoop_5_3_1)+IsEndLoop_0_0_2)+IsEndLoop_5_4_1)+IsEndLoop_4_4_1)+IsEndLoop_3_4_1)+IsEndLoop_5_0_2)+IsEndLoop_0_1_2)+IsEndLoop_1_1_2)+IsEndLoop_2_1_2)+IsEndLoop_1_0_2)+IsEndLoop_2_0_2)+IsEndLoop_3_0_2)+IsEndLoop_4_0_2)+IsEndLoop_1_2_2)+IsEndLoop_2_2_2)+IsEndLoop_3_2_2)+IsEndLoop_4_2_2)+IsEndLoop_3_1_2)+IsEndLoop_4_1_2)+IsEndLoop_5_1_2)+IsEndLoop_0_2_2)+IsEndLoop_4_3_2)+IsEndLoop_3_3_2)+IsEndLoop_0_4_2)+IsEndLoop_5_3_2)+IsEndLoop_0_3_2)+IsEndLoop_5_2_2)+IsEndLoop_2_3_2)+IsEndLoop_1_3_2)+IsEndLoop_0_0_3)+IsEndLoop_5_4_2)+IsEndLoop_2_0_3)+IsEndLoop_1_0_3)+IsEndLoop_2_4_2)+IsEndLoop_1_4_2)+IsEndLoop_4_4_2)+IsEndLoop_3_4_2)+IsEndLoop_3_1_3)+IsEndLoop_4_1_3)+IsEndLoop_1_1_3)+IsEndLoop_2_1_3)+IsEndLoop_5_0_3)+IsEndLoop_0_1_3)+IsEndLoop_3_0_3)+IsEndLoop_4_0_3)+IsEndLoop_5_2_3)+IsEndLoop_0_3_3)+IsEndLoop_3_2_3)+IsEndLoop_4_2_3)+IsEndLoop_1_2_3)+IsEndLoop_2_2_3)+IsEndLoop_5_1_3)+IsEndLoop_0_2_3)+IsEndLoop_2_4_3)+IsEndLoop_1_4_3)+IsEndLoop_0_4_3)+IsEndLoop_5_3_3)+IsEndLoop_4_3_3)+IsEndLoop_3_3_3)+IsEndLoop_2_3_3)+IsEndLoop_1_3_3)+IsEndLoop_4_0_4)+IsEndLoop_3_0_4)+IsEndLoop_2_0_4)+IsEndLoop_1_0_4)+IsEndLoop_0_0_4)+IsEndLoop_5_4_3)+IsEndLoop_4_4_3)+IsEndLoop_3_4_3)+IsEndLoop_2_2_4)+IsEndLoop_1_2_4)+IsEndLoop_4_2_4)+IsEndLoop_3_2_4)+IsEndLoop_0_3_4)+IsEndLoop_5_2_4)+IsEndLoop_2_3_4)+IsEndLoop_1_3_4)+IsEndLoop_0_1_4)+IsEndLoop_5_0_4)+IsEndLoop_2_1_4)+IsEndLoop_1_1_4)+IsEndLoop_4_1_4)+IsEndLoop_3_1_4)+IsEndLoop_0_2_4)+IsEndLoop_5_1_4)+IsEndLoop_5_4_4)+IsEndLoop_0_0_5)+IsEndLoop_1_0_5)+IsEndLoop_2_0_5)+IsEndLoop_3_0_5)+IsEndLoop_4_0_5)+IsEndLoop_5_0_5)+IsEndLoop_0_1_5)+IsEndLoop_3_3_4)+IsEndLoop_4_3_4)+IsEndLoop_5_3_4)+IsEndLoop_0_4_4)+IsEndLoop_1_4_4)+IsEndLoop_2_4_4)+IsEndLoop_3_4_4)+IsEndLoop_4_4_4)+IsEndLoop_0_3_5)+IsEndLoop_5_2_5)+IsEndLoop_4_2_5)+IsEndLoop_3_2_5)+IsEndLoop_4_3_5)+IsEndLoop_3_3_5)+IsEndLoop_2_3_5)+IsEndLoop_1_3_5)+IsEndLoop_4_1_5)+IsEndLoop_3_1_5)+IsEndLoop_2_1_5)+IsEndLoop_1_1_5)+IsEndLoop_2_2_5)+IsEndLoop_1_2_5)+IsEndLoop_0_2_5)+IsEndLoop_5_1_5)+IsEndLoop_1_4_5)+IsEndLoop_2_4_5)+IsEndLoop_5_3_5)+IsEndLoop_0_4_5)+IsEndLoop_5_4_5)+IsEndLoop_3_4_5)+IsEndLoop_4_4_5)<=5)") & G"(((((((Idle_5+Idle_4)+Idle_3)+Idle_2)+Idle_1)+Idle_0)>=6)||((((((((((((((((((((((((((((((AskForSection_2_3+AskForSection_1_3)+AskForSection_4_3)+AskForSection_3_3)+AskForSection_4_2)+AskForSection_3_2)+AskForSection_0_3)+AskForSection_5_2)+AskForSection_4_4)+AskForSection_3_4)+AskForSection_5_4)+AskForSection_0_4)+AskForSection_5_3)+AskForSection_2_4)+AskForSection_1_4)+AskForSection_3_0)+AskForSection_4_0)+AskForSection_5_0)+AskForSection_0_1)+AskForSection_0_0)+AskForSection_1_0)+AskForSection_2_0)+AskForSection_5_1)+AskForSection_0_2)+AskForSection_1_2)+AskForSection_2_2)+AskForSection_1_1)+AskForSection_2_1)+AskForSection_3_1)+AskForSection_4_1)>=5))")
Detected timeout of ITS tools.
[2020-05-21 02:10:23] [INFO ] Flatten gal took : 473 ms
[2020-05-21 02:10:25] [INFO ] Input system was already deterministic with 1242 transitions.
[2020-05-21 02:10:25] [INFO ] Transformed 834 places.
[2020-05-21 02:10:25] [INFO ] Transformed 1242 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-21 02:10:25] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 46 ms
[2020-05-21 02:10:25] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 8 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F((G("((((((Idle_5+Idle_4)+Idle_3)+Idle_2)+Idle_1)+Idle_0)>=6)"))U("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((IsEndLoop_0_0_0+IsEndLoop_1_0_0)+IsEndLoop_2_0_0)+IsEndLoop_3_0_0)+IsEndLoop_4_0_0)+IsEndLoop_5_0_0)+IsEndLoop_0_1_0)+IsEndLoop_1_1_0)+IsEndLoop_2_1_0)+IsEndLoop_3_1_0)+IsEndLoop_4_1_0)+IsEndLoop_5_1_0)+IsEndLoop_0_2_0)+IsEndLoop_2_2_0)+IsEndLoop_1_2_0)+IsEndLoop_4_2_0)+IsEndLoop_3_2_0)+IsEndLoop_0_3_0)+IsEndLoop_5_2_0)+IsEndLoop_2_3_0)+IsEndLoop_1_3_0)+IsEndLoop_4_3_0)+IsEndLoop_3_3_0)+IsEndLoop_0_4_0)+IsEndLoop_5_3_0)+IsEndLoop_2_4_0)+IsEndLoop_1_4_0)+IsEndLoop_4_4_0)+IsEndLoop_3_4_0)+IsEndLoop_1_0_1)+IsEndLoop_2_0_1)+IsEndLoop_5_4_0)+IsEndLoop_0_0_1)+IsEndLoop_5_0_1)+IsEndLoop_0_1_1)+IsEndLoop_3_0_1)+IsEndLoop_4_0_1)+IsEndLoop_3_1_1)+IsEndLoop_4_1_1)+IsEndLoop_1_1_1)+IsEndLoop_2_1_1)+IsEndLoop_1_2_1)+IsEndLoop_2_2_1)+IsEndLoop_5_1_1)+IsEndLoop_0_2_1)+IsEndLoop_0_3_1)+IsEndLoop_5_2_1)+IsEndLoop_4_2_1)+IsEndLoop_3_2_1)+IsEndLoop_4_3_1)+IsEndLoop_3_3_1)+IsEndLoop_2_3_1)+IsEndLoop_1_3_1)+IsEndLoop_2_4_1)+IsEndLoop_1_4_1)+IsEndLoop_0_4_1)+IsEndLoop_5_3_1)+IsEndLoop_0_0_2)+IsEndLoop_5_4_1)+IsEndLoop_4_4_1)+IsEndLoop_3_4_1)+IsEndLoop_5_0_2)+IsEndLoop_0_1_2)+IsEndLoop_1_1_2)+IsEndLoop_2_1_2)+IsEndLoop_1_0_2)+IsEndLoop_2_0_2)+IsEndLoop_3_0_2)+IsEndLoop_4_0_2)+IsEndLoop_1_2_2)+IsEndLoop_2_2_2)+IsEndLoop_3_2_2)+IsEndLoop_4_2_2)+IsEndLoop_3_1_2)+IsEndLoop_4_1_2)+IsEndLoop_5_1_2)+IsEndLoop_0_2_2)+IsEndLoop_4_3_2)+IsEndLoop_3_3_2)+IsEndLoop_0_4_2)+IsEndLoop_5_3_2)+IsEndLoop_0_3_2)+IsEndLoop_5_2_2)+IsEndLoop_2_3_2)+IsEndLoop_1_3_2)+IsEndLoop_0_0_3)+IsEndLoop_5_4_2)+IsEndLoop_2_0_3)+IsEndLoop_1_0_3)+IsEndLoop_2_4_2)+IsEndLoop_1_4_2)+IsEndLoop_4_4_2)+IsEndLoop_3_4_2)+IsEndLoop_3_1_3)+IsEndLoop_4_1_3)+IsEndLoop_1_1_3)+IsEndLoop_2_1_3)+IsEndLoop_5_0_3)+IsEndLoop_0_1_3)+IsEndLoop_3_0_3)+IsEndLoop_4_0_3)+IsEndLoop_5_2_3)+IsEndLoop_0_3_3)+IsEndLoop_3_2_3)+IsEndLoop_4_2_3)+IsEndLoop_1_2_3)+IsEndLoop_2_2_3)+IsEndLoop_5_1_3)+IsEndLoop_0_2_3)+IsEndLoop_2_4_3)+IsEndLoop_1_4_3)+IsEndLoop_0_4_3)+IsEndLoop_5_3_3)+IsEndLoop_4_3_3)+IsEndLoop_3_3_3)+IsEndLoop_2_3_3)+IsEndLoop_1_3_3)+IsEndLoop_4_0_4)+IsEndLoop_3_0_4)+IsEndLoop_2_0_4)+IsEndLoop_1_0_4)+IsEndLoop_0_0_4)+IsEndLoop_5_4_3)+IsEndLoop_4_4_3)+IsEndLoop_3_4_3)+IsEndLoop_2_2_4)+IsEndLoop_1_2_4)+IsEndLoop_4_2_4)+IsEndLoop_3_2_4)+IsEndLoop_0_3_4)+IsEndLoop_5_2_4)+IsEndLoop_2_3_4)+IsEndLoop_1_3_4)+IsEndLoop_0_1_4)+IsEndLoop_5_0_4)+IsEndLoop_2_1_4)+IsEndLoop_1_1_4)+IsEndLoop_4_1_4)+IsEndLoop_3_1_4)+IsEndLoop_0_2_4)+IsEndLoop_5_1_4)+IsEndLoop_5_4_4)+IsEndLoop_0_0_5)+IsEndLoop_1_0_5)+IsEndLoop_2_0_5)+IsEndLoop_3_0_5)+IsEndLoop_4_0_5)+IsEndLoop_5_0_5)+IsEndLoop_0_1_5)+IsEndLoop_3_3_4)+IsEndLoop_4_3_4)+IsEndLoop_5_3_4)+IsEndLoop_0_4_4)+IsEndLoop_1_4_4)+IsEndLoop_2_4_4)+IsEndLoop_3_4_4)+IsEndLoop_4_4_4)+IsEndLoop_0_3_5)+IsEndLoop_5_2_5)+IsEndLoop_4_2_5)+IsEndLoop_3_2_5)+IsEndLoop_4_3_5)+IsEndLoop_3_3_5)+IsEndLoop_2_3_5)+IsEndLoop_1_3_5)+IsEndLoop_4_1_5)+IsEndLoop_3_1_5)+IsEndLoop_2_1_5)+IsEndLoop_1_1_5)+IsEndLoop_2_2_5)+IsEndLoop_1_2_5)+IsEndLoop_0_2_5)+IsEndLoop_5_1_5)+IsEndLoop_1_4_5)+IsEndLoop_2_4_5)+IsEndLoop_5_3_5)+IsEndLoop_0_4_5)+IsEndLoop_5_4_5)+IsEndLoop_3_4_5)+IsEndLoop_4_4_5)<=5)")))&&(G("(((((((Idle_5+Idle_4)+Idle_3)+Idle_2)+Idle_1)+Idle_0)>=6)||((((((((((((((((((((((((((((((AskForSection_2_3+AskForSection_1_3)+AskForSection_4_3)+AskForSection_3_3)+AskForSection_4_2)+AskForSection_3_2)+AskForSection_0_3)+AskForSection_5_2)+AskForSection_4_4)+AskForSection_3_4)+AskForSection_5_4)+AskForSection_0_4)+AskForSection_5_3)+AskForSection_2_4)+AskForSection_1_4)+AskForSection_3_0)+AskForSection_4_0)+AskForSection_5_0)+AskForSection_0_1)+AskForSection_0_0)+AskForSection_1_0)+AskForSection_2_0)+AskForSection_5_1)+AskForSection_0_2)+AskForSection_1_2)+AskForSection_2_2)+AskForSection_1_1)+AskForSection_2_1)+AskForSection_3_1)+AskForSection_4_1)>=5))"))))
Formula 0 simplified : !(F(G"((((((Idle_5+Idle_4)+Idle_3)+Idle_2)+Idle_1)+Idle_0)>=6)" U "((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((IsEndLoop_0_0_0+IsEndLoop_1_0_0)+IsEndLoop_2_0_0)+IsEndLoop_3_0_0)+IsEndLoop_4_0_0)+IsEndLoop_5_0_0)+IsEndLoop_0_1_0)+IsEndLoop_1_1_0)+IsEndLoop_2_1_0)+IsEndLoop_3_1_0)+IsEndLoop_4_1_0)+IsEndLoop_5_1_0)+IsEndLoop_0_2_0)+IsEndLoop_2_2_0)+IsEndLoop_1_2_0)+IsEndLoop_4_2_0)+IsEndLoop_3_2_0)+IsEndLoop_0_3_0)+IsEndLoop_5_2_0)+IsEndLoop_2_3_0)+IsEndLoop_1_3_0)+IsEndLoop_4_3_0)+IsEndLoop_3_3_0)+IsEndLoop_0_4_0)+IsEndLoop_5_3_0)+IsEndLoop_2_4_0)+IsEndLoop_1_4_0)+IsEndLoop_4_4_0)+IsEndLoop_3_4_0)+IsEndLoop_1_0_1)+IsEndLoop_2_0_1)+IsEndLoop_5_4_0)+IsEndLoop_0_0_1)+IsEndLoop_5_0_1)+IsEndLoop_0_1_1)+IsEndLoop_3_0_1)+IsEndLoop_4_0_1)+IsEndLoop_3_1_1)+IsEndLoop_4_1_1)+IsEndLoop_1_1_1)+IsEndLoop_2_1_1)+IsEndLoop_1_2_1)+IsEndLoop_2_2_1)+IsEndLoop_5_1_1)+IsEndLoop_0_2_1)+IsEndLoop_0_3_1)+IsEndLoop_5_2_1)+IsEndLoop_4_2_1)+IsEndLoop_3_2_1)+IsEndLoop_4_3_1)+IsEndLoop_3_3_1)+IsEndLoop_2_3_1)+IsEndLoop_1_3_1)+IsEndLoop_2_4_1)+IsEndLoop_1_4_1)+IsEndLoop_0_4_1)+IsEndLoop_5_3_1)+IsEndLoop_0_0_2)+IsEndLoop_5_4_1)+IsEndLoop_4_4_1)+IsEndLoop_3_4_1)+IsEndLoop_5_0_2)+IsEndLoop_0_1_2)+IsEndLoop_1_1_2)+IsEndLoop_2_1_2)+IsEndLoop_1_0_2)+IsEndLoop_2_0_2)+IsEndLoop_3_0_2)+IsEndLoop_4_0_2)+IsEndLoop_1_2_2)+IsEndLoop_2_2_2)+IsEndLoop_3_2_2)+IsEndLoop_4_2_2)+IsEndLoop_3_1_2)+IsEndLoop_4_1_2)+IsEndLoop_5_1_2)+IsEndLoop_0_2_2)+IsEndLoop_4_3_2)+IsEndLoop_3_3_2)+IsEndLoop_0_4_2)+IsEndLoop_5_3_2)+IsEndLoop_0_3_2)+IsEndLoop_5_2_2)+IsEndLoop_2_3_2)+IsEndLoop_1_3_2)+IsEndLoop_0_0_3)+IsEndLoop_5_4_2)+IsEndLoop_2_0_3)+IsEndLoop_1_0_3)+IsEndLoop_2_4_2)+IsEndLoop_1_4_2)+IsEndLoop_4_4_2)+IsEndLoop_3_4_2)+IsEndLoop_3_1_3)+IsEndLoop_4_1_3)+IsEndLoop_1_1_3)+IsEndLoop_2_1_3)+IsEndLoop_5_0_3)+IsEndLoop_0_1_3)+IsEndLoop_3_0_3)+IsEndLoop_4_0_3)+IsEndLoop_5_2_3)+IsEndLoop_0_3_3)+IsEndLoop_3_2_3)+IsEndLoop_4_2_3)+IsEndLoop_1_2_3)+IsEndLoop_2_2_3)+IsEndLoop_5_1_3)+IsEndLoop_0_2_3)+IsEndLoop_2_4_3)+IsEndLoop_1_4_3)+IsEndLoop_0_4_3)+IsEndLoop_5_3_3)+IsEndLoop_4_3_3)+IsEndLoop_3_3_3)+IsEndLoop_2_3_3)+IsEndLoop_1_3_3)+IsEndLoop_4_0_4)+IsEndLoop_3_0_4)+IsEndLoop_2_0_4)+IsEndLoop_1_0_4)+IsEndLoop_0_0_4)+IsEndLoop_5_4_3)+IsEndLoop_4_4_3)+IsEndLoop_3_4_3)+IsEndLoop_2_2_4)+IsEndLoop_1_2_4)+IsEndLoop_4_2_4)+IsEndLoop_3_2_4)+IsEndLoop_0_3_4)+IsEndLoop_5_2_4)+IsEndLoop_2_3_4)+IsEndLoop_1_3_4)+IsEndLoop_0_1_4)+IsEndLoop_5_0_4)+IsEndLoop_2_1_4)+IsEndLoop_1_1_4)+IsEndLoop_4_1_4)+IsEndLoop_3_1_4)+IsEndLoop_0_2_4)+IsEndLoop_5_1_4)+IsEndLoop_5_4_4)+IsEndLoop_0_0_5)+IsEndLoop_1_0_5)+IsEndLoop_2_0_5)+IsEndLoop_3_0_5)+IsEndLoop_4_0_5)+IsEndLoop_5_0_5)+IsEndLoop_0_1_5)+IsEndLoop_3_3_4)+IsEndLoop_4_3_4)+IsEndLoop_5_3_4)+IsEndLoop_0_4_4)+IsEndLoop_1_4_4)+IsEndLoop_2_4_4)+IsEndLoop_3_4_4)+IsEndLoop_4_4_4)+IsEndLoop_0_3_5)+IsEndLoop_5_2_5)+IsEndLoop_4_2_5)+IsEndLoop_3_2_5)+IsEndLoop_4_3_5)+IsEndLoop_3_3_5)+IsEndLoop_2_3_5)+IsEndLoop_1_3_5)+IsEndLoop_4_1_5)+IsEndLoop_3_1_5)+IsEndLoop_2_1_5)+IsEndLoop_1_1_5)+IsEndLoop_2_2_5)+IsEndLoop_1_2_5)+IsEndLoop_0_2_5)+IsEndLoop_5_1_5)+IsEndLoop_1_4_5)+IsEndLoop_2_4_5)+IsEndLoop_5_3_5)+IsEndLoop_0_4_5)+IsEndLoop_5_4_5)+IsEndLoop_3_4_5)+IsEndLoop_4_4_5)<=5)") & G"(((((((Idle_5+Idle_4)+Idle_3)+Idle_2)+Idle_1)+Idle_0)>=6)||((((((((((((((((((((((((((((((AskForSection_2_3+AskForSection_1_3)+AskForSection_4_3)+AskForSection_3_3)+AskForSection_4_2)+AskForSection_3_2)+AskForSection_0_3)+AskForSection_5_2)+AskForSection_4_4)+AskForSection_3_4)+AskForSection_5_4)+AskForSection_0_4)+AskForSection_5_3)+AskForSection_2_4)+AskForSection_1_4)+AskForSection_3_0)+AskForSection_4_0)+AskForSection_5_0)+AskForSection_0_1)+AskForSection_0_0)+AskForSection_1_0)+AskForSection_2_0)+AskForSection_5_1)+AskForSection_0_2)+AskForSection_1_2)+AskForSection_2_2)+AskForSection_1_1)+AskForSection_2_1)+AskForSection_3_1)+AskForSection_4_1)>=5))")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-5, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961258100729"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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