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.r400-tall-171690531800202.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 StigmergyCommit-PT-09a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531800202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 11 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 51M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716994548356

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 14:55:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 14:55:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:55:51] [INFO ] Load time of PNML (sax parser for PT used): 2092 ms
[2024-05-29 14:55:51] [INFO ] Transformed 364 places.
[2024-05-29 14:55:52] [INFO ] Transformed 50444 transitions.
[2024-05-29 14:55:52] [INFO ] Found NUPN structural information;
[2024-05-29 14:55:52] [INFO ] Parsed PT model containing 364 places and 50444 transitions and 999956 arcs in 2574 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
Support contains 12 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 2520/2520 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 78 place count 286 transition count 2434
Iterating global reduction 0 with 78 rules applied. Total rules applied 156 place count 286 transition count 2434
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 166 place count 286 transition count 2424
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 205 place count 247 transition count 2377
Iterating global reduction 1 with 39 rules applied. Total rules applied 244 place count 247 transition count 2377
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 254 place count 247 transition count 2367
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 264 place count 237 transition count 2357
Iterating global reduction 2 with 10 rules applied. Total rules applied 274 place count 237 transition count 2357
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 284 place count 227 transition count 2347
Iterating global reduction 2 with 10 rules applied. Total rules applied 294 place count 227 transition count 2347
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 304 place count 217 transition count 2337
Iterating global reduction 2 with 10 rules applied. Total rules applied 314 place count 217 transition count 2337
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 324 place count 207 transition count 2327
Iterating global reduction 2 with 10 rules applied. Total rules applied 334 place count 207 transition count 2327
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 344 place count 207 transition count 2317
Applied a total of 344 rules in 163 ms. Remains 207 /364 variables (removed 157) and now considering 2317/2520 (removed 203) transitions.
[2024-05-29 14:55:52] [INFO ] Flow matrix only has 2304 transitions (discarded 13 similar events)
// Phase 1: matrix 2304 rows 207 cols
[2024-05-29 14:55:52] [INFO ] Computed 2 invariants in 53 ms
[2024-05-29 14:55:53] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-29 14:55:53] [INFO ] Flow matrix only has 2304 transitions (discarded 13 similar events)
[2024-05-29 14:55:53] [INFO ] Invariant cache hit.
[2024-05-29 14:55:53] [INFO ] State equation strengthened by 2135 read => feed constraints.
[2024-05-29 14:55:54] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned [206]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2027 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 206/364 places, 2317/2520 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 179 transition count 2290
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 179 transition count 2290
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 64 place count 179 transition count 2280
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 74 place count 169 transition count 2270
Iterating global reduction 1 with 10 rules applied. Total rules applied 84 place count 169 transition count 2270
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 94 place count 159 transition count 2260
Iterating global reduction 1 with 10 rules applied. Total rules applied 104 place count 159 transition count 2260
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 114 place count 149 transition count 2250
Iterating global reduction 1 with 10 rules applied. Total rules applied 124 place count 149 transition count 2250
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 134 place count 139 transition count 2240
Iterating global reduction 1 with 10 rules applied. Total rules applied 144 place count 139 transition count 2240
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 153 place count 130 transition count 2231
Iterating global reduction 1 with 9 rules applied. Total rules applied 162 place count 130 transition count 2231
Applied a total of 162 rules in 70 ms. Remains 130 /206 variables (removed 76) and now considering 2231/2317 (removed 86) transitions.
[2024-05-29 14:55:54] [INFO ] Flow matrix only has 2218 transitions (discarded 13 similar events)
// Phase 1: matrix 2218 rows 130 cols
[2024-05-29 14:55:54] [INFO ] Computed 1 invariants in 15 ms
[2024-05-29 14:55:54] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 14:55:54] [INFO ] Flow matrix only has 2218 transitions (discarded 13 similar events)
[2024-05-29 14:55:54] [INFO ] Invariant cache hit.
[2024-05-29 14:55:56] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 14:55:56] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 1502 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 130/364 places, 2231/2520 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3779 ms. Remains : 130/364 places, 2231/2520 transitions.
Support contains 12 out of 130 places after structural reductions.
[2024-05-29 14:55:57] [INFO ] Flatten gal took : 333 ms
[2024-05-29 14:55:57] [INFO ] Flatten gal took : 219 ms
[2024-05-29 14:55:58] [INFO ] Input system was already deterministic with 2231 transitions.
Reduction of identical properties reduced properties to check from 19 to 5
RANDOM walk for 40000 steps (10 resets) in 5702 ms. (7 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 331 ms. (120 steps per ms) remains 1/1 properties
[2024-05-29 14:56:00] [INFO ] Flow matrix only has 2218 transitions (discarded 13 similar events)
[2024-05-29 14:56:00] [INFO ] Invariant cache hit.
[2024-05-29 14:56:00] [INFO ] State equation strengthened by 2055 read => feed constraints.
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 10/2348 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/130 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 429ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-29 14:56:00] [INFO ] Flatten gal took : 162 ms
[2024-05-29 14:56:01] [INFO ] Flatten gal took : 166 ms
[2024-05-29 14:56:01] [INFO ] Input system was already deterministic with 2231 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 2231/2231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 129 transition count 2197
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 96 transition count 2197
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 66 place count 96 transition count 2185
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 90 place count 84 transition count 2185
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 82 transition count 2181
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 82 transition count 2181
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 80 transition count 2177
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 80 transition count 2177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 80 transition count 2174
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 139 place count 61 transition count 2155
Ensure Unique test removed 1031 transitions
Reduce isomorphic transitions removed 1031 transitions.
Iterating post reduction 3 with 1031 rules applied. Total rules applied 1170 place count 61 transition count 1124
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1188 place count 52 transition count 1115
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1197 place count 52 transition count 1106
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 1207 place count 52 transition count 1096
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1227 place count 42 transition count 1086
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1228 place count 41 transition count 1085
Applied a total of 1228 rules in 1635 ms. Remains 41 /130 variables (removed 89) and now considering 1085/2231 (removed 1146) transitions.
[2024-05-29 14:56:03] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
// Phase 1: matrix 1074 rows 41 cols
[2024-05-29 14:56:03] [INFO ] Computed 1 invariants in 21 ms
[2024-05-29 14:56:03] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 14:56:03] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 14:56:03] [INFO ] Invariant cache hit.
[2024-05-29 14:56:03] [INFO ] State equation strengthened by 1033 read => feed constraints.
[2024-05-29 14:56:03] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-05-29 14:56:03] [INFO ] Redundant transitions in 102 ms returned []
Running 1075 sub problems to find dead transitions.
[2024-05-29 14:56:03] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 14:56:03] [INFO ] Invariant cache hit.
[2024-05-29 14:56:04] [INFO ] State equation strengthened by 1033 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 14:56:23] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 4 ms to minimize.
[2024-05-29 14:56:23] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-29 14:56:24] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 3 ms to minimize.
[2024-05-29 14:56:24] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 2 ms to minimize.
[2024-05-29 14:56:24] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2024-05-29 14:56:24] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2024-05-29 14:56:25] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2024-05-29 14:56:25] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:56:25] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-29 14:56:25] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2024-05-29 14:56:25] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-05-29 14:56:25] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-29 14:56:26] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:56:26] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 14:56:26] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-29 14:56:26] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2024-05-29 14:56:26] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:56:26] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-29 14:56:27] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 14:56:27] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 14:56:27] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:56:27] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 14:56:27] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 14:56:27] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 14:56:27] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:56:27] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:56:27] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 14:56:28] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:56:28] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:56:28] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:56:28] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 14:56:28] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-05-29 14:56:28] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-05-29 14:56:28] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2024-05-29 14:56:29] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 2 ms to minimize.
[2024-05-29 14:56:29] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2024-05-29 14:56:29] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-29 14:56:29] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:56:29] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 14:56:29] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 14:56:31] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-29 14:56:31] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 14:56:31] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 14:56:31] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-29 14:56:31] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 14:56:31] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 14:56:31] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:56:31] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-29 14:56:31] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 14:56:31] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:56:31] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-29 14:56:32] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:56:32] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:56:32] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2024-05-29 14:56:32] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2024-05-29 14:56:32] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-29 14:56:32] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 2 ms to minimize.
[2024-05-29 14:56:33] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:56:33] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-29 14:56:33] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 14:56:33] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 14:56:33] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 14:56:34] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-29 14:56:34] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-29 14:56:34] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-29 14:56:34] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2024-05-29 14:56:34] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2024-05-29 14:56:34] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:56:34] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 14:56:34] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:56:34] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-29 14:56:35] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-29 14:56:35] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-29 14:56:35] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-29 14:56:35] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-29 14:56:35] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 14:56:35] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 14:56:38] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:56:38] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:56:38] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-29 14:56:38] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 14:56:38] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 14:56:38] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-05-29 14:56:38] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 14:56:39] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-29 14:56:39] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:56:39] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:56:39] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:56:39] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:56:39] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 14:56:39] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:56:39] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 14:56:43] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:56:43] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 14:56:46] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:56:46] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:56:46] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 14:56:49] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 14:56:49] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 41/1115 variables, and 100 constraints, problems are : Problem set: 0 solved, 1075 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/41 constraints, ReadFeed: 0/1033 constraints, PredecessorRefiner: 1075/41 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1075 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 14:56:52] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:56:53] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:56:53] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 14:56:53] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-29 14:56:53] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 14:56:53] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:56:53] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 14:56:54] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-29 14:56:54] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-29 14:56:54] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-29 14:56:54] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:56:54] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:56:54] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 14:56:54] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-29 14:56:54] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 14:56:55] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:56:55] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 14:56:58] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-29 14:56:58] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-29 14:56:59] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 14:56:59] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 14:57:02] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 7 (OVERLAPS) 1073/1114 variables, 41/163 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1114 variables, 1032/1195 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1114 variables, 41/1236 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1114/1115 variables, and 1236 constraints, problems are : Problem set: 0 solved, 1075 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1032/1033 constraints, PredecessorRefiner: 1075/41 constraints, Known Traps: 121/121 constraints]
After SMT, in 77209ms problems are : Problem set: 0 solved, 1075 unsolved
Search for dead transitions found 0 dead transitions in 77225ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/130 places, 1085/2231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 79395 ms. Remains : 41/130 places, 1085/2231 transitions.
[2024-05-29 14:57:21] [INFO ] Flatten gal took : 65 ms
[2024-05-29 14:57:21] [INFO ] Flatten gal took : 68 ms
[2024-05-29 14:57:21] [INFO ] Input system was already deterministic with 1085 transitions.
[2024-05-29 14:57:21] [INFO ] Flatten gal took : 63 ms
[2024-05-29 14:57:21] [INFO ] Flatten gal took : 67 ms
[2024-05-29 14:57:21] [INFO ] Time to serialize gal into /tmp/CTLFireability8735494884426169730.gal : 54 ms
[2024-05-29 14:57:21] [INFO ] Time to serialize properties into /tmp/CTLFireability11473529798574929672.ctl : 7 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/CTLFireability8735494884426169730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11473529798574929672.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2067,0.80716,36088,2,1157,5,21348,6,0,1239,10770,0


Converting to forward existential form...Done !
original formula: AF((EF((A((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&((p318==1)&&(p354==1))) U ...542
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (!((E(!((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246...876
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t32...354
(forward)formula 0,1,6.8449,133324,1,0,1255,95585,2192,103,45836,58738,2296
FORMULA StigmergyCommit-PT-09a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 2231/2231 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 128 transition count 2227
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 128 transition count 2227
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 126 transition count 2223
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 126 transition count 2223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 124 transition count 2221
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 124 transition count 2221
Applied a total of 12 rules in 31 ms. Remains 124 /130 variables (removed 6) and now considering 2221/2231 (removed 10) transitions.
[2024-05-29 14:57:28] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
// Phase 1: matrix 2210 rows 124 cols
[2024-05-29 14:57:28] [INFO ] Computed 1 invariants in 12 ms
[2024-05-29 14:57:28] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 14:57:28] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 14:57:28] [INFO ] Invariant cache hit.
[2024-05-29 14:57:29] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 14:57:29] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 14:57:29] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 14:57:29] [INFO ] Invariant cache hit.
[2024-05-29 14:57:30] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 14:58:17] [INFO ] Deduced a trap composed of 13 places in 527 ms of which 1 ms to minimize.
[2024-05-29 14:58:17] [INFO ] Deduced a trap composed of 13 places in 550 ms of which 1 ms to minimize.
[2024-05-29 14:58:18] [INFO ] Deduced a trap composed of 13 places in 658 ms of which 1 ms to minimize.
[2024-05-29 14:58:19] [INFO ] Deduced a trap composed of 14 places in 666 ms of which 1 ms to minimize.
[2024-05-29 14:58:19] [INFO ] Deduced a trap composed of 15 places in 663 ms of which 1 ms to minimize.
[2024-05-29 14:58:20] [INFO ] Deduced a trap composed of 13 places in 651 ms of which 1 ms to minimize.
[2024-05-29 14:58:21] [INFO ] Deduced a trap composed of 13 places in 608 ms of which 1 ms to minimize.
[2024-05-29 14:58:21] [INFO ] Deduced a trap composed of 13 places in 651 ms of which 3 ms to minimize.
[2024-05-29 14:58:22] [INFO ] Deduced a trap composed of 13 places in 614 ms of which 1 ms to minimize.
[2024-05-29 14:58:23] [INFO ] Deduced a trap composed of 13 places in 670 ms of which 1 ms to minimize.
[2024-05-29 14:58:23] [INFO ] Deduced a trap composed of 13 places in 632 ms of which 1 ms to minimize.
[2024-05-29 14:58:24] [INFO ] Deduced a trap composed of 13 places in 638 ms of which 1 ms to minimize.
[2024-05-29 14:58:25] [INFO ] Deduced a trap composed of 15 places in 645 ms of which 1 ms to minimize.
[2024-05-29 14:58:25] [INFO ] Deduced a trap composed of 13 places in 663 ms of which 1 ms to minimize.
[2024-05-29 14:58:26] [INFO ] Deduced a trap composed of 13 places in 623 ms of which 1 ms to minimize.
[2024-05-29 14:58:26] [INFO ] Deduced a trap composed of 15 places in 562 ms of which 1 ms to minimize.
[2024-05-29 14:58:27] [INFO ] Deduced a trap composed of 20 places in 581 ms of which 1 ms to minimize.
[2024-05-29 14:58:27] [INFO ] Deduced a trap composed of 17 places in 519 ms of which 1 ms to minimize.
[2024-05-29 14:58:28] [INFO ] Deduced a trap composed of 15 places in 556 ms of which 1 ms to minimize.
[2024-05-29 14:58:29] [INFO ] Deduced a trap composed of 14 places in 474 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 14:58:29] [INFO ] Deduced a trap composed of 14 places in 422 ms of which 1 ms to minimize.
[2024-05-29 14:58:30] [INFO ] Deduced a trap composed of 13 places in 479 ms of which 1 ms to minimize.
[2024-05-29 14:58:30] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 1 ms to minimize.
[2024-05-29 14:58:31] [INFO ] Deduced a trap composed of 13 places in 427 ms of which 1 ms to minimize.
[2024-05-29 14:58:31] [INFO ] Deduced a trap composed of 13 places in 521 ms of which 1 ms to minimize.
[2024-05-29 14:58:32] [INFO ] Deduced a trap composed of 18 places in 541 ms of which 0 ms to minimize.
[2024-05-29 14:58:32] [INFO ] Deduced a trap composed of 14 places in 531 ms of which 1 ms to minimize.
[2024-05-29 14:58:33] [INFO ] Deduced a trap composed of 13 places in 471 ms of which 1 ms to minimize.
[2024-05-29 14:58:33] [INFO ] Deduced a trap composed of 13 places in 398 ms of which 1 ms to minimize.
[2024-05-29 14:58:34] [INFO ] Deduced a trap composed of 13 places in 544 ms of which 1 ms to minimize.
SMT process timed out in 64673ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 64709ms
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 2221/2231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65973 ms. Remains : 124/130 places, 2221/2231 transitions.
[2024-05-29 14:58:34] [INFO ] Flatten gal took : 119 ms
[2024-05-29 14:58:34] [INFO ] Flatten gal took : 129 ms
[2024-05-29 14:58:34] [INFO ] Input system was already deterministic with 2221 transitions.
[2024-05-29 14:58:35] [INFO ] Flatten gal took : 130 ms
[2024-05-29 14:58:35] [INFO ] Flatten gal took : 150 ms
[2024-05-29 14:58:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17293380667167664713.gal : 30 ms
[2024-05-29 14:58:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17743483076497832455.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/CTLFireability17293380667167664713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17743483076497832455.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 2231/2231 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 128 transition count 2227
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 128 transition count 2227
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 126 transition count 2223
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 126 transition count 2223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 124 transition count 2221
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 124 transition count 2221
Applied a total of 12 rules in 40 ms. Remains 124 /130 variables (removed 6) and now considering 2221/2231 (removed 10) transitions.
[2024-05-29 14:59:37] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 14:59:37] [INFO ] Invariant cache hit.
[2024-05-29 14:59:38] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 14:59:38] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 14:59:38] [INFO ] Invariant cache hit.
[2024-05-29 14:59:38] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 14:59:38] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 14:59:38] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 14:59:38] [INFO ] Invariant cache hit.
[2024-05-29 14:59:38] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:00:25] [INFO ] Deduced a trap composed of 13 places in 530 ms of which 12 ms to minimize.
[2024-05-29 15:00:25] [INFO ] Deduced a trap composed of 13 places in 500 ms of which 1 ms to minimize.
[2024-05-29 15:00:26] [INFO ] Deduced a trap composed of 13 places in 579 ms of which 1 ms to minimize.
[2024-05-29 15:00:27] [INFO ] Deduced a trap composed of 14 places in 673 ms of which 1 ms to minimize.
[2024-05-29 15:00:27] [INFO ] Deduced a trap composed of 15 places in 590 ms of which 7 ms to minimize.
[2024-05-29 15:00:28] [INFO ] Deduced a trap composed of 13 places in 666 ms of which 1 ms to minimize.
[2024-05-29 15:00:28] [INFO ] Deduced a trap composed of 13 places in 643 ms of which 1 ms to minimize.
[2024-05-29 15:00:29] [INFO ] Deduced a trap composed of 13 places in 656 ms of which 1 ms to minimize.
[2024-05-29 15:00:30] [INFO ] Deduced a trap composed of 13 places in 601 ms of which 1 ms to minimize.
[2024-05-29 15:00:30] [INFO ] Deduced a trap composed of 13 places in 658 ms of which 1 ms to minimize.
[2024-05-29 15:00:31] [INFO ] Deduced a trap composed of 13 places in 626 ms of which 2 ms to minimize.
[2024-05-29 15:00:32] [INFO ] Deduced a trap composed of 13 places in 611 ms of which 2 ms to minimize.
[2024-05-29 15:00:32] [INFO ] Deduced a trap composed of 15 places in 633 ms of which 1 ms to minimize.
[2024-05-29 15:00:33] [INFO ] Deduced a trap composed of 13 places in 661 ms of which 1 ms to minimize.
[2024-05-29 15:00:34] [INFO ] Deduced a trap composed of 13 places in 671 ms of which 1 ms to minimize.
[2024-05-29 15:00:34] [INFO ] Deduced a trap composed of 15 places in 549 ms of which 1 ms to minimize.
[2024-05-29 15:00:35] [INFO ] Deduced a trap composed of 20 places in 554 ms of which 1 ms to minimize.
[2024-05-29 15:00:35] [INFO ] Deduced a trap composed of 17 places in 554 ms of which 1 ms to minimize.
[2024-05-29 15:00:36] [INFO ] Deduced a trap composed of 15 places in 576 ms of which 1 ms to minimize.
[2024-05-29 15:00:36] [INFO ] Deduced a trap composed of 14 places in 434 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:00:37] [INFO ] Deduced a trap composed of 14 places in 436 ms of which 0 ms to minimize.
[2024-05-29 15:00:38] [INFO ] Deduced a trap composed of 13 places in 488 ms of which 1 ms to minimize.
[2024-05-29 15:00:38] [INFO ] Deduced a trap composed of 13 places in 429 ms of which 0 ms to minimize.
[2024-05-29 15:00:39] [INFO ] Deduced a trap composed of 13 places in 363 ms of which 1 ms to minimize.
[2024-05-29 15:00:39] [INFO ] Deduced a trap composed of 13 places in 536 ms of which 1 ms to minimize.
[2024-05-29 15:00:40] [INFO ] Deduced a trap composed of 18 places in 554 ms of which 1 ms to minimize.
[2024-05-29 15:00:40] [INFO ] Deduced a trap composed of 14 places in 498 ms of which 1 ms to minimize.
[2024-05-29 15:00:41] [INFO ] Deduced a trap composed of 13 places in 446 ms of which 0 ms to minimize.
[2024-05-29 15:00:41] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 0 ms to minimize.
[2024-05-29 15:00:42] [INFO ] Deduced a trap composed of 13 places in 493 ms of which 1 ms to minimize.
[2024-05-29 15:00:42] [INFO ] Deduced a trap composed of 13 places in 455 ms of which 1 ms to minimize.
SMT process timed out in 63621ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 63645ms
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 2221/2231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64597 ms. Remains : 124/130 places, 2221/2231 transitions.
[2024-05-29 15:00:42] [INFO ] Flatten gal took : 114 ms
[2024-05-29 15:00:42] [INFO ] Flatten gal took : 165 ms
[2024-05-29 15:00:43] [INFO ] Input system was already deterministic with 2221 transitions.
[2024-05-29 15:00:43] [INFO ] Flatten gal took : 117 ms
[2024-05-29 15:00:43] [INFO ] Flatten gal took : 119 ms
[2024-05-29 15:00:43] [INFO ] Time to serialize gal into /tmp/CTLFireability5617238629852660957.gal : 56 ms
[2024-05-29 15:00:43] [INFO ] Time to serialize properties into /tmp/CTLFireability999456078079770007.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/CTLFireability5617238629852660957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability999456078079770007.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 15:01:13] [INFO ] Flatten gal took : 120 ms
[2024-05-29 15:01:13] [INFO ] Applying decomposition
[2024-05-29 15:01:13] [INFO ] Flatten gal took : 120 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/graph15710102585719237820.txt' '-o' '/tmp/graph15710102585719237820.bin' '-w' '/tmp/graph15710102585719237820.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15710102585719237820.bin' '-l' '-1' '-v' '-w' '/tmp/graph15710102585719237820.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:01:14] [INFO ] Decomposing Gal with order
[2024-05-29 15:01:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:01:14] [INFO ] Removed a total of 20555 redundant transitions.
[2024-05-29 15:01:14] [INFO ] Flatten gal took : 292 ms
[2024-05-29 15:01:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 176 ms.
[2024-05-29 15:01:14] [INFO ] Time to serialize gal into /tmp/CTLFireability16052903765267132793.gal : 14 ms
[2024-05-29 15:01:14] [INFO ] Time to serialize properties into /tmp/CTLFireability4032955253231442487.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/CTLFireability16052903765267132793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4032955253231442487.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 : 130/130 places, 2231/2231 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 128 transition count 2227
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 128 transition count 2227
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 126 transition count 2223
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 126 transition count 2223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 124 transition count 2221
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 124 transition count 2221
Applied a total of 12 rules in 26 ms. Remains 124 /130 variables (removed 6) and now considering 2221/2231 (removed 10) transitions.
[2024-05-29 15:01:44] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:01:44] [INFO ] Invariant cache hit.
[2024-05-29 15:01:45] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 15:01:45] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:01:45] [INFO ] Invariant cache hit.
[2024-05-29 15:01:45] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:01:45] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:01:45] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:01:45] [INFO ] Invariant cache hit.
[2024-05-29 15:01:45] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:02:30] [INFO ] Deduced a trap composed of 13 places in 572 ms of which 2 ms to minimize.
[2024-05-29 15:02:31] [INFO ] Deduced a trap composed of 13 places in 507 ms of which 0 ms to minimize.
[2024-05-29 15:02:31] [INFO ] Deduced a trap composed of 13 places in 662 ms of which 1 ms to minimize.
[2024-05-29 15:02:32] [INFO ] Deduced a trap composed of 14 places in 639 ms of which 1 ms to minimize.
[2024-05-29 15:02:32] [INFO ] Deduced a trap composed of 15 places in 575 ms of which 1 ms to minimize.
[2024-05-29 15:02:33] [INFO ] Deduced a trap composed of 13 places in 669 ms of which 1 ms to minimize.
[2024-05-29 15:02:34] [INFO ] Deduced a trap composed of 13 places in 661 ms of which 1 ms to minimize.
[2024-05-29 15:02:35] [INFO ] Deduced a trap composed of 13 places in 669 ms of which 1 ms to minimize.
[2024-05-29 15:02:35] [INFO ] Deduced a trap composed of 13 places in 608 ms of which 0 ms to minimize.
[2024-05-29 15:02:36] [INFO ] Deduced a trap composed of 13 places in 680 ms of which 1 ms to minimize.
[2024-05-29 15:02:36] [INFO ] Deduced a trap composed of 13 places in 667 ms of which 1 ms to minimize.
[2024-05-29 15:02:37] [INFO ] Deduced a trap composed of 13 places in 586 ms of which 1 ms to minimize.
[2024-05-29 15:02:38] [INFO ] Deduced a trap composed of 15 places in 608 ms of which 1 ms to minimize.
[2024-05-29 15:02:38] [INFO ] Deduced a trap composed of 13 places in 679 ms of which 1 ms to minimize.
[2024-05-29 15:02:39] [INFO ] Deduced a trap composed of 13 places in 686 ms of which 2 ms to minimize.
[2024-05-29 15:02:40] [INFO ] Deduced a trap composed of 15 places in 566 ms of which 2 ms to minimize.
[2024-05-29 15:02:40] [INFO ] Deduced a trap composed of 20 places in 578 ms of which 1 ms to minimize.
[2024-05-29 15:02:41] [INFO ] Deduced a trap composed of 17 places in 579 ms of which 1 ms to minimize.
[2024-05-29 15:02:41] [INFO ] Deduced a trap composed of 15 places in 576 ms of which 1 ms to minimize.
[2024-05-29 15:02:42] [INFO ] Deduced a trap composed of 14 places in 481 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:02:43] [INFO ] Deduced a trap composed of 14 places in 468 ms of which 1 ms to minimize.
[2024-05-29 15:02:43] [INFO ] Deduced a trap composed of 13 places in 489 ms of which 1 ms to minimize.
[2024-05-29 15:02:44] [INFO ] Deduced a trap composed of 13 places in 421 ms of which 1 ms to minimize.
[2024-05-29 15:02:44] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 0 ms to minimize.
[2024-05-29 15:02:45] [INFO ] Deduced a trap composed of 13 places in 535 ms of which 1 ms to minimize.
[2024-05-29 15:02:45] [INFO ] Deduced a trap composed of 18 places in 540 ms of which 3 ms to minimize.
[2024-05-29 15:02:46] [INFO ] Deduced a trap composed of 14 places in 515 ms of which 0 ms to minimize.
[2024-05-29 15:02:46] [INFO ] Deduced a trap composed of 13 places in 485 ms of which 1 ms to minimize.
[2024-05-29 15:02:47] [INFO ] Deduced a trap composed of 13 places in 404 ms of which 1 ms to minimize.
[2024-05-29 15:02:47] [INFO ] Deduced a trap composed of 13 places in 540 ms of which 1 ms to minimize.
[2024-05-29 15:02:48] [INFO ] Deduced a trap composed of 13 places in 469 ms of which 1 ms to minimize.
SMT process timed out in 62549ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 62575ms
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 2221/2231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63288 ms. Remains : 124/130 places, 2221/2231 transitions.
[2024-05-29 15:02:48] [INFO ] Flatten gal took : 112 ms
[2024-05-29 15:02:48] [INFO ] Flatten gal took : 121 ms
[2024-05-29 15:02:48] [INFO ] Input system was already deterministic with 2221 transitions.
[2024-05-29 15:02:48] [INFO ] Flatten gal took : 119 ms
[2024-05-29 15:02:49] [INFO ] Flatten gal took : 119 ms
[2024-05-29 15:02:49] [INFO ] Time to serialize gal into /tmp/CTLFireability3601764091454062876.gal : 25 ms
[2024-05-29 15:02:49] [INFO ] Time to serialize properties into /tmp/CTLFireability272216451709685830.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/CTLFireability3601764091454062876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability272216451709685830.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.72948e+08,29.8858,502192,7774,31,84495,322,2428,6.04421e+06,54,1207,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 2231/2231 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 128 transition count 2227
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 128 transition count 2227
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 126 transition count 2223
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 126 transition count 2223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 124 transition count 2221
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 124 transition count 2221
Applied a total of 12 rules in 27 ms. Remains 124 /130 variables (removed 6) and now considering 2221/2231 (removed 10) transitions.
[2024-05-29 15:03:50] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:03:50] [INFO ] Invariant cache hit.
[2024-05-29 15:03:50] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 15:03:50] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:03:50] [INFO ] Invariant cache hit.
[2024-05-29 15:03:50] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:03:51] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:03:51] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:03:51] [INFO ] Invariant cache hit.
[2024-05-29 15:03:51] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:04:36] [INFO ] Deduced a trap composed of 13 places in 553 ms of which 1 ms to minimize.
[2024-05-29 15:04:37] [INFO ] Deduced a trap composed of 13 places in 541 ms of which 1 ms to minimize.
[2024-05-29 15:04:38] [INFO ] Deduced a trap composed of 13 places in 632 ms of which 1 ms to minimize.
[2024-05-29 15:04:38] [INFO ] Deduced a trap composed of 14 places in 638 ms of which 1 ms to minimize.
[2024-05-29 15:04:39] [INFO ] Deduced a trap composed of 15 places in 626 ms of which 0 ms to minimize.
[2024-05-29 15:04:40] [INFO ] Deduced a trap composed of 13 places in 637 ms of which 1 ms to minimize.
[2024-05-29 15:04:40] [INFO ] Deduced a trap composed of 13 places in 649 ms of which 1 ms to minimize.
[2024-05-29 15:04:41] [INFO ] Deduced a trap composed of 13 places in 637 ms of which 1 ms to minimize.
[2024-05-29 15:04:41] [INFO ] Deduced a trap composed of 13 places in 602 ms of which 1 ms to minimize.
[2024-05-29 15:04:42] [INFO ] Deduced a trap composed of 13 places in 662 ms of which 1 ms to minimize.
[2024-05-29 15:04:43] [INFO ] Deduced a trap composed of 13 places in 664 ms of which 1 ms to minimize.
[2024-05-29 15:04:43] [INFO ] Deduced a trap composed of 13 places in 645 ms of which 1 ms to minimize.
[2024-05-29 15:04:44] [INFO ] Deduced a trap composed of 15 places in 680 ms of which 1 ms to minimize.
[2024-05-29 15:04:45] [INFO ] Deduced a trap composed of 13 places in 678 ms of which 1 ms to minimize.
[2024-05-29 15:04:45] [INFO ] Deduced a trap composed of 13 places in 660 ms of which 1 ms to minimize.
[2024-05-29 15:04:46] [INFO ] Deduced a trap composed of 15 places in 565 ms of which 1 ms to minimize.
[2024-05-29 15:04:47] [INFO ] Deduced a trap composed of 20 places in 564 ms of which 1 ms to minimize.
[2024-05-29 15:04:47] [INFO ] Deduced a trap composed of 17 places in 550 ms of which 1 ms to minimize.
[2024-05-29 15:04:48] [INFO ] Deduced a trap composed of 15 places in 549 ms of which 1 ms to minimize.
[2024-05-29 15:04:48] [INFO ] Deduced a trap composed of 14 places in 478 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:04:49] [INFO ] Deduced a trap composed of 14 places in 470 ms of which 1 ms to minimize.
[2024-05-29 15:04:50] [INFO ] Deduced a trap composed of 13 places in 490 ms of which 1 ms to minimize.
[2024-05-29 15:04:50] [INFO ] Deduced a trap composed of 13 places in 421 ms of which 1 ms to minimize.
[2024-05-29 15:04:50] [INFO ] Deduced a trap composed of 13 places in 422 ms of which 0 ms to minimize.
[2024-05-29 15:04:51] [INFO ] Deduced a trap composed of 13 places in 556 ms of which 1 ms to minimize.
[2024-05-29 15:04:52] [INFO ] Deduced a trap composed of 18 places in 543 ms of which 1 ms to minimize.
[2024-05-29 15:04:52] [INFO ] Deduced a trap composed of 14 places in 550 ms of which 1 ms to minimize.
[2024-05-29 15:04:53] [INFO ] Deduced a trap composed of 13 places in 477 ms of which 1 ms to minimize.
[2024-05-29 15:04:53] [INFO ] Deduced a trap composed of 13 places in 406 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/2334 variables, and 30 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/124 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2220/163 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:05:01] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 1 ms to minimize.
[2024-05-29 15:05:01] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 0 ms to minimize.
[2024-05-29 15:05:01] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 1 ms to minimize.
[2024-05-29 15:05:02] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 0 ms to minimize.
[2024-05-29 15:05:02] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 1 ms to minimize.
[2024-05-29 15:05:02] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 1 ms to minimize.
[2024-05-29 15:05:02] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 0 ms to minimize.
[2024-05-29 15:05:03] [INFO ] Deduced a trap composed of 15 places in 354 ms of which 1 ms to minimize.
[2024-05-29 15:05:03] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 1 ms to minimize.
[2024-05-29 15:05:03] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 0 ms to minimize.
[2024-05-29 15:05:03] [INFO ] Deduced a trap composed of 13 places in 335 ms of which 0 ms to minimize.
[2024-05-29 15:05:04] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 0 ms to minimize.
[2024-05-29 15:05:04] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 1 ms to minimize.
[2024-05-29 15:05:04] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 3 ms to minimize.
[2024-05-29 15:05:05] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 1 ms to minimize.
[2024-05-29 15:05:05] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2024-05-29 15:05:05] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 1 ms to minimize.
[2024-05-29 15:05:06] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 1 ms to minimize.
[2024-05-29 15:05:06] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 0 ms to minimize.
[2024-05-29 15:05:06] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:05:07] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 0 ms to minimize.
[2024-05-29 15:05:07] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 0 ms to minimize.
[2024-05-29 15:05:07] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2024-05-29 15:05:07] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-05-29 15:05:07] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 1 ms to minimize.
[2024-05-29 15:05:07] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2024-05-29 15:05:08] [INFO ] Deduced a trap composed of 13 places in 354 ms of which 1 ms to minimize.
[2024-05-29 15:05:08] [INFO ] Deduced a trap composed of 14 places in 292 ms of which 0 ms to minimize.
[2024-05-29 15:05:08] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 1 ms to minimize.
[2024-05-29 15:05:09] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 1 ms to minimize.
[2024-05-29 15:05:09] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 1 ms to minimize.
[2024-05-29 15:05:09] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 0 ms to minimize.
[2024-05-29 15:05:09] [INFO ] Deduced a trap composed of 13 places in 346 ms of which 0 ms to minimize.
[2024-05-29 15:05:10] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 0 ms to minimize.
[2024-05-29 15:05:10] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2024-05-29 15:05:10] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2024-05-29 15:05:10] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 1 ms to minimize.
[2024-05-29 15:05:11] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 0 ms to minimize.
[2024-05-29 15:05:11] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2024-05-29 15:05:11] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:05:11] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2024-05-29 15:05:12] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 0 ms to minimize.
[2024-05-29 15:05:12] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-29 15:05:12] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 15:05:12] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 1 ms to minimize.
[2024-05-29 15:05:12] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 15:05:12] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2024-05-29 15:05:13] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 0 ms to minimize.
[2024-05-29 15:05:13] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2024-05-29 15:05:13] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2024-05-29 15:05:13] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2024-05-29 15:05:13] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2024-05-29 15:05:14] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 0 ms to minimize.
[2024-05-29 15:05:14] [INFO ] Deduced a trap composed of 13 places in 282 ms of which 1 ms to minimize.
[2024-05-29 15:05:14] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 0 ms to minimize.
[2024-05-29 15:05:14] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 1 ms to minimize.
[2024-05-29 15:05:14] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2024-05-29 15:05:15] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2024-05-29 15:05:15] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2024-05-29 15:05:15] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:05:16] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-29 15:05:16] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2024-05-29 15:05:17] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 0 ms to minimize.
[2024-05-29 15:05:17] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2024-05-29 15:05:17] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 0 ms to minimize.
[2024-05-29 15:05:17] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 1 ms to minimize.
[2024-05-29 15:05:18] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2024-05-29 15:05:18] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 1 ms to minimize.
[2024-05-29 15:05:18] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 0 ms to minimize.
[2024-05-29 15:05:18] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 1 ms to minimize.
[2024-05-29 15:05:18] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 1 ms to minimize.
[2024-05-29 15:05:19] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 1 ms to minimize.
[2024-05-29 15:05:19] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 1 ms to minimize.
[2024-05-29 15:05:19] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 0 ms to minimize.
[2024-05-29 15:05:19] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 0 ms to minimize.
[2024-05-29 15:05:20] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2024-05-29 15:05:20] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 15:05:20] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2024-05-29 15:05:20] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2024-05-29 15:05:20] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:05:23] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 1 ms to minimize.
[2024-05-29 15:05:23] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2024-05-29 15:05:23] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
SMT process timed out in 92531ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 92554ms
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 2221/2231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93265 ms. Remains : 124/130 places, 2221/2231 transitions.
[2024-05-29 15:05:23] [INFO ] Flatten gal took : 112 ms
[2024-05-29 15:05:23] [INFO ] Flatten gal took : 123 ms
[2024-05-29 15:05:24] [INFO ] Input system was already deterministic with 2221 transitions.
[2024-05-29 15:05:24] [INFO ] Flatten gal took : 119 ms
[2024-05-29 15:05:24] [INFO ] Flatten gal took : 119 ms
[2024-05-29 15:05:24] [INFO ] Time to serialize gal into /tmp/CTLFireability3696513082748030567.gal : 25 ms
[2024-05-29 15:05:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6936566301087498246.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/CTLFireability3696513082748030567.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6936566301087498246.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 15:05:54] [INFO ] Flatten gal took : 118 ms
[2024-05-29 15:05:54] [INFO ] Applying decomposition
[2024-05-29 15:05:54] [INFO ] Flatten gal took : 121 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/graph11110822671926076929.txt' '-o' '/tmp/graph11110822671926076929.bin' '-w' '/tmp/graph11110822671926076929.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11110822671926076929.bin' '-l' '-1' '-v' '-w' '/tmp/graph11110822671926076929.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:05:55] [INFO ] Decomposing Gal with order
[2024-05-29 15:05:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:05:55] [INFO ] Removed a total of 20551 redundant transitions.
[2024-05-29 15:05:55] [INFO ] Flatten gal took : 326 ms
[2024-05-29 15:05:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 106 ms.
[2024-05-29 15:05:55] [INFO ] Time to serialize gal into /tmp/CTLFireability14274395127264137064.gal : 17 ms
[2024-05-29 15:05:55] [INFO ] Time to serialize properties into /tmp/CTLFireability5684551946928999870.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/CTLFireability14274395127264137064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5684551946928999870.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 : 130/130 places, 2231/2231 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 128 transition count 2227
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 128 transition count 2227
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 126 transition count 2223
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 126 transition count 2223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 124 transition count 2221
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 124 transition count 2221
Applied a total of 12 rules in 31 ms. Remains 124 /130 variables (removed 6) and now considering 2221/2231 (removed 10) transitions.
[2024-05-29 15:06:25] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:06:25] [INFO ] Invariant cache hit.
[2024-05-29 15:06:25] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 15:06:25] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:06:25] [INFO ] Invariant cache hit.
[2024-05-29 15:06:26] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:06:26] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:06:26] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:06:26] [INFO ] Invariant cache hit.
[2024-05-29 15:06:26] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:07:12] [INFO ] Deduced a trap composed of 13 places in 504 ms of which 1 ms to minimize.
[2024-05-29 15:07:12] [INFO ] Deduced a trap composed of 13 places in 517 ms of which 1 ms to minimize.
[2024-05-29 15:07:13] [INFO ] Deduced a trap composed of 13 places in 590 ms of which 1 ms to minimize.
[2024-05-29 15:07:13] [INFO ] Deduced a trap composed of 14 places in 617 ms of which 1 ms to minimize.
[2024-05-29 15:07:14] [INFO ] Deduced a trap composed of 15 places in 600 ms of which 1 ms to minimize.
[2024-05-29 15:07:15] [INFO ] Deduced a trap composed of 13 places in 657 ms of which 1 ms to minimize.
[2024-05-29 15:07:15] [INFO ] Deduced a trap composed of 13 places in 652 ms of which 1 ms to minimize.
[2024-05-29 15:07:16] [INFO ] Deduced a trap composed of 13 places in 614 ms of which 1 ms to minimize.
[2024-05-29 15:07:17] [INFO ] Deduced a trap composed of 13 places in 676 ms of which 1 ms to minimize.
[2024-05-29 15:07:17] [INFO ] Deduced a trap composed of 13 places in 658 ms of which 1 ms to minimize.
[2024-05-29 15:07:18] [INFO ] Deduced a trap composed of 13 places in 655 ms of which 1 ms to minimize.
[2024-05-29 15:07:19] [INFO ] Deduced a trap composed of 13 places in 642 ms of which 1 ms to minimize.
[2024-05-29 15:07:19] [INFO ] Deduced a trap composed of 15 places in 680 ms of which 1 ms to minimize.
[2024-05-29 15:07:20] [INFO ] Deduced a trap composed of 13 places in 654 ms of which 1 ms to minimize.
[2024-05-29 15:07:21] [INFO ] Deduced a trap composed of 13 places in 644 ms of which 1 ms to minimize.
[2024-05-29 15:07:21] [INFO ] Deduced a trap composed of 15 places in 541 ms of which 1 ms to minimize.
[2024-05-29 15:07:22] [INFO ] Deduced a trap composed of 20 places in 566 ms of which 1 ms to minimize.
[2024-05-29 15:07:22] [INFO ] Deduced a trap composed of 17 places in 534 ms of which 1 ms to minimize.
[2024-05-29 15:07:23] [INFO ] Deduced a trap composed of 15 places in 567 ms of which 1 ms to minimize.
[2024-05-29 15:07:23] [INFO ] Deduced a trap composed of 14 places in 477 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:07:24] [INFO ] Deduced a trap composed of 14 places in 418 ms of which 1 ms to minimize.
[2024-05-29 15:07:25] [INFO ] Deduced a trap composed of 13 places in 453 ms of which 1 ms to minimize.
[2024-05-29 15:07:25] [INFO ] Deduced a trap composed of 13 places in 394 ms of which 0 ms to minimize.
[2024-05-29 15:07:25] [INFO ] Deduced a trap composed of 13 places in 406 ms of which 1 ms to minimize.
[2024-05-29 15:07:26] [INFO ] Deduced a trap composed of 13 places in 553 ms of which 1 ms to minimize.
[2024-05-29 15:07:27] [INFO ] Deduced a trap composed of 18 places in 495 ms of which 0 ms to minimize.
[2024-05-29 15:07:27] [INFO ] Deduced a trap composed of 14 places in 573 ms of which 1 ms to minimize.
[2024-05-29 15:07:28] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 1 ms to minimize.
[2024-05-29 15:07:28] [INFO ] Deduced a trap composed of 13 places in 379 ms of which 1 ms to minimize.
[2024-05-29 15:07:28] [INFO ] Deduced a trap composed of 13 places in 508 ms of which 1 ms to minimize.
SMT process timed out in 62393ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 62415ms
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 2221/2231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63187 ms. Remains : 124/130 places, 2221/2231 transitions.
[2024-05-29 15:07:29] [INFO ] Flatten gal took : 112 ms
[2024-05-29 15:07:29] [INFO ] Flatten gal took : 123 ms
[2024-05-29 15:07:29] [INFO ] Input system was already deterministic with 2221 transitions.
[2024-05-29 15:07:29] [INFO ] Flatten gal took : 117 ms
[2024-05-29 15:07:29] [INFO ] Flatten gal took : 117 ms
[2024-05-29 15:07:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4208907328043462617.gal : 32 ms
[2024-05-29 15:07:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13835028912060805609.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/CTLFireability4208907328043462617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13835028912060805609.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 15:07:59] [INFO ] Flatten gal took : 124 ms
[2024-05-29 15:07:59] [INFO ] Applying decomposition
[2024-05-29 15:08:00] [INFO ] Flatten gal took : 121 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/graph7394739970570929313.txt' '-o' '/tmp/graph7394739970570929313.bin' '-w' '/tmp/graph7394739970570929313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7394739970570929313.bin' '-l' '-1' '-v' '-w' '/tmp/graph7394739970570929313.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:08:00] [INFO ] Decomposing Gal with order
[2024-05-29 15:08:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:08:00] [INFO ] Removed a total of 20549 redundant transitions.
[2024-05-29 15:08:00] [INFO ] Flatten gal took : 264 ms
[2024-05-29 15:08:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 82 ms.
[2024-05-29 15:08:00] [INFO ] Time to serialize gal into /tmp/CTLFireability10805609539690533594.gal : 13 ms
[2024-05-29 15:08:00] [INFO ] Time to serialize properties into /tmp/CTLFireability8349832894006276614.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/CTLFireability10805609539690533594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8349832894006276614.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 : 130/130 places, 2231/2231 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 129 transition count 2229
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 129 transition count 2229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 128 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 128 transition count 2227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 127 transition count 2226
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 127 transition count 2226
Applied a total of 6 rules in 24 ms. Remains 127 /130 variables (removed 3) and now considering 2226/2231 (removed 5) transitions.
[2024-05-29 15:08:30] [INFO ] Flow matrix only has 2214 transitions (discarded 12 similar events)
// Phase 1: matrix 2214 rows 127 cols
[2024-05-29 15:08:31] [INFO ] Computed 1 invariants in 16 ms
[2024-05-29 15:08:31] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 15:08:31] [INFO ] Flow matrix only has 2214 transitions (discarded 12 similar events)
[2024-05-29 15:08:31] [INFO ] Invariant cache hit.
[2024-05-29 15:08:31] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:08:31] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
Running 2225 sub problems to find dead transitions.
[2024-05-29 15:08:31] [INFO ] Flow matrix only has 2214 transitions (discarded 12 similar events)
[2024-05-29 15:08:31] [INFO ] Invariant cache hit.
[2024-05-29 15:08:31] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:09:18] [INFO ] Deduced a trap composed of 16 places in 655 ms of which 1 ms to minimize.
[2024-05-29 15:09:19] [INFO ] Deduced a trap composed of 13 places in 676 ms of which 1 ms to minimize.
[2024-05-29 15:09:19] [INFO ] Deduced a trap composed of 13 places in 653 ms of which 1 ms to minimize.
[2024-05-29 15:09:20] [INFO ] Deduced a trap composed of 13 places in 670 ms of which 1 ms to minimize.
[2024-05-29 15:09:21] [INFO ] Deduced a trap composed of 13 places in 688 ms of which 1 ms to minimize.
[2024-05-29 15:09:21] [INFO ] Deduced a trap composed of 13 places in 635 ms of which 1 ms to minimize.
[2024-05-29 15:09:22] [INFO ] Deduced a trap composed of 13 places in 679 ms of which 1 ms to minimize.
[2024-05-29 15:09:22] [INFO ] Deduced a trap composed of 15 places in 627 ms of which 1 ms to minimize.
[2024-05-29 15:09:23] [INFO ] Deduced a trap composed of 13 places in 678 ms of which 1 ms to minimize.
[2024-05-29 15:09:24] [INFO ] Deduced a trap composed of 15 places in 676 ms of which 1 ms to minimize.
[2024-05-29 15:09:25] [INFO ] Deduced a trap composed of 17 places in 675 ms of which 1 ms to minimize.
[2024-05-29 15:09:25] [INFO ] Deduced a trap composed of 13 places in 670 ms of which 1 ms to minimize.
[2024-05-29 15:09:26] [INFO ] Deduced a trap composed of 14 places in 571 ms of which 1 ms to minimize.
[2024-05-29 15:09:26] [INFO ] Deduced a trap composed of 17 places in 427 ms of which 1 ms to minimize.
[2024-05-29 15:09:27] [INFO ] Deduced a trap composed of 13 places in 484 ms of which 1 ms to minimize.
[2024-05-29 15:09:27] [INFO ] Deduced a trap composed of 15 places in 475 ms of which 1 ms to minimize.
[2024-05-29 15:09:28] [INFO ] Deduced a trap composed of 13 places in 470 ms of which 0 ms to minimize.
[2024-05-29 15:09:28] [INFO ] Deduced a trap composed of 15 places in 554 ms of which 1 ms to minimize.
[2024-05-29 15:09:29] [INFO ] Deduced a trap composed of 13 places in 478 ms of which 1 ms to minimize.
[2024-05-29 15:09:29] [INFO ] Deduced a trap composed of 14 places in 479 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:09:30] [INFO ] Deduced a trap composed of 13 places in 353 ms of which 1 ms to minimize.
[2024-05-29 15:09:30] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 1 ms to minimize.
[2024-05-29 15:09:31] [INFO ] Deduced a trap composed of 13 places in 351 ms of which 1 ms to minimize.
[2024-05-29 15:09:31] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 1 ms to minimize.
[2024-05-29 15:09:31] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 1 ms to minimize.
[2024-05-29 15:09:31] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 0 ms to minimize.
[2024-05-29 15:09:32] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 1 ms to minimize.
[2024-05-29 15:09:32] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 0 ms to minimize.
[2024-05-29 15:09:32] [INFO ] Deduced a trap composed of 13 places in 291 ms of which 1 ms to minimize.
[2024-05-29 15:09:32] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 0 ms to minimize.
[2024-05-29 15:09:33] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 1 ms to minimize.
[2024-05-29 15:09:33] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 0 ms to minimize.
[2024-05-29 15:09:33] [INFO ] Deduced a trap composed of 18 places in 395 ms of which 1 ms to minimize.
[2024-05-29 15:09:34] [INFO ] Deduced a trap composed of 13 places in 335 ms of which 0 ms to minimize.
[2024-05-29 15:09:34] [INFO ] Deduced a trap composed of 16 places in 352 ms of which 1 ms to minimize.
SMT process timed out in 62858ms, After SMT, problems are : Problem set: 0 solved, 2225 unsolved
Search for dead transitions found 0 dead transitions in 62879ms
Starting structural reductions in LTL mode, iteration 1 : 127/130 places, 2226/2231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63739 ms. Remains : 127/130 places, 2226/2231 transitions.
[2024-05-29 15:09:34] [INFO ] Flatten gal took : 113 ms
[2024-05-29 15:09:34] [INFO ] Flatten gal took : 121 ms
[2024-05-29 15:09:35] [INFO ] Input system was already deterministic with 2226 transitions.
[2024-05-29 15:09:35] [INFO ] Flatten gal took : 118 ms
[2024-05-29 15:09:35] [INFO ] Flatten gal took : 119 ms
[2024-05-29 15:09:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17248149799118969748.gal : 24 ms
[2024-05-29 15:09:35] [INFO ] Time to serialize properties into /tmp/CTLFireability15977320058011878992.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/CTLFireability17248149799118969748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15977320058011878992.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 2231/2231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 129 transition count 2197
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 96 transition count 2197
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 66 place count 96 transition count 2185
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 90 place count 84 transition count 2185
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 82 transition count 2181
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 82 transition count 2181
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 80 transition count 2177
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 80 transition count 2177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 80 transition count 2174
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 139 place count 61 transition count 2155
Ensure Unique test removed 1031 transitions
Reduce isomorphic transitions removed 1031 transitions.
Iterating post reduction 3 with 1031 rules applied. Total rules applied 1170 place count 61 transition count 1124
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1188 place count 52 transition count 1115
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1197 place count 52 transition count 1106
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 1207 place count 52 transition count 1096
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1227 place count 42 transition count 1086
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1228 place count 41 transition count 1085
Applied a total of 1228 rules in 695 ms. Remains 41 /130 variables (removed 89) and now considering 1085/2231 (removed 1146) transitions.
[2024-05-29 15:10:37] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
// Phase 1: matrix 1074 rows 41 cols
[2024-05-29 15:10:37] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 15:10:37] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 15:10:37] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 15:10:37] [INFO ] Invariant cache hit.
[2024-05-29 15:10:37] [INFO ] State equation strengthened by 1033 read => feed constraints.
[2024-05-29 15:10:37] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-29 15:10:37] [INFO ] Redundant transitions in 75 ms returned []
Running 1075 sub problems to find dead transitions.
[2024-05-29 15:10:37] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 15:10:37] [INFO ] Invariant cache hit.
[2024-05-29 15:10:37] [INFO ] State equation strengthened by 1033 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:10:56] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-29 15:10:56] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-29 15:10:56] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 15:10:57] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 0 ms to minimize.
[2024-05-29 15:10:57] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 0 ms to minimize.
[2024-05-29 15:10:57] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2024-05-29 15:10:57] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-05-29 15:10:58] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2024-05-29 15:10:58] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-29 15:10:58] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2024-05-29 15:10:58] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2024-05-29 15:10:58] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-29 15:10:58] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-29 15:10:59] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-05-29 15:10:59] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 15:10:59] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 15:10:59] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 15:10:59] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2024-05-29 15:10:59] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-29 15:11:00] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:11:00] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 15:11:00] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
[2024-05-29 15:11:00] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 15:11:00] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-29 15:11:00] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 15:11:00] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 15:11:00] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-29 15:11:00] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 15:11:00] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 15:11:00] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:11:01] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 0 ms to minimize.
[2024-05-29 15:11:01] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-05-29 15:11:01] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 15:11:01] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2024-05-29 15:11:01] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2024-05-29 15:11:01] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2024-05-29 15:11:02] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-29 15:11:02] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 15:11:02] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 15:11:02] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:11:03] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-29 15:11:04] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 15:11:04] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:11:04] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:11:04] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-29 15:11:04] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 15:11:04] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 15:11:04] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-29 15:11:04] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-29 15:11:04] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:11:04] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2024-05-29 15:11:04] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-29 15:11:04] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 15:11:05] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 15:11:05] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 15:11:05] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2024-05-29 15:11:05] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2024-05-29 15:11:05] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-29 15:11:05] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-29 15:11:05] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:11:06] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-05-29 15:11:06] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-29 15:11:06] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2024-05-29 15:11:06] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-29 15:11:06] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-29 15:11:07] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-29 15:11:07] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-05-29 15:11:07] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 15:11:07] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 15:11:07] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:11:07] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-29 15:11:07] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 15:11:07] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-29 15:11:07] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 15:11:07] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:11:07] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 15:11:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:11:10] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 15:11:10] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 15:11:10] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 15:11:10] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 15:11:10] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 15:11:11] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-29 15:11:11] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 15:11:11] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-29 15:11:11] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 15:11:11] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 15:11:11] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:11:11] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:11:11] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-29 15:11:11] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 15:11:11] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:11:15] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 15:11:16] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:11:18] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-29 15:11:18] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 15:11:18] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:11:21] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-29 15:11:21] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 41/1115 variables, and 100 constraints, problems are : Problem set: 0 solved, 1075 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/41 constraints, ReadFeed: 0/1033 constraints, PredecessorRefiner: 1075/41 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1075 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:11:26] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 15:11:26] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 15:11:26] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 15:11:26] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-29 15:11:26] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 15:11:26] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 15:11:27] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 15:11:27] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2024-05-29 15:11:27] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-29 15:11:27] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 15:11:27] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 15:11:27] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 15:11:27] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 15:11:27] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 15:11:27] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-29 15:11:28] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 15:11:28] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:11:31] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-29 15:11:32] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 15:11:32] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-29 15:11:32] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:11:35] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 7 (OVERLAPS) 1073/1114 variables, 41/163 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1114 variables, 1032/1195 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1114 variables, 41/1236 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1114/1115 variables, and 1236 constraints, problems are : Problem set: 0 solved, 1075 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1032/1033 constraints, PredecessorRefiner: 1075/41 constraints, Known Traps: 121/121 constraints]
After SMT, in 76181ms problems are : Problem set: 0 solved, 1075 unsolved
Search for dead transitions found 0 dead transitions in 76191ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/130 places, 1085/2231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77316 ms. Remains : 41/130 places, 1085/2231 transitions.
[2024-05-29 15:11:54] [INFO ] Flatten gal took : 55 ms
[2024-05-29 15:11:54] [INFO ] Flatten gal took : 58 ms
[2024-05-29 15:11:54] [INFO ] Input system was already deterministic with 1085 transitions.
[2024-05-29 15:11:54] [INFO ] Flatten gal took : 58 ms
[2024-05-29 15:11:54] [INFO ] Flatten gal took : 57 ms
[2024-05-29 15:11:54] [INFO ] Time to serialize gal into /tmp/CTLFireability516674771653040377.gal : 12 ms
[2024-05-29 15:11:54] [INFO ] Time to serialize properties into /tmp/CTLFireability7508903512827247864.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/CTLFireability516674771653040377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7508903512827247864.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.
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,2067,0.819389,36280,2,1157,5,21348,6,0,1239,10770,0


Converting to forward existential form...Done !
original formula: EF((EG(AF((((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246==0)||(p282==0))))||((p318==0)||(p354==0))))) ...552
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(EG(!((((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246=...645
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t32...354
(forward)formula 0,1,4.5316,84384,1,0,1187,66928,2185,60,45377,38382,2183
FORMULA StigmergyCommit-PT-09a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 2231/2231 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 128 transition count 2227
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 128 transition count 2227
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 126 transition count 2223
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 126 transition count 2223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 124 transition count 2221
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 124 transition count 2221
Applied a total of 12 rules in 26 ms. Remains 124 /130 variables (removed 6) and now considering 2221/2231 (removed 10) transitions.
[2024-05-29 15:11:59] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
// Phase 1: matrix 2210 rows 124 cols
[2024-05-29 15:11:59] [INFO ] Computed 1 invariants in 15 ms
[2024-05-29 15:11:59] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 15:11:59] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:11:59] [INFO ] Invariant cache hit.
[2024-05-29 15:11:59] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:11:59] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:11:59] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:11:59] [INFO ] Invariant cache hit.
[2024-05-29 15:11:59] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:12:45] [INFO ] Deduced a trap composed of 13 places in 569 ms of which 4 ms to minimize.
[2024-05-29 15:12:45] [INFO ] Deduced a trap composed of 13 places in 549 ms of which 1 ms to minimize.
[2024-05-29 15:12:46] [INFO ] Deduced a trap composed of 13 places in 590 ms of which 1 ms to minimize.
[2024-05-29 15:12:46] [INFO ] Deduced a trap composed of 14 places in 602 ms of which 1 ms to minimize.
[2024-05-29 15:12:47] [INFO ] Deduced a trap composed of 15 places in 632 ms of which 1 ms to minimize.
[2024-05-29 15:12:48] [INFO ] Deduced a trap composed of 13 places in 630 ms of which 1 ms to minimize.
[2024-05-29 15:12:48] [INFO ] Deduced a trap composed of 13 places in 618 ms of which 1 ms to minimize.
[2024-05-29 15:12:49] [INFO ] Deduced a trap composed of 13 places in 649 ms of which 0 ms to minimize.
[2024-05-29 15:12:49] [INFO ] Deduced a trap composed of 13 places in 613 ms of which 1 ms to minimize.
[2024-05-29 15:12:50] [INFO ] Deduced a trap composed of 13 places in 636 ms of which 1 ms to minimize.
[2024-05-29 15:12:51] [INFO ] Deduced a trap composed of 13 places in 593 ms of which 1 ms to minimize.
[2024-05-29 15:12:51] [INFO ] Deduced a trap composed of 13 places in 663 ms of which 1 ms to minimize.
[2024-05-29 15:12:52] [INFO ] Deduced a trap composed of 15 places in 686 ms of which 1 ms to minimize.
[2024-05-29 15:12:53] [INFO ] Deduced a trap composed of 13 places in 676 ms of which 1 ms to minimize.
[2024-05-29 15:12:53] [INFO ] Deduced a trap composed of 13 places in 675 ms of which 1 ms to minimize.
[2024-05-29 15:12:54] [INFO ] Deduced a trap composed of 15 places in 570 ms of which 0 ms to minimize.
[2024-05-29 15:12:55] [INFO ] Deduced a trap composed of 20 places in 565 ms of which 1 ms to minimize.
[2024-05-29 15:12:55] [INFO ] Deduced a trap composed of 17 places in 564 ms of which 1 ms to minimize.
[2024-05-29 15:12:56] [INFO ] Deduced a trap composed of 15 places in 542 ms of which 0 ms to minimize.
[2024-05-29 15:12:56] [INFO ] Deduced a trap composed of 14 places in 459 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:12:57] [INFO ] Deduced a trap composed of 14 places in 463 ms of which 1 ms to minimize.
[2024-05-29 15:12:58] [INFO ] Deduced a trap composed of 13 places in 469 ms of which 1 ms to minimize.
[2024-05-29 15:12:58] [INFO ] Deduced a trap composed of 13 places in 418 ms of which 1 ms to minimize.
[2024-05-29 15:12:58] [INFO ] Deduced a trap composed of 13 places in 399 ms of which 0 ms to minimize.
[2024-05-29 15:12:59] [INFO ] Deduced a trap composed of 13 places in 538 ms of which 1 ms to minimize.
[2024-05-29 15:13:00] [INFO ] Deduced a trap composed of 18 places in 523 ms of which 1 ms to minimize.
[2024-05-29 15:13:00] [INFO ] Deduced a trap composed of 14 places in 518 ms of which 1 ms to minimize.
[2024-05-29 15:13:01] [INFO ] Deduced a trap composed of 13 places in 439 ms of which 0 ms to minimize.
[2024-05-29 15:13:01] [INFO ] Deduced a trap composed of 13 places in 377 ms of which 1 ms to minimize.
[2024-05-29 15:13:01] [INFO ] Deduced a trap composed of 13 places in 497 ms of which 1 ms to minimize.
SMT process timed out in 62191ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 62215ms
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 2221/2231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62939 ms. Remains : 124/130 places, 2221/2231 transitions.
[2024-05-29 15:13:02] [INFO ] Flatten gal took : 111 ms
[2024-05-29 15:13:02] [INFO ] Flatten gal took : 119 ms
[2024-05-29 15:13:02] [INFO ] Input system was already deterministic with 2221 transitions.
[2024-05-29 15:13:02] [INFO ] Flatten gal took : 117 ms
[2024-05-29 15:13:02] [INFO ] Flatten gal took : 118 ms
[2024-05-29 15:13:02] [INFO ] Time to serialize gal into /tmp/CTLFireability14771046233221986236.gal : 24 ms
[2024-05-29 15:13:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10845311801843236773.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/CTLFireability14771046233221986236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10845311801843236773.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.72948e+08,26.0752,718672,12845,36,385434,503,2216,7.17668e+06,59,2087,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 2231/2231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 129 transition count 2197
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 96 transition count 2197
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 66 place count 96 transition count 2185
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 90 place count 84 transition count 2185
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 82 transition count 2181
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 82 transition count 2181
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 80 transition count 2177
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 80 transition count 2177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 80 transition count 2174
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 139 place count 61 transition count 2155
Ensure Unique test removed 1031 transitions
Reduce isomorphic transitions removed 1031 transitions.
Iterating post reduction 3 with 1031 rules applied. Total rules applied 1170 place count 61 transition count 1124
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1188 place count 52 transition count 1115
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1197 place count 52 transition count 1106
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 1207 place count 52 transition count 1096
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1227 place count 42 transition count 1086
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1228 place count 41 transition count 1085
Applied a total of 1228 rules in 651 ms. Remains 41 /130 variables (removed 89) and now considering 1085/2231 (removed 1146) transitions.
[2024-05-29 15:14:04] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
// Phase 1: matrix 1074 rows 41 cols
[2024-05-29 15:14:04] [INFO ] Computed 1 invariants in 9 ms
[2024-05-29 15:14:04] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 15:14:04] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 15:14:04] [INFO ] Invariant cache hit.
[2024-05-29 15:14:04] [INFO ] State equation strengthened by 1033 read => feed constraints.
[2024-05-29 15:14:04] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-05-29 15:14:05] [INFO ] Redundant transitions in 64 ms returned []
Running 1075 sub problems to find dead transitions.
[2024-05-29 15:14:05] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 15:14:05] [INFO ] Invariant cache hit.
[2024-05-29 15:14:05] [INFO ] State equation strengthened by 1033 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:14:24] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-29 15:14:24] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-29 15:14:24] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-29 15:14:24] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 1 ms to minimize.
[2024-05-29 15:14:24] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 0 ms to minimize.
[2024-05-29 15:14:24] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2024-05-29 15:14:25] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2024-05-29 15:14:25] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2024-05-29 15:14:25] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-29 15:14:25] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2024-05-29 15:14:25] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2024-05-29 15:14:26] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2024-05-29 15:14:26] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-29 15:14:26] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-29 15:14:26] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2024-05-29 15:14:26] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-29 15:14:26] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2024-05-29 15:14:27] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2024-05-29 15:14:27] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-05-29 15:14:27] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:14:27] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-29 15:14:27] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-29 15:14:27] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 15:14:27] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-05-29 15:14:27] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-29 15:14:27] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 15:14:28] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 15:14:28] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 15:14:28] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 15:14:28] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 15:14:28] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-29 15:14:28] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 15:14:28] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-29 15:14:28] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-29 15:14:29] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 15:14:29] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-29 15:14:29] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-29 15:14:29] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-29 15:14:29] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-29 15:14:29] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:14:31] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-29 15:14:31] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 15:14:31] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-29 15:14:31] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-29 15:14:31] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-29 15:14:31] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-29 15:14:31] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 15:14:31] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-29 15:14:31] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-29 15:14:31] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-29 15:14:32] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2024-05-29 15:14:32] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 15:14:32] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 15:14:32] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-29 15:14:32] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2024-05-29 15:14:32] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2024-05-29 15:14:32] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2024-05-29 15:14:33] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2024-05-29 15:14:33] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:14:33] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:14:33] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 15:14:33] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-29 15:14:34] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 15:14:34] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 15:14:34] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-29 15:14:34] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2024-05-29 15:14:34] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-05-29 15:14:34] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 15:14:34] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 15:14:34] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-29 15:14:34] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 15:14:35] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 15:14:35] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2024-05-29 15:14:35] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-29 15:14:35] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 15:14:35] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 15:14:35] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:14:38] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 15:14:38] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 15:14:38] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-29 15:14:38] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-05-29 15:14:38] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-29 15:14:38] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-29 15:14:38] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-29 15:14:38] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-29 15:14:38] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-29 15:14:39] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-29 15:14:39] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:14:39] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 15:14:39] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 15:14:39] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 15:14:39] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:14:43] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 15:14:43] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:14:46] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-29 15:14:46] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 15:14:46] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:14:48] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-29 15:14:48] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 41/1115 variables, and 100 constraints, problems are : Problem set: 0 solved, 1075 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/41 constraints, ReadFeed: 0/1033 constraints, PredecessorRefiner: 1075/41 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1075 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:14:53] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 15:14:53] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 15:14:53] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 15:14:53] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-29 15:14:53] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:14:54] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 15:14:54] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-29 15:14:54] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-05-29 15:14:54] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 15:14:54] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 15:14:54] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 15:14:54] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 15:14:54] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 15:14:54] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 15:14:55] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-29 15:14:55] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-29 15:14:55] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:14:58] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 15:14:58] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-29 15:14:59] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 15:14:59] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:15:02] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 7 (OVERLAPS) 1073/1114 variables, 41/163 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1114 variables, 1032/1195 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1114 variables, 41/1236 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1114/1115 variables, and 1236 constraints, problems are : Problem set: 0 solved, 1075 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1032/1033 constraints, PredecessorRefiner: 1075/41 constraints, Known Traps: 121/121 constraints]
After SMT, in 76289ms problems are : Problem set: 0 solved, 1075 unsolved
Search for dead transitions found 0 dead transitions in 76300ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/130 places, 1085/2231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77405 ms. Remains : 41/130 places, 1085/2231 transitions.
[2024-05-29 15:15:21] [INFO ] Flatten gal took : 60 ms
[2024-05-29 15:15:21] [INFO ] Flatten gal took : 66 ms
[2024-05-29 15:15:21] [INFO ] Input system was already deterministic with 1085 transitions.
RANDOM walk for 40 steps (0 resets) in 9 ms. (4 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-09a-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 15:15:21] [INFO ] Flatten gal took : 58 ms
[2024-05-29 15:15:21] [INFO ] Flatten gal took : 58 ms
[2024-05-29 15:15:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3563100401957484076.gal : 11 ms
[2024-05-29 15:15:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15428735670904738930.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3563100401957484076.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15428735670904738930.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 2231/2231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 129 transition count 2197
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 96 transition count 2197
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 66 place count 96 transition count 2185
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 90 place count 84 transition count 2185
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 82 transition count 2181
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 82 transition count 2181
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 80 transition count 2177
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 80 transition count 2177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 80 transition count 2174
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 139 place count 61 transition count 2155
Ensure Unique test removed 1031 transitions
Reduce isomorphic transitions removed 1031 transitions.
Iterating post reduction 3 with 1031 rules applied. Total rules applied 1170 place count 61 transition count 1124
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1188 place count 52 transition count 1115
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1197 place count 52 transition count 1106
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 1207 place count 52 transition count 1096
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1227 place count 42 transition count 1086
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1228 place count 41 transition count 1085
Applied a total of 1228 rules in 686 ms. Remains 41 /130 variables (removed 89) and now considering 1085/2231 (removed 1146) transitions.
[2024-05-29 15:15:22] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 15:15:22] [INFO ] Invariant cache hit.
[2024-05-29 15:15:22] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 15:15:22] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 15:15:22] [INFO ] Invariant cache hit.
[2024-05-29 15:15:22] [INFO ] State equation strengthened by 1033 read => feed constraints.
[2024-05-29 15:15:22] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2024-05-29 15:15:22] [INFO ] Redundant transitions in 114 ms returned []
Running 1075 sub problems to find dead transitions.
[2024-05-29 15:15:23] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 15:15:23] [INFO ] Invariant cache hit.
[2024-05-29 15:15:23] [INFO ] State equation strengthened by 1033 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:15:41] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-29 15:15:41] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2024-05-29 15:15:41] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 15:15:42] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 0 ms to minimize.
[2024-05-29 15:15:42] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-05-29 15:15:42] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2024-05-29 15:15:42] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-29 15:15:43] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-29 15:15:43] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-29 15:15:43] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-29 15:15:43] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-29 15:15:43] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-29 15:15:43] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 15:15:43] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-29 15:15:44] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 15:15:44] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 15:15:44] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 2 ms to minimize.
[2024-05-29 15:15:44] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-29 15:15:44] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 15:15:44] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:15:45] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:15:45] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:15:45] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 15:15:45] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 15:15:45] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:15:45] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:15:45] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-29 15:15:45] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:15:45] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 15:15:45] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 15:15:45] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2024-05-29 15:15:46] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-29 15:15:46] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-05-29 15:15:46] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2024-05-29 15:15:46] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-29 15:15:46] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 15:15:46] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 15:15:46] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-05-29 15:15:47] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 15:15:47] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:15:48] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 15:15:48] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 15:15:48] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 15:15:48] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 15:15:48] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 15:15:49] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2024-05-29 15:15:49] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 15:15:49] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-29 15:15:49] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-29 15:15:49] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 15:15:49] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2024-05-29 15:15:49] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-29 15:15:49] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 15:15:49] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2024-05-29 15:15:50] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-29 15:15:50] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-29 15:15:50] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-29 15:15:50] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-05-29 15:15:50] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2024-05-29 15:15:50] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:15:51] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-05-29 15:15:51] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-05-29 15:15:51] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-29 15:15:51] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-29 15:15:51] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 15:15:51] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-05-29 15:15:52] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-29 15:15:52] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-29 15:15:52] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 15:15:52] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-29 15:15:52] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 15:15:52] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 15:15:52] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2024-05-29 15:15:52] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 15:15:52] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-29 15:15:52] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 15:15:53] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:15:55] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 15:15:55] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 15:15:55] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-29 15:15:55] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 15:15:55] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-29 15:15:56] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 15:15:56] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-29 15:15:56] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-29 15:15:56] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 15:15:56] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-29 15:15:56] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 15:15:56] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 15:15:56] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 15:15:56] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:15:56] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:16:00] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 15:16:00] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:16:03] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 15:16:03] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 15:16:03] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:16:06] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 15:16:06] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 41/1115 variables, and 100 constraints, problems are : Problem set: 0 solved, 1075 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/41 constraints, ReadFeed: 0/1033 constraints, PredecessorRefiner: 1075/41 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1075 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:16:11] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 15:16:11] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 15:16:11] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-29 15:16:11] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-29 15:16:11] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 15:16:11] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:16:11] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 15:16:12] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2024-05-29 15:16:12] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-29 15:16:12] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 15:16:12] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-29 15:16:12] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-05-29 15:16:12] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:16:12] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 15:16:12] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2024-05-29 15:16:13] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-29 15:16:13] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:16:16] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-29 15:16:16] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 15:16:17] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 15:16:17] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:16:20] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 7 (OVERLAPS) 1073/1114 variables, 41/163 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1114 variables, 1032/1195 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1114 variables, 41/1236 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1114/1115 variables, and 1236 constraints, problems are : Problem set: 0 solved, 1075 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1032/1033 constraints, PredecessorRefiner: 1075/41 constraints, Known Traps: 121/121 constraints]
After SMT, in 76079ms problems are : Problem set: 0 solved, 1075 unsolved
Search for dead transitions found 0 dead transitions in 76089ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/130 places, 1085/2231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77273 ms. Remains : 41/130 places, 1085/2231 transitions.
[2024-05-29 15:16:39] [INFO ] Flatten gal took : 54 ms
[2024-05-29 15:16:39] [INFO ] Flatten gal took : 58 ms
[2024-05-29 15:16:39] [INFO ] Input system was already deterministic with 1085 transitions.
RANDOM walk for 40 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-09a-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 15:16:39] [INFO ] Flatten gal took : 58 ms
[2024-05-29 15:16:39] [INFO ] Flatten gal took : 58 ms
[2024-05-29 15:16:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7617251077847907011.gal : 11 ms
[2024-05-29 15:16:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18087955285672912707.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7617251077847907011.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18087955285672912707.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 2231/2231 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 129 transition count 2229
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 129 transition count 2229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 128 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 128 transition count 2227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 127 transition count 2226
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 127 transition count 2226
Applied a total of 6 rules in 21 ms. Remains 127 /130 variables (removed 3) and now considering 2226/2231 (removed 5) transitions.
[2024-05-29 15:16:39] [INFO ] Flow matrix only has 2214 transitions (discarded 12 similar events)
// Phase 1: matrix 2214 rows 127 cols
[2024-05-29 15:16:39] [INFO ] Computed 1 invariants in 13 ms
[2024-05-29 15:16:39] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 15:16:39] [INFO ] Flow matrix only has 2214 transitions (discarded 12 similar events)
[2024-05-29 15:16:39] [INFO ] Invariant cache hit.
[2024-05-29 15:16:40] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:16:40] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Running 2225 sub problems to find dead transitions.
[2024-05-29 15:16:40] [INFO ] Flow matrix only has 2214 transitions (discarded 12 similar events)
[2024-05-29 15:16:40] [INFO ] Invariant cache hit.
[2024-05-29 15:16:40] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:17:30] [INFO ] Deduced a trap composed of 17 places in 654 ms of which 1 ms to minimize.
[2024-05-29 15:17:31] [INFO ] Deduced a trap composed of 13 places in 647 ms of which 1 ms to minimize.
[2024-05-29 15:17:31] [INFO ] Deduced a trap composed of 13 places in 646 ms of which 1 ms to minimize.
[2024-05-29 15:17:32] [INFO ] Deduced a trap composed of 13 places in 656 ms of which 1 ms to minimize.
[2024-05-29 15:17:33] [INFO ] Deduced a trap composed of 13 places in 657 ms of which 1 ms to minimize.
[2024-05-29 15:17:33] [INFO ] Deduced a trap composed of 13 places in 658 ms of which 1 ms to minimize.
[2024-05-29 15:17:34] [INFO ] Deduced a trap composed of 15 places in 665 ms of which 1 ms to minimize.
[2024-05-29 15:17:35] [INFO ] Deduced a trap composed of 13 places in 520 ms of which 1 ms to minimize.
[2024-05-29 15:17:35] [INFO ] Deduced a trap composed of 16 places in 517 ms of which 1 ms to minimize.
[2024-05-29 15:17:36] [INFO ] Deduced a trap composed of 18 places in 528 ms of which 1 ms to minimize.
[2024-05-29 15:17:36] [INFO ] Deduced a trap composed of 13 places in 521 ms of which 1 ms to minimize.
[2024-05-29 15:17:37] [INFO ] Deduced a trap composed of 13 places in 443 ms of which 1 ms to minimize.
[2024-05-29 15:17:37] [INFO ] Deduced a trap composed of 13 places in 530 ms of which 0 ms to minimize.
[2024-05-29 15:17:38] [INFO ] Deduced a trap composed of 13 places in 529 ms of which 1 ms to minimize.
[2024-05-29 15:17:38] [INFO ] Deduced a trap composed of 13 places in 523 ms of which 1 ms to minimize.
[2024-05-29 15:17:39] [INFO ] Deduced a trap composed of 13 places in 446 ms of which 1 ms to minimize.
[2024-05-29 15:17:39] [INFO ] Deduced a trap composed of 13 places in 442 ms of which 1 ms to minimize.
[2024-05-29 15:17:40] [INFO ] Deduced a trap composed of 13 places in 483 ms of which 0 ms to minimize.
[2024-05-29 15:17:40] [INFO ] Deduced a trap composed of 15 places in 476 ms of which 1 ms to minimize.
[2024-05-29 15:17:40] [INFO ] Deduced a trap composed of 13 places in 386 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-29 15:17:41] [INFO ] Deduced a trap composed of 13 places in 395 ms of which 1 ms to minimize.
[2024-05-29 15:17:42] [INFO ] Deduced a trap composed of 15 places in 402 ms of which 0 ms to minimize.
[2024-05-29 15:17:42] [INFO ] Deduced a trap composed of 16 places in 363 ms of which 1 ms to minimize.
[2024-05-29 15:17:42] [INFO ] Deduced a trap composed of 13 places in 349 ms of which 0 ms to minimize.
[2024-05-29 15:17:43] [INFO ] Deduced a trap composed of 16 places in 338 ms of which 0 ms to minimize.
[2024-05-29 15:17:43] [INFO ] Deduced a trap composed of 16 places in 280 ms of which 0 ms to minimize.
[2024-05-29 15:17:44] [INFO ] Deduced a trap composed of 13 places in 347 ms of which 1 ms to minimize.
[2024-05-29 15:17:44] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 1 ms to minimize.
[2024-05-29 15:17:44] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 1 ms to minimize.
[2024-05-29 15:17:44] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 0 ms to minimize.
[2024-05-29 15:17:45] [INFO ] Deduced a trap composed of 16 places in 337 ms of which 1 ms to minimize.
[2024-05-29 15:17:45] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 1 ms to minimize.
[2024-05-29 15:17:45] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 1 ms to minimize.
[2024-05-29 15:17:46] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 1 ms to minimize.
[2024-05-29 15:17:46] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 1 ms to minimize.
[2024-05-29 15:17:46] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2024-05-29 15:17:46] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 1 ms to minimize.
[2024-05-29 15:17:46] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 1 ms to minimize.
SMT process timed out in 66687ms, After SMT, problems are : Problem set: 0 solved, 2225 unsolved
Search for dead transitions found 0 dead transitions in 66711ms
Starting structural reductions in LTL mode, iteration 1 : 127/130 places, 2226/2231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67486 ms. Remains : 127/130 places, 2226/2231 transitions.
[2024-05-29 15:17:47] [INFO ] Flatten gal took : 123 ms
[2024-05-29 15:17:47] [INFO ] Flatten gal took : 133 ms
[2024-05-29 15:17:47] [INFO ] Input system was already deterministic with 2226 transitions.
[2024-05-29 15:17:47] [INFO ] Flatten gal took : 130 ms
[2024-05-29 15:17:47] [INFO ] Flatten gal took : 132 ms
[2024-05-29 15:17:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14690016496133095618.gal : 27 ms
[2024-05-29 15:17:47] [INFO ] Time to serialize properties into /tmp/CTLFireability2647878749775352074.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/CTLFireability14690016496133095618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2647878749775352074.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 2231/2231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 129 transition count 2197
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 96 transition count 2197
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 66 place count 96 transition count 2185
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 90 place count 84 transition count 2185
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 82 transition count 2181
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 82 transition count 2181
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 80 transition count 2177
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 80 transition count 2177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 80 transition count 2174
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 139 place count 61 transition count 2155
Ensure Unique test removed 1031 transitions
Reduce isomorphic transitions removed 1031 transitions.
Iterating post reduction 3 with 1031 rules applied. Total rules applied 1170 place count 61 transition count 1124
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1188 place count 52 transition count 1115
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1197 place count 52 transition count 1106
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 1207 place count 52 transition count 1096
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1227 place count 42 transition count 1086
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1228 place count 41 transition count 1085
Applied a total of 1228 rules in 661 ms. Remains 41 /130 variables (removed 89) and now considering 1085/2231 (removed 1146) transitions.
[2024-05-29 15:18:49] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
// Phase 1: matrix 1074 rows 41 cols
[2024-05-29 15:18:49] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 15:18:49] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 15:18:49] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 15:18:49] [INFO ] Invariant cache hit.
[2024-05-29 15:18:50] [INFO ] State equation strengthened by 1033 read => feed constraints.
[2024-05-29 15:18:50] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-05-29 15:18:50] [INFO ] Redundant transitions in 115 ms returned []
Running 1075 sub problems to find dead transitions.
[2024-05-29 15:18:50] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 15:18:50] [INFO ] Invariant cache hit.
[2024-05-29 15:18:50] [INFO ] State equation strengthened by 1033 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:19:09] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2024-05-29 15:19:09] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-29 15:19:10] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 15:19:10] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 1 ms to minimize.
[2024-05-29 15:19:10] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-29 15:19:10] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-05-29 15:19:11] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2024-05-29 15:19:11] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-29 15:19:11] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 0 ms to minimize.
[2024-05-29 15:19:11] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-29 15:19:11] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-29 15:19:11] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-05-29 15:19:12] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-29 15:19:12] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-29 15:19:12] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-29 15:19:12] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-29 15:19:12] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 15:19:12] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-29 15:19:12] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 15:19:13] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:19:13] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-29 15:19:13] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-29 15:19:13] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 15:19:13] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:19:13] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 15:19:13] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 15:19:13] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 15:19:13] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 15:19:13] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:19:13] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 15:19:14] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2024-05-29 15:19:14] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2024-05-29 15:19:14] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-29 15:19:14] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-29 15:19:14] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 15:19:15] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:19:15] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-29 15:19:15] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:19:15] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:19:15] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:19:17] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 15:19:17] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-29 15:19:17] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:19:17] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-29 15:19:17] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:19:17] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 15:19:17] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 15:19:17] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-29 15:19:17] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-29 15:19:17] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 15:19:17] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-29 15:19:17] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:19:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:19:18] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-29 15:19:18] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-29 15:19:18] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 15:19:18] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2024-05-29 15:19:18] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-29 15:19:19] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2024-05-29 15:19:19] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:19:19] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-29 15:19:19] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-05-29 15:19:19] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-29 15:19:20] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-29 15:19:20] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 15:19:20] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-29 15:19:20] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 4 ms to minimize.
[2024-05-29 15:19:20] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 15:19:20] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 15:19:20] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-29 15:19:20] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 15:19:20] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-29 15:19:21] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2024-05-29 15:19:21] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-29 15:19:21] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:19:21] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:19:21] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:19:23] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 15:19:24] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 15:19:24] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 15:19:24] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2024-05-29 15:19:24] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-29 15:19:24] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-29 15:19:24] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-29 15:19:24] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-29 15:19:24] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 15:19:24] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:19:24] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 15:19:25] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 15:19:25] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-29 15:19:25] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 15:19:25] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:19:29] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 15:19:29] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:19:32] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 15:19:32] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 15:19:32] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:19:35] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 15:19:35] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 41/1115 variables, and 100 constraints, problems are : Problem set: 0 solved, 1075 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/41 constraints, ReadFeed: 0/1033 constraints, PredecessorRefiner: 1075/41 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1075 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:19:39] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-29 15:19:39] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 15:19:39] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-29 15:19:39] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 15:19:39] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:19:40] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-29 15:19:40] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 15:19:40] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-29 15:19:40] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-29 15:19:40] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:19:40] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 15:19:40] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 15:19:40] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:19:41] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-29 15:19:41] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2024-05-29 15:19:41] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 15:19:41] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:19:45] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 15:19:45] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 15:19:45] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-29 15:19:45] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:19:48] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 7 (OVERLAPS) 1073/1114 variables, 41/163 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1114 variables, 1032/1195 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1114 variables, 41/1236 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1114/1115 variables, and 1236 constraints, problems are : Problem set: 0 solved, 1075 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1032/1033 constraints, PredecessorRefiner: 1075/41 constraints, Known Traps: 121/121 constraints]
After SMT, in 76800ms problems are : Problem set: 0 solved, 1075 unsolved
Search for dead transitions found 0 dead transitions in 76810ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/130 places, 1085/2231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77977 ms. Remains : 41/130 places, 1085/2231 transitions.
[2024-05-29 15:20:07] [INFO ] Flatten gal took : 58 ms
[2024-05-29 15:20:07] [INFO ] Flatten gal took : 63 ms
[2024-05-29 15:20:07] [INFO ] Input system was already deterministic with 1085 transitions.
RANDOM walk for 40 steps (0 resets) in 9 ms. (4 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-09a-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 15:20:07] [INFO ] Flatten gal took : 58 ms
[2024-05-29 15:20:07] [INFO ] Flatten gal took : 58 ms
[2024-05-29 15:20:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10182118142890651008.gal : 11 ms
[2024-05-29 15:20:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2407896550557665622.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10182118142890651008.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2407896550557665622.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 2231/2231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 129 transition count 2197
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 96 transition count 2197
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 66 place count 96 transition count 2185
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 90 place count 84 transition count 2185
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 82 transition count 2181
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 82 transition count 2181
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 80 transition count 2177
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 80 transition count 2177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 80 transition count 2174
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 139 place count 61 transition count 2155
Ensure Unique test removed 1031 transitions
Reduce isomorphic transitions removed 1031 transitions.
Iterating post reduction 3 with 1031 rules applied. Total rules applied 1170 place count 61 transition count 1124
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1188 place count 52 transition count 1115
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1197 place count 52 transition count 1106
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 1207 place count 52 transition count 1096
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1227 place count 42 transition count 1086
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1228 place count 41 transition count 1085
Applied a total of 1228 rules in 709 ms. Remains 41 /130 variables (removed 89) and now considering 1085/2231 (removed 1146) transitions.
[2024-05-29 15:20:08] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 15:20:08] [INFO ] Invariant cache hit.
[2024-05-29 15:20:08] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 15:20:08] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 15:20:08] [INFO ] Invariant cache hit.
[2024-05-29 15:20:08] [INFO ] State equation strengthened by 1033 read => feed constraints.
[2024-05-29 15:20:08] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-05-29 15:20:08] [INFO ] Redundant transitions in 73 ms returned []
Running 1075 sub problems to find dead transitions.
[2024-05-29 15:20:08] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 15:20:08] [INFO ] Invariant cache hit.
[2024-05-29 15:20:08] [INFO ] State equation strengthened by 1033 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:20:28] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 15:20:28] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 15:20:29] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 15:20:29] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 1 ms to minimize.
[2024-05-29 15:20:29] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2024-05-29 15:20:29] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2024-05-29 15:20:29] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2024-05-29 15:20:30] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 0 ms to minimize.
[2024-05-29 15:20:30] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-29 15:20:30] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-29 15:20:30] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-29 15:20:30] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-29 15:20:31] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 15:20:31] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 15:20:31] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 15:20:31] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2024-05-29 15:20:31] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 15:20:31] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2024-05-29 15:20:31] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 15:20:32] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:20:32] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-29 15:20:32] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-29 15:20:32] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 15:20:32] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2024-05-29 15:20:32] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 15:20:32] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 15:20:32] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:20:32] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:20:32] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:20:32] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:20:33] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2024-05-29 15:20:33] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 15:20:33] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-29 15:20:33] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-29 15:20:33] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-05-29 15:20:34] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-29 15:20:34] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:20:34] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-29 15:20:34] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 15:20:34] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:20:36] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 15:20:36] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 15:20:36] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-29 15:20:36] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-29 15:20:36] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 15:20:36] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 15:20:36] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 15:20:36] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 15:20:36] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 15:20:36] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 15:20:36] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 15:20:36] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-29 15:20:36] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:20:37] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-29 15:20:37] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-29 15:20:37] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2024-05-29 15:20:37] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-29 15:20:37] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-29 15:20:37] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 15:20:38] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:20:38] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-29 15:20:38] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 15:20:38] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 15:20:38] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2024-05-29 15:20:39] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2024-05-29 15:20:39] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-29 15:20:39] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-29 15:20:39] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 15:20:39] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 15:20:39] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 15:20:39] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 15:20:39] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2024-05-29 15:20:39] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-29 15:20:40] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-29 15:20:40] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 15:20:40] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 15:20:40] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:20:42] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 15:20:42] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-29 15:20:43] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 15:20:43] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-29 15:20:43] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-29 15:20:43] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2024-05-29 15:20:43] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2024-05-29 15:20:43] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-29 15:20:43] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-29 15:20:43] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-29 15:20:43] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 15:20:44] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 15:20:44] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-29 15:20:44] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 15:20:44] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:20:48] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-29 15:20:48] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:20:51] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 15:20:51] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 15:20:51] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:20:54] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 15:20:54] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 41/1115 variables, and 100 constraints, problems are : Problem set: 0 solved, 1075 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/41 constraints, ReadFeed: 0/1033 constraints, PredecessorRefiner: 1075/41 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1075 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:20:58] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-29 15:20:58] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 15:20:58] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-29 15:20:58] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-29 15:20:58] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 15:20:58] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-29 15:20:59] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 15:20:59] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-29 15:20:59] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-29 15:20:59] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 15:20:59] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-29 15:20:59] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 15:20:59] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 15:20:59] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-29 15:20:59] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2024-05-29 15:20:59] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 15:21:00] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:21:03] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 15:21:03] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 15:21:03] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 15:21:04] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 15:21:07] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 7 (OVERLAPS) 1073/1114 variables, 41/163 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1114 variables, 1032/1195 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1114 variables, 41/1236 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1114/1115 variables, and 1236 constraints, problems are : Problem set: 0 solved, 1075 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1032/1033 constraints, PredecessorRefiner: 1075/41 constraints, Known Traps: 121/121 constraints]
After SMT, in 77202ms problems are : Problem set: 0 solved, 1075 unsolved
Search for dead transitions found 0 dead transitions in 77213ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/130 places, 1085/2231 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 78379 ms. Remains : 41/130 places, 1085/2231 transitions.
[2024-05-29 15:21:26] [INFO ] Flatten gal took : 56 ms
[2024-05-29 15:21:26] [INFO ] Flatten gal took : 60 ms
[2024-05-29 15:21:26] [INFO ] Input system was already deterministic with 1085 transitions.
[2024-05-29 15:21:26] [INFO ] Flatten gal took : 60 ms
[2024-05-29 15:21:26] [INFO ] Flatten gal took : 69 ms
[2024-05-29 15:21:26] [INFO ] Time to serialize gal into /tmp/CTLFireability1728578483825563800.gal : 12 ms
[2024-05-29 15:21:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9645438566788986788.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/CTLFireability1728578483825563800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9645438566788986788.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.
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,2067,0.848365,36276,2,1157,5,21348,6,0,1239,10770,0


Converting to forward existential form...Done !
original formula: AF(AG(((((EG((((((EG((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&((p318==1)&&(p3...551
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((((EG((((((EG((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1...608
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t32...354
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.72657,84380,1,0,1193,63881,2199,67,45763,37879,2197
FORMULA StigmergyCommit-PT-09a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 2231/2231 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 128 transition count 2227
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 128 transition count 2227
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 126 transition count 2223
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 126 transition count 2223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 124 transition count 2221
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 124 transition count 2221
Applied a total of 12 rules in 28 ms. Remains 124 /130 variables (removed 6) and now considering 2221/2231 (removed 10) transitions.
[2024-05-29 15:21:31] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
// Phase 1: matrix 2210 rows 124 cols
[2024-05-29 15:21:31] [INFO ] Computed 1 invariants in 17 ms
[2024-05-29 15:21:31] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 15:21:31] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:21:31] [INFO ] Invariant cache hit.
[2024-05-29 15:21:31] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:21:31] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:21:31] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:21:31] [INFO ] Invariant cache hit.
[2024-05-29 15:21:32] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:22:20] [INFO ] Deduced a trap composed of 13 places in 566 ms of which 1 ms to minimize.
[2024-05-29 15:22:20] [INFO ] Deduced a trap composed of 13 places in 575 ms of which 1 ms to minimize.
[2024-05-29 15:22:21] [INFO ] Deduced a trap composed of 13 places in 666 ms of which 1 ms to minimize.
[2024-05-29 15:22:22] [INFO ] Deduced a trap composed of 14 places in 670 ms of which 1 ms to minimize.
[2024-05-29 15:22:22] [INFO ] Deduced a trap composed of 15 places in 648 ms of which 1 ms to minimize.
[2024-05-29 15:22:23] [INFO ] Deduced a trap composed of 13 places in 658 ms of which 1 ms to minimize.
[2024-05-29 15:22:24] [INFO ] Deduced a trap composed of 13 places in 674 ms of which 1 ms to minimize.
[2024-05-29 15:22:24] [INFO ] Deduced a trap composed of 13 places in 661 ms of which 1 ms to minimize.
[2024-05-29 15:22:25] [INFO ] Deduced a trap composed of 13 places in 662 ms of which 1 ms to minimize.
[2024-05-29 15:22:26] [INFO ] Deduced a trap composed of 13 places in 662 ms of which 1 ms to minimize.
[2024-05-29 15:22:26] [INFO ] Deduced a trap composed of 13 places in 635 ms of which 1 ms to minimize.
[2024-05-29 15:22:27] [INFO ] Deduced a trap composed of 13 places in 673 ms of which 1 ms to minimize.
[2024-05-29 15:22:28] [INFO ] Deduced a trap composed of 15 places in 693 ms of which 0 ms to minimize.
[2024-05-29 15:22:28] [INFO ] Deduced a trap composed of 13 places in 653 ms of which 1 ms to minimize.
[2024-05-29 15:22:29] [INFO ] Deduced a trap composed of 13 places in 704 ms of which 1 ms to minimize.
[2024-05-29 15:22:30] [INFO ] Deduced a trap composed of 15 places in 533 ms of which 0 ms to minimize.
[2024-05-29 15:22:30] [INFO ] Deduced a trap composed of 20 places in 537 ms of which 1 ms to minimize.
[2024-05-29 15:22:31] [INFO ] Deduced a trap composed of 17 places in 557 ms of which 1 ms to minimize.
[2024-05-29 15:22:31] [INFO ] Deduced a trap composed of 15 places in 510 ms of which 1 ms to minimize.
[2024-05-29 15:22:32] [INFO ] Deduced a trap composed of 14 places in 465 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:22:33] [INFO ] Deduced a trap composed of 14 places in 487 ms of which 1 ms to minimize.
[2024-05-29 15:22:33] [INFO ] Deduced a trap composed of 13 places in 489 ms of which 0 ms to minimize.
[2024-05-29 15:22:34] [INFO ] Deduced a trap composed of 13 places in 383 ms of which 1 ms to minimize.
[2024-05-29 15:22:34] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 0 ms to minimize.
[2024-05-29 15:22:35] [INFO ] Deduced a trap composed of 13 places in 516 ms of which 1 ms to minimize.
[2024-05-29 15:22:35] [INFO ] Deduced a trap composed of 18 places in 550 ms of which 0 ms to minimize.
[2024-05-29 15:22:36] [INFO ] Deduced a trap composed of 14 places in 540 ms of which 0 ms to minimize.
[2024-05-29 15:22:36] [INFO ] Deduced a trap composed of 13 places in 469 ms of which 1 ms to minimize.
[2024-05-29 15:22:36] [INFO ] Deduced a trap composed of 13 places in 404 ms of which 1 ms to minimize.
SMT process timed out in 65027ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 65050ms
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 2221/2231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65804 ms. Remains : 124/130 places, 2221/2231 transitions.
[2024-05-29 15:22:37] [INFO ] Flatten gal took : 120 ms
[2024-05-29 15:22:37] [INFO ] Flatten gal took : 125 ms
[2024-05-29 15:22:37] [INFO ] Input system was already deterministic with 2221 transitions.
[2024-05-29 15:22:37] [INFO ] Flatten gal took : 120 ms
[2024-05-29 15:22:37] [INFO ] Flatten gal took : 122 ms
[2024-05-29 15:22:37] [INFO ] Time to serialize gal into /tmp/CTLFireability10546376033378082740.gal : 26 ms
[2024-05-29 15:22:37] [INFO ] Time to serialize properties into /tmp/CTLFireability17279689306183936512.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/CTLFireability10546376033378082740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17279689306183936512.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 15:23:07] [INFO ] Flatten gal took : 125 ms
[2024-05-29 15:23:07] [INFO ] Applying decomposition
[2024-05-29 15:23:08] [INFO ] Flatten gal took : 123 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/graph18120844888558123185.txt' '-o' '/tmp/graph18120844888558123185.bin' '-w' '/tmp/graph18120844888558123185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18120844888558123185.bin' '-l' '-1' '-v' '-w' '/tmp/graph18120844888558123185.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:23:08] [INFO ] Decomposing Gal with order
[2024-05-29 15:23:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:23:08] [INFO ] Removed a total of 20556 redundant transitions.
[2024-05-29 15:23:08] [INFO ] Flatten gal took : 253 ms
[2024-05-29 15:23:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 56 ms.
[2024-05-29 15:23:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16133189215917620050.gal : 12 ms
[2024-05-29 15:23:08] [INFO ] Time to serialize properties into /tmp/CTLFireability738070318459259215.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/CTLFireability16133189215917620050.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability738070318459259215.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.72948e+08,27.4816,465784,7481,31,59998,309,2177,5.88485e+06,57,1133,0


Converting to forward existential form...Done !
original formula: E(((EG(!(((((EF((((((i0.u1.p30==1)&&(i0.u5.p66==1))&&((i0.u22.p102==1)&&(i0.u10.p138==1)))&&(((i0.u17.p174==1)&&(i0.u4.p210==1))&&((i0.u3...2015
Detected timeout of ITS tools.
=> equivalent forward existential formula: ([((EY((FwdU(Init,((EG(!(((((E(TRUE U (((((i0.u1.p30==1)&&(i0.u5.p66==1))&&((i0.u22.p102==1)&&(i0.u10.p138==1)))...2080
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 2231/2231 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 128 transition count 2227
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 128 transition count 2227
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 126 transition count 2223
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 126 transition count 2223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 124 transition count 2221
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 124 transition count 2221
Applied a total of 12 rules in 29 ms. Remains 124 /130 variables (removed 6) and now considering 2221/2231 (removed 10) transitions.
[2024-05-29 15:23:38] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:23:38] [INFO ] Invariant cache hit.
[2024-05-29 15:23:39] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 15:23:39] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:23:39] [INFO ] Invariant cache hit.
[2024-05-29 15:23:39] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 15:23:39] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
Running 2220 sub problems to find dead transitions.
[2024-05-29 15:23:39] [INFO ] Flow matrix only has 2210 transitions (discarded 11 similar events)
[2024-05-29 15:23:39] [INFO ] Invariant cache hit.
[2024-05-29 15:23:39] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:24:27] [INFO ] Deduced a trap composed of 13 places in 544 ms of which 1 ms to minimize.
[2024-05-29 15:24:28] [INFO ] Deduced a trap composed of 13 places in 525 ms of which 0 ms to minimize.
[2024-05-29 15:24:29] [INFO ] Deduced a trap composed of 13 places in 620 ms of which 0 ms to minimize.
[2024-05-29 15:24:29] [INFO ] Deduced a trap composed of 14 places in 645 ms of which 1 ms to minimize.
[2024-05-29 15:24:30] [INFO ] Deduced a trap composed of 15 places in 629 ms of which 1 ms to minimize.
[2024-05-29 15:24:30] [INFO ] Deduced a trap composed of 13 places in 631 ms of which 1 ms to minimize.
[2024-05-29 15:24:31] [INFO ] Deduced a trap composed of 13 places in 623 ms of which 0 ms to minimize.
[2024-05-29 15:24:32] [INFO ] Deduced a trap composed of 13 places in 626 ms of which 0 ms to minimize.
[2024-05-29 15:24:32] [INFO ] Deduced a trap composed of 13 places in 645 ms of which 1 ms to minimize.
[2024-05-29 15:24:33] [INFO ] Deduced a trap composed of 13 places in 625 ms of which 1 ms to minimize.
[2024-05-29 15:24:34] [INFO ] Deduced a trap composed of 13 places in 623 ms of which 1 ms to minimize.
[2024-05-29 15:24:34] [INFO ] Deduced a trap composed of 13 places in 637 ms of which 1 ms to minimize.
[2024-05-29 15:24:35] [INFO ] Deduced a trap composed of 15 places in 637 ms of which 1 ms to minimize.
[2024-05-29 15:24:36] [INFO ] Deduced a trap composed of 13 places in 632 ms of which 1 ms to minimize.
[2024-05-29 15:24:36] [INFO ] Deduced a trap composed of 13 places in 632 ms of which 0 ms to minimize.
[2024-05-29 15:24:37] [INFO ] Deduced a trap composed of 15 places in 528 ms of which 1 ms to minimize.
[2024-05-29 15:24:37] [INFO ] Deduced a trap composed of 20 places in 528 ms of which 1 ms to minimize.
[2024-05-29 15:24:38] [INFO ] Deduced a trap composed of 17 places in 522 ms of which 1 ms to minimize.
[2024-05-29 15:24:38] [INFO ] Deduced a trap composed of 15 places in 513 ms of which 0 ms to minimize.
[2024-05-29 15:24:39] [INFO ] Deduced a trap composed of 14 places in 441 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-29 15:24:40] [INFO ] Deduced a trap composed of 14 places in 453 ms of which 1 ms to minimize.
[2024-05-29 15:24:40] [INFO ] Deduced a trap composed of 13 places in 482 ms of which 1 ms to minimize.
[2024-05-29 15:24:41] [INFO ] Deduced a trap composed of 13 places in 392 ms of which 1 ms to minimize.
[2024-05-29 15:24:41] [INFO ] Deduced a trap composed of 13 places in 382 ms of which 0 ms to minimize.
[2024-05-29 15:24:42] [INFO ] Deduced a trap composed of 13 places in 508 ms of which 1 ms to minimize.
[2024-05-29 15:24:42] [INFO ] Deduced a trap composed of 18 places in 498 ms of which 1 ms to minimize.
[2024-05-29 15:24:43] [INFO ] Deduced a trap composed of 14 places in 536 ms of which 0 ms to minimize.
[2024-05-29 15:24:43] [INFO ] Deduced a trap composed of 13 places in 432 ms of which 0 ms to minimize.
[2024-05-29 15:24:43] [INFO ] Deduced a trap composed of 13 places in 380 ms of which 1 ms to minimize.
[2024-05-29 15:24:44] [INFO ] Deduced a trap composed of 13 places in 518 ms of which 1 ms to minimize.
[2024-05-29 15:24:44] [INFO ] Deduced a trap composed of 13 places in 483 ms of which 1 ms to minimize.
SMT process timed out in 65256ms, After SMT, problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 65283ms
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 2221/2231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66020 ms. Remains : 124/130 places, 2221/2231 transitions.
[2024-05-29 15:24:45] [INFO ] Flatten gal took : 111 ms
[2024-05-29 15:24:45] [INFO ] Flatten gal took : 120 ms
[2024-05-29 15:24:45] [INFO ] Input system was already deterministic with 2221 transitions.
[2024-05-29 15:24:45] [INFO ] Flatten gal took : 126 ms
[2024-05-29 15:24:45] [INFO ] Flatten gal took : 131 ms
[2024-05-29 15:24:45] [INFO ] Time to serialize gal into /tmp/CTLFireability7812371272747868913.gal : 26 ms
[2024-05-29 15:24:45] [INFO ] Time to serialize properties into /tmp/CTLFireability441009585113566409.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/CTLFireability7812371272747868913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability441009585113566409.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 15:25:15] [INFO ] Flatten gal took : 127 ms
[2024-05-29 15:25:15] [INFO ] Applying decomposition
[2024-05-29 15:25:16] [INFO ] Flatten gal took : 130 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/graph1980843817999923270.txt' '-o' '/tmp/graph1980843817999923270.bin' '-w' '/tmp/graph1980843817999923270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1980843817999923270.bin' '-l' '-1' '-v' '-w' '/tmp/graph1980843817999923270.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:25:16] [INFO ] Decomposing Gal with order
[2024-05-29 15:25:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:25:16] [INFO ] Removed a total of 20557 redundant transitions.
[2024-05-29 15:25:16] [INFO ] Flatten gal took : 267 ms
[2024-05-29 15:25:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 88 ms.
[2024-05-29 15:25:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9014868438682691617.gal : 14 ms
[2024-05-29 15:25:17] [INFO ] Time to serialize properties into /tmp/CTLFireability1060008550104213234.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/CTLFireability9014868438682691617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1060008550104213234.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 15:25:47] [INFO ] Flatten gal took : 133 ms
[2024-05-29 15:25:47] [INFO ] Flatten gal took : 136 ms
[2024-05-29 15:25:47] [INFO ] Applying decomposition
[2024-05-29 15:25:47] [INFO ] Flatten gal took : 133 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/graph7612524578282397958.txt' '-o' '/tmp/graph7612524578282397958.bin' '-w' '/tmp/graph7612524578282397958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7612524578282397958.bin' '-l' '-1' '-v' '-w' '/tmp/graph7612524578282397958.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:25:48] [INFO ] Decomposing Gal with order
[2024-05-29 15:25:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:25:48] [INFO ] Removed a total of 20552 redundant transitions.
[2024-05-29 15:25:48] [INFO ] Flatten gal took : 314 ms
[2024-05-29 15:25:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 107 ms.
[2024-05-29 15:25:48] [INFO ] Time to serialize gal into /tmp/CTLFireability4381912887344008189.gal : 17 ms
[2024-05-29 15:25:48] [INFO ] Time to serialize properties into /tmp/CTLFireability12494235570664096306.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/CTLFireability4381912887344008189.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12494235570664096306.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 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,3.73931e+08,26.0864,740660,11813,25,309930,294,2481,7.85541e+06,50,1101,0


Converting to forward existential form...Done !
original formula: (E(A(((((AG((((((i5.u46.p30==1)&&(i5.u9.p66==1))&&((i5.u14.p102==1)&&(i5.u23.p138==1)))&&(((i5.u11.p174==1)&&(i5.u28.p210==1))&&((i5.u41....1829
=> equivalent forward existential formula: [(FwdU(EY((Init * !(E(!((E(!(E((((((i5.u46.p30==1)&&(i5.u9.p66==1))&&((i5.u14.p102==1)&&(i5.u23.p138==1)))&&(((i...2731
Reverse transition relation is NOT exact ! Due to transitions t14, t17, t25, t30, t35, t45, t49, t54, t2209, t2211, t2213, t2216, t2219, t2221, t2223, t222...895
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-29 15:27:51] [INFO ] Applying decomposition
[2024-05-29 15:27:51] [INFO ] Flatten gal took : 130 ms
[2024-05-29 15:27:51] [INFO ] Decomposing Gal with order
[2024-05-29 15:27:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:27:51] [INFO ] Removed a total of 20538 redundant transitions.
[2024-05-29 15:27:51] [INFO ] Flatten gal took : 249 ms
[2024-05-29 15:27:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 31 ms.
[2024-05-29 15:27:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9528846956630695765.gal : 15 ms
[2024-05-29 15:27:51] [INFO ] Time to serialize properties into /tmp/CTLFireability1082260952269565310.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/CTLFireability9528846956630695765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1082260952269565310.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 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,3.73931e+08,0.347315,18424,102,165,507,536,2181,546,109,2225,0


Converting to forward existential form...Done !
original formula: (E(A(((((AG((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&&(u6.p210==1))&&((u7.p246==1)&&(u8.p282==1))))&&...1496
=> equivalent forward existential formula: [(FwdU(EY((Init * !(E(!((E(!(E((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&&(u6...2250
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t11, t19, t27, t32, t37, t42, t47, u1.t52, u1.t54, u1.t55, u1.t63, u1.t127, u1.t130, ...844
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,1.2977,24228,1,0,30080,3742,20072,20739,905,13866,63479
FORMULA StigmergyCommit-PT-09a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AX(EX(((((E((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&&(u6.p210==1))&&((u7.p246==1)&&(u8.p282==1)))...509
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(((((E((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)...567
(forward)formula 1,1,1.32557,24492,1,0,30487,4217,20077,21321,905,14725,64021
FORMULA StigmergyCommit-PT-09a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(EX((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&&(u6.p210==1))&&((u7.p246==1)&&(u8.p282==1))))&&((u9.p3...345
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&&(u6.p210==1)...746
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
(forward)formula 2,0,1.35511,25020,1,0,31411,4285,20083,22090,909,14914,67771
FORMULA StigmergyCommit-PT-09a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(AG((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&&(u6.p210==1))&&((u7.p246==1)&&(u8.p282==1))))&&((u9....1485
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(TRUE U !((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&&(u6.p21...1927
(forward)formula 3,0,1.49107,27660,1,0,36245,4529,20097,26713,909,18254,77777
FORMULA StigmergyCommit-PT-09a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((AG((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&&(u6.p210==1))&&((u7.p246==1)&&(u8.p282==1))))&&((u9....516
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&&(u6.p21...579
(forward)formula 4,0,1.49924,28188,1,0,36444,4533,20104,26943,909,18328,78001
FORMULA StigmergyCommit-PT-09a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (E(AF(AX(((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&&(u6.p210==1))&&((u7.p246==1)&&(u8.p282==1))))&&((...698
=> equivalent forward existential formula: ([(FwdU((Init * !(E(!(EG(!(!(EX(!(((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&...1164
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 5,1,1.64032,35052,1,0,50398,5996,20119,41432,910,23902,92382
FORMULA StigmergyCommit-PT-09a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(AG(((((E((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&&(u6.p210==1))&&((u7.p246==1)&&(u8.p282==1))))&...999
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(((((E((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174...1081
(forward)formula 6,0,1.73964,37428,1,0,54569,6037,20122,45286,910,24335,98698
FORMULA StigmergyCommit-PT-09a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(A(A(EF(!((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&&(u6.p210==1))&&((u7.p246==1)&&(u8.p282==1))))&&...1663
=> equivalent forward existential formula: [FwdG((Init * !(!((E(!((EX((((((!(EG(!((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174=...3776
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 7,0,1.96578,42180,1,0,62044,6250,20152,52402,911,25297,108419
FORMULA StigmergyCommit-PT-09a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(((EG(!(((((EF((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&&(u6.p210==1))&&((u7.p246==1)&&(u8.p282==1))...1655
=> equivalent forward existential formula: ([((EY((FwdU(Init,((EG(!(((((E(TRUE U (((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==...3425
(forward)formula 8,0,2.0565,42708,1,0,62886,6426,20159,53430,911,25873,110001
FORMULA StigmergyCommit-PT-09a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(EF(((((EX((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&&(u6.p210==1))&&((u7.p246==1)&&(u8.p282==1))))&&...1805
=> equivalent forward existential formula: [((Init * !(EG(!(E(((!(!((E(!((((((u1.p30==1)&&(u2.p66==1))&&((u3.p102==1)&&(u4.p138==1)))&&(((u5.p174==1)&&(u6....5489
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 9,1,2.15346,42708,1,0,62983,6441,20176,53634,911,25906,110140
FORMULA StigmergyCommit-PT-09a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1924655 ms.

BK_STOP 1716996474235

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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 CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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