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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 19:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 19:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 19:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 11 19:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 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 50M 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 StigmergyElection-PT-10a-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717016263394

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 20:57:44] [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 20:57:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:57:46] [INFO ] Load time of PNML (sax parser for PT used): 1976 ms
[2024-05-29 20:57:46] [INFO ] Transformed 142 places.
[2024-05-29 20:57:47] [INFO ] Transformed 50162 transitions.
[2024-05-29 20:57:47] [INFO ] Found NUPN structural information;
[2024-05-29 20:57:47] [INFO ] Parsed PT model containing 142 places and 50162 transitions and 999212 arcs in 2420 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
Support contains 13 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 2238/2238 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 123 transition count 2209
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 123 transition count 2209
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 113 transition count 2189
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 113 transition count 2189
Applied a total of 58 rules in 53 ms. Remains 113 /142 variables (removed 29) and now considering 2189/2238 (removed 49) transitions.
[2024-05-29 20:57:47] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2024-05-29 20:57:47] [INFO ] Computed 2 invariants in 43 ms
[2024-05-29 20:57:47] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-29 20:57:47] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 20:57:47] [INFO ] Invariant cache hit.
[2024-05-29 20:57:48] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2024-05-29 20:57:48] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned []
Implicit Place search using SMT with State Equation took 1472 ms to find 0 implicit places.
Running 2188 sub problems to find dead transitions.
[2024-05-29 20:57:48] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 20:57:48] [INFO ] Invariant cache hit.
[2024-05-29 20:57:49] [INFO ] State equation strengthened by 2095 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-05-29 20:58:32] [INFO ] Deduced a trap composed of 10 places in 464 ms of which 23 ms to minimize.
[2024-05-29 20:58:33] [INFO ] Deduced a trap composed of 13 places in 547 ms of which 1 ms to minimize.
[2024-05-29 20:58:33] [INFO ] Deduced a trap composed of 12 places in 364 ms of which 1 ms to minimize.
[2024-05-29 20:58:33] [INFO ] Deduced a trap composed of 10 places in 366 ms of which 1 ms to minimize.
[2024-05-29 20:58:34] [INFO ] Deduced a trap composed of 14 places in 416 ms of which 1 ms to minimize.
[2024-05-29 20:58:34] [INFO ] Deduced a trap composed of 10 places in 403 ms of which 1 ms to minimize.
[2024-05-29 20:58:34] [INFO ] Deduced a trap composed of 10 places in 310 ms of which 1 ms to minimize.
[2024-05-29 20:58:35] [INFO ] Deduced a trap composed of 13 places in 337 ms of which 4 ms to minimize.
[2024-05-29 20:58:35] [INFO ] Deduced a trap composed of 12 places in 362 ms of which 1 ms to minimize.
[2024-05-29 20:58:35] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 1 ms to minimize.
[2024-05-29 20:58:36] [INFO ] Deduced a trap composed of 12 places in 359 ms of which 1 ms to minimize.
[2024-05-29 20:58:36] [INFO ] Deduced a trap composed of 10 places in 308 ms of which 1 ms to minimize.
[2024-05-29 20:58:36] [INFO ] Deduced a trap composed of 13 places in 310 ms of which 1 ms to minimize.
[2024-05-29 20:58:37] [INFO ] Deduced a trap composed of 13 places in 392 ms of which 1 ms to minimize.
[2024-05-29 20:58:37] [INFO ] Deduced a trap composed of 10 places in 363 ms of which 2 ms to minimize.
[2024-05-29 20:58:38] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 1 ms to minimize.
[2024-05-29 20:58:38] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 1 ms to minimize.
[2024-05-29 20:58:38] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 0 ms to minimize.
[2024-05-29 20:58:38] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 1 ms to minimize.
[2024-05-29 20:58:38] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-05-29 20:58:39] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 1 ms to minimize.
[2024-05-29 20:58:39] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 1 ms to minimize.
[2024-05-29 20:58:40] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 1 ms to minimize.
[2024-05-29 20:58:40] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:58:40] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 1 ms to minimize.
[2024-05-29 20:58:40] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 0 ms to minimize.
[2024-05-29 20:58:40] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 1 ms to minimize.
[2024-05-29 20:58:41] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 1 ms to minimize.
[2024-05-29 20:58:41] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 1 ms to minimize.
[2024-05-29 20:58:41] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 1 ms to minimize.
[2024-05-29 20:58:41] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:58:42] [INFO ] Deduced a trap composed of 13 places in 365 ms of which 1 ms to minimize.
[2024-05-29 20:58:42] [INFO ] Deduced a trap composed of 13 places in 358 ms of which 0 ms to minimize.
[2024-05-29 20:58:42] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 1 ms to minimize.
[2024-05-29 20:58:43] [INFO ] Deduced a trap composed of 10 places in 324 ms of which 4 ms to minimize.
[2024-05-29 20:58:43] [INFO ] Deduced a trap composed of 10 places in 313 ms of which 1 ms to minimize.
[2024-05-29 20:58:43] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 1 ms to minimize.
[2024-05-29 20:58:44] [INFO ] Deduced a trap composed of 10 places in 422 ms of which 1 ms to minimize.
[2024-05-29 20:58:44] [INFO ] Deduced a trap composed of 12 places in 406 ms of which 0 ms to minimize.
[2024-05-29 20:58:45] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 113/2291 variables, and 42 constraints, problems are : Problem set: 0 solved, 2188 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/113 constraints, ReadFeed: 0/2095 constraints, PredecessorRefiner: 2188/131 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-05-29 20:58:57] [INFO ] Deduced a trap composed of 10 places in 385 ms of which 0 ms to minimize.
[2024-05-29 20:58:58] [INFO ] Deduced a trap composed of 10 places in 318 ms of which 0 ms to minimize.
[2024-05-29 20:58:58] [INFO ] Deduced a trap composed of 12 places in 365 ms of which 1 ms to minimize.
[2024-05-29 20:58:58] [INFO ] Deduced a trap composed of 10 places in 366 ms of which 1 ms to minimize.
[2024-05-29 20:58:59] [INFO ] Deduced a trap composed of 12 places in 359 ms of which 1 ms to minimize.
[2024-05-29 20:58:59] [INFO ] Deduced a trap composed of 10 places in 305 ms of which 0 ms to minimize.
[2024-05-29 20:58:59] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 1 ms to minimize.
[2024-05-29 20:59:00] [INFO ] Deduced a trap composed of 10 places in 318 ms of which 3 ms to minimize.
[2024-05-29 20:59:00] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:59:00] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 1 ms to minimize.
[2024-05-29 20:59:00] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 1 ms to minimize.
[2024-05-29 20:59:01] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:59:01] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 2 ms to minimize.
[2024-05-29 20:59:01] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 1 ms to minimize.
[2024-05-29 20:59:01] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 0 ms to minimize.
[2024-05-29 20:59:02] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 1 ms to minimize.
[2024-05-29 20:59:02] [INFO ] Deduced a trap composed of 10 places in 355 ms of which 1 ms to minimize.
[2024-05-29 20:59:02] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 1 ms to minimize.
[2024-05-29 20:59:02] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 1 ms to minimize.
[2024-05-29 20:59:03] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-05-29 20:59:04] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 0 ms to minimize.
[2024-05-29 20:59:04] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 0 ms to minimize.
[2024-05-29 20:59:04] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 0 ms to minimize.
[2024-05-29 20:59:04] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 1 ms to minimize.
[2024-05-29 20:59:05] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 1 ms to minimize.
[2024-05-29 20:59:05] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 0 ms to minimize.
[2024-05-29 20:59:05] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 0 ms to minimize.
[2024-05-29 20:59:05] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 0 ms to minimize.
[2024-05-29 20:59:05] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:59:06] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:59:06] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:59:06] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 1 ms to minimize.
[2024-05-29 20:59:06] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 0 ms to minimize.
[2024-05-29 20:59:06] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 1 ms to minimize.
[2024-05-29 20:59:06] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 1 ms to minimize.
[2024-05-29 20:59:07] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 1 ms to minimize.
[2024-05-29 20:59:07] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 1 ms to minimize.
[2024-05-29 20:59:07] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 0 ms to minimize.
[2024-05-29 20:59:07] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 1 ms to minimize.
[2024-05-29 20:59:07] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-05-29 20:59:08] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 1 ms to minimize.
[2024-05-29 20:59:09] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2024-05-29 20:59:09] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:59:09] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 0 ms to minimize.
[2024-05-29 20:59:09] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 0 ms to minimize.
[2024-05-29 20:59:09] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-29 20:59:09] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2024-05-29 20:59:10] [INFO ] Deduced a trap composed of 13 places in 346 ms of which 0 ms to minimize.
[2024-05-29 20:59:10] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 0 ms to minimize.
[2024-05-29 20:59:10] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:59:11] [INFO ] Deduced a trap composed of 10 places in 319 ms of which 1 ms to minimize.
[2024-05-29 20:59:11] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 2 ms to minimize.
[2024-05-29 20:59:11] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 0 ms to minimize.
[2024-05-29 20:59:11] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 0 ms to minimize.
[2024-05-29 20:59:11] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:59:11] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2024-05-29 20:59:12] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:59:12] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:59:12] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 1 ms to minimize.
[2024-05-29 20:59:12] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-05-29 20:59:14] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:59:14] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2024-05-29 20:59:14] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 20:59:14] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 ms to minimize.
[2024-05-29 20:59:14] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 20:59:15] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-05-29 20:59:15] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 1 ms to minimize.
[2024-05-29 20:59:15] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 1 ms to minimize.
[2024-05-29 20:59:15] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 0 ms to minimize.
[2024-05-29 20:59:15] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 0 ms to minimize.
[2024-05-29 20:59:16] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 0 ms to minimize.
[2024-05-29 20:59:16] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 0 ms to minimize.
[2024-05-29 20:59:16] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2024-05-29 20:59:16] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:59:16] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2024-05-29 20:59:17] [INFO ] Deduced a trap composed of 13 places in 345 ms of which 1 ms to minimize.
[2024-05-29 20:59:17] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2024-05-29 20:59:17] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:59:17] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 1 ms to minimize.
[2024-05-29 20:59:17] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-05-29 20:59:19] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 1 ms to minimize.
[2024-05-29 20:59:20] [INFO ] Deduced a trap composed of 14 places in 258 ms of which 1 ms to minimize.
[2024-05-29 20:59:20] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 1 ms to minimize.
SMT process timed out in 91302ms, After SMT, problems are : Problem set: 0 solved, 2188 unsolved
Search for dead transitions found 0 dead transitions in 91357ms
Starting structural reductions in LTL mode, iteration 1 : 113/142 places, 2189/2238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92922 ms. Remains : 113/142 places, 2189/2238 transitions.
Support contains 13 out of 113 places after structural reductions.
[2024-05-29 20:59:20] [INFO ] Flatten gal took : 290 ms
[2024-05-29 20:59:21] [INFO ] Flatten gal took : 175 ms
[2024-05-29 20:59:21] [INFO ] Input system was already deterministic with 2189 transitions.
Reduction of identical properties reduced properties to check from 17 to 9
RANDOM walk for 40000 steps (12 resets) in 6754 ms. (5 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
[2024-05-29 20:59:23] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 20:59:23] [INFO ] Invariant cache hit.
[2024-05-29 20:59:23] [INFO ] State equation strengthened by 2095 read => feed constraints.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp15 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/113 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2177/2290 variables, 113/115 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2290 variables, 2094/2209 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2290 variables, 0/2209 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/2291 variables, 1/2210 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2291 variables, 0/2210 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2291 variables, 0/2210 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2291/2291 variables, and 2210 constraints, problems are : Problem set: 3 solved, 2 unsolved in 851 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 2095/2095 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 101/113 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-29 20:59:24] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:59:25] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:59:25] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2177/2290 variables, 113/118 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2290 variables, 2094/2212 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2290 variables, 1/2213 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-29 20:59:26] [INFO ] Deduced a trap composed of 13 places in 434 ms of which 1 ms to minimize.
[2024-05-29 20:59:26] [INFO ] Deduced a trap composed of 11 places in 364 ms of which 0 ms to minimize.
[2024-05-29 20:59:27] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 1 ms to minimize.
[2024-05-29 20:59:27] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 0 ms to minimize.
[2024-05-29 20:59:27] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 0 ms to minimize.
[2024-05-29 20:59:27] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2024-05-29 20:59:28] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 1 ms to minimize.
[2024-05-29 20:59:28] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2024-05-29 20:59:28] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 1 ms to minimize.
[2024-05-29 20:59:28] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2290 variables, 10/2223 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2290 variables, 0/2223 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/2291 variables, 1/2224 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2291 variables, 0/2224 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2291 variables, 0/2224 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2291/2291 variables, and 2224 constraints, problems are : Problem set: 4 solved, 1 unsolved in 4227 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 2095/2095 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 5437ms problems are : Problem set: 4 solved, 1 unsolved
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 8 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-29 20:59:29] [INFO ] Flatten gal took : 137 ms
[2024-05-29 20:59:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyElection-PT-10a-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 20:59:29] [INFO ] Flatten gal took : 170 ms
[2024-05-29 20:59:29] [INFO ] Input system was already deterministic with 2189 transitions.
Computed a total of 22 stabilizing places and 21 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 11 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
[2024-05-29 20:59:29] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 20:59:29] [INFO ] Invariant cache hit.
[2024-05-29 20:59:29] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 20:59:29] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 20:59:29] [INFO ] Invariant cache hit.
[2024-05-29 20:59:30] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2024-05-29 20:59:31] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1359 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/113 places, 2189/2189 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 92 transition count 2169
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 92 transition count 2169
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 82 transition count 2159
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 82 transition count 2159
Applied a total of 60 rules in 31 ms. Remains 82 /112 variables (removed 30) and now considering 2159/2189 (removed 30) transitions.
[2024-05-29 20:59:31] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2024-05-29 20:59:31] [INFO ] Computed 1 invariants in 20 ms
[2024-05-29 20:59:31] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 20:59:31] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 20:59:31] [INFO ] Invariant cache hit.
[2024-05-29 20:59:31] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 20:59:31] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/113 places, 2159/2189 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2090 ms. Remains : 82/113 places, 2159/2189 transitions.
[2024-05-29 20:59:32] [INFO ] Flatten gal took : 115 ms
[2024-05-29 20:59:32] [INFO ] Flatten gal took : 123 ms
[2024-05-29 20:59:32] [INFO ] Input system was already deterministic with 2159 transitions.
[2024-05-29 20:59:32] [INFO ] Flatten gal took : 121 ms
[2024-05-29 20:59:32] [INFO ] Flatten gal took : 122 ms
[2024-05-29 20:59:32] [INFO ] Time to serialize gal into /tmp/CTLFireability7610383680121408386.gal : 74 ms
[2024-05-29 20:59:32] [INFO ] Time to serialize properties into /tmp/CTLFireability2349268078356109001.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7610383680121408386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2349268078356109001.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 21:00:03] [INFO ] Flatten gal took : 121 ms
[2024-05-29 21:00:03] [INFO ] Applying decomposition
[2024-05-29 21:00:03] [INFO ] Flatten gal took : 124 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/graph17028618973054421410.txt' '-o' '/tmp/graph17028618973054421410.bin' '-w' '/tmp/graph17028618973054421410.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17028618973054421410.bin' '-l' '-1' '-v' '-w' '/tmp/graph17028618973054421410.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:00:03] [INFO ] Decomposing Gal with order
[2024-05-29 21:00:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:00:04] [INFO ] Removed a total of 20532 redundant transitions.
[2024-05-29 21:00:04] [INFO ] Flatten gal took : 596 ms
[2024-05-29 21:00:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 165 ms.
[2024-05-29 21:00:04] [INFO ] Time to serialize gal into /tmp/CTLFireability17463895283348171380.gal : 26 ms
[2024-05-29 21:00:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16344614152690658586.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/CTLFireability17463895283348171380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16344614152690658586.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,9.82469e+06,0.52829,18416,3715,40,18604,321,2661,21070,61,1001,0


Converting to forward existential form...Done !
original formula: (AX(EG(((((((u1.p12==1)&&(i6.i0.u20.p26==1))&&((i1.i0.u8.p40==1)&&(u9.p54==1)))&&(((i1.i1.u6.p68==1)&&(i6.i1.u3.p82==1))&&((u15.p96==1)&&...817
=> equivalent forward existential formula: [(FwdU((Init * !(!(EX(!(EG(((((((u1.p12==1)&&(i6.i0.u20.p26==1))&&((i1.i0.u8.p40==1)&&(u9.p54==1)))&&(((i1.i1.u6...1339
Reverse transition relation is NOT exact ! Due to transitions t2139, t2141, t2143, t2145, t2147, t2149, t2151, t2153, t2155, t2157, u9.t33, u9.t34, u1.t48,...581
Using saturation style SCC detection
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
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,2.95036,105780,1,0,238887,520,23853,347731,322,1763,590901
FORMULA StigmergyElection-PT-10a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 10 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
[2024-05-29 21:00:07] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2024-05-29 21:00:07] [INFO ] Computed 2 invariants in 10 ms
[2024-05-29 21:00:07] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-29 21:00:07] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 21:00:07] [INFO ] Invariant cache hit.
[2024-05-29 21:00:08] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2024-05-29 21:00:08] [INFO ] Implicit Places using invariants and state equation in 1055 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1130 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/113 places, 2189/2189 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 92 transition count 2169
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 92 transition count 2169
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 82 transition count 2159
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 82 transition count 2159
Applied a total of 60 rules in 24 ms. Remains 82 /112 variables (removed 30) and now considering 2159/2189 (removed 30) transitions.
[2024-05-29 21:00:08] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2024-05-29 21:00:08] [INFO ] Computed 1 invariants in 16 ms
[2024-05-29 21:00:09] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 21:00:09] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:00:09] [INFO ] Invariant cache hit.
[2024-05-29 21:00:09] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:00:09] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/113 places, 2159/2189 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1942 ms. Remains : 82/113 places, 2159/2189 transitions.
[2024-05-29 21:00:09] [INFO ] Flatten gal took : 135 ms
[2024-05-29 21:00:10] [INFO ] Flatten gal took : 128 ms
[2024-05-29 21:00:10] [INFO ] Input system was already deterministic with 2159 transitions.
[2024-05-29 21:00:10] [INFO ] Flatten gal took : 123 ms
[2024-05-29 21:00:10] [INFO ] Flatten gal took : 123 ms
[2024-05-29 21:00:10] [INFO ] Time to serialize gal into /tmp/CTLFireability4370467841558251756.gal : 25 ms
[2024-05-29 21:00:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1562994424002116437.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/CTLFireability4370467841558251756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1562994424002116437.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 21:00:40] [INFO ] Flatten gal took : 122 ms
[2024-05-29 21:00:40] [INFO ] Applying decomposition
[2024-05-29 21:00:40] [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/graph10861767118156966899.txt' '-o' '/tmp/graph10861767118156966899.bin' '-w' '/tmp/graph10861767118156966899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10861767118156966899.bin' '-l' '-1' '-v' '-w' '/tmp/graph10861767118156966899.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:00:41] [INFO ] Decomposing Gal with order
[2024-05-29 21:00:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:00:41] [INFO ] Removed a total of 20538 redundant transitions.
[2024-05-29 21:00:41] [INFO ] Flatten gal took : 330 ms
[2024-05-29 21:00:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 74 ms.
[2024-05-29 21:00:41] [INFO ] Time to serialize gal into /tmp/CTLFireability13466257755427345967.gal : 18 ms
[2024-05-29 21:00:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5235455899444051288.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/CTLFireability13466257755427345967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5235455899444051288.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.82469e+06,0.431355,18584,3587,21,14702,193,2503,7345,39,439,0


Converting to forward existential form...Done !
original formula: E((E(((AX((((((i5.i1.u28.p12==1)&&(i1.i0.u7.p26==1))&&((i2.i0.u3.p40==1)&&(i3.i0.u5.p54==1)))&&(((i4.i0.u16.p68==1)&&(i3.i1.u24.p82==1))&...2473
=> equivalent forward existential formula: ([(EY(EY(FwdU(Init,(E(((!(EX(!((((((i5.i1.u28.p12==1)&&(i1.i0.u7.p26==1))&&((i2.i0.u3.p40==1)&&(i3.i0.u5.p54==1)...9899
Reverse transition relation is NOT exact ! Due to transitions t2139, t2141, t2143, t2145, t2147, t2149, t2151, t2153, t2155, t2157, i0.t46, i0.t36, i0.t31,...541
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
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
(forward)formula 0,1,4.2529,191764,1,0,517941,263,31943,598402,174,757,787396
FORMULA StigmergyElection-PT-10a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 15 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
[2024-05-29 21:00:46] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2024-05-29 21:00:46] [INFO ] Computed 2 invariants in 15 ms
[2024-05-29 21:00:46] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 21:00:46] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 21:00:46] [INFO ] Invariant cache hit.
[2024-05-29 21:00:46] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2024-05-29 21:00:47] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/113 places, 2189/2189 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 92 transition count 2169
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 92 transition count 2169
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 82 transition count 2159
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 82 transition count 2159
Applied a total of 60 rules in 22 ms. Remains 82 /112 variables (removed 30) and now considering 2159/2189 (removed 30) transitions.
[2024-05-29 21:00:47] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2024-05-29 21:00:47] [INFO ] Computed 1 invariants in 16 ms
[2024-05-29 21:00:47] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 21:00:47] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:00:47] [INFO ] Invariant cache hit.
[2024-05-29 21:00:47] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:00:48] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/113 places, 2159/2189 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1825 ms. Remains : 82/113 places, 2159/2189 transitions.
[2024-05-29 21:00:48] [INFO ] Flatten gal took : 123 ms
[2024-05-29 21:00:48] [INFO ] Flatten gal took : 134 ms
[2024-05-29 21:00:48] [INFO ] Input system was already deterministic with 2159 transitions.
[2024-05-29 21:00:48] [INFO ] Flatten gal took : 156 ms
[2024-05-29 21:00:49] [INFO ] Flatten gal took : 128 ms
[2024-05-29 21:00:49] [INFO ] Time to serialize gal into /tmp/CTLFireability2032529177048087522.gal : 26 ms
[2024-05-29 21:00:49] [INFO ] Time to serialize properties into /tmp/CTLFireability10633716977654676279.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/CTLFireability2032529177048087522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10633716977654676279.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 21:01:19] [INFO ] Flatten gal took : 133 ms
[2024-05-29 21:01:19] [INFO ] Applying decomposition
[2024-05-29 21:01:19] [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/graph9289588113870115336.txt' '-o' '/tmp/graph9289588113870115336.bin' '-w' '/tmp/graph9289588113870115336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9289588113870115336.bin' '-l' '-1' '-v' '-w' '/tmp/graph9289588113870115336.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:01:19] [INFO ] Decomposing Gal with order
[2024-05-29 21:01:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:01:20] [INFO ] Removed a total of 20525 redundant transitions.
[2024-05-29 21:01:20] [INFO ] Flatten gal took : 306 ms
[2024-05-29 21:01:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 96 ms.
[2024-05-29 21:01:20] [INFO ] Time to serialize gal into /tmp/CTLFireability15998596831319454602.gal : 15 ms
[2024-05-29 21:01:20] [INFO ] Time to serialize properties into /tmp/CTLFireability14723574315393395173.ctl : 15 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/CTLFireability15998596831319454602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14723574315393395173.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,9.82469e+06,17.4022,443780,6347,34,180196,838,4593,4.83253e+06,56,2718,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 111 transition count 2168
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 91 transition count 2168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 91 transition count 2158
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 81 transition count 2158
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 81 place count 61 transition count 2138
Iterating global reduction 2 with 20 rules applied. Total rules applied 101 place count 61 transition count 2138
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1124 place count 61 transition count 1115
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1124 place count 61 transition count 1105
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1144 place count 51 transition count 1105
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1154 place count 51 transition count 1095
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 3 with 20 rules applied. Total rules applied 1174 place count 41 transition count 1085
Applied a total of 1174 rules in 907 ms. Remains 41 /113 variables (removed 72) and now considering 1085/2189 (removed 1104) transitions.
[2024-05-29 21:01:51] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
// Phase 1: matrix 1074 rows 41 cols
[2024-05-29 21:01:51] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 21:01:51] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 21:01:51] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 21:01:51] [INFO ] Invariant cache hit.
[2024-05-29 21:01:51] [INFO ] State equation strengthened by 1033 read => feed constraints.
[2024-05-29 21:01:51] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-05-29 21:01:51] [INFO ] Redundant transitions in 111 ms returned []
Running 1075 sub problems to find dead transitions.
[2024-05-29 21:01:51] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 21:01:51] [INFO ] Invariant cache hit.
[2024-05-29 21:01:51] [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 21:02:10] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:02:10] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:02:10] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 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 21:02:12] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-29 21:02:14] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:02:14] [INFO ] Deduced a trap composed of 4 places in 87 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 21:02:15] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 21:02:15] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2024-05-29 21:02:15] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 21:02:15] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:02:19] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 21:02:19] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 21:02:19] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2024-05-29 21:02:19] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2024-05-29 21:02:19] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-29 21:02:20] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2024-05-29 21:02:20] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 21:02:20] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 21:02:20] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 21:02:20] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-29 21:02:20] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:02:23] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 21:02:23] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 21:02:23] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-29 21:02:23] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-29 21:02:23] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 21:02:23] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 21:02:23] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 21:02:23] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 21:02:24] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-29 21:02:24] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2024-05-29 21:02:24] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 21:02:24] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 21:02:24] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-29 21:02:24] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 21:02:24] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2024-05-29 21:02:24] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2024-05-29 21:02:25] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2024-05-29 21:02:25] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-05-29 21:02:25] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 21:02:25] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:02:27] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-29 21:02:27] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 21:02:27] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-29 21:02:27] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2024-05-29 21:02:27] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 21:02:28] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 21:02:28] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:02:28] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-29 21:02:28] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 21:02:28] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:02:30] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 21:02:31] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:02:33] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:02:33] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:02:37] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-29 21:02:37] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 21:02:38] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 21:02:38] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 21:02:38] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
SMT process timed out in 46358ms, After SMT, problems are : Problem set: 0 solved, 1075 unsolved
Search for dead transitions found 0 dead transitions in 46369ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/113 places, 1085/2189 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47783 ms. Remains : 41/113 places, 1085/2189 transitions.
[2024-05-29 21:02:38] [INFO ] Flatten gal took : 56 ms
[2024-05-29 21:02:38] [INFO ] Flatten gal took : 79 ms
[2024-05-29 21:02:38] [INFO ] Input system was already deterministic with 1085 transitions.
[2024-05-29 21:02:38] [INFO ] Flatten gal took : 58 ms
[2024-05-29 21:02:38] [INFO ] Flatten gal took : 58 ms
[2024-05-29 21:02:38] [INFO ] Time to serialize gal into /tmp/CTLFireability11081528980504363767.gal : 12 ms
[2024-05-29 21:02:38] [INFO ] Time to serialize properties into /tmp/CTLFireability15470093397984622295.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/CTLFireability11081528980504363767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15470093397984622295.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(AF((((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))||((p124==0)||(p138==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110=...197
Hit Full ! (commute/partial/dont) 31/180/1054
(forward)formula 0,0,3.31742,66692,1,0,16,45945,20,1,42034,21822,17
FORMULA StigmergyElection-PT-10a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 111 transition count 2168
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 91 transition count 2168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 91 transition count 2158
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 81 transition count 2158
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 81 place count 61 transition count 2138
Iterating global reduction 2 with 20 rules applied. Total rules applied 101 place count 61 transition count 2138
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1124 place count 61 transition count 1115
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1124 place count 61 transition count 1105
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1144 place count 51 transition count 1105
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1154 place count 51 transition count 1095
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 3 with 20 rules applied. Total rules applied 1174 place count 41 transition count 1085
Applied a total of 1174 rules in 430 ms. Remains 41 /113 variables (removed 72) and now considering 1085/2189 (removed 1104) transitions.
[2024-05-29 21:02:42] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 21:02:42] [INFO ] Invariant cache hit.
[2024-05-29 21:02:42] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 21:02:42] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 21:02:42] [INFO ] Invariant cache hit.
[2024-05-29 21:02:42] [INFO ] State equation strengthened by 1033 read => feed constraints.
[2024-05-29 21:02:42] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-05-29 21:02:42] [INFO ] Redundant transitions in 88 ms returned []
Running 1075 sub problems to find dead transitions.
[2024-05-29 21:02:42] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 21:02:42] [INFO ] Invariant cache hit.
[2024-05-29 21:02:42] [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 21:03:01] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 21:03:01] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 21:03:01] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 21:03:01] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 21:03:02] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 21:03:02] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 21:03:02] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 21:03:02] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 21:03:02] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 21:03:02] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 21:03:02] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 2 ms to minimize.
[2024-05-29 21:03:02] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-29 21:03:02] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2024-05-29 21:03:03] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2024-05-29 21:03:03] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-29 21:03:03] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 21:03:03] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-29 21:03:03] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 21:03:03] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-29 21:03:03] [INFO ] Deduced a trap composed of 4 places in 84 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 21:03:03] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 21:03:03] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-29 21:03:03] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 21:03:03] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-29 21:03:03] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 21:03:03] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:03:03] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:03:04] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 21:03:04] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-29 21:03:04] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-29 21:03:04] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 21:03:04] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 21:03:04] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-29 21:03:04] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:03:04] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 21:03:04] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-29 21:03:04] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 21:03:04] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-29 21:03:04] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:03:05] [INFO ] Deduced a trap composed of 4 places in 85 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 21:03:06] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 21:03:06] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2024-05-29 21:03:06] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 21:03:06] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:03:07] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:03:07] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 21:03:07] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 21:03:07] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2024-05-29 21:03:07] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 21:03:07] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-29 21:03:07] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:03:10] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-29 21:03:10] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:03:10] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-29 21:03:10] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-29 21:03:10] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-05-29 21:03:11] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-29 21:03:11] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 21:03:11] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2024-05-29 21:03:11] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 21:03:11] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 21:03:11] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:03:14] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:03:14] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 21:03:14] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-29 21:03:14] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 21:03:14] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 21:03:14] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-29 21:03:14] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:03:15] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 21:03:15] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2024-05-29 21:03:15] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-05-29 21:03:15] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 21:03:15] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 21:03:15] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-29 21:03:15] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 21:03:16] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2024-05-29 21:03:16] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 0 ms to minimize.
[2024-05-29 21:03:16] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-29 21:03:16] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2024-05-29 21:03:16] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
[2024-05-29 21:03:16] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:03:18] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-29 21:03:18] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 21:03:19] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 21:03:19] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 21:03:19] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:03:19] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 21:03:19] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 21:03:19] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-29 21:03:19] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 21:03:19] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:03:22] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-29 21:03:22] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:03:25] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 21:03:25] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 2/97 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 97 constraints, problems are : Problem set: 0 solved, 1075 unsolved in 30031 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: 96/96 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, 96/97 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:03:32] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-29 21:03:32] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-29 21:03:32] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-29 21:03:32] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-29 21:03:32] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-29 21:03:32] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2024-05-29 21:03:33] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 21:03:33] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 21:03:33] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-29 21:03:33] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 21:03:33] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 11/108 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:03:36] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-29 21:03:36] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 21:03:36] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-29 21:03:37] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 21:03:37] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:03:40] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-29 21:03:41] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-05-29 21:03:41] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 7 (OVERLAPS) 1073/1114 variables, 41/157 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1114 variables, 1032/1189 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1114 variables, 41/1230 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 1230 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: 115/115 constraints]
After SMT, in 76206ms problems are : Problem set: 0 solved, 1075 unsolved
Search for dead transitions found 0 dead transitions in 76217ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/113 places, 1085/2189 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77080 ms. Remains : 41/113 places, 1085/2189 transitions.
[2024-05-29 21:03:59] [INFO ] Flatten gal took : 55 ms
[2024-05-29 21:03:59] [INFO ] Flatten gal took : 58 ms
[2024-05-29 21:03:59] [INFO ] Input system was already deterministic with 1085 transitions.
[2024-05-29 21:03:59] [INFO ] Flatten gal took : 56 ms
[2024-05-29 21:03:59] [INFO ] Flatten gal took : 56 ms
[2024-05-29 21:03:59] [INFO ] Time to serialize gal into /tmp/CTLFireability8492446560427828698.gal : 11 ms
[2024-05-29 21:03:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7766398842040217062.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/CTLFireability8492446560427828698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7766398842040217062.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.73559,36272,2,1157,5,21348,6,0,1239,10770,0


Converting to forward existential form...Done !
original formula: AG(AF((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&((p124==1)&&(p138==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110=...197
Hit Full ! (commute/partial/dont) 31/0/1054
(forward)formula 0,0,3.03621,69064,1,0,17,50974,20,1,31923,24638,17
FORMULA StigmergyElection-PT-10a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
[2024-05-29 21:04:02] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2024-05-29 21:04:02] [INFO ] Computed 2 invariants in 7 ms
[2024-05-29 21:04:02] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 21:04:02] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 21:04:02] [INFO ] Invariant cache hit.
[2024-05-29 21:04:02] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2024-05-29 21:04:03] [INFO ] Implicit Places using invariants and state equation in 936 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 992 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/113 places, 2189/2189 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 92 transition count 2169
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 92 transition count 2169
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 82 transition count 2159
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 82 transition count 2159
Applied a total of 60 rules in 21 ms. Remains 82 /112 variables (removed 30) and now considering 2159/2189 (removed 30) transitions.
[2024-05-29 21:04:03] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2024-05-29 21:04:03] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 21:04:03] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 21:04:03] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:04:03] [INFO ] Invariant cache hit.
[2024-05-29 21:04:03] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:04:04] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/113 places, 2159/2189 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1665 ms. Remains : 82/113 places, 2159/2189 transitions.
[2024-05-29 21:04:04] [INFO ] Flatten gal took : 119 ms
[2024-05-29 21:04:04] [INFO ] Flatten gal took : 119 ms
[2024-05-29 21:04:04] [INFO ] Input system was already deterministic with 2159 transitions.
[2024-05-29 21:04:04] [INFO ] Flatten gal took : 118 ms
[2024-05-29 21:04:04] [INFO ] Flatten gal took : 119 ms
[2024-05-29 21:04:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13429628909217547008.gal : 25 ms
[2024-05-29 21:04:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2888430669650436687.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/CTLFireability13429628909217547008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2888430669650436687.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 21:04:35] [INFO ] Flatten gal took : 120 ms
[2024-05-29 21:04:35] [INFO ] Applying decomposition
[2024-05-29 21:04:35] [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/graph7186341903647225372.txt' '-o' '/tmp/graph7186341903647225372.bin' '-w' '/tmp/graph7186341903647225372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7186341903647225372.bin' '-l' '-1' '-v' '-w' '/tmp/graph7186341903647225372.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:04:35] [INFO ] Decomposing Gal with order
[2024-05-29 21:04:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:04:35] [INFO ] Removed a total of 20538 redundant transitions.
[2024-05-29 21:04:35] [INFO ] Flatten gal took : 310 ms
[2024-05-29 21:04:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 64 ms.
[2024-05-29 21:04:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15579919476961030041.gal : 40 ms
[2024-05-29 21:04:36] [INFO ] Time to serialize properties into /tmp/CTLFireability8511283292840695125.ctl : 63 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/CTLFireability15579919476961030041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8511283292840695125.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.82469e+06,0.472976,18584,3587,26,17348,242,2662,11911,42,699,0


Converting to forward existential form...Done !
original formula: AX(AG((EX(EF((((((i3.i1.u27.p12==1)&&(i1.i1.u10.p26==1))&&((i1.i0.u5.p40==1)&&(i3.i1.u16.p54==1)))&&(((i2.i1.u29.p68==1)&&(i4.i0.u19.p82=...475
=> equivalent forward existential formula: [FwdG((FwdU(EY(Init),TRUE) * !(EX(E(TRUE U (((((i3.i1.u27.p12==1)&&(i1.i1.u10.p26==1))&&((i1.i0.u5.p40==1)&&(i3....536
Reverse transition relation is NOT exact ! Due to transitions t2139, t2141, t2143, t2145, t2147, t2149, t2151, t2153, t2155, t2157, i0.t41, i0.t36, i0.t31,...540
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
(forward)formula 0,1,2.32567,95140,1,0,216879,314,32297,273596,182,1103,519786
FORMULA StigmergyElection-PT-10a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 9 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
[2024-05-29 21:04:38] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2024-05-29 21:04:38] [INFO ] Computed 2 invariants in 7 ms
[2024-05-29 21:04:38] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 21:04:38] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 21:04:38] [INFO ] Invariant cache hit.
[2024-05-29 21:04:39] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2024-05-29 21:04:39] [INFO ] Implicit Places using invariants and state equation in 967 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1032 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/113 places, 2189/2189 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 92 transition count 2169
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 92 transition count 2169
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 82 transition count 2159
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 82 transition count 2159
Applied a total of 60 rules in 20 ms. Remains 82 /112 variables (removed 30) and now considering 2159/2189 (removed 30) transitions.
[2024-05-29 21:04:39] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2024-05-29 21:04:39] [INFO ] Computed 1 invariants in 12 ms
[2024-05-29 21:04:39] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 21:04:39] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:04:39] [INFO ] Invariant cache hit.
[2024-05-29 21:04:40] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:04:40] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/113 places, 2159/2189 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1718 ms. Remains : 82/113 places, 2159/2189 transitions.
[2024-05-29 21:04:40] [INFO ] Flatten gal took : 126 ms
[2024-05-29 21:04:40] [INFO ] Flatten gal took : 125 ms
[2024-05-29 21:04:40] [INFO ] Input system was already deterministic with 2159 transitions.
[2024-05-29 21:04:40] [INFO ] Flatten gal took : 118 ms
[2024-05-29 21:04:41] [INFO ] Flatten gal took : 120 ms
[2024-05-29 21:04:41] [INFO ] Time to serialize gal into /tmp/CTLFireability13479871928305198545.gal : 24 ms
[2024-05-29 21:04:41] [INFO ] Time to serialize properties into /tmp/CTLFireability498802666811544988.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/CTLFireability13479871928305198545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability498802666811544988.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 21:05:11] [INFO ] Flatten gal took : 121 ms
[2024-05-29 21:05:11] [INFO ] Applying decomposition
[2024-05-29 21:05:11] [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/graph1197548091198602587.txt' '-o' '/tmp/graph1197548091198602587.bin' '-w' '/tmp/graph1197548091198602587.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1197548091198602587.bin' '-l' '-1' '-v' '-w' '/tmp/graph1197548091198602587.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:05:11] [INFO ] Decomposing Gal with order
[2024-05-29 21:05:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:05:12] [INFO ] Removed a total of 20533 redundant transitions.
[2024-05-29 21:05:12] [INFO ] Flatten gal took : 289 ms
[2024-05-29 21:05:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 98 ms.
[2024-05-29 21:05:12] [INFO ] Time to serialize gal into /tmp/CTLFireability4153985877887078379.gal : 97 ms
[2024-05-29 21:05:12] [INFO ] Time to serialize properties into /tmp/CTLFireability3591918859704817994.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/CTLFireability4153985877887078379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3591918859704817994.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 9 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
[2024-05-29 21:05:42] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2024-05-29 21:05:42] [INFO ] Computed 2 invariants in 10 ms
[2024-05-29 21:05:42] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 21:05:42] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 21:05:42] [INFO ] Invariant cache hit.
[2024-05-29 21:05:42] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2024-05-29 21:05:43] [INFO ] Implicit Places using invariants and state equation in 975 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1033 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/113 places, 2189/2189 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 92 transition count 2169
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 92 transition count 2169
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 82 transition count 2159
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 82 transition count 2159
Applied a total of 60 rules in 18 ms. Remains 82 /112 variables (removed 30) and now considering 2159/2189 (removed 30) transitions.
[2024-05-29 21:05:43] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2024-05-29 21:05:43] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 21:05:43] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 21:05:43] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:05:43] [INFO ] Invariant cache hit.
[2024-05-29 21:05:43] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:05:44] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/113 places, 2159/2189 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1702 ms. Remains : 82/113 places, 2159/2189 transitions.
[2024-05-29 21:05:44] [INFO ] Flatten gal took : 109 ms
[2024-05-29 21:05:44] [INFO ] Flatten gal took : 117 ms
[2024-05-29 21:05:44] [INFO ] Input system was already deterministic with 2159 transitions.
[2024-05-29 21:05:44] [INFO ] Flatten gal took : 118 ms
[2024-05-29 21:05:44] [INFO ] Flatten gal took : 120 ms
[2024-05-29 21:05:44] [INFO ] Time to serialize gal into /tmp/CTLFireability14298769723126822236.gal : 24 ms
[2024-05-29 21:05:44] [INFO ] Time to serialize properties into /tmp/CTLFireability7397933082889058490.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/CTLFireability14298769723126822236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7397933082889058490.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 21:06:15] [INFO ] Flatten gal took : 117 ms
[2024-05-29 21:06:15] [INFO ] Applying decomposition
[2024-05-29 21:06:15] [INFO ] Flatten gal took : 116 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/graph15003326969743503494.txt' '-o' '/tmp/graph15003326969743503494.bin' '-w' '/tmp/graph15003326969743503494.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15003326969743503494.bin' '-l' '-1' '-v' '-w' '/tmp/graph15003326969743503494.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:06:15] [INFO ] Decomposing Gal with order
[2024-05-29 21:06:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:06:15] [INFO ] Removed a total of 20535 redundant transitions.
[2024-05-29 21:06:15] [INFO ] Flatten gal took : 266 ms
[2024-05-29 21:06:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 77 ms.
[2024-05-29 21:06:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9727783566003118204.gal : 12 ms
[2024-05-29 21:06:15] [INFO ] Time to serialize properties into /tmp/CTLFireability6684938445711647595.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/CTLFireability9727783566003118204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6684938445711647595.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,9.82469e+06,0.470696,18612,2508,25,15594,240,2817,21515,44,750,0


Converting to forward existential form...Done !
original formula: AF(((((EF((((((i3.i0.u2.p12==0)||(i0.i0.u6.p26==0))||((i2.i1.u20.p40==0)||(i3.i2.u10.p54==0)))||(((i0.i1.u15.p68==0)||(i3.i2.u18.p82==0))...3128
=> equivalent forward existential formula: [FwdG(Init,!(((((E(TRUE U (((((i3.i0.u2.p12==0)||(i0.i0.u6.p26==0))||((i2.i1.u20.p40==0)||(i3.i2.u10.p54==0)))||...3668
Reverse transition relation is NOT exact ! Due to transitions t2139, t2141, t2143, t2145, t2147, t2149, t2151, t2153, t2155, t2157, i0.i0.t44, i0.i1.t28, i...540
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 0,0,6.90549,317720,1,0,567076,347,24161,2.17802e+06,207,1367,742193
FORMULA StigmergyElection-PT-10a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 111 transition count 2168
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 91 transition count 2168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 91 transition count 2158
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 81 transition count 2158
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 81 place count 61 transition count 2138
Iterating global reduction 2 with 20 rules applied. Total rules applied 101 place count 61 transition count 2138
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1124 place count 61 transition count 1115
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1124 place count 61 transition count 1105
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1144 place count 51 transition count 1105
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1154 place count 51 transition count 1095
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 3 with 20 rules applied. Total rules applied 1174 place count 41 transition count 1085
Applied a total of 1174 rules in 444 ms. Remains 41 /113 variables (removed 72) and now considering 1085/2189 (removed 1104) transitions.
[2024-05-29 21:06:23] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
// Phase 1: matrix 1074 rows 41 cols
[2024-05-29 21:06:23] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 21:06:23] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 21:06:23] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 21:06:23] [INFO ] Invariant cache hit.
[2024-05-29 21:06:23] [INFO ] State equation strengthened by 1033 read => feed constraints.
[2024-05-29 21:06:23] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-29 21:06:23] [INFO ] Redundant transitions in 67 ms returned []
Running 1075 sub problems to find dead transitions.
[2024-05-29 21:06:23] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 21:06:23] [INFO ] Invariant cache hit.
[2024-05-29 21:06: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 21:06:42] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 21:06:42] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 21:06:42] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 21:06:42] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 21:06:42] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 21:06:42] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 21:06:43] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 21:06:43] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:06:43] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 21:06:43] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:06:43] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-29 21:06:43] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2024-05-29 21:06:43] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2024-05-29 21:06:43] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 21:06:43] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 21:06:43] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:06:44] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 21:06:44] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 21:06:44] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 21:06:44] [INFO ] Deduced a trap composed of 4 places in 81 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 21:06:44] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 21:06:44] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 21:06:44] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 21:06:44] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:06:44] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 21:06:44] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 21:06:44] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 21:06:44] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 21:06:44] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-29 21:06:45] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:06:45] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:06:45] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 21:06:45] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 21:06:45] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 21:06:45] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 21:06:45] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 21:06:45] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:06:45] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 21:06:45] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:06:45] [INFO ] Deduced a trap composed of 4 places in 86 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 21:06:47] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 21:06:47] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2024-05-29 21:06:47] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 21:06:47] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 21:06:47] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 21:06:47] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 21:06:47] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 21:06:48] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-05-29 21:06:48] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 21:06:48] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 21:06:48] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:06:50] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 21:06:50] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:06:51] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-29 21:06:51] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2024-05-29 21:06:51] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2024-05-29 21:06:51] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 0 ms to minimize.
[2024-05-29 21:06:51] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-29 21:06:51] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-29 21:06:52] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 21:06:52] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 21:06:52] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:06:54] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 21:06:54] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 21:06:55] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-05-29 21:06:55] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-29 21:06:55] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 21:06:55] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 21:06:55] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 21:06:55] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 21:06:55] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-29 21:06:55] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-05-29 21:06:55] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 21:06:55] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 21:06:56] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 21:06:56] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:06:56] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-05-29 21:06:56] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-29 21:06:56] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-05-29 21:06:56] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 21:06:57] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-29 21:06:57] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:06:59] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-29 21:06:59] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 21:06:59] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-29 21:06:59] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 21:06:59] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-29 21:06:59] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 21:06:59] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 21:06:59] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 21:06:59] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 21:06:59] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:07:02] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:07:02] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:07:05] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 21:07:05] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:07:09] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-29 21:07:09] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-29 21:07:09] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-29 21:07:09] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
SMT process timed out in 46151ms, After SMT, problems are : Problem set: 0 solved, 1075 unsolved
Search for dead transitions found 0 dead transitions in 46161ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/113 places, 1085/2189 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47034 ms. Remains : 41/113 places, 1085/2189 transitions.
[2024-05-29 21:07:09] [INFO ] Flatten gal took : 56 ms
[2024-05-29 21:07:10] [INFO ] Flatten gal took : 61 ms
[2024-05-29 21:07:10] [INFO ] Input system was already deterministic with 1085 transitions.
[2024-05-29 21:07:10] [INFO ] Flatten gal took : 59 ms
[2024-05-29 21:07:10] [INFO ] Flatten gal took : 60 ms
[2024-05-29 21:07:10] [INFO ] Time to serialize gal into /tmp/CTLFireability6857950074286943919.gal : 11 ms
[2024-05-29 21:07:10] [INFO ] Time to serialize properties into /tmp/CTLFireability7858026363377734997.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/CTLFireability6857950074286943919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7858026363377734997.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.805583,36276,2,1157,5,21348,6,0,1239,10770,0


Converting to forward existential form...Done !
original formula: EF(EG(AF((((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))||((p124==0)||(p138==0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!((((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(...205
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, t20...354
(forward)formula 0,1,4.49543,84644,1,0,1187,66928,2185,60,42719,38382,2183
FORMULA StigmergyElection-PT-10a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 111 transition count 2168
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 91 transition count 2168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 91 transition count 2158
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 81 transition count 2158
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 81 place count 61 transition count 2138
Iterating global reduction 2 with 20 rules applied. Total rules applied 101 place count 61 transition count 2138
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1124 place count 61 transition count 1115
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1124 place count 61 transition count 1105
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1144 place count 51 transition count 1105
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1154 place count 51 transition count 1095
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 3 with 20 rules applied. Total rules applied 1174 place count 41 transition count 1085
Applied a total of 1174 rules in 425 ms. Remains 41 /113 variables (removed 72) and now considering 1085/2189 (removed 1104) transitions.
[2024-05-29 21:07:15] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 21:07:15] [INFO ] Invariant cache hit.
[2024-05-29 21:07:15] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 21:07:15] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 21:07:15] [INFO ] Invariant cache hit.
[2024-05-29 21:07:15] [INFO ] State equation strengthened by 1033 read => feed constraints.
[2024-05-29 21:07:15] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-29 21:07:15] [INFO ] Redundant transitions in 69 ms returned []
Running 1075 sub problems to find dead transitions.
[2024-05-29 21:07:15] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 21:07:15] [INFO ] Invariant cache hit.
[2024-05-29 21:07:15] [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 21:07:34] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:07:34] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 21:07:34] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:07:34] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 21:07:34] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 21:07:34] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:07:34] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 21:07:34] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 21:07:34] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 21:07:34] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 21:07:35] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-29 21:07:35] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 21:07:35] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2024-05-29 21:07:35] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 21:07:35] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 21:07:35] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:07:35] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-29 21:07:35] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:07:35] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-29 21:07:35] [INFO ] Deduced a trap composed of 4 places in 82 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 21:07:36] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:07:36] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 21:07:36] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 21:07:36] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-29 21:07:36] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 21:07:36] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 21:07:36] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:07:36] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:07:36] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-29 21:07:36] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:07:36] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 21:07:36] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 21:07:36] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 21:07:37] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-29 21:07:37] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:07:37] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:07:37] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:07:37] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 21:07:37] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 21:07:37] [INFO ] Deduced a trap composed of 4 places in 85 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 21:07:39] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 21:07:39] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 21:07:39] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 21:07:39] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 21:07:39] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 21:07:39] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:07:39] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 21:07:39] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2024-05-29 21:07:39] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 21:07:39] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 21:07:39] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:07:42] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-29 21:07:42] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 21:07:42] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2024-05-29 21:07:42] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2024-05-29 21:07:43] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-05-29 21:07:43] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-05-29 21:07:43] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-05-29 21:07:43] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2024-05-29 21:07:43] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 2 ms to minimize.
[2024-05-29 21:07:43] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 21:07:43] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:07:46] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 21:07:46] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 21:07:46] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-05-29 21:07:46] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-29 21:07:46] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 21:07:47] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-29 21:07:47] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:07:47] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 21:07:47] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 21:07:47] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 21:07:47] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 21:07:47] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 21:07:47] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-29 21:07:47] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:07:48] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 1 ms to minimize.
[2024-05-29 21:07:48] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2024-05-29 21:07:48] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-05-29 21:07:48] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2024-05-29 21:07:48] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 21:07:48] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:07:50] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-29 21:07:50] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2024-05-29 21:07:50] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-29 21:07:51] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-29 21:07:51] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-05-29 21:07:51] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 21:07:51] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 21:07:51] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-29 21:07:51] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 21:07:51] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:07:54] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 21:07:54] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:07:56] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 21:07:57] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:08:01] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2024-05-29 21:08:01] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-29 21:08:01] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-29 21:08:01] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 21:08:01] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:08:01] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
SMT process timed out in 45932ms, After SMT, problems are : Problem set: 0 solved, 1075 unsolved
Search for dead transitions found 0 dead transitions in 45947ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/113 places, 1085/2189 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46786 ms. Remains : 41/113 places, 1085/2189 transitions.
[2024-05-29 21:08:01] [INFO ] Flatten gal took : 53 ms
[2024-05-29 21:08:01] [INFO ] Flatten gal took : 58 ms
[2024-05-29 21:08:01] [INFO ] Input system was already deterministic with 1085 transitions.
[2024-05-29 21:08:01] [INFO ] Flatten gal took : 58 ms
[2024-05-29 21:08:01] [INFO ] Flatten gal took : 57 ms
[2024-05-29 21:08:01] [INFO ] Time to serialize gal into /tmp/CTLFireability12748522858761972969.gal : 11 ms
[2024-05-29 21:08:01] [INFO ] Time to serialize properties into /tmp/CTLFireability16915272447937593341.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/CTLFireability12748522858761972969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16915272447937593341.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&((p124==1)&&(p138==1))) U AG(EF(!(E((((...398
=> equivalent forward existential formula: [(FwdU(Init,(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&((p1...462
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, t20...354
Hit Full ! (commute/partial/dont) 31/180/1054
(forward)formula 0,1,2.74043,51124,1,0,1178,60742,2188,59,55609,32953,2177
FORMULA StigmergyElection-PT-10a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
[2024-05-29 21:08:04] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2024-05-29 21:08:04] [INFO ] Computed 2 invariants in 15 ms
[2024-05-29 21:08:04] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 21:08:04] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 21:08:04] [INFO ] Invariant cache hit.
[2024-05-29 21:08:05] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2024-05-29 21:08:05] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Running 2188 sub problems to find dead transitions.
[2024-05-29 21:08:05] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 21:08:05] [INFO ] Invariant cache hit.
[2024-05-29 21:08:05] [INFO ] State equation strengthened by 2095 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-05-29 21:08:49] [INFO ] Deduced a trap composed of 10 places in 366 ms of which 1 ms to minimize.
[2024-05-29 21:08:49] [INFO ] Deduced a trap composed of 13 places in 355 ms of which 1 ms to minimize.
[2024-05-29 21:08:50] [INFO ] Deduced a trap composed of 12 places in 363 ms of which 1 ms to minimize.
[2024-05-29 21:08:50] [INFO ] Deduced a trap composed of 10 places in 371 ms of which 1 ms to minimize.
[2024-05-29 21:08:50] [INFO ] Deduced a trap composed of 14 places in 363 ms of which 0 ms to minimize.
[2024-05-29 21:08:51] [INFO ] Deduced a trap composed of 10 places in 355 ms of which 1 ms to minimize.
[2024-05-29 21:08:51] [INFO ] Deduced a trap composed of 10 places in 295 ms of which 1 ms to minimize.
[2024-05-29 21:08:51] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 0 ms to minimize.
[2024-05-29 21:08:52] [INFO ] Deduced a trap composed of 12 places in 371 ms of which 1 ms to minimize.
[2024-05-29 21:08:52] [INFO ] Deduced a trap composed of 12 places in 300 ms of which 0 ms to minimize.
[2024-05-29 21:08:52] [INFO ] Deduced a trap composed of 12 places in 347 ms of which 0 ms to minimize.
[2024-05-29 21:08:53] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 0 ms to minimize.
[2024-05-29 21:08:53] [INFO ] Deduced a trap composed of 13 places in 315 ms of which 0 ms to minimize.
[2024-05-29 21:08:53] [INFO ] Deduced a trap composed of 13 places in 360 ms of which 1 ms to minimize.
[2024-05-29 21:08:54] [INFO ] Deduced a trap composed of 10 places in 360 ms of which 1 ms to minimize.
[2024-05-29 21:08:54] [INFO ] Deduced a trap composed of 10 places in 310 ms of which 0 ms to minimize.
[2024-05-29 21:08:54] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
[2024-05-29 21:08:55] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 0 ms to minimize.
[2024-05-29 21:08:55] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 1 ms to minimize.
[2024-05-29 21:08:55] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-05-29 21:08:56] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 1 ms to minimize.
[2024-05-29 21:08:56] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 1 ms to minimize.
[2024-05-29 21:08:56] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 0 ms to minimize.
[2024-05-29 21:08:56] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 21:08:56] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2024-05-29 21:08:57] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 1 ms to minimize.
[2024-05-29 21:08:57] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 1 ms to minimize.
[2024-05-29 21:08:57] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 1 ms to minimize.
[2024-05-29 21:08:57] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 0 ms to minimize.
[2024-05-29 21:08:58] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 1 ms to minimize.
[2024-05-29 21:08:58] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 0 ms to minimize.
[2024-05-29 21:08:58] [INFO ] Deduced a trap composed of 13 places in 370 ms of which 1 ms to minimize.
[2024-05-29 21:08:58] [INFO ] Deduced a trap composed of 13 places in 355 ms of which 1 ms to minimize.
[2024-05-29 21:08:59] [INFO ] Deduced a trap composed of 13 places in 313 ms of which 0 ms to minimize.
[2024-05-29 21:08:59] [INFO ] Deduced a trap composed of 10 places in 305 ms of which 1 ms to minimize.
[2024-05-29 21:08:59] [INFO ] Deduced a trap composed of 10 places in 306 ms of which 0 ms to minimize.
[2024-05-29 21:09:00] [INFO ] Deduced a trap composed of 13 places in 422 ms of which 1 ms to minimize.
[2024-05-29 21:09:00] [INFO ] Deduced a trap composed of 10 places in 422 ms of which 0 ms to minimize.
[2024-05-29 21:09:01] [INFO ] Deduced a trap composed of 12 places in 416 ms of which 1 ms to minimize.
[2024-05-29 21:09:01] [INFO ] Deduced a trap composed of 13 places in 420 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 113/2291 variables, and 42 constraints, problems are : Problem set: 0 solved, 2188 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/113 constraints, ReadFeed: 0/2095 constraints, PredecessorRefiner: 2188/131 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-05-29 21:09:14] [INFO ] Deduced a trap composed of 10 places in 379 ms of which 1 ms to minimize.
[2024-05-29 21:09:14] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 1 ms to minimize.
[2024-05-29 21:09:15] [INFO ] Deduced a trap composed of 12 places in 376 ms of which 1 ms to minimize.
[2024-05-29 21:09:15] [INFO ] Deduced a trap composed of 10 places in 370 ms of which 1 ms to minimize.
[2024-05-29 21:09:15] [INFO ] Deduced a trap composed of 12 places in 368 ms of which 1 ms to minimize.
[2024-05-29 21:09:16] [INFO ] Deduced a trap composed of 10 places in 313 ms of which 0 ms to minimize.
[2024-05-29 21:09:16] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 1 ms to minimize.
[2024-05-29 21:09:16] [INFO ] Deduced a trap composed of 10 places in 303 ms of which 1 ms to minimize.
[2024-05-29 21:09:17] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 0 ms to minimize.
[2024-05-29 21:09:17] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 0 ms to minimize.
[2024-05-29 21:09:17] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 1 ms to minimize.
[2024-05-29 21:09:17] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 0 ms to minimize.
[2024-05-29 21:09:18] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 0 ms to minimize.
[2024-05-29 21:09:18] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 0 ms to minimize.
[2024-05-29 21:09:18] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 1 ms to minimize.
[2024-05-29 21:09:18] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 0 ms to minimize.
[2024-05-29 21:09:19] [INFO ] Deduced a trap composed of 10 places in 366 ms of which 1 ms to minimize.
[2024-05-29 21:09:19] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 1 ms to minimize.
[2024-05-29 21:09:19] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 0 ms to minimize.
[2024-05-29 21:09:19] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-05-29 21:09:20] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 1 ms to minimize.
[2024-05-29 21:09:20] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 0 ms to minimize.
[2024-05-29 21:09:21] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 1 ms to minimize.
[2024-05-29 21:09:21] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 1 ms to minimize.
[2024-05-29 21:09:21] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 1 ms to minimize.
[2024-05-29 21:09:21] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 1 ms to minimize.
[2024-05-29 21:09:22] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 1 ms to minimize.
[2024-05-29 21:09:22] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 1 ms to minimize.
[2024-05-29 21:09:22] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2024-05-29 21:09:22] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 0 ms to minimize.
[2024-05-29 21:09:22] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-05-29 21:09:22] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 0 ms to minimize.
[2024-05-29 21:09:23] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 0 ms to minimize.
[2024-05-29 21:09:23] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
[2024-05-29 21:09:23] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 0 ms to minimize.
[2024-05-29 21:09:23] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
[2024-05-29 21:09:23] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 0 ms to minimize.
[2024-05-29 21:09:24] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 ms to minimize.
[2024-05-29 21:09:24] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 1 ms to minimize.
[2024-05-29 21:09:24] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-05-29 21:09:25] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 1 ms to minimize.
[2024-05-29 21:09:25] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 0 ms to minimize.
[2024-05-29 21:09:25] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2024-05-29 21:09:26] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 1 ms to minimize.
[2024-05-29 21:09:26] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 1 ms to minimize.
[2024-05-29 21:09:26] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-05-29 21:09:26] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2024-05-29 21:09:26] [INFO ] Deduced a trap composed of 13 places in 364 ms of which 0 ms to minimize.
[2024-05-29 21:09:27] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 1 ms to minimize.
[2024-05-29 21:09:27] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 21:09:27] [INFO ] Deduced a trap composed of 10 places in 319 ms of which 1 ms to minimize.
[2024-05-29 21:09:27] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 0 ms to minimize.
[2024-05-29 21:09:28] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 0 ms to minimize.
[2024-05-29 21:09:28] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 0 ms to minimize.
[2024-05-29 21:09:28] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 1 ms to minimize.
[2024-05-29 21:09:28] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2024-05-29 21:09:28] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2024-05-29 21:09:28] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 0 ms to minimize.
[2024-05-29 21:09:29] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 1 ms to minimize.
[2024-05-29 21:09:29] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-05-29 21:09:30] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 21:09:31] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2024-05-29 21:09:31] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-05-29 21:09:31] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 0 ms to minimize.
[2024-05-29 21:09:31] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2024-05-29 21:09:31] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2024-05-29 21:09:31] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 1 ms to minimize.
[2024-05-29 21:09:32] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 0 ms to minimize.
[2024-05-29 21:09:32] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 1 ms to minimize.
[2024-05-29 21:09:32] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2024-05-29 21:09:32] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 0 ms to minimize.
[2024-05-29 21:09:32] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 0 ms to minimize.
[2024-05-29 21:09:32] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2024-05-29 21:09:33] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:09:33] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2024-05-29 21:09:33] [INFO ] Deduced a trap composed of 13 places in 348 ms of which 1 ms to minimize.
[2024-05-29 21:09:33] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2024-05-29 21:09:34] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2024-05-29 21:09:34] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 1 ms to minimize.
[2024-05-29 21:09:34] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-05-29 21:09:36] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 0 ms to minimize.
[2024-05-29 21:09:36] [INFO ] Deduced a trap composed of 14 places in 264 ms of which 1 ms to minimize.
[2024-05-29 21:09:36] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 0 ms to minimize.
[2024-05-29 21:09:37] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
[2024-05-29 21:09:37] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
SMT process timed out in 91644ms, After SMT, problems are : Problem set: 0 solved, 2188 unsolved
Search for dead transitions found 0 dead transitions in 91666ms
Finished structural reductions in LTL mode , in 1 iterations and 92526 ms. Remains : 113/113 places, 2189/2189 transitions.
[2024-05-29 21:09:37] [INFO ] Flatten gal took : 110 ms
[2024-05-29 21:09:37] [INFO ] Flatten gal took : 118 ms
[2024-05-29 21:09:37] [INFO ] Input system was already deterministic with 2189 transitions.
[2024-05-29 21:09:37] [INFO ] Flatten gal took : 116 ms
[2024-05-29 21:09:38] [INFO ] Flatten gal took : 118 ms
[2024-05-29 21:09:38] [INFO ] Time to serialize gal into /tmp/CTLFireability10866087890333085015.gal : 25 ms
[2024-05-29 21:09:38] [INFO ] Time to serialize properties into /tmp/CTLFireability7326540819886483400.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/CTLFireability10866087890333085015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7326540819886483400.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 21:10:08] [INFO ] Flatten gal took : 119 ms
[2024-05-29 21:10:08] [INFO ] Applying decomposition
[2024-05-29 21:10:08] [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/graph12394641823848100288.txt' '-o' '/tmp/graph12394641823848100288.bin' '-w' '/tmp/graph12394641823848100288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12394641823848100288.bin' '-l' '-1' '-v' '-w' '/tmp/graph12394641823848100288.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:10:08] [INFO ] Decomposing Gal with order
[2024-05-29 21:10:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:10:09] [INFO ] Removed a total of 20563 redundant transitions.
[2024-05-29 21:10:09] [INFO ] Flatten gal took : 280 ms
[2024-05-29 21:10:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 81 ms.
[2024-05-29 21:10:09] [INFO ] Time to serialize gal into /tmp/CTLFireability2218307238936307900.gal : 12 ms
[2024-05-29 21:10:09] [INFO ] Time to serialize properties into /tmp/CTLFireability4388060560681264770.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/CTLFireability2218307238936307900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4388060560681264770.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 15 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
[2024-05-29 21:10:39] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 21:10:39] [INFO ] Invariant cache hit.
[2024-05-29 21:10:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 21:10:39] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 21:10:39] [INFO ] Invariant cache hit.
[2024-05-29 21:10:39] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2024-05-29 21:10:40] [INFO ] Implicit Places using invariants and state equation in 992 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1051 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/113 places, 2189/2189 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 92 transition count 2169
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 92 transition count 2169
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 82 transition count 2159
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 82 transition count 2159
Applied a total of 60 rules in 18 ms. Remains 82 /112 variables (removed 30) and now considering 2159/2189 (removed 30) transitions.
[2024-05-29 21:10:40] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2024-05-29 21:10:40] [INFO ] Computed 1 invariants in 14 ms
[2024-05-29 21:10:40] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 21:10:40] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:10:40] [INFO ] Invariant cache hit.
[2024-05-29 21:10:40] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:10:40] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/113 places, 2159/2189 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1743 ms. Remains : 82/113 places, 2159/2189 transitions.
[2024-05-29 21:10:41] [INFO ] Flatten gal took : 110 ms
[2024-05-29 21:10:41] [INFO ] Flatten gal took : 121 ms
[2024-05-29 21:10:41] [INFO ] Input system was already deterministic with 2159 transitions.
[2024-05-29 21:10:41] [INFO ] Flatten gal took : 117 ms
[2024-05-29 21:10:41] [INFO ] Flatten gal took : 118 ms
[2024-05-29 21:10:41] [INFO ] Time to serialize gal into /tmp/CTLFireability6648212830179578284.gal : 24 ms
[2024-05-29 21:10:41] [INFO ] Time to serialize properties into /tmp/CTLFireability12419185401324003819.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/CTLFireability6648212830179578284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12419185401324003819.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 21:11:11] [INFO ] Flatten gal took : 120 ms
[2024-05-29 21:11:11] [INFO ] Applying decomposition
[2024-05-29 21:11:12] [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/graph419545300538574008.txt' '-o' '/tmp/graph419545300538574008.bin' '-w' '/tmp/graph419545300538574008.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph419545300538574008.bin' '-l' '-1' '-v' '-w' '/tmp/graph419545300538574008.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:11:12] [INFO ] Decomposing Gal with order
[2024-05-29 21:11:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:11:12] [INFO ] Removed a total of 20537 redundant transitions.
[2024-05-29 21:11:12] [INFO ] Flatten gal took : 262 ms
[2024-05-29 21:11:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 60 ms.
[2024-05-29 21:11:12] [INFO ] Time to serialize gal into /tmp/CTLFireability9575022304742141626.gal : 13 ms
[2024-05-29 21:11:12] [INFO ] Time to serialize properties into /tmp/CTLFireability1247515410498262324.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/CTLFireability9575022304742141626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1247515410498262324.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,9.82469e+06,0.454554,18488,2409,40,11595,231,2593,19071,57,620,0


Converting to forward existential form...Done !
original formula: AF((EG(AX((((((i0.i0.i0.u8.p12==0)||(u4.p26==0))||((i0.i1.i0.u22.p40==0)||(i4.u16.p54==0)))||(((u12.p68==0)||(i4.u3.p82==0))||((i4.u6.p96...443
=> equivalent forward existential formula: [FwdG(Init,!((EG(!(EX(!((((((i0.i0.i0.u8.p12==0)||(u4.p26==0))||((i0.i1.i0.u22.p40==0)||(i4.u16.p54==0)))||(((u1...500
Reverse transition relation is NOT exact ! Due to transitions t2139, t2141, t2143, t2145, t2147, t2149, t2151, t2153, t2155, t2157, u4.t43, u4.t44, u12.t28...566
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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 a local 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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 a local 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
(forward)formula 0,0,8.11962,381748,1,0,515932,460,26454,3.28514e+06,304,1412,649364
FORMULA StigmergyElection-PT-10a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 111 transition count 2168
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 91 transition count 2168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 91 transition count 2158
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 81 transition count 2158
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 81 place count 61 transition count 2138
Iterating global reduction 2 with 20 rules applied. Total rules applied 101 place count 61 transition count 2138
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1124 place count 61 transition count 1115
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1124 place count 61 transition count 1105
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1144 place count 51 transition count 1105
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1154 place count 51 transition count 1095
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 3 with 20 rules applied. Total rules applied 1174 place count 41 transition count 1085
Applied a total of 1174 rules in 447 ms. Remains 41 /113 variables (removed 72) and now considering 1085/2189 (removed 1104) transitions.
[2024-05-29 21:11:21] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
// Phase 1: matrix 1074 rows 41 cols
[2024-05-29 21:11:21] [INFO ] Computed 1 invariants in 14 ms
[2024-05-29 21:11:21] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 21:11:21] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 21:11:21] [INFO ] Invariant cache hit.
[2024-05-29 21:11:21] [INFO ] State equation strengthened by 1033 read => feed constraints.
[2024-05-29 21:11:21] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-29 21:11:21] [INFO ] Redundant transitions in 70 ms returned []
Running 1075 sub problems to find dead transitions.
[2024-05-29 21:11:21] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 21:11:21] [INFO ] Invariant cache hit.
[2024-05-29 21:11:21] [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 21:11:40] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 21:11:40] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 21:11:40] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 21:11:40] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 21:11:40] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:11:40] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:11:40] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:11:40] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 21:11:41] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 21:11:41] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:11:41] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-29 21:11:41] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2024-05-29 21:11:41] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-29 21:11:41] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 21:11:41] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:11:41] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 21:11:42] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-29 21:11:42] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 21:11:42] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:11:42] [INFO ] Deduced a trap composed of 4 places in 80 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 21:11:42] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-29 21:11:42] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 21:11:42] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 21:11:42] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 21:11:42] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:11:42] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-29 21:11:42] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 21:11:42] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 21:11:42] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:11:42] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 21:11:43] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 21:11:43] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 21:11:43] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 21:11:43] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-29 21:11:43] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:11:43] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-29 21:11:43] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 21:11:43] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 21:11:43] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 21:11:43] [INFO ] Deduced a trap composed of 4 places in 78 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 21:11:45] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 21:11:45] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 21:11:45] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 21:11:45] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 21:11:45] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 21:11:45] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 21:11:45] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 21:11:46] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2024-05-29 21:11:46] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 21:11:46] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-29 21:11:46] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:11:48] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-29 21:11:48] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:11:49] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2024-05-29 21:11:49] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-29 21:11:49] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2024-05-29 21:11:49] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2024-05-29 21:11:49] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-29 21:11:50] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 21:11:50] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 21:11:50] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-29 21:11:50] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:11:52] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-29 21:11:52] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 21:11:53] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-29 21:11:53] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2024-05-29 21:11:53] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 21:11:53] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 21:11:53] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 21:11:53] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 21:11:53] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-29 21:11:53] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-05-29 21:11:53] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 21:11:54] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 21:11:54] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 21:11:54] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 21:11:54] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-05-29 21:11:54] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2024-05-29 21:11:54] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2024-05-29 21:11:55] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-29 21:11:55] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-29 21:11:55] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:11:57] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2024-05-29 21:11:57] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-29 21:11:57] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:11:57] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 21:11:57] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-29 21:11:57] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 21:11:57] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-29 21:11:57] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-29 21:11:57] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 21:11:57] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:12:00] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-29 21:12:00] [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, 2/95 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:12:03] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 21:12:03] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:12:07] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 21:12:07] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-29 21:12:07] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:12:07] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
SMT process timed out in 45906ms, After SMT, problems are : Problem set: 0 solved, 1075 unsolved
Search for dead transitions found 0 dead transitions in 45918ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/113 places, 1085/2189 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46798 ms. Remains : 41/113 places, 1085/2189 transitions.
[2024-05-29 21:12:07] [INFO ] Flatten gal took : 56 ms
[2024-05-29 21:12:07] [INFO ] Flatten gal took : 60 ms
[2024-05-29 21:12:08] [INFO ] Input system was already deterministic with 1085 transitions.
[2024-05-29 21:12:08] [INFO ] Flatten gal took : 59 ms
[2024-05-29 21:12:08] [INFO ] Flatten gal took : 62 ms
[2024-05-29 21:12:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16678497103271890834.gal : 12 ms
[2024-05-29 21:12:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15710051505183645723.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/CTLFireability16678497103271890834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15710051505183645723.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(EF((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&((p124==1)&&(p138==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))...194
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, t20...354
(forward)formula 0,1,8.09161,164372,1,0,1233,95230,2185,100,44344,65220,2253
FORMULA StigmergyElection-PT-10a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 111 transition count 2168
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 91 transition count 2168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 91 transition count 2158
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 81 transition count 2158
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 81 place count 61 transition count 2138
Iterating global reduction 2 with 20 rules applied. Total rules applied 101 place count 61 transition count 2138
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1124 place count 61 transition count 1115
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1124 place count 61 transition count 1105
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1144 place count 51 transition count 1105
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1154 place count 51 transition count 1095
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 3 with 20 rules applied. Total rules applied 1174 place count 41 transition count 1085
Applied a total of 1174 rules in 416 ms. Remains 41 /113 variables (removed 72) and now considering 1085/2189 (removed 1104) transitions.
[2024-05-29 21:12:16] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 21:12:16] [INFO ] Invariant cache hit.
[2024-05-29 21:12:16] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 21:12:16] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 21:12:16] [INFO ] Invariant cache hit.
[2024-05-29 21:12:17] [INFO ] State equation strengthened by 1033 read => feed constraints.
[2024-05-29 21:12:17] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-29 21:12:17] [INFO ] Redundant transitions in 76 ms returned []
Running 1075 sub problems to find dead transitions.
[2024-05-29 21:12:17] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
[2024-05-29 21:12:17] [INFO ] Invariant cache hit.
[2024-05-29 21:12:17] [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 21:12:35] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 21:12:36] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 21:12:36] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 21:12:36] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 21:12:36] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 21:12:36] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 21:12:36] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 21:12:36] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:12:36] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 21:12:36] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:12:36] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-29 21:12:36] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 21:12:37] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 21:12:37] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 21:12:37] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-29 21:12:37] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:12:37] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 21:12:37] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 21:12:37] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:12:37] [INFO ] Deduced a trap composed of 4 places in 82 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 21:12:37] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-29 21:12:37] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 21:12:37] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 21:12:37] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 21:12:38] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 21:12:38] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 21:12:38] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 21:12:38] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 21:12:38] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:12:38] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-29 21:12:38] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:12:38] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 21:12:38] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 21:12:38] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 21:12:38] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 21:12:38] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-29 21:12:38] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 21:12:38] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-29 21:12:39] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 21:12:39] [INFO ] Deduced a trap composed of 4 places in 81 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 21:12:40] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 21:12:40] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2024-05-29 21:12:40] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 21:12:41] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:12:41] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:12:41] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 21:12:41] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:12:41] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2024-05-29 21:12:41] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 21:12:41] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-29 21:12:41] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:12:44] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-29 21:12:44] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 21:12:44] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2024-05-29 21:12:44] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2024-05-29 21:12:44] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-29 21:12:45] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-29 21:12:45] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 21:12:45] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-29 21:12:45] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 21:12:45] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 21:12:45] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:12:48] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 21:12:48] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 21:12:48] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 21:12:48] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-29 21:12:48] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-29 21:12:48] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:12:48] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 21:12:48] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 21:12:49] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2024-05-29 21:12:49] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-29 21:12:49] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 21:12:49] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 21:12:49] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:12:49] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 21:12:49] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:12:52] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2024-05-29 21:12:52] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2024-05-29 21:12:52] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:12:52] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 21:12:52] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 21:12:53] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 21:12:53] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 21:12:53] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 21:12:53] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 21:12:53] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:12:55] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 21:12:56] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:12:58] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 21:12:58] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:13:02] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2024-05-29 21:13:03] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 21:13:03] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-29 21:13:03] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
SMT process timed out in 45947ms, After SMT, problems are : Problem set: 0 solved, 1075 unsolved
Search for dead transitions found 0 dead transitions in 45958ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/113 places, 1085/2189 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46798 ms. Remains : 41/113 places, 1085/2189 transitions.
[2024-05-29 21:13:03] [INFO ] Flatten gal took : 55 ms
[2024-05-29 21:13:03] [INFO ] Flatten gal took : 60 ms
[2024-05-29 21:13:03] [INFO ] Input system was already deterministic with 1085 transitions.
[2024-05-29 21:13:03] [INFO ] Flatten gal took : 59 ms
[2024-05-29 21:13:03] [INFO ] Flatten gal took : 59 ms
[2024-05-29 21:13:03] [INFO ] Time to serialize gal into /tmp/CTLFireability6421221612859208943.gal : 12 ms
[2024-05-29 21:13:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7353057654285292275.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/CTLFireability6421221612859208943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7353057654285292275.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.790286,36276,2,1157,5,21348,6,0,1239,10770,0


Converting to forward existential form...Done !
original formula: EG(AG(EF(((E((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&((p124==1)&&(p138==1))) U ((...771
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U ((E((((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p9...1099
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, t20...354
(forward)formula 0,0,8.23939,169916,1,0,1280,116446,2196,126,42249,75951,2353
FORMULA StigmergyElection-PT-10a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 5 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
[2024-05-29 21:13:11] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2024-05-29 21:13:11] [INFO ] Computed 2 invariants in 13 ms
[2024-05-29 21:13:11] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 21:13:11] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 21:13:11] [INFO ] Invariant cache hit.
[2024-05-29 21:13:12] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2024-05-29 21:13:12] [INFO ] Implicit Places using invariants and state equation in 991 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1054 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/113 places, 2189/2189 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 92 transition count 2169
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 92 transition count 2169
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 82 transition count 2159
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 82 transition count 2159
Applied a total of 60 rules in 18 ms. Remains 82 /112 variables (removed 30) and now considering 2159/2189 (removed 30) transitions.
[2024-05-29 21:13:12] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2024-05-29 21:13:12] [INFO ] Computed 1 invariants in 15 ms
[2024-05-29 21:13:12] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 21:13:13] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:13:13] [INFO ] Invariant cache hit.
[2024-05-29 21:13:13] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:13:13] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/113 places, 2159/2189 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1742 ms. Remains : 82/113 places, 2159/2189 transitions.
[2024-05-29 21:13:13] [INFO ] Flatten gal took : 112 ms
[2024-05-29 21:13:13] [INFO ] Flatten gal took : 122 ms
[2024-05-29 21:13:14] [INFO ] Input system was already deterministic with 2159 transitions.
[2024-05-29 21:13:14] [INFO ] Flatten gal took : 119 ms
[2024-05-29 21:13:14] [INFO ] Flatten gal took : 120 ms
[2024-05-29 21:13:14] [INFO ] Time to serialize gal into /tmp/CTLFireability15741096849057653429.gal : 24 ms
[2024-05-29 21:13:14] [INFO ] Time to serialize properties into /tmp/CTLFireability11049367128455953403.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/CTLFireability15741096849057653429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11049367128455953403.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 21:13:44] [INFO ] Flatten gal took : 120 ms
[2024-05-29 21:13:44] [INFO ] Applying decomposition
[2024-05-29 21:13:44] [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/graph11436871330614571432.txt' '-o' '/tmp/graph11436871330614571432.bin' '-w' '/tmp/graph11436871330614571432.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11436871330614571432.bin' '-l' '-1' '-v' '-w' '/tmp/graph11436871330614571432.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:13:45] [INFO ] Decomposing Gal with order
[2024-05-29 21:13:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:13:45] [INFO ] Removed a total of 20538 redundant transitions.
[2024-05-29 21:13:45] [INFO ] Flatten gal took : 273 ms
[2024-05-29 21:13:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 62 ms.
[2024-05-29 21:13:45] [INFO ] Time to serialize gal into /tmp/CTLFireability8626677606622598431.gal : 13 ms
[2024-05-29 21:13:45] [INFO ] Time to serialize properties into /tmp/CTLFireability794036853595416153.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/CTLFireability8626677606622598431.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability794036853595416153.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.82469e+06,0.428085,18544,3389,26,12872,170,2441,4579,49,392,0


Converting to forward existential form...Done !
original formula: AG((AX(EG((((((i1.i0.u2.p12==0)||(i1.i1.u6.p26==0))||((i1.i2.u4.p40==0)||(i2.i0.u16.p54==0)))||(((i2.i1.u13.p68==0)||(i3.i0.u20.p82==0))|...1128
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(EG((((((i1.i0.u2.p12==0)||(i1.i1.u6.p26==0))||((i1.i2.u4.p40==0)||(i2.i0.u16.p54==0))...1228
Reverse transition relation is NOT exact ! Due to transitions t2139, t2141, t2143, t2145, t2147, t2149, t2151, t2153, t2155, t2157, u27.t3, u27.t4, i0.t46,...546
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,3.9015,185124,1,0,491921,258,25624,525210,211,734,800354
FORMULA StigmergyElection-PT-10a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-29 21:13:49] [INFO ] Flatten gal took : 122 ms
[2024-05-29 21:13:49] [INFO ] Flatten gal took : 122 ms
[2024-05-29 21:13:49] [INFO ] Applying decomposition
[2024-05-29 21:13:49] [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/graph9100178397456268260.txt' '-o' '/tmp/graph9100178397456268260.bin' '-w' '/tmp/graph9100178397456268260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9100178397456268260.bin' '-l' '-1' '-v' '-w' '/tmp/graph9100178397456268260.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:13:50] [INFO ] Decomposing Gal with order
[2024-05-29 21:13:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:13:50] [INFO ] Removed a total of 20578 redundant transitions.
[2024-05-29 21:13:50] [INFO ] Flatten gal took : 277 ms
[2024-05-29 21:13:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 69 ms.
[2024-05-29 21:13:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4248901767136574767.gal : 8 ms
[2024-05-29 21:13:50] [INFO ] Time to serialize properties into /tmp/CTLFireability18416244072045046123.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/CTLFireability4248901767136574767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18416244072045046123.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 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08142e+07,0.266851,12516,512,40,8236,306,1571,8727,54,1044,0


Converting to forward existential form...Done !
original formula: (EG(((((!(E(A((((((i5.u31.p12==1)&&(i2.u6.p26==1))&&((i3.u10.p40==1)&&(i1.u2.p54==1)))&&(((i4.u17.p68==1)&&(i6.u21.p82==1))&&((i7.u25.p96...1009
=> equivalent forward existential formula: [(FwdU(EY(EY((Init * !(EG(((((!(E(!((E(!((((((i5.u31.p12==1)&&(i2.u6.p26==1))&&((i3.u10.p40==1)&&(i1.u2.p54==1))...1471
Reverse transition relation is NOT exact ! Due to transitions t52, t54, t56, t58, t60, t63, t65, t67, t69, t72, t74, t76, t78, t80, t83, t85, t87, t89, i0....686
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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,0.960206,26504,1,0,33593,548,26587,36643,234,2092,166953
FORMULA StigmergyElection-PT-10a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AX(((((AX(E((((((i5.u31.p12==1)&&(i2.u6.p26==1))&&((i3.u10.p40==1)&&(i1.u2.p54==1)))&&(((i4.u17.p68==1)&&(i6.u21.p82==1))&&((i7.u25.p9...808
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((((!(EX(!(E((((((i5.u31.p12==1)&&(i2.u6.p26==1))&&((i3.u10.p40==1)&&(i1.u2.p54==1)))...878
(forward)formula 1,0,0.993017,27296,1,0,34515,549,26629,37502,238,2092,170359
FORMULA StigmergyElection-PT-10a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(!((((((i5.u31.p12==1)&&(i2.u6.p26==1))&&((i3.u10.p40==1)&&(i1.u2.p54==1)))&&(((i4.u17.p68==1)&&(i6.u21.p82==1))&&((i7.u25.p96==1)&&(i10...1666
=> equivalent forward existential formula: [((FwdU(FwdU(Init,!((((((i5.u31.p12==1)&&(i2.u6.p26==1))&&((i3.u10.p40==1)&&(i1.u2.p54==1)))&&(((i4.u17.p68==1)&...1737
(forward)formula 2,1,1.04757,28880,1,0,36217,549,26691,38311,241,2092,183438
FORMULA StigmergyElection-PT-10a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 967221 ms.

BK_STOP 1717017231868

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-10a"
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 StigmergyElection-PT-10a, 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-171690532200378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-10a.tgz
mv StigmergyElection-PT-10a 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 ;