Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205700869.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-040B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205700869
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 166K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 12:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 18:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 18:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 762K May 5 16:52 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 ShieldPPPt-PT-040B-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-040B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1622927247523

Running Version 0
[2021-06-05 21:07:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-06-05 21:07:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-05 21:07:29] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2021-06-05 21:07:29] [INFO ] Transformed 3123 places.
[2021-06-05 21:07:29] [INFO ] Transformed 2843 transitions.
[2021-06-05 21:07:29] [INFO ] Found NUPN structural information;
[2021-06-05 21:07:29] [INFO ] Parsed PT model containing 3123 places and 2843 transitions in 443 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Support contains 684 out of 3123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Discarding 317 places :
Symmetric choice reduction at 0 with 317 rule applications. Total rules 317 place count 2806 transition count 2526
Iterating global reduction 0 with 317 rules applied. Total rules applied 634 place count 2806 transition count 2526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 635 place count 2805 transition count 2525
Iterating global reduction 0 with 1 rules applied. Total rules applied 636 place count 2805 transition count 2525
Applied a total of 636 rules in 695 ms. Remains 2805 /3123 variables (removed 318) and now considering 2525/2843 (removed 318) transitions.
// Phase 1: matrix 2525 rows 2805 cols
[2021-06-05 21:07:30] [INFO ] Computed 441 place invariants in 43 ms
[2021-06-05 21:07:31] [INFO ] Implicit Places using invariants in 1008 ms returned []
// Phase 1: matrix 2525 rows 2805 cols
[2021-06-05 21:07:31] [INFO ] Computed 441 place invariants in 15 ms
[2021-06-05 21:07:33] [INFO ] Implicit Places using invariants and state equation in 2311 ms returned []
Implicit Place search using SMT with State Equation took 3344 ms to find 0 implicit places.
// Phase 1: matrix 2525 rows 2805 cols
[2021-06-05 21:07:33] [INFO ] Computed 441 place invariants in 15 ms
[2021-06-05 21:07:35] [INFO ] Dead Transitions using invariants and state equation in 1646 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2805/3123 places, 2525/2843 transitions.
[2021-06-05 21:07:35] [INFO ] Flatten gal took : 172 ms
[2021-06-05 21:07:36] [INFO ] Flatten gal took : 112 ms
[2021-06-05 21:07:36] [INFO ] Input system was already deterministic with 2525 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1038 ms. (steps per millisecond=96 ) properties (out of 89) seen :79
Running SMT prover for 10 properties.
// Phase 1: matrix 2525 rows 2805 cols
[2021-06-05 21:07:37] [INFO ] Computed 441 place invariants in 17 ms
[2021-06-05 21:07:37] [INFO ] [Real]Absence check using 441 positive place invariants in 172 ms returned sat
[2021-06-05 21:07:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:07:39] [INFO ] [Real]Absence check using state equation in 1327 ms returned sat
[2021-06-05 21:07:39] [INFO ] Deduced a trap composed of 20 places in 629 ms of which 22 ms to minimize.
[2021-06-05 21:07:40] [INFO ] Deduced a trap composed of 18 places in 589 ms of which 12 ms to minimize.
[2021-06-05 21:07:41] [INFO ] Deduced a trap composed of 35 places in 568 ms of which 3 ms to minimize.
[2021-06-05 21:07:41] [INFO ] Deduced a trap composed of 20 places in 524 ms of which 3 ms to minimize.
[2021-06-05 21:07:42] [INFO ] Deduced a trap composed of 19 places in 568 ms of which 1 ms to minimize.
[2021-06-05 21:07:43] [INFO ] Deduced a trap composed of 25 places in 586 ms of which 1 ms to minimize.
[2021-06-05 21:07:43] [INFO ] Deduced a trap composed of 21 places in 526 ms of which 2 ms to minimize.
[2021-06-05 21:07:44] [INFO ] Deduced a trap composed of 22 places in 514 ms of which 2 ms to minimize.
[2021-06-05 21:07:45] [INFO ] Deduced a trap composed of 26 places in 506 ms of which 1 ms to minimize.
[2021-06-05 21:07:45] [INFO ] Deduced a trap composed of 33 places in 517 ms of which 1 ms to minimize.
[2021-06-05 21:07:46] [INFO ] Deduced a trap composed of 28 places in 494 ms of which 2 ms to minimize.
[2021-06-05 21:07:46] [INFO ] Deduced a trap composed of 33 places in 472 ms of which 1 ms to minimize.
[2021-06-05 21:07:47] [INFO ] Deduced a trap composed of 33 places in 467 ms of which 1 ms to minimize.
[2021-06-05 21:07:48] [INFO ] Deduced a trap composed of 46 places in 471 ms of which 2 ms to minimize.
[2021-06-05 21:07:48] [INFO ] Deduced a trap composed of 49 places in 437 ms of which 1 ms to minimize.
[2021-06-05 21:07:49] [INFO ] Deduced a trap composed of 43 places in 443 ms of which 1 ms to minimize.
[2021-06-05 21:07:49] [INFO ] Deduced a trap composed of 55 places in 443 ms of which 1 ms to minimize.
[2021-06-05 21:07:50] [INFO ] Deduced a trap composed of 23 places in 421 ms of which 1 ms to minimize.
[2021-06-05 21:07:50] [INFO ] Deduced a trap composed of 59 places in 587 ms of which 1 ms to minimize.
[2021-06-05 21:07:51] [INFO ] Deduced a trap composed of 19 places in 423 ms of which 2 ms to minimize.
[2021-06-05 21:07:51] [INFO ] Deduced a trap composed of 29 places in 405 ms of which 1 ms to minimize.
[2021-06-05 21:07:52] [INFO ] Deduced a trap composed of 31 places in 383 ms of which 2 ms to minimize.
[2021-06-05 21:07:52] [INFO ] Deduced a trap composed of 32 places in 378 ms of which 1 ms to minimize.
[2021-06-05 21:07:53] [INFO ] Deduced a trap composed of 31 places in 374 ms of which 1 ms to minimize.
[2021-06-05 21:07:53] [INFO ] Deduced a trap composed of 36 places in 379 ms of which 1 ms to minimize.
[2021-06-05 21:07:54] [INFO ] Deduced a trap composed of 38 places in 354 ms of which 1 ms to minimize.
[2021-06-05 21:07:54] [INFO ] Deduced a trap composed of 40 places in 348 ms of which 1 ms to minimize.
[2021-06-05 21:07:55] [INFO ] Deduced a trap composed of 41 places in 358 ms of which 1 ms to minimize.
[2021-06-05 21:07:55] [INFO ] Deduced a trap composed of 36 places in 353 ms of which 1 ms to minimize.
[2021-06-05 21:07:56] [INFO ] Deduced a trap composed of 38 places in 346 ms of which 1 ms to minimize.
[2021-06-05 21:07:56] [INFO ] Deduced a trap composed of 37 places in 339 ms of which 0 ms to minimize.
[2021-06-05 21:07:56] [INFO ] Deduced a trap composed of 32 places in 330 ms of which 1 ms to minimize.
[2021-06-05 21:07:57] [INFO ] Deduced a trap composed of 31 places in 328 ms of which 1 ms to minimize.
[2021-06-05 21:07:57] [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 close... while checking expression at index 0
[2021-06-05 21:07:57] [INFO ] [Real]Absence check using 441 positive place invariants in 148 ms returned sat
[2021-06-05 21:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:07:58] [INFO ] [Real]Absence check using state equation in 1126 ms returned sat
[2021-06-05 21:07:59] [INFO ] Deduced a trap composed of 24 places in 648 ms of which 10 ms to minimize.
[2021-06-05 21:08:00] [INFO ] Deduced a trap composed of 21 places in 637 ms of which 6 ms to minimize.
[2021-06-05 21:08:01] [INFO ] Deduced a trap composed of 23 places in 647 ms of which 9 ms to minimize.
[2021-06-05 21:08:01] [INFO ] Deduced a trap composed of 19 places in 605 ms of which 2 ms to minimize.
[2021-06-05 21:08:02] [INFO ] Deduced a trap composed of 21 places in 592 ms of which 1 ms to minimize.
[2021-06-05 21:08:03] [INFO ] Deduced a trap composed of 31 places in 581 ms of which 2 ms to minimize.
[2021-06-05 21:08:03] [INFO ] Deduced a trap composed of 16 places in 599 ms of which 4 ms to minimize.
[2021-06-05 21:08:04] [INFO ] Deduced a trap composed of 18 places in 612 ms of which 1 ms to minimize.
[2021-06-05 21:08:05] [INFO ] Deduced a trap composed of 29 places in 586 ms of which 2 ms to minimize.
[2021-06-05 21:08:06] [INFO ] Deduced a trap composed of 34 places in 585 ms of which 1 ms to minimize.
[2021-06-05 21:08:06] [INFO ] Deduced a trap composed of 21 places in 581 ms of which 2 ms to minimize.
[2021-06-05 21:08:07] [INFO ] Deduced a trap composed of 25 places in 579 ms of which 2 ms to minimize.
[2021-06-05 21:08:08] [INFO ] Deduced a trap composed of 27 places in 563 ms of which 1 ms to minimize.
[2021-06-05 21:08:08] [INFO ] Deduced a trap composed of 32 places in 552 ms of which 2 ms to minimize.
[2021-06-05 21:08:09] [INFO ] Deduced a trap composed of 19 places in 552 ms of which 1 ms to minimize.
[2021-06-05 21:08:10] [INFO ] Deduced a trap composed of 24 places in 544 ms of which 2 ms to minimize.
[2021-06-05 21:08:10] [INFO ] Deduced a trap composed of 34 places in 536 ms of which 1 ms to minimize.
[2021-06-05 21:08:11] [INFO ] Deduced a trap composed of 32 places in 518 ms of which 3 ms to minimize.
[2021-06-05 21:08:11] [INFO ] Deduced a trap composed of 42 places in 521 ms of which 2 ms to minimize.
[2021-06-05 21:08:12] [INFO ] Deduced a trap composed of 31 places in 533 ms of which 1 ms to minimize.
[2021-06-05 21:08:13] [INFO ] Deduced a trap composed of 41 places in 501 ms of which 1 ms to minimize.
[2021-06-05 21:08:13] [INFO ] Deduced a trap composed of 36 places in 514 ms of which 1 ms to minimize.
[2021-06-05 21:08:14] [INFO ] Deduced a trap composed of 39 places in 506 ms of which 1 ms to minimize.
[2021-06-05 21:08:14] [INFO ] Deduced a trap composed of 43 places in 493 ms of which 2 ms to minimize.
[2021-06-05 21:08:15] [INFO ] Deduced a trap composed of 39 places in 497 ms of which 1 ms to minimize.
[2021-06-05 21:08:16] [INFO ] Deduced a trap composed of 31 places in 489 ms of which 2 ms to minimize.
[2021-06-05 21:08:16] [INFO ] Deduced a trap composed of 40 places in 473 ms of which 2 ms to minimize.
[2021-06-05 21:08:17] [INFO ] Deduced a trap composed of 40 places in 465 ms of which 2 ms to minimize.
[2021-06-05 21:08:17] [INFO ] Deduced a trap composed of 32 places in 438 ms of which 2 ms to minimize.
[2021-06-05 21:08: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 close... while checking expression at index 1
[2021-06-05 21:08:18] [INFO ] [Real]Absence check using 441 positive place invariants in 173 ms returned sat
[2021-06-05 21:08:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:20] [INFO ] [Real]Absence check using state equation in 2014 ms returned sat
[2021-06-05 21:08:20] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:08:20] [INFO ] [Nat]Absence check using 441 positive place invariants in 193 ms returned sat
[2021-06-05 21:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:22] [INFO ] [Nat]Absence check using state equation in 2033 ms returned sat
[2021-06-05 21:08:23] [INFO ] Deduced a trap composed of 20 places in 613 ms of which 1 ms to minimize.
[2021-06-05 21:08:24] [INFO ] Deduced a trap composed of 29 places in 515 ms of which 1 ms to minimize.
[2021-06-05 21:08:24] [INFO ] Deduced a trap composed of 21 places in 526 ms of which 1 ms to minimize.
[2021-06-05 21:08:25] [INFO ] Deduced a trap composed of 19 places in 519 ms of which 1 ms to minimize.
[2021-06-05 21:08:26] [INFO ] Deduced a trap composed of 21 places in 507 ms of which 1 ms to minimize.
[2021-06-05 21:08:26] [INFO ] Deduced a trap composed of 23 places in 503 ms of which 1 ms to minimize.
[2021-06-05 21:08:27] [INFO ] Deduced a trap composed of 33 places in 486 ms of which 1 ms to minimize.
[2021-06-05 21:08:27] [INFO ] Deduced a trap composed of 26 places in 483 ms of which 2 ms to minimize.
[2021-06-05 21:08:28] [INFO ] Deduced a trap composed of 31 places in 470 ms of which 1 ms to minimize.
[2021-06-05 21:08:28] [INFO ] Deduced a trap composed of 29 places in 506 ms of which 1 ms to minimize.
[2021-06-05 21:08:29] [INFO ] Deduced a trap composed of 18 places in 486 ms of which 1 ms to minimize.
[2021-06-05 21:08:30] [INFO ] Deduced a trap composed of 35 places in 445 ms of which 1 ms to minimize.
[2021-06-05 21:08:30] [INFO ] Deduced a trap composed of 32 places in 433 ms of which 2 ms to minimize.
[2021-06-05 21:08:31] [INFO ] Deduced a trap composed of 23 places in 453 ms of which 2 ms to minimize.
[2021-06-05 21:08:31] [INFO ] Deduced a trap composed of 24 places in 431 ms of which 1 ms to minimize.
[2021-06-05 21:08:32] [INFO ] Deduced a trap composed of 21 places in 416 ms of which 1 ms to minimize.
[2021-06-05 21:08:32] [INFO ] Deduced a trap composed of 32 places in 464 ms of which 2 ms to minimize.
[2021-06-05 21:08:33] [INFO ] Deduced a trap composed of 27 places in 420 ms of which 1 ms to minimize.
[2021-06-05 21:08:33] [INFO ] Deduced a trap composed of 29 places in 407 ms of which 1 ms to minimize.
[2021-06-05 21:08:34] [INFO ] Deduced a trap composed of 33 places in 383 ms of which 1 ms to minimize.
[2021-06-05 21:08:34] [INFO ] Deduced a trap composed of 31 places in 383 ms of which 2 ms to minimize.
[2021-06-05 21:08:35] [INFO ] Deduced a trap composed of 32 places in 371 ms of which 1 ms to minimize.
[2021-06-05 21:08:35] [INFO ] Deduced a trap composed of 39 places in 362 ms of which 1 ms to minimize.
[2021-06-05 21:08:36] [INFO ] Deduced a trap composed of 25 places in 350 ms of which 1 ms to minimize.
[2021-06-05 21:08:36] [INFO ] Deduced a trap composed of 35 places in 384 ms of which 1 ms to minimize.
[2021-06-05 21:08:36] [INFO ] Deduced a trap composed of 32 places in 342 ms of which 1 ms to minimize.
[2021-06-05 21:08:37] [INFO ] Deduced a trap composed of 32 places in 334 ms of which 1 ms to minimize.
[2021-06-05 21:08:37] [INFO ] Deduced a trap composed of 33 places in 353 ms of which 1 ms to minimize.
[2021-06-05 21:08:38] [INFO ] Deduced a trap composed of 27 places in 352 ms of which 1 ms to minimize.
[2021-06-05 21:08:38] [INFO ] Deduced a trap composed of 19 places in 320 ms of which 0 ms to minimize.
[2021-06-05 21:08:39] [INFO ] Deduced a trap composed of 43 places in 301 ms of which 1 ms to minimize.
[2021-06-05 21:08:39] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 1 ms to minimize.
[2021-06-05 21:08:39] [INFO ] Deduced a trap composed of 31 places in 329 ms of which 1 ms to minimize.
[2021-06-05 21:08:40] [INFO ] Deduced a trap composed of 47 places in 284 ms of which 1 ms to minimize.
[2021-06-05 21:08:40] [INFO ] Deduced a trap composed of 35 places in 291 ms of which 1 ms to minimize.
[2021-06-05 21:08:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-06-05 21:08:41] [INFO ] [Real]Absence check using 441 positive place invariants in 169 ms returned sat
[2021-06-05 21:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:42] [INFO ] [Real]Absence check using state equation in 1249 ms returned sat
[2021-06-05 21:08:43] [INFO ] Deduced a trap composed of 29 places in 543 ms of which 2 ms to minimize.
[2021-06-05 21:08:43] [INFO ] Deduced a trap composed of 23 places in 547 ms of which 2 ms to minimize.
[2021-06-05 21:08:44] [INFO ] Deduced a trap composed of 20 places in 568 ms of which 2 ms to minimize.
[2021-06-05 21:08:44] [INFO ] Deduced a trap composed of 18 places in 578 ms of which 1 ms to minimize.
[2021-06-05 21:08:45] [INFO ] Deduced a trap composed of 23 places in 552 ms of which 1 ms to minimize.
[2021-06-05 21:08:46] [INFO ] Deduced a trap composed of 19 places in 550 ms of which 2 ms to minimize.
[2021-06-05 21:08:46] [INFO ] Deduced a trap composed of 19 places in 534 ms of which 2 ms to minimize.
[2021-06-05 21:08:47] [INFO ] Deduced a trap composed of 22 places in 517 ms of which 1 ms to minimize.
[2021-06-05 21:08:48] [INFO ] Deduced a trap composed of 24 places in 508 ms of which 1 ms to minimize.
[2021-06-05 21:08:48] [INFO ] Deduced a trap composed of 26 places in 534 ms of which 1 ms to minimize.
[2021-06-05 21:08:49] [INFO ] Deduced a trap composed of 20 places in 506 ms of which 1 ms to minimize.
[2021-06-05 21:08:49] [INFO ] Deduced a trap composed of 30 places in 488 ms of which 2 ms to minimize.
[2021-06-05 21:08:50] [INFO ] Deduced a trap composed of 33 places in 485 ms of which 1 ms to minimize.
[2021-06-05 21:08:51] [INFO ] Deduced a trap composed of 31 places in 431 ms of which 1 ms to minimize.
[2021-06-05 21:08:51] [INFO ] Deduced a trap composed of 20 places in 453 ms of which 2 ms to minimize.
[2021-06-05 21:08:52] [INFO ] Deduced a trap composed of 20 places in 466 ms of which 1 ms to minimize.
[2021-06-05 21:08:52] [INFO ] Deduced a trap composed of 33 places in 443 ms of which 2 ms to minimize.
[2021-06-05 21:08:53] [INFO ] Deduced a trap composed of 25 places in 414 ms of which 1 ms to minimize.
[2021-06-05 21:08:53] [INFO ] Deduced a trap composed of 28 places in 392 ms of which 1 ms to minimize.
[2021-06-05 21:08:54] [INFO ] Deduced a trap composed of 37 places in 371 ms of which 2 ms to minimize.
[2021-06-05 21:08:54] [INFO ] Deduced a trap composed of 34 places in 386 ms of which 1 ms to minimize.
[2021-06-05 21:08:55] [INFO ] Deduced a trap composed of 22 places in 389 ms of which 1 ms to minimize.
[2021-06-05 21:08:55] [INFO ] Deduced a trap composed of 31 places in 370 ms of which 1 ms to minimize.
[2021-06-05 21:08:56] [INFO ] Deduced a trap composed of 35 places in 366 ms of which 1 ms to minimize.
[2021-06-05 21:08:56] [INFO ] Deduced a trap composed of 26 places in 362 ms of which 1 ms to minimize.
[2021-06-05 21:08:56] [INFO ] Deduced a trap composed of 49 places in 329 ms of which 0 ms to minimize.
[2021-06-05 21:08:57] [INFO ] Deduced a trap composed of 48 places in 326 ms of which 1 ms to minimize.
[2021-06-05 21:08:57] [INFO ] Deduced a trap composed of 48 places in 332 ms of which 2 ms to minimize.
[2021-06-05 21:08:58] [INFO ] Deduced a trap composed of 41 places in 328 ms of which 1 ms to minimize.
[2021-06-05 21:08:58] [INFO ] Deduced a trap composed of 42 places in 338 ms of which 1 ms to minimize.
[2021-06-05 21:08:59] [INFO ] Deduced a trap composed of 40 places in 329 ms of which 1 ms to minimize.
[2021-06-05 21:08:59] [INFO ] Deduced a trap composed of 44 places in 323 ms of which 1 ms to minimize.
[2021-06-05 21:08:59] [INFO ] Deduced a trap composed of 39 places in 324 ms of which 1 ms to minimize.
[2021-06-05 21:09:00] [INFO ] Deduced a trap composed of 49 places in 287 ms of which 1 ms to minimize.
[2021-06-05 21:09:00] [INFO ] Deduced a trap composed of 44 places in 310 ms of which 1 ms to minimize.
[2021-06-05 21:09:00] [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 close... while checking expression at index 3
[2021-06-05 21:09:01] [INFO ] [Real]Absence check using 441 positive place invariants in 171 ms returned sat
[2021-06-05 21:09:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:09:02] [INFO ] [Real]Absence check using state equation in 1146 ms returned sat
[2021-06-05 21:09:03] [INFO ] Deduced a trap composed of 20 places in 643 ms of which 2 ms to minimize.
[2021-06-05 21:09:03] [INFO ] Deduced a trap composed of 20 places in 661 ms of which 1 ms to minimize.
[2021-06-05 21:09:04] [INFO ] Deduced a trap composed of 18 places in 636 ms of which 1 ms to minimize.
[2021-06-05 21:09:05] [INFO ] Deduced a trap composed of 17 places in 642 ms of which 1 ms to minimize.
[2021-06-05 21:09:06] [INFO ] Deduced a trap composed of 31 places in 629 ms of which 1 ms to minimize.
[2021-06-05 21:09:06] [INFO ] Deduced a trap composed of 25 places in 604 ms of which 2 ms to minimize.
[2021-06-05 21:09:07] [INFO ] Deduced a trap composed of 19 places in 591 ms of which 2 ms to minimize.
[2021-06-05 21:09:08] [INFO ] Deduced a trap composed of 28 places in 609 ms of which 1 ms to minimize.
[2021-06-05 21:09:08] [INFO ] Deduced a trap composed of 21 places in 591 ms of which 2 ms to minimize.
[2021-06-05 21:09:09] [INFO ] Deduced a trap composed of 24 places in 592 ms of which 1 ms to minimize.
[2021-06-05 21:09:10] [INFO ] Deduced a trap composed of 21 places in 585 ms of which 1 ms to minimize.
[2021-06-05 21:09:10] [INFO ] Deduced a trap composed of 24 places in 582 ms of which 2 ms to minimize.
[2021-06-05 21:09:11] [INFO ] Deduced a trap composed of 27 places in 560 ms of which 2 ms to minimize.
[2021-06-05 21:09:12] [INFO ] Deduced a trap composed of 25 places in 546 ms of which 2 ms to minimize.
[2021-06-05 21:09:12] [INFO ] Deduced a trap composed of 25 places in 539 ms of which 1 ms to minimize.
[2021-06-05 21:09:13] [INFO ] Deduced a trap composed of 22 places in 553 ms of which 1 ms to minimize.
[2021-06-05 21:09:14] [INFO ] Deduced a trap composed of 33 places in 555 ms of which 1 ms to minimize.
[2021-06-05 21:09:14] [INFO ] Deduced a trap composed of 23 places in 543 ms of which 1 ms to minimize.
[2021-06-05 21:09:15] [INFO ] Deduced a trap composed of 36 places in 518 ms of which 1 ms to minimize.
[2021-06-05 21:09:16] [INFO ] Deduced a trap composed of 31 places in 526 ms of which 1 ms to minimize.
[2021-06-05 21:09:16] [INFO ] Deduced a trap composed of 23 places in 493 ms of which 1 ms to minimize.
[2021-06-05 21:09:17] [INFO ] Deduced a trap composed of 37 places in 463 ms of which 1 ms to minimize.
[2021-06-05 21:09:17] [INFO ] Deduced a trap composed of 33 places in 469 ms of which 1 ms to minimize.
[2021-06-05 21:09:18] [INFO ] Deduced a trap composed of 29 places in 454 ms of which 2 ms to minimize.
[2021-06-05 21:09:18] [INFO ] Deduced a trap composed of 31 places in 450 ms of which 1 ms to minimize.
[2021-06-05 21:09:19] [INFO ] Deduced a trap composed of 29 places in 442 ms of which 2 ms to minimize.
[2021-06-05 21:09:20] [INFO ] Deduced a trap composed of 39 places in 457 ms of which 1 ms to minimize.
[2021-06-05 21:09:20] [INFO ] Deduced a trap composed of 32 places in 437 ms of which 1 ms to minimize.
[2021-06-05 21:09:21] [INFO ] Deduced a trap composed of 34 places in 413 ms of which 2 ms to minimize.
[2021-06-05 21:09: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 close... while checking expression at index 4
[2021-06-05 21:09:21] [INFO ] [Real]Absence check using 441 positive place invariants in 162 ms returned sat
[2021-06-05 21:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:09:22] [INFO ] [Real]Absence check using state equation in 1359 ms returned sat
[2021-06-05 21:09:23] [INFO ] Deduced a trap composed of 20 places in 637 ms of which 2 ms to minimize.
[2021-06-05 21:09:24] [INFO ] Deduced a trap composed of 21 places in 638 ms of which 2 ms to minimize.
[2021-06-05 21:09:25] [INFO ] Deduced a trap composed of 23 places in 643 ms of which 2 ms to minimize.
[2021-06-05 21:09:25] [INFO ] Deduced a trap composed of 18 places in 621 ms of which 2 ms to minimize.
[2021-06-05 21:09:26] [INFO ] Deduced a trap composed of 20 places in 612 ms of which 1 ms to minimize.
[2021-06-05 21:09:27] [INFO ] Deduced a trap composed of 18 places in 602 ms of which 1 ms to minimize.
[2021-06-05 21:09:27] [INFO ] Deduced a trap composed of 31 places in 614 ms of which 1 ms to minimize.
[2021-06-05 21:09:28] [INFO ] Deduced a trap composed of 21 places in 584 ms of which 2 ms to minimize.
[2021-06-05 21:09:29] [INFO ] Deduced a trap composed of 32 places in 582 ms of which 2 ms to minimize.
[2021-06-05 21:09:30] [INFO ] Deduced a trap composed of 24 places in 601 ms of which 2 ms to minimize.
[2021-06-05 21:09:30] [INFO ] Deduced a trap composed of 32 places in 574 ms of which 1 ms to minimize.
[2021-06-05 21:09:31] [INFO ] Deduced a trap composed of 22 places in 552 ms of which 1 ms to minimize.
[2021-06-05 21:09:31] [INFO ] Deduced a trap composed of 39 places in 540 ms of which 2 ms to minimize.
[2021-06-05 21:09:32] [INFO ] Deduced a trap composed of 29 places in 535 ms of which 1 ms to minimize.
[2021-06-05 21:09:33] [INFO ] Deduced a trap composed of 43 places in 509 ms of which 2 ms to minimize.
[2021-06-05 21:09:33] [INFO ] Deduced a trap composed of 29 places in 525 ms of which 2 ms to minimize.
[2021-06-05 21:09:34] [INFO ] Deduced a trap composed of 26 places in 547 ms of which 1 ms to minimize.
[2021-06-05 21:09:35] [INFO ] Deduced a trap composed of 32 places in 511 ms of which 2 ms to minimize.
[2021-06-05 21:09:35] [INFO ] Deduced a trap composed of 32 places in 524 ms of which 1 ms to minimize.
[2021-06-05 21:09:36] [INFO ] Deduced a trap composed of 22 places in 495 ms of which 2 ms to minimize.
[2021-06-05 21:09:36] [INFO ] Deduced a trap composed of 31 places in 489 ms of which 2 ms to minimize.
[2021-06-05 21:09:37] [INFO ] Deduced a trap composed of 34 places in 479 ms of which 2 ms to minimize.
[2021-06-05 21:09:38] [INFO ] Deduced a trap composed of 26 places in 486 ms of which 1 ms to minimize.
[2021-06-05 21:09:38] [INFO ] Deduced a trap composed of 30 places in 508 ms of which 1 ms to minimize.
[2021-06-05 21:09:39] [INFO ] Deduced a trap composed of 31 places in 463 ms of which 1 ms to minimize.
[2021-06-05 21:09:39] [INFO ] Deduced a trap composed of 35 places in 459 ms of which 1 ms to minimize.
[2021-06-05 21:09:40] [INFO ] Deduced a trap composed of 25 places in 447 ms of which 1 ms to minimize.
[2021-06-05 21:09:40] [INFO ] Deduced a trap composed of 20 places in 445 ms of which 2 ms to minimize.
[2021-06-05 21:09:41] [INFO ] Deduced a trap composed of 47 places in 432 ms of which 2 ms to minimize.
[2021-06-05 21:09:41] [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 close... while checking expression at index 5
[2021-06-05 21:09:41] [INFO ] [Real]Absence check using 441 positive place invariants in 170 ms returned sat
[2021-06-05 21:09:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:09:43] [INFO ] [Real]Absence check using state equation in 1379 ms returned sat
[2021-06-05 21:09:43] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:09:43] [INFO ] [Nat]Absence check using 441 positive place invariants in 163 ms returned sat
[2021-06-05 21:09:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:09:45] [INFO ] [Nat]Absence check using state equation in 1373 ms returned sat
[2021-06-05 21:09:45] [INFO ] Deduced a trap composed of 23 places in 529 ms of which 1 ms to minimize.
[2021-06-05 21:09:46] [INFO ] Deduced a trap composed of 18 places in 532 ms of which 1 ms to minimize.
[2021-06-05 21:09:47] [INFO ] Deduced a trap composed of 18 places in 525 ms of which 2 ms to minimize.
[2021-06-05 21:09:47] [INFO ] Deduced a trap composed of 20 places in 496 ms of which 2 ms to minimize.
[2021-06-05 21:09:48] [INFO ] Deduced a trap composed of 19 places in 479 ms of which 1 ms to minimize.
[2021-06-05 21:09:48] [INFO ] Deduced a trap composed of 19 places in 483 ms of which 1 ms to minimize.
[2021-06-05 21:09:49] [INFO ] Deduced a trap composed of 20 places in 462 ms of which 1 ms to minimize.
[2021-06-05 21:09:49] [INFO ] Deduced a trap composed of 36 places in 455 ms of which 2 ms to minimize.
[2021-06-05 21:09:50] [INFO ] Deduced a trap composed of 29 places in 448 ms of which 1 ms to minimize.
[2021-06-05 21:09:50] [INFO ] Deduced a trap composed of 35 places in 435 ms of which 1 ms to minimize.
[2021-06-05 21:09:51] [INFO ] Deduced a trap composed of 31 places in 432 ms of which 1 ms to minimize.
[2021-06-05 21:09:51] [INFO ] Deduced a trap composed of 20 places in 402 ms of which 1 ms to minimize.
[2021-06-05 21:09:52] [INFO ] Deduced a trap composed of 31 places in 417 ms of which 1 ms to minimize.
[2021-06-05 21:09:53] [INFO ] Deduced a trap composed of 27 places in 431 ms of which 2 ms to minimize.
[2021-06-05 21:09:53] [INFO ] Deduced a trap composed of 25 places in 403 ms of which 1 ms to minimize.
[2021-06-05 21:09:53] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 1 ms to minimize.
[2021-06-05 21:09:54] [INFO ] Deduced a trap composed of 32 places in 392 ms of which 1 ms to minimize.
[2021-06-05 21:09:54] [INFO ] Deduced a trap composed of 31 places in 362 ms of which 1 ms to minimize.
[2021-06-05 21:09:55] [INFO ] Deduced a trap composed of 30 places in 349 ms of which 1 ms to minimize.
[2021-06-05 21:09:55] [INFO ] Deduced a trap composed of 25 places in 343 ms of which 1 ms to minimize.
[2021-06-05 21:09:56] [INFO ] Deduced a trap composed of 35 places in 348 ms of which 1 ms to minimize.
[2021-06-05 21:09:56] [INFO ] Deduced a trap composed of 35 places in 347 ms of which 1 ms to minimize.
[2021-06-05 21:09:57] [INFO ] Deduced a trap composed of 24 places in 335 ms of which 1 ms to minimize.
[2021-06-05 21:09:57] [INFO ] Deduced a trap composed of 34 places in 320 ms of which 1 ms to minimize.
[2021-06-05 21:09:57] [INFO ] Deduced a trap composed of 32 places in 320 ms of which 1 ms to minimize.
[2021-06-05 21:09:58] [INFO ] Deduced a trap composed of 41 places in 331 ms of which 1 ms to minimize.
[2021-06-05 21:09:58] [INFO ] Deduced a trap composed of 40 places in 310 ms of which 1 ms to minimize.
[2021-06-05 21:09:59] [INFO ] Deduced a trap composed of 51 places in 299 ms of which 1 ms to minimize.
[2021-06-05 21:09:59] [INFO ] Deduced a trap composed of 34 places in 298 ms of which 1 ms to minimize.
[2021-06-05 21:09:59] [INFO ] Deduced a trap composed of 32 places in 307 ms of which 1 ms to minimize.
[2021-06-05 21:10:00] [INFO ] Deduced a trap composed of 29 places in 293 ms of which 1 ms to minimize.
[2021-06-05 21:10:00] [INFO ] Deduced a trap composed of 32 places in 290 ms of which 1 ms to minimize.
[2021-06-05 21:10:01] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 1 ms to minimize.
[2021-06-05 21:10:01] [INFO ] Deduced a trap composed of 40 places in 281 ms of which 1 ms to minimize.
[2021-06-05 21:10:01] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 1 ms to minimize.
[2021-06-05 21:10:02] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 1 ms to minimize.
[2021-06-05 21:10:02] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 1 ms to minimize.
[2021-06-05 21:10:02] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 1 ms to minimize.
[2021-06-05 21:10:03] [INFO ] Deduced a trap composed of 39 places in 240 ms of which 0 ms to minimize.
[2021-06-05 21:10:03] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 1 ms to minimize.
[2021-06-05 21:10:03] [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 close... while checking expression at index 6
[2021-06-05 21:10:03] [INFO ] [Real]Absence check using 441 positive place invariants in 159 ms returned sat
[2021-06-05 21:10:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:10:05] [INFO ] [Real]Absence check using state equation in 1267 ms returned sat
[2021-06-05 21:10:05] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:10:05] [INFO ] [Nat]Absence check using 441 positive place invariants in 166 ms returned sat
[2021-06-05 21:10:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:10:06] [INFO ] [Nat]Absence check using state equation in 1270 ms returned sat
[2021-06-05 21:10:07] [INFO ] Deduced a trap composed of 23 places in 652 ms of which 2 ms to minimize.
[2021-06-05 21:10:08] [INFO ] Deduced a trap composed of 17 places in 638 ms of which 2 ms to minimize.
[2021-06-05 21:10:09] [INFO ] Deduced a trap composed of 31 places in 641 ms of which 2 ms to minimize.
[2021-06-05 21:10:09] [INFO ] Deduced a trap composed of 25 places in 618 ms of which 1 ms to minimize.
[2021-06-05 21:10:10] [INFO ] Deduced a trap composed of 25 places in 603 ms of which 2 ms to minimize.
[2021-06-05 21:10:11] [INFO ] Deduced a trap composed of 31 places in 593 ms of which 1 ms to minimize.
[2021-06-05 21:10:11] [INFO ] Deduced a trap composed of 21 places in 599 ms of which 2 ms to minimize.
[2021-06-05 21:10:12] [INFO ] Deduced a trap composed of 29 places in 564 ms of which 2 ms to minimize.
[2021-06-05 21:10:13] [INFO ] Deduced a trap composed of 30 places in 555 ms of which 1 ms to minimize.
[2021-06-05 21:10:13] [INFO ] Deduced a trap composed of 19 places in 550 ms of which 1 ms to minimize.
[2021-06-05 21:10:14] [INFO ] Deduced a trap composed of 19 places in 560 ms of which 2 ms to minimize.
[2021-06-05 21:10:15] [INFO ] Deduced a trap composed of 25 places in 544 ms of which 2 ms to minimize.
[2021-06-05 21:10:15] [INFO ] Deduced a trap composed of 19 places in 531 ms of which 1 ms to minimize.
[2021-06-05 21:10:16] [INFO ] Deduced a trap composed of 32 places in 517 ms of which 1 ms to minimize.
[2021-06-05 21:10:17] [INFO ] Deduced a trap composed of 28 places in 501 ms of which 2 ms to minimize.
[2021-06-05 21:10:17] [INFO ] Deduced a trap composed of 32 places in 500 ms of which 1 ms to minimize.
[2021-06-05 21:10:18] [INFO ] Deduced a trap composed of 39 places in 504 ms of which 1 ms to minimize.
[2021-06-05 21:10:18] [INFO ] Deduced a trap composed of 37 places in 523 ms of which 2 ms to minimize.
[2021-06-05 21:10:19] [INFO ] Deduced a trap composed of 32 places in 482 ms of which 3 ms to minimize.
[2021-06-05 21:10:20] [INFO ] Deduced a trap composed of 28 places in 485 ms of which 1 ms to minimize.
[2021-06-05 21:10:20] [INFO ] Deduced a trap composed of 38 places in 484 ms of which 1 ms to minimize.
[2021-06-05 21:10:21] [INFO ] Deduced a trap composed of 39 places in 451 ms of which 2 ms to minimize.
[2021-06-05 21:10:21] [INFO ] Deduced a trap composed of 25 places in 464 ms of which 1 ms to minimize.
[2021-06-05 21:10:22] [INFO ] Deduced a trap composed of 36 places in 456 ms of which 1 ms to minimize.
[2021-06-05 21:10:22] [INFO ] Deduced a trap composed of 35 places in 450 ms of which 1 ms to minimize.
[2021-06-05 21:10:23] [INFO ] Deduced a trap composed of 35 places in 445 ms of which 5 ms to minimize.
[2021-06-05 21:10:23] [INFO ] Deduced a trap composed of 39 places in 429 ms of which 1 ms to minimize.
[2021-06-05 21:10:24] [INFO ] Deduced a trap composed of 41 places in 416 ms of which 1 ms to minimize.
[2021-06-05 21:10:24] [INFO ] Deduced a trap composed of 31 places in 411 ms of which 1 ms to minimize.
[2021-06-05 21:10:25] [INFO ] Deduced a trap composed of 52 places in 408 ms of which 1 ms to minimize.
[2021-06-05 21:10:25] [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 close... while checking expression at index 7
[2021-06-05 21:10:25] [INFO ] [Real]Absence check using 441 positive place invariants in 195 ms returned sat
[2021-06-05 21:10:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:10:27] [INFO ] [Real]Absence check using state equation in 1358 ms returned sat
[2021-06-05 21:10:28] [INFO ] Deduced a trap composed of 22 places in 645 ms of which 2 ms to minimize.
[2021-06-05 21:10:28] [INFO ] Deduced a trap composed of 19 places in 612 ms of which 1 ms to minimize.
[2021-06-05 21:10:29] [INFO ] Deduced a trap composed of 25 places in 599 ms of which 2 ms to minimize.
[2021-06-05 21:10:30] [INFO ] Deduced a trap composed of 16 places in 582 ms of which 1 ms to minimize.
[2021-06-05 21:10:30] [INFO ] Deduced a trap composed of 23 places in 570 ms of which 2 ms to minimize.
[2021-06-05 21:10:31] [INFO ] Deduced a trap composed of 18 places in 575 ms of which 2 ms to minimize.
[2021-06-05 21:10:32] [INFO ] Deduced a trap composed of 28 places in 558 ms of which 1 ms to minimize.
[2021-06-05 21:10:32] [INFO ] Deduced a trap composed of 25 places in 557 ms of which 1 ms to minimize.
[2021-06-05 21:10:33] [INFO ] Deduced a trap composed of 25 places in 543 ms of which 1 ms to minimize.
[2021-06-05 21:10:34] [INFO ] Deduced a trap composed of 30 places in 573 ms of which 2 ms to minimize.
[2021-06-05 21:10:34] [INFO ] Deduced a trap composed of 31 places in 538 ms of which 1 ms to minimize.
[2021-06-05 21:10:35] [INFO ] Deduced a trap composed of 36 places in 529 ms of which 1 ms to minimize.
[2021-06-05 21:10:35] [INFO ] Deduced a trap composed of 34 places in 533 ms of which 1 ms to minimize.
[2021-06-05 21:10:36] [INFO ] Deduced a trap composed of 30 places in 517 ms of which 1 ms to minimize.
[2021-06-05 21:10:37] [INFO ] Deduced a trap composed of 23 places in 517 ms of which 2 ms to minimize.
[2021-06-05 21:10:37] [INFO ] Deduced a trap composed of 24 places in 518 ms of which 1 ms to minimize.
[2021-06-05 21:10:38] [INFO ] Deduced a trap composed of 25 places in 496 ms of which 2 ms to minimize.
[2021-06-05 21:10:39] [INFO ] Deduced a trap composed of 31 places in 513 ms of which 1 ms to minimize.
[2021-06-05 21:10:39] [INFO ] Deduced a trap composed of 40 places in 480 ms of which 1 ms to minimize.
[2021-06-05 21:10:40] [INFO ] Deduced a trap composed of 33 places in 481 ms of which 1 ms to minimize.
[2021-06-05 21:10:40] [INFO ] Deduced a trap composed of 24 places in 537 ms of which 2 ms to minimize.
[2021-06-05 21:10:41] [INFO ] Deduced a trap composed of 45 places in 450 ms of which 1 ms to minimize.
[2021-06-05 21:10:41] [INFO ] Deduced a trap composed of 48 places in 444 ms of which 1 ms to minimize.
[2021-06-05 21:10:42] [INFO ] Deduced a trap composed of 28 places in 434 ms of which 2 ms to minimize.
[2021-06-05 21:10:43] [INFO ] Deduced a trap composed of 31 places in 434 ms of which 1 ms to minimize.
[2021-06-05 21:10:43] [INFO ] Deduced a trap composed of 32 places in 429 ms of which 2 ms to minimize.
[2021-06-05 21:10:44] [INFO ] Deduced a trap composed of 31 places in 435 ms of which 1 ms to minimize.
[2021-06-05 21:10:44] [INFO ] Deduced a trap composed of 34 places in 433 ms of which 1 ms to minimize.
[2021-06-05 21:10:45] [INFO ] Deduced a trap composed of 31 places in 434 ms of which 2 ms to minimize.
[2021-06-05 21:10:45] [INFO ] Deduced a trap composed of 32 places in 402 ms of which 1 ms to minimize.
[2021-06-05 21:10:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2021-06-05 21:10:46] [INFO ] [Real]Absence check using 441 positive place invariants in 209 ms returned sat
[2021-06-05 21:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:10:50] [INFO ] [Real]Absence check using state equation in 4237 ms returned sat
[2021-06-05 21:10:50] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:10:50] [INFO ] [Nat]Absence check using 441 positive place invariants in 167 ms returned sat
[2021-06-05 21:10:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:10:52] [INFO ] [Nat]Absence check using state equation in 1861 ms returned sat
[2021-06-05 21:10:53] [INFO ] Deduced a trap composed of 20 places in 628 ms of which 1 ms to minimize.
[2021-06-05 21:10:54] [INFO ] Deduced a trap composed of 16 places in 619 ms of which 2 ms to minimize.
[2021-06-05 21:10:54] [INFO ] Deduced a trap composed of 20 places in 659 ms of which 2 ms to minimize.
[2021-06-05 21:10:55] [INFO ] Deduced a trap composed of 19 places in 611 ms of which 1 ms to minimize.
[2021-06-05 21:10:56] [INFO ] Deduced a trap composed of 18 places in 589 ms of which 2 ms to minimize.
[2021-06-05 21:10:57] [INFO ] Deduced a trap composed of 23 places in 582 ms of which 1 ms to minimize.
[2021-06-05 21:10:57] [INFO ] Deduced a trap composed of 29 places in 554 ms of which 1 ms to minimize.
[2021-06-05 21:10:58] [INFO ] Deduced a trap composed of 26 places in 541 ms of which 1 ms to minimize.
[2021-06-05 21:10:58] [INFO ] Deduced a trap composed of 29 places in 540 ms of which 1 ms to minimize.
[2021-06-05 21:10:59] [INFO ] Deduced a trap composed of 19 places in 539 ms of which 1 ms to minimize.
[2021-06-05 21:11:00] [INFO ] Deduced a trap composed of 31 places in 524 ms of which 1 ms to minimize.
[2021-06-05 21:11:00] [INFO ] Deduced a trap composed of 18 places in 508 ms of which 2 ms to minimize.
[2021-06-05 21:11:01] [INFO ] Deduced a trap composed of 45 places in 494 ms of which 1 ms to minimize.
[2021-06-05 21:11:01] [INFO ] Deduced a trap composed of 31 places in 496 ms of which 1 ms to minimize.
[2021-06-05 21:11:02] [INFO ] Deduced a trap composed of 24 places in 483 ms of which 1 ms to minimize.
[2021-06-05 21:11:03] [INFO ] Deduced a trap composed of 24 places in 463 ms of which 1 ms to minimize.
[2021-06-05 21:11:03] [INFO ] Deduced a trap composed of 34 places in 473 ms of which 1 ms to minimize.
[2021-06-05 21:11:04] [INFO ] Deduced a trap composed of 38 places in 460 ms of which 2 ms to minimize.
[2021-06-05 21:11:04] [INFO ] Deduced a trap composed of 32 places in 445 ms of which 1 ms to minimize.
[2021-06-05 21:11:05] [INFO ] Deduced a trap composed of 29 places in 456 ms of which 1 ms to minimize.
[2021-06-05 21:11:05] [INFO ] Deduced a trap composed of 31 places in 454 ms of which 1 ms to minimize.
[2021-06-05 21:11:06] [INFO ] Deduced a trap composed of 32 places in 430 ms of which 2 ms to minimize.
[2021-06-05 21:11:06] [INFO ] Deduced a trap composed of 28 places in 433 ms of which 2 ms to minimize.
[2021-06-05 21:11:07] [INFO ] Deduced a trap composed of 25 places in 434 ms of which 1 ms to minimize.
[2021-06-05 21:11:07] [INFO ] Deduced a trap composed of 40 places in 418 ms of which 1 ms to minimize.
[2021-06-05 21:11:08] [INFO ] Deduced a trap composed of 29 places in 413 ms of which 1 ms to minimize.
[2021-06-05 21:11:08] [INFO ] Deduced a trap composed of 33 places in 407 ms of which 1 ms to minimize.
[2021-06-05 21:11:09] [INFO ] Deduced a trap composed of 38 places in 418 ms of which 1 ms to minimize.
[2021-06-05 21:11:09] [INFO ] Deduced a trap composed of 25 places in 410 ms of which 2 ms to minimize.
[2021-06-05 21:11:10] [INFO ] Deduced a trap composed of 39 places in 402 ms of which 1 ms to minimize.
[2021-06-05 21:11:12] [INFO ] Deduced a trap composed of 16 places in 1520 ms of which 3 ms to minimize.
[2021-06-05 21:11:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 570 transitions
Trivial Post-agglo rules discarded 570 transitions
Performed 570 trivial Post agglomeration. Transition count delta: 570
Iterating post reduction 0 with 570 rules applied. Total rules applied 570 place count 2804 transition count 1954
Reduce places removed 570 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 571 rules applied. Total rules applied 1141 place count 2234 transition count 1953
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1142 place count 2233 transition count 1953
Performed 256 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 256 Pre rules applied. Total rules applied 1142 place count 2233 transition count 1697
Deduced a syphon composed of 256 places in 4 ms
Reduce places removed 256 places and 0 transitions.
Iterating global reduction 3 with 512 rules applied. Total rules applied 1654 place count 1977 transition count 1697
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 1750 place count 1881 transition count 1601
Iterating global reduction 3 with 96 rules applied. Total rules applied 1846 place count 1881 transition count 1601
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 1846 place count 1881 transition count 1524
Deduced a syphon composed of 77 places in 3 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 2000 place count 1804 transition count 1524
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 674
Deduced a syphon composed of 674 places in 3 ms
Reduce places removed 674 places and 0 transitions.
Iterating global reduction 3 with 1348 rules applied. Total rules applied 3348 place count 1130 transition count 850
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3349 place count 1130 transition count 849
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3351 place count 1129 transition count 848
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3553 place count 1028 transition count 848
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3589 place count 1010 transition count 848
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 3590 place count 1010 transition count 848
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3591 place count 1009 transition count 847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3592 place count 1008 transition count 847
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3592 place count 1008 transition count 845
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3596 place count 1006 transition count 845
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3597 place count 1005 transition count 844
Applied a total of 3597 rules in 986 ms. Remains 1005 /2805 variables (removed 1800) and now considering 844/2525 (removed 1681) transitions.
[2021-06-05 21:11:13] [INFO ] Flatten gal took : 37 ms
[2021-06-05 21:11:13] [INFO ] Flatten gal took : 41 ms
[2021-06-05 21:11:13] [INFO ] Input system was already deterministic with 844 transitions.
[2021-06-05 21:11:13] [INFO ] Flatten gal took : 35 ms
[2021-06-05 21:11:13] [INFO ] Flatten gal took : 34 ms
[2021-06-05 21:11:13] [INFO ] Time to serialize gal into /tmp/CTLFireability15290213812229224385.gal : 20 ms
[2021-06-05 21:11:13] [INFO ] Time to serialize properties into /tmp/CTLFireability18408436190139412298.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15290213812229224385.gal, -t, CGAL, -ctl, /tmp/CTLFireability18408436190139412298.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15290213812229224385.gal -t CGAL -ctl /tmp/CTLFireability18408436190139412298.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.13354e+144,1.92842,53208,2,4223,5,219551,6,0,4866,257499,0


Converting to forward existential form...Done !
original formula: EG(AF(AG((((((p3055==1)||(p2795==1))||(p2572==1))||(p477==1))||(p1166==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !((((((p3055==1)||(p2795==1))||(p2572==1))||(p477==1))||(p1166==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97, t98, t100, t120, t121, t123, t161, t165, t170, t176, t181, t190, t196, t201, t207, t213, t218, t223, t228, t238, t243, t249, t254, t259, t264, t269, t275, t280, t286, t291, t295, t301, t306, t311, t315, t320, t327, t749, t760, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/708/136/844
Detected timeout of ITS tools.
[2021-06-05 21:11:43] [INFO ] Flatten gal took : 36 ms
[2021-06-05 21:11:43] [INFO ] Applying decomposition
[2021-06-05 21:11:43] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11142673270250627983.txt, -o, /tmp/graph11142673270250627983.bin, -w, /tmp/graph11142673270250627983.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11142673270250627983.bin, -l, -1, -v, -w, /tmp/graph11142673270250627983.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-05 21:11:43] [INFO ] Decomposing Gal with order
[2021-06-05 21:11:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-05 21:11:43] [INFO ] Removed a total of 249 redundant transitions.
[2021-06-05 21:11:43] [INFO ] Flatten gal took : 169 ms
[2021-06-05 21:11:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 36 ms.
[2021-06-05 21:11:44] [INFO ] Time to serialize gal into /tmp/CTLFireability9313781459868321368.gal : 21 ms
[2021-06-05 21:11:44] [INFO ] Time to serialize properties into /tmp/CTLFireability12138531474501658838.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability9313781459868321368.gal, -t, CGAL, -ctl, /tmp/CTLFireability12138531474501658838.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability9313781459868321368.gal -t CGAL -ctl /tmp/CTLFireability12138531474501658838.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.13354e+144,1.15488,39808,355,36,70252,261,721,158297,70,821,0


Converting to forward existential form...Done !
original formula: EG(AF(AG((((((i38.i1.i0.u318.p3055==1)||(i35.u292.p2795==1))||(i32.u267.p2572==1))||(i5.u49.p477==1))||(i14.u122.p1166==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !((((((i38.i1.i0.u318.p3055==1)||(i35.u292.p2795==1))||(i32.u267.p2572==1))||(i5.u49.p477==1))||(i14.u122.p1166==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.t2, i0.t1, i0.t0, i0.u1.t161, i1.t5, i1.t4, i1.t3, i1.u10.t165, i2.t8, i2.t7, i2.t6, i2.u18.t170, i3.t11, i3.t10, i3.t9, i3.u26.t176, i4.t14, i4.t13, i4.t12, i4.u34.t181, i5.t17, i5.t16, i5.t15, i5.u49.t123, i6.t20, i6.t19, i6.t18, i6.u51.t190, i7.t23, i7.t22, i7.t21, i7.u59.t196, i8.t26, i8.t25, i8.t24, i8.u67.t201, i9.t29, i9.t28, i9.t27, i9.u75.t207, i10.t32, i10.t31, i10.t30, i10.u83.t213, i11.t35, i11.t34, i11.t33, i11.u91.t218, i12.t38, i12.t37, i12.t36, i12.u99.t223, i13.t41, i13.t40, i13.t39, i13.u107.t228, i14.t44, i14.t43, i14.t42, i14.u122.t121, i15.t47, i15.t46, i15.t45, i15.u124.t238, i16.t50, i16.t49, i16.t48, i16.u132.t243, i17.t53, i17.t52, i17.t51, i17.u140.t249, i18.t56, i18.t55, i18.t54, i18.u148.t254, i19.t59, i19.t58, i19.t57, i19.u156.t259, i20.t62, i20.t61, i20.t60, i20.u164.t264, i21.t65, i21.t64, i21.t63, i21.u172.t269, i22.t68, i22.t67, i22.t66, i22.u180.t275, i23.t71, i23.t70, i23.t69, i23.u188.t280, i24.t74, i24.t73, i24.t72, i24.u196.t286, i25.t77, i25.t76, i25.t75, i25.u204.t291, i26.t80, i26.t79, i26.t78, i26.u212.t295, i27.t83, i27.t82, i27.t81, i27.u220.t301, i28.t86, i28.t85, i28.t84, i28.u228.t306, i29.t89, i29.t88, i29.t87, i29.u236.t311, i30.t92, i30.t91, i30.t90, i30.u244.t315, i31.t95, i31.t94, i31.t93, i31.u252.t320, i32.t760, i32.t98, i32.t97, i32.t96, i32.u261.t749, i32.u260.t327, i32.u267.t120, i33.t100, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/545/136/681
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 543 transitions
Trivial Post-agglo rules discarded 543 transitions
Performed 543 trivial Post agglomeration. Transition count delta: 543
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 2804 transition count 1981
Reduce places removed 543 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 551 rules applied. Total rules applied 1094 place count 2261 transition count 1973
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1102 place count 2253 transition count 1973
Performed 255 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 255 Pre rules applied. Total rules applied 1102 place count 2253 transition count 1718
Deduced a syphon composed of 255 places in 3 ms
Reduce places removed 255 places and 0 transitions.
Iterating global reduction 3 with 510 rules applied. Total rules applied 1612 place count 1998 transition count 1718
Discarding 88 places :
Symmetric choice reduction at 3 with 88 rule applications. Total rules 1700 place count 1910 transition count 1630
Iterating global reduction 3 with 88 rules applied. Total rules applied 1788 place count 1910 transition count 1630
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 1788 place count 1910 transition count 1563
Deduced a syphon composed of 67 places in 2 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 1922 place count 1843 transition count 1563
Performed 651 Post agglomeration using F-continuation condition.Transition count delta: 651
Deduced a syphon composed of 651 places in 1 ms
Reduce places removed 651 places and 0 transitions.
Iterating global reduction 3 with 1302 rules applied. Total rules applied 3224 place count 1192 transition count 912
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3225 place count 1192 transition count 911
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3227 place count 1191 transition count 910
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3429 place count 1090 transition count 910
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 3453 place count 1078 transition count 910
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3454 place count 1077 transition count 909
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3455 place count 1076 transition count 909
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3455 place count 1076 transition count 907
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3459 place count 1074 transition count 907
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3460 place count 1073 transition count 906
Applied a total of 3460 rules in 710 ms. Remains 1073 /2805 variables (removed 1732) and now considering 906/2525 (removed 1619) transitions.
[2021-06-05 21:12:14] [INFO ] Flatten gal took : 34 ms
[2021-06-05 21:12:14] [INFO ] Flatten gal took : 37 ms
[2021-06-05 21:12:15] [INFO ] Input system was already deterministic with 906 transitions.
[2021-06-05 21:12:15] [INFO ] Flatten gal took : 36 ms
[2021-06-05 21:12:15] [INFO ] Flatten gal took : 36 ms
[2021-06-05 21:12:15] [INFO ] Time to serialize gal into /tmp/CTLFireability673639728853926069.gal : 5 ms
[2021-06-05 21:12:15] [INFO ] Time to serialize properties into /tmp/CTLFireability11305410283384117719.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability673639728853926069.gal, -t, CGAL, -ctl, /tmp/CTLFireability11305410283384117719.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability673639728853926069.gal -t CGAL -ctl /tmp/CTLFireability11305410283384117719.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.75705e+149,16.7562,374984,2,8445,5,1.54292e+06,6,0,5198,2.45347e+06,0


Converting to forward existential form...Done !
original formula: EF((!(AF(AG((((p7==1)||(p346==1))&&(((((((((p261==1)||((p682==1)&&(p734==1)))||(p2121==1))||((p1676==1)&&(p1723==1)))||(p922==1))||(p2735==1))||(p1258==1))||(p2509==1))||((p3062==1)&&(p3109==1))))))) * (((((((((E(E(A((((p1663==1)||(p1852==1))||(p932==1)) U ((((p1007==1)||(p562==1))||((p380==1)&&(p382==1)))||(p1592==1))) U (((((((((((p134==1)&&(p161==1))||(p3052==1))||(p2164==1))||(p2249==1))||((p1670==1)&&(p1711==1)))||(p1572==1))||((p2908==1)&&(p2955==1)))||(p2434==1))||(p2704==1))||(p2542==1))) U (AF(((((((p277==1)||(p1349==1))||(p2121==1))||(p11==1))||(p933==1))||((p2675==1)&&(p2702==1)))) * AF((((((((p112==1)||((p2455==1)&&(p2565==1)))||(p1192==1))||(p979==1))||(p741==1))||(p347==1))||(p1182==1))))) + (p1827==1)) + (p1746==1)) + (p1940==1)) + (p2557==1)) + (p962==1)) + (p661==1)) + ((p58==1)&&(p60==1))) + ((p1381==1)&&(p1383==1))) + ((p1606==1)&&(p1658==1)))))
=> equivalent forward existential formula: ((((((((([((FwdU((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((p7==1)||(p346==1))&&(((((((((p261==1)||((p682==1)&&(p734==1)))||(p2121==1))||((p1676==1)&&(p1723==1)))||(p922==1))||(p2735==1))||(p1258==1))||(p2509==1))||((p3062==1)&&(p3109==1)))))))))))),E(!((E(!(((((p1007==1)||(p562==1))||((p380==1)&&(p382==1)))||(p1592==1))) U (!((((p1663==1)||(p1852==1))||(p932==1))) * !(((((p1007==1)||(p562==1))||((p380==1)&&(p382==1)))||(p1592==1))))) + EG(!(((((p1007==1)||(p562==1))||((p380==1)&&(p382==1)))||(p1592==1)))))) U (((((((((((p134==1)&&(p161==1))||(p3052==1))||(p2164==1))||(p2249==1))||((p1670==1)&&(p1711==1)))||(p1572==1))||((p2908==1)&&(p2955==1)))||(p2434==1))||(p2704==1))||(p2542==1)))) * !(EG(!(((((((p277==1)||(p1349==1))||(p2121==1))||(p11==1))||(p933==1))||((p2675==1)&&(p2702==1))))))) * !(EG(!((((((((p112==1)||((p2455==1)&&(p2565==1)))||(p1192==1))||(p979==1))||(p741==1))||(p347==1))||(p1182==1))))))] != FALSE + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((p7==1)||(p346==1))&&(((((((((p261==1)||((p682==1)&&(p734==1)))||(p2121==1))||((p1676==1)&&(p1723==1)))||(p922==1))||(p2735==1))||(p1258==1))||(p2509==1))||((p3062==1)&&(p3109==1)))))))))))) * (p1827==1))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((p7==1)||(p346==1))&&(((((((((p261==1)||((p682==1)&&(p734==1)))||(p2121==1))||((p1676==1)&&(p1723==1)))||(p922==1))||(p2735==1))||(p1258==1))||(p2509==1))||((p3062==1)&&(p3109==1)))))))))))) * (p1746==1))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((p7==1)||(p346==1))&&(((((((((p261==1)||((p682==1)&&(p734==1)))||(p2121==1))||((p1676==1)&&(p1723==1)))||(p922==1))||(p2735==1))||(p1258==1))||(p2509==1))||((p3062==1)&&(p3109==1)))))))))))) * (p1940==1))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((p7==1)||(p346==1))&&(((((((((p261==1)||((p682==1)&&(p734==1)))||(p2121==1))||((p1676==1)&&(p1723==1)))||(p922==1))||(p2735==1))||(p1258==1))||(p2509==1))||((p3062==1)&&(p3109==1)))))))))))) * (p2557==1))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((p7==1)||(p346==1))&&(((((((((p261==1)||((p682==1)&&(p734==1)))||(p2121==1))||((p1676==1)&&(p1723==1)))||(p922==1))||(p2735==1))||(p1258==1))||(p2509==1))||((p3062==1)&&(p3109==1)))))))))))) * (p962==1))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((p7==1)||(p346==1))&&(((((((((p261==1)||((p682==1)&&(p734==1)))||(p2121==1))||((p1676==1)&&(p1723==1)))||(p922==1))||(p2735==1))||(p1258==1))||(p2509==1))||((p3062==1)&&(p3109==1)))))))))))) * (p661==1))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((p7==1)||(p346==1))&&(((((((((p261==1)||((p682==1)&&(p734==1)))||(p2121==1))||((p1676==1)&&(p1723==1)))||(p922==1))||(p2735==1))||(p1258==1))||(p2509==1))||((p3062==1)&&(p3109==1)))))))))))) * ((p58==1)&&(p60==1)))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((p7==1)||(p346==1))&&(((((((((p261==1)||((p682==1)&&(p734==1)))||(p2121==1))||((p1676==1)&&(p1723==1)))||(p922==1))||(p2735==1))||(p1258==1))||(p2509==1))||((p3062==1)&&(p3109==1)))))))))))) * ((p1381==1)&&(p1383==1)))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((p7==1)||(p346==1))&&(((((((((p261==1)||((p682==1)&&(p734
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:185)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.ITSRunner$ITSInterpreter.run(ITSRunner.java:182)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-06-05 21:12:45] [INFO ] Flatten gal took : 38 ms
[2021-06-05 21:12:45] [INFO ] Applying decomposition
[2021-06-05 21:12:45] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9436005343578923146.txt, -o, /tmp/graph9436005343578923146.bin, -w, /tmp/graph9436005343578923146.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9436005343578923146.bin, -l, -1, -v, -w, /tmp/graph9436005343578923146.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-05 21:12:45] [INFO ] Decomposing Gal with order
[2021-06-05 21:12:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-05 21:12:45] [INFO ] Removed a total of 271 redundant transitions.
[2021-06-05 21:12:45] [INFO ] Flatten gal took : 63 ms
[2021-06-05 21:12:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 23 ms.
[2021-06-05 21:12:45] [INFO ] Time to serialize gal into /tmp/CTLFireability9035341914652823164.gal : 11 ms
[2021-06-05 21:12:45] [INFO ] Time to serialize properties into /tmp/CTLFireability16727082927812435834.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability9035341914652823164.gal, -t, CGAL, -ctl, /tmp/CTLFireability16727082927812435834.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability9035341914652823164.gal -t CGAL -ctl /tmp/CTLFireability16727082927812435834.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.75705e+149,12.7481,318792,2098,112,641571,1523,1582,1.78677e+06,125,7798,0


Converting to forward existential form...Done !
original formula: EF((!(AF(AG((((i27.i0.i1.u259.p7==1)||(i3.u35.p346==1))&&(((((((((i2.u26.p261==1)||((i7.u77.p682==1)&&(i7.u80.p734==1)))||(i23.u232.p2121==1))||((i18.u182.p1676==1)&&(i18.u188.p1723==1)))||(i10.u103.p922==1))||(i30.u306.p2735==1))||(i13.i0.i2.u136.p1258==1))||(i28.u276.p2509==1))||((i33.i1.i0.u344.p3062==1)&&(i33.i1.i0.u349.p3109==1))))))) * (((((((((E(E(A((((i18.u179.p1663==1)||(i20.u206.p1852==1))||(i10.u103.p932==1)) U ((((i11.u113.p1007==1)||(i5.u60.p562==1))||((i4.i0.i2.u42.p380==1)&&(i4.i0.i0.u43.p382==1)))||(i17.u171.p1592==1))) U (((((((((((i1.u11.p134==1)&&(i1.u17.p161==1))||(i33.i1.i0.u341.p3052==1))||(i24.u240.p2164==1))||(i25.u249.p2249==1))||((i18.u180.p1670==1)&&(i18.u187.p1711==1)))||(i16.u170.p1572==1))||((i32.u325.p2908==1)&&(i32.u331.p2955==1)))||(i27.i1.i0.u267.p2434==1))||(i30.u304.p2704==1))||(i28.u284.p2542==1))) U (AF(((((((i3.u28.p277==1)||(i14.u145.p1349==1))||(i23.u232.p2121==1))||(i26.u251.p11==1))||(i10.u103.p933==1))||((i30.u298.p2675==1)&&(i30.u305.p2702==1)))) * AF((((((((i0.u9.p112==1)||((i27.i1.i2.u273.p2455==1)&&(i28.u286.p2565==1)))||(i13.i0.i1.u128.p1192==1))||(i11.u106.p979==1))||(i8.u81.p741==1))||(i3.u36.p347==1))||(i13.i0.i2.u127.p1182==1))))) + (i20.u200.p1827==1)) + (i19.u190.p1746==1)) + (i21.u215.p1940==1)) + (i28.u285.p2557==1)) + (i10.u104.p962==1)) + (i7.u71.p661==1)) + ((i0.u2.p58==1)&&(i0.u3.p60==1))) + ((i15.i0.i1.u151.p1381==1)&&(i15.i0.i2.u152.p1383==1))) + ((i17.u174.p1606==1)&&(i17.u178.p1658==1)))))
=> equivalent forward existential formula: ((((((((([((FwdU((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((i27.i0.i1.u259.p7==1)||(i3.u35.p346==1))&&(((((((((i2.u26.p261==1)||((i7.u77.p682==1)&&(i7.u80.p734==1)))||(i23.u232.p2121==1))||((i18.u182.p1676==1)&&(i18.u188.p1723==1)))||(i10.u103.p922==1))||(i30.u306.p2735==1))||(i13.i0.i2.u136.p1258==1))||(i28.u276.p2509==1))||((i33.i1.i0.u344.p3062==1)&&(i33.i1.i0.u349.p3109==1)))))))))))),E(!((E(!(((((i11.u113.p1007==1)||(i5.u60.p562==1))||((i4.i0.i2.u42.p380==1)&&(i4.i0.i0.u43.p382==1)))||(i17.u171.p1592==1))) U (!((((i18.u179.p1663==1)||(i20.u206.p1852==1))||(i10.u103.p932==1))) * !(((((i11.u113.p1007==1)||(i5.u60.p562==1))||((i4.i0.i2.u42.p380==1)&&(i4.i0.i0.u43.p382==1)))||(i17.u171.p1592==1))))) + EG(!(((((i11.u113.p1007==1)||(i5.u60.p562==1))||((i4.i0.i2.u42.p380==1)&&(i4.i0.i0.u43.p382==1)))||(i17.u171.p1592==1)))))) U (((((((((((i1.u11.p134==1)&&(i1.u17.p161==1))||(i33.i1.i0.u341.p3052==1))||(i24.u240.p2164==1))||(i25.u249.p2249==1))||((i18.u180.p1670==1)&&(i18.u187.p1711==1)))||(i16.u170.p1572==1))||((i32.u325.p2908==1)&&(i32.u331.p2955==1)))||(i27.i1.i0.u267.p2434==1))||(i30.u304.p2704==1))||(i28.u284.p2542==1)))) * !(EG(!(((((((i3.u28.p277==1)||(i14.u145.p1349==1))||(i23.u232.p2121==1))||(i26.u251.p11==1))||(i10.u103.p933==1))||((i30.u298.p2675==1)&&(i30.u305.p2702==1))))))) * !(EG(!((((((((i0.u9.p112==1)||((i27.i1.i2.u273.p2455==1)&&(i28.u286.p2565==1)))||(i13.i0.i1.u128.p1192==1))||(i11.u106.p979==1))||(i8.u81.p741==1))||(i3.u36.p347==1))||(i13.i0.i2.u127.p1182==1))))))] != FALSE + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((i27.i0.i1.u259.p7==1)||(i3.u35.p346==1))&&(((((((((i2.u26.p261==1)||((i7.u77.p682==1)&&(i7.u80.p734==1)))||(i23.u232.p2121==1))||((i18.u182.p1676==1)&&(i18.u188.p1723==1)))||(i10.u103.p922==1))||(i30.u306.p2735==1))||(i13.i0.i2.u136.p1258==1))||(i28.u276.p2509==1))||((i33.i1.i0.u344.p3062==1)&&(i33.i1.i0.u349.p3109==1)))))))))))) * (i20.u200.p1827==1))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((i27.i0.i1.u259.p7==1)||(i3.u35.p346==1))&&(((((((((i2.u26.p261==1)||((i7.u77.p682==1)&&(i7.u80.p734==1)))||(i23.u232.p2121==1))||((i18.u182.p1676==1)&&(i18.u188.p1723==1)))||(i10.u103.p922==1))||(i30.u306.p2735==1))||(i13.i0.i2.u136.p1258==1))||(i28.u276.p2509==1))||((i33.i1.i0.u344.p3062==1)&&(i33.i1.i0.u349.p3109==1)))))))))))) * (i19.u190.p1746==1))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((i27.i0.i1.u259.p7==1)||(i3.u35.p346==1))&&(((((((((i2.u26.p261==1)||((i7.u77.p682==1)&&(i7.u80.p734==1)))||(i23.u232.p2121==1))||((i18.u182.p1676==1)&&(i18.u188.p1723==1)))||(i10.u103.p922==1))||(i30.u306.p2735==1))||(i13.i0.i2.u136.p1258==1))||(i28.u276.p2509==1))||((i33.i1.i0.u344.p3062==1)&&(i33.i1.i0.u349.p3109==1)))))))))))) * (i21.u215.p1940==1))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((i27.i0.i1.u259.p7==1)||(i3.u35.p346==1))&&(((((((((i2.u26.p261==1)||((i7.u77.p682==1)&&(i7.u80.p734==1)))||(i23.u232.p2121==1))||((i18.u182.p1676==1)&&(i18.u188.p1723==1)))||(i10.u103.p922==1))||(i30.u306.p2735==1))||(i13.i0.i2.u136.p1258==1))||(i28.u276.p2509==1))||((i33.i1.i0.u344.p3062==1)&&(i33.i1.i0.u349.p3109==1)))))))))))) * (i28.u285.p2557==1))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((i27.i0.i1.u259.p7==1)||(i3.u35.p346==1))&&(((((((((i2.u26.p261==1)||((i7.u77.p682==1)&&(i7.u80.p734==1)))||(i23.u232.p2121==1))||((i18.u182.p1676==1)&&(i18.u188.p1723==1)))||(i10.u103.p922==1))||(i30.u306.p2735==1))||(i13.i0.i2.u136.p1258==1))||(i28.u276.p2509==1))||((i33.i1.i0.u344.p3062==1)&&(i33.i1.i0.u349.p3109==1)))))))))))) * (i10.u104.p962==1))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((i27.i0.i1.u259.p7==1)||(i3.u35.p346==1))&&(((((((((i2.u26.p261==1)||((i7.u77.p682==1)&&(i7.u80.p734==1)))||(i23.u232.p2121==1))||((i18.u182.p1676==1)&&(i18.u188.p1723==1)))||(i10.u103.p922==1))||(i30.u306.p2735==1))||(i13.i0.i2.u136.p1258==1))||(i28.u276.p2509==1))||((i33.i1.i0.u344.p3062==1)&&(i33.i1.i0.u349.p3109==1)))))))))))) * (i7.u71.p661==1))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((i27.i0.i1.u259.p7==1)||(i3.u35.p346==1))&&(((((((((i2.u26.p261==1)||((i7.u77.p682==1)&&(i7.u80.p734==1)))||(i23.u232.p2121==1))||((i18.u182.p1676==1)&&(i18.u188.p1723==1)))||(i10.u103.p922==1))||(i30.u306.p2735==1))||(i13.i0.i2.u136.p1258==1))||(i28.u276.p2509==1))||((i33.i1.i0.u344.p3062==1)&&(i33.i1.i0.u349.p3109==1)))))))))))) * ((i0.u2.p58==1)&&(i0.u3.p60==1)))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((i27.i0.i1.u259.p7==1)||(i3.u35.p346==1))&&(((((((((i2.u26.p261==1)||((i7.u77.p682==1)&&(i7.u80.p734==1)))||(i23.u232.p2121==1))||((i18.u182.p1676==1)&&(i18.u188.p1723==1)))||(i10.u103.p922==1))||(i30.u306.p2735==1))||(i13.i0.i2.u136.p1258==1))||(i28.u276.p2509==1))||((i33.i1.i0.u344.p3062==1)&&(i33.i1.i0.u349.p3109==1)))))))))))) * ((i15.i0.i1.u151.p1381==1)&&(i15.i0.i2.u152.p1383==1)))] != FALSE) + [((FwdU(Init,TRUE) * !(!(EG(!(!(E(TRUE U !((((i27.i0.i1.u259.p7==1)||(i3.u35.p346==1))&&(((((((((i2.u26.p261==1)||((i7.u77.p682==1)&&(i7.u80.p734==1)))||(i23.u232.p2121==1))||((i18.u182.p1676==1)&&(i18.u188.p1723==1)))||(i10.u103.p922==1))||(i30.u306.p2735==1))||(i13.i0.i2.u136.p1258==1))||(i28.u276.p2509==1))||((i33.i1.i0.u344.p3062==1)&&(i33.i1.i0.u349.p3109==1)))))))))))) * ((i17.u174.p1606==1)&&(i17.u178.p1658==1)))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t385, t420, i0.t192, i0.t1, i0.t0, i0.u1.t229, i0.u9.t152, i1.t4, i1.t3, i1.t2, i1.u10.t232, i2.t485, i2.t7, i2.t6, i2.t5, i2.u20.t477, i2.u26.t149, i2.u19.t238, i3.t243, i3.t9, i3.t8, i3.u29.t245, i3.u34.t10, i3.u35.t147, i4.i0.t11, i4.i0.t12, i4.i0.t194, i4.i0.i2.u37.t251, i4.i1.t13, i4.i1.t14, i4.i1.t15, i4.i1.i2.u45.t256, i5.t18, i5.t17, i5.t16, i5.u60.t145, i5.u53.t261, i6.t21, i6.t20, i6.t19, i6.u62.t267, i7.t271, i7.t24, i7.t23, i7.t22, i7.u72.t273, i8.t274, i8.t27, i8.t26, i8.t25, i8.u82.t280, i9.t30, i9.t29, i9.t28, i9.u90.t286, i10.t287, i10.t31, i10.u102.t33, i10.u98.t291, i10.u101.t32, i10.u103.t143, i10.u104.t140, i11.t36, i11.t35, i11.u113.t588, i11.u113.t589, i11.u106.t139, i11.u105.t297, i12.t39, i12.t38, i12.t37, i12.u115.t302, i13.i0.i0.u124.t40, i13.i0.i0.u125.t41, i13.i0.i1.u123.t308, i13.i0.i1.u129.t221, i13.i0.i2.u126.t42, i13.i0.i2.u127.t310, i13.i0.i2.u136.t136, i13.i1.t44, i13.i1.i0.t43, i13.i1.i0.u130.t314, i13.i1.i1.u135.t45, i14.t48, i14.t47, i14.t46, i14.u138.t320, i14.u145.t632, i14.u145.t633, i15.i0.t49, i15.i0.t50, i15.i0.t197, i15.i0.i1.u146.t326, i15.i1.t51, i15.i1.t52, i15.i1.t53, i15.i1.i1.t654, i15.i1.i2.t656, i15.i1.i2.u154.t331, i16.t662, i16.t56, i16.t55, i16.t54, i16.u168.t667, i16.u162.t336, i16.u170.t135, i17.t59, i17.t58, i17.t57, i17.u171.t134, i18.t346, i18.t344, i18.t62, i18.t61, i18.t60, i19.t65, i19.t64, i19.t63, i19.u190.t129, i20.t68, i20.t67, i20.t66, i20.u206.t127, i20.u198.t357, i21.t71, i21.t70, i21.t69, i21.u215.t126, i22.t737, i22.t734, i22.t74, i22.t73, i22.t72, i22.u217.t367, i23.t746, i23.t742, i23.t77, i23.t76, i23.t75, i23.u225.t372, i23.u232.t124, i24.t80, i24.t79, i24.t78, i24.u233.t378, i24.u240.t122, i25.t83, i25.t82, i25.t81, i25.u249.t384, i26.t391, i26.t86, i26.t85, i26.t84, i26.u251.t390, i27.i0.t87, i27.i0.t88, i27.i0.t89, i27.i0.i1.u259.t396, i27.i1.t90, i27.i1.t91, i27.i1.t217, i27.i1.t397, i27.i1.i0.u268.t404, i28.t413, i28.t94, i28.t93, i28.t92, i28.u284.t121, i28.u285.t412, i29.t97, i29.t96, i29.t95, i29.u288.t419, i30.t117, i30.t100, i30.t99, i30.t98, i30.u296.t424, i30.u306.t845, i31.i0.t101, i31.i0.t102, i31.i0.t103, i31.i0.i1.u307.t428, i31.i1.t104, i31.i1.t105, i31.i1.t106, i31.i1.i1.u315.t435, i32.t109, i32.t108, i32.t107, i32.u323.t439, i33.i0.t110, i33.i0.t111, i33.i0.t112, i33.i0.i2.u333.t444, i33.i1.t446, i33.i1.t449, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/546/198/744
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 541 transitions
Trivial Post-agglo rules discarded 541 transitions
Performed 541 trivial Post agglomeration. Transition count delta: 541
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 2804 transition count 1983
Reduce places removed 541 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 554 rules applied. Total rules applied 1095 place count 2263 transition count 1970
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1108 place count 2250 transition count 1970
Performed 254 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 254 Pre rules applied. Total rules applied 1108 place count 2250 transition count 1716
Deduced a syphon composed of 254 places in 3 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 3 with 508 rules applied. Total rules applied 1616 place count 1996 transition count 1716
Discarding 86 places :
Symmetric choice reduction at 3 with 86 rule applications. Total rules 1702 place count 1910 transition count 1630
Iterating global reduction 3 with 86 rules applied. Total rules applied 1788 place count 1910 transition count 1630
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 1788 place count 1910 transition count 1559
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 1930 place count 1839 transition count 1559
Performed 652 Post agglomeration using F-continuation condition.Transition count delta: 652
Deduced a syphon composed of 652 places in 1 ms
Reduce places removed 652 places and 0 transitions.
Iterating global reduction 3 with 1304 rules applied. Total rules applied 3234 place count 1187 transition count 907
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3235 place count 1187 transition count 906
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3237 place count 1186 transition count 905
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3439 place count 1085 transition count 905
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 3467 place count 1071 transition count 905
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3468 place count 1070 transition count 904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3469 place count 1069 transition count 904
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3469 place count 1069 transition count 902
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3473 place count 1067 transition count 902
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3474 place count 1066 transition count 901
Applied a total of 3474 rules in 671 ms. Remains 1066 /2805 variables (removed 1739) and now considering 901/2525 (removed 1624) transitions.
[2021-06-05 21:13:16] [INFO ] Flatten gal took : 31 ms
[2021-06-05 21:13:16] [INFO ] Flatten gal took : 33 ms
[2021-06-05 21:13:16] [INFO ] Input system was already deterministic with 901 transitions.
[2021-06-05 21:13:16] [INFO ] Flatten gal took : 32 ms
[2021-06-05 21:13:16] [INFO ] Flatten gal took : 32 ms
[2021-06-05 21:13:16] [INFO ] Time to serialize gal into /tmp/CTLFireability13292405509456800495.gal : 5 ms
[2021-06-05 21:13:16] [INFO ] Time to serialize properties into /tmp/CTLFireability8596440404235723819.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13292405509456800495.gal, -t, CGAL, -ctl, /tmp/CTLFireability8596440404235723819.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13292405509456800495.gal -t CGAL -ctl /tmp/CTLFireability8596440404235723819.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.78625e+148,14.3853,362360,2,7677,5,1.48312e+06,6,0,5166,2.358e+06,0


Converting to forward existential form...Done !
original formula: A(((((((p2630==1)||(p1170==1))||(p1077==1))||(p1496==1))||((p1905==1)&&(p1932==1)))||((p752==1)&&(p799==1))) U (!(A(((((p2989==1)||(p1019==1))||(p1963==1))||(p1712==1)) U E(((((((p2698==1)||(p3001==1))||(p2892==1))||(p1924==1))||(p411==1))&&(p2204==1)) U ((((((((((p2228==1)&&(p2230==1))||((p2992==1)&&(p3044==1)))||((p2845==1)&&(p2878==1)))||(p2497==1))||((p758==1)&&(p760==1)))||(p1379==1))||(p2556==1))||(p594==1))||(p1548==1))))) * !(A(!(E((((((((p617==1)||(p423==1))||(p735==1))||(p588==1))||((p1522==1)&&(p1569==1)))||(p107==1))||((p1670==1)&&(p1711==1))) U (((p974==1)||(p1404==1))||(p976==1)))) U ((((((((((p1053==1)||(p1769==1))||(p1709==1))||(p840==1))||(p21==1))||(p1710==1))||(p203==1))||(p1911==1))||(p109==1))&&(p1384==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!((!(!((E(!(E(((((((p2698==1)||(p3001==1))||(p2892==1))||(p1924==1))||(p411==1))&&(p2204==1)) U ((((((((((p2228==1)&&(p2230==1))||((p2992==1)&&(p3044==1)))||((p2845==1)&&(p2878==1)))||(p2497==1))||((p758==1)&&(p760==1)))||(p1379==1))||(p2556==1))||(p594==1))||(p1548==1)))) U (!(((((p2989==1)||(p1019==1))||(p1963==1))||(p1712==1))) * !(E(((((((p2698==1)||(p3001==1))||(p2892==1))||(p1924==1))||(p411==1))&&(p2204==1)) U ((((((((((p2228==1)&&(p2230==1))||((p2992==1)&&(p3044==1)))||((p2845==1)&&(p2878==1)))||(p2497==1))||((p758==1)&&(p760==1)))||(p1379==1))||(p2556==1))||(p594==1))||(p1548==1)))))) + EG(!(E(((((((p2698==1)||(p3001==1))||(p2892==1))||(p1924==1))||(p411==1))&&(p2204==1)) U ((((((((((p2228==1)&&(p2230==1))||((p2992==1)&&(p3044==1)))||((p2845==1)&&(p2878==1)))||(p2497==1))||((p758==1)&&(p760==1)))||(p1379==1))||(p2556==1))||(p594==1))||(p1548==1)))))))) * !(!((E(!(((((((((((p1053==1)||(p1769==1))||(p1709==1))||(p840==1))||(p21==1))||(p1710==1))||(p203==1))||(p1911==1))||(p109==1))&&(p1384==1))) U (!(!(E((((((((p617==1)||(p423==1))||(p735==1))||(p588==1))||((p1522==1)&&(p1569==1)))||(p107==1))||((p1670==1)&&(p1711==1))) U (((p974==1)||(p1404==1))||(p976==1))))) * !(((((((((((p1053==1)||(p1769==1))||(p1709==1))||(p840==1))||(p21==1))||(p1710==1))||(p203==1))||(p1911==1))||(p109==1))&&(p1384==1))))) + EG(!(((((((((((p1053==1)||(p1769==1))||(p1709==1))||(p840==1))||(p21==1))||(p1710==1))||(p203==1))||(p1911==1))||(p109==1))&&(p1384==1)))))))))))) * !(E(!((!(!((E(!(E(((((((p2698==1)||(p3001==1))||(p2892==1))||(p1924==1))||(p411==1))&&(p2204==1)) U ((((((((((p2228==1)&&(p2230==1))||((p2992==1)&&(p3044==1)))||((p2845==1)&&(p2878==1)))||(p2497==1))||((p758==1)&&(p760==1)))||(p1379==1))||(p2556==1))||(p594==1))||(p1548==1)))) U (!(((((p2989==1)||(p1019==1))||(p1963==1))||(p1712==1))) * !(E(((((((p2698==1)||(p3001==1))||(p2892==1))||(p1924==1))||(p411==1))&&(p2204==1)) U ((((((((((p2228==1)&&(p2230==1))||((p2992==1)&&(p3044==1)))||((p2845==1)&&(p2878==1)))||(p2497==1))||((p758==1)&&(p760==1)))||(p1379==1))||(p2556==1))||(p594==1))||(p1548==1)))))) + EG(!(E(((((((p2698==1)||(p3001==1))||(p2892==1))||(p1924==1))||(p411==1))&&(p2204==1)) U ((((((((((p2228==1)&&(p2230==1))||((p2992==1)&&(p3044==1)))||((p2845==1)&&(p2878==1)))||(p2497==1))||((p758==1)&&(p760==1)))||(p1379==1))||(p2556==1))||(p594==1))||(p1548==1)))))))) * !(!((E(!(((((((((((p1053==1)||(p1769==1))||(p1709==1))||(p840==1))||(p21==1))||(p1710==1))||(p203==1))||(p1911==1))||(p109==1))&&(p1384==1))) U (!(!(E((((((((p617==1)||(p423==1))||(p735==1))||(p588==1))||((p1522==1)&&(p1569==1)))||(p107==1))||((p1670==1)&&(p1711==1))) U (((p974==1)||(p1404==1))||(p976==1))))) * !(((((((((((p1053==1)||(p1769==1))||(p1709==1))||(p840==1))||(p21==1))||(p1710==1))||(p203==1))||(p1911==1))||(p109==1))&&(p1384==1))))) + EG(!(((((((((((p1053==1)||(p1769==1))||(p1709==1))||(p840==1))||(p21==1))||(p1710==1))||(p203==1))||(p1911==1))||(p109==1))&&(p1384==1))))))))) U (!(((((((p2630==1)||(p1170==1))||(p1077==1))||(p1496==1))||((p1905==1)&&(p1932==1)))||((p752==1)&&(p799==1)))) * !((!(!((E(!(E(((((((p2698==1)||(p3001==1))||(p2892==1))||(p1924==1))||(p411==1))&&(p2204==1)) U ((((((((((p2228==1)&&(p2230==1))||((p2992==1)&&(p3044==1)))||((p2845==1)&&(p2878==1)))||(p2497==1))||((p758==1)&&(p
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:185)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.ITSRunner$ITSInterpreter.run(ITSRunner.java:182)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-06-05 21:13:46] [INFO ] Flatten gal took : 30 ms
[2021-06-05 21:13:46] [INFO ] Applying decomposition
[2021-06-05 21:13:46] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7974183689243614359.txt, -o, /tmp/graph7974183689243614359.bin, -w, /tmp/graph7974183689243614359.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7974183689243614359.bin, -l, -1, -v, -w, /tmp/graph7974183689243614359.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-05 21:13:46] [INFO ] Decomposing Gal with order
[2021-06-05 21:13:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-05 21:13:46] [INFO ] Removed a total of 276 redundant transitions.
[2021-06-05 21:13:46] [INFO ] Flatten gal took : 52 ms
[2021-06-05 21:13:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 238 labels/synchronizations in 26 ms.
[2021-06-05 21:13:46] [INFO ] Time to serialize gal into /tmp/CTLFireability12660016113688380198.gal : 8 ms
[2021-06-05 21:13:46] [INFO ] Time to serialize properties into /tmp/CTLFireability3521180685588377023.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability12660016113688380198.gal, -t, CGAL, -ctl, /tmp/CTLFireability3521180685588377023.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability12660016113688380198.gal -t CGAL -ctl /tmp/CTLFireability3521180685588377023.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.78625e+148,11.1108,325072,2336,98,641987,928,1470,1.91588e+06,131,5220,0


Converting to forward existential form...Done !
original formula: A(((((((i29.u295.p2630==1)||(i13.u128.p1170==1))||(i12.u119.p1077==1))||(i16.u164.p1496==1))||((i22.u213.p1905==1)&&(i22.u220.p1932==1)))||((i8.u78.p752==1)&&(i8.u83.p799==1))) U (!(A(((((i34.i0.i0.u336.p2989==1)||(i11.u110.p1019==1))||(i22.u221.p1963==1))||(i19.u192.p1712==1)) U E(((((((i30.u304.p2698==1)||(i34.i0.i0.u341.p3001==1))||(i33.u323.p2892==1))||(i22.u220.p1924==1))||(i4.u39.p411==1))&&(i25.u246.p2204==1)) U ((((((((((i25.u252.p2228==1)&&(i25.u253.p2230==1))||((i34.i0.i0.u336.p2992==1)&&(i34.i0.i1.u342.p3044==1)))||((i32.u320.p2845==1)&&(i32.u321.p2878==1)))||(i27.u278.p2497==1))||((i8.u79.p758==1)&&(i8.u80.p760==1)))||(i15.u151.p1379==1))||(i28.u286.p2556==1))||(i6.u59.p594==1))||(i17.u173.p1548==1))))) * !(A(!(E((((((((i6.u66.p617==1)||(i4.u40.p423==1))||(i7.u75.p735==1))||(i6.u57.p588==1))||((i17.u167.p1522==1)&&(i17.u174.p1569==1)))||(i0.u8.p107==1))||((i19.u184.p1670==1)&&(i19.u191.p1711==1))) U (((i11.u102.p974==1)||(i15.u154.p1404==1))||(i11.u103.p976==1)))) U ((((((((((i12.u112.p1053==1)||(i20.u201.p1769==1))||(i19.u191.p1709==1))||(i9.u90.p840==1))||(i17.u165.p21==1))||(i19.u191.p1710==1))||(i2.u18.p203==1))||(i22.u217.p1911==1))||(i0.u9.p109==1))&&(i15.u153.p1384==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!((!(!((E(!(E(((((((i30.u304.p2698==1)||(i34.i0.i0.u341.p3001==1))||(i33.u323.p2892==1))||(i22.u220.p1924==1))||(i4.u39.p411==1))&&(i25.u246.p2204==1)) U ((((((((((i25.u252.p2228==1)&&(i25.u253.p2230==1))||((i34.i0.i0.u336.p2992==1)&&(i34.i0.i1.u342.p3044==1)))||((i32.u320.p2845==1)&&(i32.u321.p2878==1)))||(i27.u278.p2497==1))||((i8.u79.p758==1)&&(i8.u80.p760==1)))||(i15.u151.p1379==1))||(i28.u286.p2556==1))||(i6.u59.p594==1))||(i17.u173.p1548==1)))) U (!(((((i34.i0.i0.u336.p2989==1)||(i11.u110.p1019==1))||(i22.u221.p1963==1))||(i19.u192.p1712==1))) * !(E(((((((i30.u304.p2698==1)||(i34.i0.i0.u341.p3001==1))||(i33.u323.p2892==1))||(i22.u220.p1924==1))||(i4.u39.p411==1))&&(i25.u246.p2204==1)) U ((((((((((i25.u252.p2228==1)&&(i25.u253.p2230==1))||((i34.i0.i0.u336.p2992==1)&&(i34.i0.i1.u342.p3044==1)))||((i32.u320.p2845==1)&&(i32.u321.p2878==1)))||(i27.u278.p2497==1))||((i8.u79.p758==1)&&(i8.u80.p760==1)))||(i15.u151.p1379==1))||(i28.u286.p2556==1))||(i6.u59.p594==1))||(i17.u173.p1548==1)))))) + EG(!(E(((((((i30.u304.p2698==1)||(i34.i0.i0.u341.p3001==1))||(i33.u323.p2892==1))||(i22.u220.p1924==1))||(i4.u39.p411==1))&&(i25.u246.p2204==1)) U ((((((((((i25.u252.p2228==1)&&(i25.u253.p2230==1))||((i34.i0.i0.u336.p2992==1)&&(i34.i0.i1.u342.p3044==1)))||((i32.u320.p2845==1)&&(i32.u321.p2878==1)))||(i27.u278.p2497==1))||((i8.u79.p758==1)&&(i8.u80.p760==1)))||(i15.u151.p1379==1))||(i28.u286.p2556==1))||(i6.u59.p594==1))||(i17.u173.p1548==1)))))))) * !(!((E(!(((((((((((i12.u112.p1053==1)||(i20.u201.p1769==1))||(i19.u191.p1709==1))||(i9.u90.p840==1))||(i17.u165.p21==1))||(i19.u191.p1710==1))||(i2.u18.p203==1))||(i22.u217.p1911==1))||(i0.u9.p109==1))&&(i15.u153.p1384==1))) U (!(!(E((((((((i6.u66.p617==1)||(i4.u40.p423==1))||(i7.u75.p735==1))||(i6.u57.p588==1))||((i17.u167.p1522==1)&&(i17.u174.p1569==1)))||(i0.u8.p107==1))||((i19.u184.p1670==1)&&(i19.u191.p1711==1))) U (((i11.u102.p974==1)||(i15.u154.p1404==1))||(i11.u103.p976==1))))) * !(((((((((((i12.u112.p1053==1)||(i20.u201.p1769==1))||(i19.u191.p1709==1))||(i9.u90.p840==1))||(i17.u165.p21==1))||(i19.u191.p1710==1))||(i2.u18.p203==1))||(i22.u217.p1911==1))||(i0.u9.p109==1))&&(i15.u153.p1384==1))))) + EG(!(((((((((((i12.u112.p1053==1)||(i20.u201.p1769==1))||(i19.u191.p1709==1))||(i9.u90.p840==1))||(i17.u165.p21==1))||(i19.u191.p1710==1))||(i2.u18.p203==1))||(i22.u217.p1911==1))||(i0.u9.p109==1))&&(i15.u153.p1384==1)))))))))))) * !(E(!((!(!((E(!(E(((((((i30.u304.p2698==1)||(i34.i0.i0.u341.p3001==1))||(i33.u323.p2892==1))||(i22.u220.p1924==1))||(i4.u39.p411==1))&&(i25.u246.p2204==1)) U ((((((((((i25.u252.p2228==1)&&(i25.u253.p2230==1))||((i34.i0.i0.u336.p2992==1)&&(i34.i0.i1.u342.p3044==1)))||((i32.u320.p2845==1)&&(i32.u321.p2878==1)))||(i27.u278.p2497==1))||((i8.u79.p758==1)&&(i8.u80.p760==1)))||(i15.u151.p1379==1))||(i28.u286.p2556==1))||(i6.u59.p594==1))||(i17.u173.p1548==1)))) U (!(((((i34.i0.i0.u336.p2989==1)||(i11.u110.p1019==1))||(i22.u221.p1963==1))||(i19.u192.p1712==1))) * !(E(((((((i30.u304.p2698==1)||(i34.i0.i0.u341.p3001==1))||(i33.u323.p2892==1))||(i22.u220.p1924==1))||(i4.u39.p411==1))&&(i25.u246.p2204==1)) U ((((((((((i25.u252.p2228==1)&&(i25.u253.p2230==1))||((i34.i0.i0.u336.p2992==1)&&(i34.i0.i1.u342.p3044==1)))||((i32.u320.p2845==1)&&(i32.u321.p2878==1)))||(i27.u278.p2497==1))||((i8.u79.p758==1)&&(i8.u80.p760==1)))||(i15.u151.p1379==1))||(i28.u286.p2556==1))||(i6.u59.p594==1))||(i17.u173.p1548==1)))))) + EG(!(E(((((((i30.u304.p2698==1)||(i34.i0.i0.u341.p3001==1))||(i33.u323.p2892==1))||(i22.u220.p1924==1))||(i4.u39.p411==1))&&(i25.u246.p2204==1)) U ((((((((((i25.u252.p2228==1)&&(i25.u253.p2230==1))||((i34.i0.i0.u336.p2992==1)&&(i34.i0.i1.u342.p3044==1)))||((i32.u320.p2845==1)&&(i32.u321.p2878==1)))||(i27.u278.p2497==1))||((i8.u79.p758==1)&&(i8.u80.p760==1)))||(i15.u151.p1379==1))||(i28.u286.p2556==1))||(i6.u59.p594==1))||(i17.u173.p1548==1)))))))) * !(!((E(!(((((((((((i12.u112.p1053==1)||(i20.u201.p1769==1))||(i19.u191.p1709==1))||(i9.u90.p840==1))||(i17.u165.p21==1))||(i19.u191.p1710==1))||(i2.u18.p203==1))||(i22.u217.p1911==1))||(i0.u9.p109==1))&&(i15.u153.p1384==1))) U (!(!(E((((((((i6.u66.p617==1)||(i4.u40.p423==1))||(i7.u75.p735==1))||(i6.u57.p588==1))||((i17.u167.p1522==1)&&(i17.u174.p1569==1)))||(i0.u8.p107==1))||((i19.u184.p1670==1)&&(i19.u191.p1711==1))) U (((i11.u102.p974==1)||(i15.u154.p1404==1))||(i11.u103.p976==1))))) * !(((((((((((i12.u112.p1053==1)||(i20.u201.p1769==1))||(i19.u191.p1709==1))||(i9.u90.p840==1))||(i17.u165.p21==1))||(i19.u191.p1710==1))||(i2.u18.p203==1))||(i22.u217.p1911==1))||(i0.u9.p109==1))&&(i15.u153.p1384==1))))) + EG(!(((((((((((i12.u112.p1053==1)||(i20.u201.p1769==1))||(i19.u191.p1709==1))||(i9.u90.p840==1))||(i17.u165.p21==1))||(i19.u191.p1710==1))||(i2.u18.p203==1))||(i22.u217.p1911==1))||(i0.u9.p109==1))&&(i15.u153.p1384==1))))))))) U (!(((((((i29.u295.p2630==1)||(i13.u128.p1170==1))||(i12.u119.p1077==1))||(i16.u164.p1496==1))||((i22.u213.p1905==1)&&(i22.u220.p1932==1)))||((i8.u78.p752==1)&&(i8.u83.p799==1)))) * !((!(!((E(!(E(((((((i30.u304.p2698==1)||(i34.i0.i0.u341.p3001==1))||(i33.u323.p2892==1))||(i22.u220.p1924==1))||(i4.u39.p411==1))&&(i25.u246.p2204==1)) U ((((((((((i25.u252.p2228==1)&&(i25.u253.p2230==1))||((i34.i0.i0.u336.p2992==1)&&(i34.i0.i1.u342.p3044==1)))||((i32.u320.p2845==1)&&(i32.u321.p2878==1)))||(i27.u278.p2497==1))||((i8.u79.p758==1)&&(i8.u80.p760==1)))||(i15.u151.p1379==1))||(i28.u286.p2556==1))||(i6.u59.p594==1))||(i17.u173.p1548==1)))) U (!(((((i34.i0.i0.u336.p2989==1)||(i11.u110.p1019==1))||(i22.u221.p1963==1))||(i19.u192.p1712==1))) * !(E(((((((i30.u304.p2698==1)||(i34.i0.i0.u341.p3001==1))||(i33.u323.p2892==1))||(i22.u220.p1924==1))||(i4.u39.p411==1))&&(i25.u246.p2204==1)) U ((((((((((i25.u252.p2228==1)&&(i25.u253.p2230==1))||((i34.i0.i0.u336.p2992==1)&&(i34.i0.i1.u342.p3044==1)))||((i32.u320.p2845==1)&&(i32.u321.p2878==1)))||(i27.u278.p2497==1))||((i8.u79.p758==1)&&(i8.u80.p760==1)))||(i15.u151.p1379==1))||(i28.u286.p2556==1))||(i6.u59.p594==1))||(i17.u173.p1548==1)))))) + EG(!(E(((((((i30.u304.p2698==1)||(i34.i0.i0.u341.p3001==1))||(i33.u323.p2892==1))||(i22.u220.p1924==1))||(i4.u39.p411==1))&&(i25.u246.p2204==1)) U ((((((((((i25.u252.p2228==1)&&(i25.u253.p2230==1))||((i34.i0.i0.u336.p2992==1)&&(i34.i0.i1.u342.p3044==1)))||((i32.u320.p2845==1)&&(i32.u321.p2878==1)))||(i27.u278.p2497==1))||((i8.u79.p758==1)&&(i8.u80.p760==1)))||(i15.u151.p1379==1))||(i28.u286.p2556==1))||(i6.u59.p594==1))||(i17.u173.p1548==1)))))))) * !(!((E(!(((((((((((i12.u112.p1053==1)||(i20.u201.p1769==1))||(i19.u191.p1709==1))||(i9.u90.p840==1))||(i17.u165.p21==1))||(i19.u191.p1710==1))||(i2.u18.p203==1))||(i22.u217.p1911==1))||(i0.u9.p109==1))&&(i15.u153.p1384==1))) U (!(!(E((((((((i6.u66.p617==1)||(i4.u40.p423==1))||(i7.u75.p735==1))||(i6.u57.p588==1))||((i17.u167.p1522==1)&&(i17.u174.p1569==1)))||(i0.u8.p107==1))||((i19.u184.p1670==1)&&(i19.u191.p1711==1))) U (((i11.u102.p974==1)||(i15.u154.p1404==1))||(i11.u103.p976==1))))) * !(((((((((((i12.u112.p1053==1)||(i20.u201.p1769==1))||(i19.u191.p1709==1))||(i9.u90.p840==1))||(i17.u165.p21==1))||(i19.u191.p1710==1))||(i2.u18.p203==1))||(i22.u217.p1911==1))||(i0.u9.p109==1))&&(i15.u153.p1384==1))))) + EG(!(((((((((((i12.u112.p1053==1)||(i20.u201.p1769==1))||(i19.u191.p1709==1))||(i9.u90.p840==1))||(i17.u165.p21==1))||(i19.u191.p1710==1))||(i2.u18.p203==1))||(i22.u217.p1911==1))||(i0.u9.p109==1))&&(i15.u153.p1384==1)))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t328, i0.t448, i0.t445, i0.t442, i0.t2, i0.t1, i0.t0, i0.u2.t440, i0.u1.t231, i0.u9.t152, i0.u8.t153, i1.t5, i1.t4, i1.t3, i1.u10.t236, i2.t237, i2.t151, i2.t8, i2.t7, i2.t6, i2.u19.t242, i3.t11, i3.t10, i3.t9, i3.u27.t247, i4.u35.t253, i4.u40.t149, i4.u36.t12, i4.u37.t13, i4.u38.t14, i4.u39.t150, i5.i0.t15, i5.i0.t16, i5.i0.t17, i5.i0.i2.u41.t258, i5.i1.t18, i5.i1.t19, i5.i1.t20, i5.i1.i1.t510, i5.i1.i2.t512, i5.i1.i2.u49.t263, i6.t523, i6.t522, i6.t265, i6.t147, i6.t23, i6.t22, i6.u66.t146, i6.u58.t270, i6.u59.t148, i7.t529, i7.t26, i7.t25, i7.t24, i7.u74.t534, i7.u68.t275, i7.u75.t145, i8.t197, i8.t28, i8.t27, i8.u76.t279, i9.t31, i9.t30, i9.t29, i9.u85.t285, i10.t34, i10.t33, i10.t32, i10.u93.t290, i11.t139, i11.t138, i11.t37, i11.t36, i11.t35, i11.u103.t140, i11.u110.t137, i12.t40, i12.t39, i12.t38, i12.u119.t587, i12.u119.t588, i12.u112.t136, i13.t43, i13.t42, i13.t41, i13.u128.t198, i14.i0.t44, i14.i0.t45, i14.i0.t46, i14.i0.i1.u130.t310, i14.i1.t47, i14.i1.t48, i14.i1.t49, i14.i1.i1.u138.t315, i15.t321, i15.t317, i15.t52, i15.t51, i15.t50, i15.u153.t319, i15.u154.t133, i16.t55, i16.t54, i16.t53, i16.u156.t327, i16.u164.t655, i16.u164.t656, i17.t58, i17.t57, i17.t56, i17.u165.t332, i17.u173.t131, i18.t61, i18.t60, i18.t59, i18.u176.t338, i19.t126, i19.t64, i19.t63, i19.t62, i19.u191.t128, i19.u191.t129, i20.t344, i20.t67, i20.t66, i20.t65, i20.u194.t349, i20.u201.t201, i21.t70, i21.t69, i21.t68, i21.u203.t354, i22.t73, i22.t71, i22.u212.t357, i22.u221.t122, i22.u216.t72, i22.u220.t719, i22.u220.t720, i23.t76, i23.t75, i23.t74, i23.u222.t362, i24.i0.t77, i24.i0.t78, i24.i0.t79, i24.i0.i2.u230.t368, i24.i1.t80, i24.i1.t81, i24.i1.t82, i24.i1.i2.u238.t373, i25.t374, i25.t203, i25.t84, i25.t83, i25.u247.t380, i26.i0.t85, i26.i0.t86, i26.i0.t87, i26.i0.i1.u255.t385, i26.i1.t88, i26.i1.t89, i26.i1.t90, i26.i1.i2.u263.t390, i27.t93, i27.t92, i27.t91, i27.u271.t395, i27.u278.t807, i27.u278.t808, i28.t96, i28.t95, i28.t94, i28.u286.t121, i29.t405, i29.t99, i29.t98, i29.t97, i29.u295.t119, i30.t102, i30.t101, i30.u297.t410, i30.u298.t100, i30.u303.t221, i31.t105, i31.t104, i31.t103, i31.u306.t415, i32.t108, i32.t107, i32.t106, i32.u314.t420, i33.t427, i33.t111, i33.t110, i33.t109, i33.u323.t426, i34.i0.t112, i34.i0.t428, i34.i0.i0.t113, i34.i0.i0.u341.t431, i34.i1.i1.t900, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/531/202/733
Detected timeout of ITS tools.
[2021-06-05 21:14:16] [INFO ] Flatten gal took : 57 ms
[2021-06-05 21:14:16] [INFO ] Flatten gal took : 59 ms
[2021-06-05 21:14:17] [INFO ] Applying decomposition
[2021-06-05 21:14:17] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2919849136416719091.txt, -o, /tmp/graph2919849136416719091.bin, -w, /tmp/graph2919849136416719091.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2919849136416719091.bin, -l, -1, -v, -w, /tmp/graph2919849136416719091.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-05 21:14:17] [INFO ] Decomposing Gal with order
[2021-06-05 21:14:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-05 21:14:17] [INFO ] Removed a total of 315 redundant transitions.
[2021-06-05 21:14:17] [INFO ] Flatten gal took : 128 ms
[2021-06-05 21:14:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-06-05 21:14:17] [INFO ] Time to serialize gal into /tmp/CTLFireability4120142391367611992.gal : 15 ms
[2021-06-05 21:14:17] [INFO ] Time to serialize properties into /tmp/CTLFireability441855393430959673.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability4120142391367611992.gal, -t, CGAL, -ctl, /tmp/CTLFireability441855393430959673.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability4120142391367611992.gal -t CGAL -ctl /tmp/CTLFireability441855393430959673.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
Detected timeout of ITS tools.
[2021-06-05 21:36:45] [INFO ] Applying decomposition
[2021-06-05 21:36:46] [INFO ] Flatten gal took : 290 ms
[2021-06-05 21:36:46] [INFO ] Decomposing Gal with order
[2021-06-05 21:36:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-05 21:36:47] [INFO ] Removed a total of 79 redundant transitions.
[2021-06-05 21:36:48] [INFO ] Flatten gal took : 1126 ms
[2021-06-05 21:36:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 316 labels/synchronizations in 54 ms.
[2021-06-05 21:36:53] [INFO ] Time to serialize gal into /tmp/CTLFireability8666236933003805582.gal : 21 ms
[2021-06-05 21:36:53] [INFO ] Time to serialize properties into /tmp/CTLFireability1722196250121873609.ctl : 22 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8666236933003805582.gal, -t, CGAL, -ctl, /tmp/CTLFireability1722196250121873609.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8666236933003805582.gal -t CGAL -ctl /tmp/CTLFireability1722196250121873609.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
Detected timeout of ITS tools.
[2021-06-05 21:59:32] [INFO ] Flatten gal took : 657 ms
[2021-06-05 21:59:34] [INFO ] Input system was already deterministic with 2525 transitions.
[2021-06-05 21:59:34] [INFO ] Transformed 2805 places.
[2021-06-05 21:59:34] [INFO ] Transformed 2525 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//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/bin//..//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
[2021-06-05 21:59:35] [INFO ] Time to serialize gal into /tmp/CTLFireability2508509706682011446.gal : 10 ms
[2021-06-05 21:59:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11666732018674999079.ctl : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2508509706682011446.gal, -t, CGAL, -ctl, /tmp/CTLFireability11666732018674999079.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2508509706682011446.gal -t CGAL -ctl /tmp/CTLFireability11666732018674999079.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ShieldPPPt-PT-040B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 ShieldPPPt-PT-040B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r216-tall-162098205700869"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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