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-171624189900754.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-60b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189900754
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:42 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 11K Apr 12 08:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 08:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 08:27 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 139K 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-60b-CTLFireability-2024-00
FORMULA_NAME DES-PT-60b-CTLFireability-2024-01
FORMULA_NAME DES-PT-60b-CTLFireability-2024-02
FORMULA_NAME DES-PT-60b-CTLFireability-2024-03
FORMULA_NAME DES-PT-60b-CTLFireability-2024-04
FORMULA_NAME DES-PT-60b-CTLFireability-2024-05
FORMULA_NAME DES-PT-60b-CTLFireability-2024-06
FORMULA_NAME DES-PT-60b-CTLFireability-2024-07
FORMULA_NAME DES-PT-60b-CTLFireability-2024-08
FORMULA_NAME DES-PT-60b-CTLFireability-2024-09
FORMULA_NAME DES-PT-60b-CTLFireability-2024-10
FORMULA_NAME DES-PT-60b-CTLFireability-2024-11
FORMULA_NAME DES-PT-60b-CTLFireability-2023-12
FORMULA_NAME DES-PT-60b-CTLFireability-2023-13
FORMULA_NAME DES-PT-60b-CTLFireability-2023-14
FORMULA_NAME DES-PT-60b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716363282122

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-60b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 07:34:43] [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 07:34:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:34:43] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-22 07:34:43] [INFO ] Transformed 519 places.
[2024-05-22 07:34:43] [INFO ] Transformed 470 transitions.
[2024-05-22 07:34:43] [INFO ] Found NUPN structural information;
[2024-05-22 07:34:43] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 141 out of 519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 519/519 places, 470/470 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 516 transition count 470
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 497 transition count 451
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 497 transition count 451
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 490 transition count 444
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 490 transition count 444
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 490 transition count 439
Applied a total of 60 rules in 114 ms. Remains 490 /519 variables (removed 29) and now considering 439/470 (removed 31) transitions.
// Phase 1: matrix 439 rows 490 cols
[2024-05-22 07:34:43] [INFO ] Computed 62 invariants in 52 ms
[2024-05-22 07:34:44] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-22 07:34:44] [INFO ] Invariant cache hit.
[2024-05-22 07:34:44] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
Running 438 sub problems to find dead transitions.
[2024-05-22 07:34:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (OVERLAPS) 1/490 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (OVERLAPS) 439/929 variables, 490/552 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-22 07:34:56] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 20 ms to minimize.
[2024-05-22 07:34:56] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:34:56] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 2 ms to minimize.
[2024-05-22 07:34:56] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:34:56] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:34:57] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-05-22 07:34:57] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-22 07:34:57] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-22 07:34:57] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-22 07:34:57] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:34:57] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-22 07:34:57] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-22 07:34:57] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:34:57] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-05-22 07:34:58] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 3 ms to minimize.
[2024-05-22 07:34:58] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:34:58] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-22 07:34:58] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:34:59] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 2 ms to minimize.
[2024-05-22 07:34:59] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/929 variables, 20/572 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-22 07:35:07] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/929 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-22 07:35:14] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-22 07:35:14] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:35:14] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 929/929 variables, and 576 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (OVERLAPS) 1/490 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 24/86 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-22 07:35:19] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:35:19] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-22 07:35:19] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:35:19] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:35:19] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:35:19] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:35:20] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:35:20] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:35:20] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-22 07:35:20] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-05-22 07:35:20] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 4 ms to minimize.
[2024-05-22 07:35:20] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 07:35:20] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:35:20] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-22 07:35:21] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:35:21] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
[2024-05-22 07:35:21] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:35:21] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:35:21] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-22 07:35:21] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-22 07:35:22] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-22 07:35:22] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-22 07:35:22] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-22 07:35:22] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-22 07:35:22] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-22 07:35:26] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-22 07:35:30] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:35:30] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-22 07:35:31] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-22 07:35:31] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:35:31] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-22 07:35:32] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2024-05-22 07:35:32] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 10 (OVERLAPS) 439/929 variables, 490/609 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/929 variables, 438/1047 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 929/929 variables, and 1047 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 57/57 constraints]
After SMT, in 60483ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 60642ms
Starting structural reductions in LTL mode, iteration 1 : 490/519 places, 439/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61859 ms. Remains : 490/519 places, 439/470 transitions.
Support contains 141 out of 490 places after structural reductions.
[2024-05-22 07:35:45] [INFO ] Flatten gal took : 63 ms
[2024-05-22 07:35:45] [INFO ] Flatten gal took : 30 ms
[2024-05-22 07:35:45] [INFO ] Input system was already deterministic with 439 transitions.
RANDOM walk for 40000 steps (336 resets) in 2004 ms. (19 steps per ms) remains 49/102 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
[2024-05-22 07:35:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 144/206 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 19/225 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 245/470 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 4/474 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem AtomicPropp34 is UNSAT
At refinement iteration 9 (OVERLAPS) 425/899 variables, 474/536 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/899 variables, 0/536 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 16/915 variables, 9/545 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 07:35:51] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:35:51] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:35:51] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:35:51] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:35:51] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-22 07:35:51] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:35:52] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
SMT process timed out in 5137ms, After SMT, problems are : Problem set: 1 solved, 47 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 439/439 transitions.
Graph (complete) has 1164 edges and 490 vertex of which 486 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 486 transition count 420
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 29 place count 473 transition count 420
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 473 transition count 410
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 463 transition count 410
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 59 place count 453 transition count 400
Iterating global reduction 2 with 10 rules applied. Total rules applied 69 place count 453 transition count 400
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 73 place count 453 transition count 396
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 73 place count 453 transition count 394
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 77 place count 451 transition count 394
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 448 transition count 391
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 448 transition count 391
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 88 place count 448 transition count 386
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 91 place count 446 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 91 place count 446 transition count 384
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 93 place count 445 transition count 384
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 2 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 227 place count 378 transition count 317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 231 place count 376 transition count 317
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 232 place count 376 transition count 316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 233 place count 375 transition count 316
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 234 place count 375 transition count 315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 374 transition count 315
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 236 place count 373 transition count 314
Applied a total of 236 rules in 214 ms. Remains 373 /490 variables (removed 117) and now considering 314/439 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 373/490 places, 314/439 transitions.
RANDOM walk for 40000 steps (1210 resets) in 724 ms. (55 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (24 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (24 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (27 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (23 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (24 resets) in 33 ms. (117 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (20 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (20 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (21 resets) in 13 ms. (285 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (29 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (24 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (23 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (24 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (24 resets) in 9 ms. (400 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (28 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (27 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (23 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (23 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (26 resets) in 10 ms. (364 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (25 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (18 resets) in 13 ms. (285 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (24 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (28 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (20 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (27 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (26 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (20 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (29 resets) in 9 ms. (400 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (17 resets) in 9 ms. (400 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (25 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (24 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (19 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (23 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (24 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (23 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (19 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
Interrupted probabilistic random walk after 441134 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 47
Probabilistic random walk after 441134 steps, saw 71904 distinct states, run finished after 3004 ms. (steps per millisecond=146 ) properties seen :0
// Phase 1: matrix 314 rows 373 cols
[2024-05-22 07:35:55] [INFO ] Computed 64 invariants in 11 ms
[2024-05-22 07:35:55] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 80/141 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 13/154 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 219/373 variables, 28/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp91 is UNSAT
At refinement iteration 7 (OVERLAPS) 314/687 variables, 373/437 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/687 variables, 4/441 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/687 variables, 0/441 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-22 07:35:58] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:35:59] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/687 variables, 2/443 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-22 07:36:00] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-22 07:36:00] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/687 variables, 2/445 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-22 07:36:02] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/687 variables, 1/446 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/687 variables, 0/446 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 14 (OVERLAPS) 0/687 variables, 0/446 constraints. Problems are: Problem set: 2 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 687/687 variables, and 446 constraints, problems are : Problem set: 2 solved, 45 unsolved in 10375 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 373/373 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 2 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 80/139 variables, 30/30 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-22 07:36:06] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 13/152 variables, 6/37 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 221/373 variables, 28/65 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 5/70 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-22 07:36:06] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:36:07] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 2/72 constraints. Problems are: Problem set: 2 solved, 45 unsolved
[2024-05-22 07:36:07] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 1/73 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 0/73 constraints. Problems are: Problem set: 2 solved, 45 unsolved
Problem AtomicPropp36 is UNSAT
At refinement iteration 11 (OVERLAPS) 314/687 variables, 373/446 constraints. Problems are: Problem set: 3 solved, 44 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/687 variables, 4/450 constraints. Problems are: Problem set: 3 solved, 44 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/687 variables, 44/494 constraints. Problems are: Problem set: 3 solved, 44 unsolved
[2024-05-22 07:36:26] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-22 07:36:27] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-22 07:36:28] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:36:29] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-22 07:36:34] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 2 ms to minimize.
[2024-05-22 07:36:34] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/687 variables, 6/500 constraints. Problems are: Problem set: 3 solved, 44 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 687/687 variables, and 500 constraints, problems are : Problem set: 3 solved, 44 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 373/373 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 44/47 constraints, Known Traps: 15/15 constraints]
After SMT, in 55472ms problems are : Problem set: 3 solved, 44 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 314/314 transitions.
Applied a total of 0 rules in 14 ms. Remains 373 /373 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 373/373 places, 314/314 transitions.
RANDOM walk for 40000 steps (1234 resets) in 534 ms. (74 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (25 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (25 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (22 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (24 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (26 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (19 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (24 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (25 resets) in 42 ms. (93 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (23 resets) in 42 ms. (93 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (26 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (22 resets) in 27 ms. (142 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (27 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (25 resets) in 41 ms. (95 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (24 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (25 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (27 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (28 resets) in 30 ms. (129 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (29 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (24 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (31 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (20 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (21 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (26 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (26 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (23 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (26 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (22 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (24 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (27 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (22 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (25 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (18 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (22 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (25 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (23 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (25 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
Interrupted probabilistic random walk after 377964 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 44
Probabilistic random walk after 377964 steps, saw 63624 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
[2024-05-22 07:36:54] [INFO ] Invariant cache hit.
[2024-05-22 07:36:54] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 80/137 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 13/150 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 223/373 variables, 28/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 314/687 variables, 373/437 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/687 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-22 07:36:56] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:36:56] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:36:57] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/687 variables, 3/444 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/687 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/687 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 687/687 variables, and 444 constraints, problems are : Problem set: 0 solved, 44 unsolved in 7119 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 373/373 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 80/137 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-22 07:37:01] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 13/150 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-22 07:37:02] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 223/373 variables, 28/66 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-22 07:37:02] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-05-22 07:37:02] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-22 07:37:02] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:37:03] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 07:37:03] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 314/687 variables, 373/447 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/687 variables, 4/451 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/687 variables, 44/495 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-22 07:37:26] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-22 07:37:26] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-22 07:37:27] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-22 07:37:32] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 3 ms to minimize.
[2024-05-22 07:37:32] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2024-05-22 07:37:32] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-22 07:37:33] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:37:34] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-05-22 07:37:36] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:37:36] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-22 07:37:36] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/687 variables, 11/506 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-22 07:37:54] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/687 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 687/687 variables, and 507 constraints, problems are : Problem set: 0 solved, 44 unsolved in 75011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 373/373 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 22/22 constraints]
After SMT, in 82174ms problems are : Problem set: 0 solved, 44 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 314/314 transitions.
Applied a total of 0 rules in 21 ms. Remains 373 /373 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 373/373 places, 314/314 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 314/314 transitions.
Applied a total of 0 rules in 10 ms. Remains 373 /373 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 07:38:16] [INFO ] Invariant cache hit.
[2024-05-22 07:38:17] [INFO ] Implicit Places using invariants in 244 ms returned [259]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 246 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 372/373 places, 314/314 transitions.
Applied a total of 0 rules in 15 ms. Remains 372 /372 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 272 ms. Remains : 372/373 places, 314/314 transitions.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA DES-PT-60b-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 07:38:17] [INFO ] Flatten gal took : 58 ms
[2024-05-22 07:38:17] [INFO ] Flatten gal took : 42 ms
[2024-05-22 07:38:17] [INFO ] Input system was already deterministic with 439 transitions.
Support contains 131 out of 490 places (down from 132) after GAL structural reductions.
Computed a total of 298 stabilizing places and 290 stable transitions
Graph (complete) has 1164 edges and 490 vertex of which 482 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.50 ms
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 439/439 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 481 transition count 430
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 481 transition count 430
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 481 transition count 426
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 477 transition count 422
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 477 transition count 422
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 34 place count 477 transition count 418
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 476 transition count 417
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 476 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 476 transition count 416
Applied a total of 37 rules in 102 ms. Remains 476 /490 variables (removed 14) and now considering 416/439 (removed 23) transitions.
// Phase 1: matrix 416 rows 476 cols
[2024-05-22 07:38:17] [INFO ] Computed 62 invariants in 6 ms
[2024-05-22 07:38:18] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-05-22 07:38:18] [INFO ] Invariant cache hit.
[2024-05-22 07:38:18] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2024-05-22 07:38:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/476 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 415 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 416/892 variables, 476/538 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 07:38:29] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:38:30] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:38:30] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-22 07:38:30] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:38:30] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-22 07:38:30] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:38:30] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:38:30] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:38:31] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:38:31] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-22 07:38:31] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-22 07:38:31] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-22 07:38:31] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-22 07:38:31] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2024-05-22 07:38:31] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 07:38:32] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:38:32] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:38:32] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:38:32] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-05-22 07:38:32] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/892 variables, 20/558 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 07:38:35] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:38:35] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-22 07:38:35] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-22 07:38:35] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:38:35] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-22 07:38:35] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-22 07:38:35] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-22 07:38:36] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-22 07:38:36] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-22 07:38:36] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:38:36] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-05-22 07:38:36] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 2 ms to minimize.
[2024-05-22 07:38:36] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-22 07:38:36] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-05-22 07:38:37] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-05-22 07:38:37] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:38:37] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:38:37] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:38:37] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:38:38] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/892 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 07:38:40] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:38:41] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:38:41] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-22 07:38:42] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-22 07:38:43] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/892 variables, 5/583 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 07:38:48] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 892/892 variables, and 584 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/476 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 07:38:52] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-22 07:38:52] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:38:52] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:38:53] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:38:53] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-05-22 07:38:53] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-22 07:38:53] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-22 07:38:56] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 8/116 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 07:38:57] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-22 07:38:58] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:38:58] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-22 07:38:58] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:38:58] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:38:59] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 07:39:02] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:39:02] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-22 07:39:03] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 07:39:06] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:39:06] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:39:07] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-22 07:39:07] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 07:39:11] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:39:12] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/892 variables, and 131 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/476 constraints, PredecessorRefiner: 0/415 constraints, Known Traps: 69/69 constraints]
After SMT, in 60260ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60264ms
Starting structural reductions in LTL mode, iteration 1 : 476/490 places, 416/439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61472 ms. Remains : 476/490 places, 416/439 transitions.
[2024-05-22 07:39:18] [INFO ] Flatten gal took : 20 ms
[2024-05-22 07:39:19] [INFO ] Flatten gal took : 24 ms
[2024-05-22 07:39:19] [INFO ] Input system was already deterministic with 416 transitions.
[2024-05-22 07:39:19] [INFO ] Flatten gal took : 17 ms
[2024-05-22 07:39:19] [INFO ] Flatten gal took : 19 ms
[2024-05-22 07:39:19] [INFO ] Time to serialize gal into /tmp/CTLFireability4704520095229289469.gal : 13 ms
[2024-05-22 07:39:19] [INFO ] Time to serialize properties into /tmp/CTLFireability6272776274090561544.ctl : 5 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/CTLFireability4704520095229289469.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6272776274090561544.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 07:39:49] [INFO ] Flatten gal took : 17 ms
[2024-05-22 07:39:49] [INFO ] Applying decomposition
[2024-05-22 07:39:49] [INFO ] Flatten gal took : 16 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/graph7948679632181025849.txt' '-o' '/tmp/graph7948679632181025849.bin' '-w' '/tmp/graph7948679632181025849.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7948679632181025849.bin' '-l' '-1' '-v' '-w' '/tmp/graph7948679632181025849.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:39:49] [INFO ] Decomposing Gal with order
[2024-05-22 07:39:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:39:49] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 07:39:49] [INFO ] Flatten gal took : 55 ms
[2024-05-22 07:39:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2024-05-22 07:39:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13153857398164715394.gal : 7 ms
[2024-05-22 07:39:49] [INFO ] Time to serialize properties into /tmp/CTLFireability17368636565127306587.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/CTLFireability13153857398164715394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17368636565127306587.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 : 490/490 places, 439/439 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 479 transition count 428
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 479 transition count 428
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 479 transition count 424
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 474 transition count 419
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 474 transition count 419
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 473 transition count 414
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 473 transition count 413
Applied a total of 43 rules in 41 ms. Remains 473 /490 variables (removed 17) and now considering 413/439 (removed 26) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-22 07:40:19] [INFO ] Computed 62 invariants in 16 ms
[2024-05-22 07:40:19] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-22 07:40:19] [INFO ] Invariant cache hit.
[2024-05-22 07:40:20] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-22 07:40:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:40:31] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:40:31] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:40:31] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:40:31] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-22 07:40:31] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-22 07:40:32] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:40:32] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:40:32] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-22 07:40:32] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:40:32] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:40:32] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:40:32] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:40:33] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:40:34] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 14/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/886 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:40:49] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-22 07:40:49] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 3 ms to minimize.
[2024-05-22 07:40:49] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 552 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:40:54] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-22 07:40:54] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:40:54] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-22 07:40:54] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:40:54] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-22 07:40:55] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-22 07:40:55] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-22 07:40:55] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-22 07:40:55] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:40:55] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-22 07:40:55] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-22 07:40:56] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:40:56] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-05-22 07:40:56] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-22 07:40:56] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-22 07:40:56] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-22 07:40:56] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:40:56] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:40:56] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:40:56] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:40:57] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-22 07:40:57] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 07:40:57] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-22 07:40:57] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-22 07:40:57] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:40:58] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:41:01] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:41:01] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:41:02] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:41:05] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:41:06] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 07:41:09] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 10 (OVERLAPS) 413/886 variables, 473/586 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/886 variables, 412/998 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 886/886 variables, and 998 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 51/51 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60269ms
Starting structural reductions in LTL mode, iteration 1 : 473/490 places, 413/439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61208 ms. Remains : 473/490 places, 413/439 transitions.
[2024-05-22 07:41:20] [INFO ] Flatten gal took : 15 ms
[2024-05-22 07:41:20] [INFO ] Flatten gal took : 14 ms
[2024-05-22 07:41:20] [INFO ] Input system was already deterministic with 413 transitions.
[2024-05-22 07:41:20] [INFO ] Flatten gal took : 13 ms
[2024-05-22 07:41:20] [INFO ] Flatten gal took : 13 ms
[2024-05-22 07:41:20] [INFO ] Time to serialize gal into /tmp/CTLFireability8466443167053930498.gal : 3 ms
[2024-05-22 07:41:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13992014912881809625.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/CTLFireability8466443167053930498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13992014912881809625.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 07:41:50] [INFO ] Flatten gal took : 13 ms
[2024-05-22 07:41:50] [INFO ] Applying decomposition
[2024-05-22 07:41:50] [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/graph14586921273313051068.txt' '-o' '/tmp/graph14586921273313051068.bin' '-w' '/tmp/graph14586921273313051068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14586921273313051068.bin' '-l' '-1' '-v' '-w' '/tmp/graph14586921273313051068.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:41:51] [INFO ] Decomposing Gal with order
[2024-05-22 07:41:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:41:51] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-22 07:41:51] [INFO ] Flatten gal took : 23 ms
[2024-05-22 07:41:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 07:41:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15020666659831531233.gal : 4 ms
[2024-05-22 07:41:51] [INFO ] Time to serialize properties into /tmp/CTLFireability4906411029685899646.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/CTLFireability15020666659831531233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4906411029685899646.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,1.09421e+21,10.1794,263016,17269,8921,614124,48415,651,427043,568,501036,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 439/439 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 481 transition count 430
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 481 transition count 430
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 481 transition count 426
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 478 transition count 423
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 478 transition count 423
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 478 transition count 421
Applied a total of 30 rules in 29 ms. Remains 478 /490 variables (removed 12) and now considering 421/439 (removed 18) transitions.
// Phase 1: matrix 421 rows 478 cols
[2024-05-22 07:42:21] [INFO ] Computed 62 invariants in 13 ms
[2024-05-22 07:42:21] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-22 07:42:21] [INFO ] Invariant cache hit.
[2024-05-22 07:42:22] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-05-22 07:42:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 1/478 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (OVERLAPS) 421/899 variables, 478/540 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 07:42:33] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:42:33] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:42:33] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:42:34] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-05-22 07:42:35] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:42:35] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-22 07:42:38] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 7/547 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 07:42:41] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-22 07:42:41] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:42:41] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-22 07:42:47] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-22 07:42:47] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/899 variables, 5/552 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 899/899 variables, and 552 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 1/478 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 07:42:56] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:42:56] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:42:56] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:42:56] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-22 07:42:56] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-22 07:42:56] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:42:56] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:42:57] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:42:58] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:42:58] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:42:58] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 07:42:58] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:42:58] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:42:58] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:42:59] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-22 07:42:59] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 07:42:59] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-22 07:42:59] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 7/101 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 07:43:03] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:43:03] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-22 07:43:03] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 07:43:03] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-22 07:43:03] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 07:43:07] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:43:07] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 07:43:11] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:43:11] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 07:43:16] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 07:43:19] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 2 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 Int declared 478/899 variables, and 112 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/478 constraints, PredecessorRefiner: 0/420 constraints, Known Traps: 50/50 constraints]
After SMT, in 60257ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Starting structural reductions in LTL mode, iteration 1 : 478/490 places, 421/439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61289 ms. Remains : 478/490 places, 421/439 transitions.
[2024-05-22 07:43:22] [INFO ] Flatten gal took : 21 ms
[2024-05-22 07:43:22] [INFO ] Flatten gal took : 13 ms
[2024-05-22 07:43:22] [INFO ] Input system was already deterministic with 421 transitions.
[2024-05-22 07:43:22] [INFO ] Flatten gal took : 13 ms
[2024-05-22 07:43:22] [INFO ] Flatten gal took : 12 ms
[2024-05-22 07:43:22] [INFO ] Time to serialize gal into /tmp/CTLFireability6858100735390808527.gal : 2 ms
[2024-05-22 07:43:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9396267192972843149.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/CTLFireability6858100735390808527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9396267192972843149.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 07:43:52] [INFO ] Flatten gal took : 13 ms
[2024-05-22 07:43:52] [INFO ] Applying decomposition
[2024-05-22 07:43:52] [INFO ] Flatten gal took : 12 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/graph2083275147832335395.txt' '-o' '/tmp/graph2083275147832335395.bin' '-w' '/tmp/graph2083275147832335395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2083275147832335395.bin' '-l' '-1' '-v' '-w' '/tmp/graph2083275147832335395.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:43:52] [INFO ] Decomposing Gal with order
[2024-05-22 07:43:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:43:52] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 07:43:52] [INFO ] Flatten gal took : 30 ms
[2024-05-22 07:43:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2024-05-22 07:43:52] [INFO ] Time to serialize gal into /tmp/CTLFireability109746087955839328.gal : 9 ms
[2024-05-22 07:43:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1700155093554525228.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/CTLFireability109746087955839328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1700155093554525228.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 -...261
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 : 490/490 places, 439/439 transitions.
Graph (complete) has 1164 edges and 490 vertex of which 482 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 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 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 481 transition count 423
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 471 transition count 423
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 21 place count 471 transition count 414
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 39 place count 462 transition count 414
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 48 place count 453 transition count 405
Iterating global reduction 2 with 9 rules applied. Total rules applied 57 place count 453 transition count 405
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 453 transition count 402
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 60 place count 453 transition count 400
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 451 transition count 400
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 68 place count 447 transition count 396
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 447 transition count 396
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 78 place count 447 transition count 390
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 81 place count 445 transition count 389
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 213 place count 379 transition count 323
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 214 place count 379 transition count 323
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 216 place count 377 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 217 place count 376 transition count 321
Applied a total of 217 rules in 115 ms. Remains 376 /490 variables (removed 114) and now considering 321/439 (removed 118) transitions.
// Phase 1: matrix 321 rows 376 cols
[2024-05-22 07:44:22] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 07:44:23] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-22 07:44:23] [INFO ] Invariant cache hit.
[2024-05-22 07:44:23] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2024-05-22 07:44:23] [INFO ] Redundant transitions in 20 ms returned []
Running 317 sub problems to find dead transitions.
[2024-05-22 07:44:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (OVERLAPS) 3/375 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 317 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/376 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (OVERLAPS) 321/697 variables, 376/434 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/697 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-05-22 07:44:39] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-22 07:44:39] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/697 variables, 2/436 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-05-22 07:44:44] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:44:44] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/697 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/697 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 697/697 variables, and 438 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/372 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 3/375 variables, 28/47 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 1/376 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (OVERLAPS) 321/697 variables, 376/438 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/697 variables, 317/755 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-05-22 07:45:20] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:45:23] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/697 variables, and 757 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 6/6 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 60303ms
Starting structural reductions in SI_CTL mode, iteration 1 : 376/490 places, 321/439 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61139 ms. Remains : 376/490 places, 321/439 transitions.
[2024-05-22 07:45:24] [INFO ] Flatten gal took : 13 ms
[2024-05-22 07:45:24] [INFO ] Flatten gal took : 16 ms
[2024-05-22 07:45:24] [INFO ] Input system was already deterministic with 321 transitions.
[2024-05-22 07:45:24] [INFO ] Flatten gal took : 11 ms
[2024-05-22 07:45:24] [INFO ] Flatten gal took : 11 ms
[2024-05-22 07:45:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14737038590304236637.gal : 3 ms
[2024-05-22 07:45:24] [INFO ] Time to serialize properties into /tmp/CTLFireability3033782975996642625.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/CTLFireability14737038590304236637.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3033782975996642625.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 07:45:54] [INFO ] Flatten gal took : 13 ms
[2024-05-22 07:45:54] [INFO ] Applying decomposition
[2024-05-22 07:45:54] [INFO ] Flatten gal took : 11 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/graph16530817555707002848.txt' '-o' '/tmp/graph16530817555707002848.bin' '-w' '/tmp/graph16530817555707002848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16530817555707002848.bin' '-l' '-1' '-v' '-w' '/tmp/graph16530817555707002848.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:45:54] [INFO ] Decomposing Gal with order
[2024-05-22 07:45:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:45:54] [INFO ] Removed a total of 64 redundant transitions.
[2024-05-22 07:45:54] [INFO ] Flatten gal took : 21 ms
[2024-05-22 07:45:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 3 ms.
[2024-05-22 07:45:54] [INFO ] Time to serialize gal into /tmp/CTLFireability11172008430569165652.gal : 3 ms
[2024-05-22 07:45:54] [INFO ] Time to serialize properties into /tmp/CTLFireability22974749714150286.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/CTLFireability11172008430569165652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability22974749714150286.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 439/439 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 479 transition count 428
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 479 transition count 428
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 479 transition count 424
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 474 transition count 419
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 474 transition count 419
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 473 transition count 414
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 473 transition count 413
Applied a total of 43 rules in 33 ms. Remains 473 /490 variables (removed 17) and now considering 413/439 (removed 26) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-22 07:46:24] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 07:46:24] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-22 07:46:24] [INFO ] Invariant cache hit.
[2024-05-22 07:46:25] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-22 07:46:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:46:35] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:46:36] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:46:36] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-22 07:46:36] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-22 07:46:36] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:46:36] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-22 07:46:37] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:46:37] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-22 07:46:37] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:46:37] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:46:37] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:46:37] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:46:38] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-22 07:46:39] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 14/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/886 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:46:54] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:46:54] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:46:54] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 552 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:46:59] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-22 07:46:59] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:46:59] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-22 07:46:59] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:46:59] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-22 07:46:59] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-22 07:47:00] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-22 07:47:00] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-22 07:47:00] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-05-22 07:47:00] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-22 07:47:00] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-05-22 07:47:00] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:47:01] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-22 07:47:01] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:47:01] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:47:01] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-22 07:47:01] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:47:01] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:47:01] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:47:01] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:47:02] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:47:02] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:47:02] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-22 07:47:02] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-22 07:47:02] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-05-22 07:47:03] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:47:06] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:47:06] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-22 07:47:07] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:47:07] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:47:07] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:47:10] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:47:11] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-22 07:47:13] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 10 (OVERLAPS) 413/886 variables, 473/586 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/886 variables, 412/998 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 886/886 variables, and 998 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 51/51 constraints]
After SMT, in 60283ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Starting structural reductions in LTL mode, iteration 1 : 473/490 places, 413/439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61137 ms. Remains : 473/490 places, 413/439 transitions.
[2024-05-22 07:47:25] [INFO ] Flatten gal took : 20 ms
[2024-05-22 07:47:25] [INFO ] Flatten gal took : 14 ms
[2024-05-22 07:47:25] [INFO ] Input system was already deterministic with 413 transitions.
[2024-05-22 07:47:25] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:47:25] [INFO ] Flatten gal took : 11 ms
[2024-05-22 07:47:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3771738816046543924.gal : 3 ms
[2024-05-22 07:47:25] [INFO ] Time to serialize properties into /tmp/CTLFireability16875510794606164109.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/CTLFireability3771738816046543924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16875510794606164109.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 07:47:55] [INFO ] Flatten gal took : 15 ms
[2024-05-22 07:47:55] [INFO ] Applying decomposition
[2024-05-22 07:47:55] [INFO ] Flatten gal took : 11 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/graph16524211569712216900.txt' '-o' '/tmp/graph16524211569712216900.bin' '-w' '/tmp/graph16524211569712216900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16524211569712216900.bin' '-l' '-1' '-v' '-w' '/tmp/graph16524211569712216900.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:47:55] [INFO ] Decomposing Gal with order
[2024-05-22 07:47:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:47:55] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 07:47:55] [INFO ] Flatten gal took : 19 ms
[2024-05-22 07:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 07:47:55] [INFO ] Time to serialize gal into /tmp/CTLFireability17614553451898760890.gal : 3 ms
[2024-05-22 07:47:55] [INFO ] Time to serialize properties into /tmp/CTLFireability1361621347537318059.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/CTLFireability17614553451898760890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1361621347537318059.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 LTL mode, iteration 0 : 490/490 places, 439/439 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 480 transition count 429
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 480 transition count 429
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 480 transition count 425
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 476 transition count 421
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 476 transition count 421
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 35 place count 476 transition count 418
Applied a total of 35 rules in 30 ms. Remains 476 /490 variables (removed 14) and now considering 418/439 (removed 21) transitions.
// Phase 1: matrix 418 rows 476 cols
[2024-05-22 07:48:25] [INFO ] Computed 62 invariants in 8 ms
[2024-05-22 07:48:25] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-22 07:48:25] [INFO ] Invariant cache hit.
[2024-05-22 07:48:26] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2024-05-22 07:48:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/476 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 418/894 variables, 476/538 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 07:48:37] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:48:37] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:48:38] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-22 07:48:38] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:48:38] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2024-05-22 07:48:38] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-22 07:48:38] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-22 07:48:38] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:48:39] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-22 07:48:39] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:48:39] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2024-05-22 07:48:39] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:48:39] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2024-05-22 07:48:39] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-22 07:48:39] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:48:39] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:48:41] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:48:41] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 07:48:43] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:48:43] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/894 variables, 20/558 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 07:48:50] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:48:50] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-22 07:48:52] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-22 07:48:52] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 07:48:54] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:48:55] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 3 ms to minimize.
[2024-05-22 07:48:55] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/894 variables, 7/565 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 894/894 variables, and 565 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/476 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 27/89 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 07:49:00] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-22 07:49:00] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:49:01] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-22 07:49:01] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-22 07:49:01] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:49:01] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-22 07:49:02] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:49:02] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2024-05-22 07:49:02] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:49:02] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:49:02] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2024-05-22 07:49:02] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:49:03] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:49:03] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:49:03] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:49:03] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-22 07:49:06] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:49:06] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 18/107 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 07:49:06] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:49:06] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:49:07] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-22 07:49:07] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 07:49:11] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-22 07:49:11] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 07:49:12] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 07:49:16] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:49:16] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-22 07:49:19] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:49:19] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 07:49:20] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:49:20] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 07:49:25] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-22 07:49:25] [INFO ] Deduced a trap composed of 16 places in 52 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 Int declared 476/894 variables, and 122 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/476 constraints, PredecessorRefiner: 0/417 constraints, Known Traps: 60/60 constraints]
After SMT, in 60327ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Starting structural reductions in LTL mode, iteration 1 : 476/490 places, 418/439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61233 ms. Remains : 476/490 places, 418/439 transitions.
[2024-05-22 07:49:26] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:49:26] [INFO ] Flatten gal took : 11 ms
[2024-05-22 07:49:26] [INFO ] Input system was already deterministic with 418 transitions.
[2024-05-22 07:49:27] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:49:27] [INFO ] Flatten gal took : 26 ms
[2024-05-22 07:49:27] [INFO ] Time to serialize gal into /tmp/CTLFireability14977938348056645809.gal : 16 ms
[2024-05-22 07:49:27] [INFO ] Time to serialize properties into /tmp/CTLFireability2307009152450360095.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/CTLFireability14977938348056645809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2307009152450360095.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 07:49:57] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:49:57] [INFO ] Applying decomposition
[2024-05-22 07:49:57] [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/graph3660778633471882300.txt' '-o' '/tmp/graph3660778633471882300.bin' '-w' '/tmp/graph3660778633471882300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3660778633471882300.bin' '-l' '-1' '-v' '-w' '/tmp/graph3660778633471882300.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:49:57] [INFO ] Decomposing Gal with order
[2024-05-22 07:49:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:49:57] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 07:49:57] [INFO ] Flatten gal took : 31 ms
[2024-05-22 07:49:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 07:49:57] [INFO ] Time to serialize gal into /tmp/CTLFireability618314590813285010.gal : 3 ms
[2024-05-22 07:49:57] [INFO ] Time to serialize properties into /tmp/CTLFireability14026771003845232960.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/CTLFireability618314590813285010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14026771003845232960.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 SI_CTL mode, iteration 0 : 490/490 places, 439/439 transitions.
Graph (complete) has 1164 edges and 490 vertex of which 482 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 481 transition count 421
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 469 transition count 421
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 25 place count 469 transition count 412
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 43 place count 460 transition count 412
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 52 place count 451 transition count 403
Iterating global reduction 2 with 9 rules applied. Total rules applied 61 place count 451 transition count 403
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 451 transition count 400
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 451 transition count 399
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 450 transition count 399
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 70 place count 446 transition count 395
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 446 transition count 395
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 80 place count 446 transition count 389
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 83 place count 444 transition count 388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 83 place count 444 transition count 387
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 85 place count 443 transition count 387
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 221 place count 375 transition count 319
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 222 place count 375 transition count 319
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 373 transition count 317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 225 place count 372 transition count 317
Applied a total of 225 rules in 140 ms. Remains 372 /490 variables (removed 118) and now considering 317/439 (removed 122) transitions.
// Phase 1: matrix 317 rows 372 cols
[2024-05-22 07:50:27] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 07:50:27] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-22 07:50:27] [INFO ] Invariant cache hit.
[2024-05-22 07:50:28] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
[2024-05-22 07:50:28] [INFO ] Redundant transitions in 4 ms returned []
Running 313 sub problems to find dead transitions.
[2024-05-22 07:50:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 2/370 variables, 22/43 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (OVERLAPS) 1/371 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 317/688 variables, 371/429 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-22 07:50:38] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 11 (OVERLAPS) 1/689 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/689 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 689/689 variables, and 431 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 2/370 variables, 22/43 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (OVERLAPS) 1/371 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 317/688 variables, 371/430 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 313/743 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/689 variables, and 743 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 371/372 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 1/1 constraints]
After SMT, in 60258ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Starting structural reductions in SI_CTL mode, iteration 1 : 372/490 places, 317/439 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61100 ms. Remains : 372/490 places, 317/439 transitions.
[2024-05-22 07:51:28] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:51:28] [INFO ] Flatten gal took : 9 ms
[2024-05-22 07:51:28] [INFO ] Input system was already deterministic with 317 transitions.
[2024-05-22 07:51:28] [INFO ] Flatten gal took : 9 ms
[2024-05-22 07:51:28] [INFO ] Flatten gal took : 9 ms
[2024-05-22 07:51:28] [INFO ] Time to serialize gal into /tmp/CTLFireability16927645180613656213.gal : 2 ms
[2024-05-22 07:51:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15229734512225822021.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/CTLFireability16927645180613656213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15229734512225822021.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 07:51:58] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:51:58] [INFO ] Applying decomposition
[2024-05-22 07:51:58] [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/graph11089455407435424594.txt' '-o' '/tmp/graph11089455407435424594.bin' '-w' '/tmp/graph11089455407435424594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11089455407435424594.bin' '-l' '-1' '-v' '-w' '/tmp/graph11089455407435424594.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:51:58] [INFO ] Decomposing Gal with order
[2024-05-22 07:51:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:51:58] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-22 07:51:58] [INFO ] Flatten gal took : 15 ms
[2024-05-22 07:51:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 07:51:58] [INFO ] Time to serialize gal into /tmp/CTLFireability11739384536248102122.gal : 3 ms
[2024-05-22 07:51:58] [INFO ] Time to serialize properties into /tmp/CTLFireability18331592442938726292.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/CTLFireability11739384536248102122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18331592442938726292.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,3.43297e+15,3.00907,89204,4511,11735,181619,27785,418,127391,559,233506,0


Converting to forward existential form...Done !
original formula: AG(AF(((AF((((i1.u2.p240==0)||(i1.u2.p269==0))&&((u16.p17==0)||(u16.p370==0)))) * AF(((i5.i0.u4.p292==1)&&(i5.i0.u46.p477==1)))) * AF(((u...185
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(EG(!((((i1.u2.p240==0)||(i1.u2.p269==0))&&((u16.p17==0)||(u16.p370==0)))))) * !(EG(!...255
Reverse transition relation is NOT exact ! Due to transitions t138, t165, t178, t248, t249, t254, u15.t136, u16.t179, u51.t3, u51.t256, i0.i0.u0.t166, i0.i...996
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 439/439 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 480 transition count 429
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 480 transition count 429
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 480 transition count 426
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 475 transition count 421
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 475 transition count 421
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 475 transition count 417
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 474 transition count 416
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 474 transition count 415
Applied a total of 40 rules in 36 ms. Remains 474 /490 variables (removed 16) and now considering 415/439 (removed 24) transitions.
// Phase 1: matrix 415 rows 474 cols
[2024-05-22 07:52:28] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 07:52:29] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-22 07:52:29] [INFO ] Invariant cache hit.
[2024-05-22 07:52:29] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Running 414 sub problems to find dead transitions.
[2024-05-22 07:52:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/474 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 414 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (OVERLAPS) 415/889 variables, 474/536 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 07:52:40] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:52:40] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-22 07:52:40] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:52:40] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:52:41] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:52:41] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-22 07:52:41] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:52:41] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:52:41] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:52:41] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-22 07:52:41] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:52:41] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:52:42] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:52:42] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:52:42] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-22 07:52:42] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:52:42] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:52:42] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:52:42] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:52:42] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 20/556 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 07:52:48] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:52:49] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:52:49] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 3/559 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 07:52:52] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-22 07:52:52] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-22 07:52:52] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-22 07:52:52] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-22 07:52:52] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:52:53] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:52:53] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:52:53] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:52:53] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-22 07:52:53] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-22 07:52:53] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:52:53] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:52:53] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:52:53] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-22 07:52:53] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-22 07:52:53] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/889 variables, 16/575 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 889/889 variables, and 575 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/474 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 07:53:03] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-22 07:53:03] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:53:03] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:53:03] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:53:04] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:53:04] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-22 07:53:04] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-22 07:53:04] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-22 07:53:04] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:53:04] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:53:04] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:53:05] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-22 07:53:07] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 07:53:08] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-22 07:53:08] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:53:09] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 07:53:12] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-22 07:53:12] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-22 07:53:13] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 07:53:16] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:53:16] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 07:53:21] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-22 07:53:21] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 07:53:21] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-05-22 07:53:21] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 07:53:25] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:53:25] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-22 07:53:26] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:53:26] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 337)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 94)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 85)
(s114 159)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 337)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 338)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/889 variables, and 130 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/474 constraints, PredecessorRefiner: 0/414 constraints, Known Traps: 68/68 constraints]
After SMT, in 60249ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Starting structural reductions in LTL mode, iteration 1 : 474/490 places, 415/439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61105 ms. Remains : 474/490 places, 415/439 transitions.
[2024-05-22 07:53:29] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:53:29] [INFO ] Flatten gal took : 11 ms
[2024-05-22 07:53:29] [INFO ] Input system was already deterministic with 415 transitions.
[2024-05-22 07:53:29] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:53:29] [INFO ] Flatten gal took : 11 ms
[2024-05-22 07:53:29] [INFO ] Time to serialize gal into /tmp/CTLFireability1859670865166874205.gal : 2 ms
[2024-05-22 07:53:29] [INFO ] Time to serialize properties into /tmp/CTLFireability18409953292438072849.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/CTLFireability1859670865166874205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18409953292438072849.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 07:54:00] [INFO ] Flatten gal took : 14 ms
[2024-05-22 07:54:00] [INFO ] Applying decomposition
[2024-05-22 07:54:00] [INFO ] Flatten gal took : 11 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/graph5254845083152829885.txt' '-o' '/tmp/graph5254845083152829885.bin' '-w' '/tmp/graph5254845083152829885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5254845083152829885.bin' '-l' '-1' '-v' '-w' '/tmp/graph5254845083152829885.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:54:00] [INFO ] Decomposing Gal with order
[2024-05-22 07:54:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:54:00] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 07:54:00] [INFO ] Flatten gal took : 16 ms
[2024-05-22 07:54:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-22 07:54:00] [INFO ] Time to serialize gal into /tmp/CTLFireability7536709847344707475.gal : 4 ms
[2024-05-22 07:54:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4596375326175761462.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/CTLFireability7536709847344707475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4596375326175761462.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.31634e+21,14.1445,339076,16631,8549,826553,44944,815,459326,547,278268,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 439/439 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 480 transition count 429
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 480 transition count 429
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 480 transition count 425
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 476 transition count 421
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 476 transition count 421
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 35 place count 476 transition count 418
Applied a total of 35 rules in 25 ms. Remains 476 /490 variables (removed 14) and now considering 418/439 (removed 21) transitions.
// Phase 1: matrix 418 rows 476 cols
[2024-05-22 07:54:30] [INFO ] Computed 62 invariants in 15 ms
[2024-05-22 07:54:30] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-22 07:54:30] [INFO ] Invariant cache hit.
[2024-05-22 07:54:30] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2024-05-22 07:54:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/476 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 417 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 418/894 variables, 476/538 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 07:54:42] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:54:42] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-22 07:54:42] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-22 07:54:43] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:54:43] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-05-22 07:54:43] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:54:43] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:54:43] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-05-22 07:54:43] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 07:54:44] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:54:45] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-22 07:54:45] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:54:45] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 6 ms to minimize.
[2024-05-22 07:54:45] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-22 07:54:45] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/894 variables, 20/558 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 07:54:51] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:54:51] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 3 ms to minimize.
[2024-05-22 07:54:51] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/894 variables, 3/561 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 894/894 variables, and 561 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/476 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 07:55:05] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-22 07:55:05] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-22 07:55:05] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:55:05] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:55:05] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:55:05] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:55:05] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:55:05] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:55:05] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-22 07:55:05] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-22 07:55:06] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-22 07:55:06] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-22 07:55:06] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-22 07:55:06] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-22 07:55:06] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-22 07:55:06] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 07:55:06] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-22 07:55:06] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 07:55:06] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-22 07:55:06] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 07:55:08] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-22 07:55:08] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-22 07:55:08] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-22 07:55:10] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-22 07:55:10] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-22 07:55:10] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-22 07:55:10] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 7/112 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (OVERLAPS) 418/894 variables, 476/588 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/894 variables, 417/1005 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 894/894 variables, and 1005 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 50/50 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 60304ms
Starting structural reductions in LTL mode, iteration 1 : 476/490 places, 418/439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61117 ms. Remains : 476/490 places, 418/439 transitions.
[2024-05-22 07:55:31] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:55:31] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:55:31] [INFO ] Input system was already deterministic with 418 transitions.
[2024-05-22 07:55:31] [INFO ] Flatten gal took : 11 ms
[2024-05-22 07:55:31] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:55:31] [INFO ] Time to serialize gal into /tmp/CTLFireability995382664218071171.gal : 3 ms
[2024-05-22 07:55:31] [INFO ] Time to serialize properties into /tmp/CTLFireability14037779689758512488.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/CTLFireability995382664218071171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14037779689758512488.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 07:56:01] [INFO ] Flatten gal took : 13 ms
[2024-05-22 07:56:01] [INFO ] Applying decomposition
[2024-05-22 07:56:01] [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/graph16562551568763711698.txt' '-o' '/tmp/graph16562551568763711698.bin' '-w' '/tmp/graph16562551568763711698.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16562551568763711698.bin' '-l' '-1' '-v' '-w' '/tmp/graph16562551568763711698.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:56:01] [INFO ] Decomposing Gal with order
[2024-05-22 07:56:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:56:01] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 07:56:01] [INFO ] Flatten gal took : 16 ms
[2024-05-22 07:56:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 07:56:01] [INFO ] Time to serialize gal into /tmp/CTLFireability7542172936325600572.gal : 4 ms
[2024-05-22 07:56:01] [INFO ] Time to serialize properties into /tmp/CTLFireability11858246231869674928.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/CTLFireability7542172936325600572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11858246231869674928.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 LTL mode, iteration 0 : 490/490 places, 439/439 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 479 transition count 428
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 479 transition count 428
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 479 transition count 424
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 474 transition count 419
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 474 transition count 419
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 473 transition count 414
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 473 transition count 413
Applied a total of 43 rules in 39 ms. Remains 473 /490 variables (removed 17) and now considering 413/439 (removed 26) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-22 07:56:31] [INFO ] Computed 62 invariants in 18 ms
[2024-05-22 07:56:31] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-22 07:56:31] [INFO ] Invariant cache hit.
[2024-05-22 07:56:32] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-22 07:56:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:56:43] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:56:43] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-05-22 07:56:43] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:56:43] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-22 07:56:44] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:56:44] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-22 07:56:44] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-22 07:56:44] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-22 07:56:44] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:56:44] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:56:45] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:56:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:56:45] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-22 07:56:46] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 14/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/886 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:57:02] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:57:02] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:57:02] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
SMT process timed out in 30275ms, After SMT, problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 30282ms
Starting structural reductions in LTL mode, iteration 1 : 473/490 places, 413/439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31006 ms. Remains : 473/490 places, 413/439 transitions.
[2024-05-22 07:57:02] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:57:02] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:57:02] [INFO ] Input system was already deterministic with 413 transitions.
[2024-05-22 07:57:02] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:57:02] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:57:02] [INFO ] Time to serialize gal into /tmp/CTLFireability17538205953745052114.gal : 2 ms
[2024-05-22 07:57:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1245593692986579661.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/CTLFireability17538205953745052114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1245593692986579661.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 07:57:32] [INFO ] Flatten gal took : 16 ms
[2024-05-22 07:57:32] [INFO ] Applying decomposition
[2024-05-22 07:57:32] [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/graph2028257736661167344.txt' '-o' '/tmp/graph2028257736661167344.bin' '-w' '/tmp/graph2028257736661167344.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2028257736661167344.bin' '-l' '-1' '-v' '-w' '/tmp/graph2028257736661167344.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:57:32] [INFO ] Decomposing Gal with order
[2024-05-22 07:57:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:57:32] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-22 07:57:32] [INFO ] Flatten gal took : 17 ms
[2024-05-22 07:57:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 07:57:32] [INFO ] Time to serialize gal into /tmp/CTLFireability14627184312565494.gal : 3 ms
[2024-05-22 07:57:32] [INFO ] Time to serialize properties into /tmp/CTLFireability11259587379509893388.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/CTLFireability14627184312565494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11259587379509893388.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 -...261
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.09421e+21,8.367,184360,14395,8912,344169,51238,641,639258,552,356947,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 439/439 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 479 transition count 428
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 479 transition count 428
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 479 transition count 424
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 474 transition count 419
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 474 transition count 419
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 473 transition count 414
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 473 transition count 413
Applied a total of 43 rules in 34 ms. Remains 473 /490 variables (removed 17) and now considering 413/439 (removed 26) transitions.
[2024-05-22 07:58:02] [INFO ] Invariant cache hit.
[2024-05-22 07:58:03] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-22 07:58:03] [INFO ] Invariant cache hit.
[2024-05-22 07:58:03] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-22 07:58:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:58:14] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:58:14] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:58:15] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:58:15] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-22 07:58:15] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-22 07:58:15] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-22 07:58:15] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:58:15] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-22 07:58:15] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:58:16] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:58:16] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:58:16] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:58:16] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:58:17] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 14/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/886 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:58:32] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:58:33] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 3 ms to minimize.
[2024-05-22 07:58:33] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 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 886/886 variables, and 552 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:58:37] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-22 07:58:37] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:58:37] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-22 07:58:37] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 07:58:38] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:58:38] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-22 07:58:38] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-22 07:58:38] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-22 07:58:38] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-22 07:58:39] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:58:40] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:58:40] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-22 07:58:40] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:58:40] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:58:40] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:58:40] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-22 07:58:41] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-22 07:58:41] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-22 07:58:41] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:58:44] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:58:44] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-22 07:58:45] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:58:45] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:58:45] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:58:48] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 07:58:50] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-22 07:58:52] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 10 (OVERLAPS) 413/886 variables, 473/586 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/886 variables, 412/998 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 886/886 variables, and 998 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 51/51 constraints]
After SMT, in 60276ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Starting structural reductions in LTL mode, iteration 1 : 473/490 places, 413/439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61172 ms. Remains : 473/490 places, 413/439 transitions.
[2024-05-22 07:59:04] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:59:04] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:59:04] [INFO ] Input system was already deterministic with 413 transitions.
[2024-05-22 07:59:04] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:59:04] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:59:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16321760007979726475.gal : 2 ms
[2024-05-22 07:59:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16371433850119128080.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/CTLFireability16321760007979726475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16371433850119128080.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 07:59:34] [INFO ] Flatten gal took : 11 ms
[2024-05-22 07:59:34] [INFO ] Applying decomposition
[2024-05-22 07:59:34] [INFO ] Flatten gal took : 12 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/graph7962709498770883828.txt' '-o' '/tmp/graph7962709498770883828.bin' '-w' '/tmp/graph7962709498770883828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7962709498770883828.bin' '-l' '-1' '-v' '-w' '/tmp/graph7962709498770883828.weights' '-q' '0' '-e' '0.001'
[2024-05-22 07:59:34] [INFO ] Decomposing Gal with order
[2024-05-22 07:59:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 07:59:34] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 07:59:34] [INFO ] Flatten gal took : 16 ms
[2024-05-22 07:59:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 07:59:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8171702028689000921.gal : 3 ms
[2024-05-22 07:59:34] [INFO ] Time to serialize properties into /tmp/CTLFireability2695530986322129374.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/CTLFireability8171702028689000921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2695530986322129374.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 : 490/490 places, 439/439 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 481 transition count 430
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 481 transition count 430
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 481 transition count 427
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 477 transition count 423
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 477 transition count 423
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 477 transition count 420
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 476 transition count 419
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 476 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 476 transition count 418
Applied a total of 35 rules in 22 ms. Remains 476 /490 variables (removed 14) and now considering 418/439 (removed 21) transitions.
// Phase 1: matrix 418 rows 476 cols
[2024-05-22 08:00:04] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 08:00:04] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-22 08:00:04] [INFO ] Invariant cache hit.
[2024-05-22 08:00:05] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2024-05-22 08:00:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/476 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 418/894 variables, 476/538 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 08:00:16] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-22 08:00:17] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-22 08:00:17] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-05-22 08:00:17] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-05-22 08:00:21] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/894 variables, 5/543 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 08:00:30] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-22 08:00:31] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2024-05-22 08:00:32] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/894 variables, 3/546 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 894/894 variables, and 546 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/476 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 08:00:38] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-22 08:00:38] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-22 08:00:39] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 08:00:39] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-22 08:00:39] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-22 08:00:39] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-22 08:00:39] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:00:39] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-22 08:00:39] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-22 08:00:40] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-22 08:00:40] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-22 08:00:40] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-22 08:00:40] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:00:40] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-22 08:00:40] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 08:00:40] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 08:00:40] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-22 08:00:40] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-22 08:00:41] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:00:41] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 08:00:41] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-22 08:00:41] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-22 08:00:42] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-22 08:00:42] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-22 08:00:42] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-22 08:00:42] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 08:00:42] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 08:00:46] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-22 08:00:46] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-22 08:00:46] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-22 08:00:46] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 418/894 variables, 476/577 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/894 variables, 417/994 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 894/894 variables, and 994 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 39/39 constraints]
After SMT, in 60243ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Starting structural reductions in LTL mode, iteration 1 : 476/490 places, 418/439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61170 ms. Remains : 476/490 places, 418/439 transitions.
[2024-05-22 08:01:05] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:01:05] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:01:05] [INFO ] Input system was already deterministic with 418 transitions.
[2024-05-22 08:01:05] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:01:05] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:01:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6245130205399907955.gal : 2 ms
[2024-05-22 08:01:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14155644701033530839.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/CTLFireability6245130205399907955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14155644701033530839.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 08:01:35] [INFO ] Flatten gal took : 14 ms
[2024-05-22 08:01:35] [INFO ] Applying decomposition
[2024-05-22 08:01:35] [INFO ] Flatten gal took : 11 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/graph13443788375045030481.txt' '-o' '/tmp/graph13443788375045030481.bin' '-w' '/tmp/graph13443788375045030481.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13443788375045030481.bin' '-l' '-1' '-v' '-w' '/tmp/graph13443788375045030481.weights' '-q' '0' '-e' '0.001'
[2024-05-22 08:01:35] [INFO ] Decomposing Gal with order
[2024-05-22 08:01:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 08:01:35] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-22 08:01:35] [INFO ] Flatten gal took : 17 ms
[2024-05-22 08:01:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-22 08:01:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11663926032281267603.gal : 5 ms
[2024-05-22 08:01:35] [INFO ] Time to serialize properties into /tmp/CTLFireability6307113392227985661.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/CTLFireability11663926032281267603.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6307113392227985661.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 LTL mode, iteration 0 : 490/490 places, 439/439 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 481 transition count 430
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 481 transition count 430
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 481 transition count 427
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 476 transition count 422
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 476 transition count 422
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 476 transition count 418
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 475 transition count 417
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 475 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 475 transition count 416
Applied a total of 38 rules in 28 ms. Remains 475 /490 variables (removed 15) and now considering 416/439 (removed 23) transitions.
// Phase 1: matrix 416 rows 475 cols
[2024-05-22 08:02:05] [INFO ] Computed 62 invariants in 14 ms
[2024-05-22 08:02:06] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-22 08:02:06] [INFO ] Invariant cache hit.
[2024-05-22 08:02:06] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2024-05-22 08:02:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/475 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 415 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 416/891 variables, 475/537 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 08:02:18] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-05-22 08:02:18] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-22 08:02:18] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-22 08:02:18] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-05-22 08:02:18] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-22 08:02:18] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-22 08:02:19] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-22 08:02:19] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-22 08:02:19] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 08:02:19] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:02:19] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 08:02:19] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 08:02:19] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 08:02:20] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-22 08:02:20] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-22 08:02:20] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-22 08:02:20] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-22 08:02:20] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-05-22 08:02:21] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/891 variables, 19/556 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 08:02:30] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:02:30] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/891 variables, 3/559 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 08:02:36] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-05-22 08:02:36] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-22 08:02:36] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 891/891 variables, and 562 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/475 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 08:02:40] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-22 08:02:40] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-22 08:02:40] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-22 08:02:40] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:02:41] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:02:41] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-22 08:02:41] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-22 08:02:41] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-22 08:02:41] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-22 08:02:42] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-22 08:02:42] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-22 08:02:42] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-22 08:02:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 08:02:42] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-22 08:02:44] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 15/102 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 08:02:45] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 08:02:46] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-22 08:02:46] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 08:02:49] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 08:02:53] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 08:02:56] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-22 08:02:56] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-05-22 08:02:57] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-22 08:03:00] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 08:03:01] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/475 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 11 (OVERLAPS) 416/891 variables, 475/587 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 891/891 variables, and 1002 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 50/50 constraints]
After SMT, in 60350ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60356ms
Starting structural reductions in LTL mode, iteration 1 : 475/490 places, 416/439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61307 ms. Remains : 475/490 places, 416/439 transitions.
[2024-05-22 08:03:07] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:03:07] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:03:07] [INFO ] Input system was already deterministic with 416 transitions.
[2024-05-22 08:03:07] [INFO ] Flatten gal took : 15 ms
[2024-05-22 08:03:07] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:03:07] [INFO ] Time to serialize gal into /tmp/CTLFireability3536683430686379269.gal : 2 ms
[2024-05-22 08:03:07] [INFO ] Time to serialize properties into /tmp/CTLFireability7107664296723925914.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/CTLFireability3536683430686379269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7107664296723925914.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 08:03:37] [INFO ] Flatten gal took : 16 ms
[2024-05-22 08:03:37] [INFO ] Applying decomposition
[2024-05-22 08:03:37] [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/graph237041435891829616.txt' '-o' '/tmp/graph237041435891829616.bin' '-w' '/tmp/graph237041435891829616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph237041435891829616.bin' '-l' '-1' '-v' '-w' '/tmp/graph237041435891829616.weights' '-q' '0' '-e' '0.001'
[2024-05-22 08:03:37] [INFO ] Decomposing Gal with order
[2024-05-22 08:03:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 08:03:37] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 08:03:37] [INFO ] Flatten gal took : 15 ms
[2024-05-22 08:03:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 1 ms.
[2024-05-22 08:03:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14558402087518210358.gal : 3 ms
[2024-05-22 08:03:37] [INFO ] Time to serialize properties into /tmp/CTLFireability6838434137568076519.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/CTLFireability14558402087518210358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6838434137568076519.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,1.61407e+21,16.108,415092,39021,7566,939498,65917,682,735212,553,399354,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 439/439 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 480 transition count 429
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 480 transition count 429
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 480 transition count 426
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 475 transition count 421
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 475 transition count 421
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 475 transition count 417
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 474 transition count 416
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 474 transition count 415
Applied a total of 40 rules in 31 ms. Remains 474 /490 variables (removed 16) and now considering 415/439 (removed 24) transitions.
// Phase 1: matrix 415 rows 474 cols
[2024-05-22 08:04:07] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 08:04:07] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-22 08:04:07] [INFO ] Invariant cache hit.
[2024-05-22 08:04:08] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
Running 414 sub problems to find dead transitions.
[2024-05-22 08:04:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/474 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 414 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (OVERLAPS) 415/889 variables, 474/536 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 08:04:19] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-22 08:04:19] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-22 08:04:19] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-22 08:04:19] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-22 08:04:19] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-22 08:04:19] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-22 08:04:19] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 08:04:20] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:04:20] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 08:04:20] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-22 08:04:20] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-22 08:04:20] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:04:20] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-22 08:04:20] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-22 08:04:20] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-22 08:04:20] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-22 08:04:20] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 08:04:21] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2024-05-22 08:04:21] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:04:21] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 20/556 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 08:04:27] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 1 ms to minimize.
[2024-05-22 08:04:28] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-22 08:04:28] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 3/559 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 08:04:30] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-22 08:04:31] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-22 08:04:31] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-22 08:04:31] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-22 08:04:31] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 08:04:31] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-22 08:04:32] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-22 08:04:32] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:04:32] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-22 08:04:32] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-22 08:04:32] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:04:32] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 08:04:32] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-22 08:04:32] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-22 08:04:32] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-22 08:04:32] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/889 variables, 16/575 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 889/889 variables, and 575 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/474 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 08:04:42] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-22 08:04:42] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:04:42] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-22 08:04:42] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:04:42] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-22 08:04:42] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 08:04:42] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-22 08:04:42] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-22 08:04:42] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 08:04:43] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:04:43] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-22 08:04:43] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 08:04:45] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 08:04:46] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-22 08:04:46] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-22 08:04:47] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 08:04:50] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-22 08:04:50] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-22 08:04:51] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 08:04:54] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-22 08:04:54] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 08:04:59] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-05-22 08:04:59] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-22 08:04:59] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2024-05-22 08:04:59] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 08:05:03] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-22 08:05:03] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-22 08:05:04] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-05-22 08:05:04] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/889 variables, and 130 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/474 constraints, PredecessorRefiner: 0/414 constraints, Known Traps: 68/68 constraints]
After SMT, in 60269ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Starting structural reductions in LTL mode, iteration 1 : 474/490 places, 415/439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61152 ms. Remains : 474/490 places, 415/439 transitions.
[2024-05-22 08:05:08] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:05:08] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:05:08] [INFO ] Input system was already deterministic with 415 transitions.
[2024-05-22 08:05:08] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:05:08] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:05:08] [INFO ] Time to serialize gal into /tmp/CTLFireability2132854748472893711.gal : 2 ms
[2024-05-22 08:05:08] [INFO ] Time to serialize properties into /tmp/CTLFireability3412704442921330345.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/CTLFireability2132854748472893711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3412704442921330345.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 08:05:38] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:05:38] [INFO ] Applying decomposition
[2024-05-22 08:05:38] [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/graph2825114547320708212.txt' '-o' '/tmp/graph2825114547320708212.bin' '-w' '/tmp/graph2825114547320708212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2825114547320708212.bin' '-l' '-1' '-v' '-w' '/tmp/graph2825114547320708212.weights' '-q' '0' '-e' '0.001'
[2024-05-22 08:05:38] [INFO ] Decomposing Gal with order
[2024-05-22 08:05:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 08:05:38] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 08:05:38] [INFO ] Flatten gal took : 15 ms
[2024-05-22 08:05:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-22 08:05:38] [INFO ] Time to serialize gal into /tmp/CTLFireability5188638163592741669.gal : 3 ms
[2024-05-22 08:05:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12299023522136739742.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/CTLFireability5188638163592741669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12299023522136739742.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,1.31634e+21,10.8708,247320,14108,8526,498353,52949,746,472310,571,386725,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 439/439 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 479 transition count 428
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 479 transition count 428
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 479 transition count 424
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 474 transition count 419
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 474 transition count 419
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 473 transition count 414
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 473 transition count 413
Applied a total of 43 rules in 28 ms. Remains 473 /490 variables (removed 17) and now considering 413/439 (removed 26) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-22 08:06:08] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 08:06:09] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-22 08:06:09] [INFO ] Invariant cache hit.
[2024-05-22 08:06:09] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-22 08:06:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 08:06:20] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-22 08:06:20] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-22 08:06:20] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 08:06:21] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-22 08:06:21] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-22 08:06:21] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-22 08:06:21] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-05-22 08:06:21] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-22 08:06:21] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-22 08:06:22] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:06:22] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 08:06:22] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 08:06:22] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-22 08:06:23] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 14/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/886 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 08:06:38] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-05-22 08:06:38] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 3 ms to minimize.
[2024-05-22 08:06:39] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 552 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 08:06:43] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 08:06:43] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-22 08:06:43] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-22 08:06:43] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-22 08:06:43] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 08:06:44] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-05-22 08:06:44] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-22 08:06:44] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-22 08:06:44] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-05-22 08:06:44] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-22 08:06:44] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-22 08:06:45] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-22 08:06:45] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-05-22 08:06:45] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-22 08:06:45] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-22 08:06:45] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-22 08:06:45] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 08:06:45] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:06:45] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 08:06:45] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 08:06:46] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-22 08:06:46] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-22 08:06:46] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-22 08:06:46] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-22 08:06:47] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-22 08:06:47] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 08:06:50] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 08:06:50] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-22 08:06:51] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 08:06:51] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 08:06:51] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:06:54] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 08:06:55] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-22 08:06:58] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 10 (OVERLAPS) 413/886 variables, 473/586 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/886 variables, 412/998 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 886/886 variables, and 998 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 51/51 constraints]
After SMT, in 60281ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Starting structural reductions in LTL mode, iteration 1 : 473/490 places, 413/439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61140 ms. Remains : 473/490 places, 413/439 transitions.
[2024-05-22 08:07:09] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:07:09] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:07:09] [INFO ] Input system was already deterministic with 413 transitions.
[2024-05-22 08:07:09] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:07:09] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:07:09] [INFO ] Time to serialize gal into /tmp/CTLFireability712919623741917533.gal : 2 ms
[2024-05-22 08:07:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17430794388065284000.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/CTLFireability712919623741917533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17430794388065284000.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 08:07:40] [INFO ] Flatten gal took : 10 ms
[2024-05-22 08:07:40] [INFO ] Applying decomposition
[2024-05-22 08:07:40] [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/graph4716316649866430142.txt' '-o' '/tmp/graph4716316649866430142.bin' '-w' '/tmp/graph4716316649866430142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4716316649866430142.bin' '-l' '-1' '-v' '-w' '/tmp/graph4716316649866430142.weights' '-q' '0' '-e' '0.001'
[2024-05-22 08:07:40] [INFO ] Decomposing Gal with order
[2024-05-22 08:07:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 08:07:40] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-22 08:07:40] [INFO ] Flatten gal took : 16 ms
[2024-05-22 08:07:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 08:07:40] [INFO ] Time to serialize gal into /tmp/CTLFireability1296844311005412616.gal : 3 ms
[2024-05-22 08:07:40] [INFO ] Time to serialize properties into /tmp/CTLFireability13120044562773989608.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/CTLFireability1296844311005412616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13120044562773989608.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,1.09421e+21,6.99545,184168,14122,8916,428852,46763,686,342361,545,325766,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 08:08:10] [INFO ] Flatten gal took : 11 ms
[2024-05-22 08:08:10] [INFO ] Flatten gal took : 12 ms
[2024-05-22 08:08:10] [INFO ] Applying decomposition
[2024-05-22 08:08:10] [INFO ] Flatten gal took : 11 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/graph17579600681627749987.txt' '-o' '/tmp/graph17579600681627749987.bin' '-w' '/tmp/graph17579600681627749987.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17579600681627749987.bin' '-l' '-1' '-v' '-w' '/tmp/graph17579600681627749987.weights' '-q' '0' '-e' '0.001'
[2024-05-22 08:08:10] [INFO ] Decomposing Gal with order
[2024-05-22 08:08:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 08:08:10] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-22 08:08:10] [INFO ] Flatten gal took : 17 ms
[2024-05-22 08:08:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 2 ms.
[2024-05-22 08:08:10] [INFO ] Time to serialize gal into /tmp/CTLFireability17584252591044516873.gal : 3 ms
[2024-05-22 08:08:10] [INFO ] Time to serialize properties into /tmp/CTLFireability2782661934796809111.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/CTLFireability17584252591044516873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2782661934796809111.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 15 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.098e+22,7.70266,196676,12871,7565,398290,50502,696,460338,558,423720,0


Converting to forward existential form...Done !
original formula: E(EG(EX((!(AG((i3.u28.p331==1))) * AF((i3.u19.p310==1))))) U !(A(EF((i8.u59.p439==1)) U (EX(A((i8.u50.p414==1) U ((i10.u80.p70==1)&&(i10....271
=> equivalent forward existential formula: ([(((FwdU(FwdU(Init,EG(EX((!(!(E(TRUE U !((i3.u28.p331==1))))) * !(EG(!((i3.u19.p310==1)))))))),!((EX(!((E(!(((i...1100
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t88, t121, t123, t133, t397, t398, t431, u35.t79, u37.t76, i1.u6.t138, i1.u6.t140, i...775
ITS-tools command line returned an error code 137
[2024-05-22 08:23:32] [INFO ] Applying decomposition
[2024-05-22 08:23:32] [INFO ] Flatten gal took : 12 ms
[2024-05-22 08:23:32] [INFO ] Decomposing Gal with order
[2024-05-22 08:23:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 08:23:32] [INFO ] Removed a total of 252 redundant transitions.
[2024-05-22 08:23:32] [INFO ] Flatten gal took : 41 ms
[2024-05-22 08:23:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 854 labels/synchronizations in 13 ms.
[2024-05-22 08:23:32] [INFO ] Time to serialize gal into /tmp/CTLFireability7304735601006068745.gal : 4 ms
[2024-05-22 08:23:32] [INFO ] Time to serialize properties into /tmp/CTLFireability5699365725557334105.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/CTLFireability7304735601006068745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5699365725557334105.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 15 CTL formulae.

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-60b"
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-60b, 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-171624189900754"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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