About the Execution of ITS-Tools for BlocksWorld-PT-01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16203.592 | 2998639.00 | 3094288.00 | 8277.80 | FFTTTFFTTFFTFFTT | normal |
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-171774424500161.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-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r602-tall-171774424500161
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 42K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 240K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 93K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 500K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 32K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 192K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K 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 87K 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-01-CTLCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-01-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717745441188
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-07 07:30:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 07:30:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:30:42] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-06-07 07:30:42] [INFO ] Transformed 109 places.
[2024-06-07 07:30:42] [INFO ] Transformed 181 transitions.
[2024-06-07 07:30:42] [INFO ] Found NUPN structural information;
[2024-06-07 07:30:42] [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]
[2024-06-07 07:30:42] [INFO ] Parsed PT model containing 109 places and 181 transitions and 896 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Support contains 109 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 181/181 transitions.
Applied a total of 0 rules in 8 ms. Remains 109 /109 variables (removed 0) and now considering 181/181 (removed 0) transitions.
// Phase 1: matrix 181 rows 109 cols
[2024-06-07 07:30:42] [INFO ] Computed 19 invariants in 13 ms
[2024-06-07 07:30:42] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-07 07:30:42] [INFO ] Invariant cache hit.
[2024-06-07 07:30:42] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-07 07:30:42] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2024-06-07 07:30:42] [INFO ] Invariant cache hit.
[2024-06-07 07:30:42] [INFO ] State equation strengthened by 15 read => feed constraints.
Problem TDEAD28 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 15/15 constraints. Problems are: Problem set: 14 solved, 165 unsolved
[2024-06-07 07:30:44] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 15 ms to minimize.
[2024-06-07 07:30:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 2/17 constraints. Problems are: Problem set: 14 solved, 165 unsolved
[2024-06-07 07:30:44] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/18 constraints. Problems are: Problem set: 14 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 14 solved, 165 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/109 variables, 4/22 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:30:45] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-07 07:30:45] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:30:45] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 3/25 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:30:46] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 1/26 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/26 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 180/289 variables, 109/135 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 14/149 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/149 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 11 (OVERLAPS) 1/290 variables, 1/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 13 (OVERLAPS) 0/290 variables, 0/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 150 constraints, problems are : Problem set: 18 solved, 161 unsolved in 6762 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 18 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/7 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 11/109 variables, 18/25 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/26 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:30:51] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/27 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/27 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 180/289 variables, 109/136 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 14/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 161/311 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:30:52] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-07 07:30:53] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:30:53] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 2 ms to minimize.
[2024-06-07 07:30:53] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-07 07:30:53] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:30:53] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-07 07:30:53] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-07 07:30:53] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:30:53] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:30:53] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:30:53] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:30:53] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:30:53] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 4 ms to minimize.
[2024-06-07 07:30:54] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:30:54] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:30:54] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:30:54] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-07 07:30:54] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:30:54] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:30:54] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 20/331 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:30:55] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:30:55] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:30:55] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:30:56] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:30:56] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:30:56] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
[2024-06-07 07:30:56] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:30:56] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 8/339 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:30:58] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-07 07:30:58] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:30:58] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:30:59] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 4/343 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:01] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:31:01] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:31:01] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 3/346 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:03] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:31:05] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 2/348 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:06] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:31:07] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 2/350 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:10] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/289 variables, 1/351 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:13] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:31:13] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/289 variables, 2/353 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:31:15] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/289 variables, 1/354 constraints. Problems are: Problem set: 18 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/290 variables, and 354 constraints, problems are : Problem set: 18 solved, 161 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 14/15 constraints, PredecessorRefiner: 161/179 constraints, Known Traps: 51/51 constraints]
After SMT, in 37259ms problems are : Problem set: 18 solved, 161 unsolved
Search for dead transitions found 18 dead transitions in 37273ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 109/109 places, 163/181 transitions.
Deduced a syphon composed of 9 places in 1 ms
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37625 ms. Remains : 109/109 places, 163/181 transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Support contains 100 out of 100 places after structural reductions.
[2024-06-07 07:31:20] [INFO ] Flatten gal took : 39 ms
[2024-06-07 07:31:20] [INFO ] Flatten gal took : 17 ms
[2024-06-07 07:31:20] [INFO ] Input system was already deterministic with 163 transitions.
RANDOM walk for 40000 steps (8 resets) in 3331 ms. (12 steps per ms) remains 31/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
// Phase 1: matrix 163 rows 100 cols
[2024-06-07 07:31:22] [INFO ] Computed 19 invariants in 2 ms
[2024-06-07 07:31:22] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp63 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 19/19 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/263 variables, 1/120 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/120 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/120 constraints. Problems are: Problem set: 29 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 120 constraints, problems are : Problem set: 29 solved, 2 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 29 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/100 variables, 19/19 constraints. Problems are: Problem set: 29 solved, 2 unsolved
[2024-06-07 07:31:22] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Int declared 100/263 variables, and 20 constraints, problems are : Problem set: 31 solved, 0 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 0/100 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/31 constraints, Known Traps: 1/1 constraints]
After SMT, in 371ms problems are : Problem set: 31 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 31 atomic propositions for a total of 16 simplifications.
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:31:22] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-07 07:31:22] [INFO ] Flatten gal took : 27 ms
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:31:22] [INFO ] Flatten gal took : 17 ms
[2024-06-07 07:31:22] [INFO ] Input system was already deterministic with 163 transitions.
Support contains 39 out of 100 places (down from 47) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 15 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 07:31:22] [INFO ] Invariant cache hit.
[2024-06-07 07:31:22] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-07 07:31:22] [INFO ] Invariant cache hit.
[2024-06-07 07:31:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:31:22] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-06-07 07:31:22] [INFO ] Redundant transitions in 5 ms returned []
Running 161 sub problems to find dead transitions.
[2024-06-07 07:31:22] [INFO ] Invariant cache hit.
[2024-06-07 07:31:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 1/263 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 120 constraints, problems are : Problem set: 0 solved, 161 unsolved in 3441 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 161/280 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:31:28] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:31:28] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:31:28] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:31:28] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:31:28] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:31:28] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:31:28] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:31:28] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:31:28] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:31:28] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:31:28] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:31:30] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:31:30] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:31:31] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:31:32] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 19/319 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:31:35] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:31:35] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2024-06-07 07:31:35] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:31:35] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:31:36] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:31:36] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:31:36] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:31:36] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:31:36] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:31:36] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:31:37] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 14/333 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:31:39] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:31:39] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:31:39] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:31:39] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:31:40] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:31:40] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:31:40] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:31:41] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:31:41] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 9/342 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:31:43] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:31:43] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:31:43] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:31:43] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:31:43] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:31:43] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:31:44] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:31:44] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:31:44] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:31:45] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 17/359 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:31:47] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:31:47] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:31:48] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:31:48] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:31:49] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:31:50] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 9/368 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:31:52] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:31:52] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:31:53] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:31:53] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:31:54] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:31:54] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:31:54] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:31:54] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:31:54] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:31:55] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:31:55] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 11/379 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/263 variables, and 379 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 99/99 constraints]
After SMT, in 33750ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 33752ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 33963 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:31:56] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:31:56] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:31:56] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-07 07:31:56] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:31:56] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:31:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality2645180639885927325.gal : 4 ms
[2024-06-07 07:31:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality2241365676715507094.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/CTLCardinality2645180639885927325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2241365676715507094.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:32:26] [INFO ] Flatten gal took : 10 ms
[2024-06-07 07:32:26] [INFO ] Applying decomposition
[2024-06-07 07:32:26] [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/graph17875502579072563734.txt' '-o' '/tmp/graph17875502579072563734.bin' '-w' '/tmp/graph17875502579072563734.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17875502579072563734.bin' '-l' '-1' '-v' '-w' '/tmp/graph17875502579072563734.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:32:26] [INFO ] Decomposing Gal with order
[2024-06-07 07:32:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:32:26] [INFO ] Removed a total of 126 redundant transitions.
[2024-06-07 07:32:26] [INFO ] Flatten gal took : 105 ms
[2024-06-07 07:32:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 9 ms.
[2024-06-07 07:32:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality13204922455779546625.gal : 3 ms
[2024-06-07 07:32:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality16762881654928624192.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/CTLCardinality13204922455779546625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16762881654928624192.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.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 07:32:57] [INFO ] Invariant cache hit.
[2024-06-07 07:32:57] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-07 07:32:57] [INFO ] Invariant cache hit.
[2024-06-07 07:32:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:32:57] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-06-07 07:32:57] [INFO ] Invariant cache hit.
[2024-06-07 07:32:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 1/263 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 120 constraints, problems are : Problem set: 0 solved, 161 unsolved in 3469 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 161/280 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:33:02] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:33:02] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:33:02] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:33:02] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:33:02] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:33:02] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:33:03] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:33:03] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:33:03] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:33:03] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-07 07:33:03] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-06-07 07:33:03] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:33:03] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:33:03] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:33:03] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:33:03] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:33:04] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:33:04] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:33:04] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:33:04] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:33:05] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:33:05] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:33:05] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-07 07:33:05] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:33:05] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:33:05] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:33:05] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-07 07:33:06] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-07 07:33:06] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:33:06] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:33:06] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-07 07:33:07] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:33:07] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:33:07] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:33:07] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:33:07] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:33:07] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:33:07] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:33:07] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 19/319 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:33:09] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:33:09] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:33:09] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:33:09] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:33:10] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:33:10] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:33:10] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:33:10] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:33:10] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:33:10] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:33:11] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:33:11] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:33:11] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:33:11] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 14/333 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:33:13] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:33:13] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:33:13] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:33:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:33:14] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:33:14] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:33:15] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:33:15] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:33:15] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 9/342 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:33:17] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:33:17] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:33:17] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:33:17] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:33:17] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:33:18] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:33:18] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:33:18] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:33:19] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-07 07:33:19] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:33:19] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:33:19] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:33:19] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:33:19] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:33:19] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:33:19] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:33:20] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 17/359 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:33:21] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:33:21] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:33:23] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:33:23] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:33:23] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:33:23] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:33:23] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:33:23] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:33:24] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 9/368 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:33:26] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:33:26] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:33:27] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:33:28] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:33:28] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:33:28] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:33:28] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:33:28] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:33:29] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:33:29] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:33:29] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 11/379 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/263 variables, and 379 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 99/99 constraints]
After SMT, in 33713ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 33719ms
Finished structural reductions in LTL mode , in 1 iterations and 33931 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:33:30] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:33:30] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:33:30] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-07 07:33:30] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:33:30] [INFO ] Flatten gal took : 10 ms
[2024-06-07 07:33:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality6263124720981818953.gal : 2 ms
[2024-06-07 07:33:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality1053124224974401408.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/CTLCardinality6263124720981818953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1053124224974401408.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:34:01] [INFO ] Flatten gal took : 9 ms
[2024-06-07 07:34:01] [INFO ] Applying decomposition
[2024-06-07 07:34:01] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16032303922161788351.txt' '-o' '/tmp/graph16032303922161788351.bin' '-w' '/tmp/graph16032303922161788351.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16032303922161788351.bin' '-l' '-1' '-v' '-w' '/tmp/graph16032303922161788351.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:34:01] [INFO ] Decomposing Gal with order
[2024-06-07 07:34:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:34:01] [INFO ] Removed a total of 234 redundant transitions.
[2024-06-07 07:34:01] [INFO ] Flatten gal took : 34 ms
[2024-06-07 07:34:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-07 07:34:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality1297180745660665027.gal : 3 ms
[2024-06-07 07:34:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality15050500814924744027.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/CTLCardinality1297180745660665027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15050500814924744027.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 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 07:34:31] [INFO ] Invariant cache hit.
[2024-06-07 07:34:31] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-07 07:34:31] [INFO ] Invariant cache hit.
[2024-06-07 07:34:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:34:31] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-06-07 07:34:31] [INFO ] Invariant cache hit.
[2024-06-07 07:34:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 1/263 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 120 constraints, problems are : Problem set: 0 solved, 161 unsolved in 3354 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 161/280 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:34:36] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:34:36] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:34:36] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:34:36] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:34:36] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:34:37] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:34:37] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:34:37] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:34:37] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:34:37] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:34:37] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:34:37] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:34:37] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:34:37] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:34:37] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:34:37] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:34:38] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:34:38] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:34:38] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:34:38] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:34:39] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:34:39] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:34:39] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:34:39] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:34:39] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:34:39] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:34:39] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:34:40] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:34:40] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:34:40] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:34:40] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-07 07:34:41] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:34:41] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:34:41] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:34:41] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:34:41] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:34:41] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-07 07:34:41] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:34:41] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 19/319 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:34:42] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:34:43] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:34:43] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:34:43] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:34:44] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:34:44] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:34:44] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:34:44] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:34:44] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:34:44] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:34:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:34:45] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:34:45] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:34:45] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 14/333 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:34:47] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:34:47] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:34:47] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:34:47] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:34:48] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-07 07:34:48] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:34:48] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:34:49] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 2 ms to minimize.
[2024-06-07 07:34:49] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 9/342 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:34:50] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:34:50] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:34:51] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:34:51] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:34:51] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:34:51] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:34:51] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:34:52] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:34:52] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-07 07:34:52] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:34:52] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:34:52] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:34:53] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:34:53] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-07 07:34:53] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:34:53] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:34:53] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 17/359 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:34:55] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:34:55] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:34:56] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:34:56] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:34:56] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:34:57] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:34:57] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:34:57] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:34:57] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 9/368 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:34:59] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:34:59] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:35:01] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:35:01] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:35:01] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:35:01] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:35:02] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:35:02] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-07 07:35:02] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:35:02] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:35:02] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 11/379 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:35:04] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:35:05] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/263 variables, and 381 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 101/101 constraints]
After SMT, in 33577ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 33579ms
Finished structural reductions in LTL mode , in 1 iterations and 33762 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:35:05] [INFO ] Flatten gal took : 9 ms
[2024-06-07 07:35:05] [INFO ] Flatten gal took : 8 ms
[2024-06-07 07:35:05] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-07 07:35:05] [INFO ] Flatten gal took : 8 ms
[2024-06-07 07:35:05] [INFO ] Flatten gal took : 8 ms
[2024-06-07 07:35:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality1457650401043836038.gal : 2 ms
[2024-06-07 07:35:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality2974377919061968348.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/CTLCardinality1457650401043836038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2974377919061968348.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:35:35] [INFO ] Flatten gal took : 7 ms
[2024-06-07 07:35:35] [INFO ] Applying decomposition
[2024-06-07 07:35:35] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5997709026169820127.txt' '-o' '/tmp/graph5997709026169820127.bin' '-w' '/tmp/graph5997709026169820127.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5997709026169820127.bin' '-l' '-1' '-v' '-w' '/tmp/graph5997709026169820127.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:35:35] [INFO ] Decomposing Gal with order
[2024-06-07 07:35:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:35:35] [INFO ] Removed a total of 136 redundant transitions.
[2024-06-07 07:35:35] [INFO ] Flatten gal took : 44 ms
[2024-06-07 07:35:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 280 labels/synchronizations in 5 ms.
[2024-06-07 07:35:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality2603554198557833505.gal : 2 ms
[2024-06-07 07:35:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality5484009957344303923.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/CTLCardinality2603554198557833505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5484009957344303923.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.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 07:36:05] [INFO ] Invariant cache hit.
[2024-06-07 07:36:05] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-07 07:36:05] [INFO ] Invariant cache hit.
[2024-06-07 07:36:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:36:05] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-06-07 07:36:05] [INFO ] Invariant cache hit.
[2024-06-07 07:36:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 1/263 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 120 constraints, problems are : Problem set: 0 solved, 161 unsolved in 3339 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 161/280 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:36:10] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:36:10] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:36:10] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:36:10] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:36:11] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:36:11] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:36:11] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:36:11] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:36:11] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:36:11] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-07 07:36:11] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:36:11] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:36:11] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:36:11] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:36:11] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:36:11] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:36:12] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:36:12] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:36:12] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:36:12] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:36:13] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:36:13] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:36:13] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:36:13] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:36:13] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:36:13] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:36:13] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:36:14] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:36:14] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:36:14] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:36:14] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:36:15] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:36:15] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:36:15] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:36:15] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:36:15] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:36:15] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:36:15] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:36:15] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 19/319 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:36:16] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-07 07:36:17] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:36:17] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:36:17] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:36:18] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:36:18] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:36:18] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:36:18] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:36:18] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:36:18] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:36:19] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:36:19] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:36:19] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:36:19] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 14/333 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:36:20] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:36:21] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:36:21] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:36:21] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:36:21] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:36:21] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:36:22] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:36:23] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:36:23] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 9/342 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:36:24] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:36:24] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:36:24] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:36:24] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:36:25] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:36:25] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:36:25] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:36:25] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:36:26] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:36:26] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:36:26] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:36:26] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:36:26] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:36:26] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:36:26] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:36:27] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:36:27] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 17/359 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:36:29] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:36:29] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:36:30] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:36:30] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:36:30] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:36:30] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:36:31] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:36:31] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-07 07:36:31] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 9/368 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:36:33] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:36:33] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:36:34] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-07 07:36:35] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:36:35] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:36:35] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:36:35] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:36:35] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:36:36] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:36:36] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:36:36] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 11/379 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:36:39] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/263 variables, and 384 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 104/104 constraints]
After SMT, in 33561ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 33562ms
Finished structural reductions in LTL mode , in 1 iterations and 33729 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:36:39] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:36:39] [INFO ] Flatten gal took : 7 ms
[2024-06-07 07:36:39] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-07 07:36:39] [INFO ] Flatten gal took : 7 ms
[2024-06-07 07:36:39] [INFO ] Flatten gal took : 6 ms
[2024-06-07 07:36:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality9664806385934594035.gal : 1 ms
[2024-06-07 07:36:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality241392475045213652.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/CTLCardinality9664806385934594035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality241392475045213652.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-07 07:37:09] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:37:09] [INFO ] Applying decomposition
[2024-06-07 07:37:09] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6384788983848534468.txt' '-o' '/tmp/graph6384788983848534468.bin' '-w' '/tmp/graph6384788983848534468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6384788983848534468.bin' '-l' '-1' '-v' '-w' '/tmp/graph6384788983848534468.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:37:09] [INFO ] Decomposing Gal with order
[2024-06-07 07:37:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:37:09] [INFO ] Removed a total of 126 redundant transitions.
[2024-06-07 07:37:09] [INFO ] Flatten gal took : 46 ms
[2024-06-07 07:37:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 2 ms.
[2024-06-07 07:37:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality1170478448276307676.gal : 2 ms
[2024-06-07 07:37:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality1471583768579759754.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/CTLCardinality1170478448276307676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1471583768579759754.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.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 07:37:39] [INFO ] Invariant cache hit.
[2024-06-07 07:37:39] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-07 07:37:39] [INFO ] Invariant cache hit.
[2024-06-07 07:37:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:37:39] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-06-07 07:37:39] [INFO ] Invariant cache hit.
[2024-06-07 07:37:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 1/263 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 120 constraints, problems are : Problem set: 0 solved, 161 unsolved in 3384 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 161/280 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:37:44] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:37:44] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:37:44] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:37:45] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:37:45] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:37:45] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:37:45] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:37:45] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:37:45] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:37:45] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:37:45] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:37:45] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-07 07:37:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:37:45] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:37:45] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:37:46] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-07 07:37:46] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:37:46] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:37:46] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:37:46] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:37:47] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:37:47] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:37:47] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-07 07:37:47] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:37:47] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:37:47] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:37:48] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:37:48] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:37:48] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:37:48] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:37:49] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-06-07 07:37:49] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:37:49] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:37:49] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:37:49] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:37:49] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:37:49] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-07 07:37:49] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:37:49] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 19/319 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:37:51] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:37:51] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:37:51] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:37:51] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:37:52] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:37:52] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:37:52] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:37:52] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:37:52] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:37:52] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:37:53] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:37:53] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:37:53] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:37:53] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 14/333 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:37:55] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:37:55] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:37:55] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:37:55] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
[2024-06-07 07:37:56] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:37:56] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:37:56] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:37:57] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:37:57] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 9/342 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:37:58] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:37:59] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:37:59] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:37:59] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:37:59] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:37:59] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:38:00] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:38:00] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:38:00] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 17/359 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:38:03] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:38:03] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:38:04] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:38:04] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:38:04] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:38:05] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:38:05] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:38:05] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:38:06] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 9/368 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:38:08] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:38:08] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:38:09] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:38:09] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:38:09] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:38:11] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 11/379 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:38:13] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/263 variables, and 380 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 100/100 constraints]
After SMT, in 33643ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 33644ms
Finished structural reductions in LTL mode , in 1 iterations and 33822 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:38:13] [INFO ] Flatten gal took : 8 ms
[2024-06-07 07:38:13] [INFO ] Flatten gal took : 9 ms
[2024-06-07 07:38:13] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-07 07:38:13] [INFO ] Flatten gal took : 6 ms
[2024-06-07 07:38:13] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:38:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality6634628615941144999.gal : 1 ms
[2024-06-07 07:38:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality18054457737718810099.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/CTLCardinality6634628615941144999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18054457737718810099.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:38:43] [INFO ] Flatten gal took : 9 ms
[2024-06-07 07:38:43] [INFO ] Applying decomposition
[2024-06-07 07:38:43] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4333313912293906759.txt' '-o' '/tmp/graph4333313912293906759.bin' '-w' '/tmp/graph4333313912293906759.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4333313912293906759.bin' '-l' '-1' '-v' '-w' '/tmp/graph4333313912293906759.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:38:43] [INFO ] Decomposing Gal with order
[2024-06-07 07:38:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:38:43] [INFO ] Removed a total of 234 redundant transitions.
[2024-06-07 07:38:43] [INFO ] Flatten gal took : 15 ms
[2024-06-07 07:38:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-07 07:38:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality14939529284257380198.gal : 3 ms
[2024-06-07 07:38:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality107803813430378297.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/CTLCardinality14939529284257380198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality107803813430378297.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 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 07:39:13] [INFO ] Invariant cache hit.
[2024-06-07 07:39:13] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-07 07:39:13] [INFO ] Invariant cache hit.
[2024-06-07 07:39:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:39:13] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-06-07 07:39:13] [INFO ] Invariant cache hit.
[2024-06-07 07:39:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 1/263 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 120 constraints, problems are : Problem set: 0 solved, 161 unsolved in 3415 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 161/280 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:39:18] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:39:19] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:39:20] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:39:20] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-07 07:39:20] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:39:20] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:39:20] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:39:20] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:39:21] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:39:21] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:39:21] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:39:21] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:39:21] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:39:21] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-06-07 07:39:22] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:39:22] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 19/319 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:39:25] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:39:25] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:39:25] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:39:26] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:39:26] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:39:26] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:39:26] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:39:26] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:39:26] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:39:27] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:39:27] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:39:27] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:39:27] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:39:27] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 14/333 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:39:29] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:39:29] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:39:29] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:39:29] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-07 07:39:30] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:39:30] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:39:30] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:39:31] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:39:31] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 9/342 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:39:33] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:39:33] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:39:33] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-07 07:39:33] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:39:33] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:39:33] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-07 07:39:34] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:39:34] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:39:34] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 17/359 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:39:37] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:39:37] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:39:39] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:39:39] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:39:39] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:39:39] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-07 07:39:40] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 9/368 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:39:42] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:39:42] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:39:43] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:39:43] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:39:43] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:39:44] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:39:44] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:39:44] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:39:44] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:39:44] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:39:45] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 11/379 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:39:47] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/263 variables, and 380 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 100/100 constraints]
After SMT, in 33653ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 33655ms
Finished structural reductions in LTL mode , in 1 iterations and 33818 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:39:47] [INFO ] Flatten gal took : 8 ms
[2024-06-07 07:39:47] [INFO ] Flatten gal took : 6 ms
[2024-06-07 07:39:47] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-07 07:39:47] [INFO ] Flatten gal took : 6 ms
[2024-06-07 07:39:47] [INFO ] Flatten gal took : 9 ms
[2024-06-07 07:39:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality10001298896269893556.gal : 5 ms
[2024-06-07 07:39:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality4625402895623206565.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/CTLCardinality10001298896269893556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4625402895623206565.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:40:17] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:40:17] [INFO ] Applying decomposition
[2024-06-07 07:40:17] [INFO ] Flatten gal took : 5 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/graph5815487342782348900.txt' '-o' '/tmp/graph5815487342782348900.bin' '-w' '/tmp/graph5815487342782348900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5815487342782348900.bin' '-l' '-1' '-v' '-w' '/tmp/graph5815487342782348900.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:40:17] [INFO ] Decomposing Gal with order
[2024-06-07 07:40:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:40:17] [INFO ] Removed a total of 244 redundant transitions.
[2024-06-07 07:40:17] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:40:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 4 ms.
[2024-06-07 07:40:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality9238179969662210422.gal : 2 ms
[2024-06-07 07:40:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality3906602359960380585.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/CTLCardinality9238179969662210422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3906602359960380585.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.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 11 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 07:40:47] [INFO ] Invariant cache hit.
[2024-06-07 07:40:47] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-07 07:40:47] [INFO ] Invariant cache hit.
[2024-06-07 07:40:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:40:47] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-06-07 07:40:47] [INFO ] Redundant transitions in 4 ms returned []
Running 161 sub problems to find dead transitions.
[2024-06-07 07:40:47] [INFO ] Invariant cache hit.
[2024-06-07 07:40:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 1/263 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 120 constraints, problems are : Problem set: 0 solved, 161 unsolved in 3427 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 161/280 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:40:53] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:40:53] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:40:53] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:40:53] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:40:53] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:40:53] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:40:53] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:40:53] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:40:53] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:40:53] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:40:53] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-07 07:40:53] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-07 07:40:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:40:54] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:40:54] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:40:54] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-07 07:40:54] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:40:54] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:40:54] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:40:54] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:40:55] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:40:55] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:40:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:40:55] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:40:56] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:40:56] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:40:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:40:57] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-07 07:40:57] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:40:57] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:40:57] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:40:57] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:40:57] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:40:57] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:40:57] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:40:57] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:40:57] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-07 07:40:58] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:40:58] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 19/319 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:40:59] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:40:59] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:40:59] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:41:00] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:41:00] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:41:00] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:41:01] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:41:01] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-07 07:41:01] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:41:01] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:41:01] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:41:01] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:41:01] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:41:02] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 14/333 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:41:03] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:41:03] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:41:03] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:41:03] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-07 07:41:04] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:41:04] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:41:05] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:41:05] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:41:05] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 9/342 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:41:07] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:41:07] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:41:07] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:41:07] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:41:08] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:41:08] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:41:08] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:41:08] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:41:09] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:41:09] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:41:09] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:41:09] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:41:09] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:41:09] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:41:09] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:41:09] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:41:10] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 17/359 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:41:11] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:41:12] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:41:13] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:41:13] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:41:13] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:41:13] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:41:14] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:41:14] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:41:14] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 9/368 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:41:16] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:41:16] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:41:18] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:41:18] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:41:18] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:41:18] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:41:19] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:41:19] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:41:19] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:41:19] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:41:19] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 11/379 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/263 variables, and 379 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 99/99 constraints]
After SMT, in 33671ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 33672ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 33851 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:41:21] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:41:21] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:41:21] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-07 07:41:21] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:41:21] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:41:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality7862176208262155466.gal : 1 ms
[2024-06-07 07:41:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality14916795938003148203.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/CTLCardinality7862176208262155466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14916795938003148203.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:41:51] [INFO ] Flatten gal took : 6 ms
[2024-06-07 07:41:51] [INFO ] Applying decomposition
[2024-06-07 07:41:51] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9030669148572464631.txt' '-o' '/tmp/graph9030669148572464631.bin' '-w' '/tmp/graph9030669148572464631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9030669148572464631.bin' '-l' '-1' '-v' '-w' '/tmp/graph9030669148572464631.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:41:51] [INFO ] Decomposing Gal with order
[2024-06-07 07:41:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:41:51] [INFO ] Removed a total of 234 redundant transitions.
[2024-06-07 07:41:51] [INFO ] Flatten gal took : 12 ms
[2024-06-07 07:41:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-07 07:41:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality5745832077552818064.gal : 2 ms
[2024-06-07 07:41:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality11199089878642627359.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/CTLCardinality5745832077552818064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11199089878642627359.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 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 07:42:21] [INFO ] Invariant cache hit.
[2024-06-07 07:42:21] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-07 07:42:21] [INFO ] Invariant cache hit.
[2024-06-07 07:42:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:42:21] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-06-07 07:42:21] [INFO ] Invariant cache hit.
[2024-06-07 07:42:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 1/263 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 120 constraints, problems are : Problem set: 0 solved, 161 unsolved in 3496 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 161/280 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:42:28] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-07 07:42:28] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:42:28] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:42:28] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-07 07:42:28] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:42:28] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:42:28] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:42:28] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:42:29] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:42:29] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:42:30] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-07 07:42:30] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:42:30] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:42:30] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:42:30] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:42:31] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:42:31] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:42:31] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:42:31] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:42:31] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:42:31] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:42:31] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:42:31] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:42:31] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:42:32] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:42:32] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:42:32] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 19/319 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:42:33] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:42:33] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:42:33] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:42:34] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:42:34] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:42:35] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:42:35] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:42:35] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:42:35] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:42:35] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:42:35] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:42:35] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:42:35] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:42:36] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 14/333 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:42:37] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:42:37] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:42:37] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:42:38] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:42:38] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:42:38] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:42:39] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:42:39] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:42:40] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 9/342 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:42:41] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:42:41] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:42:41] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:42:41] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:42:42] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:42:42] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:42:42] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:42:42] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-06-07 07:42:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:42:43] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:42:43] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-06-07 07:42:43] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:42:43] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:42:43] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-07 07:42:43] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:42:43] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:42:44] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 17/359 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:42:45] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:42:46] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:42:47] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:42:47] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:42:47] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:42:47] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:42:47] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:42:47] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-07 07:42:48] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 9/368 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:42:50] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:42:50] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:42:51] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:42:52] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:42:52] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:42:52] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:42:52] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:42:52] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:42:53] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:42:53] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:42:53] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 11/379 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:42:55] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/263 variables, and 380 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 100/100 constraints]
After SMT, in 33735ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 33737ms
Finished structural reductions in LTL mode , in 1 iterations and 33921 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:42:55] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:42:55] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:42:55] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-07 07:42:55] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:42:55] [INFO ] Flatten gal took : 4 ms
[2024-06-07 07:42:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality7373571733938914527.gal : 2 ms
[2024-06-07 07:42:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality17809901576197166218.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/CTLCardinality7373571733938914527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17809901576197166218.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:43:25] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:43:25] [INFO ] Applying decomposition
[2024-06-07 07:43:25] [INFO ] Flatten gal took : 5 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/graph3777918664832542176.txt' '-o' '/tmp/graph3777918664832542176.bin' '-w' '/tmp/graph3777918664832542176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3777918664832542176.bin' '-l' '-1' '-v' '-w' '/tmp/graph3777918664832542176.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:43:25] [INFO ] Decomposing Gal with order
[2024-06-07 07:43:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:43:25] [INFO ] Removed a total of 274 redundant transitions.
[2024-06-07 07:43:25] [INFO ] Flatten gal took : 20 ms
[2024-06-07 07:43:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 4 ms.
[2024-06-07 07:43:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality12014954707537120571.gal : 15 ms
[2024-06-07 07:43:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality1790470231255518372.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/CTLCardinality12014954707537120571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1790470231255518372.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.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 07:43:55] [INFO ] Invariant cache hit.
[2024-06-07 07:43:55] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-07 07:43:55] [INFO ] Invariant cache hit.
[2024-06-07 07:43:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:43:55] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-06-07 07:43:55] [INFO ] Invariant cache hit.
[2024-06-07 07:43:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 1/263 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 120 constraints, problems are : Problem set: 0 solved, 161 unsolved in 3356 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 161/280 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:44:01] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:44:01] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:44:01] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:44:01] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:44:01] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:44:01] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:44:01] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:44:01] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:44:01] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:44:01] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:44:01] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:44:01] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:44:02] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-07 07:44:02] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:44:02] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:44:02] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:44:02] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:44:02] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:44:02] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:44:02] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:44:03] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:44:03] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:44:04] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-07 07:44:04] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:44:04] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:44:04] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:44:04] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:44:06] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:44:06] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:44:06] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 19/319 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:44:07] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-07 07:44:07] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:44:07] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:44:08] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:44:08] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:44:09] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:44:09] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-07 07:44:09] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-07 07:44:09] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:44:09] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:44:09] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:44:09] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:44:09] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:44:10] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 14/333 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:44:11] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:44:11] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:44:11] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:44:11] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:44:12] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:44:12] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:44:13] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:44:13] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:44:13] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 9/342 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:44:15] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:44:15] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:44:15] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:44:15] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:44:16] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:44:16] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:44:16] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:44:17] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:44:17] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:44:17] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:44:17] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:44:17] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:44:17] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:44:18] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-07 07:44:18] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:44:18] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:44:18] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 17/359 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:44:20] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:44:20] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:44:21] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:44:21] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:44:21] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:44:22] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2024-06-07 07:44:22] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:44:22] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:44:22] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 9/368 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:44:24] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:44:25] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:44:26] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:44:26] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:44:26] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:44:27] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:44:27] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:44:27] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-07 07:44:27] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:44:27] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:44:27] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 11/379 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/263 variables, and 379 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 99/99 constraints]
After SMT, in 33612ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 33614ms
Finished structural reductions in LTL mode , in 1 iterations and 33789 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:44:29] [INFO ] Flatten gal took : 6 ms
[2024-06-07 07:44:29] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:44:29] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-07 07:44:29] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:44:29] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:44:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality17957228793507667722.gal : 1 ms
[2024-06-07 07:44:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality10598843137970264761.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/CTLCardinality17957228793507667722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10598843137970264761.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:44:59] [INFO ] Flatten gal took : 9 ms
[2024-06-07 07:44:59] [INFO ] Applying decomposition
[2024-06-07 07:44:59] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4684952738947316024.txt' '-o' '/tmp/graph4684952738947316024.bin' '-w' '/tmp/graph4684952738947316024.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4684952738947316024.bin' '-l' '-1' '-v' '-w' '/tmp/graph4684952738947316024.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:44:59] [INFO ] Decomposing Gal with order
[2024-06-07 07:44:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:44:59] [INFO ] Removed a total of 234 redundant transitions.
[2024-06-07 07:44:59] [INFO ] Flatten gal took : 13 ms
[2024-06-07 07:44:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-07 07:44:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality15705817000158861431.gal : 2 ms
[2024-06-07 07:44:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality15274228826560606511.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/CTLCardinality15705817000158861431.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15274228826560606511.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 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 20 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 07:45:29] [INFO ] Invariant cache hit.
[2024-06-07 07:45:29] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-07 07:45:29] [INFO ] Invariant cache hit.
[2024-06-07 07:45:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:45:29] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-06-07 07:45:29] [INFO ] Redundant transitions in 4 ms returned []
Running 161 sub problems to find dead transitions.
[2024-06-07 07:45:29] [INFO ] Invariant cache hit.
[2024-06-07 07:45:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 1/263 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 120 constraints, problems are : Problem set: 0 solved, 161 unsolved in 3413 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/100 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/262 variables, 100/119 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 161/280 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:45:35] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:45:35] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:45:35] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:45:35] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:45:35] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:45:35] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:45:35] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:45:35] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:45:35] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:45:35] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:45:35] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:45:35] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:45:36] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:45:36] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:45:36] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:45:36] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-07 07:45:36] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:45:36] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:45:36] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:45:36] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:45:39] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:45:39] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:45:39] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:45:39] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-07 07:45:39] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:45:39] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:45:39] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:45:40] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:45:40] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:45:40] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:45:40] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:45:40] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 19/319 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:45:41] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:45:41] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:45:41] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:45:42] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:45:42] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:45:43] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:45:43] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:45:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:45:43] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:45:43] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:45:43] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:45:43] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:45:43] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:45:44] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 14/333 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:45:47] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:45:48] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:45:48] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 9/342 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:45:49] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:45:49] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:45:49] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:45:49] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:45:50] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:45:50] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:45:50] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:45:51] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:45:51] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:45:51] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:45:51] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:45:51] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:45:52] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:45:52] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-07 07:45:52] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:45:52] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:45:52] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 17/359 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:45:54] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:45:54] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:45:55] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:45:55] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:45:55] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:45:56] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:45:56] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:45:56] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-07 07:45:56] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 9/368 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-07 07:45:58] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:45:58] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:46:00] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:46:00] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:46:00] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:46:01] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:46:01] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:46:01] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:46:01] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:46:01] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:46:01] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 11/379 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/263 variables, and 379 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 100/100 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 99/99 constraints]
After SMT, in 33655ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 33656ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 33848 ms. Remains : 100/100 places, 163/163 transitions.
[2024-06-07 07:46:03] [INFO ] Flatten gal took : 4 ms
[2024-06-07 07:46:03] [INFO ] Flatten gal took : 4 ms
[2024-06-07 07:46:03] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-07 07:46:03] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:46:03] [INFO ] Flatten gal took : 4 ms
[2024-06-07 07:46:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality11799490722361912365.gal : 1 ms
[2024-06-07 07:46:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality15371716380069994826.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/CTLCardinality11799490722361912365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15371716380069994826.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:46:33] [INFO ] Flatten gal took : 9 ms
[2024-06-07 07:46:33] [INFO ] Applying decomposition
[2024-06-07 07:46:33] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18141525892904446069.txt' '-o' '/tmp/graph18141525892904446069.bin' '-w' '/tmp/graph18141525892904446069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18141525892904446069.bin' '-l' '-1' '-v' '-w' '/tmp/graph18141525892904446069.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:46:33] [INFO ] Decomposing Gal with order
[2024-06-07 07:46:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:46:33] [INFO ] Removed a total of 242 redundant transitions.
[2024-06-07 07:46:33] [INFO ] Flatten gal took : 11 ms
[2024-06-07 07:46:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-07 07:46:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality9257413810728554726.gal : 1 ms
[2024-06-07 07:46:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality16757462045794601267.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/CTLCardinality9257413810728554726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16757462045794601267.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:47:03] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:47:03] [INFO ] Flatten gal took : 5 ms
[2024-06-07 07:47:03] [INFO ] Applying decomposition
[2024-06-07 07:47:03] [INFO ] Flatten gal took : 5 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/graph11211874564344481428.txt' '-o' '/tmp/graph11211874564344481428.bin' '-w' '/tmp/graph11211874564344481428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11211874564344481428.bin' '-l' '-1' '-v' '-w' '/tmp/graph11211874564344481428.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:47:03] [INFO ] Decomposing Gal with order
[2024-06-07 07:47:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:47:03] [INFO ] Removed a total of 204 redundant transitions.
[2024-06-07 07:47:03] [INFO ] Flatten gal took : 14 ms
[2024-06-07 07:47:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 3 ms.
[2024-06-07 07:47:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality1418405125160873865.gal : 1 ms
[2024-06-07 07:47:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality8674438954635272770.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/CTLCardinality1418405125160873865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8674438954635272770.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.14573e+06,204.536,3780396,2,856093,5,1.25995e+07,6,0,630,1.09436e+07,0
Converting to forward existential form...Done !
original formula: EF(AG((((((gu0.pred_on_table_0+gu0.pred_on_table_1)+(gu0.pred_on_table_2+gu0.pred_on_table_3))+((gu0.pred_on_table_4+gu0.pred_on_table_5)...410
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((((gu0.pred_on_table_0+gu0.pred_on_table_1)+(gu0.pred_on_table_2+gu0.pred_on_...474
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
ITS-tools command line returned an error code 137
[2024-06-07 08:00:00] [INFO ] Applying decomposition
[2024-06-07 08:00:00] [INFO ] Flatten gal took : 6 ms
[2024-06-07 08:00:00] [INFO ] Decomposing Gal with order
[2024-06-07 08:00:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:00:00] [INFO ] Removed a total of 430 redundant transitions.
[2024-06-07 08:00:00] [INFO ] Flatten gal took : 37 ms
[2024-06-07 08:00:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-07 08:00:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality1364167612421809056.gal : 9 ms
[2024-06-07 08:00:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13516686386346373618.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/CTLCardinality1364167612421809056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13516686386346373618.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.14573e+06,122.002,2370640,2,320418,5,4.86051e+06,6,0,566,6.04729e+06,0
Converting to forward existential form...Done !
original formula: EF(AG((((((gmissing.pred_on_table_0+gmissing.pred_on_table_1)+(gmissing.pred_on_table_2+gmissing.pred_on_table_3))+((gmissing.pred_on_tab...455
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((((gmissing.pred_on_table_0+gmissing.pred_on_table_1)+(gmissing.pred_on_table...519
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,488.728,8092240,1,0,6,3.03221e+07,10,0,2036,1.4968e+07,2
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(AG(EX(TRUE)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(TRUE)))))] != FALSE
(forward)formula 1,1,491.223,8092240,1,0,6,3.03221e+07,10,0,2064,1.4968e+07,3
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !(A(EG(AX(FALSE)) U !(EF(EG((gmissing.pred_arm_empty_0<=((((gu9.pred_holding_0+gu7.pred_holding_1)+(gu4.pred_holding_2+gu8.pred_holding_3...266
=> equivalent forward existential formula: ([FwdG(FwdU((FwdU(Init,!(!(E(TRUE U EG((gmissing.pred_arm_empty_0<=((((gu9.pred_holding_0+gu7.pred_holding_1)+(g...822
Hit Full ! (commute/partial/dont) 1/0/162
(forward)formula 2,1,792.866,9097112,1,0,8,3.03221e+07,18,0,1976,1.4968e+07,8
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EX(EF((((((gmissing.pred_on_table_0+gmissing.pred_on_table_1)+(gmissing.pred_on_table_2+gmissing.pred_on_table_3))+((gmissing.pred_on_tab...456
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (((((gmissing.pred_on_table_0+gmissing.pred_on_table_1)+(gmissing.pred_on_table_2+gmissi...508
(forward)formula 3,1,825.564,9097112,1,0,10,3.03221e+07,19,1,2364,1.4968e+07,12
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AX(EF(AX(FALSE)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX(!(FALSE))))))] = FALSE
(forward)formula 4,0,856.936,9097112,1,0,10,3.03221e+07,22,2,2936,1.4968e+07,13
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (AG(EF((((gu7.pred_on_73<=gu1.pred_on_71) * AX((gu4.pred_holding_2>=1))) + (gu13.pred_clear_2>=1)))) * A((AX(FALSE) + (gu18.pred_clear_7<...224
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (((gu7.pred_on_73<=gu1.pred_on_71) * !(EX(!((gu4.pred_holding_2>=1))))) + (gu13....471
(forward)formula 5,1,1017.98,9109400,1,0,18,3.17687e+07,38,6,3005,1.98904e+07,24
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AF(AG((gu2.pred_on_61<=0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((gu2.pred_on_61<=0))))))] = FALSE
(forward)formula 6,0,1217.52,10464240,1,0,19,3.76306e+07,16,6,2530,2.29098e+07,5
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX((AX(EF(AG((gu8.pred_holding_3>gu3.pred_on_5)))) * (EX((gu4.pred_on_29>gu12.pred_clear_1)) + (EF((gu6.pred_on_51<=gmissing.pred_on_tabl...232
=> equivalent forward existential formula: ([(EY((EY(Init) * !(EX(!(E(TRUE U !(E(TRUE U !((gu8.pred_holding_3>gu3.pred_on_5)))))))))) * (gu4.pred_on_29>gu1...620
(forward)formula 7,0,1227.57,10464240,1,0,19,3.76306e+07,36,6,2586,2.29098e+07,16
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (A((gu3.pred_on_23>=1) U EX(((gu2.pred_on_61<=0)||(!((((gu3.pred_on_23<=0)||(gu8.pred_on_21<=0))&&(gu6.pred_on_78<=1))&&(gu7.pred_on_1>=1...177
=> equivalent forward existential formula: (([((FwdU(Init,!(EX(((gu2.pred_on_61<=0)||(!((((gu3.pred_on_23<=0)||(gu8.pred_on_21<=0))&&(gu6.pred_on_78<=1))&&...528
(forward)formula 8,1,1231.46,10464240,1,0,24,3.76306e+07,46,7,2596,2.29098e+07,22
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(((gu9.pred_on_9>gu2.pred_on_25) + AG((gu8.pred_on_48>gu1.pred_on_26))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (gu9.pred_on_9>gu2.pred_on_25))] != FALSE + [(FwdU(Init,TRUE) * !(E(TRUE U !((gu8.pred_on_4...187
(forward)formula 9,1,1231.94,10464240,1,0,26,3.76306e+07,47,8,2601,2.29098e+07,23
FORMULA BlocksWorld-PT-01-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2997417 ms.
BK_STOP 1717748439827
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BlocksWorld-PT-01"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BlocksWorld-PT-01, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r602-tall-171774424500161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-01.tgz
mv BlocksWorld-PT-01 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;