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-171690531700170.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyCommit-PT-07a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531700170
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 11 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.4M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716989333144

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 13:28:54] [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 13:28:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:28:54] [INFO ] Load time of PNML (sax parser for PT used): 437 ms
[2024-05-29 13:28:54] [INFO ] Transformed 292 places.
[2024-05-29 13:28:54] [INFO ] Transformed 7108 transitions.
[2024-05-29 13:28:54] [INFO ] Found NUPN structural information;
[2024-05-29 13:28:54] [INFO ] Parsed PT model containing 292 places and 7108 transitions and 108222 arcs in 606 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
Support contains 19 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 890/890 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 230 transition count 820
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 230 transition count 820
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 132 place count 230 transition count 812
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 161 place count 201 transition count 776
Iterating global reduction 1 with 29 rules applied. Total rules applied 190 place count 201 transition count 776
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 197 place count 201 transition count 769
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 203 place count 195 transition count 763
Iterating global reduction 2 with 6 rules applied. Total rules applied 209 place count 195 transition count 763
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 215 place count 189 transition count 757
Iterating global reduction 2 with 6 rules applied. Total rules applied 221 place count 189 transition count 757
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 226 place count 184 transition count 752
Iterating global reduction 2 with 5 rules applied. Total rules applied 231 place count 184 transition count 752
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 236 place count 179 transition count 747
Iterating global reduction 2 with 5 rules applied. Total rules applied 241 place count 179 transition count 747
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 246 place count 179 transition count 742
Applied a total of 246 rules in 133 ms. Remains 179 /292 variables (removed 113) and now considering 742/890 (removed 148) transitions.
[2024-05-29 13:28:55] [INFO ] Flow matrix only has 733 transitions (discarded 9 similar events)
// Phase 1: matrix 733 rows 179 cols
[2024-05-29 13:28:55] [INFO ] Computed 2 invariants in 24 ms
[2024-05-29 13:28:55] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-29 13:28:55] [INFO ] Flow matrix only has 733 transitions (discarded 9 similar events)
[2024-05-29 13:28:55] [INFO ] Invariant cache hit.
[2024-05-29 13:28:55] [INFO ] State equation strengthened by 589 read => feed constraints.
[2024-05-29 13:28:56] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
Running 741 sub problems to find dead transitions.
[2024-05-29 13:28:56] [INFO ] Flow matrix only has 733 transitions (discarded 9 similar events)
[2024-05-29 13:28:56] [INFO ] Invariant cache hit.
[2024-05-29 13:28:56] [INFO ] State equation strengthened by 589 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-05-29 13:29:07] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 14 ms to minimize.
[2024-05-29 13:29:08] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 2 ms to minimize.
[2024-05-29 13:29:08] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:29:08] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:29:08] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2024-05-29 13:29:08] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 1 ms to minimize.
[2024-05-29 13:29:08] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2024-05-29 13:29:08] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 5 ms to minimize.
[2024-05-29 13:29:09] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 2 ms to minimize.
[2024-05-29 13:29:09] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 1 ms to minimize.
[2024-05-29 13:29:09] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 1 ms to minimize.
[2024-05-29 13:29:09] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:29:09] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-05-29 13:29:09] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:29:10] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 1 ms to minimize.
[2024-05-29 13:29:10] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:29:10] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 2 ms to minimize.
[2024-05-29 13:29:10] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 2 ms to minimize.
[2024-05-29 13:29:10] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2024-05-29 13:29:10] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-05-29 13:29:11] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:29:11] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
[2024-05-29 13:29:11] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:29:11] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:29:11] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2024-05-29 13:29:11] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2024-05-29 13:29:11] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2024-05-29 13:29:12] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 1 ms to minimize.
[2024-05-29 13:29:12] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2024-05-29 13:29:12] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:29:12] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 2 ms to minimize.
[2024-05-29 13:29:12] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 1 ms to minimize.
[2024-05-29 13:29:12] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:29:13] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:29:13] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2024-05-29 13:29:13] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-05-29 13:29:13] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2024-05-29 13:29:13] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-05-29 13:29:13] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:29:13] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-05-29 13:29:16] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:29:16] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:29:16] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:29:16] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:29:16] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:29:16] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:29:16] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2024-05-29 13:29:16] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:29:16] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2024-05-29 13:29:16] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:29:17] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-29 13:29:17] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:29:17] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:29:17] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:29:17] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:29:17] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2024-05-29 13:29:17] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:29:17] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:29:17] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:29:17] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-05-29 13:29:18] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:29:18] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:29:18] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:29:18] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-05-29 13:29:18] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2024-05-29 13:29:18] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2024-05-29 13:29:18] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:29:19] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:29:19] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:29:19] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:29:19] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 0 ms to minimize.
[2024-05-29 13:29:19] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2024-05-29 13:29:19] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-05-29 13:29:19] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2024-05-29 13:29:19] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-29 13:29:19] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
[2024-05-29 13:29:20] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:29:20] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2024-05-29 13:29:20] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2024-05-29 13:29:20] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-05-29 13:29:21] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2024-05-29 13:29:21] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:29:21] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 2 ms to minimize.
[2024-05-29 13:29:21] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2024-05-29 13:29:21] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2024-05-29 13:29:21] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:29:22] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 2 ms to minimize.
[2024-05-29 13:29:22] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
[2024-05-29 13:29:22] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:29:22] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:29:22] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:29:22] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:29:22] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:29:22] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:29:23] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2024-05-29 13:29:23] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:29:23] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:29:23] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:29:26] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:29:26] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-05-29 13:29:29] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:29:29] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:29:29] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:29:29] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
[2024-05-29 13:29:29] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2024-05-29 13:29:30] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2024-05-29 13:29:30] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 1 ms to minimize.
[2024-05-29 13:29:30] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:29:30] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2024-05-29 13:29:30] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 2 ms to minimize.
[2024-05-29 13:29:30] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 1 ms to minimize.
[2024-05-29 13:29:31] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:29:31] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2024-05-29 13:29:31] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 1 ms to minimize.
[2024-05-29 13:29:31] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:29:31] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:29:31] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:29:31] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:29:31] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:29:32] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2024-05-29 13:29:32] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:29:32] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
SMT process timed out in 36393ms, After SMT, problems are : Problem set: 0 solved, 741 unsolved
Search for dead transitions found 0 dead transitions in 36422ms
Starting structural reductions in LTL mode, iteration 1 : 179/292 places, 742/890 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37711 ms. Remains : 179/292 places, 742/890 transitions.
Support contains 19 out of 179 places after structural reductions.
[2024-05-29 13:29:33] [INFO ] Flatten gal took : 106 ms
[2024-05-29 13:29:33] [INFO ] Flatten gal took : 78 ms
[2024-05-29 13:29:33] [INFO ] Input system was already deterministic with 742 transitions.
Reduction of identical properties reduced properties to check from 19 to 13
RANDOM walk for 40000 steps (16 resets) in 2824 ms. (14 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 477 ms. (83 steps per ms) remains 3/4 properties
[2024-05-29 13:29:34] [INFO ] Flow matrix only has 733 transitions (discarded 9 similar events)
[2024-05-29 13:29:34] [INFO ] Invariant cache hit.
[2024-05-29 13:29:34] [INFO ] State equation strengthened by 589 read => feed constraints.
Problem AtomicPropp15 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 168/179 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 1 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 1 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 2 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
[2024-05-29 13:29:35] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2024-05-29 13:29:36] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:29:36] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 1 ms to minimize.
[2024-05-29 13:29:36] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 1 ms to minimize.
[2024-05-29 13:29:36] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2024-05-29 13:29:36] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2024-05-29 13:29:36] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2024-05-29 13:29:36] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 13/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 732/911 variables, 179/194 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/911 variables, 588/782 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/911 variables, 0/782 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/912 variables, 1/783 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/912 variables, 0/783 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/912 variables, 0/783 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 783 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2429 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 589/589 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 176/179 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 13/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-29 13:29:37] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2024-05-29 13:29:37] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:29:37] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2024-05-29 13:29:37] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:29:38] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2024-05-29 13:29:38] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:29:38] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 1 ms to minimize.
[2024-05-29 13:29:38] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 3 ms to minimize.
[2024-05-29 13:29:38] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:29:38] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 1 ms to minimize.
[2024-05-29 13:29:38] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 1 ms to minimize.
[2024-05-29 13:29:39] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-05-29 13:29:39] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:29:39] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2024-05-29 13:29:39] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2024-05-29 13:29:39] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:29:39] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2024-05-29 13:29:39] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2024-05-29 13:29:39] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-05-29 13:29:40] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 20/35 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-29 13:29:40] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 1 ms to minimize.
[2024-05-29 13:29:40] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2024-05-29 13:29:40] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:29:40] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2024-05-29 13:29:40] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-29 13:29:40] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:29:40] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2024-05-29 13:29:41] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 1 ms to minimize.
[2024-05-29 13:29:41] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:29:41] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2024-05-29 13:29:41] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:29:41] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:29:41] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2024-05-29 13:29:41] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:29:41] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2024-05-29 13:29:41] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 0 ms to minimize.
[2024-05-29 13:29:42] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:29:42] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:29:42] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:29:42] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 20/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-29 13:29:42] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:29:42] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
SMT process timed out in 7596ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 742/742 transitions.
Graph (complete) has 485 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 178 transition count 710
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 60 place count 164 transition count 696
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 60 place count 164 transition count 660
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 132 place count 128 transition count 660
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 143 place count 117 transition count 648
Iterating global reduction 2 with 11 rules applied. Total rules applied 154 place count 117 transition count 648
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 165 place count 106 transition count 637
Iterating global reduction 2 with 11 rules applied. Total rules applied 176 place count 106 transition count 637
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 179 place count 106 transition count 634
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 180 place count 105 transition count 633
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 105 transition count 633
Performed 32 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 245 place count 73 transition count 599
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 260 place count 73 transition count 584
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 275 place count 58 transition count 569
Iterating global reduction 4 with 15 rules applied. Total rules applied 290 place count 58 transition count 569
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 4 with 255 rules applied. Total rules applied 545 place count 58 transition count 314
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 553 place count 50 transition count 306
Iterating global reduction 5 with 8 rules applied. Total rules applied 561 place count 50 transition count 306
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 569 place count 42 transition count 298
Iterating global reduction 5 with 8 rules applied. Total rules applied 577 place count 42 transition count 298
Applied a total of 577 rules in 147 ms. Remains 42 /179 variables (removed 137) and now considering 298/742 (removed 444) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 42/179 places, 298/742 transitions.
RANDOM walk for 6190 steps (0 resets) in 1238 ms. (4 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-29 13:29:42] [INFO ] Flatten gal took : 47 ms
[2024-05-29 13:29:43] [INFO ] Flatten gal took : 48 ms
[2024-05-29 13:29:43] [INFO ] Input system was already deterministic with 742 transitions.
Computed a total of 50 stabilizing places and 49 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 742/742 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 174 transition count 736
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 174 transition count 736
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 170 transition count 732
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 170 transition count 732
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 170 transition count 730
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 168 transition count 728
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 168 transition count 728
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 166 transition count 726
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 166 transition count 726
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 164 transition count 724
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 164 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 163 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 163 transition count 721
Applied a total of 36 rules in 35 ms. Remains 163 /179 variables (removed 16) and now considering 721/742 (removed 21) transitions.
[2024-05-29 13:29:43] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2024-05-29 13:29:43] [INFO ] Computed 2 invariants in 9 ms
[2024-05-29 13:29:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-29 13:29:43] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2024-05-29 13:29:43] [INFO ] Invariant cache hit.
[2024-05-29 13:29:43] [INFO ] State equation strengthened by 581 read => feed constraints.
[2024-05-29 13:29:44] [INFO ] Implicit Places using invariants and state equation in 989 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1065 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/179 places, 721/742 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 24 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2024-05-29 13:29:44] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-05-29 13:29:44] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 13:29:44] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 13:29:44] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:29:44] [INFO ] Invariant cache hit.
[2024-05-29 13:29:44] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:29:44] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/179 places, 651/742 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1351 ms. Remains : 100/179 places, 651/742 transitions.
[2024-05-29 13:29:44] [INFO ] Flatten gal took : 33 ms
[2024-05-29 13:29:44] [INFO ] Flatten gal took : 34 ms
[2024-05-29 13:29:44] [INFO ] Input system was already deterministic with 651 transitions.
[2024-05-29 13:29:44] [INFO ] Flatten gal took : 34 ms
[2024-05-29 13:29:44] [INFO ] Flatten gal took : 32 ms
[2024-05-29 13:29:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5880345401617701403.gal : 34 ms
[2024-05-29 13:29:44] [INFO ] Time to serialize properties into /tmp/CTLFireability14030785286599206271.ctl : 100 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/CTLFireability5880345401617701403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14030785286599206271.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.80253e+06,2.75963,68292,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: EX(!(E((!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))) * AX(!(((((p30==1)&&(p66==1...672
=> equivalent forward existential formula: [(EY(Init) * !(E((!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282=...729
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
(forward)formula 0,0,15.5028,350104,1,0,1088,897255,1322,326,22562,738093,1621
FORMULA StigmergyCommit-PT-07a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 742/742 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 174 transition count 736
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 174 transition count 736
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 170 transition count 732
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 170 transition count 732
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 170 transition count 730
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 168 transition count 728
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 168 transition count 728
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 166 transition count 726
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 166 transition count 726
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 164 transition count 724
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 164 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 163 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 163 transition count 721
Applied a total of 36 rules in 34 ms. Remains 163 /179 variables (removed 16) and now considering 721/742 (removed 21) transitions.
[2024-05-29 13:30:00] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2024-05-29 13:30:00] [INFO ] Computed 2 invariants in 7 ms
[2024-05-29 13:30:00] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 13:30:00] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2024-05-29 13:30:00] [INFO ] Invariant cache hit.
[2024-05-29 13:30:00] [INFO ] State equation strengthened by 581 read => feed constraints.
[2024-05-29 13:30:01] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1091 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/179 places, 721/742 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 27 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2024-05-29 13:30:01] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-05-29 13:30:01] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 13:30:01] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 13:30:01] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:30:01] [INFO ] Invariant cache hit.
[2024-05-29 13:30:01] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:30:02] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/179 places, 651/742 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1379 ms. Remains : 100/179 places, 651/742 transitions.
[2024-05-29 13:30:02] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:30:02] [INFO ] Flatten gal took : 31 ms
[2024-05-29 13:30:02] [INFO ] Input system was already deterministic with 651 transitions.
[2024-05-29 13:30:02] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:30:02] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:30:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6437972529589888555.gal : 7 ms
[2024-05-29 13:30:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6413109220164167823.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/CTLFireability6437972529589888555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6413109220164167823.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,7.80253e+06,2.53866,68364,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: EF((E(((((E(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1)))) U ((((p30==1)&&(p66==1))&&...752
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),((((E(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246=...1068
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
(forward)formula 0,1,15.1035,366468,1,0,1046,1.01303e+06,1328,234,23738,658929,1677
FORMULA StigmergyCommit-PT-07a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 742/742 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 174 transition count 736
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 174 transition count 736
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 170 transition count 732
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 170 transition count 732
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 170 transition count 730
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 168 transition count 728
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 168 transition count 728
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 166 transition count 726
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 166 transition count 726
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 164 transition count 724
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 164 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 163 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 163 transition count 721
Applied a total of 36 rules in 27 ms. Remains 163 /179 variables (removed 16) and now considering 721/742 (removed 21) transitions.
[2024-05-29 13:30:17] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2024-05-29 13:30:17] [INFO ] Computed 2 invariants in 9 ms
[2024-05-29 13:30:17] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 13:30:17] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2024-05-29 13:30:17] [INFO ] Invariant cache hit.
[2024-05-29 13:30:17] [INFO ] State equation strengthened by 581 read => feed constraints.
[2024-05-29 13:30:18] [INFO ] Implicit Places using invariants and state equation in 990 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1060 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/179 places, 721/742 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 17 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2024-05-29 13:30:18] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-05-29 13:30:18] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 13:30:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 13:30:18] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:30:18] [INFO ] Invariant cache hit.
[2024-05-29 13:30:18] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:30:18] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/179 places, 651/742 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1318 ms. Remains : 100/179 places, 651/742 transitions.
[2024-05-29 13:30:18] [INFO ] Flatten gal took : 25 ms
[2024-05-29 13:30:18] [INFO ] Flatten gal took : 26 ms
[2024-05-29 13:30:18] [INFO ] Input system was already deterministic with 651 transitions.
[2024-05-29 13:30:18] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:30:19] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:30:19] [INFO ] Time to serialize gal into /tmp/CTLFireability8113912461723485553.gal : 6 ms
[2024-05-29 13:30:19] [INFO ] Time to serialize properties into /tmp/CTLFireability5498242994548999746.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/CTLFireability8113912461723485553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5498242994548999746.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,7.80253e+06,2.86438,68360,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: (AG(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))) + EG(AX(AF(((((p30==0)||(p66==0))...235
=> equivalent forward existential formula: [(FwdU((Init * !(EG(!(EX(!(!(EG(!(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p2...304
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,18.449,418076,1,0,1039,1.01801e+06,1324,277,23854,689335,1613
FORMULA StigmergyCommit-PT-07a-CTLFireability-2024-02 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 : 179/179 places, 742/742 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 179 transition count 735
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 21 place count 172 transition count 728
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 21 place count 172 transition count 691
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 95 place count 135 transition count 691
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 130 transition count 685
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 130 transition count 685
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 126 transition count 681
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 126 transition count 681
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 116 place count 126 transition count 678
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 148 place count 110 transition count 662
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 149 place count 110 transition count 661
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 158 place count 101 transition count 652
Iterating global reduction 4 with 9 rules applied. Total rules applied 167 place count 101 transition count 652
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 4 with 126 rules applied. Total rules applied 293 place count 101 transition count 526
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 296 place count 98 transition count 523
Iterating global reduction 5 with 3 rules applied. Total rules applied 299 place count 98 transition count 523
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 301 place count 98 transition count 521
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 302 place count 97 transition count 520
Iterating global reduction 6 with 1 rules applied. Total rules applied 303 place count 97 transition count 520
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 311 place count 97 transition count 512
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 327 place count 89 transition count 504
Applied a total of 327 rules in 282 ms. Remains 89 /179 variables (removed 90) and now considering 504/742 (removed 238) transitions.
[2024-05-29 13:30:37] [INFO ] Flow matrix only has 495 transitions (discarded 9 similar events)
// Phase 1: matrix 495 rows 89 cols
[2024-05-29 13:30:37] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 13:30:37] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 13:30:37] [INFO ] Flow matrix only has 495 transitions (discarded 9 similar events)
[2024-05-29 13:30:37] [INFO ] Invariant cache hit.
[2024-05-29 13:30:38] [INFO ] State equation strengthened by 444 read => feed constraints.
[2024-05-29 13:30:38] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-29 13:30:38] [INFO ] Redundant transitions in 38 ms returned []
Running 503 sub problems to find dead transitions.
[2024-05-29 13:30:38] [INFO ] Flow matrix only has 495 transitions (discarded 9 similar events)
[2024-05-29 13:30:38] [INFO ] Invariant cache hit.
[2024-05-29 13:30:38] [INFO ] State equation strengthened by 444 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 13:30:43] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2024-05-29 13:30:44] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-29 13:30:44] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2024-05-29 13:30:44] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2024-05-29 13:30:44] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2024-05-29 13:30:44] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:30:44] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2024-05-29 13:30:44] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2024-05-29 13:30:44] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2024-05-29 13:30:44] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2024-05-29 13:30:45] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:30:45] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
[2024-05-29 13:30:45] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2024-05-29 13:30:45] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:30:45] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-29 13:30:45] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:30:45] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-05-29 13:30:45] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:30:45] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:30:45] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 13:30:46] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:30:46] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:30:46] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2024-05-29 13:30:46] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2024-05-29 13:30:46] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2024-05-29 13:30:46] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:30:46] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:30:46] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:30:46] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:30:46] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:30:46] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:30:46] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:30:46] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:30:46] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:30:47] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:30:48] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:30:48] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:30:48] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:30:48] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:30:48] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 13:30:49] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:30:49] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:30:50] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:30:50] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:30:50] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:30:50] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:30:50] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 3 ms to minimize.
[2024-05-29 13:30:51] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:30:51] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:30:51] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:30:51] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 13:30:51] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:30:51] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:30:51] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:30:51] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
[2024-05-29 13:30:51] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:30:51] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:30:51] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:30:51] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:30:51] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 13:30:51] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:30:51] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:30:52] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:30:52] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:30:53] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:30:53] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:30:53] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:30:53] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:30:53] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:30:53] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:30:53] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 13:30:53] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:30:53] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:30:54] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:30:55] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:30:55] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:30:55] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:30:55] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:30:55] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 13:30:57] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 13:30:58] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:30:59] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 13:30:59] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:30:59] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:30:59] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:31:00] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 494/583 variables, 89/177 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/583 variables, 443/620 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/584 variables, and 620 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 443/444 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-29 13:31:14] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:31:14] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (OVERLAPS) 494/583 variables, 89/179 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 443/622 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 503/1125 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/584 variables, and 1125 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 443/444 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 88/88 constraints]
After SMT, in 63619ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 63627ms
Starting structural reductions in SI_CTL mode, iteration 1 : 89/179 places, 504/742 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64418 ms. Remains : 89/179 places, 504/742 transitions.
[2024-05-29 13:31:42] [INFO ] Flatten gal took : 35 ms
[2024-05-29 13:31:42] [INFO ] Flatten gal took : 34 ms
[2024-05-29 13:31:42] [INFO ] Input system was already deterministic with 504 transitions.
[2024-05-29 13:31:42] [INFO ] Flatten gal took : 31 ms
[2024-05-29 13:31:42] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:31:42] [INFO ] Time to serialize gal into /tmp/CTLFireability10007878365646256240.gal : 5 ms
[2024-05-29 13:31:42] [INFO ] Time to serialize properties into /tmp/CTLFireability12150125446030491422.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/CTLFireability10007878365646256240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12150125446030491422.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,90712,1.61551,48188,2,13661,5,60141,6,0,849,42753,0


Converting to forward existential form...Done !
original formula: E(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1)))) U E((AF(((p259==1)&&(p291==1))) + EG...576
=> equivalent forward existential formula: ([(FwdU((FwdU(FwdU(Init,((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p...1246
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t33, t34, t449, t451, ...339
Hit Full ! (commute/partial/dont) 89/161/415
(forward)formula 0,0,21.9042,567720,1,0,743,1.16874e+06,1055,176,19373,949935,1249
FORMULA StigmergyCommit-PT-07a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 742/742 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 175 transition count 737
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 175 transition count 737
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 172 transition count 734
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 172 transition count 734
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 172 transition count 732
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 171 transition count 731
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 171 transition count 731
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 170 transition count 730
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 170 transition count 730
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 169 transition count 729
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 169 transition count 729
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 168 transition count 728
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 168 transition count 728
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 168 transition count 727
Applied a total of 25 rules in 19 ms. Remains 168 /179 variables (removed 11) and now considering 727/742 (removed 15) transitions.
[2024-05-29 13:32:04] [INFO ] Flow matrix only has 718 transitions (discarded 9 similar events)
// Phase 1: matrix 718 rows 168 cols
[2024-05-29 13:32:04] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 13:32:04] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 13:32:04] [INFO ] Flow matrix only has 718 transitions (discarded 9 similar events)
[2024-05-29 13:32:04] [INFO ] Invariant cache hit.
[2024-05-29 13:32:04] [INFO ] State equation strengthened by 584 read => feed constraints.
[2024-05-29 13:32:05] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Running 726 sub problems to find dead transitions.
[2024-05-29 13:32:05] [INFO ] Flow matrix only has 718 transitions (discarded 9 similar events)
[2024-05-29 13:32:05] [INFO ] Invariant cache hit.
[2024-05-29 13:32:05] [INFO ] State equation strengthened by 584 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-29 13:32:16] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:32:16] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2024-05-29 13:32:16] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2024-05-29 13:32:17] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:32:17] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:32:17] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:32:17] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 1 ms to minimize.
[2024-05-29 13:32:17] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 1 ms to minimize.
[2024-05-29 13:32:17] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2024-05-29 13:32:18] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 1 ms to minimize.
[2024-05-29 13:32:18] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:32:18] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2024-05-29 13:32:18] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2024-05-29 13:32:18] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 1 ms to minimize.
[2024-05-29 13:32:18] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:32:18] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:32:18] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:32:19] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-05-29 13:32:19] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:32:19] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-29 13:32:19] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2024-05-29 13:32:19] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:32:19] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:32:19] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:32:19] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:32:19] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:32:19] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:32:19] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:32:20] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:32:20] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:32:20] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:32:20] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:32:20] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 1 ms to minimize.
[2024-05-29 13:32:20] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-05-29 13:32:20] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2024-05-29 13:32:20] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 1 ms to minimize.
[2024-05-29 13:32:21] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2024-05-29 13:32:21] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2024-05-29 13:32:21] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:32:21] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-29 13:32:23] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:32:24] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:32:24] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:32:24] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:32:24] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:32:24] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:32:24] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2024-05-29 13:32:24] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 0 ms to minimize.
[2024-05-29 13:32:24] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2024-05-29 13:32:24] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2024-05-29 13:32:25] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2024-05-29 13:32:25] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:32:25] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2024-05-29 13:32:25] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2024-05-29 13:32:25] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 0 ms to minimize.
[2024-05-29 13:32:25] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:32:25] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:32:25] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:32:25] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2024-05-29 13:32:26] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-29 13:32:26] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:32:26] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:32:26] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2024-05-29 13:32:26] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:32:26] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:32:26] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:32:26] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2024-05-29 13:32:27] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 0 ms to minimize.
[2024-05-29 13:32:27] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-29 13:32:27] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 0 ms to minimize.
[2024-05-29 13:32:27] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:32:27] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:32:27] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:32:27] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2024-05-29 13:32:27] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 1 ms to minimize.
[2024-05-29 13:32:27] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2024-05-29 13:32:28] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 1 ms to minimize.
[2024-05-29 13:32:28] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:32:28] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2024-05-29 13:32:28] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-29 13:32:28] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:32:28] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 0 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2024-05-29 13:32:29] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:32:30] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-29 13:32:33] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:32:33] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2024-05-29 13:32:33] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:32:33] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2024-05-29 13:32:34] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:32:34] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:32:36] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 7/109 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-29 13:32:37] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2024-05-29 13:32:37] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2024-05-29 13:32:37] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2024-05-29 13:32:37] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:32:37] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 3 ms to minimize.
[2024-05-29 13:32:37] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2024-05-29 13:32:37] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 2 ms to minimize.
[2024-05-29 13:32:38] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:32:38] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:32:41] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:32:41] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:32:41] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 168/886 variables, and 121 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/168 constraints, ReadFeed: 0/584 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 119/119 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-29 13:32:50] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:32:50] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:32:50] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:32:50] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2024-05-29 13:32:50] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:32:50] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2024-05-29 13:32:51] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2024-05-29 13:32:51] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2024-05-29 13:32:51] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2024-05-29 13:32:51] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:32:51] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:32:52] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:32:52] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:32:52] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:32:52] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:32:53] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:32:53] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2024-05-29 13:32:53] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2024-05-29 13:32:53] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:32:53] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-29 13:32:57] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:32:57] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:32:58] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:32:58] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-29 13:33:06] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:33:06] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2024-05-29 13:33:06] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 168/886 variables, and 148 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/168 constraints, ReadFeed: 0/584 constraints, PredecessorRefiner: 0/726 constraints, Known Traps: 146/146 constraints]
After SMT, in 66801ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 66811ms
Starting structural reductions in LTL mode, iteration 1 : 168/179 places, 727/742 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67538 ms. Remains : 168/179 places, 727/742 transitions.
[2024-05-29 13:33:12] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:33:12] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:33:12] [INFO ] Input system was already deterministic with 727 transitions.
[2024-05-29 13:33:12] [INFO ] Flatten gal took : 28 ms
[2024-05-29 13:33:12] [INFO ] Flatten gal took : 29 ms
[2024-05-29 13:33:12] [INFO ] Time to serialize gal into /tmp/CTLFireability1930684167049467071.gal : 7 ms
[2024-05-29 13:33:12] [INFO ] Time to serialize properties into /tmp/CTLFireability2778346994766120258.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/CTLFireability1930684167049467071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2778346994766120258.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,7.86156e+06,2.97455,85012,2,5971,5,100861,6,0,1388,51039,0


Converting to forward existential form...Done !
original formula: ((EF(AX(AG(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246==0)||(p282==0))))))) + E(EX((AX(((((p30==1)&&...1026
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0...1186
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t23, t24, t25, ...456
(forward)formula 0,1,25.5028,545880,1,0,873,1.26719e+06,1466,221,24778,677283,1534
FORMULA StigmergyCommit-PT-07a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 179/179 places, 742/742 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 177 transition count 641
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 124 rules applied. Total rules applied 225 place count 77 transition count 617
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 23 rules applied. Total rules applied 248 place count 69 transition count 602
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 11 rules applied. Total rules applied 259 place count 62 transition count 598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 260 place count 61 transition count 598
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 260 place count 61 transition count 596
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 264 place count 59 transition count 596
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 271 place count 52 transition count 589
Iterating global reduction 5 with 7 rules applied. Total rules applied 278 place count 52 transition count 589
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 5 with 127 rules applied. Total rules applied 405 place count 52 transition count 462
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 405 place count 52 transition count 455
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 419 place count 45 transition count 455
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 423 place count 43 transition count 453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 424 place count 43 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 369 transitions
Redundant transition composition rules discarded 369 transitions
Iterating global reduction 7 with 369 rules applied. Total rules applied 793 place count 43 transition count 83
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 809 place count 35 transition count 75
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 817 place count 27 transition count 67
Applied a total of 817 rules in 90 ms. Remains 27 /179 variables (removed 152) and now considering 67/742 (removed 675) transitions.
[2024-05-29 13:33:38] [INFO ] Flow matrix only has 59 transitions (discarded 8 similar events)
// Phase 1: matrix 59 rows 27 cols
[2024-05-29 13:33:38] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:33:38] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 13:33:38] [INFO ] Flow matrix only has 59 transitions (discarded 8 similar events)
[2024-05-29 13:33:38] [INFO ] Invariant cache hit.
[2024-05-29 13:33:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 13:33:38] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-29 13:33:38] [INFO ] Redundant transitions in 0 ms returned []
Running 35 sub problems to find dead transitions.
[2024-05-29 13:33:38] [INFO ] Flow matrix only has 59 transitions (discarded 8 similar events)
[2024-05-29 13:33:38] [INFO ] Invariant cache hit.
[2024-05-29 13:33:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 8/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:33:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:33:39] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:33:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 58/85 variables, 27/89 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-29 13:33:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:33:40] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:33:40] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:33:40] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 1/86 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 0/86 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 94 constraints, problems are : Problem set: 0 solved, 35 unsolved in 2670 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 8/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-29 13:33:41] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 58/85 variables, 27/94 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 35/129 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 1/86 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/86 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 130 constraints, problems are : Problem set: 0 solved, 35 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 66/66 constraints]
After SMT, in 3599ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 3599ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/179 places, 67/742 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3771 ms. Remains : 27/179 places, 67/742 transitions.
[2024-05-29 13:33:41] [INFO ] Flatten gal took : 8 ms
[2024-05-29 13:33:41] [INFO ] Flatten gal took : 3 ms
[2024-05-29 13:33:41] [INFO ] Input system was already deterministic with 67 transitions.
RANDOM walk for 59 steps (1 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-07a-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 13:33:41] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:33:41] [INFO ] Flatten gal took : 2 ms
[2024-05-29 13:33:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3273110848530490064.gal : 1 ms
[2024-05-29 13:33:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8972109910315270272.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3273110848530490064.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8972109910315270272.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 742/742 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 175 transition count 737
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 175 transition count 737
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 172 transition count 734
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 172 transition count 734
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 172 transition count 733
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 170 transition count 731
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 170 transition count 731
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 168 transition count 729
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 168 transition count 729
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 166 transition count 727
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 166 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 166 transition count 726
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 165 transition count 725
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 165 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 165 transition count 724
Applied a total of 31 rules in 20 ms. Remains 165 /179 variables (removed 14) and now considering 724/742 (removed 18) transitions.
[2024-05-29 13:33:41] [INFO ] Flow matrix only has 715 transitions (discarded 9 similar events)
// Phase 1: matrix 715 rows 165 cols
[2024-05-29 13:33:41] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 13:33:41] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 13:33:41] [INFO ] Flow matrix only has 715 transitions (discarded 9 similar events)
[2024-05-29 13:33:41] [INFO ] Invariant cache hit.
[2024-05-29 13:33:42] [INFO ] State equation strengthened by 582 read => feed constraints.
[2024-05-29 13:33:42] [INFO ] Implicit Places using invariants and state equation in 917 ms returned [164]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 988 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/179 places, 724/742 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 701
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 701
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 141 transition count 693
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 133 transition count 685
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 133 transition count 685
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 125 transition count 677
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 125 transition count 677
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 117 transition count 669
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 117 transition count 669
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 109 transition count 661
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 109 transition count 661
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 102 transition count 654
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 102 transition count 654
Applied a total of 132 rules in 18 ms. Remains 102 /164 variables (removed 62) and now considering 654/724 (removed 70) transitions.
[2024-05-29 13:33:42] [INFO ] Flow matrix only has 645 transitions (discarded 9 similar events)
// Phase 1: matrix 645 rows 102 cols
[2024-05-29 13:33:42] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 13:33:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 13:33:42] [INFO ] Flow matrix only has 645 transitions (discarded 9 similar events)
[2024-05-29 13:33:42] [INFO ] Invariant cache hit.
[2024-05-29 13:33:43] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:33:43] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/179 places, 654/742 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1255 ms. Remains : 102/179 places, 654/742 transitions.
[2024-05-29 13:33:43] [INFO ] Flatten gal took : 26 ms
[2024-05-29 13:33:43] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:33:43] [INFO ] Input system was already deterministic with 654 transitions.
[2024-05-29 13:33:43] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:33:43] [INFO ] Flatten gal took : 26 ms
[2024-05-29 13:33:43] [INFO ] Time to serialize gal into /tmp/CTLFireability10604787426362120088.gal : 7 ms
[2024-05-29 13:33:43] [INFO ] Time to serialize properties into /tmp/CTLFireability14920232313560007279.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/CTLFireability10604787426362120088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14920232313560007279.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,7.80253e+06,2.60024,68372,2,4704,5,69927,6,0,1053,46053,0


Converting to forward existential form...Done !
original formula: AF(((EG(((((EG(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246==0)||(p282==0))))) + (p30==0)) + ((p66==0...1002
=> equivalent forward existential formula: [FwdG(Init,!(((EG(((((EG(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246==0)||(...1296
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...460
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-29 13:34:13] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:34:13] [INFO ] Applying decomposition
[2024-05-29 13:34:13] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14767900968936154795.txt' '-o' '/tmp/graph14767900968936154795.bin' '-w' '/tmp/graph14767900968936154795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14767900968936154795.bin' '-l' '-1' '-v' '-w' '/tmp/graph14767900968936154795.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:34:13] [INFO ] Decomposing Gal with order
[2024-05-29 13:34:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:34:13] [INFO ] Removed a total of 4143 redundant transitions.
[2024-05-29 13:34:13] [INFO ] Flatten gal took : 185 ms
[2024-05-29 13:34:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 53 ms.
[2024-05-29 13:34:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8741361515560084442.gal : 13 ms
[2024-05-29 13:34:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13495934515364651798.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/CTLFireability8741361515560084442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13495934515364651798.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.80253e+06,0.766933,26192,1524,21,29561,294,844,32375,42,990,0


Converting to forward existential form...Done !
original formula: AF(((EG(((((EG(((((i0.u31.p30==0)||(i0.u36.p66==0))||((i0.u15.p102==0)||(i0.u5.p138==0)))||(((i0.u1.p174==0)||(i0.u29.p210==0))||((i0.u10...1495
=> equivalent forward existential formula: [FwdG(Init,!(((EG(((((EG(((((i0.u31.p30==0)||(i0.u36.p66==0))||((i0.u15.p102==0)||(i0.u5.p138==0)))||(((i0.u1.p1...1897
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t8, t13, t21, t24, t26, t28, t31, t34, t637, t639, t641, t643, t645, t647, t650, t652...608
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,18.4258,433016,1,0,587302,298,17389,2.64342e+06,188,1027,2197918
FORMULA StigmergyCommit-PT-07a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 179/179 places, 742/742 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 177 transition count 649
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 116 rules applied. Total rules applied 209 place count 85 transition count 625
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 226 place count 77 transition count 616
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 228 place count 76 transition count 615
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 228 place count 76 transition count 606
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 246 place count 67 transition count 606
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 263 place count 50 transition count 588
Iterating global reduction 4 with 17 rules applied. Total rules applied 280 place count 50 transition count 588
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 4 with 257 rules applied. Total rules applied 537 place count 50 transition count 331
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 537 place count 50 transition count 324
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 551 place count 43 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 553 place count 42 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 554 place count 42 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 562 place count 42 transition count 314
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 578 place count 34 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 579 place count 33 transition count 305
Applied a total of 579 rules in 77 ms. Remains 33 /179 variables (removed 146) and now considering 305/742 (removed 437) transitions.
[2024-05-29 13:34:32] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
// Phase 1: matrix 296 rows 33 cols
[2024-05-29 13:34:32] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 13:34:32] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 13:34:32] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2024-05-29 13:34:32] [INFO ] Invariant cache hit.
[2024-05-29 13:34:32] [INFO ] State equation strengthened by 263 read => feed constraints.
[2024-05-29 13:34:32] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-29 13:34:32] [INFO ] Redundant transitions in 6 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-29 13:34:32] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2024-05-29 13:34:32] [INFO ] Invariant cache hit.
[2024-05-29 13:34:32] [INFO ] State equation strengthened by 263 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:34:34] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:34:34] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:34:34] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:34:34] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:34:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:34:34] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:34:34] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:34:35] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:34:36] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:34:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:34:38] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:34:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:34:38] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:34:38] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:34:38] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:34:38] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:34:38] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:34:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:34:38] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:34:38] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 295/328 variables, 33/104 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 262/366 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:34:43] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:34:43] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:34:43] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:34:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:34:44] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 5/371 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 12 (OVERLAPS) 1/329 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 14 (OVERLAPS) 0/329 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 372 constraints, problems are : Problem set: 0 solved, 297 unsolved in 25008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:34:59] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 295/328 variables, 33/110 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 262/372 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 297/669 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 1/329 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 670 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 76/76 constraints]
After SMT, in 56370ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 56372ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/179 places, 305/742 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56589 ms. Remains : 33/179 places, 305/742 transitions.
[2024-05-29 13:35:29] [INFO ] Flatten gal took : 29 ms
[2024-05-29 13:35:29] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:35:29] [INFO ] Input system was already deterministic with 305 transitions.
[2024-05-29 13:35:29] [INFO ] Flatten gal took : 14 ms
[2024-05-29 13:35:29] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:35:29] [INFO ] Time to serialize gal into /tmp/CTLFireability18399186277880536972.gal : 3 ms
[2024-05-29 13:35:29] [INFO ] Time to serialize properties into /tmp/CTLFireability17263964307447149083.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/CTLFireability18399186277880536972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17263964307447149083.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,527,0.142693,10256,2,508,5,5032,6,0,429,2833,0


Converting to forward existential form...Done !
original formula: EG(AG(EF(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246==0)||(p282==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U ((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p24...189
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, t20, t21...312
(forward)formula 0,1,0.545906,15856,1,0,387,19533,625,47,9763,13980,622
FORMULA StigmergyCommit-PT-07a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 742/742 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 174 transition count 736
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 174 transition count 736
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 170 transition count 732
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 170 transition count 732
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 170 transition count 730
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 168 transition count 728
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 168 transition count 728
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 166 transition count 726
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 166 transition count 726
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 164 transition count 724
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 164 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 163 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 163 transition count 721
Applied a total of 36 rules in 20 ms. Remains 163 /179 variables (removed 16) and now considering 721/742 (removed 21) transitions.
[2024-05-29 13:35:29] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2024-05-29 13:35:29] [INFO ] Computed 2 invariants in 7 ms
[2024-05-29 13:35:29] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 13:35:29] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2024-05-29 13:35:29] [INFO ] Invariant cache hit.
[2024-05-29 13:35:30] [INFO ] State equation strengthened by 581 read => feed constraints.
[2024-05-29 13:35:30] [INFO ] Implicit Places using invariants and state equation in 946 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1018 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/179 places, 721/742 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 12 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2024-05-29 13:35:30] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-05-29 13:35:30] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 13:35:30] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 13:35:30] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:35:30] [INFO ] Invariant cache hit.
[2024-05-29 13:35:31] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:35:31] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/179 places, 651/742 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1270 ms. Remains : 100/179 places, 651/742 transitions.
[2024-05-29 13:35:31] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:35:31] [INFO ] Flatten gal took : 28 ms
[2024-05-29 13:35:31] [INFO ] Input system was already deterministic with 651 transitions.
[2024-05-29 13:35:31] [INFO ] Flatten gal took : 29 ms
[2024-05-29 13:35:31] [INFO ] Flatten gal took : 28 ms
[2024-05-29 13:35:31] [INFO ] Time to serialize gal into /tmp/CTLFireability7183938963832421095.gal : 5 ms
[2024-05-29 13:35:31] [INFO ] Time to serialize properties into /tmp/CTLFireability17153976379778149827.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/CTLFireability7183938963832421095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17153976379778149827.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.80253e+06,2.5511,68388,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: AG(AF(E((AG(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))) + ((((p30==1)&&(p66==1))&...549
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E((!(E(TRUE U !(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))...619
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
(forward)formula 0,0,16.6953,363108,1,0,808,543523,1327,135,23917,429416,1376
FORMULA StigmergyCommit-PT-07a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 742/742 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 174 transition count 736
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 174 transition count 736
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 170 transition count 732
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 170 transition count 732
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 170 transition count 730
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 168 transition count 728
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 168 transition count 728
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 166 transition count 726
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 166 transition count 726
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 164 transition count 724
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 164 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 163 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 163 transition count 721
Applied a total of 36 rules in 21 ms. Remains 163 /179 variables (removed 16) and now considering 721/742 (removed 21) transitions.
[2024-05-29 13:35:48] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2024-05-29 13:35:48] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 13:35:48] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 13:35:48] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2024-05-29 13:35:48] [INFO ] Invariant cache hit.
[2024-05-29 13:35:48] [INFO ] State equation strengthened by 581 read => feed constraints.
[2024-05-29 13:35:49] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1112 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/179 places, 721/742 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 140 transition count 699
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 140 transition count 699
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 51 place count 140 transition count 692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 59 place count 132 transition count 684
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 132 transition count 684
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 75 place count 124 transition count 676
Iterating global reduction 1 with 8 rules applied. Total rules applied 83 place count 124 transition count 676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 91 place count 116 transition count 668
Iterating global reduction 1 with 8 rules applied. Total rules applied 99 place count 116 transition count 668
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 107 place count 108 transition count 660
Iterating global reduction 1 with 8 rules applied. Total rules applied 115 place count 108 transition count 660
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 122 place count 101 transition count 653
Iterating global reduction 1 with 7 rules applied. Total rules applied 129 place count 101 transition count 653
Applied a total of 129 rules in 18 ms. Remains 101 /162 variables (removed 61) and now considering 653/721 (removed 68) transitions.
[2024-05-29 13:35:49] [INFO ] Flow matrix only has 644 transitions (discarded 9 similar events)
// Phase 1: matrix 644 rows 101 cols
[2024-05-29 13:35:49] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 13:35:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 13:35:49] [INFO ] Flow matrix only has 644 transitions (discarded 9 similar events)
[2024-05-29 13:35:49] [INFO ] Invariant cache hit.
[2024-05-29 13:35:49] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:35:49] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 101/179 places, 653/742 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1382 ms. Remains : 101/179 places, 653/742 transitions.
[2024-05-29 13:35:49] [INFO ] Flatten gal took : 25 ms
[2024-05-29 13:35:49] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:35:49] [INFO ] Input system was already deterministic with 653 transitions.
[2024-05-29 13:35:49] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:35:49] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:35:49] [INFO ] Time to serialize gal into /tmp/CTLFireability9915981991040574869.gal : 5 ms
[2024-05-29 13:35:49] [INFO ] Time to serialize properties into /tmp/CTLFireability6500466215692073000.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/CTLFireability9915981991040574869.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6500466215692073000.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,7.80253e+06,2.65118,69188,2,4994,5,76714,6,0,1048,47571,0


Converting to forward existential form...Done !
original formula: AF((E(E(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1)))) U ((((E(((((p30==1)&&(p66==1))...1610
=> equivalent forward existential formula: [FwdG(Init,!((E(E(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1...2129
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...460
Detected timeout of ITS tools.
[2024-05-29 13:36:19] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:36:19] [INFO ] Applying decomposition
[2024-05-29 13:36:19] [INFO ] Flatten gal took : 26 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/graph2296168868189614984.txt' '-o' '/tmp/graph2296168868189614984.bin' '-w' '/tmp/graph2296168868189614984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2296168868189614984.bin' '-l' '-1' '-v' '-w' '/tmp/graph2296168868189614984.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:36:19] [INFO ] Decomposing Gal with order
[2024-05-29 13:36:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:36:20] [INFO ] Removed a total of 4141 redundant transitions.
[2024-05-29 13:36:20] [INFO ] Flatten gal took : 79 ms
[2024-05-29 13:36:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 39 ms.
[2024-05-29 13:36:20] [INFO ] Time to serialize gal into /tmp/CTLFireability1216093208735903058.gal : 6 ms
[2024-05-29 13:36:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2918370722225694183.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/CTLFireability1216093208735903058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2918370722225694183.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,7.80253e+06,1.35142,40712,1439,25,24521,276,848,311333,54,1095,0


Converting to forward existential form...Done !
original formula: AF((E(E(((((i1.u3.p30==1)&&(i1.u8.p66==1))&&((i1.u13.p102==1)&&(i1.u31.p138==1)))&&(((i1.u0.p174==1)&&(i1.u25.p210==1))&&((i1.u15.p246==1...2412
=> equivalent forward existential formula: [FwdG(Init,!((E(E(((((i1.u3.p30==1)&&(i1.u8.p66==1))&&((i1.u13.p102==1)&&(i1.u31.p138==1)))&&(((i1.u0.p174==1)&&...3143
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t6, t8, t13, t16, t19, t21, t23, t28, t637, t639, t641, t643, t645, t647, t649, t651,...638
Using saturation style SCC detection
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 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 a local 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,1,22.6012,346688,1,0,524335,332,13367,1.57744e+06,285,1095,1686657
FORMULA StigmergyCommit-PT-07a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 742/742 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 175 transition count 737
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 175 transition count 737
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 172 transition count 734
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 172 transition count 734
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 172 transition count 733
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 170 transition count 731
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 170 transition count 731
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 168 transition count 729
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 168 transition count 729
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 166 transition count 727
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 166 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 166 transition count 726
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 165 transition count 725
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 165 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 165 transition count 724
Applied a total of 31 rules in 17 ms. Remains 165 /179 variables (removed 14) and now considering 724/742 (removed 18) transitions.
[2024-05-29 13:36:42] [INFO ] Flow matrix only has 715 transitions (discarded 9 similar events)
// Phase 1: matrix 715 rows 165 cols
[2024-05-29 13:36:42] [INFO ] Computed 2 invariants in 7 ms
[2024-05-29 13:36:42] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-29 13:36:42] [INFO ] Flow matrix only has 715 transitions (discarded 9 similar events)
[2024-05-29 13:36:42] [INFO ] Invariant cache hit.
[2024-05-29 13:36:43] [INFO ] State equation strengthened by 582 read => feed constraints.
[2024-05-29 13:36:43] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned [164]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1122 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/179 places, 724/742 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 701
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 701
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 141 transition count 693
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 133 transition count 685
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 133 transition count 685
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 125 transition count 677
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 125 transition count 677
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 117 transition count 669
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 117 transition count 669
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 109 transition count 661
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 109 transition count 661
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 102 transition count 654
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 102 transition count 654
Applied a total of 132 rules in 18 ms. Remains 102 /164 variables (removed 62) and now considering 654/724 (removed 70) transitions.
[2024-05-29 13:36:43] [INFO ] Flow matrix only has 645 transitions (discarded 9 similar events)
// Phase 1: matrix 645 rows 102 cols
[2024-05-29 13:36:43] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 13:36:43] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 13:36:44] [INFO ] Flow matrix only has 645 transitions (discarded 9 similar events)
[2024-05-29 13:36:44] [INFO ] Invariant cache hit.
[2024-05-29 13:36:44] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:36:44] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/179 places, 654/742 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1378 ms. Remains : 102/179 places, 654/742 transitions.
[2024-05-29 13:36:44] [INFO ] Flatten gal took : 26 ms
[2024-05-29 13:36:44] [INFO ] Flatten gal took : 25 ms
[2024-05-29 13:36:44] [INFO ] Input system was already deterministic with 654 transitions.
[2024-05-29 13:36:44] [INFO ] Flatten gal took : 25 ms
[2024-05-29 13:36:44] [INFO ] Flatten gal took : 25 ms
[2024-05-29 13:36:44] [INFO ] Time to serialize gal into /tmp/CTLFireability15705017673786840374.gal : 5 ms
[2024-05-29 13:36:44] [INFO ] Time to serialize properties into /tmp/CTLFireability13942504830229255581.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/CTLFireability15705017673786840374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13942504830229255581.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,7.80253e+06,2.43435,68928,2,4830,5,76711,6,0,1053,48825,0


Converting to forward existential form...Done !
original formula: EX(AG((A(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1)))) U ((((p30==1)&&(p66==1))&&((p...250
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!((E(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p2...550
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...461
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,26.7627,589552,1,0,1074,1.30757e+06,1336,249,22699,809589,1720
FORMULA StigmergyCommit-PT-07a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 742/742 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 175 transition count 737
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 175 transition count 737
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 172 transition count 734
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 172 transition count 734
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 172 transition count 732
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 171 transition count 731
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 171 transition count 731
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 170 transition count 730
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 170 transition count 730
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 169 transition count 729
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 169 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 169 transition count 728
Applied a total of 23 rules in 23 ms. Remains 169 /179 variables (removed 10) and now considering 728/742 (removed 14) transitions.
[2024-05-29 13:37:11] [INFO ] Flow matrix only has 719 transitions (discarded 9 similar events)
// Phase 1: matrix 719 rows 169 cols
[2024-05-29 13:37:11] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 13:37:11] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 13:37:11] [INFO ] Flow matrix only has 719 transitions (discarded 9 similar events)
[2024-05-29 13:37:11] [INFO ] Invariant cache hit.
[2024-05-29 13:37:11] [INFO ] State equation strengthened by 584 read => feed constraints.
[2024-05-29 13:37:12] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1143 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/179 places, 728/742 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 145 transition count 705
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 145 transition count 705
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 145 transition count 697
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 137 transition count 689
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 137 transition count 689
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 129 transition count 681
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 129 transition count 681
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 121 transition count 673
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 121 transition count 673
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 113 transition count 665
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 113 transition count 665
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 106 transition count 658
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 106 transition count 658
Applied a total of 132 rules in 18 ms. Remains 106 /168 variables (removed 62) and now considering 658/728 (removed 70) transitions.
[2024-05-29 13:37:12] [INFO ] Flow matrix only has 649 transitions (discarded 9 similar events)
// Phase 1: matrix 649 rows 106 cols
[2024-05-29 13:37:12] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 13:37:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 13:37:12] [INFO ] Flow matrix only has 649 transitions (discarded 9 similar events)
[2024-05-29 13:37:12] [INFO ] Invariant cache hit.
[2024-05-29 13:37:12] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:37:12] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/179 places, 658/742 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1399 ms. Remains : 106/179 places, 658/742 transitions.
[2024-05-29 13:37:12] [INFO ] Flatten gal took : 23 ms
[2024-05-29 13:37:12] [INFO ] Flatten gal took : 25 ms
[2024-05-29 13:37:12] [INFO ] Input system was already deterministic with 658 transitions.
[2024-05-29 13:37:12] [INFO ] Flatten gal took : 31 ms
[2024-05-29 13:37:13] [INFO ] Flatten gal took : 25 ms
[2024-05-29 13:37:13] [INFO ] Time to serialize gal into /tmp/CTLFireability5779559134391800205.gal : 5 ms
[2024-05-29 13:37:13] [INFO ] Time to serialize properties into /tmp/CTLFireability9692989655805334303.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/CTLFireability5779559134391800205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9692989655805334303.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,7.80253e+06,2.71049,69212,2,4896,5,79196,6,0,1073,49166,0


Converting to forward existential form...Done !
original formula: AF(EX(A(EG(EX(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1)))))) U E(AF((p195==1)) U A(...359
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((E(!(E(!(EG(!((p195==1)))) U !((E(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==...1568
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...463
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,24.3255,562668,1,0,1238,1.37622e+06,1353,450,23771,988728,1942
FORMULA StigmergyCommit-PT-07a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 179/179 places, 742/742 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 177 transition count 649
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 116 rules applied. Total rules applied 209 place count 85 transition count 625
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 226 place count 77 transition count 616
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 228 place count 76 transition count 615
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 228 place count 76 transition count 606
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 246 place count 67 transition count 606
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 263 place count 50 transition count 588
Iterating global reduction 4 with 17 rules applied. Total rules applied 280 place count 50 transition count 588
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 4 with 257 rules applied. Total rules applied 537 place count 50 transition count 331
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 537 place count 50 transition count 324
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 551 place count 43 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 553 place count 42 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 554 place count 42 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 562 place count 42 transition count 314
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 578 place count 34 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 579 place count 33 transition count 305
Applied a total of 579 rules in 69 ms. Remains 33 /179 variables (removed 146) and now considering 305/742 (removed 437) transitions.
[2024-05-29 13:37:37] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
// Phase 1: matrix 296 rows 33 cols
[2024-05-29 13:37:37] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 13:37:37] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 13:37:37] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2024-05-29 13:37:37] [INFO ] Invariant cache hit.
[2024-05-29 13:37:37] [INFO ] State equation strengthened by 263 read => feed constraints.
[2024-05-29 13:37:37] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-29 13:37:37] [INFO ] Redundant transitions in 4 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-29 13:37:37] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2024-05-29 13:37:37] [INFO ] Invariant cache hit.
[2024-05-29 13:37:37] [INFO ] State equation strengthened by 263 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:37:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 295/328 variables, 33/104 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 262/366 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 5/371 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 12 (OVERLAPS) 1/329 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 14 (OVERLAPS) 0/329 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 372 constraints, problems are : Problem set: 0 solved, 297 unsolved in 25153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:38:05] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 295/328 variables, 33/110 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 262/372 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 297/669 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 1/329 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 670 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 76/76 constraints]
After SMT, in 56730ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 56734ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/179 places, 305/742 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57025 ms. Remains : 33/179 places, 305/742 transitions.
[2024-05-29 13:38:34] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:38:34] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:38:34] [INFO ] Input system was already deterministic with 305 transitions.
[2024-05-29 13:38:34] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:38:34] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:38:34] [INFO ] Time to serialize gal into /tmp/CTLFireability6722496594237612782.gal : 3 ms
[2024-05-29 13:38:34] [INFO ] Time to serialize properties into /tmp/CTLFireability17214636592332853636.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/CTLFireability6722496594237612782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17214636592332853636.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(!(A(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1)))) U ((((p30==1)&&(p66==1))&&((p10...227
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)...503
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, t20, t21...312
(forward)formula 0,0,0.685698,20344,1,0,419,26955,625,66,9512,18991,668
FORMULA StigmergyCommit-PT-07a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 179/179 places, 742/742 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 177 transition count 651
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 111 rules applied. Total rules applied 202 place count 87 transition count 630
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 217 place count 80 transition count 622
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 221 place count 79 transition count 619
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 226 place count 77 transition count 616
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 228 place count 76 transition count 615
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 228 place count 76 transition count 606
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 246 place count 67 transition count 606
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 263 place count 50 transition count 588
Iterating global reduction 6 with 17 rules applied. Total rules applied 280 place count 50 transition count 588
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 6 with 257 rules applied. Total rules applied 537 place count 50 transition count 331
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 537 place count 50 transition count 324
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 551 place count 43 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 553 place count 42 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 554 place count 42 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 562 place count 42 transition count 314
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 578 place count 34 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 579 place count 33 transition count 305
Applied a total of 579 rules in 85 ms. Remains 33 /179 variables (removed 146) and now considering 305/742 (removed 437) transitions.
[2024-05-29 13:38:35] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
// Phase 1: matrix 296 rows 33 cols
[2024-05-29 13:38:35] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:38:35] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 13:38:35] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2024-05-29 13:38:35] [INFO ] Invariant cache hit.
[2024-05-29 13:38:35] [INFO ] State equation strengthened by 263 read => feed constraints.
[2024-05-29 13:38:35] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-29 13:38:35] [INFO ] Redundant transitions in 4 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-29 13:38:35] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2024-05-29 13:38:35] [INFO ] Invariant cache hit.
[2024-05-29 13:38:35] [INFO ] State equation strengthened by 263 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:38:38] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:38:39] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:38:39] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:38:39] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:38:39] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 13:38:39] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:38:39] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 13:38:39] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:38:39] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:38:39] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:38:39] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:38:39] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:38:39] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:38:39] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:38:39] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:38:39] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:38:40] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:38:40] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:38:40] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:38:40] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:38:40] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:38:40] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:38:40] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 13:38:40] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:38:40] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:38:40] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:38:40] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:38:40] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:38:40] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:38:40] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:38:41] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:38:41] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:38:41] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:38:41] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:38:41] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:38:41] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:38:41] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:38:41] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:38:41] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:38:41] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:38:42] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:38:42] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:38:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:38:42] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:38:42] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:38:42] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:38:42] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:38:43] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:38:43] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:38:43] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:38:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:38:43] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:38:44] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/33 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 12 (OVERLAPS) 295/328 variables, 33/105 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 262/367 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 15 (OVERLAPS) 1/329 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/329 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 17 (OVERLAPS) 0/329 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 368 constraints, problems are : Problem set: 0 solved, 297 unsolved in 22885 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-29 13:39:01] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:39:01] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:39:01] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 295/328 variables, 33/108 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 262/370 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 297/667 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 1/329 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 668 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 74/74 constraints]
After SMT, in 54630ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 54634ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/179 places, 305/742 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54877 ms. Remains : 33/179 places, 305/742 transitions.
[2024-05-29 13:39:30] [INFO ] Flatten gal took : 19 ms
[2024-05-29 13:39:30] [INFO ] Flatten gal took : 13 ms
[2024-05-29 13:39:30] [INFO ] Input system was already deterministic with 305 transitions.
[2024-05-29 13:39:30] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:39:30] [INFO ] Flatten gal took : 12 ms
[2024-05-29 13:39:30] [INFO ] Time to serialize gal into /tmp/CTLFireability15825801144716953999.gal : 3 ms
[2024-05-29 13:39:30] [INFO ] Time to serialize properties into /tmp/CTLFireability5083857025322491893.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15825801144716953999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5083857025322491893.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(EG((EF((p65==1)) * EG((((((p30!=1)||(p66!=1))||((p102!=1)||(p138!=1)))||(((p174!=1)||(p210!=1))||((p246!=1)||(p282!=1)))) + AG(((((p30...252
=> equivalent forward existential formula: [FwdG(Init,!(EG((E(TRUE U (p65==1)) * EG((((((p30!=1)||(p66!=1))||((p102!=1)||(p138!=1)))||(((p174!=1)||(p210!=1...315
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, t19, t20, t21...312
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.07427,32224,1,0,474,39167,638,118,9962,32092,745
FORMULA StigmergyCommit-PT-07a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 742/742 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 174 transition count 736
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 174 transition count 736
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 170 transition count 732
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 170 transition count 732
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 170 transition count 730
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 168 transition count 728
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 168 transition count 728
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 166 transition count 726
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 166 transition count 726
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 164 transition count 724
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 164 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 163 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 163 transition count 721
Applied a total of 36 rules in 21 ms. Remains 163 /179 variables (removed 16) and now considering 721/742 (removed 21) transitions.
[2024-05-29 13:39:31] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2024-05-29 13:39:31] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 13:39:31] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 13:39:31] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2024-05-29 13:39:31] [INFO ] Invariant cache hit.
[2024-05-29 13:39:31] [INFO ] State equation strengthened by 581 read => feed constraints.
[2024-05-29 13:39:32] [INFO ] Implicit Places using invariants and state equation in 987 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1058 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/179 places, 721/742 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 13 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2024-05-29 13:39:32] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-05-29 13:39:32] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 13:39:32] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 13:39:32] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:39:32] [INFO ] Invariant cache hit.
[2024-05-29 13:39:32] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:39:32] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/179 places, 651/742 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1306 ms. Remains : 100/179 places, 651/742 transitions.
[2024-05-29 13:39:32] [INFO ] Flatten gal took : 26 ms
[2024-05-29 13:39:32] [INFO ] Flatten gal took : 25 ms
[2024-05-29 13:39:32] [INFO ] Input system was already deterministic with 651 transitions.
[2024-05-29 13:39:33] [INFO ] Flatten gal took : 25 ms
[2024-05-29 13:39:33] [INFO ] Flatten gal took : 26 ms
[2024-05-29 13:39:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1964814372865946051.gal : 6 ms
[2024-05-29 13:39:33] [INFO ] Time to serialize properties into /tmp/CTLFireability417009820939303485.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/CTLFireability1964814372865946051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability417009820939303485.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.80253e+06,2.59169,68380,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: EX((E((EG(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1)))))) * !(A(((((p30==1)&&(p66=...659
=> equivalent forward existential formula: [FwdG((EY(Init) * E((EG(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&...933
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
Detected timeout of ITS tools.
[2024-05-29 13:40:03] [INFO ] Flatten gal took : 26 ms
[2024-05-29 13:40:03] [INFO ] Applying decomposition
[2024-05-29 13:40:03] [INFO ] Flatten gal took : 25 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/graph17858776578147435267.txt' '-o' '/tmp/graph17858776578147435267.bin' '-w' '/tmp/graph17858776578147435267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17858776578147435267.bin' '-l' '-1' '-v' '-w' '/tmp/graph17858776578147435267.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:40:03] [INFO ] Decomposing Gal with order
[2024-05-29 13:40:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:40:03] [INFO ] Removed a total of 4141 redundant transitions.
[2024-05-29 13:40:03] [INFO ] Flatten gal took : 69 ms
[2024-05-29 13:40:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 13 ms.
[2024-05-29 13:40:03] [INFO ] Time to serialize gal into /tmp/CTLFireability8075901984923644190.gal : 6 ms
[2024-05-29 13:40:03] [INFO ] Time to serialize properties into /tmp/CTLFireability12331542801219148656.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/CTLFireability8075901984923644190.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12331542801219148656.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.80253e+06,0.758084,23800,1222,26,23151,292,829,83889,52,1014,0


Converting to forward existential form...Done !
original formula: EX((E((EG(!(((((i1.u2.p30==1)&&(i1.u20.p66==1))&&((i1.u13.p102==1)&&(i1.u4.p138==1)))&&(((i1.u15.p174==1)&&(i1.u33.p210==1))&&((i1.u28.p2...977
=> equivalent forward existential formula: [FwdG((EY(Init) * E((EG(!(((((i1.u2.p30==1)&&(i1.u20.p66==1))&&((i1.u13.p102==1)&&(i1.u4.p138==1)))&&(((i1.u15.p...1357
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t6, t13, t16, t18, t21, t23, t29, t33, t635, t637, t639, t641, t643, t645, t647, t649...640
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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,6.6946,188272,1,0,239621,347,14299,904200,269,1014,1353661
FORMULA StigmergyCommit-PT-07a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 742/742 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 174 transition count 736
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 174 transition count 736
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 170 transition count 732
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 170 transition count 732
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 170 transition count 730
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 168 transition count 728
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 168 transition count 728
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 166 transition count 726
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 166 transition count 726
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 164 transition count 724
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 164 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 163 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 163 transition count 721
Applied a total of 36 rules in 23 ms. Remains 163 /179 variables (removed 16) and now considering 721/742 (removed 21) transitions.
[2024-05-29 13:40:10] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2024-05-29 13:40:10] [INFO ] Computed 2 invariants in 7 ms
[2024-05-29 13:40:10] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 13:40:10] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2024-05-29 13:40:10] [INFO ] Invariant cache hit.
[2024-05-29 13:40:10] [INFO ] State equation strengthened by 581 read => feed constraints.
[2024-05-29 13:40:11] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1068 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/179 places, 721/742 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 19 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2024-05-29 13:40:11] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-05-29 13:40:11] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 13:40:11] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 13:40:11] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 13:40:11] [INFO ] Invariant cache hit.
[2024-05-29 13:40:11] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:40:11] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/179 places, 651/742 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1334 ms. Remains : 100/179 places, 651/742 transitions.
[2024-05-29 13:40:11] [INFO ] Flatten gal took : 29 ms
[2024-05-29 13:40:11] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:40:11] [INFO ] Input system was already deterministic with 651 transitions.
[2024-05-29 13:40:11] [INFO ] Flatten gal took : 26 ms
[2024-05-29 13:40:11] [INFO ] Flatten gal took : 27 ms
[2024-05-29 13:40:11] [INFO ] Time to serialize gal into /tmp/CTLFireability16821602096935300313.gal : 6 ms
[2024-05-29 13:40:11] [INFO ] Time to serialize properties into /tmp/CTLFireability13795718729100654693.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/CTLFireability16821602096935300313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13795718729100654693.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,7.80253e+06,2.62914,68384,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: EG((EF(AX(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246==0)||(p282==0)))))) * ((((p30==0)||(p66==0))||...231
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U !(EX(!(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246==0)...286
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
(forward)formula 0,0,16.2934,349040,1,0,899,610585,1320,230,23550,473774,1467
FORMULA StigmergyCommit-PT-07a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-29 13:40:28] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:40:28] [INFO ] Flatten gal took : 29 ms
Total runtime 693872 ms.

BK_STOP 1716990028257

--------------------
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="StigmergyCommit-PT-07a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-07a, 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-171690531700170"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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