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.r356-tall-171683761400601.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 ShieldPPPt-PT-005B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761400601
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 14:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 14:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 14:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 14:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717006843241

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-005B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 18:20:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 18:20:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:20:44] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-29 18:20:44] [INFO ] Transformed 393 places.
[2024-05-29 18:20:44] [INFO ] Transformed 358 transitions.
[2024-05-29 18:20:44] [INFO ] Found NUPN structural information;
[2024-05-29 18:20:44] [INFO ] Parsed PT model containing 393 places and 358 transitions and 896 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA ShieldPPPt-PT-005B-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-005B-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 110 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 358/358 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 356 transition count 321
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 356 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 355 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 355 transition count 320
Applied a total of 76 rules in 70 ms. Remains 355 /393 variables (removed 38) and now considering 320/358 (removed 38) transitions.
// Phase 1: matrix 320 rows 355 cols
[2024-05-29 18:20:44] [INFO ] Computed 56 invariants in 21 ms
[2024-05-29 18:20:45] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-29 18:20:45] [INFO ] Invariant cache hit.
[2024-05-29 18:20:45] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2024-05-29 18:20:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/355 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 14 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:20:49] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:20:50] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:20:50] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:20:50] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:20:50] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:20:50] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:20:50] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:20:50] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:20:50] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 3 ms to minimize.
[2024-05-29 18:20:50] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-29 18:20:51] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:20:51] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:20:51] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:20:51] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:20:51] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:20:51] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:20:51] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:20:51] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:20:51] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:20:51] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:20:51] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:20:52] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:20:52] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:20:52] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:20:52] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 4 ms to minimize.
[2024-05-29 18:20:52] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:20:52] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:20:52] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:20:52] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:20:52] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-29 18:20:55] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:20:55] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:20:55] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:20:55] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:20:55] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:20:55] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:20:56] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:20:56] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:20:56] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:20:56] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:20:56] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:20:56] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-29 18:20:58] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-29 18:21:00] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:21:00] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-29 18:21:03] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:21:04] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 10 ms to minimize.
[2024-05-29 18:21:04] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 9 (OVERLAPS) 320/675 variables, 355/469 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-29 18:21:10] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:21:10] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:21:10] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:21:11] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/675 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-29 18:21:14] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:21:14] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
[2024-05-29 18:21:14] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 675/675 variables, and 476 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/355 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 65/121 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-29 18:21:18] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-29 18:21:19] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:21:20] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 320/675 variables, 355/479 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 319/798 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-29 18:21:25] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-05-29 18:21:26] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-29 18:21:26] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:21:26] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:21:26] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:21:26] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:21:27] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:21:27] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-29 18:21:27] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:21:28] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:21:28] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:21:28] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:21:28] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:21:28] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-29 18:21:29] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:21:29] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:21:29] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:21:30] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-29 18:21:30] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:21:30] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 20/818 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-29 18:21:35] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/675 variables, 1/819 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-29 18:21:43] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:21:43] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:21:45] [INFO ] Deduced a trap composed of 23 places in 54 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 675/675 variables, and 822 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 92/92 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 355/393 places, 320/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60771 ms. Remains : 355/393 places, 320/358 transitions.
Support contains 110 out of 355 places after structural reductions.
[2024-05-29 18:21:45] [INFO ] Flatten gal took : 45 ms
[2024-05-29 18:21:45] [INFO ] Flatten gal took : 17 ms
[2024-05-29 18:21:45] [INFO ] Input system was already deterministic with 320 transitions.
Support contains 100 out of 355 places (down from 110) after GAL structural reductions.
RANDOM walk for 27989 steps (5 resets) in 904 ms. (30 steps per ms) remains 0/59 properties
[2024-05-29 18:21:46] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:21:46] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:21:46] [INFO ] Input system was already deterministic with 320 transitions.
Computed a total of 80 stabilizing places and 80 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 320/320 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 338 transition count 303
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 338 transition count 303
Applied a total of 34 rules in 18 ms. Remains 338 /355 variables (removed 17) and now considering 303/320 (removed 17) transitions.
// Phase 1: matrix 303 rows 338 cols
[2024-05-29 18:21:46] [INFO ] Computed 56 invariants in 4 ms
[2024-05-29 18:21:46] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-29 18:21:46] [INFO ] Invariant cache hit.
[2024-05-29 18:21:46] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2024-05-29 18:21:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:21:49] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:21:49] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:21:49] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:21:49] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:21:50] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:21:50] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:21:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:21:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:21:50] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:21:50] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:21:50] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:21:50] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:21:50] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:21:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:21:50] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:21:51] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:21:51] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:21:51] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:21:51] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:21:51] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:21:51] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:21:52] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:21:52] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:21:52] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:21:52] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:21:52] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:21:52] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:21:52] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:21:52] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:21:52] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:21:52] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:21:52] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:21:53] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:21:53] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:21:53] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:21:53] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:21:56] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:21:56] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:21:58] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:21:58] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 303/641 variables, 338/434 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 0/641 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 434 constraints, problems are : Problem set: 0 solved, 302 unsolved in 23344 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 40/96 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:22:12] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (OVERLAPS) 303/641 variables, 338/435 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 302/737 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:22:16] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-29 18:22:16] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-29 18:22:17] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 3 ms to minimize.
[2024-05-29 18:22:17] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:22:17] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:22:17] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:22:18] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:22:18] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:22:18] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 3 ms to minimize.
[2024-05-29 18:22:18] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:22:19] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:22:19] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:22:19] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:22:19] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-29 18:22:20] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:22:21] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:22:21] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 19/756 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:22:25] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 3 ms to minimize.
[2024-05-29 18:22:26] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:22:26] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-05-29 18:22:27] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:22:28] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-29 18:22:29] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 7/763 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:22:34] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-29 18:22:36] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 2/765 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 641/641 variables, and 765 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 69/69 constraints]
After SMT, in 53388ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 53394ms
Starting structural reductions in LTL mode, iteration 1 : 338/355 places, 303/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53721 ms. Remains : 338/355 places, 303/320 transitions.
[2024-05-29 18:22:39] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:22:39] [INFO ] Flatten gal took : 25 ms
[2024-05-29 18:22:40] [INFO ] Input system was already deterministic with 303 transitions.
[2024-05-29 18:22:40] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:22:40] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:22:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality8906545314000872771.gal : 7 ms
[2024-05-29 18:22:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality12090498265406270978.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/CTLCardinality8906545314000872771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12090498265406270978.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-29 18:23:10] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:23:10] [INFO ] Applying decomposition
[2024-05-29 18:23:10] [INFO ] Flatten gal took : 15 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/graph16213067327706833093.txt' '-o' '/tmp/graph16213067327706833093.bin' '-w' '/tmp/graph16213067327706833093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16213067327706833093.bin' '-l' '-1' '-v' '-w' '/tmp/graph16213067327706833093.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:23:10] [INFO ] Decomposing Gal with order
[2024-05-29 18:23:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:23:10] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-29 18:23:10] [INFO ] Flatten gal took : 48 ms
[2024-05-29 18:23:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-29 18:23:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality14646780007770038562.gal : 6 ms
[2024-05-29 18:23:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality13881346086064261649.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/CTLCardinality14646780007770038562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13881346086064261649.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,2.39123e+32,5.03968,132744,2359,29,245818,428,622,482686,47,1107,0


Converting to forward existential form...Done !
original formula: AG(AF((((EX(((i2.i0.u5.p13==0)||(i0.u63.p200==1))) * (i2.i2.u19.p57==0)) * (((i2.i0.u4.p11==0)||(i12.i1.u56.p176==1))||((i4.i1.u35.p114==...381
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((EX(((i2.i0.u5.p13==0)||(i0.u63.p200==1))) * (i2.i2.u19.p57==0)) * (((i2.i0.u4.p11==0)...540
Reverse transition relation is NOT exact ! Due to transitions t50, t53, t96, t99, t143, t146, t189, t192, t235, t238, t273, t276, t282, t288, t291, t295, i...1249
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 320/320 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 338 transition count 303
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 338 transition count 303
Applied a total of 34 rules in 8 ms. Remains 338 /355 variables (removed 17) and now considering 303/320 (removed 17) transitions.
// Phase 1: matrix 303 rows 338 cols
[2024-05-29 18:23:40] [INFO ] Computed 56 invariants in 5 ms
[2024-05-29 18:23:40] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-29 18:23:40] [INFO ] Invariant cache hit.
[2024-05-29 18:23:40] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2024-05-29 18:23:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:23:46] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:23:46] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:23:46] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:23:46] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:23:46] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:23:46] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:23:50] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 303/641 variables, 338/435 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:23:57] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:23:58] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:23:59] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/641 variables, 3/438 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:24:01] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 11 (OVERLAPS) 0/641 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 439 constraints, problems are : Problem set: 0 solved, 302 unsolved in 29352 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 45/101 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 303/641 variables, 338/439 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 302/741 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:24:15] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:24:15] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:24:16] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-05-29 18:24:16] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:24:16] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:24:16] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:24:17] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-29 18:24:17] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:24:17] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:24:17] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:24:18] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:24:18] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-29 18:24:18] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:24:19] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:24:19] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:24:19] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:24:19] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:24:20] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 18/759 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:24:24] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-29 18:24:24] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 2/761 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:24:31] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-29 18:24:32] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:24:33] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:24:34] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 4/765 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:24:40] [INFO ] Deduced a trap composed of 19 places in 90 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 641/641 variables, and 766 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 70/70 constraints]
After SMT, in 59395ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 59399ms
Starting structural reductions in LTL mode, iteration 1 : 338/355 places, 303/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59723 ms. Remains : 338/355 places, 303/320 transitions.
[2024-05-29 18:24:40] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:24:40] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:24:40] [INFO ] Input system was already deterministic with 303 transitions.
[2024-05-29 18:24:40] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:24:40] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:24:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality6282150145049429130.gal : 2 ms
[2024-05-29 18:24:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality7810026168111010749.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/CTLCardinality6282150145049429130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7810026168111010749.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-29 18:25:10] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:25:10] [INFO ] Applying decomposition
[2024-05-29 18:25:10] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5277723699163031583.txt' '-o' '/tmp/graph5277723699163031583.bin' '-w' '/tmp/graph5277723699163031583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5277723699163031583.bin' '-l' '-1' '-v' '-w' '/tmp/graph5277723699163031583.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:25:10] [INFO ] Decomposing Gal with order
[2024-05-29 18:25:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:25:10] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-29 18:25:10] [INFO ] Flatten gal took : 17 ms
[2024-05-29 18:25:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 18:25:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality18318700986298536175.gal : 5 ms
[2024-05-29 18:25:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality1088356979254545387.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/CTLCardinality18318700986298536175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1088356979254545387.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,2.42587e+32,7.95835,185816,3703,63,304398,631,678,871006,66,1611,0


Converting to forward existential form...Done !
original formula: EX(A((i1.i1.u105.p341==0) U ((AF(!(EX((i17.u86.p285==1)))) * AX((i2.i1.u21.p67!=1))) * E(((i12.i1.u59.p187==0)||(i4.i2.u25.p82==1)) U !((...198
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(((!(EG(!(!(EX((i17.u86.p285==1)))))) * !(EX(!((i2.i1.u21.p67!=1))))) * E(((i12.i1.u59.p187=...611
Reverse transition relation is NOT exact ! Due to transitions t49, t52, t99, t142, t145, t188, t191, t235, t238, t273, t282, t291, t294, t295, i0.i0.u79.t1...1245
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 320/320 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 337 transition count 302
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 337 transition count 302
Applied a total of 36 rules in 7 ms. Remains 337 /355 variables (removed 18) and now considering 302/320 (removed 18) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 18:25:40] [INFO ] Computed 56 invariants in 4 ms
[2024-05-29 18:25:40] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-29 18:25:40] [INFO ] Invariant cache hit.
[2024-05-29 18:25:40] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-29 18:25:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:25:44] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-05-29 18:25:44] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:25:44] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:25:44] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:25:44] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:25:44] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:25:44] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:25:44] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:25:44] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:25:44] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 3 ms to minimize.
[2024-05-29 18:25:44] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:25:44] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:25:45] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:25:45] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:25:45] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:25:45] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:25:45] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-29 18:25:45] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2024-05-29 18:25:45] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:25:45] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:25:45] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:25:46] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:25:46] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:25:46] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:25:46] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 3 ms to minimize.
[2024-05-29 18:25:46] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:25:46] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 18/94 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:25:51] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (OVERLAPS) 302/639 variables, 337/432 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:25:57] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:25:58] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:26:01] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:26:01] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:26:02] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:26:02] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 4/438 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:26:06] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/639 variables, and 439 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 46/102 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:26:13] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:26:15] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (OVERLAPS) 302/639 variables, 337/441 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 301/742 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:26:20] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:26:20] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:26:21] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-29 18:26:21] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:26:21] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:26:22] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-29 18:26:22] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:26:22] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:26:23] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:26:23] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2024-05-29 18:26:23] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:26:23] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:26:24] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:26:24] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:26:24] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-05-29 18:26:24] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:26:24] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:26:24] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 19/761 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:26:28] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:26:29] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:26:29] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:26:30] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:26:30] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-29 18:26:32] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 6/767 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 767 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 73/73 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 337/355 places, 302/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60439 ms. Remains : 337/355 places, 302/320 transitions.
[2024-05-29 18:26:41] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:26:41] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:26:41] [INFO ] Input system was already deterministic with 302 transitions.
[2024-05-29 18:26:41] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:26:41] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:26:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality11360775779134020520.gal : 2 ms
[2024-05-29 18:26:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality16602570852252903308.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/CTLCardinality11360775779134020520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16602570852252903308.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-29 18:27:11] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:27:11] [INFO ] Applying decomposition
[2024-05-29 18:27:11] [INFO ] Flatten gal took : 7 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/graph11653550338696130450.txt' '-o' '/tmp/graph11653550338696130450.bin' '-w' '/tmp/graph11653550338696130450.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11653550338696130450.bin' '-l' '-1' '-v' '-w' '/tmp/graph11653550338696130450.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:27:11] [INFO ] Decomposing Gal with order
[2024-05-29 18:27:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:27:11] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-29 18:27:11] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:27:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:27:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality8912336396418952360.gal : 3 ms
[2024-05-29 18:27:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality5313952297505921762.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/CTLCardinality8912336396418952360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5313952297505921762.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,2.08483e+32,7.96768,229360,3381,29,445455,450,632,1.12063e+06,52,1168,0


Converting to forward existential form...Done !
original formula: AF(((((i6.i2.u35.p108==0)&&(i4.i1.u13.p38==1)) * (EG(AG(EF((i0.i2.u100.p321==1)))) * EX(((i4.i2.u23.p68==0)||(i18.i0.u104.p340==1))))) * ...274
=> equivalent forward existential formula: [FwdG(Init,!(((((i6.i2.u35.p108==0)&&(i4.i1.u13.p38==1)) * (EG(!(E(TRUE U !(E(TRUE U (i0.i2.u100.p321==1)))))) *...343
Reverse transition relation is NOT exact ! Due to transitions t50, t53, t102, t148, t194, t234, t237, t267, t276, t285, t299, i0.t56, i0.i1.u102.t58, i0.i2...1178
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 355/355 places, 320/320 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 354 transition count 255
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 290 transition count 255
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 128 place count 290 transition count 221
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 196 place count 256 transition count 221
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 212 place count 240 transition count 205
Iterating global reduction 2 with 16 rules applied. Total rules applied 228 place count 240 transition count 205
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 228 place count 240 transition count 193
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 252 place count 228 transition count 193
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 412 place count 148 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 413 place count 148 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 415 place count 147 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 417 place count 145 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 418 place count 144 transition count 109
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 418 place count 144 transition count 107
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 422 place count 142 transition count 107
Applied a total of 422 rules in 55 ms. Remains 142 /355 variables (removed 213) and now considering 107/320 (removed 213) transitions.
// Phase 1: matrix 107 rows 142 cols
[2024-05-29 18:27:41] [INFO ] Computed 55 invariants in 1 ms
[2024-05-29 18:27:41] [INFO ] Implicit Places using invariants in 75 ms returned [121, 125]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 140/355 places, 107/320 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 138 transition count 105
Applied a total of 4 rules in 5 ms. Remains 138 /140 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 138 cols
[2024-05-29 18:27:41] [INFO ] Computed 53 invariants in 1 ms
[2024-05-29 18:27:41] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 18:27:41] [INFO ] Invariant cache hit.
[2024-05-29 18:27:41] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 138/355 places, 105/320 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 307 ms. Remains : 138/355 places, 105/320 transitions.
[2024-05-29 18:27:41] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:27:41] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:27:41] [INFO ] Input system was already deterministic with 105 transitions.
[2024-05-29 18:27:41] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:27:41] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:27:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality12709958567341516278.gal : 1 ms
[2024-05-29 18:27:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality3471848734848802638.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/CTLCardinality12709958567341516278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3471848734848802638.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.
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.8742e+20,0.331495,15552,2,248,5,48872,6,0,660,83485,0


Converting to forward existential form...Done !
original formula: EF(EG(AG(AF((p378==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !(!(EG(!((p378==0))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 18:28:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:28:11] [INFO ] Applying decomposition
[2024-05-29 18:28:11] [INFO ] Flatten gal took : 3 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/graph3349605521831225735.txt' '-o' '/tmp/graph3349605521831225735.bin' '-w' '/tmp/graph3349605521831225735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3349605521831225735.bin' '-l' '-1' '-v' '-w' '/tmp/graph3349605521831225735.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:28:11] [INFO ] Decomposing Gal with order
[2024-05-29 18:28:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:28:11] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-29 18:28:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:28:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 18:28:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality13670058213742099682.gal : 3 ms
[2024-05-29 18:28:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality7566287575888124070.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/CTLCardinality13670058213742099682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7566287575888124070.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,3.8742e+20,0.132784,8996,37,15,10879,122,245,24652,42,697,0


Converting to forward existential form...Done !
original formula: EF(EG(AG(AF((i13.u39.p378==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !(!(EG(!((i13.u39.p378==0))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 320/320 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 338 transition count 303
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 338 transition count 303
Applied a total of 34 rules in 13 ms. Remains 338 /355 variables (removed 17) and now considering 303/320 (removed 17) transitions.
// Phase 1: matrix 303 rows 338 cols
[2024-05-29 18:28:41] [INFO ] Computed 56 invariants in 4 ms
[2024-05-29 18:28:41] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-29 18:28:41] [INFO ] Invariant cache hit.
[2024-05-29 18:28:42] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2024-05-29 18:28:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:28:45] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:28:45] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:28:45] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:28:45] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:28:45] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:28:45] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:28:45] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:28:45] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:28:46] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:28:46] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:28:46] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:28:46] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:28:46] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:28:46] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:28:46] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:28:46] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:28:46] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-29 18:28:46] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:28:46] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:28:46] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:28:47] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:28:47] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
[2024-05-29 18:28:47] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:28:47] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:28:47] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:28:48] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:28:48] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:28:48] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:28:48] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:28:48] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:28:48] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:28:48] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:28:48] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:28:48] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:28:48] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:28:48] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:28:48] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:28:49] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:28:49] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 19/95 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:28:52] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:28:54] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:28:54] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:28:54] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:28:56] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:28:58] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:28:59] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:29:00] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (OVERLAPS) 303/641 variables, 338/441 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:29:05] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:29:09] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 641/641 variables, and 443 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 49/105 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:29:13] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (OVERLAPS) 303/641 variables, 338/444 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 302/746 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:29:19] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:29:19] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 3 ms to minimize.
[2024-05-29 18:29:20] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-29 18:29:20] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:29:20] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:29:20] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:29:21] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:29:21] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:29:21] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:29:22] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:29:22] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:29:23] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 12/758 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:29:27] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:29:27] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-29 18:29:27] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:29:28] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:29:28] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:29:28] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:29:29] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 7/765 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 641/641 variables, and 765 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 69/69 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 338/355 places, 303/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60374 ms. Remains : 338/355 places, 303/320 transitions.
[2024-05-29 18:29:42] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:29:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:29:42] [INFO ] Input system was already deterministic with 303 transitions.
[2024-05-29 18:29:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:29:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:29:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality3924582572048405868.gal : 2 ms
[2024-05-29 18:29:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality12053576229541679818.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/CTLCardinality3924582572048405868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12053576229541679818.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-29 18:30:12] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:30:12] [INFO ] Applying decomposition
[2024-05-29 18:30:12] [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/graph16382762874216216471.txt' '-o' '/tmp/graph16382762874216216471.bin' '-w' '/tmp/graph16382762874216216471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16382762874216216471.bin' '-l' '-1' '-v' '-w' '/tmp/graph16382762874216216471.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:30:12] [INFO ] Decomposing Gal with order
[2024-05-29 18:30:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:30:12] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-29 18:30:12] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:30:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 18:30:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality9560763447700218090.gal : 4 ms
[2024-05-29 18:30:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality13844146367429033615.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/CTLCardinality9560763447700218090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13844146367429033615.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 : 355/355 places, 320/320 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 336 transition count 301
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 336 transition count 301
Applied a total of 38 rules in 8 ms. Remains 336 /355 variables (removed 19) and now considering 301/320 (removed 19) transitions.
// Phase 1: matrix 301 rows 336 cols
[2024-05-29 18:30:42] [INFO ] Computed 56 invariants in 11 ms
[2024-05-29 18:30:42] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-29 18:30:42] [INFO ] Invariant cache hit.
[2024-05-29 18:30:42] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-29 18:30:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-29 18:30:45] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:30:46] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:30:46] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:30:46] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 1 ms to minimize.
[2024-05-29 18:30:46] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:30:46] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:30:46] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:30:46] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-29 18:30:46] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-05-29 18:30:46] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:30:46] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:30:46] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:30:46] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:30:47] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:30:47] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-29 18:30:47] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:30:47] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:30:47] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:30:47] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:30:47] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-29 18:30:47] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:30:48] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:30:48] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:30:48] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:30:48] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:30:48] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:30:48] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:30:48] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:30:49] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-29 18:30:52] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:30:52] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-29 18:30:54] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:30:54] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:30:54] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-29 18:30:55] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 301/637 variables, 336/434 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-29 18:31:01] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/637 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-29 18:31:07] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/637 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-29 18:31:11] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 637/637 variables, and 437 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 45/101 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 301/637 variables, 336/437 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/637 variables, 300/737 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-29 18:31:17] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-05-29 18:31:18] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-05-29 18:31:18] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:31:18] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:31:18] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-29 18:31:19] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:31:19] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:31:19] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-05-29 18:31:20] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:31:20] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2024-05-29 18:31:20] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:31:20] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-05-29 18:31:21] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:31:21] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:31:22] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:31:23] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 16/753 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-29 18:31:26] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:31:27] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:31:27] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-29 18:31:27] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 4/757 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-29 18:31:33] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-05-29 18:31:42] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 637/637 variables, and 759 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 67/67 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in LTL mode, iteration 1 : 336/355 places, 301/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60429 ms. Remains : 336/355 places, 301/320 transitions.
[2024-05-29 18:31:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:31:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:31:42] [INFO ] Input system was already deterministic with 301 transitions.
[2024-05-29 18:31:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:31:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:31:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality419580656661874362.gal : 2 ms
[2024-05-29 18:31:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality6112707942654972498.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/CTLCardinality419580656661874362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6112707942654972498.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 18:32:12] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:32:12] [INFO ] Applying decomposition
[2024-05-29 18:32:13] [INFO ] Flatten gal took : 6 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/graph16532830591171195365.txt' '-o' '/tmp/graph16532830591171195365.bin' '-w' '/tmp/graph16532830591171195365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16532830591171195365.bin' '-l' '-1' '-v' '-w' '/tmp/graph16532830591171195365.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:32:13] [INFO ] Decomposing Gal with order
[2024-05-29 18:32:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:32:13] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-29 18:32:13] [INFO ] Flatten gal took : 26 ms
[2024-05-29 18:32:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 18:32:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality14400436387085862914.gal : 4 ms
[2024-05-29 18:32:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality10130241239108261617.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/CTLCardinality14400436387085862914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10130241239108261617.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.83849e+32,6.78575,185564,2982,29,300934,377,620,1.19092e+06,45,1001,0


Converting to forward existential form...Done !
original formula: AG(((EG(AX((i16.i0.u81.p258==1))) + AG(((i5.i0.u37.p126==0)||(i17.i0.u99.p318==1)))) + (((i3.u14.p47==0) * AF((i2.i2.u17.p52==1))) + (AX(...200
=> equivalent forward existential formula: ([(EY(((FwdU(Init,TRUE) * !((EG(!(EX(!((i16.i0.u81.p258==1))))) + !(E(TRUE U !(((i5.i0.u37.p126==0)||(i17.i0.u99...479
Reverse transition relation is NOT exact ! Due to transitions t55, t95, t98, t141, t144, t193, t233, t236, t266, t271, t280, t284, t298, i0.t293, i0.i0.u2....1176
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 320/320 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 339 transition count 304
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 339 transition count 304
Applied a total of 32 rules in 6 ms. Remains 339 /355 variables (removed 16) and now considering 304/320 (removed 16) transitions.
// Phase 1: matrix 304 rows 339 cols
[2024-05-29 18:32:43] [INFO ] Computed 56 invariants in 3 ms
[2024-05-29 18:32:43] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-29 18:32:43] [INFO ] Invariant cache hit.
[2024-05-29 18:32:43] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-05-29 18:32:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-29 18:32:46] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:32:46] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:32:46] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:32:46] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:32:46] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:32:46] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:32:47] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:32:47] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:32:47] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:32:47] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:32:47] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:32:47] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:32:47] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:32:47] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:32:47] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:32:47] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:32:47] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:32:47] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:32:48] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:32:48] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-29 18:32:48] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:32:49] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-05-29 18:32:49] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:32:49] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:32:49] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:32:49] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:32:49] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:32:49] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:32:49] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:32:49] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:32:49] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:32:49] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:32:49] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:32:49] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:32:50] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:32:50] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:32:50] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:32:50] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:32:50] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 19/95 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-29 18:32:53] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-29 18:32:54] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:32:54] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 304/643 variables, 339/437 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-29 18:32:59] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:33:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:33:01] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 3/440 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-29 18:33:02] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:33:03] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 11 (OVERLAPS) 0/643 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 442 constraints, problems are : Problem set: 0 solved, 303 unsolved in 29093 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 47/103 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 304/643 variables, 339/442 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/643 variables, 303/745 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-29 18:33:17] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:33:17] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:33:18] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:33:18] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:33:18] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-29 18:33:19] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-05-29 18:33:19] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-29 18:33:19] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:33:20] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-29 18:33:20] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2024-05-29 18:33:21] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-05-29 18:33:21] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:33:21] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:33:21] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:33:21] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:33:22] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 16/761 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-29 18:33:26] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:33:26] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-29 18:33:27] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:33:28] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 4/765 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-29 18:33:35] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/643 variables, and 766 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 68/68 constraints]
After SMT, in 59133ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 59136ms
Starting structural reductions in LTL mode, iteration 1 : 339/355 places, 304/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59451 ms. Remains : 339/355 places, 304/320 transitions.
[2024-05-29 18:33:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:33:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:33:42] [INFO ] Input system was already deterministic with 304 transitions.
[2024-05-29 18:33:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:33:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:33:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality2038662856668230821.gal : 2 ms
[2024-05-29 18:33:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality650453862828683892.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/CTLCardinality2038662856668230821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality650453862828683892.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 18:34:12] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:34:12] [INFO ] Applying decomposition
[2024-05-29 18:34:12] [INFO ] Flatten gal took : 6 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/graph5136287394353630000.txt' '-o' '/tmp/graph5136287394353630000.bin' '-w' '/tmp/graph5136287394353630000.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5136287394353630000.bin' '-l' '-1' '-v' '-w' '/tmp/graph5136287394353630000.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:34:12] [INFO ] Decomposing Gal with order
[2024-05-29 18:34:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:34:12] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-29 18:34:12] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:34:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-29 18:34:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality11313707769316095780.gal : 7 ms
[2024-05-29 18:34:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality9575829734494392095.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/CTLCardinality11313707769316095780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9575829734494392095.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,2.77972e+32,5.77637,164956,2782,54,304647,816,651,791664,61,2216,0


Converting to forward existential form...Done !
original formula: (AF(((i1.i2.u17.p54==1) * AX((i0.i1.u11.p29==0)))) * AX(((((i10.i0.u51.p165==0) * !(A((i17.u109.p362==0) U (i2.u15.p45==1)))) * ((i2.u15....306
=> equivalent forward existential formula: ([FwdG(Init,!(((i1.i2.u17.p54==1) * !(EX(!((i0.i1.u11.p29==0)))))))] = FALSE * (([((EY(Init) * !(EG(E((((i5.i3.u...734
Reverse transition relation is NOT exact ! Due to transitions t56, t96, t99, t142, t145, t195, t236, t239, t274, t278, t287, t296, t301, i0.i0.u2.t246, i0....1268
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 320/320 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 337 transition count 302
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 337 transition count 302
Applied a total of 36 rules in 15 ms. Remains 337 /355 variables (removed 18) and now considering 302/320 (removed 18) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 18:34:42] [INFO ] Computed 56 invariants in 15 ms
[2024-05-29 18:34:43] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-29 18:34:43] [INFO ] Invariant cache hit.
[2024-05-29 18:34:43] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-29 18:34:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:34:46] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:34:46] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:34:46] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:34:46] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 2 ms to minimize.
[2024-05-29 18:34:46] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 5 ms to minimize.
[2024-05-29 18:34:46] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:34:46] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:34:46] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:34:47] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:34:47] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-29 18:34:47] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:34:47] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:34:47] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:34:47] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:34:47] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:34:47] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:34:47] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:34:47] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:34:47] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:34:47] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:34:48] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:34:48] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:34:48] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:34:49] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:34:49] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:34:49] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:34:49] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:34:49] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:34:49] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:34:49] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:34:49] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:34:49] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:34:49] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:34:49] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:34:49] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:34:52] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:34:53] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:34:55] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 302/639 variables, 337/431 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:35:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:35:00] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:35:00] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:35:00] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:35:00] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:35:01] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 6/437 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:35:02] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:35:02] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:35:03] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 3/440 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:35:07] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:35:11] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/639 variables, and 442 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 49/105 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:35:15] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (OVERLAPS) 302/639 variables, 337/443 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 301/744 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:35:20] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-05-29 18:35:21] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:35:21] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:35:22] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:35:22] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-29 18:35:23] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:35:23] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:35:23] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:35:23] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 9/753 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:35:28] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:35:28] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-29 18:35:29] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:35:30] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 4/757 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:35:36] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:35:36] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-29 18:35:38] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 3/760 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 760 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 66/66 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 337/355 places, 302/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60413 ms. Remains : 337/355 places, 302/320 transitions.
[2024-05-29 18:35:43] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:35:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:35:43] [INFO ] Input system was already deterministic with 302 transitions.
[2024-05-29 18:35:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:35:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:35:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality1835094532810361428.gal : 1 ms
[2024-05-29 18:35:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality4757505377544332998.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/CTLCardinality1835094532810361428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4757505377544332998.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-29 18:36:13] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:36:13] [INFO ] Applying decomposition
[2024-05-29 18:36:13] [INFO ] Flatten gal took : 7 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/graph3682433347480572957.txt' '-o' '/tmp/graph3682433347480572957.bin' '-w' '/tmp/graph3682433347480572957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3682433347480572957.bin' '-l' '-1' '-v' '-w' '/tmp/graph3682433347480572957.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:36:13] [INFO ] Decomposing Gal with order
[2024-05-29 18:36:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:36:13] [INFO ] Removed a total of 51 redundant transitions.
[2024-05-29 18:36:13] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:36:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 18:36:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality13464001497707807720.gal : 3 ms
[2024-05-29 18:36:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality4391961609306031973.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/CTLCardinality13464001497707807720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4391961609306031973.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.92861e+32,8.61302,196644,3221,29,325514,622,631,1.33833e+06,45,1663,0


Converting to forward existential form...Done !
original formula: AX(AG(EF((((i16.i1.u108.p348==0)&&(i10.i1.u64.p209==1))||(((i12.i4.u72.p235==0)&&(i2.u15.p47==1))&&(i6.u43.p139==0))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U (((i16.i1.u108.p348==0)&&(i10.i1.u64.p209==1))||(((i12.i4.u72.p235==0)&&(i2.u...198
Reverse transition relation is NOT exact ! Due to transitions t50, t53, t96, t99, t148, t194, t234, t237, t272, t276, t285, t299, i0.t267, i0.i1.u82.t98, i...1198
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 320/320 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 337 transition count 302
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 337 transition count 302
Applied a total of 36 rules in 8 ms. Remains 337 /355 variables (removed 18) and now considering 302/320 (removed 18) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 18:36:43] [INFO ] Computed 56 invariants in 17 ms
[2024-05-29 18:36:43] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-29 18:36:43] [INFO ] Invariant cache hit.
[2024-05-29 18:36:43] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-29 18:36:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:36:47] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:36:47] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:36:47] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:36:47] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:36:47] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:36:47] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:36:47] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:36:47] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:36:47] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:36:47] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:36:47] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:36:47] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:36:48] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:36:48] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:36:48] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:36:48] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:36:48] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:36:48] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:36:48] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:36:48] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:36:49] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:36:49] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:36:49] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:36:49] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:36:49] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:36:49] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:36:49] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:36:50] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:36:50] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:36:50] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:36:50] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:36:50] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:36:50] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:36:50] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:36:50] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:36:50] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:36:53] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:36:54] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:36:55] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 302/639 variables, 337/432 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:36:59] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:37:00] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:37:00] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:37:00] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:37:01] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 5/437 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:37:03] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:37:03] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:37:03] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:37:04] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:37:04] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 5/442 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:37:10] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-29 18:37:10] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/639 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/639 variables, and 444 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 51/107 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/639 variables, 337/444 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/639 variables, 301/745 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:37:18] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-29 18:37:19] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:37:19] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:37:19] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:37:20] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-29 18:37:21] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:37:21] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:37:21] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-29 18:37:22] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:37:22] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 10/755 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:37:26] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:37:27] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 2/757 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:37:33] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 3 ms to minimize.
[2024-05-29 18:37:34] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 2/759 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:37:43] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 760 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 66/66 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 337/355 places, 302/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60380 ms. Remains : 337/355 places, 302/320 transitions.
[2024-05-29 18:37:43] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:37:43] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:37:44] [INFO ] Input system was already deterministic with 302 transitions.
[2024-05-29 18:37:44] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:37:44] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:37:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality678512837887222157.gal : 1 ms
[2024-05-29 18:37:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality17864148686302506493.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/CTLCardinality678512837887222157.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17864148686302506493.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-29 18:38:14] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:38:14] [INFO ] Applying decomposition
[2024-05-29 18:38:14] [INFO ] Flatten gal took : 6 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/graph7219949351097639780.txt' '-o' '/tmp/graph7219949351097639780.bin' '-w' '/tmp/graph7219949351097639780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7219949351097639780.bin' '-l' '-1' '-v' '-w' '/tmp/graph7219949351097639780.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:38:14] [INFO ] Decomposing Gal with order
[2024-05-29 18:38:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:38:14] [INFO ] Removed a total of 54 redundant transitions.
[2024-05-29 18:38:14] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:38:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 18:38:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality10124487014376824238.gal : 3 ms
[2024-05-29 18:38:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality16603587486673284043.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/CTLCardinality10124487014376824238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16603587486673284043.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.83849e+32,6.62011,173716,3077,29,303226,544,651,955029,50,1420,0


Converting to forward existential form...Done !
original formula: AG((((AG(((i15.i2.u93.p289==0)||(i18.i0.u105.p326==1))) + (i5.i2.u17.p56==1)) + (AG((i0.i2.u116.p364==0)) + AX((((i1.i1.u4.p10==0)&&(i8.i...375
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * !(((((i12.i1.u75.p234==0)&&(i16.u90.p278==0))&&((i4.u49.p149==1)&&(i18.i2.u122.p382==0...462
Reverse transition relation is NOT exact ! Due to transitions t49, t55, t95, t98, t141, t144, t194, t234, t237, t272, t281, t285, t299, i0.i2.t36, i0.i2.t4...1192
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 320/320 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 337 transition count 302
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 337 transition count 302
Applied a total of 36 rules in 11 ms. Remains 337 /355 variables (removed 18) and now considering 302/320 (removed 18) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 18:38:44] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 18:38:44] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-29 18:38:44] [INFO ] Invariant cache hit.
[2024-05-29 18:38:44] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-29 18:38:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:38:47] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:38:47] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:38:47] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:38:47] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:38:47] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:38:48] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:38:48] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:38:48] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:38:48] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:38:48] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:38:48] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:38:48] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:38:48] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:38:48] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:38:48] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:38:49] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:38:49] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:38:49] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:38:49] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:38:49] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:38:50] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:38:50] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:38:50] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:38:50] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:38:50] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2024-05-29 18:38:50] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:38:50] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:38:50] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:38:50] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:38:51] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:38:51] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:38:51] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:38:51] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:38:51] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:38:54] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:38:54] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:38:55] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:38:56] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 302/639 variables, 337/431 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:39:00] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:39:01] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 2/433 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:39:03] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:39:04] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:39:04] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 3/436 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:39:09] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/639 variables, and 437 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 44/100 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:39:17] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (OVERLAPS) 302/639 variables, 337/438 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 301/739 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:39:21] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2024-05-29 18:39:21] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:39:21] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:39:22] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:39:22] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-29 18:39:22] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:39:22] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:39:23] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:39:23] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:39:23] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:39:24] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:39:24] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:39:24] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:39:24] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:39:25] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:39:25] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:39:25] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-29 18:39:26] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 18/757 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:39:30] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:39:32] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-05-29 18:39:33] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 3/760 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:39:38] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 761 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 67/67 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 337/355 places, 302/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60357 ms. Remains : 337/355 places, 302/320 transitions.
[2024-05-29 18:39:44] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:39:44] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:39:44] [INFO ] Input system was already deterministic with 302 transitions.
[2024-05-29 18:39:44] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:39:44] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:39:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality1948518416379053532.gal : 1 ms
[2024-05-29 18:39:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality3150669070699349094.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/CTLCardinality1948518416379053532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3150669070699349094.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-29 18:40:14] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:40:14] [INFO ] Applying decomposition
[2024-05-29 18:40:14] [INFO ] Flatten gal took : 6 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/graph12110959819126214294.txt' '-o' '/tmp/graph12110959819126214294.bin' '-w' '/tmp/graph12110959819126214294.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12110959819126214294.bin' '-l' '-1' '-v' '-w' '/tmp/graph12110959819126214294.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:40:14] [INFO ] Decomposing Gal with order
[2024-05-29 18:40:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:40:14] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-29 18:40:14] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:40:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:40:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality3280476975357514962.gal : 3 ms
[2024-05-29 18:40:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality6279103549820337368.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/CTLCardinality3280476975357514962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6279103549820337368.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,2.0824e+32,6.36001,173688,2792,29,331103,367,616,834138,47,1060,0


Converting to forward existential form...Done !
original formula: A((i11.i1.u64.p213!=1) U AF(((i17.i0.u105.p337==1) + AG(!(AX((i2.u15.p48==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((i17.i0.u105.p337==1) + !(E(TRUE U !(!(!(EX(!((i2.u15.p48==1)))))))))))))))) * !(E(!(!(...361
Reverse transition relation is NOT exact ! Due to transitions t49, t52, t95, t98, t147, t187, t190, t234, t237, t272, t276, t285, t294, i0.i0.u2.t244, i0.i...1197
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 355/355 places, 320/320 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 354 transition count 257
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 125 place count 292 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 291 transition count 256
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 126 place count 291 transition count 221
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 196 place count 256 transition count 221
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 211 place count 241 transition count 206
Iterating global reduction 3 with 15 rules applied. Total rules applied 226 place count 241 transition count 206
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 226 place count 241 transition count 195
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 248 place count 230 transition count 195
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 406 place count 151 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 407 place count 151 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 409 place count 150 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 411 place count 148 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 412 place count 147 transition count 112
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 412 place count 147 transition count 110
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 416 place count 145 transition count 110
Applied a total of 416 rules in 32 ms. Remains 145 /355 variables (removed 210) and now considering 110/320 (removed 210) transitions.
// Phase 1: matrix 110 rows 145 cols
[2024-05-29 18:40:44] [INFO ] Computed 55 invariants in 0 ms
[2024-05-29 18:40:44] [INFO ] Implicit Places using invariants in 67 ms returned [125, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 143/355 places, 110/320 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 142 transition count 109
Applied a total of 2 rules in 4 ms. Remains 142 /143 variables (removed 1) and now considering 109/110 (removed 1) transitions.
// Phase 1: matrix 109 rows 142 cols
[2024-05-29 18:40:44] [INFO ] Computed 53 invariants in 1 ms
[2024-05-29 18:40:45] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 18:40:45] [INFO ] Invariant cache hit.
[2024-05-29 18:40:45] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 142/355 places, 109/320 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 275 ms. Remains : 142/355 places, 109/320 transitions.
[2024-05-29 18:40:45] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:40:45] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:40:45] [INFO ] Input system was already deterministic with 109 transitions.
[2024-05-29 18:40:45] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:40:45] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:40:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality14535425062689025810.gal : 1 ms
[2024-05-29 18:40:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality10531065720707466783.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/CTLCardinality14535425062689025810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10531065720707466783.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.30842e+20,0.397161,20320,2,304,5,65232,6,0,679,117550,0


Converting to forward existential form...Done !
original formula: AF(((EF(((p301!=0)&&(p22!=1))) * (p257!=0)) * ((p333!=1)&&(p48!=0))))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U ((p301!=0)&&(p22!=1))) * (p257!=0)) * ((p333!=1)&&(p48!=0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t52, t77, t97, t108, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Detected timeout of ITS tools.
[2024-05-29 18:41:15] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:41:15] [INFO ] Applying decomposition
[2024-05-29 18:41:15] [INFO ] Flatten gal took : 2 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/graph8954571829107028701.txt' '-o' '/tmp/graph8954571829107028701.bin' '-w' '/tmp/graph8954571829107028701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8954571829107028701.bin' '-l' '-1' '-v' '-w' '/tmp/graph8954571829107028701.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:41:15] [INFO ] Decomposing Gal with order
[2024-05-29 18:41:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:41:15] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-29 18:41:15] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:41:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 18:41:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality17355855211686062063.gal : 1 ms
[2024-05-29 18:41:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality6684654547616436678.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/CTLCardinality17355855211686062063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6684654547616436678.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,9.30842e+20,0.114048,8784,68,21,10570,173,287,22151,47,812,0


Converting to forward existential form...Done !
original formula: AF(((EF(((i11.u32.p301!=0)&&(i1.u2.p22!=1))) * (i9.u28.p257!=0)) * ((i15.i0.u35.p333!=1)&&(i5.u6.p48!=0))))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U ((i11.u32.p301!=0)&&(i1.u2.p22!=1))) * (i9.u28.p257!=0)) * ((i15.i0.u35.p333!=1)&&(i5.u6...176
Reverse transition relation is NOT exact ! Due to transitions t97, t108, i12.u31.t52, i13.u30.t77, Intersection with reachable at each step enabled. (dest...198
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 320/320 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 338 transition count 303
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 338 transition count 303
Applied a total of 34 rules in 14 ms. Remains 338 /355 variables (removed 17) and now considering 303/320 (removed 17) transitions.
// Phase 1: matrix 303 rows 338 cols
[2024-05-29 18:41:45] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 18:41:45] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-29 18:41:45] [INFO ] Invariant cache hit.
[2024-05-29 18:41:45] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2024-05-29 18:41:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:41:48] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:41:48] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:41:48] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:41:48] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:41:49] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:41:49] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:41:49] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:41:49] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:41:49] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2024-05-29 18:41:49] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:41:49] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:41:49] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:41:49] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 5 ms to minimize.
[2024-05-29 18:41:49] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:41:50] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:41:50] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:41:50] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:41:50] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:41:50] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-05-29 18:41:50] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:41:50] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:41:51] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:41:51] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:41:51] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:41:51] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:41:51] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:41:51] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:41:51] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:41:52] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:41:52] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:41:52] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:41:52] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 5 ms to minimize.
[2024-05-29 18:41:52] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:41:52] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:41:52] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:41:55] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:41:55] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 303/641 variables, 338/431 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:42:01] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:42:01] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:42:01] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:42:01] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:42:02] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:42:02] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:42:02] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 7/438 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:42:04] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:42:05] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:42:05] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:42:05] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 4/442 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:42:06] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:42:11] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:42:14] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 641/641 variables, and 445 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 51/107 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 303/641 variables, 338/445 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 302/747 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:42:20] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:42:20] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-29 18:42:20] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:42:21] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:42:21] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:42:22] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:42:22] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:42:22] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:42:22] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:42:23] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-29 18:42:24] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 11/758 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:42:28] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:42:28] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:42:28] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:42:29] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-29 18:42:30] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:42:30] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:42:30] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-05-29 18:42:31] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:42:31] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:42:31] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:42:32] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 11/769 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 641/641 variables, and 769 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 73/73 constraints]
After SMT, in 60045ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60047ms
Starting structural reductions in LTL mode, iteration 1 : 338/355 places, 303/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60395 ms. Remains : 338/355 places, 303/320 transitions.
[2024-05-29 18:42:45] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:42:45] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:42:45] [INFO ] Input system was already deterministic with 303 transitions.
[2024-05-29 18:42:45] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:42:45] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:42:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality1405816115865428530.gal : 1 ms
[2024-05-29 18:42:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality2923473433890102631.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/CTLCardinality1405816115865428530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2923473433890102631.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-29 18:43:15] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:43:15] [INFO ] Applying decomposition
[2024-05-29 18:43:15] [INFO ] Flatten gal took : 6 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/graph8564157296649906209.txt' '-o' '/tmp/graph8564157296649906209.bin' '-w' '/tmp/graph8564157296649906209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8564157296649906209.bin' '-l' '-1' '-v' '-w' '/tmp/graph8564157296649906209.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:43:15] [INFO ] Decomposing Gal with order
[2024-05-29 18:43:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:43:15] [INFO ] Removed a total of 51 redundant transitions.
[2024-05-29 18:43:15] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:43:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 18:43:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality15255939863504427708.gal : 3 ms
[2024-05-29 18:43:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality8827169767117562238.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/CTLCardinality15255939863504427708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8827169767117562238.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,2.37426e+32,4.62538,118504,2656,50,214747,465,687,583334,59,1225,0


Converting to forward existential form...Done !
original formula: EF((A(!(((i13.i1.u82.p261==0)||((i9.i2.u58.p186!=0)&&(i9.i4.u74.p230!=0)))) U !(EX((i18.i1.u108.p342!=1)))) + ((i2.i1.u15.p46==1) * E(((i...297
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(!(EX((i18.i1.u108.p342!=1))))))) * !(E(!(!(EX((i18.i1.u108.p342!=1)))) U (!(!(((i13...719
Reverse transition relation is NOT exact ! Due to transitions t49, t52, t95, t98, t148, t188, t191, t235, t238, t268, t277, t291, t295, i0.i0.t211, i0.i0.u...1228
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 355/355 places, 320/320 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 354 transition count 256
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 291 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 290 transition count 255
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 128 place count 290 transition count 221
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 196 place count 256 transition count 221
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 212 place count 240 transition count 205
Iterating global reduction 3 with 16 rules applied. Total rules applied 228 place count 240 transition count 205
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 228 place count 240 transition count 193
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 252 place count 228 transition count 193
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 412 place count 148 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 413 place count 148 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 415 place count 147 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 417 place count 145 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 418 place count 144 transition count 109
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 418 place count 144 transition count 107
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 422 place count 142 transition count 107
Applied a total of 422 rules in 35 ms. Remains 142 /355 variables (removed 213) and now considering 107/320 (removed 213) transitions.
// Phase 1: matrix 107 rows 142 cols
[2024-05-29 18:43:45] [INFO ] Computed 55 invariants in 1 ms
[2024-05-29 18:43:46] [INFO ] Implicit Places using invariants in 80 ms returned [122, 126]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 140/355 places, 107/320 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 138 transition count 105
Applied a total of 4 rules in 4 ms. Remains 138 /140 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 138 cols
[2024-05-29 18:43:46] [INFO ] Computed 53 invariants in 1 ms
[2024-05-29 18:43:46] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 18:43:46] [INFO ] Invariant cache hit.
[2024-05-29 18:43:46] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 138/355 places, 105/320 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 297 ms. Remains : 138/355 places, 105/320 transitions.
[2024-05-29 18:43:46] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:43:46] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:43:46] [INFO ] Input system was already deterministic with 105 transitions.
[2024-05-29 18:43:46] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:43:46] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:43:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality77594280328867437.gal : 1 ms
[2024-05-29 18:43:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality7391783275299126478.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/CTLCardinality77594280328867437.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7391783275299126478.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 -...281
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.8742e+20,0.103477,8160,2,417,5,20143,6,0,660,28054,0


Converting to forward existential form...Done !
original formula: EF(!(A((p191!=1) U (p43==1))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),!((p43==1))) * (!((p191!=1)) * !((p43==1))))] != FALSE + [FwdG(FwdU(Init,TRUE),!((p43==1...169
Hit Full ! (commute/partial/dont) 103/0/2
(forward)formula 0,1,0.111088,8424,1,0,10,20143,19,3,1230,28054,5
FORMULA ShieldPPPt-PT-005B-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 355/355 places, 320/320 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 354 transition count 256
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 291 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 290 transition count 255
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 128 place count 290 transition count 221
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 196 place count 256 transition count 221
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 211 place count 241 transition count 206
Iterating global reduction 3 with 15 rules applied. Total rules applied 226 place count 241 transition count 206
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 226 place count 241 transition count 195
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 248 place count 230 transition count 195
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 410 place count 149 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 411 place count 149 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 413 place count 148 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 415 place count 146 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 416 place count 145 transition count 110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 416 place count 145 transition count 108
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 420 place count 143 transition count 108
Applied a total of 420 rules in 27 ms. Remains 143 /355 variables (removed 212) and now considering 108/320 (removed 212) transitions.
// Phase 1: matrix 108 rows 143 cols
[2024-05-29 18:43:46] [INFO ] Computed 55 invariants in 1 ms
[2024-05-29 18:43:46] [INFO ] Implicit Places using invariants in 79 ms returned [123, 127]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 141/355 places, 108/320 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 139 transition count 106
Applied a total of 4 rules in 5 ms. Remains 139 /141 variables (removed 2) and now considering 106/108 (removed 2) transitions.
// Phase 1: matrix 106 rows 139 cols
[2024-05-29 18:43:46] [INFO ] Computed 53 invariants in 0 ms
[2024-05-29 18:43:46] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 18:43:46] [INFO ] Invariant cache hit.
[2024-05-29 18:43:46] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 139/355 places, 106/320 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 307 ms. Remains : 139/355 places, 106/320 transitions.
[2024-05-29 18:43:46] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:43:46] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:43:46] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-29 18:43:46] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:43:46] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:43:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality2640164699166287002.gal : 1 ms
[2024-05-29 18:43:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality12115329099057123335.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/CTLCardinality2640164699166287002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12115329099057123335.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.
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,5.16561e+20,0.309965,17140,2,250,5,53921,6,0,665,94720,0


Converting to forward existential form...Done !
original formula: A(((p308==0)||(p279==1)) U EG((p25==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(EG((p25==1)))))) * !(E(!(EG((p25==1))) U (!(((p308==0)||(p279==1))) * !(EG((p25==1)))))))] != F...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 104/0/2
Detected timeout of ITS tools.
[2024-05-29 18:44:16] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:44:16] [INFO ] Applying decomposition
[2024-05-29 18:44:16] [INFO ] Flatten gal took : 2 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/graph10987812554634584417.txt' '-o' '/tmp/graph10987812554634584417.bin' '-w' '/tmp/graph10987812554634584417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10987812554634584417.bin' '-l' '-1' '-v' '-w' '/tmp/graph10987812554634584417.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:44:16] [INFO ] Decomposing Gal with order
[2024-05-29 18:44:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:44:16] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-29 18:44:16] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:44:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 18:44:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality18207200071107198153.gal : 1 ms
[2024-05-29 18:44:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality15657071280773973545.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/CTLCardinality18207200071107198153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15657071280773973545.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,5.16561e+20,0.102629,8492,41,15,10392,124,265,21827,44,711,0


Converting to forward existential form...Done !
original formula: A(((i11.u32.p308==0)||(i13.u29.p279==1)) U EG((i2.i0.u2.p25==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(EG((i2.i0.u2.p25==1)))))) * !(E(!(EG((i2.i0.u2.p25==1))) U (!(((i11.u32.p308==0)||(i13.u29.p279...202
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
[2024-05-29 18:44:46] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:44:46] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:44:46] [INFO ] Applying decomposition
[2024-05-29 18:44:46] [INFO ] Flatten gal took : 6 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/graph5397492677429005040.txt' '-o' '/tmp/graph5397492677429005040.bin' '-w' '/tmp/graph5397492677429005040.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5397492677429005040.bin' '-l' '-1' '-v' '-w' '/tmp/graph5397492677429005040.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:44:46] [INFO ] Decomposing Gal with order
[2024-05-29 18:44:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:44:46] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-29 18:44:46] [INFO ] Flatten gal took : 23 ms
[2024-05-29 18:44:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:44:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality2655272467827946341.gal : 3 ms
[2024-05-29 18:44:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality1472063132224456308.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/CTLCardinality2655272467827946341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1472063132224456308.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 13 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.76431e+33,50.3146,1070948,9765,55,1.78562e+06,571,719,6.28157e+06,64,2385,0


Converting to forward existential form...Done !
original formula: AG(AF((((EX(((i2.i1.u5.p13==0)||(i0.u64.p200==1))) * (i3.i2.u20.p57==0)) * (((i2.i1.u4.p11==0)||(i11.i0.u59.p176==1))||((i6.i2.u38.p114==...384
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((EX(((i2.i1.u5.p13==0)||(i0.u64.p200==1))) * (i3.i2.u20.p57==0)) * (((i2.i1.u4.p11==0)...539
Reverse transition relation is NOT exact ! Due to transitions t53, t56, t109, t158, t207, t252, t255, t293, t294, t296, t302, t303, t311, i0.t150, i0.t149,...1705
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
[2024-05-29 19:12:47] [INFO ] Applying decomposition
[2024-05-29 19:12:47] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:12:47] [INFO ] Decomposing Gal with order
[2024-05-29 19:12:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:12:47] [INFO ] Removed a total of 7 redundant transitions.
[2024-05-29 19:12:47] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:12:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2024-05-29 19:12:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality3399743303303287551.gal : 4 ms
[2024-05-29 19:12:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality8942105213581164828.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/CTLCardinality3399743303303287551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8942105213581164828.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 13 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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="ShieldPPPt-PT-005B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldPPPt-PT-005B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683761400601"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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