Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r092-tall-171624189900738.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DES-PT-50b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189900738
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 08:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 204K Apr 12 08:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 08:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 127K May 18 16:42 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 DES-PT-50b-CTLFireability-2024-00
FORMULA_NAME DES-PT-50b-CTLFireability-2024-01
FORMULA_NAME DES-PT-50b-CTLFireability-2024-02
FORMULA_NAME DES-PT-50b-CTLFireability-2024-03
FORMULA_NAME DES-PT-50b-CTLFireability-2024-04
FORMULA_NAME DES-PT-50b-CTLFireability-2024-05
FORMULA_NAME DES-PT-50b-CTLFireability-2024-06
FORMULA_NAME DES-PT-50b-CTLFireability-2024-07
FORMULA_NAME DES-PT-50b-CTLFireability-2024-08
FORMULA_NAME DES-PT-50b-CTLFireability-2024-09
FORMULA_NAME DES-PT-50b-CTLFireability-2024-10
FORMULA_NAME DES-PT-50b-CTLFireability-2024-11
FORMULA_NAME DES-PT-50b-CTLFireability-2023-12
FORMULA_NAME DES-PT-50b-CTLFireability-2023-13
FORMULA_NAME DES-PT-50b-CTLFireability-2023-14
FORMULA_NAME DES-PT-50b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716358918205

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 06:21:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 06:21:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 06:21:59] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-22 06:21:59] [INFO ] Transformed 479 places.
[2024-05-22 06:21:59] [INFO ] Transformed 430 transitions.
[2024-05-22 06:21:59] [INFO ] Found NUPN structural information;
[2024-05-22 06:21:59] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 135 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 430/430 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 476 transition count 430
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 460 transition count 414
Iterating global reduction 1 with 16 rules applied. Total rules applied 35 place count 460 transition count 414
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 455 transition count 409
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 455 transition count 409
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 455 transition count 405
Applied a total of 49 rules in 106 ms. Remains 455 /479 variables (removed 24) and now considering 405/430 (removed 25) transitions.
// Phase 1: matrix 405 rows 455 cols
[2024-05-22 06:21:59] [INFO ] Computed 62 invariants in 56 ms
[2024-05-22 06:22:00] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-22 06:22:00] [INFO ] Invariant cache hit.
[2024-05-22 06:22:00] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
Running 404 sub problems to find dead transitions.
[2024-05-22 06:22:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 404 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (OVERLAPS) 405/860 variables, 455/517 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 06:22:11] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 19 ms to minimize.
[2024-05-22 06:22:11] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:22:12] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:22:12] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-22 06:22:12] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:22:12] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:22:12] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:22:12] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:22:12] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:22:13] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 2 ms to minimize.
[2024-05-22 06:22:13] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:22:13] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:22:13] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:22:13] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2024-05-22 06:22:13] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-05-22 06:22:14] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-22 06:22:14] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-22 06:22:14] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:22:14] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:22:14] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/860 variables, 20/537 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 06:22:16] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:22:17] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-22 06:22:17] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2024-05-22 06:22:17] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-22 06:22:17] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-22 06:22:17] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-22 06:22:18] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/860 variables, 7/544 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 06:22:23] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:22:23] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:22:23] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:22:23] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:22:23] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:22:24] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:22:24] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:22:24] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 4 ms to minimize.
[2024-05-22 06:22:24] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/860 variables, 9/553 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 860/860 variables, and 553 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 455/455 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 36/98 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 06:22:34] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-22 06:22:34] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:22:35] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:22:35] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 5 ms to minimize.
[2024-05-22 06:22:35] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-22 06:22:36] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:22:36] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-22 06:22:38] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 06:22:39] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:22:39] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:22:39] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:22:40] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-22 06:22:40] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 06:22:44] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 9 (OVERLAPS) 405/860 variables, 455/567 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/860 variables, 404/971 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 860/860 variables, and 971 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 455/455 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 50/50 constraints]
After SMT, in 60359ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 60375ms
Starting structural reductions in LTL mode, iteration 1 : 455/479 places, 405/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61414 ms. Remains : 455/479 places, 405/430 transitions.
Support contains 135 out of 455 places after structural reductions.
[2024-05-22 06:23:01] [INFO ] Flatten gal took : 82 ms
[2024-05-22 06:23:01] [INFO ] Flatten gal took : 56 ms
[2024-05-22 06:23:01] [INFO ] Input system was already deterministic with 405 transitions.
Support contains 133 out of 455 places (down from 135) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 93 to 92
RANDOM walk for 40000 steps (334 resets) in 2237 ms. (17 steps per ms) remains 51/92 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 51/51 properties
[2024-05-22 06:23:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 79/144 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 87/231 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 206/437 variables, 28/61 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 1/438 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 9 (OVERLAPS) 390/828 variables, 438/500 constraints. Problems are: Problem set: 1 solved, 50 unsolved
[2024-05-22 06:23:04] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2024-05-22 06:23:05] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-05-22 06:23:05] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
Problem AtomicPropp33 is UNSAT
[2024-05-22 06:23:05] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/828 variables, 4/504 constraints. Problems are: Problem set: 2 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/828 variables, 0/504 constraints. Problems are: Problem set: 2 solved, 49 unsolved
SMT process timed out in 5073ms, After SMT, problems are : Problem set: 2 solved, 49 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 405/405 transitions.
Graph (complete) has 1054 edges and 455 vertex of which 447 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 447 transition count 386
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 27 place count 435 transition count 386
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 27 place count 435 transition count 376
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 47 place count 425 transition count 376
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 56 place count 416 transition count 367
Iterating global reduction 2 with 9 rules applied. Total rules applied 65 place count 416 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 416 transition count 366
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 66 place count 416 transition count 365
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 415 transition count 365
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 74 place count 409 transition count 359
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 409 transition count 359
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 87 place count 409 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 88 place count 408 transition count 352
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 88 place count 408 transition count 351
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 90 place count 407 transition count 351
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 130 rules applied. Total rules applied 220 place count 342 transition count 286
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 228 place count 338 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 236 place count 338 transition count 294
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 237 place count 338 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 238 place count 337 transition count 293
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 239 place count 337 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 240 place count 336 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 241 place count 335 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 242 place count 334 transition count 291
Applied a total of 242 rules in 214 ms. Remains 334 /455 variables (removed 121) and now considering 291/405 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 334/455 places, 291/405 transitions.
RANDOM walk for 40000 steps (1214 resets) in 768 ms. (52 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (22 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (19 resets) in 11 ms. (333 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (19 resets) in 11 ms. (333 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (19 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (19 resets) in 11 ms. (333 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (18 resets) in 10 ms. (364 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (17 resets) in 10 ms. (364 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (19 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (23 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (20 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (14 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (17 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (18 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (21 resets) in 10 ms. (364 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (18 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (18 resets) in 28 ms. (138 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (18 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (21 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (15 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (17 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (21 resets) in 11 ms. (333 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (18 resets) in 11 ms. (333 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (19 resets) in 27 ms. (143 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (18 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (23 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (24 resets) in 13 ms. (286 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (18 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
Interrupted probabilistic random walk after 611251 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 48
Probabilistic random walk after 611251 steps, saw 86236 distinct states, run finished after 3018 ms. (steps per millisecond=202 ) properties seen :0
// Phase 1: matrix 291 rows 334 cols
[2024-05-22 06:23:11] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 06:23:11] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 47/106 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 50/156 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 138/294 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem AtomicPropp46 is UNSAT
At refinement iteration 7 (OVERLAPS) 291/585 variables, 294/354 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 12/366 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 06:23:13] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 1/367 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 06:23:14] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 1/368 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 40/625 variables, 40/408 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/625 variables, 0/408 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 14 (OVERLAPS) 0/625 variables, 0/408 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 625/625 variables, and 408 constraints, problems are : Problem set: 1 solved, 47 unsolved in 8819 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 334/334 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 47 unsolved
Problem AtomicPropp81 is UNSAT
At refinement iteration 1 (OVERLAPS) 47/105 variables, 18/18 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 50/155 variables, 18/36 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 139/294 variables, 24/60 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 2/62 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 291/585 variables, 294/356 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 12/368 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 36/404 constraints. Problems are: Problem set: 2 solved, 46 unsolved
[2024-05-22 06:23:33] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-22 06:23:35] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-22 06:23:39] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:23:39] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:23:39] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-22 06:23:39] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:23:39] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:23:39] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 8/412 constraints. Problems are: Problem set: 2 solved, 46 unsolved
[2024-05-22 06:23:52] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 3 ms to minimize.
[2024-05-22 06:23:53] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:23:53] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:23:53] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:23:53] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-22 06:23:54] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:23:54] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:23:57] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:23:59] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 9/421 constraints. Problems are: Problem set: 2 solved, 46 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/625 variables, and 421 constraints, problems are : Problem set: 2 solved, 46 unsolved in 45006 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 294/334 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 36/48 constraints, Known Traps: 19/19 constraints]
After SMT, in 53876ms problems are : Problem set: 2 solved, 46 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 291/291 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 334 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 333 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 333 transition count 289
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 332 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 330 transition count 287
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 330 transition count 286
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 329 transition count 285
Applied a total of 11 rules in 30 ms. Remains 329 /334 variables (removed 5) and now considering 285/291 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 329/334 places, 285/291 transitions.
RANDOM walk for 40000 steps (1341 resets) in 495 ms. (80 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (22 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (24 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (18 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (13 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (23 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (20 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (23 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (19 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (22 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (18 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (25 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (24 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (19 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (19 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (24 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (21 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (21 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (22 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (18 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (23 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (22 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (19 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (25 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (23 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (19 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (21 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (23 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (21 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
Interrupted probabilistic random walk after 641471 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :0 out of 46
Probabilistic random walk after 641471 steps, saw 90752 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
// Phase 1: matrix 285 rows 329 cols
[2024-05-22 06:24:08] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 06:24:08] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 26/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 70/150 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 139/289 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 285/574 variables, 289/349 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 12/361 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 40/614 variables, 40/401 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 06:24:12] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-22 06:24:12] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/614 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/614 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 13 (OVERLAPS) 0/614 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/614 variables, and 403 constraints, problems are : Problem set: 0 solved, 46 unsolved in 6741 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 26/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 70/150 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 139/289 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 06:24:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 285/574 variables, 289/352 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 12/364 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 36/400 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:24:33] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:24:34] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 11/411 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 06:24:54] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/574 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 15 (OVERLAPS) 40/614 variables, 40/452 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/614 variables, and 462 constraints, problems are : Problem set: 0 solved, 46 unsolved in 75012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 15/15 constraints]
After SMT, in 81837ms problems are : Problem set: 0 solved, 46 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 285/285 transitions.
Applied a total of 0 rules in 10 ms. Remains 329 /329 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 329/329 places, 285/285 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 285/285 transitions.
Applied a total of 0 rules in 9 ms. Remains 329 /329 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-05-22 06:25:30] [INFO ] Invariant cache hit.
[2024-05-22 06:25:30] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 06:25:30] [INFO ] Invariant cache hit.
[2024-05-22 06:25:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 06:25:31] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2024-05-22 06:25:31] [INFO ] Redundant transitions in 15 ms returned []
Running 282 sub problems to find dead transitions.
[2024-05-22 06:25:31] [INFO ] Invariant cache hit.
[2024-05-22 06:25:31] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 3/329 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 285/614 variables, 329/389 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 12/401 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 282 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/614 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/614 variables, and 401 constraints, problems are : Problem set: 0 solved, 282 unsolved in 23356 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 3/329 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 285/614 variables, 329/389 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 12/401 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 282/683 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-22 06:26:07] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-22 06:26:08] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 3 ms to minimize.
[2024-05-22 06:26:08] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-22 06:26:08] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:26:09] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2024-05-22 06:26:09] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:26:10] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:26:10] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:26:15] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:26:18] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:26:18] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/614 variables, and 694 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 11/11 constraints]
After SMT, in 53543ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 53546ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54021 ms. Remains : 329/329 places, 285/285 transitions.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-22 06:26:24] [INFO ] Flatten gal took : 23 ms
[2024-05-22 06:26:24] [INFO ] Flatten gal took : 24 ms
[2024-05-22 06:26:24] [INFO ] Input system was already deterministic with 405 transitions.
Computed a total of 259 stabilizing places and 251 stable transitions
Graph (complete) has 1054 edges and 455 vertex of which 447 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.17 ms
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 445 transition count 395
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 445 transition count 395
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 445 transition count 393
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 438 transition count 386
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 438 transition count 386
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 41 place count 438 transition count 381
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 437 transition count 380
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 437 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 437 transition count 379
Applied a total of 44 rules in 64 ms. Remains 437 /455 variables (removed 18) and now considering 379/405 (removed 26) transitions.
// Phase 1: matrix 379 rows 437 cols
[2024-05-22 06:26:24] [INFO ] Computed 62 invariants in 13 ms
[2024-05-22 06:26:25] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-22 06:26:25] [INFO ] Invariant cache hit.
[2024-05-22 06:26:25] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2024-05-22 06:26:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/436 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/437 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (OVERLAPS) 379/816 variables, 437/499 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-22 06:26:34] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:26:35] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-22 06:26:35] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:26:35] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:26:36] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:26:38] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-22 06:26:38] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:26:38] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-22 06:26:38] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:26:39] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:26:39] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-05-22 06:26:39] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-22 06:26:40] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 2 ms to minimize.
[2024-05-22 06:26:40] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:26:40] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:26:40] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:26:40] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:26:40] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:26:40] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/816 variables, 19/518 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-22 06:26:47] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:26:47] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-22 06:26:50] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:26:50] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:26:51] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:26:51] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-22 06:26:51] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:26:51] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:26:51] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 816/816 variables, and 527 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/436 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/437 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 28/90 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-22 06:26:59] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:26:59] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:26:59] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:26:59] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:26:59] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:26:59] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:26:59] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-22 06:26:59] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:27:00] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:27:00] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:27:00] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:27:00] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:27:00] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:27:00] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:27:00] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:27:00] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:27:01] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:27:01] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:27:01] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 19/109 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-22 06:27:03] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-22 06:27:03] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-22 06:27:03] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:27:03] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-22 06:27:04] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:27:04] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:27:04] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:27:04] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:27:04] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:27:04] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 10/119 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (OVERLAPS) 379/816 variables, 437/556 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 378/934 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/816 variables, and 934 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 57/57 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 60227ms
Starting structural reductions in LTL mode, iteration 1 : 437/455 places, 379/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61148 ms. Remains : 437/455 places, 379/405 transitions.
[2024-05-22 06:27:26] [INFO ] Flatten gal took : 31 ms
[2024-05-22 06:27:26] [INFO ] Flatten gal took : 17 ms
[2024-05-22 06:27:26] [INFO ] Input system was already deterministic with 379 transitions.
[2024-05-22 06:27:26] [INFO ] Flatten gal took : 16 ms
[2024-05-22 06:27:26] [INFO ] Flatten gal took : 16 ms
[2024-05-22 06:27:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5434018999092729765.gal : 11 ms
[2024-05-22 06:27:26] [INFO ] Time to serialize properties into /tmp/CTLFireability4236923189045124991.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5434018999092729765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4236923189045124991.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:27:56] [INFO ] Flatten gal took : 16 ms
[2024-05-22 06:27:56] [INFO ] Applying decomposition
[2024-05-22 06:27:56] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7267831285437018157.txt' '-o' '/tmp/graph7267831285437018157.bin' '-w' '/tmp/graph7267831285437018157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7267831285437018157.bin' '-l' '-1' '-v' '-w' '/tmp/graph7267831285437018157.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:27:56] [INFO ] Decomposing Gal with order
[2024-05-22 06:27:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:27:56] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 06:27:56] [INFO ] Flatten gal took : 412 ms
[2024-05-22 06:27:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2024-05-22 06:27:56] [INFO ] Time to serialize gal into /tmp/CTLFireability17742849318893493209.gal : 6 ms
[2024-05-22 06:27:56] [INFO ] Time to serialize properties into /tmp/CTLFireability12202607217329734446.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17742849318893493209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12202607217329734446.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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,1.35077e+21,4.69894,149532,12798,6111,352864,33156,694,275324,485,220070,0


Converting to forward existential form...Done !
original formula: (EG((((EF(AG(((i8.u77.p74==1)&&(i8.u77.p471==1)))) + AX(((((i2.u9.p204==1)&&(i2.u9.p229==1))||((i2.u9.p183==1)&&(i2.u9.p229==1))) * A(((i...775
=> equivalent forward existential formula: ([(Init * !(EG((((E(TRUE U !(E(TRUE U !(((i8.u77.p74==1)&&(i8.u77.p471==1)))))) + !(EX(!(((((i2.u9.p204==1)&&(i2...999
Reverse transition relation is NOT exact ! Due to transitions t0, t281, t339, t340, t372, u32.t79, u34.t76, i1.i0.t123, i1.i0.u7.t128, i1.i0.u7.t129, i1.i0...1346
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 443 transition count 393
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 443 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 443 transition count 391
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 434 transition count 382
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 434 transition count 382
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 51 place count 434 transition count 375
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 433 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 433 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 433 transition count 373
Applied a total of 54 rules in 42 ms. Remains 433 /455 variables (removed 22) and now considering 373/405 (removed 32) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:28:27] [INFO ] Computed 62 invariants in 14 ms
[2024-05-22 06:28:27] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-22 06:28:27] [INFO ] Invariant cache hit.
[2024-05-22 06:28:27] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:28:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:28:34] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 06:28:34] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:28:34] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:28:35] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:28:35] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:28:35] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-22 06:28:35] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:28:35] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-22 06:28:35] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:28:35] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:28:35] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:28:35] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-22 06:28:36] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:28:36] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:28:36] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:28:36] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:28:36] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:28:36] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:28:37] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-22 06:28:37] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:28:39] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:28:39] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:28:40] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:28:43] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:28:47] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-22 06:28:47] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2024-05-22 06:28:47] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 2 ms to minimize.
[2024-05-22 06:28:48] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:28:48] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:28:48] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:29:01] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:29:01] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-05-22 06:29:01] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-22 06:29:01] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:29:01] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2024-05-22 06:29:01] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2024-05-22 06:29:01] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:29:01] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:29:01] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-22 06:29:02] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:29:02] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:29:02] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-22 06:29:02] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:29:02] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:29:02] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:29:02] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:29:02] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:29:02] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:29:02] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-22 06:29:02] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:29:03] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:29:03] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:29:03] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:29:03] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:29:03] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:29:03] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:29:03] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:29:03] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:29:03] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:29:03] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:29:03] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:29:03] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:29:04] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:29:06] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:29:07] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:29:08] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:29:08] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:29:08] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:29:08] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:29:10] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2024-05-22 06:29:11] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-22 06:29:11] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:29:14] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60227ms
Starting structural reductions in LTL mode, iteration 1 : 433/455 places, 373/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61055 ms. Remains : 433/455 places, 373/405 transitions.
[2024-05-22 06:29:28] [INFO ] Flatten gal took : 12 ms
[2024-05-22 06:29:28] [INFO ] Flatten gal took : 13 ms
[2024-05-22 06:29:28] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-22 06:29:28] [INFO ] Flatten gal took : 13 ms
[2024-05-22 06:29:28] [INFO ] Flatten gal took : 12 ms
[2024-05-22 06:29:28] [INFO ] Time to serialize gal into /tmp/CTLFireability18301971629305818929.gal : 2 ms
[2024-05-22 06:29:28] [INFO ] Time to serialize properties into /tmp/CTLFireability11626451480900451520.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18301971629305818929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11626451480900451520.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:29:58] [INFO ] Flatten gal took : 13 ms
[2024-05-22 06:29:58] [INFO ] Applying decomposition
[2024-05-22 06:29:58] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph549951639564895646.txt' '-o' '/tmp/graph549951639564895646.bin' '-w' '/tmp/graph549951639564895646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph549951639564895646.bin' '-l' '-1' '-v' '-w' '/tmp/graph549951639564895646.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:29:58] [INFO ] Decomposing Gal with order
[2024-05-22 06:29:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:29:58] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 06:29:58] [INFO ] Flatten gal took : 34 ms
[2024-05-22 06:29:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 19 ms.
[2024-05-22 06:29:58] [INFO ] Time to serialize gal into /tmp/CTLFireability3123957163869414589.gal : 8 ms
[2024-05-22 06:29:58] [INFO ] Time to serialize properties into /tmp/CTLFireability8979029711685909589.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3123957163869414589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8979029711685909589.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,7.51175e+20,7.18427,227800,27845,6113,566233,37861,654,406051,483,258626,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 444 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 444 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 444 transition count 392
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 436 transition count 384
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 436 transition count 384
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 47 place count 436 transition count 377
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 435 transition count 376
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 435 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 435 transition count 375
Applied a total of 50 rules in 32 ms. Remains 435 /455 variables (removed 20) and now considering 375/405 (removed 30) transitions.
// Phase 1: matrix 375 rows 435 cols
[2024-05-22 06:30:28] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 06:30:28] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-22 06:30:28] [INFO ] Invariant cache hit.
[2024-05-22 06:30:29] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2024-05-22 06:30:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 375/810 variables, 435/497 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:30:35] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 3 ms to minimize.
[2024-05-22 06:30:36] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:30:36] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-22 06:30:36] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-22 06:30:36] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:30:36] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:30:36] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:30:36] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:30:36] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:30:36] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:30:37] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-22 06:30:37] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:30:37] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-22 06:30:37] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-22 06:30:38] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-22 06:30:38] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-05-22 06:30:38] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:30:38] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:30:39] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 6 ms to minimize.
[2024-05-22 06:30:39] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 20/517 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:30:40] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:30:40] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:30:40] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:30:43] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
[2024-05-22 06:30:43] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/810 variables, 5/522 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:30:47] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:30:47] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:30:47] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:30:47] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:30:47] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:30:47] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:30:47] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:30:47] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:30:47] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:30:49] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/810 variables, 10/532 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:30:54] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/810 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/810 variables, and 533 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 36/98 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:31:02] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:31:02] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:31:02] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:31:02] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:31:03] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-22 06:31:05] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:31:05] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 7/105 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:31:06] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-05-22 06:31:06] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:31:06] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-22 06:31:06] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:31:09] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 9 (OVERLAPS) 375/810 variables, 435/545 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/810 variables, 374/919 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/810 variables, and 919 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 48/48 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Starting structural reductions in LTL mode, iteration 1 : 435/455 places, 375/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61080 ms. Remains : 435/455 places, 375/405 transitions.
[2024-05-22 06:31:29] [INFO ] Flatten gal took : 20 ms
[2024-05-22 06:31:29] [INFO ] Flatten gal took : 12 ms
[2024-05-22 06:31:29] [INFO ] Input system was already deterministic with 375 transitions.
[2024-05-22 06:31:29] [INFO ] Flatten gal took : 11 ms
[2024-05-22 06:31:29] [INFO ] Flatten gal took : 11 ms
[2024-05-22 06:31:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3088492948922598612.gal : 2 ms
[2024-05-22 06:31:29] [INFO ] Time to serialize properties into /tmp/CTLFireability16977391597044197173.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3088492948922598612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16977391597044197173.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:31:59] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:31:59] [INFO ] Applying decomposition
[2024-05-22 06:31:59] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3998299379041820619.txt' '-o' '/tmp/graph3998299379041820619.bin' '-w' '/tmp/graph3998299379041820619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3998299379041820619.bin' '-l' '-1' '-v' '-w' '/tmp/graph3998299379041820619.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:31:59] [INFO ] Decomposing Gal with order
[2024-05-22 06:31:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:31:59] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-22 06:31:59] [INFO ] Flatten gal took : 31 ms
[2024-05-22 06:31:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 13 ms.
[2024-05-22 06:31:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1649609752649382966.gal : 9 ms
[2024-05-22 06:31:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5497115896514460302.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1649609752649382966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5497115896514460302.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,7.6308e+20,4.64799,149476,11845,6030,321300,32573,685,337377,447,264444,0


Converting to forward existential form...Done !
original formula: EX((EG((((i3.u20.p278==1) + EX(((u32.p20==1)&&(u32.p330==1)))) * EX((i0.u3.p208==1)))) + AF(((u73.p60==1)&&(u73.p471==1)))))
=> equivalent forward existential formula: ([FwdG(EY(Init),(((i3.u20.p278==1) + EX(((u32.p20==1)&&(u32.p330==1)))) * EX((i0.u3.p208==1))))] != FALSE + [(EY...215
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t278, t335, t336, t368, u31.t79, u32.t76, u73.t17, i1.t120, i1.u12.t113, i1.u14.t110...1272
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 444 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 444 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 444 transition count 392
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 436 transition count 384
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 436 transition count 384
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 46 place count 436 transition count 378
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 435 transition count 377
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 435 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 435 transition count 376
Applied a total of 49 rules in 30 ms. Remains 435 /455 variables (removed 20) and now considering 376/405 (removed 29) transitions.
// Phase 1: matrix 376 rows 435 cols
[2024-05-22 06:32:29] [INFO ] Computed 62 invariants in 8 ms
[2024-05-22 06:32:30] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 06:32:30] [INFO ] Invariant cache hit.
[2024-05-22 06:32:30] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-05-22 06:32:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 375 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 376/811 variables, 435/497 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:32:40] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-22 06:32:40] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:32:40] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-05-22 06:32:40] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-22 06:32:40] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:32:40] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:32:40] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:32:40] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:32:40] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:32:40] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:32:40] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:32:41] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:32:41] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:32:41] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:32:41] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:32:42] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-22 06:32:42] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-22 06:32:42] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-22 06:32:42] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-22 06:32:42] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 20/517 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:32:44] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:32:44] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-22 06:32:44] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-22 06:32:45] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-22 06:32:45] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:32:45] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:32:45] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:32:45] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:32:47] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:32:47] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:32:48] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/811 variables, 11/528 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:32:51] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-22 06:32:51] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2024-05-22 06:32:52] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 3 ms to minimize.
[2024-05-22 06:32:52] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-22 06:32:52] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:32:52] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:32:53] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/811 variables, 7/535 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/811 variables, and 535 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:33:04] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:33:04] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:33:04] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:33:04] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-22 06:33:04] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-22 06:33:04] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-22 06:33:05] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 7/107 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (OVERLAPS) 376/811 variables, 435/542 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/811 variables, 375/917 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/811 variables, and 917 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 45/45 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Starting structural reductions in LTL mode, iteration 1 : 435/455 places, 376/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60984 ms. Remains : 435/455 places, 376/405 transitions.
[2024-05-22 06:33:30] [INFO ] Flatten gal took : 11 ms
[2024-05-22 06:33:30] [INFO ] Flatten gal took : 15 ms
[2024-05-22 06:33:30] [INFO ] Input system was already deterministic with 376 transitions.
[2024-05-22 06:33:30] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:33:30] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:33:30] [INFO ] Time to serialize gal into /tmp/CTLFireability15738052599297263918.gal : 2 ms
[2024-05-22 06:33:30] [INFO ] Time to serialize properties into /tmp/CTLFireability6462190849525006902.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15738052599297263918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6462190849525006902.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:34:01] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:34:01] [INFO ] Applying decomposition
[2024-05-22 06:34:01] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11506455249135207181.txt' '-o' '/tmp/graph11506455249135207181.bin' '-w' '/tmp/graph11506455249135207181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11506455249135207181.bin' '-l' '-1' '-v' '-w' '/tmp/graph11506455249135207181.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:34:01] [INFO ] Decomposing Gal with order
[2024-05-22 06:34:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:34:01] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 06:34:01] [INFO ] Flatten gal took : 17 ms
[2024-05-22 06:34:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 06:34:01] [INFO ] Time to serialize gal into /tmp/CTLFireability466935778676184627.gal : 3 ms
[2024-05-22 06:34:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14241345733686753378.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability466935778676184627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14241345733686753378.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 443 transition count 393
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 443 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 443 transition count 391
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 434 transition count 382
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 434 transition count 382
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 51 place count 434 transition count 375
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 433 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 433 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 433 transition count 373
Applied a total of 54 rules in 28 ms. Remains 433 /455 variables (removed 22) and now considering 373/405 (removed 32) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:34:31] [INFO ] Computed 62 invariants in 13 ms
[2024-05-22 06:34:31] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-22 06:34:31] [INFO ] Invariant cache hit.
[2024-05-22 06:34:31] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:34:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:34:38] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-22 06:34:38] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:34:38] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:34:38] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:34:39] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-22 06:34:39] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-22 06:34:39] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:34:39] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:34:39] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:34:39] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-22 06:34:39] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:34:39] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-22 06:34:39] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:34:40] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:34:40] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:34:40] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:34:40] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:34:40] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:34:40] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-22 06:34:41] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:34:43] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:34:43] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:34:44] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:34:47] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-22 06:34:51] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-05-22 06:34:51] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 3 ms to minimize.
[2024-05-22 06:34:51] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-05-22 06:34:51] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:34:52] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:34:52] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:35:05] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:35:05] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:35:05] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:35:05] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:35:05] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:35:05] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:35:05] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:35:05] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:35:05] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:35:06] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:35:06] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:35:06] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:35:06] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:35:06] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:35:06] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:35:06] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:35:06] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:35:06] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:35:07] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:35:07] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:35:07] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:35:07] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:35:07] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:35:07] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:35:07] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:35:07] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:35:07] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:35:07] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:35:07] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:35:08] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:35:08] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-22 06:35:08] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-22 06:35:08] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:35:10] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:35:11] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:35:12] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:35:12] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:35:12] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:35:12] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:35:15] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:35:15] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-22 06:35:15] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:35:18] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Starting structural reductions in LTL mode, iteration 1 : 433/455 places, 373/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60900 ms. Remains : 433/455 places, 373/405 transitions.
[2024-05-22 06:35:32] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:35:32] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:35:32] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-22 06:35:32] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:35:32] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:35:32] [INFO ] Time to serialize gal into /tmp/CTLFireability10162933861295289378.gal : 2 ms
[2024-05-22 06:35:32] [INFO ] Time to serialize properties into /tmp/CTLFireability2739504225012183098.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10162933861295289378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2739504225012183098.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:36:02] [INFO ] Flatten gal took : 11 ms
[2024-05-22 06:36:02] [INFO ] Applying decomposition
[2024-05-22 06:36:02] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2328247304854721590.txt' '-o' '/tmp/graph2328247304854721590.bin' '-w' '/tmp/graph2328247304854721590.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2328247304854721590.bin' '-l' '-1' '-v' '-w' '/tmp/graph2328247304854721590.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:36:02] [INFO ] Decomposing Gal with order
[2024-05-22 06:36:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:36:02] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 06:36:02] [INFO ] Flatten gal took : 16 ms
[2024-05-22 06:36:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-22 06:36:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9517665673310938648.gal : 3 ms
[2024-05-22 06:36:02] [INFO ] Time to serialize properties into /tmp/CTLFireability8070088172928663551.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9517665673310938648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8070088172928663551.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 444 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 444 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 444 transition count 392
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 436 transition count 384
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 436 transition count 384
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 46 place count 436 transition count 378
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 435 transition count 377
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 435 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 435 transition count 376
Applied a total of 49 rules in 30 ms. Remains 435 /455 variables (removed 20) and now considering 376/405 (removed 29) transitions.
// Phase 1: matrix 376 rows 435 cols
[2024-05-22 06:36:32] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 06:36:32] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-22 06:36:32] [INFO ] Invariant cache hit.
[2024-05-22 06:36:33] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-05-22 06:36:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 376/811 variables, 435/497 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:36:39] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:36:39] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-22 06:36:41] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-22 06:36:41] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:36:42] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:36:43] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-22 06:36:43] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 2 ms to minimize.
[2024-05-22 06:36:43] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:36:44] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 9/506 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:36:46] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:36:46] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-22 06:36:46] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-22 06:36:46] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:36:47] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-22 06:36:47] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/811 variables, 6/512 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:36:52] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:36:52] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:36:52] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:36:53] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:36:53] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:36:53] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-22 06:36:53] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-22 06:36:53] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-22 06:36:53] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/811 variables, 9/521 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:37:00] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:37:00] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:37:01] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:37:01] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/811 variables, and 525 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 28/90 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:37:06] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:37:06] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:37:06] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:37:06] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:37:06] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:37:07] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:37:07] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-22 06:37:07] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:37:07] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:37:07] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:37:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-22 06:37:07] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:37:10] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:37:11] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:37:11] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-22 06:37:13] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:37:13] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:37:14] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:37:14] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:37:17] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:37:17] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
[2024-05-22 06:37:17] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:37:17] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:37:18] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:37:22] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:37:25] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 12 (OVERLAPS) 376/811 variables, 435/551 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/811 variables, 375/926 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/811 variables, and 926 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 54/54 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Starting structural reductions in LTL mode, iteration 1 : 435/455 places, 376/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60948 ms. Remains : 435/455 places, 376/405 transitions.
[2024-05-22 06:37:33] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:37:33] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:37:33] [INFO ] Input system was already deterministic with 376 transitions.
[2024-05-22 06:37:33] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:37:33] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:37:33] [INFO ] Time to serialize gal into /tmp/CTLFireability345738941466385393.gal : 2 ms
[2024-05-22 06:37:33] [INFO ] Time to serialize properties into /tmp/CTLFireability9074215509793087377.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability345738941466385393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9074215509793087377.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:38:03] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:38:03] [INFO ] Applying decomposition
[2024-05-22 06:38:03] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16070009011757749818.txt' '-o' '/tmp/graph16070009011757749818.bin' '-w' '/tmp/graph16070009011757749818.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16070009011757749818.bin' '-l' '-1' '-v' '-w' '/tmp/graph16070009011757749818.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:38:03] [INFO ] Decomposing Gal with order
[2024-05-22 06:38:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:38:03] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 06:38:03] [INFO ] Flatten gal took : 16 ms
[2024-05-22 06:38:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 06:38:03] [INFO ] Time to serialize gal into /tmp/CTLFireability14742007602591797580.gal : 3 ms
[2024-05-22 06:38:03] [INFO ] Time to serialize properties into /tmp/CTLFireability18329030755524484517.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14742007602591797580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18329030755524484517.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 443 transition count 393
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 443 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 443 transition count 391
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 434 transition count 382
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 434 transition count 382
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 51 place count 434 transition count 375
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 433 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 433 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 433 transition count 373
Applied a total of 54 rules in 42 ms. Remains 433 /455 variables (removed 22) and now considering 373/405 (removed 32) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:38:33] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 06:38:33] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 06:38:33] [INFO ] Invariant cache hit.
[2024-05-22 06:38:34] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:38:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:38:41] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-22 06:38:41] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:38:41] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-22 06:38:41] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:38:41] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:38:41] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-22 06:38:41] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-22 06:38:41] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-22 06:38:42] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:38:42] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:38:42] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:38:42] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-22 06:38:42] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:38:42] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:38:42] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:38:42] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:38:42] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:38:43] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2024-05-22 06:38:43] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-22 06:38:43] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:38:45] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:38:46] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:38:46] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:38:50] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:38:53] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-22 06:38:53] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 3 ms to minimize.
[2024-05-22 06:38:54] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 2 ms to minimize.
[2024-05-22 06:38:54] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:38:54] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2024-05-22 06:38:54] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:39:08] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:39:08] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:39:08] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:39:08] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:39:08] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:39:08] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:39:08] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:39:08] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:39:08] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-22 06:39:09] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:39:09] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:39:09] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:39:09] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:39:09] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:39:09] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:39:09] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:39:09] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:39:09] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:39:09] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-22 06:39:09] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:39:10] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:39:10] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:39:10] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:39:10] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:39:10] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2024-05-22 06:39:10] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:39:10] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:39:10] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:39:10] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:39:10] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:39:11] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:39:11] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:39:11] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-22 06:39:13] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:39:14] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:39:15] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:39:15] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:39:15] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:39:15] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:39:17] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:39:18] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:39:18] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:39:21] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Starting structural reductions in LTL mode, iteration 1 : 433/455 places, 373/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60913 ms. Remains : 433/455 places, 373/405 transitions.
[2024-05-22 06:39:34] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:39:34] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:39:34] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-22 06:39:34] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:39:34] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:39:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17304753986000045628.gal : 2 ms
[2024-05-22 06:39:34] [INFO ] Time to serialize properties into /tmp/CTLFireability16292668718056780656.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17304753986000045628.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16292668718056780656.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:40:04] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:40:04] [INFO ] Applying decomposition
[2024-05-22 06:40:04] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11872278236408735526.txt' '-o' '/tmp/graph11872278236408735526.bin' '-w' '/tmp/graph11872278236408735526.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11872278236408735526.bin' '-l' '-1' '-v' '-w' '/tmp/graph11872278236408735526.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:40:04] [INFO ] Decomposing Gal with order
[2024-05-22 06:40:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:40:04] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 06:40:04] [INFO ] Flatten gal took : 34 ms
[2024-05-22 06:40:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 06:40:04] [INFO ] Time to serialize gal into /tmp/CTLFireability8628741745181013295.gal : 4 ms
[2024-05-22 06:40:04] [INFO ] Time to serialize properties into /tmp/CTLFireability9383512801648130448.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8628741745181013295.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9383512801648130448.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,7.51175e+20,7.72226,222520,19636,6114,509818,33148,626,430807,483,222498,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 443 transition count 393
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 443 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 443 transition count 391
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 434 transition count 382
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 434 transition count 382
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 51 place count 434 transition count 375
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 433 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 433 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 433 transition count 373
Applied a total of 54 rules in 30 ms. Remains 433 /455 variables (removed 22) and now considering 373/405 (removed 32) transitions.
[2024-05-22 06:40:34] [INFO ] Invariant cache hit.
[2024-05-22 06:40:35] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 06:40:35] [INFO ] Invariant cache hit.
[2024-05-22 06:40:35] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:40:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:40:42] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-22 06:40:42] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:40:42] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-22 06:40:42] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:40:42] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-22 06:40:42] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:40:42] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-22 06:40:43] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:40:43] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:40:43] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:40:43] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:40:43] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 3 ms to minimize.
[2024-05-22 06:40:43] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:40:43] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:40:43] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:40:44] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:40:44] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:40:44] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:40:44] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-22 06:40:44] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:40:47] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:40:47] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:40:47] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:40:51] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:40:54] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-22 06:40:54] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-22 06:40:55] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2024-05-22 06:40:55] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2024-05-22 06:40:55] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:40:55] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:41:08] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:41:09] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:41:09] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:41:09] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:41:09] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:41:09] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:41:09] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:41:09] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:41:09] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-22 06:41:09] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:41:10] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:41:10] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:41:10] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:41:10] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-22 06:41:10] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:41:10] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:41:10] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:41:10] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:41:10] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-22 06:41:10] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:41:11] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:41:11] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-22 06:41:11] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:41:11] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:41:11] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:41:11] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:41:11] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:41:11] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:41:11] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-05-22 06:41:11] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:41:11] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:41:11] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:41:11] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:41:14] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:41:15] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-05-22 06:41:15] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:41:16] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:41:16] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:41:16] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:41:18] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:41:19] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:41:19] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:41:22] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LTL mode, iteration 1 : 433/455 places, 373/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60891 ms. Remains : 433/455 places, 373/405 transitions.
[2024-05-22 06:41:35] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:41:35] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:41:35] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-22 06:41:35] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:41:35] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:41:35] [INFO ] Time to serialize gal into /tmp/CTLFireability3073190535671609433.gal : 1 ms
[2024-05-22 06:41:35] [INFO ] Time to serialize properties into /tmp/CTLFireability6912385277165051675.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3073190535671609433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6912385277165051675.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:42:05] [INFO ] Flatten gal took : 13 ms
[2024-05-22 06:42:05] [INFO ] Applying decomposition
[2024-05-22 06:42:05] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1870892696535930298.txt' '-o' '/tmp/graph1870892696535930298.bin' '-w' '/tmp/graph1870892696535930298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1870892696535930298.bin' '-l' '-1' '-v' '-w' '/tmp/graph1870892696535930298.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:42:05] [INFO ] Decomposing Gal with order
[2024-05-22 06:42:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:42:05] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 06:42:05] [INFO ] Flatten gal took : 15 ms
[2024-05-22 06:42:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 06:42:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8736554307051554775.gal : 3 ms
[2024-05-22 06:42:05] [INFO ] Time to serialize properties into /tmp/CTLFireability2651698192970099568.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8736554307051554775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2651698192970099568.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 444 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 444 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 444 transition count 393
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 435 transition count 384
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 435 transition count 384
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 48 place count 435 transition count 377
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 434 transition count 376
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 434 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 434 transition count 375
Applied a total of 51 rules in 28 ms. Remains 434 /455 variables (removed 21) and now considering 375/405 (removed 30) transitions.
// Phase 1: matrix 375 rows 434 cols
[2024-05-22 06:42:36] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 06:42:36] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-22 06:42:36] [INFO ] Invariant cache hit.
[2024-05-22 06:42:36] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2024-05-22 06:42:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/434 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 374 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 375/809 variables, 434/496 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:42:45] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-22 06:42:45] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:42:45] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-05-22 06:42:45] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:42:46] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 2 ms to minimize.
[2024-05-22 06:42:46] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:42:46] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:42:46] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:42:46] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:42:46] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:42:46] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-22 06:42:46] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:42:47] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-22 06:42:47] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-05-22 06:42:47] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-05-22 06:42:47] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-22 06:42:47] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:42:48] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:42:50] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:42:50] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 20/516 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:42:51] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:42:51] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:42:51] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
[2024-05-22 06:42:51] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-22 06:42:51] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:42:51] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-05-22 06:42:53] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 4 ms to minimize.
[2024-05-22 06:42:53] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2024-05-22 06:42:53] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:42:55] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:42:56] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2024-05-22 06:42:56] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:42:56] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/809 variables, 13/529 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:42:58] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-22 06:42:59] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-22 06:42:59] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:42:59] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:43:00] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-22 06:43:00] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:43:00] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:43:01] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:43:01] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:43:03] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/809 variables, 10/539 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:43:05] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:43:06] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:43:06] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:43:06] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:43:06] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 809/809 variables, and 544 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/434 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 48/110 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:43:09] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-05-22 06:43:09] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 3 ms to minimize.
[2024-05-22 06:43:10] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-22 06:43:10] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-22 06:43:10] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-22 06:43:10] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-22 06:43:10] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:43:10] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:43:11] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:43:11] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:43:13] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:43:14] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2024-05-22 06:43:14] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:43:15] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:43:17] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:43:18] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:43:18] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:43:21] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:43:21] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:43:22] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 10 (OVERLAPS) 375/809 variables, 434/564 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/809 variables, 374/938 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 809/809 variables, and 938 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 68/68 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 434/455 places, 375/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60823 ms. Remains : 434/455 places, 375/405 transitions.
[2024-05-22 06:43:36] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:43:36] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:43:36] [INFO ] Input system was already deterministic with 375 transitions.
[2024-05-22 06:43:36] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:43:36] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:43:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12213421928816805757.gal : 2 ms
[2024-05-22 06:43:36] [INFO ] Time to serialize properties into /tmp/CTLFireability13669685845477966129.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12213421928816805757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13669685845477966129.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:44:06] [INFO ] Flatten gal took : 14 ms
[2024-05-22 06:44:06] [INFO ] Applying decomposition
[2024-05-22 06:44:06] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11223517699746623728.txt' '-o' '/tmp/graph11223517699746623728.bin' '-w' '/tmp/graph11223517699746623728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11223517699746623728.bin' '-l' '-1' '-v' '-w' '/tmp/graph11223517699746623728.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:44:07] [INFO ] Decomposing Gal with order
[2024-05-22 06:44:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:44:07] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 06:44:07] [INFO ] Flatten gal took : 16 ms
[2024-05-22 06:44:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-22 06:44:07] [INFO ] Time to serialize gal into /tmp/CTLFireability2350986210912870880.gal : 3 ms
[2024-05-22 06:44:07] [INFO ] Time to serialize properties into /tmp/CTLFireability7302741338096256281.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2350986210912870880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7302741338096256281.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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.38936e+20,6.99154,184700,11973,6028,390683,31624,717,331791,458,261682,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 447 transition count 397
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 447 transition count 397
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 447 transition count 395
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 442 transition count 390
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 442 transition count 390
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 442 transition count 386
Applied a total of 32 rules in 23 ms. Remains 442 /455 variables (removed 13) and now considering 386/405 (removed 19) transitions.
// Phase 1: matrix 386 rows 442 cols
[2024-05-22 06:44:37] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 06:44:37] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-22 06:44:37] [INFO ] Invariant cache hit.
[2024-05-22 06:44:37] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Running 385 sub problems to find dead transitions.
[2024-05-22 06:44:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/442 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 385 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 5 (OVERLAPS) 386/828 variables, 442/504 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-05-22 06:44:47] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:44:47] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-05-22 06:44:47] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:44:48] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 3 ms to minimize.
[2024-05-22 06:44:48] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-22 06:44:48] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-05-22 06:44:48] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:44:48] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:44:48] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:44:48] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:44:48] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:44:48] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:44:49] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-22 06:44:49] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-05-22 06:44:49] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:44:49] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:44:49] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 4 ms to minimize.
[2024-05-22 06:44:49] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:44:49] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-05-22 06:44:50] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 20/524 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-05-22 06:44:50] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-05-22 06:44:57] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-22 06:44:57] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:44:57] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:44:57] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:44:57] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:44:57] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:44:57] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:44:57] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:44:57] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:44:58] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-05-22 06:44:58] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-05-22 06:44:58] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-22 06:44:59] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:45:01] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-22 06:45:01] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-22 06:45:01] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:45:01] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:45:02] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:45:02] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:45:03] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/828 variables, 20/545 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-05-22 06:45:04] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:45:04] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-22 06:45:05] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/828 variables, and 548 constraints, problems are : Problem set: 0 solved, 385 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 385/385 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 385 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/442 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 44/106 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-05-22 06:45:11] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-22 06:45:11] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-22 06:45:11] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:45:11] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:45:11] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:45:12] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-22 06:45:12] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:45:12] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:45:12] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:45:12] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:45:12] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-22 06:45:12] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-22 06:45:12] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-22 06:45:13] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 3 ms to minimize.
[2024-05-22 06:45:13] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-05-22 06:45:13] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:45:13] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:45:13] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:45:13] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-22 06:45:13] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-05-22 06:45:14] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:45:14] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:45:14] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:45:14] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:45:14] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:45:14] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:45:14] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:45:15] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:45:15] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-22 06:45:15] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-05-22 06:45:18] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:45:19] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:45:19] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:45:19] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-22 06:45:19] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-22 06:45:19] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:45:19] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-05-22 06:45:22] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:45:23] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-05-22 06:45:29] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 11 (OVERLAPS) 386/828 variables, 442/588 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/828 variables, 385/973 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/828 variables, and 973 constraints, problems are : Problem set: 0 solved, 385 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 385/385 constraints, Known Traps: 84/84 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 385 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Starting structural reductions in LTL mode, iteration 1 : 442/455 places, 386/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60925 ms. Remains : 442/455 places, 386/405 transitions.
[2024-05-22 06:45:38] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:45:38] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:45:38] [INFO ] Input system was already deterministic with 386 transitions.
[2024-05-22 06:45:38] [INFO ] Flatten gal took : 14 ms
[2024-05-22 06:45:38] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:45:38] [INFO ] Time to serialize gal into /tmp/CTLFireability17512405244654486458.gal : 2 ms
[2024-05-22 06:45:38] [INFO ] Time to serialize properties into /tmp/CTLFireability15593254787536451856.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17512405244654486458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15593254787536451856.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:46:08] [INFO ] Flatten gal took : 12 ms
[2024-05-22 06:46:08] [INFO ] Applying decomposition
[2024-05-22 06:46:08] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5204545326727733065.txt' '-o' '/tmp/graph5204545326727733065.bin' '-w' '/tmp/graph5204545326727733065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5204545326727733065.bin' '-l' '-1' '-v' '-w' '/tmp/graph5204545326727733065.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:46:08] [INFO ] Decomposing Gal with order
[2024-05-22 06:46:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:46:08] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 06:46:08] [INFO ] Flatten gal took : 16 ms
[2024-05-22 06:46:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 06:46:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5997952868019723814.gal : 3 ms
[2024-05-22 06:46:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10634105604168503517.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5997952868019723814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10634105604168503517.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Graph (complete) has 1054 edges and 455 vertex of which 447 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 446 transition count 385
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 432 transition count 385
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 29 place count 432 transition count 376
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 47 place count 423 transition count 376
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 58 place count 412 transition count 365
Iterating global reduction 2 with 11 rules applied. Total rules applied 69 place count 412 transition count 365
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 412 transition count 363
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 71 place count 412 transition count 362
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 411 transition count 362
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 80 place count 404 transition count 355
Iterating global reduction 3 with 7 rules applied. Total rules applied 87 place count 404 transition count 355
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 95 place count 404 transition count 347
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 97 place count 403 transition count 346
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 97 place count 403 transition count 343
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 400 transition count 343
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 235 place count 334 transition count 277
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 237 place count 332 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 238 place count 331 transition count 275
Applied a total of 238 rules in 73 ms. Remains 331 /455 variables (removed 124) and now considering 275/405 (removed 130) transitions.
// Phase 1: matrix 275 rows 331 cols
[2024-05-22 06:46:38] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 06:46:38] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 06:46:38] [INFO ] Invariant cache hit.
[2024-05-22 06:46:38] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-05-22 06:46:38] [INFO ] Redundant transitions in 12 ms returned []
Running 272 sub problems to find dead transitions.
[2024-05-22 06:46:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/328 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 2/330 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 272 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/331 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 275/606 variables, 331/389 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-22 06:46:48] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-22 06:46:50] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-22 06:46:50] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-22 06:46:53] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-22 06:46:54] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:46:54] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/606 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-22 06:46:57] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:46:57] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/606 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/606 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 14 (OVERLAPS) 0/606 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 397 constraints, problems are : Problem set: 0 solved, 272 unsolved in 28602 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/328 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 2/330 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 1/331 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 11 (OVERLAPS) 275/606 variables, 331/397 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/606 variables, 272/669 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-22 06:47:24] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
[2024-05-22 06:47:24] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:47:24] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 2 ms to minimize.
[2024-05-22 06:47:26] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-22 06:47:36] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/606 variables, and 674 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 13/13 constraints]
After SMT, in 58773ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 58776ms
Starting structural reductions in SI_CTL mode, iteration 1 : 331/455 places, 275/405 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59303 ms. Remains : 331/455 places, 275/405 transitions.
[2024-05-22 06:47:37] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:47:37] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:47:37] [INFO ] Input system was already deterministic with 275 transitions.
[2024-05-22 06:47:37] [INFO ] Flatten gal took : 7 ms
[2024-05-22 06:47:37] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:47:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1981041211360763964.gal : 4 ms
[2024-05-22 06:47:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10044231398201599164.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1981041211360763964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10044231398201599164.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:48:07] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:48:07] [INFO ] Applying decomposition
[2024-05-22 06:48:07] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4282747755160872623.txt' '-o' '/tmp/graph4282747755160872623.bin' '-w' '/tmp/graph4282747755160872623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4282747755160872623.bin' '-l' '-1' '-v' '-w' '/tmp/graph4282747755160872623.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:48:07] [INFO ] Decomposing Gal with order
[2024-05-22 06:48:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:48:07] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 06:48:07] [INFO ] Flatten gal took : 13 ms
[2024-05-22 06:48:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2024-05-22 06:48:07] [INFO ] Time to serialize gal into /tmp/CTLFireability6107255520697676347.gal : 2 ms
[2024-05-22 06:48:07] [INFO ] Time to serialize properties into /tmp/CTLFireability5793685876680814986.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6107255520697676347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5793685876680814986.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,1.16579e+15,5.701,168452,17183,9211,405590,33035,349,272165,474,238609,0


Converting to forward existential form...Done !
original formula: !(E((i12.u16.p337!=1) U ((AF(((u15.p21==1)&&(u15.p330==1))) * AF((EF(((u14.p127==1)&&(u14.p323==1))) + (((u14.p150==1)&&(u14.p323==1))&&(...230
=> equivalent forward existential formula: [((FwdU(Init,(i12.u16.p337!=1)) * (!(EG(!(((u15.p21==1)&&(u15.p330==1))))) * !(EG(!((E(TRUE U ((u14.p127==1)&&(u...308
Reverse transition relation is NOT exact ! Due to transitions t130, t152, t214, t215, t220, t223, u14.t2, u14.t112, u15.t154, u51.t140, u51.t225, i0.t9, i0...884
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 443 transition count 393
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 443 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 443 transition count 391
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 434 transition count 382
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 434 transition count 382
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 51 place count 434 transition count 375
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 433 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 433 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 433 transition count 373
Applied a total of 54 rules in 29 ms. Remains 433 /455 variables (removed 22) and now considering 373/405 (removed 32) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:48:37] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 06:48:38] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 06:48:38] [INFO ] Invariant cache hit.
[2024-05-22 06:48:38] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:48:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:48:45] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 06:48:45] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:48:45] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:48:45] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:48:45] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-22 06:48:45] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-22 06:48:45] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-22 06:48:45] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-22 06:48:45] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2024-05-22 06:48:46] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:48:46] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:48:46] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-22 06:48:46] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:48:46] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:48:46] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:48:46] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:48:46] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:48:47] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-22 06:48:47] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-05-22 06:48:47] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:48:49] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:48:49] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:48:50] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:48:54] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:48:57] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-22 06:48:57] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:48:58] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:48:58] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-05-22 06:48:58] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:48:58] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:49:11] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:49:11] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:49:11] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:49:12] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:49:12] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:49:12] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:49:12] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-22 06:49:12] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:49:12] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:49:12] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:49:12] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:49:12] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:49:12] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:49:13] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:49:13] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:49:13] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:49:13] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:49:13] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:49:13] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:49:13] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:49:13] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:49:13] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:49:13] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:49:13] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:49:14] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:49:14] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
[2024-05-22 06:49:14] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:49:14] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
[2024-05-22 06:49:14] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:49:14] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:49:14] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-22 06:49:14] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:49:14] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:49:17] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:49:18] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:49:18] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:49:18] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:49:18] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:49:18] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:49:21] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:49:21] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-22 06:49:21] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:49:24] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 433/455 places, 373/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60809 ms. Remains : 433/455 places, 373/405 transitions.
[2024-05-22 06:49:38] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:49:38] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:49:38] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-22 06:49:38] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:49:38] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:49:38] [INFO ] Time to serialize gal into /tmp/CTLFireability1095285001737635108.gal : 2 ms
[2024-05-22 06:49:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11619140141268680553.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1095285001737635108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11619140141268680553.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:50:08] [INFO ] Flatten gal took : 13 ms
[2024-05-22 06:50:08] [INFO ] Applying decomposition
[2024-05-22 06:50:08] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14181000707449724298.txt' '-o' '/tmp/graph14181000707449724298.bin' '-w' '/tmp/graph14181000707449724298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14181000707449724298.bin' '-l' '-1' '-v' '-w' '/tmp/graph14181000707449724298.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:50:08] [INFO ] Decomposing Gal with order
[2024-05-22 06:50:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:50:08] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 06:50:08] [INFO ] Flatten gal took : 14 ms
[2024-05-22 06:50:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 06:50:08] [INFO ] Time to serialize gal into /tmp/CTLFireability911895729945519250.gal : 3 ms
[2024-05-22 06:50:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15318627042311303214.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability911895729945519250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15318627042311303214.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 443 transition count 393
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 443 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 443 transition count 391
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 434 transition count 382
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 434 transition count 382
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 51 place count 434 transition count 375
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 433 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 433 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 433 transition count 373
Applied a total of 54 rules in 35 ms. Remains 433 /455 variables (removed 22) and now considering 373/405 (removed 32) transitions.
[2024-05-22 06:50:38] [INFO ] Invariant cache hit.
[2024-05-22 06:50:39] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-22 06:50:39] [INFO ] Invariant cache hit.
[2024-05-22 06:50:39] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:50:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:50:46] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-22 06:50:46] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:50:46] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:50:46] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:50:47] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-22 06:50:47] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-22 06:50:47] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:50:47] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:50:47] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:50:47] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-22 06:50:47] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:50:47] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-22 06:50:47] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:50:48] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:50:48] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:50:48] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:50:48] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:50:48] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:50:48] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-22 06:50:48] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:50:51] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-22 06:50:51] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:50:52] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:50:55] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-22 06:50:58] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-22 06:50:58] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:50:59] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:50:59] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 2 ms to minimize.
[2024-05-22 06:50:59] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:50:59] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:51:13] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:51:13] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
[2024-05-22 06:51:13] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-22 06:51:13] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:51:13] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:51:13] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:51:13] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:51:13] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:51:13] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-22 06:51:14] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:51:14] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:51:14] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:51:14] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:51:14] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:51:14] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:51:14] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:51:14] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:51:14] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:51:14] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-22 06:51:14] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:51:15] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:51:15] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:51:15] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-22 06:51:15] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
[2024-05-22 06:51:15] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:51:15] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:51:15] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:51:15] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:51:15] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:51:15] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:51:15] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:51:15] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:51:15] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:51:18] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:51:19] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:51:19] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:51:20] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:51:20] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:51:20] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:51:22] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:51:22] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-22 06:51:23] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:51:25] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in LTL mode, iteration 1 : 433/455 places, 373/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60881 ms. Remains : 433/455 places, 373/405 transitions.
[2024-05-22 06:51:39] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:51:39] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:51:39] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-22 06:51:39] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:51:39] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:51:39] [INFO ] Time to serialize gal into /tmp/CTLFireability17348161612829696539.gal : 1 ms
[2024-05-22 06:51:39] [INFO ] Time to serialize properties into /tmp/CTLFireability14930838662481598915.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17348161612829696539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14930838662481598915.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:52:09] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:52:09] [INFO ] Applying decomposition
[2024-05-22 06:52:09] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15354349121568747804.txt' '-o' '/tmp/graph15354349121568747804.bin' '-w' '/tmp/graph15354349121568747804.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15354349121568747804.bin' '-l' '-1' '-v' '-w' '/tmp/graph15354349121568747804.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:52:09] [INFO ] Decomposing Gal with order
[2024-05-22 06:52:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:52:09] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 06:52:09] [INFO ] Flatten gal took : 14 ms
[2024-05-22 06:52:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 06:52:09] [INFO ] Time to serialize gal into /tmp/CTLFireability16760315633092447574.gal : 3 ms
[2024-05-22 06:52:09] [INFO ] Time to serialize properties into /tmp/CTLFireability15691417883086912242.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16760315633092447574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15691417883086912242.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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,7.51175e+20,27.3453,664704,28907,6989,1.36349e+06,39318,635,3.08489e+06,486,278220,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 443 transition count 393
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 443 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 443 transition count 391
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 434 transition count 382
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 434 transition count 382
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 51 place count 434 transition count 375
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 433 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 433 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 433 transition count 373
Applied a total of 54 rules in 27 ms. Remains 433 /455 variables (removed 22) and now considering 373/405 (removed 32) transitions.
[2024-05-22 06:52:40] [INFO ] Invariant cache hit.
[2024-05-22 06:52:40] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-22 06:52:40] [INFO ] Invariant cache hit.
[2024-05-22 06:52:40] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:52:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:52:49] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-22 06:52:49] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 4 ms to minimize.
[2024-05-22 06:52:49] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:52:49] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2024-05-22 06:52:49] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 4 ms to minimize.
[2024-05-22 06:52:50] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 3 ms to minimize.
[2024-05-22 06:52:50] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 5 ms to minimize.
[2024-05-22 06:52:50] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 4 ms to minimize.
[2024-05-22 06:52:50] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 3 ms to minimize.
[2024-05-22 06:52:50] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:52:50] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:52:50] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-05-22 06:52:51] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:52:51] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:52:51] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:52:51] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:52:51] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:52:51] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:52:52] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:52:52] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:52:54] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:52:54] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:52:55] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:52:58] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:53:01] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-22 06:53:01] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-22 06:53:02] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-05-22 06:53:02] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 2 ms to minimize.
[2024-05-22 06:53:02] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-22 06:53:02] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:53:14] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:53:14] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:53:14] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-22 06:53:14] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:53:14] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:53:14] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:53:14] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:53:14] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:53:14] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-22 06:53:15] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:53:15] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:53:15] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:53:15] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-22 06:53:15] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:53:15] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:53:15] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:53:15] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-22 06:53:15] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:53:15] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-22 06:53:15] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:53:16] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:53:16] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:53:16] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:53:16] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
[2024-05-22 06:53:16] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:53:16] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:53:16] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-05-22 06:53:16] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-22 06:53:16] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:53:16] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:53:16] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:53:16] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:53:16] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:53:19] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:53:20] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:53:20] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-22 06:53:20] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-22 06:53:20] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-22 06:53:20] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:53:23] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:53:23] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-22 06:53:23] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:53:26] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Starting structural reductions in LTL mode, iteration 1 : 433/455 places, 373/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60894 ms. Remains : 433/455 places, 373/405 transitions.
[2024-05-22 06:53:40] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:53:40] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:53:40] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-22 06:53:40] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:53:40] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:53:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17265015321434835129.gal : 2 ms
[2024-05-22 06:53:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11105258726356552782.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17265015321434835129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11105258726356552782.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:54:11] [INFO ] Flatten gal took : 15 ms
[2024-05-22 06:54:11] [INFO ] Applying decomposition
[2024-05-22 06:54:11] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11091402685712343742.txt' '-o' '/tmp/graph11091402685712343742.bin' '-w' '/tmp/graph11091402685712343742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11091402685712343742.bin' '-l' '-1' '-v' '-w' '/tmp/graph11091402685712343742.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:54:11] [INFO ] Decomposing Gal with order
[2024-05-22 06:54:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:54:11] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 06:54:11] [INFO ] Flatten gal took : 13 ms
[2024-05-22 06:54:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 06:54:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15259193857723656557.gal : 3 ms
[2024-05-22 06:54:11] [INFO ] Time to serialize properties into /tmp/CTLFireability9581636327417788492.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15259193857723656557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9581636327417788492.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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,7.51175e+20,6.91384,197308,14923,5468,426353,34630,699,437069,427,272917,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 444 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 444 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 444 transition count 392
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 435 transition count 383
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 435 transition count 383
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 49 place count 435 transition count 376
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 434 transition count 375
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 434 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 434 transition count 374
Applied a total of 52 rules in 32 ms. Remains 434 /455 variables (removed 21) and now considering 374/405 (removed 31) transitions.
// Phase 1: matrix 374 rows 434 cols
[2024-05-22 06:54:41] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 06:54:41] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 06:54:41] [INFO ] Invariant cache hit.
[2024-05-22 06:54:41] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2024-05-22 06:54:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/434 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (OVERLAPS) 374/808 variables, 434/496 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-22 06:54:48] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-22 06:54:48] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-22 06:54:48] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:54:48] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:54:49] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-22 06:54:49] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-22 06:54:50] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:54:50] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:54:50] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 9/505 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-22 06:54:55] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:54:55] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:54:55] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:54:55] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:54:55] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:54:55] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-22 06:54:56] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:54:56] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:54:56] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/808 variables, 9/514 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-22 06:55:04] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:55:04] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/808 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-22 06:55:06] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:55:07] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2024-05-22 06:55:07] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:55:07] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-22 06:55:07] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:55:08] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:55:08] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-22 06:55:08] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-22 06:55:08] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:55:08] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-22 06:55:09] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:55:09] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-22 06:55:09] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 808/808 variables, and 529 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/434 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 33/95 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-22 06:55:15] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:55:15] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-22 06:55:15] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:55:15] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:55:15] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:55:15] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:55:15] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:55:16] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:55:16] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:55:16] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 10/105 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-22 06:55:18] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:55:18] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-22 06:55:19] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:55:19] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:55:19] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-22 06:55:23] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:55:23] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-22 06:55:26] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:55:26] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-22 06:55:29] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:55:30] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 11 (OVERLAPS) 374/808 variables, 434/550 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 808/808 variables, and 923 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 54/54 constraints]
After SMT, in 60238ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 60243ms
Starting structural reductions in LTL mode, iteration 1 : 434/455 places, 374/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60979 ms. Remains : 434/455 places, 374/405 transitions.
[2024-05-22 06:55:42] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:55:42] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:55:42] [INFO ] Input system was already deterministic with 374 transitions.
[2024-05-22 06:55:42] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:55:42] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:55:42] [INFO ] Time to serialize gal into /tmp/CTLFireability7152628690376889006.gal : 2 ms
[2024-05-22 06:55:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9725286820218312736.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7152628690376889006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9725286820218312736.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:56:12] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:56:12] [INFO ] Applying decomposition
[2024-05-22 06:56:12] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17886683319309630472.txt' '-o' '/tmp/graph17886683319309630472.bin' '-w' '/tmp/graph17886683319309630472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17886683319309630472.bin' '-l' '-1' '-v' '-w' '/tmp/graph17886683319309630472.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:56:12] [INFO ] Decomposing Gal with order
[2024-05-22 06:56:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:56:12] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 06:56:12] [INFO ] Flatten gal took : 14 ms
[2024-05-22 06:56:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-22 06:56:12] [INFO ] Time to serialize gal into /tmp/CTLFireability13942825988358186877.gal : 2 ms
[2024-05-22 06:56:12] [INFO ] Time to serialize properties into /tmp/CTLFireability8912192601055846421.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13942825988358186877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8912192601055846421.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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.81753e+20,12.1435,371696,36281,5489,980786,37933,653,599086,410,232402,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 405/405 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 444 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 444 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 444 transition count 392
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 437 transition count 385
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 437 transition count 385
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 45 place count 437 transition count 378
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 436 transition count 377
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 436 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 436 transition count 376
Applied a total of 48 rules in 28 ms. Remains 436 /455 variables (removed 19) and now considering 376/405 (removed 29) transitions.
// Phase 1: matrix 376 rows 436 cols
[2024-05-22 06:56:42] [INFO ] Computed 62 invariants in 6 ms
[2024-05-22 06:56:42] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 06:56:42] [INFO ] Invariant cache hit.
[2024-05-22 06:56:43] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-05-22 06:56:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 376/812 variables, 436/498 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:56:49] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:56:54] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/812 variables, 7/505 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:56:55] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:56:56] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-22 06:56:56] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:56:57] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-05-22 06:56:57] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-22 06:56:57] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-22 06:56:57] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:56:57] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:56:57] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-22 06:56:57] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:56:57] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:56:58] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-22 06:56:58] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-22 06:56:58] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:56:58] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:56:58] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:56:59] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:56:59] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:57:00] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2024-05-22 06:57:00] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/812 variables, 20/525 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:57:02] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:57:05] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:57:05] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:57:05] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/812 variables, 4/529 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:57:08] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:57:09] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 812/812 variables, and 531 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 33/95 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:57:17] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-22 06:57:17] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:57:17] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:57:17] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:57:17] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
[2024-05-22 06:57:17] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:57:18] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-05-22 06:57:18] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-22 06:57:18] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-22 06:57:18] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-05-22 06:57:18] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-22 06:57:19] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
[2024-05-22 06:57:19] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-22 06:57:19] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:57:19] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:57:19] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:57:19] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:57:20] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:57:23] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-22 06:57:23] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-22 06:57:25] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:57:27] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:57:30] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-22 06:57:30] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-05-22 06:57:30] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:57:31] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:57:31] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:57:31] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-22 06:57:31] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:57:31] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:57:31] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 06:57:34] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:57:34] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 12 (OVERLAPS) 376/812 variables, 436/568 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/812 variables, 375/943 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 812/812 variables, and 943 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 70/70 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Starting structural reductions in LTL mode, iteration 1 : 436/455 places, 376/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60873 ms. Remains : 436/455 places, 376/405 transitions.
[2024-05-22 06:57:43] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:57:43] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:57:43] [INFO ] Input system was already deterministic with 376 transitions.
[2024-05-22 06:57:43] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:57:43] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:57:43] [INFO ] Time to serialize gal into /tmp/CTLFireability16389368658190198088.gal : 2 ms
[2024-05-22 06:57:43] [INFO ] Time to serialize properties into /tmp/CTLFireability17559448741570320332.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16389368658190198088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17559448741570320332.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:58:13] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:58:13] [INFO ] Applying decomposition
[2024-05-22 06:58:13] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8456998836691144414.txt' '-o' '/tmp/graph8456998836691144414.bin' '-w' '/tmp/graph8456998836691144414.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8456998836691144414.bin' '-l' '-1' '-v' '-w' '/tmp/graph8456998836691144414.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:58:13] [INFO ] Decomposing Gal with order
[2024-05-22 06:58:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:58:13] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 06:58:13] [INFO ] Flatten gal took : 14 ms
[2024-05-22 06:58:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 06:58:13] [INFO ] Time to serialize gal into /tmp/CTLFireability7444606870122000592.gal : 3 ms
[2024-05-22 06:58:13] [INFO ] Time to serialize properties into /tmp/CTLFireability14476434565656195249.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7444606870122000592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14476434565656195249.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:58:43] [INFO ] Flatten gal took : 14 ms
[2024-05-22 06:58:43] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:58:43] [INFO ] Applying decomposition
[2024-05-22 06:58:43] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2397816231501843102.txt' '-o' '/tmp/graph2397816231501843102.bin' '-w' '/tmp/graph2397816231501843102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2397816231501843102.bin' '-l' '-1' '-v' '-w' '/tmp/graph2397816231501843102.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:58:43] [INFO ] Decomposing Gal with order
[2024-05-22 06:58:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:58:43] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-22 06:58:43] [INFO ] Flatten gal took : 14 ms
[2024-05-22 06:58:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2024-05-22 06:58:43] [INFO ] Time to serialize gal into /tmp/CTLFireability9515634062873780369.gal : 3 ms
[2024-05-22 06:58:43] [INFO ] Time to serialize properties into /tmp/CTLFireability3811223236820079682.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9515634062873780369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3811223236820079682.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 16 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,1.09995e+22,134.588,2242772,14534,4765,5.49565e+06,35306,742,2.14507e+06,455,343649,0


Converting to forward existential form...Done !
original formula: (EG((((EF(AG(((i10.u86.p74==1)&&(i10.u86.p471==1)))) + AX(((((i1.u9.p204==1)&&(i1.u9.p229==1))||((i1.u9.p183==1)&&(i1.u9.p229==1))) * A((...797
=> equivalent forward existential formula: ([(Init * !(EG((((E(TRUE U !(E(TRUE U !(((i10.u86.p74==1)&&(i10.u86.p471==1)))))) + !(EX(!(((((i1.u9.p204==1)&&(...1021
Reverse transition relation is NOT exact ! Due to transitions t0, t58, t91, t128, t137, t298, t362, t363, t396, u39.t79, i0.i2.u14.t123, i0.i2.u14.t125, i0...1465

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DES-PT-50b"
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-5568"
echo " Executing tool itstools"
echo " Input is DES-PT-50b, 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 r092-tall-171624189900738"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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