Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 08:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 204K Apr 12 08:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 08:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 127K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716358854170

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 06:20:55] [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-22 06:20:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 06:20:55] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-22 06:20:55] [INFO ] Transformed 479 places.
[2024-05-22 06:20:55] [INFO ] Transformed 430 transitions.
[2024-05-22 06:20:55] [INFO ] Found NUPN structural information;
[2024-05-22 06:20:55] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
FORMULA DES-PT-50b-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 103 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 430/430 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 476 transition count 430
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 457 transition count 411
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 457 transition count 411
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 447 transition count 401
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 447 transition count 401
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 447 transition count 394
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 446 transition count 393
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 446 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 446 transition count 392
Applied a total of 71 rules in 125 ms. Remains 446 /479 variables (removed 33) and now considering 392/430 (removed 38) transitions.
// Phase 1: matrix 392 rows 446 cols
[2024-05-22 06:20:55] [INFO ] Computed 62 invariants in 49 ms
[2024-05-22 06:20:56] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-22 06:20:56] [INFO ] Invariant cache hit.
[2024-05-22 06:20:56] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2024-05-22 06:20:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 34/49 constraints. Problems are: Problem set: 0 solved, 391 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 392/838 variables, 446/508 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-22 06:21:06] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 27 ms to minimize.
[2024-05-22 06:21:06] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
[2024-05-22 06:21:07] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 14 ms to minimize.
[2024-05-22 06:21:07] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-22 06:21:07] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 6 ms to minimize.
[2024-05-22 06:21:07] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 12 ms to minimize.
[2024-05-22 06:21:07] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 4 ms to minimize.
[2024-05-22 06:21:08] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:21:08] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-22 06:21:08] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:21:08] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:21:09] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 3 ms to minimize.
[2024-05-22 06:21:09] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-22 06:21:09] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:21:09] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-22 06:21:09] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:21:09] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-22 06:21:09] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-05-22 06:21:09] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:21:09] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 20/528 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-22 06:21:10] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-22 06:21:13] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2024-05-22 06:21:14] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2024-05-22 06:21:14] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/838 variables, 4/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-22 06:21:20] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/838 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-22 06:21:23] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:21:23] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:21:24] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:21:24] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:21:24] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:21:24] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:21:24] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:21:24] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:21:24] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 838/838 variables, and 542 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 34/49 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 34/96 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-22 06:21:30] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 6 ms to minimize.
[2024-05-22 06:21:30] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:21:30] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:21:30] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:21:30] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:21:30] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:21:30] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:21:30] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:21:31] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-22 06:21:31] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-22 06:21:31] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:21:31] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:21:31] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:21:32] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:21:32] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:21:34] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-22 06:21:35] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
[2024-05-22 06:21:37] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (OVERLAPS) 392/838 variables, 446/560 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/838 variables, 391/951 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 838/838 variables, and 951 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 52/52 constraints]
After SMT, in 60351ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60397ms
Starting structural reductions in LTL mode, iteration 1 : 446/479 places, 392/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61442 ms. Remains : 446/479 places, 392/430 transitions.
Support contains 103 out of 446 places after structural reductions.
[2024-05-22 06:21:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 06:21:57] [INFO ] Flatten gal took : 57 ms
FORMULA DES-PT-50b-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 06:21:57] [INFO ] Flatten gal took : 28 ms
[2024-05-22 06:21:57] [INFO ] Input system was already deterministic with 392 transitions.
Support contains 86 out of 446 places (down from 103) after GAL structural reductions.
RANDOM walk for 40000 steps (360 resets) in 2180 ms. (18 steps per ms) remains 30/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
[2024-05-22 06:21:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 96/141 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 74/215 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 215/430 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 3/433 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 382/815 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/815 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 16/831 variables, 9/504 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/831 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 5/836 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/836 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 15 (OVERLAPS) 2/838 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/838 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 17 (OVERLAPS) 0/838 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 838/838 variables, and 508 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 96/141 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 74/215 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 215/430 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 3/433 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 382/815 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/815 variables, 27/522 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-22 06:22:05] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-05-22 06:22:05] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:22:05] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:22:05] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 2 ms to minimize.
[2024-05-22 06:22:05] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 2 ms to minimize.
[2024-05-22 06:22:06] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:22:06] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2024-05-22 06:22:06] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:22:06] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:22:06] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:22:06] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:22:07] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:22:07] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:22:07] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:22:07] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/815 variables, 15/537 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 815/838 variables, and 537 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 433/446 constraints, PredecessorRefiner: 27/30 constraints, Known Traps: 15/15 constraints]
After SMT, in 10031ms problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 392/392 transitions.
Graph (complete) has 1038 edges and 446 vertex of which 440 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 440 transition count 373
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 32 place count 426 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 425 transition count 372
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 33 place count 425 transition count 365
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 47 place count 418 transition count 365
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 51 place count 414 transition count 361
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 414 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 414 transition count 360
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 59 place count 411 transition count 357
Iterating global reduction 4 with 3 rules applied. Total rules applied 62 place count 411 transition count 357
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 65 place count 411 transition count 354
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 65 place count 411 transition count 353
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 67 place count 410 transition count 353
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 2 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 205 place count 341 transition count 284
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 213 place count 337 transition count 293
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 215 place count 337 transition count 291
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 217 place count 335 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 335 transition count 290
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 335 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 220 place count 334 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 221 place count 333 transition count 289
Applied a total of 221 rules in 167 ms. Remains 333 /446 variables (removed 113) and now considering 289/392 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 333/446 places, 289/392 transitions.
RANDOM walk for 40000 steps (1362 resets) in 718 ms. (55 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (26 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (20 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (20 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (22 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (24 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (21 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (22 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (23 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (23 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (23 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (23 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (21 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (24 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (23 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (25 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (26 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (21 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (25 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (23 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (20 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (25 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (21 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (24 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (25 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (22 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (24 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 399715 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :4 out of 30
Probabilistic random walk after 399715 steps, saw 96842 distinct states, run finished after 3004 ms. (steps per millisecond=133 ) properties seen :4
// Phase 1: matrix 289 rows 333 cols
[2024-05-22 06:22:12] [INFO ] Computed 60 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 60/102 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 14/116 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 161/277 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 7/284 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 253/537 variables, 284/341 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/537 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 56/593 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 3/364 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/593 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 29/622 variables, 29/393 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/622 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (OVERLAPS) 0/622 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 622/622 variables, and 393 constraints, problems are : Problem set: 0 solved, 26 unsolved in 2674 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 60/102 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 14/116 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 161/277 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 06:22:14] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 7/284 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 06:22:15] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:22:15] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 253/537 variables, 284/344 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/537 variables, 19/363 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 06:22:16] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:22:16] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:22:16] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:22:17] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-22 06:22:17] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-22 06:22:17] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-22 06:22:18] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/537 variables, 7/370 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/537 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (OVERLAPS) 56/593 variables, 20/390 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/593 variables, 3/393 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/593 variables, 7/400 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 06:22:28] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:22:28] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:22:28] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/593 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 06:22:32] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:22:33] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/593 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 06:22:39] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/593 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/593 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 22 (OVERLAPS) 29/622 variables, 29/435 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/622 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 24 (OVERLAPS) 0/622 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 622/622 variables, and 435 constraints, problems are : Problem set: 0 solved, 26 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 16/16 constraints]
After SMT, in 47710ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 5309 ms.
Support contains 42 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 289/289 transitions.
Applied a total of 0 rules in 10 ms. Remains 333 /333 variables (removed 0) and now considering 289/289 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 333/333 places, 289/289 transitions.
RANDOM walk for 40000 steps (1406 resets) in 294 ms. (135 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (24 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (25 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (23 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (22 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (25 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (23 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (25 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (25 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (17 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (22 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (21 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (20 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (21 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (27 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (20 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (19 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (27 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (20 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (21 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (22 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (23 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (25 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (18 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 453771 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 26
Probabilistic random walk after 453771 steps, saw 110151 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
[2024-05-22 06:23:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 60/102 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 14/116 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 161/277 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 7/284 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 253/537 variables, 284/341 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/537 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 56/593 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 3/364 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/593 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 29/622 variables, 29/393 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/622 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (OVERLAPS) 0/622 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 622/622 variables, and 393 constraints, problems are : Problem set: 0 solved, 26 unsolved in 2713 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 60/102 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 14/116 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 161/277 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 7/284 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 06:23:11] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:23:11] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 253/537 variables, 284/343 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/537 variables, 19/362 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 06:23:12] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-22 06:23:13] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:23:13] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:23:13] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:23:14] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/537 variables, 5/367 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 06:23:17] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/537 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 06:23:21] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/537 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 06:23:25] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:23:25] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/537 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/537 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 17 (OVERLAPS) 56/593 variables, 20/391 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/593 variables, 3/394 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/593 variables, 7/401 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 06:23:36] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:23:36] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/593 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-22 06:23:41] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/593 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/593 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 23 (OVERLAPS) 29/622 variables, 29/433 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/622 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 25 (OVERLAPS) 0/622 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 622/622 variables, and 433 constraints, problems are : Problem set: 0 solved, 26 unsolved in 54473 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 14/14 constraints]
After SMT, in 57212ms problems are : Problem set: 0 solved, 26 unsolved
Parikh walk visited 0 properties in 6915 ms.
Support contains 42 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 289/289 transitions.
Applied a total of 0 rules in 11 ms. Remains 333 /333 variables (removed 0) and now considering 289/289 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 333/333 places, 289/289 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 289/289 transitions.
Applied a total of 0 rules in 16 ms. Remains 333 /333 variables (removed 0) and now considering 289/289 (removed 0) transitions.
[2024-05-22 06:24:12] [INFO ] Invariant cache hit.
[2024-05-22 06:24:12] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 06:24:12] [INFO ] Invariant cache hit.
[2024-05-22 06:24:12] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2024-05-22 06:24:12] [INFO ] Redundant transitions in 14 ms returned []
Running 285 sub problems to find dead transitions.
[2024-05-22 06:24:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 2/331 variables, 22/46 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-22 06:24:18] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-22 06:24:18] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 2/333 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (OVERLAPS) 289/622 variables, 333/395 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:24:27] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-22 06:24:28] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:24:28] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:24:28] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/622 variables, 5/400 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-22 06:24:30] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/622 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/622 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 13 (OVERLAPS) 0/622 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 622/622 variables, and 401 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 2/331 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (OVERLAPS) 2/333 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 10 (OVERLAPS) 289/622 variables, 333/401 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/622 variables, 285/686 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-22 06:25:12] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/622 variables, and 687 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 9/9 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60749 ms. Remains : 333/333 places, 289/289 transitions.
[2024-05-22 06:25:13] [INFO ] Flatten gal took : 22 ms
[2024-05-22 06:25:13] [INFO ] Flatten gal took : 32 ms
[2024-05-22 06:25:13] [INFO ] Input system was already deterministic with 392 transitions.
Computed a total of 258 stabilizing places and 250 stable transitions
Graph (complete) has 1038 edges and 446 vertex of which 440 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.16 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 446/446 places, 392/392 transitions.
Graph (complete) has 1038 edges and 446 vertex of which 440 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 439 transition count 376
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 427 transition count 374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 425 transition count 374
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 29 place count 425 transition count 365
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 47 place count 416 transition count 365
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 54 place count 409 transition count 358
Iterating global reduction 3 with 7 rules applied. Total rules applied 61 place count 409 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 409 transition count 357
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 68 place count 403 transition count 351
Iterating global reduction 4 with 6 rules applied. Total rules applied 74 place count 403 transition count 351
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 79 place count 403 transition count 346
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 79 place count 403 transition count 343
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 85 place count 400 transition count 343
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 223 place count 331 transition count 274
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 329 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 226 place count 328 transition count 272
Applied a total of 226 rules in 79 ms. Remains 328 /446 variables (removed 118) and now considering 272/392 (removed 120) transitions.
// Phase 1: matrix 272 rows 328 cols
[2024-05-22 06:25:13] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 06:25:13] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-22 06:25:13] [INFO ] Invariant cache hit.
[2024-05-22 06:25:13] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-05-22 06:25:13] [INFO ] Redundant transitions in 13 ms returned []
Running 268 sub problems to find dead transitions.
[2024-05-22 06:25:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 1/325 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 268 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/327 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 272/599 variables, 327/385 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-22 06:25:21] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:25:23] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:25:23] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:25:23] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:25:23] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:25:23] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:25:24] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:25:24] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:25:24] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-22 06:25:25] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/599 variables, 10/395 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/599 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 11 (OVERLAPS) 1/600 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-22 06:25:29] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:25:29] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/600 variables, 2/398 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-22 06:25:34] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/600 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/600 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 15 (OVERLAPS) 0/600 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 399 constraints, problems are : Problem set: 0 solved, 268 unsolved in 28641 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 328/328 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 1/325 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 2/327 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 11 (OVERLAPS) 272/599 variables, 327/398 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/599 variables, 268/666 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 599/600 variables, and 666 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 327/328 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 13/13 constraints]
After SMT, in 58803ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 58806ms
Starting structural reductions in SI_CTL mode, iteration 1 : 328/446 places, 272/392 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59457 ms. Remains : 328/446 places, 272/392 transitions.
[2024-05-22 06:26:12] [INFO ] Flatten gal took : 20 ms
[2024-05-22 06:26:12] [INFO ] Flatten gal took : 16 ms
[2024-05-22 06:26:12] [INFO ] Input system was already deterministic with 272 transitions.
[2024-05-22 06:26:12] [INFO ] Flatten gal took : 33 ms
[2024-05-22 06:26:12] [INFO ] Flatten gal took : 32 ms
[2024-05-22 06:26:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality13204185228015924865.gal : 11 ms
[2024-05-22 06:26:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality15235631776544214179.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/CTLCardinality13204185228015924865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15235631776544214179.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:26:43] [INFO ] Flatten gal took : 17 ms
[2024-05-22 06:26:43] [INFO ] Applying decomposition
[2024-05-22 06:26:43] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6145787505780655740.txt' '-o' '/tmp/graph6145787505780655740.bin' '-w' '/tmp/graph6145787505780655740.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6145787505780655740.bin' '-l' '-1' '-v' '-w' '/tmp/graph6145787505780655740.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:26:43] [INFO ] Decomposing Gal with order
[2024-05-22 06:26:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:26:43] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-22 06:26:43] [INFO ] Flatten gal took : 46 ms
[2024-05-22 06:26:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-22 06:26:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality6804961967337377726.gal : 6 ms
[2024-05-22 06:26:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality11798925154176836868.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/CTLCardinality6804961967337377726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11798925154176836868.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,6.2176e+14,6.32648,161740,13653,10207,410472,19301,372,234305,474,140139,0


Converting to forward existential form...Done !
original formula: A(!(EF(!(((u15.p335==0)||(i0.u3.p243==1))))) U EG(EF((i4.i3.u18.p358!=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(E(TRUE U (i4.i3.u18.p358!=1))))))) * !(E(!(EG(E(TRUE U (i4.i3.u18.p358!=1)))) U (!(!(E(TRUE ...248
Reverse transition relation is NOT exact ! Due to transitions t150, t211, t212, t217, t220, u14.t109, u15.t185, u50.t1, u50.t222, i0.t129, i0.u2.t10, i0.u2...871
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 439 transition count 385
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 439 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 439 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 433 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 433 transition count 378
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 433 transition count 373
Applied a total of 32 rules in 29 ms. Remains 433 /446 variables (removed 13) and now considering 373/392 (removed 19) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:27:13] [INFO ] Computed 62 invariants in 18 ms
[2024-05-22 06:27:13] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-22 06:27:13] [INFO ] Invariant cache hit.
[2024-05-22 06:27:14] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:27:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:27:20] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-22 06:27:21] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:27:21] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:27:21] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:27:21] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-22 06:27:21] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-22 06:27:21] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-05-22 06:27:21] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-22 06:27:21] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:27:21] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:27:21] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:27:22] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-22 06:27:22] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:27:22] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:27:22] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:27:22] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:27:22] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:27:22] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:27:23] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-22 06:27:23] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:27:25] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:27:25] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:27:26] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:27:29] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-22 06:27:33] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-22 06:27:33] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 3 ms to minimize.
[2024-05-22 06:27:33] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:27:34] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 2 ms to minimize.
[2024-05-22 06:27:34] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-22 06:27:34] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:27:47] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:27:47] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:27:47] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:27:47] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:27:47] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:27:47] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
[2024-05-22 06:27:48] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
[2024-05-22 06:27:48] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
[2024-05-22 06:27:48] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:27:48] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:27:48] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:27:48] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:27:48] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:27:48] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:27:49] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-22 06:27:49] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:27:49] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:27:49] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:27:49] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:27:49] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:27:49] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:27:49] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:27:49] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:27:49] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:27:49] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:27:49] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2024-05-22 06:27:49] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:27:49] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:27:50] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:27:50] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:27:50] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:27:50] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:27:50] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:27:52] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:27:53] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:27:54] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:27:57] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:27:57] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-22 06:27:58] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:28:00] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60959 ms. Remains : 433/446 places, 373/392 transitions.
[2024-05-22 06:28:14] [INFO ] Flatten gal took : 19 ms
[2024-05-22 06:28:14] [INFO ] Flatten gal took : 14 ms
[2024-05-22 06:28:14] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-22 06:28:14] [INFO ] Flatten gal took : 12 ms
[2024-05-22 06:28:14] [INFO ] Flatten gal took : 11 ms
[2024-05-22 06:28:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality4232909005334446372.gal : 2 ms
[2024-05-22 06:28:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality3343319110565972397.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/CTLCardinality4232909005334446372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3343319110565972397.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 446/446 places, 392/392 transitions.
Graph (complete) has 1038 edges and 446 vertex of which 440 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 439 transition count 374
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 425 transition count 374
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 29 place count 425 transition count 365
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 47 place count 416 transition count 365
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 54 place count 409 transition count 358
Iterating global reduction 2 with 7 rules applied. Total rules applied 61 place count 409 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 409 transition count 357
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 68 place count 403 transition count 351
Iterating global reduction 3 with 6 rules applied. Total rules applied 74 place count 403 transition count 351
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 79 place count 403 transition count 346
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 79 place count 403 transition count 343
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 85 place count 400 transition count 343
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 225 place count 330 transition count 273
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 328 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 327 transition count 271
Applied a total of 228 rules in 59 ms. Remains 327 /446 variables (removed 119) and now considering 271/392 (removed 121) transitions.
// Phase 1: matrix 271 rows 327 cols
[2024-05-22 06:29:14] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 06:29:14] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 06:29:14] [INFO ] Invariant cache hit.
[2024-05-22 06:29:15] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-05-22 06:29:15] [INFO ] Redundant transitions in 1 ms returned []
Running 268 sub problems to find dead transitions.
[2024-05-22 06:29:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 268 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/326 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 271/597 variables, 326/384 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-22 06:29:20] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
[2024-05-22 06:29:20] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:29:22] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:29:22] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-22 06:29:25] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-22 06:29:25] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-22 06:29:28] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:29:28] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:29:28] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:29:28] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-22 06:29:31] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 11 (OVERLAPS) 1/598 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/598 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-22 06:29:42] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/598 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/598 variables, and 397 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 2/326 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 271/597 variables, 326/396 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 268/664 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/598 variables, and 664 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 326/327 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 12/12 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in SI_CTL mode, iteration 1 : 327/446 places, 271/392 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60741 ms. Remains : 327/446 places, 271/392 transitions.
[2024-05-22 06:30:15] [INFO ] Flatten gal took : 17 ms
[2024-05-22 06:30:15] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:30:15] [INFO ] Input system was already deterministic with 271 transitions.
[2024-05-22 06:30:15] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:30:15] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:30:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality8344234897838996697.gal : 3 ms
[2024-05-22 06:30:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality2316124568688428078.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/CTLCardinality8344234897838996697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2316124568688428078.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.30677e+14,6.01305,169588,15209,9820,434008,17907,350,259825,476,138864,0


Converting to forward existential form...Done !
original formula: AF(!(E((u15.p150==0) U !(((u49.p101==0) + ((u16.p9==0) * A((i9.i0.u34.p416==1) U ((u16.p39==0)||(i11.i0.u17.p344==1)))))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E((u15.p150==0) U !(((u49.p101==0) + ((u16.p9==0) * !((E(!(((u16.p39==0)||(i11.i0.u17.p344==1))) ...288
Reverse transition relation is NOT exact ! Due to transitions t151, t211, t216, t219, u15.t112, u16.t187, u49.t1, u49.t221, i0.t9, i0.u2.t13, i0.u2.t17, i0...866
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 439 transition count 385
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 439 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 439 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 433 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 433 transition count 378
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 433 transition count 373
Applied a total of 32 rules in 25 ms. Remains 433 /446 variables (removed 13) and now considering 373/392 (removed 19) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:31:15] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 06:31:15] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-22 06:31:15] [INFO ] Invariant cache hit.
[2024-05-22 06:31:16] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:31:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:31:23] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-22 06:31:23] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:31:23] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:31:23] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:31:23] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-22 06:31:23] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-22 06:31:23] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-22 06:31:24] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:31:24] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-22 06:31:24] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:31:24] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:31:24] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-22 06:31:24] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:31:24] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:31:24] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:31:24] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:31:25] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:31:25] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:31:25] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-05-22 06:31:25] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:31:28] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:31:28] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:31:28] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:31:32] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:31:35] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-22 06:31:35] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2024-05-22 06:31:36] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2024-05-22 06:31:36] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:31:36] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:31:36] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:31:49] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:31:49] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:31:49] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:31:50] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:31:51] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 4 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:31:52] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:31:55] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:31:56] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:31:56] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:31:57] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:31:57] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:31:57] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:31:59] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:31:59] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-22 06:32:00] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:32:03] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60978 ms. Remains : 433/446 places, 373/392 transitions.
[2024-05-22 06:32:16] [INFO ] Flatten gal took : 21 ms
[2024-05-22 06:32:16] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:32:16] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-22 06:32:16] [INFO ] Flatten gal took : 11 ms
[2024-05-22 06:32:16] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:32:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality14693613585197935029.gal : 3 ms
[2024-05-22 06:32:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality13028994562580567374.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/CTLCardinality14693613585197935029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13028994562580567374.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.51175e+20,6.2671,185184,18910,5482,398010,37110,719,359475,433,263103,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 392/392 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 441 transition count 387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 441 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 441 transition count 386
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 437 transition count 382
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 437 transition count 382
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 437 transition count 378
Applied a total of 23 rules in 25 ms. Remains 437 /446 variables (removed 9) and now considering 378/392 (removed 14) transitions.
// Phase 1: matrix 378 rows 437 cols
[2024-05-22 06:33:17] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 06:33:17] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-22 06:33:17] [INFO ] Invariant cache hit.
[2024-05-22 06:33:17] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2024-05-22 06:33:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/436 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/437 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 377 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 378/815 variables, 437/499 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:33:26] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-22 06:33:26] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:33:27] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:33:27] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-22 06:33:27] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:33:27] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-22 06:33:27] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:33:27] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:33:27] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-22 06:33:28] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:33:28] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-22 06:33:30] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-05-22 06:33:30] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-22 06:33:31] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 14/513 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:33:34] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:33:35] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:33:35] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:33:35] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:33:35] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:33:35] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:33:35] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:33:35] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:33:35] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:33:35] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:33:35] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:33:35] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-22 06:33:35] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:33:35] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:33:35] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-22 06:33:36] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:33:38] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/815 variables, 17/530 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:33:40] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-22 06:33:41] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/815 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:33:46] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 815/815 variables, and 533 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/436 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/437 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 34/96 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:33:50] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:33:50] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:33:50] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:33:51] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:33:51] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:33:51] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:33:51] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:33:51] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:33:51] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:33:51] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-22 06:33:51] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:33:51] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-22 06:33:54] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 13/109 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:33:54] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:33:54] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-22 06:33:55] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:33:58] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:33:58] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 9 (OVERLAPS) 378/815 variables, 437/551 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/815 variables, 377/928 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 815/815 variables, and 928 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 52/52 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Starting structural reductions in LTL mode, iteration 1 : 437/446 places, 378/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60931 ms. Remains : 437/446 places, 378/392 transitions.
[2024-05-22 06:34:17] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:34:17] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:34:17] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-22 06:34:17] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:34:17] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:34:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality12717672626981876179.gal : 2 ms
[2024-05-22 06:34:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality9210187420649149301.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/CTLCardinality12717672626981876179.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9210187420649149301.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 392/392 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 441 transition count 387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 441 transition count 387
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 436 transition count 382
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 436 transition count 382
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 436 transition count 378
Applied a total of 24 rules in 25 ms. Remains 436 /446 variables (removed 10) and now considering 378/392 (removed 14) transitions.
// Phase 1: matrix 378 rows 436 cols
[2024-05-22 06:35:18] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 06:35:18] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-22 06:35:18] [INFO ] Invariant cache hit.
[2024-05-22 06:35:18] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2024-05-22 06:35:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 378/814 variables, 436/498 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:35:25] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-05-22 06:35:25] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-22 06:35:26] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:35:26] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-05-22 06:35:26] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:35:26] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:35:26] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:35:26] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:35:26] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:35:26] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:35:27] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:35:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-22 06:35:27] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-22 06:35:27] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:35:27] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:35:27] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:35:27] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:35:28] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:35:28] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:35:29] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/814 variables, 20/518 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:35:31] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-22 06:35:33] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 4 ms to minimize.
[2024-05-22 06:35:33] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/814 variables, 3/521 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:35:37] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:35:37] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:35:38] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:35:38] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/814 variables, 4/525 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:35:42] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:35:42] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:35:43] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:35:43] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:35:44] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-22 06:35:47] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 2 ms to minimize.
[2024-05-22 06:35:48] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/814 variables, 7/532 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 814/814 variables, and 532 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 34/96 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:35:52] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:35:52] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:35:52] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-22 06:35:52] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-22 06:35:53] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:35:53] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-22 06:35:53] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:35:53] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-22 06:35:55] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:35:55] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:35:55] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (OVERLAPS) 378/814 variables, 436/543 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/814 variables, 377/920 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 814/814 variables, and 920 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 45/45 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Starting structural reductions in LTL mode, iteration 1 : 436/446 places, 378/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60967 ms. Remains : 436/446 places, 378/392 transitions.
[2024-05-22 06:36:19] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:36:19] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:36:19] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-22 06:36:19] [INFO ] Flatten gal took : 11 ms
[2024-05-22 06:36:19] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:36:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality13548526130578459185.gal : 2 ms
[2024-05-22 06:36:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality15409386381031368404.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/CTLCardinality13548526130578459185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15409386381031368404.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 392/392 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 440 transition count 386
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 440 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 440 transition count 385
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 436 transition count 381
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 436 transition count 381
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 436 transition count 377
Applied a total of 25 rules in 26 ms. Remains 436 /446 variables (removed 10) and now considering 377/392 (removed 15) transitions.
// Phase 1: matrix 377 rows 436 cols
[2024-05-22 06:37:19] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 06:37:19] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-22 06:37:19] [INFO ] Invariant cache hit.
[2024-05-22 06:37:20] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2024-05-22 06:37:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (OVERLAPS) 377/813 variables, 436/498 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-05-22 06:37:29] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:37:29] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:37:29] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:37:29] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:37:29] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-22 06:37:29] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:37:29] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 2 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:37:30] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:37:31] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 20/518 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-05-22 06:37:37] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-22 06:37:37] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:37:38] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:37:38] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-22 06:37:38] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-22 06:37:38] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-22 06:37:38] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-22 06:37:40] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-05-22 06:37:40] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-05-22 06:37:40] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/813 variables, 10/528 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-05-22 06:37:43] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-22 06:37:44] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-22 06:37:44] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-22 06:37:44] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:37:44] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-05-22 06:37:44] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:37:44] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:37:44] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-22 06:37:45] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/813 variables, 9/537 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-05-22 06:37:49] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:37:50] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:37:50] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 813/813 variables, and 540 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 42/104 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-05-22 06:37:53] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:37:54] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-22 06:37:54] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:37:54] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:37:54] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:37:54] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:37:54] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:37:56] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:37:56] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 9/113 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-05-22 06:37:57] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:37:57] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-05-22 06:38:02] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-22 06:38:02] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-05-22 06:38:04] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-05-22 06:38:05] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-22 06:38:05] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-22 06:38:05] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-22 06:38:06] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:38:06] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 5/123 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-05-22 06:38:11] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:38:11] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:38:11] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-05-22 06:38:19] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/813 variables, and 127 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/436 constraints, PredecessorRefiner: 0/376 constraints, Known Traps: 65/65 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LTL mode, iteration 1 : 436/446 places, 377/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61007 ms. Remains : 436/446 places, 377/392 transitions.
[2024-05-22 06:38:20] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:38:20] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:38:20] [INFO ] Input system was already deterministic with 377 transitions.
[2024-05-22 06:38:20] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:38:20] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:38:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality4372155662831551978.gal : 2 ms
[2024-05-22 06:38:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality12751568425408284044.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/CTLCardinality4372155662831551978.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12751568425408284044.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:38:50] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:38:50] [INFO ] Applying decomposition
[2024-05-22 06:38:50] [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/graph15243928580415045287.txt' '-o' '/tmp/graph15243928580415045287.bin' '-w' '/tmp/graph15243928580415045287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15243928580415045287.bin' '-l' '-1' '-v' '-w' '/tmp/graph15243928580415045287.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:38:50] [INFO ] Decomposing Gal with order
[2024-05-22 06:38:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:38:50] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 06:38:50] [INFO ] Flatten gal took : 16 ms
[2024-05-22 06:38:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 06:38:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality18119311477677894957.gal : 3 ms
[2024-05-22 06:38:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality1532145685215033314.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/CTLCardinality18119311477677894957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1532145685215033314.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 : 446/446 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 439 transition count 385
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 439 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 439 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 433 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 433 transition count 378
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 433 transition count 373
Applied a total of 32 rules in 24 ms. Remains 433 /446 variables (removed 13) and now considering 373/392 (removed 19) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:39:20] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 06:39:20] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-22 06:39:20] [INFO ] Invariant cache hit.
[2024-05-22 06:39:21] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:39:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:39:28] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 06:39:28] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 3 ms to minimize.
[2024-05-22 06:39:28] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-22 06:39:28] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:39:28] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-22 06:39:28] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-22 06:39:28] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-22 06:39:28] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:39:29] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:39:29] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:39:29] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:39:29] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-22 06:39:29] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-22 06:39:29] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:39:29] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:39:29] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:39:29] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:39:30] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:39:30] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-22 06:39:30] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:39:33] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:39:33] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:39:33] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:39:37] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-22 06:39:40] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-22 06:39:40] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-05-22 06:39:41] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
[2024-05-22 06:39:41] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:39:41] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:39:41] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:39:54] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:39:54] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:39:55] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:39:55] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:39:55] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:39:55] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:39:55] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:39:55] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:39:55] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-22 06:39:55] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
[2024-05-22 06:39:55] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:39:55] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:39:55] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-22 06:39:56] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:39:56] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:39:56] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:39:56] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:39:56] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:39:56] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-22 06:39:56] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:39:56] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:39:56] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:39:57] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:39:57] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:39:57] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:39:57] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2024-05-22 06:39:57] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:39:57] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:39:57] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:39:57] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:39:57] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:39:57] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:39:57] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:40:00] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:40:01] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:40:01] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-22 06:40:01] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:40:01] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:40:01] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:40:04] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:40:04] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:40:04] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:40:07] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60917 ms. Remains : 433/446 places, 373/392 transitions.
[2024-05-22 06:40:21] [INFO ] Flatten gal took : 13 ms
[2024-05-22 06:40:21] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:40:21] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-22 06:40:21] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:40:21] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:40:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality7791992742725741584.gal : 2 ms
[2024-05-22 06:40:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality738660726167481907.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/CTLCardinality7791992742725741584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality738660726167481907.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:40:51] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:40:51] [INFO ] Applying decomposition
[2024-05-22 06:40:51] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2146760464332553616.txt' '-o' '/tmp/graph2146760464332553616.bin' '-w' '/tmp/graph2146760464332553616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2146760464332553616.bin' '-l' '-1' '-v' '-w' '/tmp/graph2146760464332553616.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:40:51] [INFO ] Decomposing Gal with order
[2024-05-22 06:40:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:40:51] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 06:40:51] [INFO ] Flatten gal took : 16 ms
[2024-05-22 06:40:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 06:40:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality13057960586109788875.gal : 3 ms
[2024-05-22 06:40:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality1632969664250139277.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/CTLCardinality13057960586109788875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1632969664250139277.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.51175e+20,18.2833,562644,43604,6118,1.58152e+06,33391,693,879249,477,221379,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 392/392 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 440 transition count 386
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 440 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 440 transition count 385
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 436 transition count 381
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 436 transition count 381
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 436 transition count 378
Applied a total of 24 rules in 21 ms. Remains 436 /446 variables (removed 10) and now considering 378/392 (removed 14) transitions.
// Phase 1: matrix 378 rows 436 cols
[2024-05-22 06:41:21] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 06:41:22] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-22 06:41:22] [INFO ] Invariant cache hit.
[2024-05-22 06:41:22] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2024-05-22 06:41:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 377 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 378/814 variables, 436/498 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:41:31] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-22 06:41:31] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:41:31] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:41:32] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:41:33] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-22 06:41:35] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-05-22 06:41:35] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2024-05-22 06:41:35] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/814 variables, 8/506 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:41:38] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:41:41] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/814 variables, 2/508 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:41:46] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:41:47] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/814 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 814/814 variables, and 510 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:41:55] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:41:55] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:41:55] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:41:56] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:41:56] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:41:56] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:41:56] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:41:56] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:41:56] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:41:56] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 3 ms to minimize.
[2024-05-22 06:41:57] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:41:57] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-22 06:41:57] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-22 06:41:57] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:41:59] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 15/89 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:42:00] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:42:00] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:42:00] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:42:00] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:42:00] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:42:02] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:42:03] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:42:03] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-22 06:42:03] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:42:03] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:42:03] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:42:04] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:42:04] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 7/102 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-22 06:42:07] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 10 (OVERLAPS) 378/814 variables, 436/539 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/814 variables, 377/916 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 814/814 variables, and 916 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 41/41 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Starting structural reductions in LTL mode, iteration 1 : 436/446 places, 378/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60848 ms. Remains : 436/446 places, 378/392 transitions.
[2024-05-22 06:42:22] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:42:22] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:42:22] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-22 06:42:22] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:42:22] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:42:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality8452334526422406373.gal : 2 ms
[2024-05-22 06:42:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality16647277808799882055.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/CTLCardinality8452334526422406373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16647277808799882055.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24247e+21,7.37538,224020,20838,6443,556391,34630,695,401317,459,239066,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 439 transition count 385
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 439 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 439 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 433 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 433 transition count 378
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 433 transition count 373
Applied a total of 32 rules in 15 ms. Remains 433 /446 variables (removed 13) and now considering 373/392 (removed 19) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 06:43:23] [INFO ] Computed 62 invariants in 15 ms
[2024-05-22 06:43:23] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-22 06:43:23] [INFO ] Invariant cache hit.
[2024-05-22 06:43:23] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-22 06:43:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/806 variables, 433/495 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:43:30] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-22 06:43:30] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-22 06:43:30] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-22 06:43:30] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:43:30] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-22 06:43:31] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-22 06:43:31] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-22 06:43:31] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:43:31] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:43:31] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:43:31] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:43:31] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-22 06:43:31] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:43:32] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:43:32] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-22 06:43:32] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:43:32] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:43:32] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-22 06:43:32] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-22 06:43:32] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:43:35] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:43:35] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-22 06:43:35] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:43:39] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:43:42] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-22 06:43:43] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 3 ms to minimize.
[2024-05-22 06:43:43] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-05-22 06:43:43] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 1 ms to minimize.
[2024-05-22 06:43:43] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:43:43] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/806 variables, 7/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 525 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:43:57] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-22 06:43:57] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-22 06:43:57] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:43:57] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:43:57] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:43:57] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:43:57] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:43:57] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-22 06:43:57] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-22 06:43:58] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:43:58] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:43:58] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:43:58] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:43:58] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:43:58] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:43:58] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:43:58] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:43:58] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:43:58] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-22 06:43:58] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:43:59] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-22 06:44:02] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:44:03] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:44:03] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:44:03] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:44:04] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:44:04] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:44:06] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 06:44:06] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-22 06:44:07] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-05-22 06:44:09] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 11 (OVERLAPS) 373/806 variables, 433/568 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 372/940 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 940 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 73/73 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60909 ms. Remains : 433/446 places, 373/392 transitions.
[2024-05-22 06:44:23] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:44:23] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:44:23] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-22 06:44:23] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:44:23] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:44:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality3032429132588968263.gal : 1 ms
[2024-05-22 06:44:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality5165064587013570212.ctl : 4 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/CTLCardinality3032429132588968263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5165064587013570212.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:44:54] [INFO ] Flatten gal took : 13 ms
[2024-05-22 06:44:54] [INFO ] Applying decomposition
[2024-05-22 06:44:54] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18303566055426706641.txt' '-o' '/tmp/graph18303566055426706641.bin' '-w' '/tmp/graph18303566055426706641.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18303566055426706641.bin' '-l' '-1' '-v' '-w' '/tmp/graph18303566055426706641.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:44:54] [INFO ] Decomposing Gal with order
[2024-05-22 06:44:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:44:54] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 06:44:54] [INFO ] Flatten gal took : 13 ms
[2024-05-22 06:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 06:44:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality5147735054831572067.gal : 3 ms
[2024-05-22 06:44:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality17664112561466915613.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/CTLCardinality5147735054831572067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17664112561466915613.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 : 446/446 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 439 transition count 385
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 439 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 439 transition count 384
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 434 transition count 379
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 434 transition count 379
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 29 place count 434 transition count 375
Applied a total of 29 rules in 25 ms. Remains 434 /446 variables (removed 12) and now considering 375/392 (removed 17) transitions.
// Phase 1: matrix 375 rows 434 cols
[2024-05-22 06:45:24] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 06:45:24] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-22 06:45:24] [INFO ] Invariant cache hit.
[2024-05-22 06:45:24] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2024-05-22 06:45:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/434 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 374 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 375/809 variables, 434/496 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:45:33] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-22 06:45:34] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-22 06:45:34] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-22 06:45:34] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:45:34] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-22 06:45:34] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:45:34] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:45:34] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-22 06:45:34] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:45:34] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-22 06:45:35] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:45:35] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:45:35] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-22 06:45:35] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:45:35] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:45:35] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-22 06:45:35] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:45:35] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 3 ms to minimize.
[2024-05-22 06:45:36] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-22 06:45:36] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 20/516 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:45:36] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:45:37] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-22 06:45:38] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:45:38] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-22 06:45:40] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/809 variables, 5/521 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:45:43] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:45:43] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:45:43] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-22 06:45:43] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2024-05-22 06:45:43] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:45:44] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:45:44] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-22 06:45:44] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-05-22 06:45:44] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-22 06:45:44] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-05-22 06:45:44] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:45:44] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:45:45] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:45:45] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-22 06:45:47] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-05-22 06:45:47] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-22 06:45:47] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-22 06:45:48] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:45:48] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-22 06:45:48] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/809 variables, 20/541 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 809/809 variables, and 541 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/434 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 45/107 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-05-22 06:45:58] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:45:58] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:45:58] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:45:58] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-22 06:45:58] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:45:59] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-22 06:45:59] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-22 06:45:59] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-22 06:45:59] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-22 06:46:01] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:46:01] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (OVERLAPS) 375/809 variables, 434/552 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/809 variables, 374/926 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 809/809 variables, and 926 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 56/56 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 434/446 places, 375/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60935 ms. Remains : 434/446 places, 375/392 transitions.
[2024-05-22 06:46:25] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:46:25] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:46:25] [INFO ] Input system was already deterministic with 375 transitions.
[2024-05-22 06:46:25] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:46:25] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:46:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality2231613789958034018.gal : 1 ms
[2024-05-22 06:46:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality6539804495333066394.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/CTLCardinality2231613789958034018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6539804495333066394.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:46:55] [INFO ] Flatten gal took : 14 ms
[2024-05-22 06:46:55] [INFO ] Applying decomposition
[2024-05-22 06:46:55] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7862236881159098767.txt' '-o' '/tmp/graph7862236881159098767.bin' '-w' '/tmp/graph7862236881159098767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7862236881159098767.bin' '-l' '-1' '-v' '-w' '/tmp/graph7862236881159098767.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:46:55] [INFO ] Decomposing Gal with order
[2024-05-22 06:46:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:46:55] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 06:46:55] [INFO ] Flatten gal took : 14 ms
[2024-05-22 06:46:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2024-05-22 06:46:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality1518222558999441937.gal : 2 ms
[2024-05-22 06:46:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality11306036938789808333.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/CTLCardinality1518222558999441937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11306036938789808333.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 : 446/446 places, 392/392 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 441 transition count 387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 441 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 441 transition count 386
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 438 transition count 383
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 438 transition count 383
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 438 transition count 380
Applied a total of 20 rules in 16 ms. Remains 438 /446 variables (removed 8) and now considering 380/392 (removed 12) transitions.
// Phase 1: matrix 380 rows 438 cols
[2024-05-22 06:47:25] [INFO ] Computed 62 invariants in 10 ms
[2024-05-22 06:47:25] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-22 06:47:25] [INFO ] Invariant cache hit.
[2024-05-22 06:47:26] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2024-05-22 06:47:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 379 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (OVERLAPS) 380/818 variables, 438/500 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 06:47:35] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:47:35] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-22 06:47:38] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 2 ms to minimize.
[2024-05-22 06:47:39] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-22 06:47:39] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:47:39] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:47:40] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 7/507 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 06:47:45] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 2 ms to minimize.
[2024-05-22 06:47:45] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-22 06:47:45] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-05-22 06:47:46] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 1 ms to minimize.
[2024-05-22 06:47:46] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 3 ms to minimize.
[2024-05-22 06:47:46] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 3 ms to minimize.
[2024-05-22 06:47:46] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-22 06:47:47] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/818 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 06:47:51] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-22 06:47:52] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:47:52] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/818 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/818 variables, and 518 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 06:47:59] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:47:59] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-05-22 06:47:59] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:47:59] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 06:47:59] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:47:59] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:47:59] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:48:00] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:48:00] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:48:00] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-22 06:48:00] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:48:00] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:48:00] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:48:00] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:48:00] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:48:00] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-22 06:48:00] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:48:00] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-22 06:48:00] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-22 06:48:01] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 06:48:01] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-22 06:48:01] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:48:01] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:48:01] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:48:01] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-22 06:48:01] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:48:01] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:48:02] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-22 06:48:05] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-22 06:48:05] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-22 06:48:06] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:48:06] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 9 (OVERLAPS) 380/818 variables, 438/555 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 379/934 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/818 variables, and 934 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 55/55 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Starting structural reductions in LTL mode, iteration 1 : 438/446 places, 380/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60975 ms. Remains : 438/446 places, 380/392 transitions.
[2024-05-22 06:48:26] [INFO ] Flatten gal took : 11 ms
[2024-05-22 06:48:26] [INFO ] Flatten gal took : 12 ms
[2024-05-22 06:48:26] [INFO ] Input system was already deterministic with 380 transitions.
[2024-05-22 06:48:26] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:48:26] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:48:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality929939546309884116.gal : 2 ms
[2024-05-22 06:48:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality9702627247650432519.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/CTLCardinality929939546309884116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9702627247650432519.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 446/446 places, 392/392 transitions.
Graph (complete) has 1038 edges and 446 vertex of which 440 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 439 transition count 374
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 425 transition count 374
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 425 transition count 364
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 415 transition count 364
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 56 place count 408 transition count 357
Iterating global reduction 2 with 7 rules applied. Total rules applied 63 place count 408 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 408 transition count 356
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 70 place count 402 transition count 350
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 402 transition count 350
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 81 place count 402 transition count 345
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 81 place count 402 transition count 342
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 87 place count 399 transition count 342
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 225 place count 330 transition count 273
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 328 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 327 transition count 271
Applied a total of 228 rules in 56 ms. Remains 327 /446 variables (removed 119) and now considering 271/392 (removed 121) transitions.
// Phase 1: matrix 271 rows 327 cols
[2024-05-22 06:49:26] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 06:49:26] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 06:49:26] [INFO ] Invariant cache hit.
[2024-05-22 06:49:27] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-22 06:49:27] [INFO ] Redundant transitions in 1 ms returned []
Running 267 sub problems to find dead transitions.
[2024-05-22 06:49:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 1/324 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 2/326 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 271/597 variables, 326/384 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 06:49:37] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 06:49:38] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 06:49:40] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:49:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-22 06:49:41] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 06:49:44] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-22 06:49:44] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 06:49:46] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-22 06:49:46] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 06:49:46] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 5/394 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 06:49:48] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:49:48] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:49:48] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:49:49] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:49:49] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:49:49] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/597 variables, 6/400 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 06:49:50] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/597 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/598 variables, and 401 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 326/327 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 1/324 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 2/326 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (OVERLAPS) 271/597 variables, 326/401 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 267/668 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 06:50:16] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-22 06:50:18] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/598 variables, and 670 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 326/327 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 19/19 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in SI_CTL mode, iteration 1 : 327/446 places, 271/392 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60741 ms. Remains : 327/446 places, 271/392 transitions.
[2024-05-22 06:50:27] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:50:27] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:50:27] [INFO ] Input system was already deterministic with 271 transitions.
[2024-05-22 06:50:27] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:50:27] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:50:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality13904536215348181353.gal : 2 ms
[2024-05-22 06:50:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality9665854539665681278.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/CTLCardinality13904536215348181353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9665854539665681278.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:50:57] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:50:57] [INFO ] Applying decomposition
[2024-05-22 06:50:57] [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/graph3146384592202487944.txt' '-o' '/tmp/graph3146384592202487944.bin' '-w' '/tmp/graph3146384592202487944.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3146384592202487944.bin' '-l' '-1' '-v' '-w' '/tmp/graph3146384592202487944.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:50:57] [INFO ] Decomposing Gal with order
[2024-05-22 06:50:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:50:57] [INFO ] Removed a total of 8 redundant transitions.
[2024-05-22 06:50:57] [INFO ] Flatten gal took : 11 ms
[2024-05-22 06:50:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 06:50:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality9502748336956809806.gal : 2 ms
[2024-05-22 06:50:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality15041940650283795358.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/CTLCardinality9502748336956809806.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15041940650283795358.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,6.20157e+14,4.68685,147968,11109,9838,366459,17927,330,212582,471,139160,0


Converting to forward existential form...Done !
original formula: AF(!(A(((i4.i3.u26.p377==0)||(i8.i0.u45.p436==1)) U EG((u51.p100==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(EG((u51.p100==1))) U (!(((i4.i3.u26.p377==0)||(i8.i0.u45.p436==1))) * !(EG((u51.p100==1)))...198
Reverse transition relation is NOT exact ! Due to transitions t150, t211, t216, t219, u14.t111, u15.t186, u51.t0, u51.t221, i0.t8, i0.u2.t12, i0.u2.t16, i0...881
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 446/446 places, 392/392 transitions.
Graph (complete) has 1038 edges and 446 vertex of which 440 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 439 transition count 374
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 425 transition count 374
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 425 transition count 364
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 415 transition count 364
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 56 place count 408 transition count 357
Iterating global reduction 2 with 7 rules applied. Total rules applied 63 place count 408 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 408 transition count 356
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 70 place count 402 transition count 350
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 402 transition count 350
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 81 place count 402 transition count 345
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 81 place count 402 transition count 342
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 87 place count 399 transition count 342
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 229 place count 328 transition count 271
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 326 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 232 place count 325 transition count 269
Applied a total of 232 rules in 52 ms. Remains 325 /446 variables (removed 121) and now considering 269/392 (removed 123) transitions.
// Phase 1: matrix 269 rows 325 cols
[2024-05-22 06:51:27] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 06:51:27] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 06:51:27] [INFO ] Invariant cache hit.
[2024-05-22 06:51:28] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-22 06:51:28] [INFO ] Redundant transitions in 1 ms returned []
Running 266 sub problems to find dead transitions.
[2024-05-22 06:51:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 2/324 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 269/593 variables, 324/382 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:51:35] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-22 06:51:35] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:51:35] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/593 variables, 3/385 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/593 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (OVERLAPS) 1/594 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:51:42] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-22 06:51:42] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-05-22 06:51:42] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:51:43] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/594 variables, 4/390 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/594 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 11 (OVERLAPS) 0/594 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/594 variables, and 390 constraints, problems are : Problem set: 0 solved, 266 unsolved in 25505 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 2/324 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 269/593 variables, 324/389 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 266/655 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-22 06:52:19] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/594 variables, and 656 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 324/325 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 8/8 constraints]
After SMT, in 55659ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 55667ms
Starting structural reductions in SI_CTL mode, iteration 1 : 325/446 places, 269/392 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56209 ms. Remains : 325/446 places, 269/392 transitions.
[2024-05-22 06:52:23] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:52:23] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:52:23] [INFO ] Input system was already deterministic with 269 transitions.
[2024-05-22 06:52:23] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:52:23] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:52:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality2235528947637886382.gal : 2 ms
[2024-05-22 06:52:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality6769006494593037969.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/CTLCardinality2235528947637886382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6769006494593037969.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 06:52:53] [INFO ] Flatten gal took : 8 ms
[2024-05-22 06:52:53] [INFO ] Applying decomposition
[2024-05-22 06:52:53] [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/graph4899954279368278931.txt' '-o' '/tmp/graph4899954279368278931.bin' '-w' '/tmp/graph4899954279368278931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4899954279368278931.bin' '-l' '-1' '-v' '-w' '/tmp/graph4899954279368278931.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:52:53] [INFO ] Decomposing Gal with order
[2024-05-22 06:52:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:52:53] [INFO ] Removed a total of 8 redundant transitions.
[2024-05-22 06:52:53] [INFO ] Flatten gal took : 11 ms
[2024-05-22 06:52:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 06:52:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality9130191866502845527.gal : 2 ms
[2024-05-22 06:52:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality4009373546094207935.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/CTLCardinality9130191866502845527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4009373546094207935.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,6.20157e+14,5.26891,165708,16250,9819,418351,17900,319,255310,469,138585,0


Converting to forward existential form...Done !
original formula: AG(EF(((u15.p130==0)||(u16.p13==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.p130==0)||(u16.p13==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t149, t209, t214, t217, u15.t110, u16.t185, u51.t0, u51.t219, i0.t7, i0.u2.t11, i0.u2.t15, i0...865
Detected timeout of ITS tools.
[2024-05-22 06:53:23] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:53:23] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:53:24] [INFO ] Applying decomposition
[2024-05-22 06:53:24] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4329434922754579942.txt' '-o' '/tmp/graph4329434922754579942.bin' '-w' '/tmp/graph4329434922754579942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4329434922754579942.bin' '-l' '-1' '-v' '-w' '/tmp/graph4329434922754579942.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:53:24] [INFO ] Decomposing Gal with order
[2024-05-22 06:53:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:53:24] [INFO ] Removed a total of 22 redundant transitions.
[2024-05-22 06:53:24] [INFO ] Flatten gal took : 16 ms
[2024-05-22 06:53:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-22 06:53:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality7712886790228364085.gal : 3 ms
[2024-05-22 06:53:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality4954962265732125292.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/CTLCardinality7712886790228364085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4954962265732125292.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 14 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,4.40125e+21,190.399,2245144,17030,5628,4.89437e+06,70572,663,5.80924e+06,447,451987,0


Converting to forward existential form...Done !
original formula: A(!(EF(!(((i1.u33.p335==0)||(i3.u11.p243==1))))) U EG(EF((i8.i1.i1.u46.p358!=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(E(TRUE U (i8.i1.i1.u46.p358!=1))))))) * !(E(!(EG(E(TRUE U (i8.i1.i1.u46.p358!=1)))) U (!(!(E...261
Reverse transition relation is NOT exact ! Due to transitions t0, t289, t350, t351, t384, u32.t80, u78.t17, i0.t131, i0.u7.t136, i0.u7.t137, i0.u8.t133, i0...1372

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="DES-PT-50b"
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 DES-PT-50b, 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 r092-tall-171624189900737"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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