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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K 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 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 18:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 11 18:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 11 18:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 203K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717007065096

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 18:24:26] [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 18:24:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:24:26] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-05-29 18:24:26] [INFO ] Transformed 563 places.
[2024-05-29 18:24:26] [INFO ] Transformed 780 transitions.
[2024-05-29 18:24:26] [INFO ] Found NUPN structural information;
[2024-05-29 18:24:26] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Support contains 114 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 780/780 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 503 transition count 720
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 503 transition count 720
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 147 place count 476 transition count 693
Iterating global reduction 0 with 27 rules applied. Total rules applied 174 place count 476 transition count 693
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 179 place count 471 transition count 688
Iterating global reduction 0 with 5 rules applied. Total rules applied 184 place count 471 transition count 688
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 186 place count 469 transition count 686
Iterating global reduction 0 with 2 rules applied. Total rules applied 188 place count 469 transition count 686
Applied a total of 188 rules in 127 ms. Remains 469 /563 variables (removed 94) and now considering 686/780 (removed 94) transitions.
// Phase 1: matrix 686 rows 469 cols
[2024-05-29 18:24:26] [INFO ] Computed 5 invariants in 28 ms
[2024-05-29 18:24:27] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-29 18:24:27] [INFO ] Invariant cache hit.
[2024-05-29 18:24:27] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2024-05-29 18:24:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (OVERLAPS) 1/469 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-29 18:24:37] [INFO ] Deduced a trap composed of 173 places in 185 ms of which 27 ms to minimize.
[2024-05-29 18:24:37] [INFO ] Deduced a trap composed of 167 places in 164 ms of which 3 ms to minimize.
[2024-05-29 18:24:38] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 3 ms to minimize.
[2024-05-29 18:24:38] [INFO ] Deduced a trap composed of 165 places in 172 ms of which 3 ms to minimize.
[2024-05-29 18:24:38] [INFO ] Deduced a trap composed of 168 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:24:39] [INFO ] Deduced a trap composed of 166 places in 149 ms of which 2 ms to minimize.
[2024-05-29 18:24:40] [INFO ] Deduced a trap composed of 174 places in 127 ms of which 3 ms to minimize.
[2024-05-29 18:24:40] [INFO ] Deduced a trap composed of 169 places in 156 ms of which 3 ms to minimize.
[2024-05-29 18:24:40] [INFO ] Deduced a trap composed of 172 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:24:40] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 2 ms to minimize.
[2024-05-29 18:24:41] [INFO ] Deduced a trap composed of 175 places in 126 ms of which 3 ms to minimize.
[2024-05-29 18:24:42] [INFO ] Deduced a trap composed of 177 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:24:42] [INFO ] Deduced a trap composed of 227 places in 138 ms of which 2 ms to minimize.
[2024-05-29 18:24:42] [INFO ] Deduced a trap composed of 170 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:24:43] [INFO ] Deduced a trap composed of 168 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:24:43] [INFO ] Deduced a trap composed of 167 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:24:43] [INFO ] Deduced a trap composed of 172 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:24:44] [INFO ] Deduced a trap composed of 171 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:24:45] [INFO ] Deduced a trap composed of 171 places in 128 ms of which 3 ms to minimize.
[2024-05-29 18:24:45] [INFO ] Deduced a trap composed of 169 places in 139 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-29 18:24:45] [INFO ] Deduced a trap composed of 170 places in 136 ms of which 3 ms to minimize.
[2024-05-29 18:24:45] [INFO ] Deduced a trap composed of 175 places in 133 ms of which 3 ms to minimize.
[2024-05-29 18:24:46] [INFO ] Deduced a trap composed of 166 places in 127 ms of which 3 ms to minimize.
[2024-05-29 18:24:46] [INFO ] Deduced a trap composed of 170 places in 132 ms of which 3 ms to minimize.
[2024-05-29 18:24:46] [INFO ] Deduced a trap composed of 169 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:24:47] [INFO ] Deduced a trap composed of 171 places in 140 ms of which 3 ms to minimize.
[2024-05-29 18:24:48] [INFO ] Deduced a trap composed of 175 places in 131 ms of which 3 ms to minimize.
[2024-05-29 18:24:48] [INFO ] Deduced a trap composed of 229 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:24:48] [INFO ] Deduced a trap composed of 170 places in 126 ms of which 3 ms to minimize.
[2024-05-29 18:24:48] [INFO ] Deduced a trap composed of 172 places in 139 ms of which 2 ms to minimize.
[2024-05-29 18:24:52] [INFO ] Deduced a trap composed of 169 places in 147 ms of which 2 ms to minimize.
[2024-05-29 18:24:52] [INFO ] Deduced a trap composed of 174 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:24:52] [INFO ] Deduced a trap composed of 165 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/1155 variables, and 38 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/469 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (OVERLAPS) 1/469 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 33/38 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-29 18:25:04] [INFO ] Deduced a trap composed of 172 places in 127 ms of which 3 ms to minimize.
[2024-05-29 18:25:07] [INFO ] Deduced a trap composed of 167 places in 137 ms of which 3 ms to minimize.
[2024-05-29 18:25:08] [INFO ] Deduced a trap composed of 167 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:25:08] [INFO ] Deduced a trap composed of 170 places in 149 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-29 18:25:12] [INFO ] Deduced a trap composed of 177 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-29 18:25:21] [INFO ] Deduced a trap composed of 170 places in 131 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-29 18:25:27] [INFO ] Deduced a trap composed of 173 places in 121 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/1155 variables, and 45 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/469 constraints, PredecessorRefiner: 0/685 constraints, Known Traps: 40/40 constraints]
After SMT, in 60500ms problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60537ms
Starting structural reductions in LTL mode, iteration 1 : 469/563 places, 686/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61316 ms. Remains : 469/563 places, 686/780 transitions.
Support contains 114 out of 469 places after structural reductions.
[2024-05-29 18:25:28] [INFO ] Flatten gal took : 81 ms
[2024-05-29 18:25:28] [INFO ] Flatten gal took : 39 ms
[2024-05-29 18:25:28] [INFO ] Input system was already deterministic with 686 transitions.
RANDOM walk for 40000 steps (546 resets) in 1777 ms. (22 steps per ms) remains 54/86 properties
BEST_FIRST walk for 4004 steps (10 resets) in 51 ms. (77 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (9 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (9 resets) in 28 ms. (138 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (10 resets) in 70 ms. (56 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (10 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (10 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 37 ms. (105 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (11 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (10 resets) in 10 ms. (363 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (9 resets) in 35 ms. (111 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (10 resets) in 9 ms. (400 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (10 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (10 resets) in 10 ms. (363 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (9 resets) in 8 ms. (444 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 8 ms. (444 steps per ms) remains 54/54 properties
[2024-05-29 18:25:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem AtomicPropp72 is UNSAT
At refinement iteration 1 (OVERLAPS) 391/469 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 53 unsolved
[2024-05-29 18:25:29] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 3 ms to minimize.
[2024-05-29 18:25:30] [INFO ] Deduced a trap composed of 173 places in 116 ms of which 2 ms to minimize.
[2024-05-29 18:25:30] [INFO ] Deduced a trap composed of 174 places in 160 ms of which 3 ms to minimize.
[2024-05-29 18:25:30] [INFO ] Deduced a trap composed of 171 places in 158 ms of which 3 ms to minimize.
Problem AtomicPropp22 is UNSAT
[2024-05-29 18:25:30] [INFO ] Deduced a trap composed of 166 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:25:30] [INFO ] Deduced a trap composed of 167 places in 126 ms of which 3 ms to minimize.
Problem AtomicPropp68 is UNSAT
[2024-05-29 18:25:31] [INFO ] Deduced a trap composed of 172 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 7/12 constraints. Problems are: Problem set: 3 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 686/1155 variables, 469/481 constraints. Problems are: Problem set: 3 solved, 51 unsolved
[2024-05-29 18:25:32] [INFO ] Deduced a trap composed of 167 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1155 variables, 1/482 constraints. Problems are: Problem set: 3 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1155 variables, 0/482 constraints. Problems are: Problem set: 3 solved, 51 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1155/1155 variables, and 482 constraints, problems are : Problem set: 3 solved, 51 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 469/469 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 3 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 51 unsolved
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 1 (OVERLAPS) 397/469 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 8/13 constraints. Problems are: Problem set: 5 solved, 49 unsolved
[2024-05-29 18:25:34] [INFO ] Deduced a trap composed of 173 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:25:35] [INFO ] Deduced a trap composed of 166 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:25:35] [INFO ] Deduced a trap composed of 168 places in 109 ms of which 3 ms to minimize.
[2024-05-29 18:25:35] [INFO ] Deduced a trap composed of 173 places in 130 ms of which 3 ms to minimize.
[2024-05-29 18:25:35] [INFO ] Deduced a trap composed of 177 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:25:35] [INFO ] Deduced a trap composed of 169 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 6/19 constraints. Problems are: Problem set: 5 solved, 49 unsolved
[2024-05-29 18:25:36] [INFO ] Deduced a trap composed of 170 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 1/20 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 0/20 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 686/1155 variables, 469/489 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1155 variables, 49/538 constraints. Problems are: Problem set: 5 solved, 49 unsolved
[2024-05-29 18:25:38] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 3 ms to minimize.
[2024-05-29 18:25:38] [INFO ] Deduced a trap composed of 169 places in 133 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1155 variables, 2/540 constraints. Problems are: Problem set: 5 solved, 49 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/1155 variables, and 540 constraints, problems are : Problem set: 5 solved, 49 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 469/469 constraints, PredecessorRefiner: 49/54 constraints, Known Traps: 17/17 constraints]
After SMT, in 10073ms problems are : Problem set: 5 solved, 49 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 686/686 transitions.
Graph (trivial) has 378 edges and 469 vertex of which 37 / 469 are part of one of the 7 SCC in 4 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Graph (complete) has 811 edges and 439 vertex of which 436 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 224 transitions
Trivial Post-agglo rules discarded 224 transitions
Performed 224 trivial Post agglomeration. Transition count delta: 224
Iterating post reduction 0 with 226 rules applied. Total rules applied 228 place count 436 transition count 420
Reduce places removed 224 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 230 rules applied. Total rules applied 458 place count 212 transition count 414
Reduce places removed 3 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 22 rules applied. Total rules applied 480 place count 209 transition count 395
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 25 rules applied. Total rules applied 505 place count 190 transition count 389
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 508 place count 187 transition count 389
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 508 place count 187 transition count 372
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 542 place count 170 transition count 372
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 543 place count 169 transition count 371
Iterating global reduction 5 with 1 rules applied. Total rules applied 544 place count 169 transition count 371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 544 place count 169 transition count 370
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 546 place count 168 transition count 370
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 547 place count 167 transition count 369
Iterating global reduction 5 with 1 rules applied. Total rules applied 548 place count 167 transition count 369
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 588 place count 147 transition count 348
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 589 place count 147 transition count 347
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 591 place count 145 transition count 345
Iterating global reduction 6 with 2 rules applied. Total rules applied 593 place count 145 transition count 345
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -14
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 609 place count 137 transition count 359
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 611 place count 137 transition count 357
Free-agglomeration rule applied 27 times.
Iterating global reduction 6 with 27 rules applied. Total rules applied 638 place count 137 transition count 330
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 665 place count 110 transition count 330
Applied a total of 665 rules in 130 ms. Remains 110 /469 variables (removed 359) and now considering 330/686 (removed 356) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 110/469 places, 330/686 transitions.
RANDOM walk for 40000 steps (272 resets) in 637 ms. (62 steps per ms) remains 28/49 properties
BEST_FIRST walk for 4003 steps (46 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (57 resets) in 21 ms. (181 steps per ms) remains 23/28 properties
BEST_FIRST walk for 4003 steps (44 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (22 resets) in 9 ms. (400 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4001 steps (24 resets) in 19 ms. (200 steps per ms) remains 19/22 properties
BEST_FIRST walk for 4004 steps (56 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (53 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (18 resets) in 10 ms. (363 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (54 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (55 resets) in 14 ms. (266 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (55 resets) in 18 ms. (210 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (51 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (22 resets) in 8 ms. (444 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4004 steps (56 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (51 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (47 resets) in 8 ms. (444 steps per ms) remains 11/14 properties
BEST_FIRST walk for 4003 steps (47 resets) in 14 ms. (266 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4000 steps (45 resets) in 8 ms. (444 steps per ms) remains 9/10 properties
// Phase 1: matrix 330 rows 110 cols
[2024-05-29 18:25:39] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 18:25:39] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 67/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 315/409 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 36/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 21/430 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 9/439 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/440 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/440 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 162 constraints, problems are : Problem set: 0 solved, 9 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 110/110 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 67/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 315/409 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 36/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 21/430 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 9/164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 9/439 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 1/440 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 18:25:41] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/440 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 172 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1131 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 110/110 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 1607ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 2 properties in 995 ms.
Support contains 22 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 330/330 transitions.
Graph (trivial) has 74 edges and 110 vertex of which 15 / 110 are part of one of the 5 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 349 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 99 transition count 289
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 55 place count 75 transition count 284
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 73 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 72 transition count 283
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 59 place count 72 transition count 281
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 63 place count 70 transition count 281
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 70 place count 63 transition count 248
Iterating global reduction 4 with 7 rules applied. Total rules applied 77 place count 63 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 63 transition count 247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 place count 63 transition count 246
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 80 place count 62 transition count 246
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 92 place count 56 transition count 240
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 98 place count 56 transition count 234
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 101 place count 53 transition count 229
Iterating global reduction 6 with 3 rules applied. Total rules applied 104 place count 53 transition count 229
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 106 place count 52 transition count 229
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 114 place count 52 transition count 221
Free-agglomeration rule applied 11 times with reduction of 12 identical transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 125 place count 52 transition count 198
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 143 place count 41 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 144 place count 41 transition count 190
Applied a total of 144 rules in 50 ms. Remains 41 /110 variables (removed 69) and now considering 190/330 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 41/110 places, 190/330 transitions.
RANDOM walk for 40000 steps (4411 resets) in 118 ms. (336 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (945 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
// Phase 1: matrix 190 rows 41 cols
[2024-05-29 18:25:42] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 18:25:42] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/30 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 176/206 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 77/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/230 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 30/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/231 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/231 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/30 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 18:25:42] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 176/206 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 77/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 18:25:42] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/230 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 30/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/231 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/231 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 359ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 21 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA StigmergyElection-PT-04b-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 18:25:42] [INFO ] Flatten gal took : 33 ms
[2024-05-29 18:25:43] [INFO ] Flatten gal took : 34 ms
[2024-05-29 18:25:43] [INFO ] Input system was already deterministic with 686 transitions.
Computed a total of 63 stabilizing places and 67 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 686/686 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 456 transition count 673
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 456 transition count 673
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 449 transition count 666
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 449 transition count 666
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 447 transition count 664
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 447 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 446 transition count 663
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 446 transition count 663
Applied a total of 46 rules in 69 ms. Remains 446 /469 variables (removed 23) and now considering 663/686 (removed 23) transitions.
// Phase 1: matrix 663 rows 446 cols
[2024-05-29 18:25:43] [INFO ] Computed 5 invariants in 8 ms
[2024-05-29 18:25:43] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-29 18:25:43] [INFO ] Invariant cache hit.
[2024-05-29 18:25:43] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Running 662 sub problems to find dead transitions.
[2024-05-29 18:25:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-05-29 18:25:53] [INFO ] Deduced a trap composed of 163 places in 168 ms of which 3 ms to minimize.
[2024-05-29 18:25:53] [INFO ] Deduced a trap composed of 164 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:25:54] [INFO ] Deduced a trap composed of 165 places in 137 ms of which 2 ms to minimize.
[2024-05-29 18:25:54] [INFO ] Deduced a trap composed of 163 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:25:55] [INFO ] Deduced a trap composed of 164 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:25:55] [INFO ] Deduced a trap composed of 166 places in 145 ms of which 2 ms to minimize.
[2024-05-29 18:25:55] [INFO ] Deduced a trap composed of 162 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:25:55] [INFO ] Deduced a trap composed of 166 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:25:56] [INFO ] Deduced a trap composed of 166 places in 139 ms of which 2 ms to minimize.
[2024-05-29 18:25:57] [INFO ] Deduced a trap composed of 167 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:25:57] [INFO ] Deduced a trap composed of 166 places in 130 ms of which 3 ms to minimize.
[2024-05-29 18:25:58] [INFO ] Deduced a trap composed of 163 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:25:58] [INFO ] Deduced a trap composed of 165 places in 138 ms of which 2 ms to minimize.
[2024-05-29 18:25:58] [INFO ] Deduced a trap composed of 165 places in 154 ms of which 3 ms to minimize.
[2024-05-29 18:25:58] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 2 ms to minimize.
[2024-05-29 18:25:58] [INFO ] Deduced a trap composed of 166 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:25:59] [INFO ] Deduced a trap composed of 165 places in 130 ms of which 3 ms to minimize.
[2024-05-29 18:25:59] [INFO ] Deduced a trap composed of 222 places in 152 ms of which 3 ms to minimize.
[2024-05-29 18:25:59] [INFO ] Deduced a trap composed of 165 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:25:59] [INFO ] Deduced a trap composed of 169 places in 134 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-05-29 18:25:59] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 2 ms to minimize.
[2024-05-29 18:26:00] [INFO ] Deduced a trap composed of 163 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:26:00] [INFO ] Deduced a trap composed of 165 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:26:00] [INFO ] Deduced a trap composed of 166 places in 114 ms of which 2 ms to minimize.
[2024-05-29 18:26:00] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:26:01] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:26:02] [INFO ] Deduced a trap composed of 167 places in 138 ms of which 2 ms to minimize.
[2024-05-29 18:26:02] [INFO ] Deduced a trap composed of 166 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:26:02] [INFO ] Deduced a trap composed of 166 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:26:06] [INFO ] Deduced a trap composed of 163 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:26:06] [INFO ] Deduced a trap composed of 220 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-05-29 18:26:12] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1109 variables, and 37 constraints, problems are : Problem set: 0 solved, 662 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 662/662 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 662 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-05-29 18:26:19] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:26:22] [INFO ] Deduced a trap composed of 163 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-05-29 18:26:29] [INFO ] Deduced a trap composed of 164 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:26:29] [INFO ] Deduced a trap composed of 165 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 6 (OVERLAPS) 663/1109 variables, 446/487 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1109 variables, 662/1149 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-05-29 18:26:43] [INFO ] Deduced a trap composed of 165 places in 130 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 1150 constraints, problems are : Problem set: 0 solved, 662 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 662/662 constraints, Known Traps: 37/37 constraints]
After SMT, in 60318ms problems are : Problem set: 0 solved, 662 unsolved
Search for dead transitions found 0 dead transitions in 60328ms
Starting structural reductions in LTL mode, iteration 1 : 446/469 places, 663/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60984 ms. Remains : 446/469 places, 663/686 transitions.
[2024-05-29 18:26:44] [INFO ] Flatten gal took : 43 ms
[2024-05-29 18:26:44] [INFO ] Flatten gal took : 27 ms
[2024-05-29 18:26:44] [INFO ] Input system was already deterministic with 663 transitions.
[2024-05-29 18:26:44] [INFO ] Flatten gal took : 22 ms
[2024-05-29 18:26:44] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:26:44] [INFO ] Time to serialize gal into /tmp/CTLFireability17613635724347177941.gal : 12 ms
[2024-05-29 18:26:44] [INFO ] Time to serialize properties into /tmp/CTLFireability12566265773535823703.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/CTLFireability17613635724347177941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12566265773535823703.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,8.61764e+08,9.93178,263324,2,20144,5,760910,6,0,2449,1.18489e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:27:14] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:27:14] [INFO ] Applying decomposition
[2024-05-29 18:27:14] [INFO ] Flatten gal took : 33 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/graph10374025855629197103.txt' '-o' '/tmp/graph10374025855629197103.bin' '-w' '/tmp/graph10374025855629197103.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10374025855629197103.bin' '-l' '-1' '-v' '-w' '/tmp/graph10374025855629197103.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:27:14] [INFO ] Decomposing Gal with order
[2024-05-29 18:27:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:27:14] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-29 18:27:14] [INFO ] Flatten gal took : 109 ms
[2024-05-29 18:27:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 22 ms.
[2024-05-29 18:27:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1388420220424217942.gal : 25 ms
[2024-05-29 18:27:15] [INFO ] Time to serialize properties into /tmp/CTLFireability335717010657989447.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/CTLFireability1388420220424217942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability335717010657989447.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.61764e+08,6.1688,232300,2021,16,419724,948,900,1.17978e+06,44,3147,0


Converting to forward existential form...Done !
original formula: AF((((i29.u179.p539==0) * ((EG((A((i18.u112.p336==1) U (((i1.u13.p86==1)&&(i1.u69.p209==1))&&((i1.u114.p344==1)&&(i1.u153.p504==1)))) + E...543
=> equivalent forward existential formula: [FwdG(Init,!((((i29.u179.p539==0) * ((EG((!((E(!((((i1.u13.p86==1)&&(i1.u69.p209==1))&&((i1.u114.p344==1)&&(i1.u...996
Reverse transition relation is NOT exact ! Due to transitions t61, t106, t140, t142, t159, t204, t238, t257, t302, t336, t354, t399, t400, t434, t436, t457...504
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 469/469 places, 686/686 transitions.
Graph (trivial) has 478 edges and 469 vertex of which 73 / 469 are part of one of the 12 SCC in 4 ms
Free SCC test removed 61 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 285 transitions
Trivial Post-agglo rules discarded 285 transitions
Performed 285 trivial Post agglomeration. Transition count delta: 285
Iterating post reduction 0 with 285 rules applied. Total rules applied 286 place count 407 transition count 331
Reduce places removed 285 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 293 rules applied. Total rules applied 579 place count 122 transition count 323
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 583 place count 118 transition count 323
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 583 place count 118 transition count 309
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 611 place count 104 transition count 309
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 618 place count 97 transition count 301
Iterating global reduction 3 with 7 rules applied. Total rules applied 625 place count 97 transition count 301
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 1 rules applied. Total rules applied 626 place count 97 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 627 place count 96 transition count 300
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 627 place count 96 transition count 298
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 631 place count 94 transition count 298
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 635 place count 90 transition count 286
Iterating global reduction 5 with 4 rules applied. Total rules applied 639 place count 90 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 640 place count 90 transition count 285
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 641 place count 89 transition count 284
Iterating global reduction 6 with 1 rules applied. Total rules applied 642 place count 89 transition count 284
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 670 place count 75 transition count 270
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 684 place count 61 transition count 131
Iterating global reduction 6 with 14 rules applied. Total rules applied 698 place count 61 transition count 131
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 706 place count 61 transition count 123
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 708 place count 59 transition count 119
Iterating global reduction 7 with 2 rules applied. Total rules applied 710 place count 59 transition count 119
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 712 place count 57 transition count 117
Iterating global reduction 7 with 2 rules applied. Total rules applied 714 place count 57 transition count 117
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 716 place count 56 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 720 place count 56 transition count 112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 728 place count 52 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 729 place count 51 transition count 107
Applied a total of 729 rules in 61 ms. Remains 51 /469 variables (removed 418) and now considering 107/686 (removed 579) transitions.
[2024-05-29 18:27:45] [INFO ] Flow matrix only has 102 transitions (discarded 5 similar events)
// Phase 1: matrix 102 rows 51 cols
[2024-05-29 18:27:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:27:45] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 18:27:45] [INFO ] Flow matrix only has 102 transitions (discarded 5 similar events)
[2024-05-29 18:27:45] [INFO ] Invariant cache hit.
[2024-05-29 18:27:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:27:45] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-29 18:27:45] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-29 18:27:45] [INFO ] Flow matrix only has 102 transitions (discarded 5 similar events)
[2024-05-29 18:27:45] [INFO ] Invariant cache hit.
[2024-05-29 18:27:45] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 4/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-29 18:27:45] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
[2024-05-29 18:27:45] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:27:45] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:27:45] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:27:45] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:27:45] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:27:45] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:27:45] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:27:45] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:27:45] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:27:46] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-29 18:27:46] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:27:46] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:27:46] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:27:46] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 101/152 variables, 51/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-29 18:27:47] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-29 18:27:47] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 1/153 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 85 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3325 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 4/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/152 variables, 51/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 98/182 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/153 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-29 18:27:50] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:27:50] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
[2024-05-29 18:27:50] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (OVERLAPS) 0/153 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 186 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3508 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 20/20 constraints]
After SMT, in 6875ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6876ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/469 places, 107/686 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7043 ms. Remains : 51/469 places, 107/686 transitions.
[2024-05-29 18:27:52] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:27:52] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:27:52] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-29 18:27:52] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:27:52] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:27:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9786522966898745595.gal : 1 ms
[2024-05-29 18:27:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15591054131341306820.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9786522966898745595.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15591054131341306820.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 20241 steps (2147 resets) in 71 ms. (281 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-04b-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 686/686 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 456 transition count 673
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 456 transition count 673
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 450 transition count 667
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 450 transition count 667
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 449 transition count 666
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 449 transition count 666
Applied a total of 40 rules in 43 ms. Remains 449 /469 variables (removed 20) and now considering 666/686 (removed 20) transitions.
// Phase 1: matrix 666 rows 449 cols
[2024-05-29 18:27:52] [INFO ] Computed 5 invariants in 7 ms
[2024-05-29 18:27:52] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-29 18:27:52] [INFO ] Invariant cache hit.
[2024-05-29 18:27:52] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 665 sub problems to find dead transitions.
[2024-05-29 18:27:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2024-05-29 18:28:02] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 3 ms to minimize.
[2024-05-29 18:28:04] [INFO ] Deduced a trap composed of 219 places in 143 ms of which 2 ms to minimize.
[2024-05-29 18:28:04] [INFO ] Deduced a trap composed of 168 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:28:04] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:28:04] [INFO ] Deduced a trap composed of 163 places in 114 ms of which 2 ms to minimize.
[2024-05-29 18:28:04] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:28:05] [INFO ] Deduced a trap composed of 167 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:28:05] [INFO ] Deduced a trap composed of 166 places in 137 ms of which 3 ms to minimize.
[2024-05-29 18:28:05] [INFO ] Deduced a trap composed of 165 places in 104 ms of which 2 ms to minimize.
[2024-05-29 18:28:06] [INFO ] Deduced a trap composed of 167 places in 112 ms of which 2 ms to minimize.
[2024-05-29 18:28:06] [INFO ] Deduced a trap composed of 166 places in 130 ms of which 2 ms to minimize.
[2024-05-29 18:28:06] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 2 ms to minimize.
[2024-05-29 18:28:07] [INFO ] Deduced a trap composed of 166 places in 167 ms of which 2 ms to minimize.
[2024-05-29 18:28:07] [INFO ] Deduced a trap composed of 165 places in 143 ms of which 2 ms to minimize.
[2024-05-29 18:28:07] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 2 ms to minimize.
[2024-05-29 18:28:07] [INFO ] Deduced a trap composed of 166 places in 140 ms of which 3 ms to minimize.
[2024-05-29 18:28:08] [INFO ] Deduced a trap composed of 166 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:28:08] [INFO ] Deduced a trap composed of 168 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:28:08] [INFO ] Deduced a trap composed of 216 places in 163 ms of which 3 ms to minimize.
[2024-05-29 18:28:08] [INFO ] Deduced a trap composed of 214 places in 139 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2024-05-29 18:28:12] [INFO ] Deduced a trap composed of 164 places in 105 ms of which 2 ms to minimize.
[2024-05-29 18:28:13] [INFO ] Deduced a trap composed of 165 places in 108 ms of which 3 ms to minimize.
[2024-05-29 18:28:13] [INFO ] Deduced a trap composed of 166 places in 148 ms of which 2 ms to minimize.
[2024-05-29 18:28:13] [INFO ] Deduced a trap composed of 168 places in 147 ms of which 4 ms to minimize.
[2024-05-29 18:28:13] [INFO ] Deduced a trap composed of 225 places in 127 ms of which 3 ms to minimize.
[2024-05-29 18:28:14] [INFO ] Deduced a trap composed of 169 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:28:14] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 3 ms to minimize.
[2024-05-29 18:28:14] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:28:14] [INFO ] Deduced a trap composed of 165 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2024-05-29 18:28:21] [INFO ] Deduced a trap composed of 166 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:28:21] [INFO ] Deduced a trap composed of 166 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:28:22] [INFO ] Deduced a trap composed of 165 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/1115 variables, and 37 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 665 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2024-05-29 18:28:32] [INFO ] Deduced a trap composed of 166 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 5 (OVERLAPS) 666/1115 variables, 449/487 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1115 variables, 665/1152 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2024-05-29 18:28:44] [INFO ] Deduced a trap composed of 169 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:28:46] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:28:46] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:28:47] [INFO ] Deduced a trap composed of 340 places in 172 ms of which 2 ms to minimize.
[2024-05-29 18:28:52] [INFO ] Deduced a trap composed of 168 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1115/1115 variables, and 1157 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 449/449 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 38/38 constraints]
After SMT, in 60322ms problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Starting structural reductions in LTL mode, iteration 1 : 449/469 places, 666/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60810 ms. Remains : 449/469 places, 666/686 transitions.
[2024-05-29 18:28:53] [INFO ] Flatten gal took : 18 ms
[2024-05-29 18:28:53] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:28:53] [INFO ] Input system was already deterministic with 666 transitions.
[2024-05-29 18:28:53] [INFO ] Flatten gal took : 18 ms
[2024-05-29 18:28:53] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:28:53] [INFO ] Time to serialize gal into /tmp/CTLFireability702089513403810082.gal : 6 ms
[2024-05-29 18:28:53] [INFO ] Time to serialize properties into /tmp/CTLFireability13076558831486774818.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/CTLFireability702089513403810082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13076558831486774818.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,8.37474e+08,9.0505,233896,2,19566,5,691363,6,0,2464,1.0565e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:29:23] [INFO ] Flatten gal took : 21 ms
[2024-05-29 18:29:23] [INFO ] Applying decomposition
[2024-05-29 18:29:23] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6352955285694266786.txt' '-o' '/tmp/graph6352955285694266786.bin' '-w' '/tmp/graph6352955285694266786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6352955285694266786.bin' '-l' '-1' '-v' '-w' '/tmp/graph6352955285694266786.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:29:23] [INFO ] Decomposing Gal with order
[2024-05-29 18:29:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:29:23] [INFO ] Removed a total of 801 redundant transitions.
[2024-05-29 18:29:23] [INFO ] Flatten gal took : 34 ms
[2024-05-29 18:29:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2024-05-29 18:29:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9574633773210981430.gal : 5 ms
[2024-05-29 18:29:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2105358530820978963.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/CTLFireability9574633773210981430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2105358530820978963.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,8.37474e+08,6.01996,185408,1940,14,328971,967,898,942220,44,3231,0


Converting to forward existential form...Done !
original formula: EG((A(AF((EG((i10.u51.p156==1)) + EX((i30.u189.p553==1)))) U (((i1.u59.p257==1)&&(i24.u148.p433==1)) + EG(AF((i23.i0.i1.u145.p424==1)))))...252
=> equivalent forward existential formula: [FwdG(Init,(!((E(!((((i1.u59.p257==1)&&(i24.u148.p433==1)) + EG(!(EG(!((i23.i0.i1.u145.p424==1))))))) U (!(!(EG(...585
Reverse transition relation is NOT exact ! Due to transitions t60, t105, t141, t143, t160, t208, t209, t243, t245, t262, t341, t343, t359, t404, t438, t440...521
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 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 686/686 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 456 transition count 673
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 456 transition count 673
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 448 transition count 665
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 448 transition count 665
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 446 transition count 663
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 446 transition count 663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 445 transition count 662
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 445 transition count 662
Applied a total of 48 rules in 47 ms. Remains 445 /469 variables (removed 24) and now considering 662/686 (removed 24) transitions.
// Phase 1: matrix 662 rows 445 cols
[2024-05-29 18:29:53] [INFO ] Computed 5 invariants in 7 ms
[2024-05-29 18:29:53] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-29 18:29:53] [INFO ] Invariant cache hit.
[2024-05-29 18:29:53] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 661 sub problems to find dead transitions.
[2024-05-29 18:29:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:30:04] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 3 ms to minimize.
[2024-05-29 18:30:04] [INFO ] Deduced a trap composed of 165 places in 130 ms of which 2 ms to minimize.
[2024-05-29 18:30:04] [INFO ] Deduced a trap composed of 162 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:30:04] [INFO ] Deduced a trap composed of 165 places in 116 ms of which 2 ms to minimize.
[2024-05-29 18:30:05] [INFO ] Deduced a trap composed of 163 places in 126 ms of which 3 ms to minimize.
[2024-05-29 18:30:05] [INFO ] Deduced a trap composed of 163 places in 154 ms of which 3 ms to minimize.
[2024-05-29 18:30:05] [INFO ] Deduced a trap composed of 218 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:30:06] [INFO ] Deduced a trap composed of 162 places in 121 ms of which 3 ms to minimize.
[2024-05-29 18:30:06] [INFO ] Deduced a trap composed of 165 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:30:07] [INFO ] Deduced a trap composed of 166 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:30:07] [INFO ] Deduced a trap composed of 166 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:30:07] [INFO ] Deduced a trap composed of 165 places in 130 ms of which 2 ms to minimize.
[2024-05-29 18:30:07] [INFO ] Deduced a trap composed of 165 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:30:07] [INFO ] Deduced a trap composed of 164 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:30:07] [INFO ] Deduced a trap composed of 163 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:30:08] [INFO ] Deduced a trap composed of 163 places in 110 ms of which 2 ms to minimize.
[2024-05-29 18:30:08] [INFO ] Deduced a trap composed of 167 places in 138 ms of which 3 ms to minimize.
[2024-05-29 18:30:09] [INFO ] Deduced a trap composed of 165 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:30:09] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 3 ms to minimize.
[2024-05-29 18:30:09] [INFO ] Deduced a trap composed of 167 places in 149 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:30:12] [INFO ] Deduced a trap composed of 166 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:30:13] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 3 ms to minimize.
[2024-05-29 18:30:13] [INFO ] Deduced a trap composed of 166 places in 140 ms of which 2 ms to minimize.
[2024-05-29 18:30:14] [INFO ] Deduced a trap composed of 165 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:30:15] [INFO ] Deduced a trap composed of 167 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:30:21] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:30:21] [INFO ] Deduced a trap composed of 168 places in 125 ms of which 11 ms to minimize.
[2024-05-29 18:30:23] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1107 variables, and 33 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/445 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:30:33] [INFO ] Deduced a trap composed of 165 places in 132 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:30:36] [INFO ] Deduced a trap composed of 165 places in 126 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 6 (OVERLAPS) 662/1107 variables, 445/480 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1107 variables, 661/1141 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1107/1107 variables, and 1141 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 445/445 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 30/30 constraints]
After SMT, in 60265ms problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 60273ms
Starting structural reductions in LTL mode, iteration 1 : 445/469 places, 662/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60702 ms. Remains : 445/469 places, 662/686 transitions.
[2024-05-29 18:30:54] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:30:54] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:30:54] [INFO ] Input system was already deterministic with 662 transitions.
[2024-05-29 18:30:54] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:30:54] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:30:54] [INFO ] Time to serialize gal into /tmp/CTLFireability1912095569138167942.gal : 3 ms
[2024-05-29 18:30:54] [INFO ] Time to serialize properties into /tmp/CTLFireability6890676301392598515.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/CTLFireability1912095569138167942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6890676301392598515.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,8.09348e+08,9.04374,206428,2,14595,5,608224,6,0,2444,895994,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:31:24] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:31:24] [INFO ] Applying decomposition
[2024-05-29 18:31:24] [INFO ] Flatten gal took : 15 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/graph15815417912525611030.txt' '-o' '/tmp/graph15815417912525611030.bin' '-w' '/tmp/graph15815417912525611030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15815417912525611030.bin' '-l' '-1' '-v' '-w' '/tmp/graph15815417912525611030.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:31:24] [INFO ] Decomposing Gal with order
[2024-05-29 18:31:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:31:24] [INFO ] Removed a total of 795 redundant transitions.
[2024-05-29 18:31:24] [INFO ] Flatten gal took : 35 ms
[2024-05-29 18:31:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-29 18:31:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14960867430720946808.gal : 6 ms
[2024-05-29 18:31:24] [INFO ] Time to serialize properties into /tmp/CTLFireability7800513450892938222.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/CTLFireability14960867430720946808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7800513450892938222.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,8.09348e+08,5.01998,168208,1736,13,319799,962,894,787225,47,2999,0


Converting to forward existential form...Done !
original formula: ((AF((((A((((i2.u9.p27==1)&&(i2.u47.p187==1))&&((i2.u98.p297==1)&&(i2.u138.p444==1))) U ((i27.i1.i1.u157.p474==1)||(((i2.u19.p52==1)&&(i2...838
=> equivalent forward existential formula: [(EY((Init * !((!(EG(!((((!((E(!(((i27.i1.i1.u157.p474==1)||(((i2.u19.p52==1)&&(i2.u52.p162==1))&&((i2.u103.p309...1370
Reverse transition relation is NOT exact ! Due to transitions t59, t106, t140, t142, t159, t204, t238, t240, t257, t302, t336, t354, t434, t436, t457, t459...479
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 686/686 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 455 transition count 672
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 455 transition count 672
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 447 transition count 664
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 447 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 446 transition count 663
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 446 transition count 663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 445 transition count 662
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 445 transition count 662
Applied a total of 48 rules in 43 ms. Remains 445 /469 variables (removed 24) and now considering 662/686 (removed 24) transitions.
// Phase 1: matrix 662 rows 445 cols
[2024-05-29 18:31:54] [INFO ] Computed 5 invariants in 10 ms
[2024-05-29 18:31:54] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-29 18:31:54] [INFO ] Invariant cache hit.
[2024-05-29 18:31:55] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 661 sub problems to find dead transitions.
[2024-05-29 18:31:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:32:05] [INFO ] Deduced a trap composed of 162 places in 166 ms of which 3 ms to minimize.
[2024-05-29 18:32:05] [INFO ] Deduced a trap composed of 166 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:32:05] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:32:05] [INFO ] Deduced a trap composed of 162 places in 110 ms of which 2 ms to minimize.
[2024-05-29 18:32:06] [INFO ] Deduced a trap composed of 219 places in 139 ms of which 3 ms to minimize.
[2024-05-29 18:32:06] [INFO ] Deduced a trap composed of 165 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:32:06] [INFO ] Deduced a trap composed of 162 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:32:06] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:32:07] [INFO ] Deduced a trap composed of 164 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:32:07] [INFO ] Deduced a trap composed of 163 places in 110 ms of which 2 ms to minimize.
[2024-05-29 18:32:07] [INFO ] Deduced a trap composed of 166 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:32:07] [INFO ] Deduced a trap composed of 166 places in 140 ms of which 3 ms to minimize.
[2024-05-29 18:32:08] [INFO ] Deduced a trap composed of 165 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:32:08] [INFO ] Deduced a trap composed of 163 places in 151 ms of which 2 ms to minimize.
[2024-05-29 18:32:08] [INFO ] Deduced a trap composed of 166 places in 139 ms of which 3 ms to minimize.
[2024-05-29 18:32:08] [INFO ] Deduced a trap composed of 164 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:32:09] [INFO ] Deduced a trap composed of 163 places in 112 ms of which 2 ms to minimize.
[2024-05-29 18:32:09] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:32:09] [INFO ] Deduced a trap composed of 219 places in 133 ms of which 3 ms to minimize.
[2024-05-29 18:32:09] [INFO ] Deduced a trap composed of 166 places in 118 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:32:11] [INFO ] Deduced a trap composed of 165 places in 110 ms of which 2 ms to minimize.
[2024-05-29 18:32:12] [INFO ] Deduced a trap composed of 166 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:32:13] [INFO ] Deduced a trap composed of 166 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:32:14] [INFO ] Deduced a trap composed of 166 places in 105 ms of which 2 ms to minimize.
[2024-05-29 18:32:14] [INFO ] Deduced a trap composed of 164 places in 110 ms of which 1 ms to minimize.
[2024-05-29 18:32:14] [INFO ] Deduced a trap composed of 165 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:32:14] [INFO ] Deduced a trap composed of 165 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:32:15] [INFO ] Deduced a trap composed of 218 places in 147 ms of which 3 ms to minimize.
[2024-05-29 18:32:15] [INFO ] Deduced a trap composed of 163 places in 140 ms of which 3 ms to minimize.
[2024-05-29 18:32:15] [INFO ] Deduced a trap composed of 164 places in 144 ms of which 2 ms to minimize.
[2024-05-29 18:32:15] [INFO ] Deduced a trap composed of 167 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:32:15] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 12/37 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:32:22] [INFO ] Deduced a trap composed of 166 places in 121 ms of which 3 ms to minimize.
[2024-05-29 18:32:23] [INFO ] Deduced a trap composed of 164 places in 124 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1107 variables, and 39 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/445 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:32:31] [INFO ] Deduced a trap composed of 165 places in 131 ms of which 3 ms to minimize.
[2024-05-29 18:32:34] [INFO ] Deduced a trap composed of 168 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 5 (OVERLAPS) 662/1107 variables, 445/486 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1107 variables, 661/1147 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-29 18:32:51] [INFO ] Deduced a trap composed of 165 places in 156 ms of which 3 ms to minimize.
[2024-05-29 18:32:51] [INFO ] Deduced a trap composed of 165 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1107/1107 variables, and 1149 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 445/445 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 38/38 constraints]
After SMT, in 60286ms problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 60304ms
Starting structural reductions in LTL mode, iteration 1 : 445/469 places, 662/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60721 ms. Remains : 445/469 places, 662/686 transitions.
[2024-05-29 18:32:55] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:32:55] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:32:55] [INFO ] Input system was already deterministic with 662 transitions.
[2024-05-29 18:32:55] [INFO ] Flatten gal took : 39 ms
[2024-05-29 18:32:55] [INFO ] Flatten gal took : 47 ms
[2024-05-29 18:32:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13813855149374318854.gal : 16 ms
[2024-05-29 18:32:55] [INFO ] Time to serialize properties into /tmp/CTLFireability2558694995727568081.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/CTLFireability13813855149374318854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2558694995727568081.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,8.04272e+08,8.09195,206464,2,15006,5,608587,6,0,2444,903937,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:33:25] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:33:25] [INFO ] Applying decomposition
[2024-05-29 18:33:25] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16944910296286492456.txt' '-o' '/tmp/graph16944910296286492456.bin' '-w' '/tmp/graph16944910296286492456.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16944910296286492456.bin' '-l' '-1' '-v' '-w' '/tmp/graph16944910296286492456.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:33:25] [INFO ] Decomposing Gal with order
[2024-05-29 18:33:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:33:25] [INFO ] Removed a total of 793 redundant transitions.
[2024-05-29 18:33:25] [INFO ] Flatten gal took : 27 ms
[2024-05-29 18:33:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2024-05-29 18:33:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13569083759706763008.gal : 3 ms
[2024-05-29 18:33:25] [INFO ] Time to serialize properties into /tmp/CTLFireability5695453396793824353.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/CTLFireability13569083759706763008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5695453396793824353.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,8.04272e+08,5.19325,182396,1769,16,339497,939,891,837661,47,3104,0


Converting to forward existential form...Done !
original formula: AG(EF((!(E(AG((i26.u166.p512==1)) U (i9.u59.p183!=1))) + ((AX((i11.u49.p159==0)) + (((i2.u2.p52==1)&&(i2.u60.p187==1))&&((i2.u95.p297==1)...315
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!(E(!(E(TRUE U !((i26.u166.p512==1)))) U (i9.u59.p183!=1))) + ((!(EX(!((i11.u49....468
Reverse transition relation is NOT exact ! Due to transitions t32, t60, t106, t140, t142, t159, t238, t240, t257, t302, t336, t338, t354, t433, t435, t456,...463
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 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 686/686 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 454 transition count 671
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 454 transition count 671
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 445 transition count 662
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 445 transition count 662
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 443 transition count 660
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 442 transition count 659
Applied a total of 54 rules in 48 ms. Remains 442 /469 variables (removed 27) and now considering 659/686 (removed 27) transitions.
// Phase 1: matrix 659 rows 442 cols
[2024-05-29 18:33:55] [INFO ] Computed 5 invariants in 9 ms
[2024-05-29 18:33:56] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-29 18:33:56] [INFO ] Invariant cache hit.
[2024-05-29 18:33:56] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2024-05-29 18:33:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:34:06] [INFO ] Deduced a trap composed of 162 places in 155 ms of which 3 ms to minimize.
[2024-05-29 18:34:06] [INFO ] Deduced a trap composed of 163 places in 127 ms of which 3 ms to minimize.
[2024-05-29 18:34:06] [INFO ] Deduced a trap composed of 162 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:34:07] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:34:07] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 3 ms to minimize.
[2024-05-29 18:34:07] [INFO ] Deduced a trap composed of 163 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:34:08] [INFO ] Deduced a trap composed of 219 places in 158 ms of which 3 ms to minimize.
[2024-05-29 18:34:08] [INFO ] Deduced a trap composed of 162 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:34:08] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:34:08] [INFO ] Deduced a trap composed of 164 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:34:08] [INFO ] Deduced a trap composed of 163 places in 108 ms of which 2 ms to minimize.
[2024-05-29 18:34:09] [INFO ] Deduced a trap composed of 165 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:34:09] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:34:09] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:34:10] [INFO ] Deduced a trap composed of 165 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:34:10] [INFO ] Deduced a trap composed of 166 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:34:10] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:34:10] [INFO ] Deduced a trap composed of 163 places in 103 ms of which 2 ms to minimize.
[2024-05-29 18:34:11] [INFO ] Deduced a trap composed of 164 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:34:11] [INFO ] Deduced a trap composed of 163 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:34:12] [INFO ] Deduced a trap composed of 164 places in 132 ms of which 3 ms to minimize.
[2024-05-29 18:34:12] [INFO ] Deduced a trap composed of 164 places in 131 ms of which 3 ms to minimize.
[2024-05-29 18:34:12] [INFO ] Deduced a trap composed of 165 places in 140 ms of which 2 ms to minimize.
[2024-05-29 18:34:12] [INFO ] Deduced a trap composed of 163 places in 105 ms of which 2 ms to minimize.
[2024-05-29 18:34:13] [INFO ] Deduced a trap composed of 165 places in 127 ms of which 3 ms to minimize.
[2024-05-29 18:34:13] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 2 ms to minimize.
[2024-05-29 18:34:14] [INFO ] Deduced a trap composed of 166 places in 136 ms of which 3 ms to minimize.
[2024-05-29 18:34:14] [INFO ] Deduced a trap composed of 165 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:34:14] [INFO ] Deduced a trap composed of 164 places in 111 ms of which 2 ms to minimize.
[2024-05-29 18:34:15] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:34:17] [INFO ] Deduced a trap composed of 166 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:34:18] [INFO ] Deduced a trap composed of 192 places in 146 ms of which 3 ms to minimize.
[2024-05-29 18:34:18] [INFO ] Deduced a trap composed of 163 places in 134 ms of which 5 ms to minimize.
[2024-05-29 18:34:18] [INFO ] Deduced a trap composed of 166 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:34:18] [INFO ] Deduced a trap composed of 164 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1101 variables, and 40 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:34:34] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:34:42] [INFO ] Deduced a trap composed of 164 places in 126 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:34:45] [INFO ] Deduced a trap composed of 164 places in 114 ms of which 2 ms to minimize.
[2024-05-29 18:34:46] [INFO ] Deduced a trap composed of 164 places in 129 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/1101 variables, and 44 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 0/658 constraints, Known Traps: 39/39 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Starting structural reductions in LTL mode, iteration 1 : 442/469 places, 659/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60815 ms. Remains : 442/469 places, 659/686 transitions.
[2024-05-29 18:34:56] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:34:56] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:34:56] [INFO ] Input system was already deterministic with 659 transitions.
[2024-05-29 18:34:56] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:34:56] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:34:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16734078129478476432.gal : 3 ms
[2024-05-29 18:34:56] [INFO ] Time to serialize properties into /tmp/CTLFireability11957333701412167948.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/CTLFireability16734078129478476432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11957333701412167948.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.96896e+08,9.22619,208488,2,14684,5,623552,6,0,2429,915094,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:35:26] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:35:26] [INFO ] Applying decomposition
[2024-05-29 18:35:26] [INFO ] Flatten gal took : 15 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/graph13988706676593981778.txt' '-o' '/tmp/graph13988706676593981778.bin' '-w' '/tmp/graph13988706676593981778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13988706676593981778.bin' '-l' '-1' '-v' '-w' '/tmp/graph13988706676593981778.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:35:26] [INFO ] Decomposing Gal with order
[2024-05-29 18:35:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:35:27] [INFO ] Removed a total of 794 redundant transitions.
[2024-05-29 18:35:27] [INFO ] Flatten gal took : 35 ms
[2024-05-29 18:35:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 13 ms.
[2024-05-29 18:35:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17291990009533582841.gal : 6 ms
[2024-05-29 18:35:27] [INFO ] Time to serialize properties into /tmp/CTLFireability6670009107879340957.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/CTLFireability17291990009533582841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6670009107879340957.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.96896e+08,9.01742,288028,1765,13,492850,886,892,1.60796e+06,42,3013,0


Converting to forward existential form...Done !
original formula: EG(((A(!(AF((((i14.u33.p52==1)&&(i14.u48.p174==1))&&((i14.u96.p297==1)&&(i14.u138.p432==1))))) U ((i7.i0.i0.u51.p153==1)&&((((((i14.u13.p...474
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(((i7.i0.i0.u51.p153==1)&&((((((i14.u13.p39==1)&&(i14.u53.p162==1))&&((i14.u91.p322==1)&&(i14...1046
Reverse transition relation is NOT exact ! Due to transitions t59, t138, t140, t157, t202, t236, t255, t334, t336, t352, t431, t433, t454, t456, t458, t459...472
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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 686/686 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 454 transition count 671
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 454 transition count 671
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 445 transition count 662
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 445 transition count 662
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 443 transition count 660
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 442 transition count 659
Applied a total of 54 rules in 32 ms. Remains 442 /469 variables (removed 27) and now considering 659/686 (removed 27) transitions.
[2024-05-29 18:35:57] [INFO ] Invariant cache hit.
[2024-05-29 18:35:57] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-29 18:35:57] [INFO ] Invariant cache hit.
[2024-05-29 18:35:57] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2024-05-29 18:35:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:36:07] [INFO ] Deduced a trap composed of 162 places in 161 ms of which 3 ms to minimize.
[2024-05-29 18:36:07] [INFO ] Deduced a trap composed of 163 places in 116 ms of which 2 ms to minimize.
[2024-05-29 18:36:07] [INFO ] Deduced a trap composed of 162 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:36:08] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:36:08] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:36:08] [INFO ] Deduced a trap composed of 163 places in 123 ms of which 3 ms to minimize.
[2024-05-29 18:36:09] [INFO ] Deduced a trap composed of 219 places in 154 ms of which 3 ms to minimize.
[2024-05-29 18:36:09] [INFO ] Deduced a trap composed of 162 places in 127 ms of which 3 ms to minimize.
[2024-05-29 18:36:09] [INFO ] Deduced a trap composed of 164 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:36:09] [INFO ] Deduced a trap composed of 164 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:36:09] [INFO ] Deduced a trap composed of 163 places in 109 ms of which 2 ms to minimize.
[2024-05-29 18:36:10] [INFO ] Deduced a trap composed of 165 places in 140 ms of which 2 ms to minimize.
[2024-05-29 18:36:10] [INFO ] Deduced a trap composed of 164 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:36:11] [INFO ] Deduced a trap composed of 165 places in 117 ms of which 3 ms to minimize.
[2024-05-29 18:36:11] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 3 ms to minimize.
[2024-05-29 18:36:11] [INFO ] Deduced a trap composed of 166 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:36:11] [INFO ] Deduced a trap composed of 165 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:36:11] [INFO ] Deduced a trap composed of 163 places in 108 ms of which 2 ms to minimize.
[2024-05-29 18:36:12] [INFO ] Deduced a trap composed of 164 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:36:12] [INFO ] Deduced a trap composed of 163 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:36:13] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 2 ms to minimize.
[2024-05-29 18:36:13] [INFO ] Deduced a trap composed of 164 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:36:13] [INFO ] Deduced a trap composed of 165 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:36:13] [INFO ] Deduced a trap composed of 163 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:36:14] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:36:14] [INFO ] Deduced a trap composed of 164 places in 162 ms of which 2 ms to minimize.
[2024-05-29 18:36:15] [INFO ] Deduced a trap composed of 166 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:36:15] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 3 ms to minimize.
[2024-05-29 18:36:15] [INFO ] Deduced a trap composed of 164 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:36:16] [INFO ] Deduced a trap composed of 165 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:36:18] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:36:19] [INFO ] Deduced a trap composed of 192 places in 140 ms of which 3 ms to minimize.
[2024-05-29 18:36:19] [INFO ] Deduced a trap composed of 163 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:36:19] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:36:19] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1101 variables, and 40 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:36:35] [INFO ] Deduced a trap composed of 164 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:36:43] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:36:46] [INFO ] Deduced a trap composed of 164 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:36:47] [INFO ] Deduced a trap composed of 164 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/1101 variables, and 44 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 0/658 constraints, Known Traps: 39/39 constraints]
After SMT, in 60307ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60316ms
Starting structural reductions in LTL mode, iteration 1 : 442/469 places, 659/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60749 ms. Remains : 442/469 places, 659/686 transitions.
[2024-05-29 18:36:57] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:36:57] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:36:57] [INFO ] Input system was already deterministic with 659 transitions.
[2024-05-29 18:36:57] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:36:57] [INFO ] Flatten gal took : 17 ms
[2024-05-29 18:36:57] [INFO ] Time to serialize gal into /tmp/CTLFireability5211941185469735866.gal : 3 ms
[2024-05-29 18:36:57] [INFO ] Time to serialize properties into /tmp/CTLFireability15751192499942446306.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/CTLFireability5211941185469735866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15751192499942446306.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.96896e+08,9.54131,209000,2,14684,5,623552,6,0,2429,915094,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:37:28] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:37:28] [INFO ] Applying decomposition
[2024-05-29 18:37:28] [INFO ] Flatten gal took : 13 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/graph12369045000598159705.txt' '-o' '/tmp/graph12369045000598159705.bin' '-w' '/tmp/graph12369045000598159705.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12369045000598159705.bin' '-l' '-1' '-v' '-w' '/tmp/graph12369045000598159705.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:37:28] [INFO ] Decomposing Gal with order
[2024-05-29 18:37:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:37:28] [INFO ] Removed a total of 794 redundant transitions.
[2024-05-29 18:37:28] [INFO ] Flatten gal took : 28 ms
[2024-05-29 18:37:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-29 18:37:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15582100758327994757.gal : 4 ms
[2024-05-29 18:37:28] [INFO ] Time to serialize properties into /tmp/CTLFireability10980218775086003179.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/CTLFireability15582100758327994757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10980218775086003179.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.96896e+08,4.05826,138864,1619,13,254906,783,884,672926,45,2593,0


Converting to forward existential form...Done !
original formula: AX((EF((i2.u46.p257==1)) + AF(((EX((((i2.u12.p39==1)&&(i2.u46.p174==1))&&((i2.u106.p322==1)&&(i2.u165.p457==1)))) * (i0.u3.p18==1)) * AX(...182
=> equivalent forward existential formula: [FwdG((EY(Init) * !(E(TRUE U (i2.u46.p257==1)))),!(((EX((((i2.u12.p39==1)&&(i2.u46.p174==1))&&((i2.u106.p322==1)...242
Reverse transition relation is NOT exact ! Due to transitions t59, t104, t138, t157, t202, t236, t238, t255, t300, t334, t336, t352, t397, t431, t454, t456...484
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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,1,14.2625,419232,1,0,560743,861,7477,2.87493e+06,234,3717,2044595
FORMULA StigmergyElection-PT-04b-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 469/469 places, 686/686 transitions.
Graph (trivial) has 478 edges and 469 vertex of which 73 / 469 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 285 transitions
Trivial Post-agglo rules discarded 285 transitions
Performed 285 trivial Post agglomeration. Transition count delta: 285
Iterating post reduction 0 with 285 rules applied. Total rules applied 286 place count 407 transition count 331
Reduce places removed 285 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 293 rules applied. Total rules applied 579 place count 122 transition count 323
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 584 place count 118 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 585 place count 117 transition count 322
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 585 place count 117 transition count 308
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 613 place count 103 transition count 308
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 620 place count 96 transition count 300
Iterating global reduction 4 with 7 rules applied. Total rules applied 627 place count 96 transition count 300
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 4 with 1 rules applied. Total rules applied 628 place count 96 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 629 place count 95 transition count 299
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 629 place count 95 transition count 297
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 633 place count 93 transition count 297
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 636 place count 90 transition count 287
Iterating global reduction 6 with 3 rules applied. Total rules applied 639 place count 90 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 640 place count 90 transition count 286
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 668 place count 76 transition count 272
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 682 place count 62 transition count 133
Iterating global reduction 7 with 14 rules applied. Total rules applied 696 place count 62 transition count 133
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 704 place count 62 transition count 125
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 707 place count 59 transition count 119
Iterating global reduction 8 with 3 rules applied. Total rules applied 710 place count 59 transition count 119
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 713 place count 56 transition count 116
Iterating global reduction 8 with 3 rules applied. Total rules applied 716 place count 56 transition count 116
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 8 with 2 rules applied. Total rules applied 718 place count 55 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 722 place count 55 transition count 111
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 730 place count 51 transition count 107
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 731 place count 51 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 732 place count 50 transition count 106
Applied a total of 732 rules in 46 ms. Remains 50 /469 variables (removed 419) and now considering 106/686 (removed 580) transitions.
[2024-05-29 18:37:42] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
// Phase 1: matrix 101 rows 50 cols
[2024-05-29 18:37:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:37:42] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 18:37:42] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
[2024-05-29 18:37:42] [INFO ] Invariant cache hit.
[2024-05-29 18:37:42] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:37:42] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-29 18:37:42] [INFO ] Redundant transitions in 2 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-29 18:37:42] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
[2024-05-29 18:37:42] [INFO ] Invariant cache hit.
[2024-05-29 18:37:42] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 4/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 18:37:43] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:37:43] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:37:43] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:37:43] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:37:43] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:37:43] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:37:43] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:37:43] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:37:43] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:37:43] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:37:43] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:37:43] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 18:37:43] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:37:43] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 100/150 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/151 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 18:37:44] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 18:37:45] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/151 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/151 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/151 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 83 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3629 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 4/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 100/150 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 97/179 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 18:37:47] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 18:37:48] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:37:48] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:37:48] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 1/151 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 18:37:49] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/151 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/151 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 185 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5054 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 21/21 constraints]
After SMT, in 8718ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8719ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/469 places, 106/686 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8877 ms. Remains : 50/469 places, 106/686 transitions.
[2024-05-29 18:37:51] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:37:51] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:37:51] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-29 18:37:51] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:37:51] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:37:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality392683148372251785.gal : 1 ms
[2024-05-29 18:37:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6929229783265877939.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality392683148372251785.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6929229783265877939.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality6929229783265877939.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 49
RANDOM walk for 27956 steps (2935 resets) in 143 ms. (194 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-04b-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :49 after 704
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :704 after 2841
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 686/686 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 455 transition count 672
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 455 transition count 672
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 447 transition count 664
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 447 transition count 664
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 445 transition count 662
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 444 transition count 661
Applied a total of 50 rules in 29 ms. Remains 444 /469 variables (removed 25) and now considering 661/686 (removed 25) transitions.
// Phase 1: matrix 661 rows 444 cols
[2024-05-29 18:37:51] [INFO ] Computed 5 invariants in 8 ms
[2024-05-29 18:37:51] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-29 18:37:51] [INFO ] Invariant cache hit.
[2024-05-29 18:37:51] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2024-05-29 18:37:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-29 18:38:01] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 2 ms to minimize.
[2024-05-29 18:38:02] [INFO ] Deduced a trap composed of 163 places in 123 ms of which 3 ms to minimize.
[2024-05-29 18:38:02] [INFO ] Deduced a trap composed of 162 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:38:02] [INFO ] Deduced a trap composed of 164 places in 125 ms of which 3 ms to minimize.
[2024-05-29 18:38:03] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:38:03] [INFO ] Deduced a trap composed of 163 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:38:03] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 3 ms to minimize.
[2024-05-29 18:38:03] [INFO ] Deduced a trap composed of 162 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:38:04] [INFO ] Deduced a trap composed of 165 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:38:04] [INFO ] Deduced a trap composed of 166 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:38:05] [INFO ] Deduced a trap composed of 165 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:38:05] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:38:05] [INFO ] Deduced a trap composed of 166 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:38:05] [INFO ] Deduced a trap composed of 167 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:38:05] [INFO ] Deduced a trap composed of 218 places in 136 ms of which 2 ms to minimize.
[2024-05-29 18:38:06] [INFO ] Deduced a trap composed of 166 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:38:07] [INFO ] Deduced a trap composed of 163 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:38:07] [INFO ] Deduced a trap composed of 166 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:38:07] [INFO ] Deduced a trap composed of 166 places in 152 ms of which 2 ms to minimize.
[2024-05-29 18:38:07] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-29 18:38:08] [INFO ] Deduced a trap composed of 164 places in 120 ms of which 3 ms to minimize.
[2024-05-29 18:38:09] [INFO ] Deduced a trap composed of 163 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:38:09] [INFO ] Deduced a trap composed of 166 places in 114 ms of which 3 ms to minimize.
[2024-05-29 18:38:09] [INFO ] Deduced a trap composed of 164 places in 116 ms of which 2 ms to minimize.
[2024-05-29 18:38:10] [INFO ] Deduced a trap composed of 164 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:38:11] [INFO ] Deduced a trap composed of 164 places in 111 ms of which 2 ms to minimize.
[2024-05-29 18:38:11] [INFO ] Deduced a trap composed of 163 places in 116 ms of which 2 ms to minimize.
[2024-05-29 18:38:13] [INFO ] Deduced a trap composed of 167 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:38:13] [INFO ] Deduced a trap composed of 218 places in 122 ms of which 3 ms to minimize.
[2024-05-29 18:38:13] [INFO ] Deduced a trap composed of 165 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-29 18:38:20] [INFO ] Deduced a trap composed of 164 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:38:20] [INFO ] Deduced a trap composed of 221 places in 137 ms of which 3 ms to minimize.
[2024-05-29 18:38:21] [INFO ] Deduced a trap composed of 165 places in 130 ms of which 2 ms to minimize.
[2024-05-29 18:38:22] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/1105 variables, and 39 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/444 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-29 18:38:30] [INFO ] Deduced a trap composed of 167 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:38:31] [INFO ] Deduced a trap composed of 166 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:38:31] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:38:31] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 2 ms to minimize.
[2024-05-29 18:38:32] [INFO ] Deduced a trap composed of 165 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-29 18:38:35] [INFO ] Deduced a trap composed of 167 places in 140 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 6 (OVERLAPS) 661/1105 variables, 444/489 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1105 variables, 660/1149 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1105/1105 variables, and 1149 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 40/40 constraints]
After SMT, in 60272ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Starting structural reductions in LTL mode, iteration 1 : 444/469 places, 661/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60718 ms. Remains : 444/469 places, 661/686 transitions.
[2024-05-29 18:38:52] [INFO ] Flatten gal took : 17 ms
[2024-05-29 18:38:52] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:38:52] [INFO ] Input system was already deterministic with 661 transitions.
[2024-05-29 18:38:52] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:38:52] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:38:52] [INFO ] Time to serialize gal into /tmp/CTLFireability13639481817155534839.gal : 3 ms
[2024-05-29 18:38:52] [INFO ] Time to serialize properties into /tmp/CTLFireability6722097812096499479.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/CTLFireability13639481817155534839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6722097812096499479.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,8.057e+08,8.95802,208056,2,14889,5,621611,6,0,2439,918610,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:39:22] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:39:22] [INFO ] Applying decomposition
[2024-05-29 18:39:22] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18104308686177015133.txt' '-o' '/tmp/graph18104308686177015133.bin' '-w' '/tmp/graph18104308686177015133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18104308686177015133.bin' '-l' '-1' '-v' '-w' '/tmp/graph18104308686177015133.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:39:22] [INFO ] Decomposing Gal with order
[2024-05-29 18:39:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:39:22] [INFO ] Removed a total of 792 redundant transitions.
[2024-05-29 18:39:22] [INFO ] Flatten gal took : 28 ms
[2024-05-29 18:39:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-29 18:39:22] [INFO ] Time to serialize gal into /tmp/CTLFireability15031800171878565349.gal : 4 ms
[2024-05-29 18:39:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9979260197966486419.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/CTLFireability15031800171878565349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9979260197966486419.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,8.057e+08,5.66337,184316,1760,17,313145,802,932,995524,46,2595,0


Converting to forward existential form...Done !
original formula: AX(EX(EF(((i0.i1.u5.p10==1)||(((i19.i0.u119.p360==1)||(i28.i1.u136.p543==1))&&((i10.u92.p392==1)||(((i10.u3.p86==1)&&(i10.u64.p234==1))&&...201
=> equivalent forward existential formula: [(EY(Init) * !(EX(E(TRUE U ((i0.i1.u5.p10==1)||(((i19.i0.u119.p360==1)||(i28.i1.u136.p543==1))&&((i10.u92.p392==...254
Reverse transition relation is NOT exact ! Due to transitions t59, t138, t140, t157, t202, t236, t238, t255, t300, t334, t336, t352, t397, t432, t455, t457...487
(forward)formula 0,1,25.6435,812788,1,0,915054,936,7251,6.56031e+06,217,4217,3185186
FORMULA StigmergyElection-PT-04b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 469/469 places, 686/686 transitions.
Graph (trivial) has 478 edges and 469 vertex of which 73 / 469 are part of one of the 12 SCC in 3 ms
Free SCC test removed 61 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 284 transitions
Trivial Post-agglo rules discarded 284 transitions
Performed 284 trivial Post agglomeration. Transition count delta: 284
Iterating post reduction 0 with 284 rules applied. Total rules applied 285 place count 407 transition count 332
Reduce places removed 284 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 292 rules applied. Total rules applied 577 place count 123 transition count 324
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 582 place count 119 transition count 323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 583 place count 118 transition count 323
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 583 place count 118 transition count 309
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 611 place count 104 transition count 309
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 618 place count 97 transition count 301
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 97 transition count 301
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 4 with 1 rules applied. Total rules applied 626 place count 97 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 627 place count 96 transition count 300
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 627 place count 96 transition count 298
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 631 place count 94 transition count 298
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 635 place count 90 transition count 286
Iterating global reduction 6 with 4 rules applied. Total rules applied 639 place count 90 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 640 place count 90 transition count 285
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 641 place count 89 transition count 284
Iterating global reduction 7 with 1 rules applied. Total rules applied 642 place count 89 transition count 284
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 670 place count 75 transition count 270
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 684 place count 61 transition count 131
Iterating global reduction 7 with 14 rules applied. Total rules applied 698 place count 61 transition count 131
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 706 place count 61 transition count 123
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 709 place count 58 transition count 117
Iterating global reduction 8 with 3 rules applied. Total rules applied 712 place count 58 transition count 117
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 715 place count 55 transition count 114
Iterating global reduction 8 with 3 rules applied. Total rules applied 718 place count 55 transition count 114
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 8 with 2 rules applied. Total rules applied 720 place count 54 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 724 place count 54 transition count 109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 732 place count 50 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 733 place count 49 transition count 104
Applied a total of 733 rules in 52 ms. Remains 49 /469 variables (removed 420) and now considering 104/686 (removed 582) transitions.
[2024-05-29 18:39:48] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
// Phase 1: matrix 99 rows 49 cols
[2024-05-29 18:39:48] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 18:39:48] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 18:39:48] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2024-05-29 18:39:48] [INFO ] Invariant cache hit.
[2024-05-29 18:39:48] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:39:48] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-29 18:39:48] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-29 18:39:48] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2024-05-29 18:39:48] [INFO ] Invariant cache hit.
[2024-05-29 18:39:48] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 4/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:39:48] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:39:48] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:39:48] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:39:49] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:39:49] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:39:49] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:39:49] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:39:49] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:39:49] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:39:49] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:39:49] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:39:49] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:39:49] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:39:49] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:39:49] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:39:49] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 18:39:50] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 98/147 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 1/148 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (OVERLAPS) 0/148 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 83 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3151 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 4/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 98/147 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 95/177 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/148 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 178 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2679 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 17/17 constraints]
After SMT, in 5869ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 5871ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/469 places, 104/686 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6042 ms. Remains : 49/469 places, 104/686 transitions.
[2024-05-29 18:39:54] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:39:54] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:39:54] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-29 18:39:54] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:39:54] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:39:54] [INFO ] Time to serialize gal into /tmp/CTLFireability12527522293784556093.gal : 2 ms
[2024-05-29 18:39:54] [INFO ] Time to serialize properties into /tmp/CTLFireability17768145557565368928.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/CTLFireability12527522293784556093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17768145557565368928.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,26888,0.108252,7820,2,2189,5,15606,6,0,292,13798,0


Converting to forward existential form...Done !
original formula: EF(AG((p36==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p36==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t9, t10, t11, t12, t43, t44, t45, t46, t54, t65, t66, t67, t92, t93, t94, t95...276
(forward)formula 0,1,1.78407,61012,1,0,232,324787,224,108,2878,187244,250
FORMULA StigmergyElection-PT-04b-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 686/686 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 455 transition count 672
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 455 transition count 672
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 447 transition count 664
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 447 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 446 transition count 663
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 446 transition count 663
Applied a total of 46 rules in 31 ms. Remains 446 /469 variables (removed 23) and now considering 663/686 (removed 23) transitions.
// Phase 1: matrix 663 rows 446 cols
[2024-05-29 18:39:56] [INFO ] Computed 5 invariants in 7 ms
[2024-05-29 18:39:56] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-29 18:39:56] [INFO ] Invariant cache hit.
[2024-05-29 18:39:56] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 662 sub problems to find dead transitions.
[2024-05-29 18:39:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-05-29 18:40:06] [INFO ] Deduced a trap composed of 164 places in 162 ms of which 3 ms to minimize.
[2024-05-29 18:40:06] [INFO ] Deduced a trap composed of 163 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:40:07] [INFO ] Deduced a trap composed of 167 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:40:08] [INFO ] Deduced a trap composed of 219 places in 141 ms of which 2 ms to minimize.
[2024-05-29 18:40:08] [INFO ] Deduced a trap composed of 168 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:40:08] [INFO ] Deduced a trap composed of 163 places in 134 ms of which 3 ms to minimize.
[2024-05-29 18:40:08] [INFO ] Deduced a trap composed of 163 places in 112 ms of which 2 ms to minimize.
[2024-05-29 18:40:09] [INFO ] Deduced a trap composed of 167 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:40:09] [INFO ] Deduced a trap composed of 165 places in 143 ms of which 2 ms to minimize.
[2024-05-29 18:40:09] [INFO ] Deduced a trap composed of 164 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:40:09] [INFO ] Deduced a trap composed of 164 places in 137 ms of which 2 ms to minimize.
[2024-05-29 18:40:09] [INFO ] Deduced a trap composed of 168 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:40:10] [INFO ] Deduced a trap composed of 165 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:40:10] [INFO ] Deduced a trap composed of 163 places in 153 ms of which 2 ms to minimize.
[2024-05-29 18:40:10] [INFO ] Deduced a trap composed of 166 places in 136 ms of which 3 ms to minimize.
[2024-05-29 18:40:10] [INFO ] Deduced a trap composed of 164 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:40:10] [INFO ] Deduced a trap composed of 164 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:40:10] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:40:11] [INFO ] Deduced a trap composed of 163 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:40:11] [INFO ] Deduced a trap composed of 166 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-05-29 18:40:11] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 2 ms to minimize.
[2024-05-29 18:40:12] [INFO ] Deduced a trap composed of 163 places in 110 ms of which 2 ms to minimize.
[2024-05-29 18:40:12] [INFO ] Deduced a trap composed of 164 places in 141 ms of which 2 ms to minimize.
[2024-05-29 18:40:12] [INFO ] Deduced a trap composed of 163 places in 107 ms of which 1 ms to minimize.
[2024-05-29 18:40:13] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 2 ms to minimize.
[2024-05-29 18:40:14] [INFO ] Deduced a trap composed of 169 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:40:15] [INFO ] Deduced a trap composed of 164 places in 131 ms of which 2 ms to minimize.
[2024-05-29 18:40:15] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 2 ms to minimize.
[2024-05-29 18:40:17] [INFO ] Deduced a trap composed of 165 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 662 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1109 variables, and 34 constraints, problems are : Problem set: 0 solved, 662 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 662/662 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 662 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-05-29 18:40:33] [INFO ] Deduced a trap composed of 168 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 5 (OVERLAPS) 663/1109 variables, 446/481 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 662/1143 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-05-29 18:40:49] [INFO ] Deduced a trap composed of 166 places in 142 ms of which 3 ms to minimize.
[2024-05-29 18:40:49] [INFO ] Deduced a trap composed of 166 places in 125 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 1145 constraints, problems are : Problem set: 0 solved, 662 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 662/662 constraints, Known Traps: 32/32 constraints]
After SMT, in 60283ms problems are : Problem set: 0 solved, 662 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Starting structural reductions in LTL mode, iteration 1 : 446/469 places, 663/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60770 ms. Remains : 446/469 places, 663/686 transitions.
[2024-05-29 18:40:57] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:40:57] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:40:57] [INFO ] Input system was already deterministic with 663 transitions.
[2024-05-29 18:40:57] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:40:57] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:40:57] [INFO ] Time to serialize gal into /tmp/CTLFireability16711453523428692465.gal : 3 ms
[2024-05-29 18:40:57] [INFO ] Time to serialize properties into /tmp/CTLFireability476789288740178563.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/CTLFireability16711453523428692465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability476789288740178563.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,8.09863e+08,8.06512,212712,2,14042,5,634334,6,0,2449,904352,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:41:27] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:41:27] [INFO ] Applying decomposition
[2024-05-29 18:41:27] [INFO ] Flatten gal took : 13 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/graph1320726446996279023.txt' '-o' '/tmp/graph1320726446996279023.bin' '-w' '/tmp/graph1320726446996279023.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1320726446996279023.bin' '-l' '-1' '-v' '-w' '/tmp/graph1320726446996279023.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:41:27] [INFO ] Decomposing Gal with order
[2024-05-29 18:41:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:41:27] [INFO ] Removed a total of 794 redundant transitions.
[2024-05-29 18:41:27] [INFO ] Flatten gal took : 26 ms
[2024-05-29 18:41:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-29 18:41:27] [INFO ] Time to serialize gal into /tmp/CTLFireability11732186550184651695.gal : 3 ms
[2024-05-29 18:41:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10611850019721456965.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/CTLFireability11732186550184651695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10611850019721456965.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.09863e+08,4.5867,149212,1622,13,275057,889,902,731227,44,2655,0


Converting to forward existential form...Done !
original formula: E((AG((i18.u116.p349==1)) + !((E((i0.u4.p122==1) U (i17.u109.p326==1)) * (i30.u179.p561==1)))) U AX((((!(EG((i29.u175.p537==1))) * (i22.u...234
=> equivalent forward existential formula: [(FwdU(Init,(!(E(TRUE U !((i18.u116.p349==1)))) + !((E((i0.u4.p122==1) U (i17.u109.p326==1)) * (i30.u179.p561==1...298
Reverse transition relation is NOT exact ! Due to transitions t59, t104, t138, t140, t157, t205, t206, t240, t242, t259, t338, t340, t356, t435, t437, t458...465
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 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 469/469 places, 686/686 transitions.
Graph (trivial) has 470 edges and 469 vertex of which 70 / 469 are part of one of the 11 SCC in 2 ms
Free SCC test removed 59 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 279 place count 409 transition count 340
Reduce places removed 278 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 286 rules applied. Total rules applied 565 place count 131 transition count 332
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 570 place count 127 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 571 place count 126 transition count 331
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 571 place count 126 transition count 316
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 601 place count 111 transition count 316
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 607 place count 105 transition count 309
Iterating global reduction 4 with 6 rules applied. Total rules applied 613 place count 105 transition count 309
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 4 with 1 rules applied. Total rules applied 614 place count 105 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 615 place count 104 transition count 308
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 615 place count 104 transition count 306
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 619 place count 102 transition count 306
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 623 place count 98 transition count 294
Iterating global reduction 6 with 4 rules applied. Total rules applied 627 place count 98 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 628 place count 98 transition count 293
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 629 place count 97 transition count 292
Iterating global reduction 7 with 1 rules applied. Total rules applied 630 place count 97 transition count 292
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 658 place count 83 transition count 278
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 671 place count 70 transition count 147
Iterating global reduction 7 with 13 rules applied. Total rules applied 684 place count 70 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 690 place count 70 transition count 141
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 693 place count 67 transition count 135
Iterating global reduction 8 with 3 rules applied. Total rules applied 696 place count 67 transition count 135
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 699 place count 64 transition count 132
Iterating global reduction 8 with 3 rules applied. Total rules applied 702 place count 64 transition count 132
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 8 with 2 rules applied. Total rules applied 704 place count 63 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 708 place count 63 transition count 127
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 716 place count 59 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 717 place count 58 transition count 122
Applied a total of 717 rules in 34 ms. Remains 58 /469 variables (removed 411) and now considering 122/686 (removed 564) transitions.
[2024-05-29 18:41:57] [INFO ] Flow matrix only has 117 transitions (discarded 5 similar events)
// Phase 1: matrix 117 rows 58 cols
[2024-05-29 18:41:57] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:41:57] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 18:41:57] [INFO ] Flow matrix only has 117 transitions (discarded 5 similar events)
[2024-05-29 18:41:57] [INFO ] Invariant cache hit.
[2024-05-29 18:41:57] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:41:57] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-29 18:41:57] [INFO ] Redundant transitions in 2 ms returned []
Running 113 sub problems to find dead transitions.
[2024-05-29 18:41:57] [INFO ] Flow matrix only has 117 transitions (discarded 5 similar events)
[2024-05-29 18:41:57] [INFO ] Invariant cache hit.
[2024-05-29 18:41:57] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 4/58 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 18:41:58] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:41:58] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:41:58] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-29 18:41:58] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:41:58] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:41:58] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:41:58] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:41:58] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 18:41:58] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:41:58] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-05-29 18:41:58] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 18:41:58] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:41:59] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:41:59] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:41:59] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 18:41:59] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:41:59] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 116/174 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 14/92 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 1/175 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (OVERLAPS) 0/175 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 93 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3754 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 58/58 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 4/58 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 116/174 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 14/92 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 113/205 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/175 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/175 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 206 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3441 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 58/58 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 17/17 constraints]
After SMT, in 7248ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 7249ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/469 places, 122/686 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7428 ms. Remains : 58/469 places, 122/686 transitions.
[2024-05-29 18:42:04] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:42:04] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:42:04] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-29 18:42:04] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:42:04] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:42:04] [INFO ] Time to serialize gal into /tmp/CTLFireability15197358513387456383.gal : 2 ms
[2024-05-29 18:42:04] [INFO ] Time to serialize properties into /tmp/CTLFireability1071136670312780086.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/CTLFireability15197358513387456383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1071136670312780086.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,54408,0.15188,9568,2,2367,5,21900,6,0,346,20517,0


Converting to forward existential form...Done !
original formula: A((p237==1) U !((!(EF((p188==1))) + EF(((p35==1)||(((p74==1)&&(p209==1))&&((p356==1)&&(p479==1))))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((!(E(TRUE U (p188==1))) + E(TRUE U ((p35==1)||(((p74==1)&&(p209==1))&&((p356==1)&&(p479==1)))...407
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t4, t5, t12, t18, t19, t51, t53, t54, t55, t63, t75, t76, t77, t110, t111, t112, t113...280
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,9.82783,289568,1,0,491,1.80451e+06,270,274,3423,1.14647e+06,545
FORMULA StigmergyElection-PT-04b-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 469/469 places, 686/686 transitions.
Graph (trivial) has 478 edges and 469 vertex of which 71 / 469 are part of one of the 12 SCC in 1 ms
Free SCC test removed 59 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 287 transitions
Trivial Post-agglo rules discarded 287 transitions
Performed 287 trivial Post agglomeration. Transition count delta: 287
Iterating post reduction 0 with 287 rules applied. Total rules applied 288 place count 409 transition count 332
Reduce places removed 287 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 295 rules applied. Total rules applied 583 place count 122 transition count 324
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 587 place count 118 transition count 324
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 587 place count 118 transition count 310
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 615 place count 104 transition count 310
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 622 place count 97 transition count 302
Iterating global reduction 3 with 7 rules applied. Total rules applied 629 place count 97 transition count 302
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 1 rules applied. Total rules applied 630 place count 97 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 631 place count 96 transition count 301
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 631 place count 96 transition count 299
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 635 place count 94 transition count 299
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 639 place count 90 transition count 287
Iterating global reduction 5 with 4 rules applied. Total rules applied 643 place count 90 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 644 place count 90 transition count 286
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 645 place count 89 transition count 285
Iterating global reduction 6 with 1 rules applied. Total rules applied 646 place count 89 transition count 285
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 674 place count 75 transition count 271
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 687 place count 62 transition count 134
Iterating global reduction 6 with 13 rules applied. Total rules applied 700 place count 62 transition count 134
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 708 place count 62 transition count 126
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 710 place count 60 transition count 122
Iterating global reduction 7 with 2 rules applied. Total rules applied 712 place count 60 transition count 122
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 714 place count 58 transition count 120
Iterating global reduction 7 with 2 rules applied. Total rules applied 716 place count 58 transition count 120
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 718 place count 57 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 723 place count 57 transition count 114
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 733 place count 52 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 734 place count 51 transition count 108
Applied a total of 734 rules in 38 ms. Remains 51 /469 variables (removed 418) and now considering 108/686 (removed 578) transitions.
[2024-05-29 18:42:14] [INFO ] Flow matrix only has 102 transitions (discarded 6 similar events)
// Phase 1: matrix 102 rows 51 cols
[2024-05-29 18:42:14] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 18:42:14] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-29 18:42:14] [INFO ] Flow matrix only has 102 transitions (discarded 6 similar events)
[2024-05-29 18:42:14] [INFO ] Invariant cache hit.
[2024-05-29 18:42:14] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:42:14] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-29 18:42:15] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-29 18:42:15] [INFO ] Flow matrix only has 102 transitions (discarded 6 similar events)
[2024-05-29 18:42:15] [INFO ] Invariant cache hit.
[2024-05-29 18:42:15] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 4/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-29 18:42:15] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:42:15] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:42:15] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:42:15] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:42:15] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:42:15] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:42:15] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:42:15] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-29 18:42:15] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:42:15] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:42:15] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:42:16] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:42:16] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-29 18:42:16] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 101/152 variables, 51/67 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-29 18:42:16] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:42:16] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-29 18:42:17] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:42:17] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:42:17] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 1/153 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/153 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 14 (OVERLAPS) 0/153 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 87 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3611 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 4/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 101/152 variables, 51/72 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 99/185 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 1/153 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/153 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 186 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2943 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 19/19 constraints]
After SMT, in 6592ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 6593ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/469 places, 108/686 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6852 ms. Remains : 51/469 places, 108/686 transitions.
[2024-05-29 18:42:21] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:42:21] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:42:21] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-29 18:42:21] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:42:21] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:42:21] [INFO ] Time to serialize gal into /tmp/CTLFireability12064686939652889172.gal : 1 ms
[2024-05-29 18:42:21] [INFO ] Time to serialize properties into /tmp/CTLFireability2414430580673906470.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/CTLFireability12064686939652889172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2414430580673906470.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,26208,0.110447,8360,2,2020,5,15230,6,0,303,16351,0


Converting to forward existential form...Done !
original formula: EF(EG(AF((p330==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!((p330==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t9, t12, t13, t14, t15, t46, t47, t48, t49, t57, t68, t69, t70, t95, t96, t97...284
(forward)formula 0,1,1.75798,64336,1,0,365,321533,236,167,2941,270336,397
FORMULA StigmergyElection-PT-04b-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 686/686 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 457 transition count 674
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 457 transition count 674
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 449 transition count 666
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 449 transition count 666
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 447 transition count 664
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 447 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 446 transition count 663
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 446 transition count 663
Applied a total of 46 rules in 35 ms. Remains 446 /469 variables (removed 23) and now considering 663/686 (removed 23) transitions.
// Phase 1: matrix 663 rows 446 cols
[2024-05-29 18:42:23] [INFO ] Computed 5 invariants in 11 ms
[2024-05-29 18:42:23] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-29 18:42:23] [INFO ] Invariant cache hit.
[2024-05-29 18:42:23] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 662 sub problems to find dead transitions.
[2024-05-29 18:42:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-05-29 18:42:32] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 2 ms to minimize.
[2024-05-29 18:42:32] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:42:33] [INFO ] Deduced a trap composed of 163 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:42:33] [INFO ] Deduced a trap composed of 168 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:42:34] [INFO ] Deduced a trap composed of 164 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:42:34] [INFO ] Deduced a trap composed of 168 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:42:34] [INFO ] Deduced a trap composed of 163 places in 116 ms of which 2 ms to minimize.
[2024-05-29 18:42:34] [INFO ] Deduced a trap composed of 162 places in 129 ms of which 3 ms to minimize.
[2024-05-29 18:42:35] [INFO ] Deduced a trap composed of 163 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:42:35] [INFO ] Deduced a trap composed of 165 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:42:36] [INFO ] Deduced a trap composed of 165 places in 136 ms of which 3 ms to minimize.
[2024-05-29 18:42:36] [INFO ] Deduced a trap composed of 164 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:42:36] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 3 ms to minimize.
[2024-05-29 18:42:37] [INFO ] Deduced a trap composed of 164 places in 138 ms of which 3 ms to minimize.
[2024-05-29 18:42:37] [INFO ] Deduced a trap composed of 168 places in 137 ms of which 3 ms to minimize.
[2024-05-29 18:42:38] [INFO ] Deduced a trap composed of 163 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:42:38] [INFO ] Deduced a trap composed of 165 places in 109 ms of which 2 ms to minimize.
[2024-05-29 18:42:38] [INFO ] Deduced a trap composed of 167 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:42:38] [INFO ] Deduced a trap composed of 165 places in 127 ms of which 3 ms to minimize.
[2024-05-29 18:42:38] [INFO ] Deduced a trap composed of 218 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-05-29 18:42:39] [INFO ] Deduced a trap composed of 165 places in 112 ms of which 2 ms to minimize.
[2024-05-29 18:42:39] [INFO ] Deduced a trap composed of 220 places in 148 ms of which 3 ms to minimize.
[2024-05-29 18:42:40] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 2 ms to minimize.
[2024-05-29 18:42:41] [INFO ] Deduced a trap composed of 168 places in 135 ms of which 3 ms to minimize.
[2024-05-29 18:42:41] [INFO ] Deduced a trap composed of 220 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:42:41] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:42:43] [INFO ] Deduced a trap composed of 169 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:42:43] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:42:43] [INFO ] Deduced a trap composed of 166 places in 133 ms of which 2 ms to minimize.
[2024-05-29 18:42:44] [INFO ] Deduced a trap composed of 165 places in 113 ms of which 2 ms to minimize.
[2024-05-29 18:42:44] [INFO ] Deduced a trap composed of 168 places in 134 ms of which 3 ms to minimize.
[2024-05-29 18:42:45] [INFO ] Deduced a trap composed of 169 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:42:45] [INFO ] Deduced a trap composed of 164 places in 131 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-05-29 18:42:52] [INFO ] Deduced a trap composed of 164 places in 135 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1109 variables, and 39 constraints, problems are : Problem set: 0 solved, 662 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 662/662 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 662 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-05-29 18:42:59] [INFO ] Deduced a trap composed of 165 places in 140 ms of which 3 ms to minimize.
[2024-05-29 18:43:00] [INFO ] Deduced a trap composed of 164 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:43:02] [INFO ] Deduced a trap composed of 163 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:43:02] [INFO ] Deduced a trap composed of 164 places in 106 ms of which 2 ms to minimize.
[2024-05-29 18:43:03] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 2 ms to minimize.
[2024-05-29 18:43:03] [INFO ] Deduced a trap composed of 164 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 5 (OVERLAPS) 663/1109 variables, 446/491 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 662/1153 constraints. Problems are: Problem set: 0 solved, 662 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 1153 constraints, problems are : Problem set: 0 solved, 662 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 662/662 constraints, Known Traps: 40/40 constraints]
After SMT, in 60301ms problems are : Problem set: 0 solved, 662 unsolved
Search for dead transitions found 0 dead transitions in 60310ms
Starting structural reductions in LTL mode, iteration 1 : 446/469 places, 663/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60719 ms. Remains : 446/469 places, 663/686 transitions.
[2024-05-29 18:43:24] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:43:24] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:43:24] [INFO ] Input system was already deterministic with 663 transitions.
[2024-05-29 18:43:24] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:43:24] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:43:24] [INFO ] Time to serialize gal into /tmp/CTLFireability11996773117018881688.gal : 3 ms
[2024-05-29 18:43:24] [INFO ] Time to serialize properties into /tmp/CTLFireability9007775081593268859.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/CTLFireability11996773117018881688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9007775081593268859.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,8.09732e+08,9.57365,216056,2,15062,5,651268,6,0,2449,944955,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:43:54] [INFO ] Flatten gal took : 17 ms
[2024-05-29 18:43:54] [INFO ] Applying decomposition
[2024-05-29 18:43:54] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph629860234381159769.txt' '-o' '/tmp/graph629860234381159769.bin' '-w' '/tmp/graph629860234381159769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph629860234381159769.bin' '-l' '-1' '-v' '-w' '/tmp/graph629860234381159769.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:43:54] [INFO ] Decomposing Gal with order
[2024-05-29 18:43:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:43:54] [INFO ] Removed a total of 790 redundant transitions.
[2024-05-29 18:43:54] [INFO ] Flatten gal took : 54 ms
[2024-05-29 18:43:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 10 ms.
[2024-05-29 18:43:54] [INFO ] Time to serialize gal into /tmp/CTLFireability13608280882046953815.gal : 4 ms
[2024-05-29 18:43:54] [INFO ] Time to serialize properties into /tmp/CTLFireability9373405948019292100.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/CTLFireability13608280882046953815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9373405948019292100.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,8.09732e+08,4.41363,137828,1484,21,243868,833,1065,671630,50,3034,0


Converting to forward existential form...Done !
original formula: ((AF(((i4.i1.u28.p84==1) + ((AX(((i8.i0.u46.p140==1)&&(i1.i1.u13.p36==1))) * (((i0.i0.u2.p39==0)||(i0.i0.u64.p187==0))||((i0.i1.u99.p297=...909
=> equivalent forward existential formula: ([FwdG((Init * !((E(TRUE U (i19.i0.u120.p358==1)) * EX(EX(TRUE))))),!(((i4.i1.u28.p84==1) + ((!(EX(!(((i8.i0.u46...1691
Reverse transition relation is NOT exact ! Due to transitions t60, t105, t139, t158, t203, t237, t239, t257, t339, t355, t400, t434, t457, t461, t462, i0.i...485
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 a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 686/686 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 454 transition count 671
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 454 transition count 671
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 445 transition count 662
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 445 transition count 662
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 443 transition count 660
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 442 transition count 659
Applied a total of 54 rules in 46 ms. Remains 442 /469 variables (removed 27) and now considering 659/686 (removed 27) transitions.
// Phase 1: matrix 659 rows 442 cols
[2024-05-29 18:44:24] [INFO ] Computed 5 invariants in 5 ms
[2024-05-29 18:44:24] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-29 18:44:24] [INFO ] Invariant cache hit.
[2024-05-29 18:44:25] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2024-05-29 18:44:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:44:34] [INFO ] Deduced a trap composed of 162 places in 161 ms of which 3 ms to minimize.
[2024-05-29 18:44:35] [INFO ] Deduced a trap composed of 163 places in 124 ms of which 2 ms to minimize.
[2024-05-29 18:44:35] [INFO ] Deduced a trap composed of 162 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:44:35] [INFO ] Deduced a trap composed of 165 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:44:36] [INFO ] Deduced a trap composed of 165 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:44:36] [INFO ] Deduced a trap composed of 163 places in 112 ms of which 2 ms to minimize.
[2024-05-29 18:44:36] [INFO ] Deduced a trap composed of 219 places in 140 ms of which 2 ms to minimize.
[2024-05-29 18:44:36] [INFO ] Deduced a trap composed of 162 places in 128 ms of which 2 ms to minimize.
[2024-05-29 18:44:36] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 3 ms to minimize.
[2024-05-29 18:44:37] [INFO ] Deduced a trap composed of 164 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:44:37] [INFO ] Deduced a trap composed of 163 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:44:37] [INFO ] Deduced a trap composed of 165 places in 132 ms of which 2 ms to minimize.
[2024-05-29 18:44:37] [INFO ] Deduced a trap composed of 164 places in 125 ms of which 2 ms to minimize.
[2024-05-29 18:44:38] [INFO ] Deduced a trap composed of 165 places in 131 ms of which 3 ms to minimize.
[2024-05-29 18:44:38] [INFO ] Deduced a trap composed of 165 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:44:38] [INFO ] Deduced a trap composed of 166 places in 130 ms of which 2 ms to minimize.
[2024-05-29 18:44:38] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:44:39] [INFO ] Deduced a trap composed of 163 places in 114 ms of which 2 ms to minimize.
[2024-05-29 18:44:39] [INFO ] Deduced a trap composed of 164 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:44:40] [INFO ] Deduced a trap composed of 163 places in 119 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:44:40] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 2 ms to minimize.
[2024-05-29 18:44:40] [INFO ] Deduced a trap composed of 164 places in 118 ms of which 2 ms to minimize.
[2024-05-29 18:44:40] [INFO ] Deduced a trap composed of 165 places in 130 ms of which 3 ms to minimize.
[2024-05-29 18:44:40] [INFO ] Deduced a trap composed of 163 places in 113 ms of which 2 ms to minimize.
[2024-05-29 18:44:41] [INFO ] Deduced a trap composed of 165 places in 125 ms of which 6 ms to minimize.
[2024-05-29 18:44:41] [INFO ] Deduced a trap composed of 164 places in 135 ms of which 2 ms to minimize.
[2024-05-29 18:44:42] [INFO ] Deduced a trap composed of 166 places in 138 ms of which 2 ms to minimize.
[2024-05-29 18:44:42] [INFO ] Deduced a trap composed of 165 places in 148 ms of which 2 ms to minimize.
[2024-05-29 18:44:42] [INFO ] Deduced a trap composed of 164 places in 116 ms of which 2 ms to minimize.
[2024-05-29 18:44:43] [INFO ] Deduced a trap composed of 165 places in 126 ms of which 2 ms to minimize.
[2024-05-29 18:44:45] [INFO ] Deduced a trap composed of 166 places in 114 ms of which 2 ms to minimize.
[2024-05-29 18:44:46] [INFO ] Deduced a trap composed of 192 places in 139 ms of which 2 ms to minimize.
[2024-05-29 18:44:46] [INFO ] Deduced a trap composed of 163 places in 134 ms of which 2 ms to minimize.
[2024-05-29 18:44:46] [INFO ] Deduced a trap composed of 166 places in 129 ms of which 2 ms to minimize.
[2024-05-29 18:44:46] [INFO ] Deduced a trap composed of 164 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1101 variables, and 40 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:45:03] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:45:10] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-29 18:45:13] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 2 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 164 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/1101 variables, and 44 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 0/658 constraints, Known Traps: 39/39 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60295ms
Starting structural reductions in LTL mode, iteration 1 : 442/469 places, 659/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60803 ms. Remains : 442/469 places, 659/686 transitions.
[2024-05-29 18:45:25] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:45:25] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:45:25] [INFO ] Input system was already deterministic with 659 transitions.
[2024-05-29 18:45:25] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:45:25] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:45:25] [INFO ] Time to serialize gal into /tmp/CTLFireability4447894146415444676.gal : 4 ms
[2024-05-29 18:45:25] [INFO ] Time to serialize properties into /tmp/CTLFireability4946061742915138790.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/CTLFireability4447894146415444676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4946061742915138790.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.96896e+08,8.35332,209240,2,14684,5,623552,6,0,2429,915094,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 18:45:55] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:45:55] [INFO ] Applying decomposition
[2024-05-29 18:45:55] [INFO ] Flatten gal took : 13 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/graph13172088589902738690.txt' '-o' '/tmp/graph13172088589902738690.bin' '-w' '/tmp/graph13172088589902738690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13172088589902738690.bin' '-l' '-1' '-v' '-w' '/tmp/graph13172088589902738690.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:45:55] [INFO ] Decomposing Gal with order
[2024-05-29 18:45:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:45:55] [INFO ] Removed a total of 798 redundant transitions.
[2024-05-29 18:45:55] [INFO ] Flatten gal took : 26 ms
[2024-05-29 18:45:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-29 18:45:55] [INFO ] Time to serialize gal into /tmp/CTLFireability16062679397527213338.gal : 4 ms
[2024-05-29 18:45:55] [INFO ] Time to serialize properties into /tmp/CTLFireability2798333281770445610.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/CTLFireability16062679397527213338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2798333281770445610.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.96896e+08,6.4591,196912,1698,13,361140,892,882,935816,42,2911,0


Converting to forward existential form...Done !
original formula: AX(EF((AF((i2.u11.p31==1)) + ((EG((i29.u181.p556==1)) * (i2.u11.p31==1)) * (i25.u163.p501==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (!(EG(!((i2.u11.p31==1)))) + ((EG((i29.u181.p556==1)) * (i2.u11.p31==1)) * (i25.u163.p50...174
Reverse transition relation is NOT exact ! Due to transitions t59, t138, t140, t157, t202, t236, t238, t255, t300, t334, t336, t352, t397, t431, t454, t456...465
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 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
[2024-05-29 18:46:25] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:46:25] [INFO ] Flatten gal took : 14 ms
[2024-05-29 18:46:25] [INFO ] Applying decomposition
[2024-05-29 18:46:25] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9478067531730357471.txt' '-o' '/tmp/graph9478067531730357471.bin' '-w' '/tmp/graph9478067531730357471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9478067531730357471.bin' '-l' '-1' '-v' '-w' '/tmp/graph9478067531730357471.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:46:25] [INFO ] Decomposing Gal with order
[2024-05-29 18:46:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:46:25] [INFO ] Removed a total of 799 redundant transitions.
[2024-05-29 18:46:25] [INFO ] Flatten gal took : 25 ms
[2024-05-29 18:46:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-29 18:46:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13216597126659978339.gal : 3 ms
[2024-05-29 18:46:25] [INFO ] Time to serialize properties into /tmp/CTLFireability15399007192768906919.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/CTLFireability13216597126659978339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15399007192768906919.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.52292e+08,7.43733,266836,2178,18,458953,1008,913,1.47636e+06,46,4001,0


Converting to forward existential form...Done !
original formula: AF((((i30.u188.p539==0) * ((EG((A((i18.u115.p336==1) U (((i10.u2.p86==1)&&(i10.u70.p209==1))&&((i10.u120.p344==1)&&(i10.u143.p504==1)))) ...545
=> equivalent forward existential formula: [FwdG(Init,!((((i30.u188.p539==0) * ((EG((!((E(!((((i10.u2.p86==1)&&(i10.u70.p209==1))&&((i10.u120.p344==1)&&(i1...1010
Reverse transition relation is NOT exact ! Due to transitions t34, t64, t112, t148, t167, t218, t219, t253, t255, t273, t319, t354, t356, t372, t417, t418,...483
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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
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
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
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
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-29 18:56:47] [INFO ] Applying decomposition
[2024-05-29 18:56:47] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:56:47] [INFO ] Decomposing Gal with order
[2024-05-29 18:56:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:56:47] [INFO ] Removed a total of 709 redundant transitions.
[2024-05-29 18:56:47] [INFO ] Flatten gal took : 26 ms
[2024-05-29 18:56:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 2 ms.
[2024-05-29 18:56:47] [INFO ] Time to serialize gal into /tmp/CTLFireability13429377654355205850.gal : 2 ms
[2024-05-29 18:56:47] [INFO ] Time to serialize properties into /tmp/CTLFireability10543164590533970447.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/CTLFireability13429377654355205850.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10543164590533970447.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.52292e+08,0.541349,23864,204,4914,3239,44170,140,10939,944,243888,0


Converting to forward existential form...Done !
original formula: AF((((i0.u7.p539==0) * ((EG((A((i0.i0.u6.p336==1) U (((i0.i0.i0.u4.p86==1)&&(i0.i0.i0.u5.p209==1))&&((i0.i0.u6.p344==1)&&(i0.u7.p504==1))...568
=> equivalent forward existential formula: [FwdG(Init,!((((i0.u7.p539==0) * ((EG((!((E(!((((i0.i0.i0.u4.p86==1)&&(i0.i0.i0.u5.p209==1))&&((i0.i0.u6.p344==1...1057
Reverse transition relation is NOT exact ! Due to transitions t482, u8.t36, u8.t43, i0.u7.t34, i0.u7.t64, i0.u7.t111, i0.u7.t112, i0.u7.t147, i0.u7.t148, i...722
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 1
Fast SCC detection found an SCC at level 2
(forward)formula 0,1,558.537,6562952,1,0,1.21435e+06,2.38e+07,446,3.27203e+06,3573,8.6207e+07,193714
FORMULA StigmergyElection-PT-04b-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((A(AF((EG((i0.i0.i0.u5.p156==1)) + EX((u8.p553==1)))) U (((i0.i0.i0.u5.p257==1)&&(i0.u7.p433==1)) + EG(AF((i0.u7.p424==1))))) + ((i0.i...252
=> equivalent forward existential formula: [FwdG(Init,(!((E(!((((i0.i0.i0.u5.p257==1)&&(i0.u7.p433==1)) + EG(!(EG(!((i0.u7.p424==1))))))) U (!(!(EG(!((EG((...581
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 1
Fast SCC detection found an SCC at level 2
Detected timeout of ITS tools.
[2024-05-29 19:24:06] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:24:06] [INFO ] Input system was already deterministic with 686 transitions.
[2024-05-29 19:24:06] [INFO ] Transformed 469 places.
[2024-05-29 19:24:06] [INFO ] Transformed 686 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 19:24:06] [INFO ] Time to serialize gal into /tmp/CTLFireability242249637856059126.gal : 5 ms
[2024-05-29 19:24:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14168345527894067325.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/CTLFireability242249637856059126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14168345527894067325.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.52292e+08,11.6986,283732,2,41488,5,990328,6,0,2564,1.04009e+06,0


Converting to forward existential form...Done !

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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