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.r602-tall-171774424600170.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 BlocksWorld-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r602-tall-171774424600170
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 73K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 367K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 224K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 81K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 407K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 631K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.2K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 175K Jun 7 06:26 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 BlocksWorld-PT-02-CTLFireability-2024-00
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-01
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-02
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-03
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-04
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-05
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-06
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-07
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-08
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-09
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-10
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-11
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-12
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-13
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-14
FORMULA_NAME BlocksWorld-PT-02-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717745586233

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-07 07:33:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 07:33:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:33:07] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-07 07:33:07] [INFO ] Transformed 209 places.
[2024-06-07 07:33:07] [INFO ] Transformed 365 transitions.
[2024-06-07 07:33:07] [INFO ] Found NUPN structural information;
[2024-06-07 07:33:07] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12]
[2024-06-07 07:33:07] [INFO ] Parsed PT model containing 209 places and 365 transitions and 1810 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Support contains 209 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Applied a total of 0 rules in 12 ms. Remains 209 /209 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 209 cols
[2024-06-07 07:33:07] [INFO ] Computed 27 invariants in 25 ms
[2024-06-07 07:33:07] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-07 07:33:07] [INFO ] Invariant cache hit.
[2024-06-07 07:33:08] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-07 07:33:08] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-07 07:33:08] [INFO ] Invariant cache hit.
[2024-06-07 07:33:08] [INFO ] State equation strengthened by 19 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 20/20 constraints. Problems are: Problem set: 20 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 20 solved, 341 unsolved
Problem TDEAD40 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/209 variables, 7/27 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:33:12] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 9 ms to minimize.
[2024-06-07 07:33:12] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 364/573 variables, 209/238 constraints. Problems are: Problem set: 26 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 18/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 1/574 variables, 1/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 10 (OVERLAPS) 0/574 variables, 0/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 257 constraints, problems are : Problem set: 26 solved, 335 unsolved in 17315 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 209/209 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 26 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 1/1 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/1 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 17/209 variables, 26/27 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 364/573 variables, 209/238 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 18/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 335/591 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:33:34] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:33:34] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:33:34] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:33:34] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:33:34] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:33:34] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-07 07:33:34] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:33:34] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:33:35] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:33:35] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:33:35] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:33:35] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:33:35] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:33:35] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:33:35] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:33:35] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:33:35] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:33:35] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:33:36] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:33:36] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 20/611 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:33:40] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:33:40] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-06-07 07:33:40] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:33:40] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:33:40] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:33:41] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:33:41] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:33:41] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:33:41] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:33:41] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:33:42] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:33:42] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 2 ms to minimize.
[2024-06-07 07:33:42] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:33:42] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:33:43] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:33:43] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:33:43] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:33:44] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2024-06-07 07:33:44] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:33:44] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 20/631 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:33:50] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:33:50] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:33:51] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:33:51] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:33:51] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:33:51] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:33:51] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:33:52] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 2 ms to minimize.
[2024-06-07 07:33:53] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:33:53] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 2 ms to minimize.
[2024-06-07 07:33:54] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:33:54] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:33:55] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:33:55] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:33:55] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 3 ms to minimize.
[2024-06-07 07:33:56] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:33:56] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/574 variables, and 648 constraints, problems are : Problem set: 26 solved, 335 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 209/209 constraints, ReadFeed: 18/19 constraints, PredecessorRefiner: 335/361 constraints, Known Traps: 59/59 constraints]
After SMT, in 48782ms problems are : Problem set: 26 solved, 335 unsolved
Search for dead transitions found 26 dead transitions in 48807ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 209/209 places, 339/365 transitions.
Deduced a syphon composed of 13 places in 1 ms
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49256 ms. Remains : 209/209 places, 339/365 transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Support contains 196 out of 196 places after structural reductions.
[2024-06-07 07:33:57] [INFO ] Flatten gal took : 78 ms
[2024-06-07 07:33:57] [INFO ] Flatten gal took : 60 ms
[2024-06-07 07:33:57] [INFO ] Input system was already deterministic with 339 transitions.
Reduction of identical properties reduced properties to check from 69 to 68
RANDOM walk for 40000 steps (8 resets) in 3169 ms. (12 steps per ms) remains 9/68 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 935 ms. (42 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 184 ms. (216 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:33:59] [INFO ] Computed 27 invariants in 2 ms
[2024-06-07 07:33:59] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 15/15 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 12/196 variables, 12/27 constraints. Problems are: Problem set: 7 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 7 solved, 2 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 14/14 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 13/196 variables, 13/27 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 2/225 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/225 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/535 variables, 1/226 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 0/226 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/535 variables, 0/226 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 226 constraints, problems are : Problem set: 7 solved, 2 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 1310ms problems are : Problem set: 7 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 183 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 339/339 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 338
Applied a total of 1 rules in 54 ms. Remains 196 /196 variables (removed 0) and now considering 338/339 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 196/196 places, 338/339 transitions.
RANDOM walk for 40000 steps (8 resets) in 382 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 702 ms. (56 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 477666 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 2
Probabilistic random walk after 477666 steps, saw 335080 distinct states, run finished after 3004 ms. (steps per millisecond=159 ) properties seen :0
// Phase 1: matrix 338 rows 196 cols
[2024-06-07 07:34:04] [INFO ] Computed 27 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 13/196 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 2 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 13/196 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1076ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 183 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 16 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 196/196 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 14 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-06-07 07:34:05] [INFO ] Invariant cache hit.
[2024-06-07 07:34:05] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-07 07:34:05] [INFO ] Invariant cache hit.
[2024-06-07 07:34:05] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-06-07 07:34:05] [INFO ] Redundant transitions in 18 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 07:34:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 334 unsolved in 10807 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 334/557 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:34:24] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:34:24] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:34:24] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:34:24] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:34:25] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:34:25] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:34:25] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:34:25] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:34:26] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:34:26] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:34:26] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:34:26] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:34:27] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:34:27] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:34:28] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:34:28] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 16/573 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:34:35] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:34:35] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:34:36] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:34:43] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:34:44] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:34:44] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:34:45] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 580 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 23/23 constraints]
After SMT, in 41830ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 41833ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42037 ms. Remains : 196/196 places, 338/338 transitions.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2024-06-07 07:34:47] [INFO ] Flatten gal took : 35 ms
[2024-06-07 07:34:47] [INFO ] Flatten gal took : 41 ms
[2024-06-07 07:34:47] [INFO ] Input system was already deterministic with 339 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 21 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:34:47] [INFO ] Computed 27 invariants in 2 ms
[2024-06-07 07:34:47] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-07 07:34:47] [INFO ] Invariant cache hit.
[2024-06-07 07:34:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:34:48] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-06-07 07:34:48] [INFO ] Redundant transitions in 5 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:34:48] [INFO ] Invariant cache hit.
[2024-06-07 07:34:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 12802 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:35:08] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:35:08] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:35:08] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:35:09] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:35:09] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-06-07 07:35:09] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:35:09] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:35:09] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:35:09] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:35:09] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:35:09] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:35:09] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:35:10] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:35:10] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:35:10] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:35:10] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:35:10] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:35:11] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:35:11] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:35:12] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:35:16] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:35:16] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:35:16] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:35:16] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:35:17] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 4 ms to minimize.
[2024-06-07 07:35:17] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:35:17] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:35:17] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:35:17] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:35:17] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:35:17] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:35:17] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:35:18] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2024-06-07 07:35:18] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:35:18] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:35:18] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:35:18] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:35:18] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:35:18] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:35:19] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:35:24] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-06-07 07:35:24] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 2 ms to minimize.
[2024-06-07 07:35:25] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:35:25] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:35:25] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:35:25] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:35:25] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:35:25] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:35:25] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:35:25] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:35:25] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:35:26] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:35:26] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:35:26] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-06-07 07:35:26] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:35:26] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:35:26] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:35:26] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:35:26] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:35:26] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 43765ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43768ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44084 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:35:31] [INFO ] Flatten gal took : 22 ms
[2024-06-07 07:35:31] [INFO ] Flatten gal took : 20 ms
[2024-06-07 07:35:32] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 07:35:32] [INFO ] Flatten gal took : 20 ms
[2024-06-07 07:35:32] [INFO ] Flatten gal took : 16 ms
[2024-06-07 07:35:32] [INFO ] Time to serialize gal into /tmp/CTLFireability1139044128458120619.gal : 9 ms
[2024-06-07 07:35:32] [INFO ] Time to serialize properties into /tmp/CTLFireability11840003363002356282.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/CTLFireability1139044128458120619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11840003363002356282.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-06-07 07:36:02] [INFO ] Flatten gal took : 18 ms
[2024-06-07 07:36:02] [INFO ] Applying decomposition
[2024-06-07 07:36:02] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10389640422234156931.txt' '-o' '/tmp/graph10389640422234156931.bin' '-w' '/tmp/graph10389640422234156931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10389640422234156931.bin' '-l' '-1' '-v' '-w' '/tmp/graph10389640422234156931.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:36:02] [INFO ] Decomposing Gal with order
[2024-06-07 07:36:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:36:02] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 07:36:02] [INFO ] Flatten gal took : 82 ms
[2024-06-07 07:36:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-06-07 07:36:02] [INFO ] Time to serialize gal into /tmp/CTLFireability943245247713878212.gal : 7 ms
[2024-06-07 07:36:02] [INFO ] Time to serialize properties into /tmp/CTLFireability16188792858408784450.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/CTLFireability943245247713878212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16188792858408784450.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 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 35 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:36:32] [INFO ] Invariant cache hit.
[2024-06-07 07:36:32] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-06-07 07:36:32] [INFO ] Invariant cache hit.
[2024-06-07 07:36:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:36:33] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-06-07 07:36:33] [INFO ] Redundant transitions in 4 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:36:33] [INFO ] Invariant cache hit.
[2024-06-07 07:36:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 12894 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:36:53] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:36:53] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:36:53] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 3 ms to minimize.
[2024-06-07 07:36:53] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:36:53] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:36:53] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:36:54] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:36:54] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:36:54] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2024-06-07 07:36:54] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:36:54] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:36:54] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:36:54] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:36:54] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:36:55] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:36:55] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:36:55] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:36:56] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:36:56] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:36:56] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:37:00] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:37:00] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:37:01] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:37:01] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:37:01] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 0 ms to minimize.
[2024-06-07 07:37:01] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:37:01] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:37:01] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:37:01] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:37:01] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:37:02] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:37:02] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:37:02] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:37:02] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:37:02] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:37:02] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-06-07 07:37:02] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 0 ms to minimize.
[2024-06-07 07:37:03] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:37:03] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:37:03] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:37:08] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:37:08] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 2 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 2 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:37:10] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:37:10] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 2 ms to minimize.
[2024-06-07 07:37:10] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:37:10] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:37:10] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:37:10] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:37:10] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:37:10] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 43850ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43853ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44252 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:37:16] [INFO ] Flatten gal took : 22 ms
[2024-06-07 07:37:16] [INFO ] Flatten gal took : 14 ms
[2024-06-07 07:37:16] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 07:37:17] [INFO ] Flatten gal took : 41 ms
[2024-06-07 07:37:17] [INFO ] Flatten gal took : 91 ms
RANDOM walk for 40000 steps (8 resets) in 386 ms. (103 steps per ms) remains 1/1 properties
[2024-06-07 07:37:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17781970609429214617.gal : 24 ms
[2024-06-07 07:37:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8825652123822527967.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17781970609429214617.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8825652123822527967.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40002 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8825652123822527967.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 46
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :46 after 4577
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4577 after 11790
Interrupted probabilistic random walk after 1328902 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :0 out of 1
Probabilistic random walk after 1328902 steps, saw 928536 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
[2024-06-07 07:37:20] [INFO ] Invariant cache hit.
[2024-06-07 07:37:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :11790 after 22267
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/535 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 335ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 339/339 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 338
Applied a total of 1 rules in 162 ms. Remains 196 /196 variables (removed 0) and now considering 338/339 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 196/196 places, 338/339 transitions.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :22267 after 33471
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :33471 after 44957
RANDOM walk for 4000000 steps (8 resets) in 28837 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 7291 ms. (548 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :44957 after 122880
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :122880 after 427197
Interrupted probabilistic random walk after 11110003 steps, run timeout after 27042 ms. (steps per millisecond=410 ) properties seen :0 out of 1
Probabilistic random walk after 11110003 steps, saw 7609786 distinct states, run finished after 27043 ms. (steps per millisecond=410 ) properties seen :0
// Phase 1: matrix 338 rows 196 cols
[2024-06-07 07:37:57] [INFO ] Computed 27 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 07:37:57] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 338/534 variables, 196/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 327ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 104 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 196/196 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 69 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-06-07 07:37:57] [INFO ] Invariant cache hit.
[2024-06-07 07:37:57] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-07 07:37:57] [INFO ] Invariant cache hit.
[2024-06-07 07:37:58] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-06-07 07:37:58] [INFO ] Redundant transitions in 1 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 07:37:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :427197 after 958652
At refinement iteration 6 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 334 unsolved in 10351 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 334/557 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:38:16] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-06-07 07:38:16] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:38:16] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:38:16] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:38:17] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:38:17] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:38:17] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:38:17] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:38:18] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:38:18] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:38:18] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:38:18] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 0 ms to minimize.
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:38:20] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:38:20] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 16/573 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:38:26] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:38:27] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:38:28] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:38:35] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:38:35] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:38:36] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:38:36] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 580 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 23/23 constraints]
After SMT, in 41408ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 41413ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41800 ms. Remains : 196/196 places, 338/338 transitions.
RANDOM walk for 4000000 steps (8 resets) in 28028 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 6744 ms. (593 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 11426712 steps, run timeout after 27110 ms. (steps per millisecond=421 ) properties seen :0 out of 1
Probabilistic random walk after 11426712 steps, saw 7823503 distinct states, run finished after 27110 ms. (steps per millisecond=421 ) properties seen :0
[2024-06-07 07:39:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 69 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 196/196 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 70 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-06-07 07:39:16] [INFO ] Invariant cache hit.
[2024-06-07 07:39:16] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-07 07:39:16] [INFO ] Invariant cache hit.
[2024-06-07 07:39:16] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-07 07:39:16] [INFO ] Redundant transitions in 1 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 07:39:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 334 unsolved in 10574 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 334/557 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 2 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:39:37] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:39:37] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:39:37] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:39:37] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:39:39] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:39:39] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 16/573 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:39:45] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:39:46] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:39:47] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:39:54] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:39:54] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:39:55] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 2 ms to minimize.
[2024-06-07 07:39:55] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 580 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 23/23 constraints]
After SMT, in 41586ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 41589ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41946 ms. Remains : 196/196 places, 338/338 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-07 07:39:58] [INFO ] Flatten gal took : 15 ms
[2024-06-07 07:39:58] [INFO ] Applying decomposition
[2024-06-07 07:39:58] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9206178640205923593.txt' '-o' '/tmp/graph9206178640205923593.bin' '-w' '/tmp/graph9206178640205923593.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9206178640205923593.bin' '-l' '-1' '-v' '-w' '/tmp/graph9206178640205923593.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:39:58] [INFO ] Decomposing Gal with order
[2024-06-07 07:39:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:39:58] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 07:39:58] [INFO ] Flatten gal took : 40 ms
[2024-06-07 07:39:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-06-07 07:39:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8622653567994563393.gal : 5 ms
[2024-06-07 07:39:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10430122914846005290.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8622653567994563393.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10430122914846005290.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality10430122914846005290.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 103
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :103 after 76180
Detected timeout of ITS tools.
[2024-06-07 07:49:58] [INFO ] Flatten gal took : 15 ms
[2024-06-07 07:49:59] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:49:59] [INFO ] Time to serialize gal into /tmp/CTLFireability8473690996087126282.gal : 4 ms
[2024-06-07 07:49:59] [INFO ] Time to serialize properties into /tmp/CTLFireability3366264681585633134.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/CTLFireability8473690996087126282.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3366264681585633134.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-06-07 07:50:29] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:50:29] [INFO ] Applying decomposition
[2024-06-07 07:50:29] [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/graph9841885492970358900.txt' '-o' '/tmp/graph9841885492970358900.bin' '-w' '/tmp/graph9841885492970358900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9841885492970358900.bin' '-l' '-1' '-v' '-w' '/tmp/graph9841885492970358900.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:50:29] [INFO ] Decomposing Gal with order
[2024-06-07 07:50:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:50:29] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 07:50:29] [INFO ] Flatten gal took : 61 ms
[2024-06-07 07:50:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-07 07:50:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3628152553095006433.gal : 3 ms
[2024-06-07 07:50:29] [INFO ] Time to serialize properties into /tmp/CTLFireability10730728865489944466.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/CTLFireability3628152553095006433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10730728865489944466.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 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:50:59] [INFO ] Computed 27 invariants in 2 ms
[2024-06-07 07:50:59] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-07 07:50:59] [INFO ] Invariant cache hit.
[2024-06-07 07:50:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:50:59] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:50:59] [INFO ] Invariant cache hit.
[2024-06-07 07:50:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13491 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:51:20] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:51:20] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:51:20] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:51:21] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:51:21] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:51:21] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:51:21] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 4 ms to minimize.
[2024-06-07 07:51:21] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:51:21] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:51:21] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:51:21] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:51:21] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:51:22] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:51:22] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:51:22] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:51:22] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:51:22] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:51:23] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:51:23] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:51:24] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:51:28] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:51:28] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:51:28] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:51:28] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:51:28] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:51:29] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:51:29] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:51:29] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:51:29] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:51:29] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:51:29] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:51:29] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:51:29] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:51:30] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:51:30] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 2 ms to minimize.
[2024-06-07 07:51:30] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:51:30] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:51:30] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:51:30] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:51:31] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:51:36] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:51:36] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:51:36] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:51:36] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:51:37] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 2 ms to minimize.
[2024-06-07 07:51:37] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:51:37] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:51:37] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:51:37] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:51:37] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-06-07 07:51:37] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:51:37] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:51:37] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:51:38] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:51:38] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:51:38] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:51:38] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:51:38] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:51:38] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:51:38] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44500ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44503ms
Finished structural reductions in LTL mode , in 1 iterations and 44675 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:51:43] [INFO ] Flatten gal took : 20 ms
[2024-06-07 07:51:43] [INFO ] Flatten gal took : 14 ms
[2024-06-07 07:51:44] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 07:51:44] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:51:44] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:51:44] [INFO ] Time to serialize gal into /tmp/CTLFireability13557655684905408147.gal : 2 ms
[2024-06-07 07:51:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10846806467542377864.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/CTLFireability13557655684905408147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10846806467542377864.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-06-07 07:52:14] [INFO ] Flatten gal took : 17 ms
[2024-06-07 07:52:14] [INFO ] Applying decomposition
[2024-06-07 07:52:14] [INFO ] Flatten gal took : 30 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/graph16096312506746930965.txt' '-o' '/tmp/graph16096312506746930965.bin' '-w' '/tmp/graph16096312506746930965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16096312506746930965.bin' '-l' '-1' '-v' '-w' '/tmp/graph16096312506746930965.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:52:14] [INFO ] Decomposing Gal with order
[2024-06-07 07:52:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:52:14] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 07:52:14] [INFO ] Flatten gal took : 71 ms
[2024-06-07 07:52:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-07 07:52:14] [INFO ] Time to serialize gal into /tmp/CTLFireability1973203349134012442.gal : 2 ms
[2024-06-07 07:52:14] [INFO ] Time to serialize properties into /tmp/CTLFireability9391242191445810991.ctl : 3 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/CTLFireability1973203349134012442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9391242191445810991.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:52:44] [INFO ] Invariant cache hit.
[2024-06-07 07:52:44] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-07 07:52:44] [INFO ] Invariant cache hit.
[2024-06-07 07:52:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:52:44] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:52:44] [INFO ] Invariant cache hit.
[2024-06-07 07:52:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13077 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:53:07] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:53:07] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:53:08] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:53:08] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:53:08] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:53:13] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:53:13] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:53:13] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 0 ms to minimize.
[2024-06-07 07:53:13] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:53:13] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:53:13] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:53:13] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 2 ms to minimize.
[2024-06-07 07:53:13] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:53:13] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:53:14] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:53:14] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:53:14] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:53:14] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:53:14] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:53:14] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:53:14] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:53:15] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:53:15] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:53:15] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:53:15] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:53:22] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:53:22] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:53:22] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:53:22] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:53:22] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:53:22] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:53:22] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:53:22] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:53:22] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:53:23] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:53:23] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44071ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44074ms
Finished structural reductions in LTL mode , in 1 iterations and 44227 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:53:28] [INFO ] Flatten gal took : 14 ms
[2024-06-07 07:53:28] [INFO ] Flatten gal took : 22 ms
[2024-06-07 07:53:28] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 07:53:28] [INFO ] Flatten gal took : 18 ms
[2024-06-07 07:53:28] [INFO ] Flatten gal took : 17 ms
[2024-06-07 07:53:28] [INFO ] Time to serialize gal into /tmp/CTLFireability9439129817459331809.gal : 2 ms
[2024-06-07 07:53:28] [INFO ] Time to serialize properties into /tmp/CTLFireability6273345389865987846.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9439129817459331809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6273345389865987846.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-06-07 07:53:58] [INFO ] Flatten gal took : 18 ms
[2024-06-07 07:53:58] [INFO ] Applying decomposition
[2024-06-07 07:53:58] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12788979870174878686.txt' '-o' '/tmp/graph12788979870174878686.bin' '-w' '/tmp/graph12788979870174878686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12788979870174878686.bin' '-l' '-1' '-v' '-w' '/tmp/graph12788979870174878686.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:53:58] [INFO ] Decomposing Gal with order
[2024-06-07 07:53:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:53:58] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 07:53:58] [INFO ] Flatten gal took : 58 ms
[2024-06-07 07:53:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2024-06-07 07:53:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16414811742883095628.gal : 3 ms
[2024-06-07 07:53:59] [INFO ] Time to serialize properties into /tmp/CTLFireability10637064376636900284.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/CTLFireability16414811742883095628.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10637064376636900284.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 SI_CTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 17 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:54:29] [INFO ] Invariant cache hit.
[2024-06-07 07:54:29] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-07 07:54:29] [INFO ] Invariant cache hit.
[2024-06-07 07:54:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:54:29] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-06-07 07:54:29] [INFO ] Redundant transitions in 1 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:54:29] [INFO ] Invariant cache hit.
[2024-06-07 07:54:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 12951 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:54:49] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:54:50] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:54:50] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:54:50] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:54:50] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:54:50] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:54:50] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:54:50] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:54:50] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:54:50] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:54:50] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:54:50] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:54:51] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:54:51] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:54:51] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:54:51] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:54:51] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:54:52] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:54:52] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:54:53] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:54:57] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:54:57] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2024-06-07 07:54:57] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:54:57] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:54:57] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:54:58] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:54:58] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:54:58] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:54:58] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 2 ms to minimize.
[2024-06-07 07:54:58] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:54:58] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:54:58] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:54:58] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:54:59] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:54:59] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:54:59] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:54:59] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:54:59] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:54:59] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:55:00] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:55:05] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:55:05] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:55:05] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:55:06] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:55:06] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:55:06] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:55:06] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:55:06] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:55:06] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:55:06] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:55:06] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:55:06] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:55:07] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:55:07] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:55:07] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:55:07] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:55:07] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:55:07] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:55:07] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:55:07] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 43900ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43905ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44221 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:55:13] [INFO ] Flatten gal took : 10 ms
[2024-06-07 07:55:13] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:55:13] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 07:55:13] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:55:13] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:55:13] [INFO ] Time to serialize gal into /tmp/CTLFireability4495323055545452737.gal : 2 ms
[2024-06-07 07:55:13] [INFO ] Time to serialize properties into /tmp/CTLFireability6518204504459571256.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/CTLFireability4495323055545452737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6518204504459571256.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-06-07 07:55:43] [INFO ] Flatten gal took : 15 ms
[2024-06-07 07:55:43] [INFO ] Applying decomposition
[2024-06-07 07:55: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/graph18140282457751475940.txt' '-o' '/tmp/graph18140282457751475940.bin' '-w' '/tmp/graph18140282457751475940.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18140282457751475940.bin' '-l' '-1' '-v' '-w' '/tmp/graph18140282457751475940.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:55:43] [INFO ] Decomposing Gal with order
[2024-06-07 07:55:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:55:43] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 07:55:43] [INFO ] Flatten gal took : 29 ms
[2024-06-07 07:55:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-07 07:55:43] [INFO ] Time to serialize gal into /tmp/CTLFireability4728096958188841574.gal : 4 ms
[2024-06-07 07:55:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6554015568526130978.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/CTLFireability4728096958188841574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6554015568526130978.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:56:13] [INFO ] Invariant cache hit.
[2024-06-07 07:56:13] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-07 07:56:13] [INFO ] Invariant cache hit.
[2024-06-07 07:56:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:56:13] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:56:13] [INFO ] Invariant cache hit.
[2024-06-07 07:56:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13200 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:56:34] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:56:34] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:56:34] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:56:35] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:56:35] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-06-07 07:56:35] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:56:35] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:56:35] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:56:35] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:56:35] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:56:35] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:56:35] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:56:35] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:56:36] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:56:36] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:56:36] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:56:36] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:56:37] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:56:37] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:56:37] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:56:42] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:56:42] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:56:42] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:56:42] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-06-07 07:56:42] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:56:42] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 2 ms to minimize.
[2024-06-07 07:56:42] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 2 ms to minimize.
[2024-06-07 07:56:43] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:56:43] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:56:43] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:56:43] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:56:43] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:56:43] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:56:43] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:56:44] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:56:44] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:56:44] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:56:44] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:56:44] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:56:44] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:56:50] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 2 ms to minimize.
[2024-06-07 07:56:50] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:56:50] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:56:50] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:56:50] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 2 ms to minimize.
[2024-06-07 07:56:51] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-06-07 07:56:51] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:56:51] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:56:51] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:56:51] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:56:51] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:56:51] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:56:51] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:56:51] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:56:51] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:56:52] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:56:52] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:56:52] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:56:52] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:56:52] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44181ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44184ms
Finished structural reductions in LTL mode , in 1 iterations and 44362 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:56:58] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:56:58] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:56:58] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 07:56:58] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:56:58] [INFO ] Flatten gal took : 14 ms
[2024-06-07 07:56:58] [INFO ] Time to serialize gal into /tmp/CTLFireability4844340732229716629.gal : 2 ms
[2024-06-07 07:56:58] [INFO ] Time to serialize properties into /tmp/CTLFireability9774866171132225112.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4844340732229716629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9774866171132225112.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-06-07 07:57:28] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:57:28] [INFO ] Applying decomposition
[2024-06-07 07:57:28] [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/graph17691762295235767850.txt' '-o' '/tmp/graph17691762295235767850.bin' '-w' '/tmp/graph17691762295235767850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17691762295235767850.bin' '-l' '-1' '-v' '-w' '/tmp/graph17691762295235767850.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:57:28] [INFO ] Decomposing Gal with order
[2024-06-07 07:57:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:57:28] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 07:57:28] [INFO ] Flatten gal took : 30 ms
[2024-06-07 07:57:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-07 07:57:28] [INFO ] Time to serialize gal into /tmp/CTLFireability328820487582015170.gal : 3 ms
[2024-06-07 07:57:28] [INFO ] Time to serialize properties into /tmp/CTLFireability17304739734087121978.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/CTLFireability328820487582015170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17304739734087121978.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:57:58] [INFO ] Invariant cache hit.
[2024-06-07 07:57:58] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-07 07:57:58] [INFO ] Invariant cache hit.
[2024-06-07 07:57:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:57:58] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:57:58] [INFO ] Invariant cache hit.
[2024-06-07 07:57:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13560 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:58:19] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:58:19] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:58:19] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:58:20] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:58:20] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:58:20] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:58:20] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:58:20] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:58:20] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:58:20] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:58:20] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:58:20] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:58:20] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:58:21] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:58:21] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:58:21] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:58:21] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:58:22] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:58:22] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:58:22] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:58:27] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:58:27] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:58:27] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 2 ms to minimize.
[2024-06-07 07:58:27] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:58:27] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:58:27] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:58:27] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-06-07 07:58:28] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:58:28] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:58:28] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:58:28] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:58:28] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:58:28] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:58:28] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:58:29] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:58:29] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:58:29] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:58:29] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:58:29] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:58:29] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:58:35] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:58:35] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:58:35] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2024-06-07 07:58:35] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:58:35] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:58:36] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:58:36] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:58:36] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:58:36] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:58:36] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2024-06-07 07:58:36] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:58:36] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:58:36] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:58:36] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:58:37] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:58:37] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:58:37] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:58:37] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:58:37] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:58:37] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44469ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44473ms
Finished structural reductions in LTL mode , in 1 iterations and 44623 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 07:58:42] [INFO ] Flatten gal took : 14 ms
[2024-06-07 07:58:42] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:58:43] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 07:58:43] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:58:43] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:58:43] [INFO ] Time to serialize gal into /tmp/CTLFireability6519946506533239338.gal : 2 ms
[2024-06-07 07:58:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7605691354235108196.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/CTLFireability6519946506533239338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7605691354235108196.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-06-07 07:59:13] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:59:13] [INFO ] Applying decomposition
[2024-06-07 07:59:13] [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/graph17727242312633104815.txt' '-o' '/tmp/graph17727242312633104815.bin' '-w' '/tmp/graph17727242312633104815.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17727242312633104815.bin' '-l' '-1' '-v' '-w' '/tmp/graph17727242312633104815.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:59:13] [INFO ] Decomposing Gal with order
[2024-06-07 07:59:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:59:13] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 07:59:13] [INFO ] Flatten gal took : 25 ms
[2024-06-07 07:59:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-07 07:59:13] [INFO ] Time to serialize gal into /tmp/CTLFireability9623451716076954448.gal : 2 ms
[2024-06-07 07:59:13] [INFO ] Time to serialize properties into /tmp/CTLFireability14815536583025219810.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/CTLFireability9623451716076954448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14815536583025219810.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 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 17 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:59:43] [INFO ] Invariant cache hit.
[2024-06-07 07:59:43] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-07 07:59:43] [INFO ] Invariant cache hit.
[2024-06-07 07:59:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:59:43] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-07 07:59:43] [INFO ] Redundant transitions in 1 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:59:43] [INFO ] Invariant cache hit.
[2024-06-07 07:59:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13087 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:00:04] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 08:00:04] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:00:04] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-06-07 08:00:04] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-07 08:00:04] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-07 08:00:04] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:00:04] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-07 08:00:04] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:00:04] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-07 08:00:05] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-07 08:00:05] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 08:00:05] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 08:00:05] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-06-07 08:00:05] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 08:00:05] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 08:00:05] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:00:06] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 08:00:06] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:00:07] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 08:00:07] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:00:11] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:00:11] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:00:12] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-07 08:00:12] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:00:12] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:00:12] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:00:12] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 08:00:12] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
[2024-06-07 08:00:12] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:00:12] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 08:00:13] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:00:13] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:00:13] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:00:13] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:00:13] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:00:13] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:00:13] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:00:13] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-07 08:00:14] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 08:00:14] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:00:19] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-07 08:00:20] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:00:20] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 08:00:20] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-06-07 08:00:20] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:00:20] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 08:00:20] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-06-07 08:00:20] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:00:20] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:00:20] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2024-06-07 08:00:21] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 08:00:21] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 08:00:21] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-06-07 08:00:21] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 2 ms to minimize.
[2024-06-07 08:00:21] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-07 08:00:21] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 08:00:21] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 08:00:21] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:00:22] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 0 ms to minimize.
[2024-06-07 08:00:22] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44017ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44020ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44354 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 08:00:27] [INFO ] Flatten gal took : 12 ms
[2024-06-07 08:00:27] [INFO ] Flatten gal took : 12 ms
[2024-06-07 08:00:27] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 08:00:27] [INFO ] Flatten gal took : 13 ms
[2024-06-07 08:00:27] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:00:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6495560064919822229.gal : 2 ms
[2024-06-07 08:00:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9976149958625493750.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6495560064919822229.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9976149958625493750.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9976149958625493750.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 46
RANDOM walk for 40000 steps (8 resets) in 438 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 257 ms. (155 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :46 after 4577
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4577 after 11790
Interrupted probabilistic random walk after 1315248 steps, run timeout after 3001 ms. (steps per millisecond=438 ) properties seen :0 out of 1
Probabilistic random walk after 1315248 steps, saw 919337 distinct states, run finished after 3001 ms. (steps per millisecond=438 ) properties seen :0
[2024-06-07 08:00:30] [INFO ] Invariant cache hit.
[2024-06-07 08:00:30] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :11790 after 22267
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 08:00:31] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/535 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 338/534 variables, 196/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/535 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/535 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 604ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 339/339 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 338
Applied a total of 1 rules in 108 ms. Remains 196 /196 variables (removed 0) and now considering 338/339 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 196/196 places, 338/339 transitions.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :22267 after 33471
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :33471 after 44957
RANDOM walk for 4000000 steps (8 resets) in 37627 ms. (106 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 9763 ms. (409 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :44957 after 122880
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :122880 after 427197
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :427197 after 958652
Interrupted probabilistic random walk after 15433802 steps, run timeout after 36001 ms. (steps per millisecond=428 ) properties seen :0 out of 1
Probabilistic random walk after 15433802 steps, saw 10494469 distinct states, run finished after 36001 ms. (steps per millisecond=428 ) properties seen :0
// Phase 1: matrix 338 rows 196 cols
[2024-06-07 08:01:20] [INFO ] Computed 27 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 08:01:20] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 338/534 variables, 196/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 350ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 79 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 196/196 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 67 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-06-07 08:01:20] [INFO ] Invariant cache hit.
[2024-06-07 08:01:20] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-07 08:01:20] [INFO ] Invariant cache hit.
[2024-06-07 08:01:21] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-06-07 08:01:21] [INFO ] Redundant transitions in 1 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 08:01:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 334 unsolved in 10132 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 334/557 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 08:01:39] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-06-07 08:01:39] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:01:39] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:01:39] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 08:01:39] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-06-07 08:01:40] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-07 08:01:40] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-07 08:01:40] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-07 08:01:40] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-07 08:01:41] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-07 08:01:41] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:01:41] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-07 08:01:41] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 08:01:42] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-07 08:01:42] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-07 08:01:43] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 16/573 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 08:01:49] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-07 08:01:50] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-07 08:01:51] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 08:01:57] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 08:01:58] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-06-07 08:01:58] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-07 08:01:59] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-06-07 08:02:02] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 581 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 24/24 constraints]
After SMT, in 41158ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 41161ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41557 ms. Remains : 196/196 places, 338/338 transitions.
RANDOM walk for 4000000 steps (8 resets) in 35669 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 8990 ms. (444 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 14284779 steps, run timeout after 33001 ms. (steps per millisecond=432 ) properties seen :0 out of 1
Probabilistic random walk after 14284779 steps, saw 9733795 distinct states, run finished after 33001 ms. (steps per millisecond=432 ) properties seen :0
[2024-06-07 08:02:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 08:02:47] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 338/534 variables, 196/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 633 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 882ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 68 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 196/196 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 67 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-06-07 08:02:48] [INFO ] Invariant cache hit.
[2024-06-07 08:02:48] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-07 08:02:48] [INFO ] Invariant cache hit.
[2024-06-07 08:02:48] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-06-07 08:02:48] [INFO ] Redundant transitions in 0 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 08:02:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 334 unsolved in 10507 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 334/557 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 08:03:06] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-07 08:03:06] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2024-06-07 08:03:06] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:03:07] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-07 08:03:07] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
[2024-06-07 08:03:07] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-07 08:03:07] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-07 08:03:08] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-07 08:03:08] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-07 08:03:08] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-06-07 08:03:08] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-06-07 08:03:09] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2024-06-07 08:03:09] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-07 08:03:09] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-06-07 08:03:10] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-07 08:03:11] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 16/573 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 08:03:17] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-07 08:03:18] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-07 08:03:18] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 08:03:25] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-07 08:03:26] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-07 08:03:26] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-07 08:03:26] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 580 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 23/23 constraints]
After SMT, in 41361ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 41364ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41745 ms. Remains : 196/196 places, 338/338 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-07 08:03:29] [INFO ] Flatten gal took : 15 ms
[2024-06-07 08:03:29] [INFO ] Applying decomposition
[2024-06-07 08:03:29] [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/graph13898087555656643794.txt' '-o' '/tmp/graph13898087555656643794.bin' '-w' '/tmp/graph13898087555656643794.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13898087555656643794.bin' '-l' '-1' '-v' '-w' '/tmp/graph13898087555656643794.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:03:30] [INFO ] Decomposing Gal with order
[2024-06-07 08:03:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:03:30] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 08:03:30] [INFO ] Flatten gal took : 22 ms
[2024-06-07 08:03:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-07 08:03:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10788691709942044583.gal : 4 ms
[2024-06-07 08:03:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14348182193887187141.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10788691709942044583.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14348182193887187141.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality14348182193887187141.prop.
ITS-tools command line returned an error code 137
[2024-06-07 08:12:10] [INFO ] Flatten gal took : 15 ms
[2024-06-07 08:12:10] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:12:10] [INFO ] Time to serialize gal into /tmp/CTLFireability11571439144747262074.gal : 2 ms
[2024-06-07 08:12:10] [INFO ] Time to serialize properties into /tmp/CTLFireability8719679314824813712.ctl : 3 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/CTLFireability11571439144747262074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8719679314824813712.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-06-07 08:12:41] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:12:41] [INFO ] Applying decomposition
[2024-06-07 08:12:41] [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/graph6636146756686433143.txt' '-o' '/tmp/graph6636146756686433143.bin' '-w' '/tmp/graph6636146756686433143.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6636146756686433143.bin' '-l' '-1' '-v' '-w' '/tmp/graph6636146756686433143.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:12:41] [INFO ] Decomposing Gal with order
[2024-06-07 08:12:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:12:41] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 08:12:41] [INFO ] Flatten gal took : 21 ms
[2024-06-07 08:12:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-07 08:12:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15320701043241188716.gal : 2 ms
[2024-06-07 08:12:41] [INFO ] Time to serialize properties into /tmp/CTLFireability11483104093704530017.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/CTLFireability15320701043241188716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11483104093704530017.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 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 5 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 08:13:11] [INFO ] Computed 27 invariants in 2 ms
[2024-06-07 08:13:11] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-07 08:13:11] [INFO ] Invariant cache hit.
[2024-06-07 08:13:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:13:11] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 08:13:11] [INFO ] Invariant cache hit.
[2024-06-07 08:13:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 12735 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:13:31] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 2 ms to minimize.
[2024-06-07 08:13:31] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:13:31] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-06-07 08:13:31] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:13:32] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-06-07 08:13:32] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 08:13:32] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:13:32] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 08:13:32] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-07 08:13:32] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:13:32] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 08:13:32] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-07 08:13:32] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:13:32] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 08:13:33] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2024-06-07 08:13:33] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-07 08:13:33] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 08:13:34] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 08:13:34] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 08:13:34] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:13:39] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 08:13:39] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-07 08:13:39] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:13:39] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 2 ms to minimize.
[2024-06-07 08:13:39] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:13:39] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:13:39] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:13:39] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 08:13:40] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:13:40] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:13:40] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:13:40] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:13:40] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:13:40] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 08:13:40] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:13:41] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:13:41] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:13:41] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:13:41] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-07 08:13:41] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:13:47] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 08:13:47] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-07 08:13:47] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-06-07 08:13:47] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:13:47] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-07 08:13:47] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:13:48] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-07 08:13:48] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:13:48] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:13:48] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:13:48] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-07 08:13:48] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-07 08:13:48] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-07 08:13:48] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-07 08:13:48] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2024-06-07 08:13:49] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:13:49] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 08:13:49] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:13:49] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:13:49] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 43598ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43601ms
Finished structural reductions in LTL mode , in 1 iterations and 43910 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 08:13:55] [INFO ] Flatten gal took : 11 ms
[2024-06-07 08:13:55] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:13:55] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 08:13:55] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:13:55] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:13:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13535442804146986860.gal : 2 ms
[2024-06-07 08:13:55] [INFO ] Time to serialize properties into /tmp/CTLFireability8877488713192390758.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/CTLFireability13535442804146986860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8877488713192390758.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-06-07 08:14:25] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:14:25] [INFO ] Applying decomposition
[2024-06-07 08:14:25] [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/graph1866824420536688764.txt' '-o' '/tmp/graph1866824420536688764.bin' '-w' '/tmp/graph1866824420536688764.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1866824420536688764.bin' '-l' '-1' '-v' '-w' '/tmp/graph1866824420536688764.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:14:25] [INFO ] Decomposing Gal with order
[2024-06-07 08:14:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:14:25] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 08:14:25] [INFO ] Flatten gal took : 22 ms
[2024-06-07 08:14:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-07 08:14:25] [INFO ] Time to serialize gal into /tmp/CTLFireability5313111624128354484.gal : 2 ms
[2024-06-07 08:14:25] [INFO ] Time to serialize properties into /tmp/CTLFireability15261533762242423321.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/CTLFireability5313111624128354484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15261533762242423321.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 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 08:14:55] [INFO ] Invariant cache hit.
[2024-06-07 08:14:55] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-07 08:14:55] [INFO ] Invariant cache hit.
[2024-06-07 08:14:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:14:55] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 08:14:55] [INFO ] Invariant cache hit.
[2024-06-07 08:14:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13196 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:15:16] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 08:15:16] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:15:16] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-06-07 08:15:16] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 2 ms to minimize.
[2024-06-07 08:15:16] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-06-07 08:15:16] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
[2024-06-07 08:15:17] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-07 08:15:17] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 08:15:17] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 08:15:17] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:15:17] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-07 08:15:17] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-07 08:15:17] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:15:17] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-07 08:15:18] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 08:15:18] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 08:15:18] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:15:19] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:15:19] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 08:15:19] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:15:24] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:15:24] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 08:15:24] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 08:15:24] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:15:24] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-07 08:15:24] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:15:24] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:15:25] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2024-06-07 08:15:25] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:15:25] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-07 08:15:25] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:15:25] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:15:25] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:15:25] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:15:25] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-07 08:15:26] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:15:26] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:15:26] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 08:15:26] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-06-07 08:15:26] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:15:32] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-06-07 08:15:32] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:15:32] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 08:15:32] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:15:33] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 08:15:33] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 08:15:33] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-07 08:15:33] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:15:33] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:15:33] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-07 08:15:33] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 08:15:33] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-06-07 08:15:33] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-06-07 08:15:33] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:15:34] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:15:34] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:15:34] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-07 08:15:34] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:15:34] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:15:34] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44065ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44067ms
Finished structural reductions in LTL mode , in 1 iterations and 44347 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 08:15:39] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:15:39] [INFO ] Flatten gal took : 18 ms
[2024-06-07 08:15:39] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 08:15:39] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:15:39] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:15:39] [INFO ] Time to serialize gal into /tmp/CTLFireability9576826521692531888.gal : 2 ms
[2024-06-07 08:15:39] [INFO ] Time to serialize properties into /tmp/CTLFireability14179629917530096044.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/CTLFireability9576826521692531888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14179629917530096044.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-06-07 08:16:09] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:16:09] [INFO ] Applying decomposition
[2024-06-07 08:16:09] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13684281193092817988.txt' '-o' '/tmp/graph13684281193092817988.bin' '-w' '/tmp/graph13684281193092817988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13684281193092817988.bin' '-l' '-1' '-v' '-w' '/tmp/graph13684281193092817988.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:16:09] [INFO ] Decomposing Gal with order
[2024-06-07 08:16:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:16:09] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 08:16:09] [INFO ] Flatten gal took : 22 ms
[2024-06-07 08:16:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-07 08:16:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13545517553304212498.gal : 2 ms
[2024-06-07 08:16:09] [INFO ] Time to serialize properties into /tmp/CTLFireability7555183094725759552.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/CTLFireability13545517553304212498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7555183094725759552.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 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 1 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 08:16:39] [INFO ] Invariant cache hit.
[2024-06-07 08:16:40] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-07 08:16:40] [INFO ] Invariant cache hit.
[2024-06-07 08:16:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:16:40] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 08:16:40] [INFO ] Invariant cache hit.
[2024-06-07 08:16:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 12863 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:17:00] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 08:17:00] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:17:00] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-07 08:17:01] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:17:01] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-06-07 08:17:01] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 2 ms to minimize.
[2024-06-07 08:17:01] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 08:17:01] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:17:01] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 08:17:01] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:17:01] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-07 08:17:01] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 08:17:01] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-07 08:17:02] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 08:17:02] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 08:17:02] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 08:17:02] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 08:17:03] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-07 08:17:03] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-07 08:17:03] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:17:08] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:17:08] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:17:08] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:17:08] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 2 ms to minimize.
[2024-06-07 08:17:08] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:17:09] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 08:17:09] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-07 08:17:09] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-06-07 08:17:09] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:17:09] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 08:17:09] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:17:09] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:17:10] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:17:10] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:17:10] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:17:10] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:17:10] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:17:10] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:17:10] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 08:17:11] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:17:16] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:17:16] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:17:17] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-07 08:17:17] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:17:17] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-07 08:17:17] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 08:17:17] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-06-07 08:17:17] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2024-06-07 08:17:17] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 0 ms to minimize.
[2024-06-07 08:17:17] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-07 08:17:17] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-06-07 08:17:17] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-07 08:17:18] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 08:17:18] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-06-07 08:17:18] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:17:18] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 08:17:18] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 08:17:18] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 08:17:18] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:17:18] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 43796ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43799ms
Finished structural reductions in LTL mode , in 1 iterations and 44085 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 08:17:24] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:17:24] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:17:24] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 08:17:24] [INFO ] Flatten gal took : 11 ms
[2024-06-07 08:17:24] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:17:24] [INFO ] Time to serialize gal into /tmp/CTLFireability7501709243286831337.gal : 2 ms
[2024-06-07 08:17:24] [INFO ] Time to serialize properties into /tmp/CTLFireability10601629045961577966.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/CTLFireability7501709243286831337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10601629045961577966.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-06-07 08:17:54] [INFO ] Flatten gal took : 14 ms
[2024-06-07 08:17:54] [INFO ] Applying decomposition
[2024-06-07 08:17: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/graph15586596376139395786.txt' '-o' '/tmp/graph15586596376139395786.bin' '-w' '/tmp/graph15586596376139395786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15586596376139395786.bin' '-l' '-1' '-v' '-w' '/tmp/graph15586596376139395786.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:17:54] [INFO ] Decomposing Gal with order
[2024-06-07 08:17:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:17:54] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 08:17:54] [INFO ] Flatten gal took : 24 ms
[2024-06-07 08:17:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-07 08:17:54] [INFO ] Time to serialize gal into /tmp/CTLFireability5289962951142474688.gal : 17 ms
[2024-06-07 08:17:54] [INFO ] Time to serialize properties into /tmp/CTLFireability3600514928147462854.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/CTLFireability5289962951142474688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3600514928147462854.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 1 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 08:18:24] [INFO ] Invariant cache hit.
[2024-06-07 08:18:24] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-07 08:18:24] [INFO ] Invariant cache hit.
[2024-06-07 08:18:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:18:24] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 08:18:24] [INFO ] Invariant cache hit.
[2024-06-07 08:18:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 12965 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:18:45] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 08:18:45] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:18:45] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-07 08:18:45] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2024-06-07 08:18:45] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 08:18:45] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 08:18:45] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-07 08:18:45] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 08:18:45] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:18:45] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:18:46] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 08:18:46] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 08:18:46] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2024-06-07 08:18:46] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 08:18:46] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 08:18:46] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:18:47] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:18:47] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:18:48] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 08:18:48] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:18:52] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:18:52] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:18:52] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-07 08:18:53] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-06-07 08:18:53] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 0 ms to minimize.
[2024-06-07 08:18:53] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 08:18:53] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 08:18:53] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 08:18:53] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:18:53] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:18:53] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:18:54] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 08:18:54] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:18:54] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:18:54] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
[2024-06-07 08:18:54] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 08:18:54] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:18:54] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:18:55] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 08:18:55] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:19:00] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:19:00] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:19:01] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-06-07 08:19:01] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:19:01] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-06-07 08:19:01] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-06-07 08:19:01] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-07 08:19:01] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-07 08:19:01] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-07 08:19:01] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-06-07 08:19:02] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-07 08:19:02] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 08:19:02] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2024-06-07 08:19:02] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-06-07 08:19:02] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:19:02] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:19:02] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 08:19:02] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 08:19:03] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 2 ms to minimize.
[2024-06-07 08:19:03] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 43827ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43830ms
Finished structural reductions in LTL mode , in 1 iterations and 44110 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 08:19:08] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:19:08] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:19:08] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 08:19:08] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:19:08] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:19:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5596087098729956537.gal : 2 ms
[2024-06-07 08:19:08] [INFO ] Time to serialize properties into /tmp/CTLFireability1894998445097374435.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/CTLFireability5596087098729956537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1894998445097374435.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-06-07 08:19:38] [INFO ] Flatten gal took : 17 ms
[2024-06-07 08:19:38] [INFO ] Applying decomposition
[2024-06-07 08:19:38] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17062350988269701705.txt' '-o' '/tmp/graph17062350988269701705.bin' '-w' '/tmp/graph17062350988269701705.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17062350988269701705.bin' '-l' '-1' '-v' '-w' '/tmp/graph17062350988269701705.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:19:38] [INFO ] Decomposing Gal with order
[2024-06-07 08:19:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:19:38] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 08:19:38] [INFO ] Flatten gal took : 21 ms
[2024-06-07 08:19:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-07 08:19:38] [INFO ] Time to serialize gal into /tmp/CTLFireability10309535305963265052.gal : 2 ms
[2024-06-07 08:19:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9582345682866380791.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/CTLFireability10309535305963265052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9582345682866380791.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 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 08:20:08] [INFO ] Invariant cache hit.
[2024-06-07 08:20:08] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-07 08:20:08] [INFO ] Invariant cache hit.
[2024-06-07 08:20:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:20:08] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 08:20:08] [INFO ] Invariant cache hit.
[2024-06-07 08:20:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13182 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:20:29] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 08:20:29] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:20:29] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-07 08:20:30] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 08:20:30] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-06-07 08:20:30] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:20:30] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:20:30] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 08:20:30] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 08:20:30] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:20:30] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-07 08:20:30] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-07 08:20:30] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:20:31] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 08:20:31] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 08:20:31] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:20:31] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 08:20:32] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:20:32] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 08:20:32] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:20:37] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 08:20:37] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2024-06-07 08:20:37] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:20:37] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:20:37] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-07 08:20:37] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-07 08:20:37] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 08:20:38] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 08:20:38] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:20:38] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-07 08:20:38] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:20:38] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 08:20:38] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 08:20:38] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:20:39] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:20:39] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 08:20:39] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:20:39] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:20:39] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-07 08:20:39] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:20:45] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 08:20:45] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:20:45] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:20:45] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:20:46] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:20:46] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 08:20:46] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-07 08:20:46] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:20:46] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:20:46] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:20:46] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:20:46] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-07 08:20:46] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 08:20:47] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:20:47] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:20:47] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:20:47] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 08:20:47] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 08:20:47] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:20:47] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44090ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44093ms
Finished structural reductions in LTL mode , in 1 iterations and 44381 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 08:20:53] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:20:53] [INFO ] Flatten gal took : 11 ms
[2024-06-07 08:20:53] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 08:20:53] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:20:53] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:20:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16027479696703570332.gal : 2 ms
[2024-06-07 08:20:53] [INFO ] Time to serialize properties into /tmp/CTLFireability3659449557248647054.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/CTLFireability16027479696703570332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3659449557248647054.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-06-07 08:21:23] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:21:23] [INFO ] Applying decomposition
[2024-06-07 08:21:23] [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/graph16722946863704255615.txt' '-o' '/tmp/graph16722946863704255615.bin' '-w' '/tmp/graph16722946863704255615.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16722946863704255615.bin' '-l' '-1' '-v' '-w' '/tmp/graph16722946863704255615.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:21:23] [INFO ] Decomposing Gal with order
[2024-06-07 08:21:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:21:23] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 08:21:23] [INFO ] Flatten gal took : 19 ms
[2024-06-07 08:21:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-07 08:21:23] [INFO ] Time to serialize gal into /tmp/CTLFireability8945428664574776668.gal : 2 ms
[2024-06-07 08:21:23] [INFO ] Time to serialize properties into /tmp/CTLFireability1503432555500997692.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/CTLFireability8945428664574776668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1503432555500997692.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 08:21:53] [INFO ] Invariant cache hit.
[2024-06-07 08:21:53] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-07 08:21:53] [INFO ] Invariant cache hit.
[2024-06-07 08:21:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:21:53] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 08:21:53] [INFO ] Invariant cache hit.
[2024-06-07 08:21:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13117 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:22:14] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 08:22:14] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 0 ms to minimize.
[2024-06-07 08:22:14] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-06-07 08:22:14] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 2 ms to minimize.
[2024-06-07 08:22:14] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-06-07 08:22:14] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 08:22:15] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 08:22:15] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:22:15] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-07 08:22:15] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:22:15] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-07 08:22:15] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 08:22:15] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 08:22:15] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-07 08:22:15] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-07 08:22:16] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-07 08:22:16] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-07 08:22:17] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 08:22:17] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 08:22:17] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:22:21] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 08:22:22] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 08:22:22] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:22:22] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-07 08:22:22] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:22:22] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-07 08:22:22] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:22:22] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:22:22] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:22:23] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 08:22:23] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:22:23] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:22:23] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-06-07 08:22:23] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:22:23] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:22:23] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-06-07 08:22:23] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:22:24] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 08:22:24] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-07 08:22:24] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:22:30] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-07 08:22:30] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:22:30] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:22:30] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:22:30] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-07 08:22:30] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 08:22:30] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:22:30] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-06-07 08:22:31] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 0 ms to minimize.
[2024-06-07 08:22:31] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:22:31] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:22:31] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-07 08:22:31] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-06-07 08:22:31] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:22:31] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:22:31] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:22:31] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 08:22:32] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:22:32] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:22:32] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 43967ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43970ms
Finished structural reductions in LTL mode , in 1 iterations and 44283 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 08:22:37] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:22:37] [INFO ] Flatten gal took : 15 ms
[2024-06-07 08:22:37] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 08:22:37] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:22:37] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:22:37] [INFO ] Time to serialize gal into /tmp/CTLFireability15732367344239570737.gal : 3 ms
[2024-06-07 08:22:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16702109921352516029.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/CTLFireability15732367344239570737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16702109921352516029.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-06-07 08:23:07] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:23:07] [INFO ] Applying decomposition
[2024-06-07 08:23:07] [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/graph10103711832411144573.txt' '-o' '/tmp/graph10103711832411144573.bin' '-w' '/tmp/graph10103711832411144573.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10103711832411144573.bin' '-l' '-1' '-v' '-w' '/tmp/graph10103711832411144573.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:23:07] [INFO ] Decomposing Gal with order
[2024-06-07 08:23:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:23:07] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 08:23:07] [INFO ] Flatten gal took : 18 ms
[2024-06-07 08:23:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-07 08:23:07] [INFO ] Time to serialize gal into /tmp/CTLFireability3546137237524827948.gal : 2 ms
[2024-06-07 08:23:07] [INFO ] Time to serialize properties into /tmp/CTLFireability4961142482921089448.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/CTLFireability3546137237524827948.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4961142482921089448.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 5 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 08:23:37] [INFO ] Invariant cache hit.
[2024-06-07 08:23:37] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-07 08:23:37] [INFO ] Invariant cache hit.
[2024-06-07 08:23:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:23:38] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 08:23:38] [INFO ] Invariant cache hit.
[2024-06-07 08:23:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13047 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:23:58] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 08:23:58] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:23:58] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:23:59] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 2 ms to minimize.
[2024-06-07 08:23:59] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-07 08:23:59] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:23:59] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:23:59] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-07 08:23:59] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 08:23:59] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:23:59] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:23:59] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-07 08:23:59] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 08:24:00] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 08:24:00] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-07 08:24:00] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:24:00] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 08:24:01] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 08:24:01] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 08:24:01] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:24:06] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:24:06] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-06-07 08:24:06] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:24:06] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 2 ms to minimize.
[2024-06-07 08:24:06] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 0 ms to minimize.
[2024-06-07 08:24:06] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:24:06] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-07 08:24:06] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-07 08:24:07] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 08:24:07] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-07 08:24:07] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 0 ms to minimize.
[2024-06-07 08:24:07] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:24:07] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 08:24:07] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:24:07] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:24:08] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 08:24:08] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 08:24:08] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-07 08:24:08] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-07 08:24:08] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:24:14] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 08:24:14] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:24:14] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 08:24:14] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:24:14] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 08:24:14] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 08:24:15] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:24:15] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:24:15] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 0 ms to minimize.
[2024-06-07 08:24:15] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-06-07 08:24:15] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-07 08:24:15] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-07 08:24:15] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-07 08:24:15] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:24:15] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-06-07 08:24:15] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:24:16] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-07 08:24:16] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:24:16] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:24:16] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 43905ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43908ms
Finished structural reductions in LTL mode , in 1 iterations and 44194 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 08:24:22] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:24:22] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:24:22] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 08:24:22] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:24:22] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:24:22] [INFO ] Time to serialize gal into /tmp/CTLFireability4489177466647832905.gal : 2 ms
[2024-06-07 08:24:22] [INFO ] Time to serialize properties into /tmp/CTLFireability8247322068610014302.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/CTLFireability4489177466647832905.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8247322068610014302.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-06-07 08:24:52] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:24:52] [INFO ] Applying decomposition
[2024-06-07 08:24:52] [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/graph13857368059130137872.txt' '-o' '/tmp/graph13857368059130137872.bin' '-w' '/tmp/graph13857368059130137872.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13857368059130137872.bin' '-l' '-1' '-v' '-w' '/tmp/graph13857368059130137872.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:24:52] [INFO ] Decomposing Gal with order
[2024-06-07 08:24:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:24:52] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 08:24:52] [INFO ] Flatten gal took : 19 ms
[2024-06-07 08:24:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-07 08:24:52] [INFO ] Time to serialize gal into /tmp/CTLFireability11948197313365323195.gal : 2 ms
[2024-06-07 08:24:52] [INFO ] Time to serialize properties into /tmp/CTLFireability7790047529084749526.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/CTLFireability11948197313365323195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7790047529084749526.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 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 1 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 08:25:22] [INFO ] Invariant cache hit.
[2024-06-07 08:25:22] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-07 08:25:22] [INFO ] Invariant cache hit.
[2024-06-07 08:25:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:25:22] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 08:25:22] [INFO ] Invariant cache hit.
[2024-06-07 08:25:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 12792 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:25:42] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 08:25:43] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:25:43] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:25:43] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:25:43] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2024-06-07 08:25:43] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:25:43] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 08:25:43] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-07 08:25:43] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 08:25:43] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 2 ms to minimize.
[2024-06-07 08:25:43] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-07 08:25:43] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 08:25:44] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-06-07 08:25:44] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-07 08:25:44] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 08:25:44] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:25:44] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-07 08:25:45] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 08:25:45] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 08:25:46] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:25:50] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:25:50] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:25:50] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:25:50] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:25:50] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-06-07 08:25:51] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 08:25:51] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 2 ms to minimize.
[2024-06-07 08:25:51] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-07 08:25:51] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 08:25:51] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 2 ms to minimize.
[2024-06-07 08:25:51] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:25:51] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 08:25:51] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 08:25:52] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:25:52] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 08:25:52] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:25:52] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-07 08:25:52] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-07 08:25:52] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-07 08:25:53] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 08:25:58] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 08:25:58] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-06-07 08:25:58] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:25:58] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:25:59] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 08:25:59] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:25:59] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-06-07 08:25:59] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:25:59] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-07 08:25:59] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-06-07 08:25:59] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-07 08:25:59] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 08:25:59] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-07 08:25:59] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 2 ms to minimize.
[2024-06-07 08:26:00] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:26:00] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-06-07 08:26:00] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-07 08:26:00] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:26:00] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:26:00] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 43729ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43732ms
Finished structural reductions in LTL mode , in 1 iterations and 44052 ms. Remains : 196/196 places, 339/339 transitions.
[2024-06-07 08:26:06] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:26:06] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:26:06] [INFO ] Input system was already deterministic with 339 transitions.
[2024-06-07 08:26:06] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:26:06] [INFO ] Flatten gal took : 9 ms
[2024-06-07 08:26:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13978050582286994188.gal : 2 ms
[2024-06-07 08:26:06] [INFO ] Time to serialize properties into /tmp/CTLFireability5202480561990370238.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/CTLFireability13978050582286994188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5202480561990370238.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-06-07 08:26:36] [INFO ] Flatten gal took : 10 ms
[2024-06-07 08:26:36] [INFO ] Applying decomposition
[2024-06-07 08:26:36] [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/graph10488640921465877801.txt' '-o' '/tmp/graph10488640921465877801.bin' '-w' '/tmp/graph10488640921465877801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10488640921465877801.bin' '-l' '-1' '-v' '-w' '/tmp/graph10488640921465877801.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:26:36] [INFO ] Decomposing Gal with order
[2024-06-07 08:26:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:26:36] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 08:26:36] [INFO ] Flatten gal took : 19 ms
[2024-06-07 08:26:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-07 08:26:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2463021617480156463.gal : 2 ms
[2024-06-07 08:26:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3594019330722151690.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/CTLFireability2463021617480156463.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3594019330722151690.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.
[2024-06-07 08:27:06] [INFO ] Flatten gal took : 27 ms
[2024-06-07 08:27:06] [INFO ] Flatten gal took : 27 ms
[2024-06-07 08:27:06] [INFO ] Applying decomposition
[2024-06-07 08:27:06] [INFO ] Flatten gal took : 27 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/graph5624179392812899417.txt' '-o' '/tmp/graph5624179392812899417.bin' '-w' '/tmp/graph5624179392812899417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5624179392812899417.bin' '-l' '-1' '-v' '-w' '/tmp/graph5624179392812899417.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:27:07] [INFO ] Decomposing Gal with order
[2024-06-07 08:27:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:27:07] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-07 08:27:07] [INFO ] Flatten gal took : 42 ms
[2024-06-07 08:27:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-07 08:27:07] [INFO ] Time to serialize gal into /tmp/CTLFireability6929687288040231114.gal : 3 ms
[2024-06-07 08:27:07] [INFO ] Time to serialize properties into /tmp/CTLFireability162630045017943877.ctl : 8 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/CTLFireability6929687288040231114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability162630045017943877.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BlocksWorld-PT-02"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BlocksWorld-PT-02, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r602-tall-171774424600170"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-02.tgz
mv BlocksWorld-PT-02 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;