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.r026-smll-171620167000113.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 AutoFlight-PT-04b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167000113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 22:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 22:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 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 AutoFlight-PT-04b-CTLCardinality-2024-00
FORMULA_NAME AutoFlight-PT-04b-CTLCardinality-2024-01
FORMULA_NAME AutoFlight-PT-04b-CTLCardinality-2024-02
FORMULA_NAME AutoFlight-PT-04b-CTLCardinality-2024-03
FORMULA_NAME AutoFlight-PT-04b-CTLCardinality-2024-04
FORMULA_NAME AutoFlight-PT-04b-CTLCardinality-2024-05
FORMULA_NAME AutoFlight-PT-04b-CTLCardinality-2024-06
FORMULA_NAME AutoFlight-PT-04b-CTLCardinality-2024-07
FORMULA_NAME AutoFlight-PT-04b-CTLCardinality-2024-08
FORMULA_NAME AutoFlight-PT-04b-CTLCardinality-2024-09
FORMULA_NAME AutoFlight-PT-04b-CTLCardinality-2024-10
FORMULA_NAME AutoFlight-PT-04b-CTLCardinality-2024-11
FORMULA_NAME AutoFlight-PT-04b-CTLCardinality-2023-12
FORMULA_NAME AutoFlight-PT-04b-CTLCardinality-2023-13
FORMULA_NAME AutoFlight-PT-04b-CTLCardinality-2023-14
FORMULA_NAME AutoFlight-PT-04b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716252872941

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 00:54:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 00:54:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 00:54:35] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2024-05-21 00:54:35] [INFO ] Transformed 390 places.
[2024-05-21 00:54:36] [INFO ] Transformed 388 transitions.
[2024-05-21 00:54:36] [INFO ] Found NUPN structural information;
[2024-05-21 00:54:36] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 457 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Support contains 89 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 388/388 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 353 transition count 351
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 353 transition count 351
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 77 place count 353 transition count 348
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 87 place count 343 transition count 338
Iterating global reduction 1 with 10 rules applied. Total rules applied 97 place count 343 transition count 338
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 340 transition count 335
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 340 transition count 335
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 338 transition count 333
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 338 transition count 333
Applied a total of 107 rules in 226 ms. Remains 338 /390 variables (removed 52) and now considering 333/388 (removed 55) transitions.
// Phase 1: matrix 333 rows 338 cols
[2024-05-21 00:54:36] [INFO ] Computed 28 invariants in 38 ms
[2024-05-21 00:54:37] [INFO ] Implicit Places using invariants in 586 ms returned []
[2024-05-21 00:54:37] [INFO ] Invariant cache hit.
[2024-05-21 00:54:37] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-21 00:54:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 00:54:46] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 33 ms to minimize.
[2024-05-21 00:54:46] [INFO ] Deduced a trap composed of 71 places in 182 ms of which 5 ms to minimize.
[2024-05-21 00:54:46] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 4 ms to minimize.
[2024-05-21 00:54:46] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 3 ms to minimize.
[2024-05-21 00:54:46] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 3 ms to minimize.
[2024-05-21 00:54:46] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 4 ms to minimize.
[2024-05-21 00:54:47] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 4 ms to minimize.
[2024-05-21 00:54:47] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 4 ms to minimize.
[2024-05-21 00:54:47] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 3 ms to minimize.
[2024-05-21 00:54:47] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 3 ms to minimize.
[2024-05-21 00:54:47] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 3 ms to minimize.
[2024-05-21 00:54:48] [INFO ] Deduced a trap composed of 64 places in 155 ms of which 4 ms to minimize.
[2024-05-21 00:54:48] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 3 ms to minimize.
[2024-05-21 00:54:48] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 3 ms to minimize.
[2024-05-21 00:54:48] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 5 ms to minimize.
[2024-05-21 00:54:48] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 4 ms to minimize.
[2024-05-21 00:54:49] [INFO ] Deduced a trap composed of 64 places in 179 ms of which 2 ms to minimize.
[2024-05-21 00:54:49] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 4 ms to minimize.
[2024-05-21 00:54:49] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 5 ms to minimize.
[2024-05-21 00:54:49] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 00:54:54] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 4 ms to minimize.
[2024-05-21 00:54:54] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 4 ms to minimize.
[2024-05-21 00:54:54] [INFO ] Deduced a trap composed of 61 places in 191 ms of which 4 ms to minimize.
[2024-05-21 00:54:54] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 3 ms to minimize.
[2024-05-21 00:54:54] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 4 ms to minimize.
[2024-05-21 00:54:55] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 3 ms to minimize.
[2024-05-21 00:54:55] [INFO ] Deduced a trap composed of 58 places in 183 ms of which 4 ms to minimize.
[2024-05-21 00:54:55] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 3 ms to minimize.
[2024-05-21 00:54:55] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 3 ms to minimize.
[2024-05-21 00:54:55] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 3 ms to minimize.
[2024-05-21 00:54:56] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 4 ms to minimize.
[2024-05-21 00:54:56] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 4 ms to minimize.
[2024-05-21 00:54:56] [INFO ] Deduced a trap composed of 35 places in 218 ms of which 5 ms to minimize.
[2024-05-21 00:54:56] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 5 ms to minimize.
[2024-05-21 00:54:56] [INFO ] Deduced a trap composed of 63 places in 186 ms of which 6 ms to minimize.
[2024-05-21 00:54:57] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 5 ms to minimize.
[2024-05-21 00:54:57] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 4 ms to minimize.
[2024-05-21 00:54:57] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 4 ms to minimize.
[2024-05-21 00:54:58] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 4 ms to minimize.
[2024-05-21 00:54:58] [INFO ] Deduced a trap composed of 69 places in 198 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 00:54:59] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 4 ms to minimize.
[2024-05-21 00:54:59] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 4 ms to minimize.
[2024-05-21 00:54:59] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 4 ms to minimize.
[2024-05-21 00:54:59] [INFO ] Deduced a trap composed of 72 places in 172 ms of which 4 ms to minimize.
[2024-05-21 00:55:00] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 4 ms to minimize.
[2024-05-21 00:55:00] [INFO ] Deduced a trap composed of 55 places in 205 ms of which 5 ms to minimize.
[2024-05-21 00:55:00] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 4 ms to minimize.
[2024-05-21 00:55:00] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 4 ms to minimize.
[2024-05-21 00:55:00] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 3 ms to minimize.
[2024-05-21 00:55:01] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 4 ms to minimize.
[2024-05-21 00:55:01] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 5 ms to minimize.
[2024-05-21 00:55:01] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 4 ms to minimize.
[2024-05-21 00:55:01] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 5 ms to minimize.
[2024-05-21 00:55:02] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 3 ms to minimize.
[2024-05-21 00:55:02] [INFO ] Deduced a trap composed of 51 places in 191 ms of which 5 ms to minimize.
[2024-05-21 00:55:02] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 6 ms to minimize.
[2024-05-21 00:55:02] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 4 ms to minimize.
[2024-05-21 00:55:03] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 5 ms to minimize.
[2024-05-21 00:55:03] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 4 ms to minimize.
[2024-05-21 00:55:03] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-21 00:55:04] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 4 ms to minimize.
[2024-05-21 00:55:04] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 4 ms to minimize.
[2024-05-21 00:55:05] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 5 ms to minimize.
[2024-05-21 00:55:05] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 3 ms to minimize.
[2024-05-21 00:55:05] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 4 ms to minimize.
[2024-05-21 00:55:05] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-21 00:55:06] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 4 ms to minimize.
[2024-05-21 00:55:06] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 3 ms to minimize.
[2024-05-21 00:55:06] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 3 ms to minimize.
[2024-05-21 00:55:07] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-21 00:55:07] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
[2024-05-21 00:55:07] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 4 ms to minimize.
[2024-05-21 00:55:07] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2024-05-21 00:55:07] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
SMT process timed out in 30215ms, After SMT, problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 30250ms
Starting structural reductions in LTL mode, iteration 1 : 338/390 places, 333/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31815 ms. Remains : 338/390 places, 333/388 transitions.
Support contains 89 out of 338 places after structural reductions.
[2024-05-21 00:55:08] [INFO ] Flatten gal took : 108 ms
[2024-05-21 00:55:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutoFlight-PT-04b-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 00:55:08] [INFO ] Flatten gal took : 44 ms
[2024-05-21 00:55:08] [INFO ] Input system was already deterministic with 333 transitions.
Support contains 80 out of 338 places (down from 89) after GAL structural reductions.
RANDOM walk for 40000 steps (196 resets) in 2406 ms. (16 steps per ms) remains 3/54 properties
BEST_FIRST walk for 40003 steps (19 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (18 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (18 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
[2024-05-21 00:55:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 115/121 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 197/318 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/338 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 00:55:09] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 3 ms to minimize.
[2024-05-21 00:55:09] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 3 ms to minimize.
[2024-05-21 00:55:10] [INFO ] Deduced a trap composed of 54 places in 255 ms of which 5 ms to minimize.
[2024-05-21 00:55:10] [INFO ] Deduced a trap composed of 50 places in 243 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 333/671 variables, 338/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/671 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/671 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 370 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1351 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 115/121 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 197/318 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 00:55:11] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 4 ms to minimize.
[2024-05-21 00:55:11] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 4 ms to minimize.
[2024-05-21 00:55:11] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-21 00:55:11] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-21 00:55:11] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-21 00:55:11] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-21 00:55:11] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-05-21 00:55:12] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 3 ms to minimize.
[2024-05-21 00:55:12] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-21 00:55:12] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 3 ms to minimize.
[2024-05-21 00:55:12] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 3 ms to minimize.
[2024-05-21 00:55:12] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 7 (OVERLAPS) 20/338 variables, 1/42 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 2/44 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 00:55:12] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 3 ms to minimize.
[2024-05-21 00:55:12] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-21 00:55:12] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-05-21 00:55:13] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 3 ms to minimize.
[2024-05-21 00:55:13] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 3 ms to minimize.
[2024-05-21 00:55:13] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-21 00:55:13] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 4 ms to minimize.
[2024-05-21 00:55:13] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 3 ms to minimize.
[2024-05-21 00:55:13] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 4 ms to minimize.
[2024-05-21 00:55:13] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 4 ms to minimize.
[2024-05-21 00:55:14] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 11/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 333/671 variables, 338/393 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/671 variables, 2/395 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 00:55:14] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 4 ms to minimize.
[2024-05-21 00:55:14] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2024-05-21 00:55:14] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-21 00:55:14] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 3 ms to minimize.
[2024-05-21 00:55:14] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
[2024-05-21 00:55:15] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-05-21 00:55:15] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 2 ms to minimize.
[2024-05-21 00:55:15] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/671 variables, 8/403 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/671 variables, 0/403 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/671 variables, 0/403 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 671/671 variables, and 403 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4479 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 35/35 constraints]
After SMT, in 5855ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 833 ms.
Support contains 2 out of 338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 333/333 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 338 transition count 218
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 134 rules applied. Total rules applied 249 place count 223 transition count 199
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 257 place count 215 transition count 199
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 257 place count 215 transition count 154
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 347 place count 170 transition count 154
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 359 place count 158 transition count 142
Iterating global reduction 3 with 12 rules applied. Total rules applied 371 place count 158 transition count 142
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 371 place count 158 transition count 135
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 385 place count 151 transition count 135
Performed 54 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 493 place count 97 transition count 75
Free-agglomeration rule applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 509 place count 97 transition count 59
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 525 place count 81 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 526 place count 80 transition count 58
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 38 rules applied. Total rules applied 564 place count 64 transition count 36
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 24 rules applied. Total rules applied 588 place count 42 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 590 place count 40 transition count 34
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 10 Pre rules applied. Total rules applied 590 place count 40 transition count 24
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 610 place count 30 transition count 24
Applied a total of 610 rules in 87 ms. Remains 30 /338 variables (removed 308) and now considering 24/333 (removed 309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 30/338 places, 24/333 transitions.
RANDOM walk for 181 steps (0 resets) in 8 ms. (20 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-21 00:55:16] [INFO ] Flatten gal took : 21 ms
[2024-05-21 00:55:16] [INFO ] Flatten gal took : 24 ms
[2024-05-21 00:55:16] [INFO ] Input system was already deterministic with 333 transitions.
Computed a total of 95 stabilizing places and 95 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 333/333 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 337 transition count 220
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 130 rules applied. Total rules applied 242 place count 225 transition count 202
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 251 place count 217 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 252 place count 216 transition count 201
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 252 place count 216 transition count 155
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 344 place count 170 transition count 155
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 356 place count 158 transition count 143
Iterating global reduction 4 with 12 rules applied. Total rules applied 368 place count 158 transition count 143
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 368 place count 158 transition count 138
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 378 place count 153 transition count 138
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 474 place count 105 transition count 90
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 480 place count 105 transition count 84
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 492 place count 99 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 493 place count 98 transition count 77
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 497 place count 94 transition count 77
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 497 place count 94 transition count 73
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 505 place count 90 transition count 73
Applied a total of 505 rules in 88 ms. Remains 90 /338 variables (removed 248) and now considering 73/333 (removed 260) transitions.
// Phase 1: matrix 73 rows 90 cols
[2024-05-21 00:55:16] [INFO ] Computed 24 invariants in 2 ms
[2024-05-21 00:55:16] [INFO ] Implicit Places using invariants in 97 ms returned [40, 54, 68, 73, 78, 83, 89]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 100 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 83/338 places, 73/333 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 77 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 77 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 76 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 76 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 75 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 75 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 74 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 74 transition count 64
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 0 with 2 rules applied. Total rules applied 20 place count 73 transition count 63
Applied a total of 20 rules in 19 ms. Remains 73 /83 variables (removed 10) and now considering 63/73 (removed 10) transitions.
// Phase 1: matrix 63 rows 73 cols
[2024-05-21 00:55:16] [INFO ] Computed 17 invariants in 1 ms
[2024-05-21 00:55:16] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 00:55:16] [INFO ] Invariant cache hit.
[2024-05-21 00:55:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 00:55:16] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 73/338 places, 63/333 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 379 ms. Remains : 73/338 places, 63/333 transitions.
[2024-05-21 00:55:16] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:55:16] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:55:16] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-21 00:55:16] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:55:16] [INFO ] Flatten gal took : 5 ms
[2024-05-21 00:55:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality12867591683637338581.gal : 2 ms
[2024-05-21 00:55:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality7973714967996550351.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/CTLCardinality12867591683637338581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7973714967996550351.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,3.8486e+07,0.034249,4044,2,401,5,2502,6,0,346,2830,0


Converting to forward existential form...Done !
original formula: AG(AF(((p173==0) * EG(((p159==0)||(p141==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p173==0) * EG(((p159==0)||(p141==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t59, t60, t61, t62, Intersection with reachable at each step enabled. (destroyed/reverse/int...179
(forward)formula 0,0,4.19679,116436,1,0,498,646006,153,238,1989,770777,636
FORMULA AutoFlight-PT-04b-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 333/333 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 337 transition count 221
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 127 rules applied. Total rules applied 238 place count 226 transition count 205
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 245 place count 220 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 246 place count 219 transition count 204
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 246 place count 219 transition count 159
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 336 place count 174 transition count 159
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 347 place count 163 transition count 148
Iterating global reduction 4 with 11 rules applied. Total rules applied 358 place count 163 transition count 148
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 358 place count 163 transition count 141
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 372 place count 156 transition count 141
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 470 place count 107 transition count 92
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 475 place count 107 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 481 place count 104 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 482 place count 104 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 484 place count 103 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 485 place count 102 transition count 81
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 489 place count 98 transition count 81
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 489 place count 98 transition count 77
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 497 place count 94 transition count 77
Applied a total of 497 rules in 59 ms. Remains 94 /338 variables (removed 244) and now considering 77/333 (removed 256) transitions.
// Phase 1: matrix 77 rows 94 cols
[2024-05-21 00:55:21] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 00:55:21] [INFO ] Implicit Places using invariants in 91 ms returned [58, 72, 77, 82, 87, 93]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 94 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 88/338 places, 77/333 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 84 transition count 73
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 84 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 82 transition count 71
Applied a total of 12 rules in 9 ms. Remains 82 /88 variables (removed 6) and now considering 71/77 (removed 6) transitions.
// Phase 1: matrix 71 rows 82 cols
[2024-05-21 00:55:21] [INFO ] Computed 18 invariants in 0 ms
[2024-05-21 00:55:21] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 00:55:21] [INFO ] Invariant cache hit.
[2024-05-21 00:55:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 00:55:21] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 82/338 places, 71/333 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 382 ms. Remains : 82/338 places, 71/333 transitions.
[2024-05-21 00:55:21] [INFO ] Flatten gal took : 8 ms
[2024-05-21 00:55:21] [INFO ] Flatten gal took : 8 ms
[2024-05-21 00:55:21] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-21 00:55:21] [INFO ] Flatten gal took : 8 ms
[2024-05-21 00:55:21] [INFO ] Flatten gal took : 8 ms
[2024-05-21 00:55:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality15711866884178568340.gal : 3 ms
[2024-05-21 00:55:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality1433369878056557432.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/CTLCardinality15711866884178568340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1433369878056557432.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,1.29641e+08,0.141231,6292,2,1537,5,11651,6,0,392,15175,0


Converting to forward existential form...Done !
original formula: EG(((EG(((p53!=1)||(p290!=1))) + (p146==1)) + (AG((p186==0)) + EF(!(A(((p118==0)||(p101==1)) U (p297==0)))))))
=> equivalent forward existential formula: [FwdG(Init,((EG(((p53!=1)||(p290!=1))) + (p146==1)) + (!(E(TRUE U !((p186==0)))) + E(TRUE U !(!((E(!((p297==0)) ...236
Reverse transition relation is NOT exact ! Due to transitions t3, t16, t48, t52, t61, t63, t65, t67, t69, t70, Intersection with reachable at each step en...209
(forward)formula 0,1,26.3464,603032,1,0,898,3.18147e+06,186,498,2389,4.52008e+06,1008
FORMULA AutoFlight-PT-04b-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 333/333 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 316 transition count 311
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 316 transition count 311
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 316 transition count 307
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 55 place count 309 transition count 300
Iterating global reduction 1 with 7 rules applied. Total rules applied 62 place count 309 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 308 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 308 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 307 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 307 transition count 298
Applied a total of 66 rules in 25 ms. Remains 307 /338 variables (removed 31) and now considering 298/333 (removed 35) transitions.
// Phase 1: matrix 298 rows 307 cols
[2024-05-21 00:55:48] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 00:55:48] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-21 00:55:48] [INFO ] Invariant cache hit.
[2024-05-21 00:55:48] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2024-05-21 00:55:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 00:55:55] [INFO ] Deduced a trap composed of 45 places in 373 ms of which 6 ms to minimize.
[2024-05-21 00:55:55] [INFO ] Deduced a trap composed of 48 places in 291 ms of which 5 ms to minimize.
[2024-05-21 00:55:55] [INFO ] Deduced a trap composed of 16 places in 286 ms of which 6 ms to minimize.
[2024-05-21 00:55:56] [INFO ] Deduced a trap composed of 65 places in 291 ms of which 6 ms to minimize.
[2024-05-21 00:55:56] [INFO ] Deduced a trap composed of 68 places in 300 ms of which 5 ms to minimize.
[2024-05-21 00:55:56] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 5 ms to minimize.
[2024-05-21 00:55:57] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 4 ms to minimize.
[2024-05-21 00:55:57] [INFO ] Deduced a trap composed of 49 places in 252 ms of which 5 ms to minimize.
[2024-05-21 00:55:57] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 5 ms to minimize.
[2024-05-21 00:55:57] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 4 ms to minimize.
[2024-05-21 00:55:58] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 4 ms to minimize.
[2024-05-21 00:55:58] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 4 ms to minimize.
[2024-05-21 00:55:58] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 4 ms to minimize.
[2024-05-21 00:55:58] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 4 ms to minimize.
[2024-05-21 00:55:58] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 4 ms to minimize.
[2024-05-21 00:55:59] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 4 ms to minimize.
[2024-05-21 00:55:59] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 4 ms to minimize.
[2024-05-21 00:55:59] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 4 ms to minimize.
[2024-05-21 00:55:59] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 5 ms to minimize.
[2024-05-21 00:56:00] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 00:56:03] [INFO ] Deduced a trap composed of 66 places in 279 ms of which 5 ms to minimize.
[2024-05-21 00:56:03] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 5 ms to minimize.
[2024-05-21 00:56:03] [INFO ] Deduced a trap composed of 55 places in 214 ms of which 5 ms to minimize.
[2024-05-21 00:56:04] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 4 ms to minimize.
[2024-05-21 00:56:04] [INFO ] Deduced a trap composed of 18 places in 213 ms of which 4 ms to minimize.
[2024-05-21 00:56:05] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 3 ms to minimize.
[2024-05-21 00:56:05] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 3 ms to minimize.
[2024-05-21 00:56:05] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-05-21 00:56:05] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 3 ms to minimize.
[2024-05-21 00:56:06] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 3 ms to minimize.
[2024-05-21 00:56:06] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 4 ms to minimize.
[2024-05-21 00:56:07] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 00:56:08] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2024-05-21 00:56:08] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 5 ms to minimize.
[2024-05-21 00:56:09] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2024-05-21 00:56:09] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 3 ms to minimize.
[2024-05-21 00:56:09] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 3 ms to minimize.
[2024-05-21 00:56:09] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-05-21 00:56:09] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 3 ms to minimize.
[2024-05-21 00:56:10] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 3 ms to minimize.
[2024-05-21 00:56:10] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 3 ms to minimize.
[2024-05-21 00:56:10] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 3 ms to minimize.
[2024-05-21 00:56:10] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
[2024-05-21 00:56:11] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 3 ms to minimize.
[2024-05-21 00:56:12] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 3 ms to minimize.
[2024-05-21 00:56:12] [INFO ] Deduced a trap composed of 63 places in 156 ms of which 3 ms to minimize.
[2024-05-21 00:56:12] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 00:56:14] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 4 ms to minimize.
[2024-05-21 00:56:14] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 4 ms to minimize.
[2024-05-21 00:56:14] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 3 ms to minimize.
[2024-05-21 00:56:15] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 3 ms to minimize.
[2024-05-21 00:56:15] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 307/605 variables, and 80 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/307 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 52/80 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 00:56:23] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 4 ms to minimize.
[2024-05-21 00:56:25] [INFO ] Deduced a trap composed of 67 places in 172 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 00:56:27] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 00:56:30] [INFO ] Deduced a trap composed of 50 places in 208 ms of which 4 ms to minimize.
[2024-05-21 00:56:31] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 00:56:34] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 3 ms to minimize.
[2024-05-21 00:56:34] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 4 ms to minimize.
[2024-05-21 00:56:34] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 298/605 variables, 307/395 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/605 variables, 297/692 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 00:56:43] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-21 00:56:44] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 4 ms to minimize.
[2024-05-21 00:56:44] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 4 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 Int declared 605/605 variables, and 695 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 63/63 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in LTL mode, iteration 1 : 307/338 places, 298/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60810 ms. Remains : 307/338 places, 298/333 transitions.
[2024-05-21 00:56:48] [INFO ] Flatten gal took : 23 ms
[2024-05-21 00:56:48] [INFO ] Flatten gal took : 23 ms
[2024-05-21 00:56:49] [INFO ] Input system was already deterministic with 298 transitions.
[2024-05-21 00:56:49] [INFO ] Flatten gal took : 22 ms
[2024-05-21 00:56:49] [INFO ] Flatten gal took : 22 ms
[2024-05-21 00:56:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality18430334540854042456.gal : 12 ms
[2024-05-21 00:56:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality7685678598454881779.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/CTLCardinality18430334540854042456.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7685678598454881779.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.26529e+22,25.1524,475088,2,132228,5,1.58996e+06,6,0,1528,3.00622e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.26529e+22,0.310119,12740,2799,15,18660,203,593,22143,38,337,0


Converting to forward existential form...Done !
original formula: AG(EF((EF(((i0.u40.p144==0)&&(i0.u82.p276==1))) + (AX(AF((i19.u106.p330==0))) * ((A((i14.u75.p260==1) U (i15.i1.u86.p285==0)) + (i4.i2.u2...193
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (E(TRUE U ((i0.u40.p144==0)&&(i0.u82.p276==1))) + (!(EX(!(!(EG(!((i19.u106.p330==...340
Reverse transition relation is NOT exact ! Due to transitions t91, t94, t117, t120, t153, t160, t177, t184, t206, t221, t287, t289, t290, t291, i0.u38.t9, ...738
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 333/333 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 314 transition count 309
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 314 transition count 309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 314 transition count 304
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 61 place count 306 transition count 296
Iterating global reduction 1 with 8 rules applied. Total rules applied 69 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 304 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 304 transition count 294
Applied a total of 73 rules in 24 ms. Remains 304 /338 variables (removed 34) and now considering 294/333 (removed 39) transitions.
// Phase 1: matrix 294 rows 304 cols
[2024-05-21 00:57:49] [INFO ] Computed 28 invariants in 4 ms
[2024-05-21 00:57:49] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-21 00:57:49] [INFO ] Invariant cache hit.
[2024-05-21 00:57:50] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-21 00:57:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 00:57:56] [INFO ] Deduced a trap composed of 19 places in 304 ms of which 6 ms to minimize.
[2024-05-21 00:57:56] [INFO ] Deduced a trap composed of 57 places in 229 ms of which 5 ms to minimize.
[2024-05-21 00:57:56] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 5 ms to minimize.
[2024-05-21 00:57:56] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 4 ms to minimize.
[2024-05-21 00:57:57] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 4 ms to minimize.
[2024-05-21 00:57:57] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 4 ms to minimize.
[2024-05-21 00:57:57] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 4 ms to minimize.
[2024-05-21 00:57:57] [INFO ] Deduced a trap composed of 51 places in 216 ms of which 5 ms to minimize.
[2024-05-21 00:57:58] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 4 ms to minimize.
[2024-05-21 00:57:58] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 4 ms to minimize.
[2024-05-21 00:57:58] [INFO ] Deduced a trap composed of 49 places in 261 ms of which 4 ms to minimize.
[2024-05-21 00:57:58] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 4 ms to minimize.
[2024-05-21 00:57:59] [INFO ] Deduced a trap composed of 54 places in 260 ms of which 5 ms to minimize.
[2024-05-21 00:57:59] [INFO ] Deduced a trap composed of 53 places in 241 ms of which 4 ms to minimize.
[2024-05-21 00:57:59] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 5 ms to minimize.
[2024-05-21 00:58:00] [INFO ] Deduced a trap composed of 53 places in 223 ms of which 5 ms to minimize.
[2024-05-21 00:58:00] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 4 ms to minimize.
[2024-05-21 00:58:00] [INFO ] Deduced a trap composed of 46 places in 206 ms of which 4 ms to minimize.
[2024-05-21 00:58:00] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 4 ms to minimize.
[2024-05-21 00:58:01] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 00:58:03] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 3 ms to minimize.
[2024-05-21 00:58:03] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 3 ms to minimize.
[2024-05-21 00:58:04] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 4 ms to minimize.
[2024-05-21 00:58:04] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 4 ms to minimize.
[2024-05-21 00:58:04] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 3 ms to minimize.
[2024-05-21 00:58:05] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 4 ms to minimize.
[2024-05-21 00:58:05] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 4 ms to minimize.
[2024-05-21 00:58:05] [INFO ] Deduced a trap composed of 47 places in 244 ms of which 5 ms to minimize.
[2024-05-21 00:58:05] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 3 ms to minimize.
[2024-05-21 00:58:06] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 3 ms to minimize.
[2024-05-21 00:58:06] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 4 ms to minimize.
[2024-05-21 00:58:06] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 3 ms to minimize.
[2024-05-21 00:58:06] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 3 ms to minimize.
[2024-05-21 00:58:06] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 3 ms to minimize.
[2024-05-21 00:58:06] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 3 ms to minimize.
[2024-05-21 00:58:06] [INFO ] Deduced a trap composed of 53 places in 186 ms of which 4 ms to minimize.
[2024-05-21 00:58:07] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 4 ms to minimize.
[2024-05-21 00:58:07] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 3 ms to minimize.
[2024-05-21 00:58:07] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 3 ms to minimize.
[2024-05-21 00:58:07] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 00:58:08] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 4 ms to minimize.
[2024-05-21 00:58:08] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 3 ms to minimize.
[2024-05-21 00:58:08] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2024-05-21 00:58:09] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 5 ms to minimize.
[2024-05-21 00:58:09] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 3 ms to minimize.
[2024-05-21 00:58:09] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-21 00:58:09] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 00:58:09] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 3 ms to minimize.
[2024-05-21 00:58:09] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-21 00:58:10] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 3 ms to minimize.
[2024-05-21 00:58:10] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 3 ms to minimize.
[2024-05-21 00:58:10] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-21 00:58:11] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
[2024-05-21 00:58:11] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
[2024-05-21 00:58:11] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 2 ms to minimize.
[2024-05-21 00:58:11] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 4 ms to minimize.
[2024-05-21 00:58:11] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 3 ms to minimize.
[2024-05-21 00:58:11] [INFO ] Deduced a trap composed of 69 places in 149 ms of which 3 ms to minimize.
[2024-05-21 00:58:12] [INFO ] Deduced a trap composed of 63 places in 147 ms of which 3 ms to minimize.
[2024-05-21 00:58:12] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 00:58:13] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-05-21 00:58:13] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 3 ms to minimize.
[2024-05-21 00:58:13] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 3 ms to minimize.
[2024-05-21 00:58:13] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 3 ms to minimize.
[2024-05-21 00:58:14] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 3 ms to minimize.
[2024-05-21 00:58:14] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 00:58:18] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-05-21 00:58:18] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/598 variables, and 96 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 68/96 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 00:58:22] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-05-21 00:58:23] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-05-21 00:58:23] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (OVERLAPS) 294/598 variables, 304/403 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 293/696 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 00:58:28] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 2 ms to minimize.
[2024-05-21 00:58:28] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-21 00:58:28] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-21 00:58:29] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 3 ms to minimize.
[2024-05-21 00:58:29] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 5/701 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 00:58:40] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 3 ms to minimize.
[2024-05-21 00:58:41] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 3 ms to minimize.
[2024-05-21 00:58:41] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2024-05-21 00:58:42] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
[2024-05-21 00:58:42] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 3 ms to minimize.
[2024-05-21 00:58:42] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 3 ms to minimize.
[2024-05-21 00:58:42] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 3 ms to minimize.
[2024-05-21 00:58:42] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 4 ms to minimize.
[2024-05-21 00:58:42] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 9/710 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 710 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 85/85 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Starting structural reductions in LTL mode, iteration 1 : 304/338 places, 294/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60661 ms. Remains : 304/338 places, 294/333 transitions.
[2024-05-21 00:58:50] [INFO ] Flatten gal took : 12 ms
[2024-05-21 00:58:50] [INFO ] Flatten gal took : 10 ms
[2024-05-21 00:58:50] [INFO ] Input system was already deterministic with 294 transitions.
[2024-05-21 00:58:50] [INFO ] Flatten gal took : 10 ms
[2024-05-21 00:58:50] [INFO ] Flatten gal took : 10 ms
[2024-05-21 00:58:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality5604441321727669860.gal : 8 ms
[2024-05-21 00:58:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality13484705306135152467.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/CTLCardinality5604441321727669860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13484705306135152467.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,5.14719e+22,21.9673,464232,2,129777,5,1.54453e+06,6,0,1512,2.92427e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 00:59:20] [INFO ] Flatten gal took : 12 ms
[2024-05-21 00:59:20] [INFO ] Applying decomposition
[2024-05-21 00:59:20] [INFO ] Flatten gal took : 11 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/graph17698248367654920371.txt' '-o' '/tmp/graph17698248367654920371.bin' '-w' '/tmp/graph17698248367654920371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17698248367654920371.bin' '-l' '-1' '-v' '-w' '/tmp/graph17698248367654920371.weights' '-q' '0' '-e' '0.001'
[2024-05-21 00:59:20] [INFO ] Decomposing Gal with order
[2024-05-21 00:59:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 00:59:20] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-21 00:59:20] [INFO ] Flatten gal took : 28 ms
[2024-05-21 00:59:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 00:59:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality18199092463756324130.gal : 8 ms
[2024-05-21 00:59:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality12637034571863212860.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/CTLCardinality18199092463756324130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12637034571863212860.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,5.14719e+22,0.451262,16976,2494,14,29822,202,591,32500,28,427,0


Converting to forward existential form...Done !
original formula: AX(AX(AF((i9.i1.u5.p12==1))))
=> equivalent forward existential formula: [FwdG(EY(EY(Init)),!((i9.i1.u5.p12==1)))] = FALSE
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 333/333 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 337 transition count 219
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 129 rules applied. Total rules applied 242 place count 224 transition count 203
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 250 place count 218 transition count 201
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 254 place count 216 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 255 place count 215 transition count 199
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 44 Pre rules applied. Total rules applied 255 place count 215 transition count 155
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 343 place count 171 transition count 155
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 355 place count 159 transition count 143
Iterating global reduction 5 with 12 rules applied. Total rules applied 367 place count 159 transition count 143
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 367 place count 159 transition count 136
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 381 place count 152 transition count 136
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 479 place count 103 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 485 place count 103 transition count 81
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 6 with 12 rules applied. Total rules applied 497 place count 97 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 498 place count 96 transition count 74
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 502 place count 92 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 502 place count 92 transition count 70
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 510 place count 88 transition count 70
Applied a total of 510 rules in 50 ms. Remains 88 /338 variables (removed 250) and now considering 70/333 (removed 263) transitions.
// Phase 1: matrix 70 rows 88 cols
[2024-05-21 00:59:50] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 00:59:50] [INFO ] Implicit Places using invariants in 96 ms returned [38, 52, 66, 71, 76, 81, 87]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 109 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 81/338 places, 70/333 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 76 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 76 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 75 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 75 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 74 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 74 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 73 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 73 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 72 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 72 transition count 61
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 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 60
Applied a total of 20 rules in 17 ms. Remains 71 /81 variables (removed 10) and now considering 60/70 (removed 10) transitions.
// Phase 1: matrix 60 rows 71 cols
[2024-05-21 00:59:50] [INFO ] Computed 17 invariants in 1 ms
[2024-05-21 00:59:50] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 00:59:50] [INFO ] Invariant cache hit.
[2024-05-21 00:59:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 00:59:51] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 71/338 places, 60/333 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 406 ms. Remains : 71/338 places, 60/333 transitions.
[2024-05-21 00:59:51] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:59:51] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:59:51] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-21 00:59:51] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:59:51] [INFO ] Flatten gal took : 4 ms
[2024-05-21 00:59:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality16954456450111819770.gal : 2 ms
[2024-05-21 00:59:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality8733176124474276207.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/CTLCardinality16954456450111819770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8733176124474276207.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,1.99066e+07,0.038795,4124,2,391,5,2423,6,0,338,2738,0


Converting to forward existential form...Done !
original formula: EG((EF((p222==1)) + (p216==1)))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (p222==1)) + (p216==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t56, t57, t59, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...174
(forward)formula 0,1,0.762633,25432,1,0,222,105873,148,159,1982,165126,240
FORMULA AutoFlight-PT-04b-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 333/333 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 320 transition count 315
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 320 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 320 transition count 311
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 315 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 315 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 314 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 314 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 313 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 313 transition count 304
Applied a total of 54 rules in 25 ms. Remains 313 /338 variables (removed 25) and now considering 304/333 (removed 29) transitions.
// Phase 1: matrix 304 rows 313 cols
[2024-05-21 00:59:51] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 00:59:52] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-21 00:59:52] [INFO ] Invariant cache hit.
[2024-05-21 00:59:52] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-05-21 00:59:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/313 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 00:59:59] [INFO ] Deduced a trap composed of 60 places in 291 ms of which 6 ms to minimize.
[2024-05-21 00:59:59] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 5 ms to minimize.
[2024-05-21 00:59:59] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 5 ms to minimize.
[2024-05-21 01:00:00] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 4 ms to minimize.
[2024-05-21 01:00:00] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 4 ms to minimize.
[2024-05-21 01:00:00] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 4 ms to minimize.
[2024-05-21 01:00:00] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 5 ms to minimize.
[2024-05-21 01:00:01] [INFO ] Deduced a trap composed of 60 places in 201 ms of which 5 ms to minimize.
[2024-05-21 01:00:01] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 4 ms to minimize.
[2024-05-21 01:00:01] [INFO ] Deduced a trap composed of 54 places in 188 ms of which 4 ms to minimize.
[2024-05-21 01:00:01] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 5 ms to minimize.
[2024-05-21 01:00:01] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 4 ms to minimize.
[2024-05-21 01:00:02] [INFO ] Deduced a trap composed of 56 places in 240 ms of which 4 ms to minimize.
[2024-05-21 01:00:02] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 5 ms to minimize.
[2024-05-21 01:00:02] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 5 ms to minimize.
[2024-05-21 01:00:03] [INFO ] Deduced a trap composed of 54 places in 188 ms of which 4 ms to minimize.
[2024-05-21 01:00:03] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 4 ms to minimize.
[2024-05-21 01:00:04] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 3 ms to minimize.
[2024-05-21 01:00:04] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 3 ms to minimize.
[2024-05-21 01:00:04] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:00:08] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 5 ms to minimize.
[2024-05-21 01:00:08] [INFO ] Deduced a trap composed of 58 places in 196 ms of which 4 ms to minimize.
[2024-05-21 01:00:08] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 4 ms to minimize.
[2024-05-21 01:00:08] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 4 ms to minimize.
[2024-05-21 01:00:08] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 3 ms to minimize.
[2024-05-21 01:00:09] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
[2024-05-21 01:00:09] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 3 ms to minimize.
[2024-05-21 01:00:09] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 3 ms to minimize.
[2024-05-21 01:00:10] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 2 ms to minimize.
[2024-05-21 01:00:10] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 4 ms to minimize.
[2024-05-21 01:00:10] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 3 ms to minimize.
[2024-05-21 01:00:10] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 3 ms to minimize.
[2024-05-21 01:00:10] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 3 ms to minimize.
[2024-05-21 01:00:10] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 3 ms to minimize.
[2024-05-21 01:00:11] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 3 ms to minimize.
[2024-05-21 01:00:11] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 4 ms to minimize.
[2024-05-21 01:00:12] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 4 ms to minimize.
[2024-05-21 01:00:12] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 3 ms to minimize.
[2024-05-21 01:00:12] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
[2024-05-21 01:00:13] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:00:14] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 3 ms to minimize.
[2024-05-21 01:00:14] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 3 ms to minimize.
[2024-05-21 01:00:14] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 4 ms to minimize.
[2024-05-21 01:00:14] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
[2024-05-21 01:00:15] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 4 ms to minimize.
[2024-05-21 01:00:15] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 4 ms to minimize.
[2024-05-21 01:00:15] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 3 ms to minimize.
[2024-05-21 01:00:16] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-21 01:00:17] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2024-05-21 01:00:17] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 01:00:17] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:00:19] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 4 ms to minimize.
[2024-05-21 01:00:19] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
[2024-05-21 01:00:19] [INFO ] Deduced a trap composed of 57 places in 216 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 313/617 variables, and 82 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/313 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/313 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 54/82 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:00:26] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 4 ms to minimize.
[2024-05-21 01:00:27] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 4 ms to minimize.
[2024-05-21 01:00:27] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 3 ms to minimize.
[2024-05-21 01:00:28] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-21 01:00:29] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-21 01:00:29] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-21 01:00:29] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 3 ms to minimize.
[2024-05-21 01:00:29] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 3 ms to minimize.
[2024-05-21 01:00:29] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 2 ms to minimize.
[2024-05-21 01:00:29] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 4 ms to minimize.
[2024-05-21 01:00:30] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-05-21 01:00:30] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-21 01:00:30] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (OVERLAPS) 304/617 variables, 313/408 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/617 variables, 303/711 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:00:35] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-21 01:00:36] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-21 01:00:36] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 2 ms to minimize.
[2024-05-21 01:00:37] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 2 ms to minimize.
[2024-05-21 01:00:37] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-05-21 01:00:37] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-21 01:00:37] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
[2024-05-21 01:00:38] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 3 ms to minimize.
[2024-05-21 01:00:38] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-05-21 01:00:38] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-21 01:00:41] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/617 variables, 11/722 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 01:00:48] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 3 ms to minimize.
[2024-05-21 01:00:48] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 3 ms to minimize.
[2024-05-21 01:00:48] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 3 ms to minimize.
[2024-05-21 01:00:48] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 2 ms to minimize.
[2024-05-21 01:00:49] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/617 variables, and 727 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 83/83 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in LTL mode, iteration 1 : 313/338 places, 304/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60755 ms. Remains : 313/338 places, 304/333 transitions.
[2024-05-21 01:00:52] [INFO ] Flatten gal took : 14 ms
[2024-05-21 01:00:52] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:00:52] [INFO ] Input system was already deterministic with 304 transitions.
[2024-05-21 01:00:52] [INFO ] Flatten gal took : 14 ms
[2024-05-21 01:00:52] [INFO ] Flatten gal took : 14 ms
[2024-05-21 01:00:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality8198959813163236543.gal : 4 ms
[2024-05-21 01:00:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality8138672184383346076.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/CTLCardinality8198959813163236543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8138672184383346076.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 01:01:22] [INFO ] Flatten gal took : 9 ms
[2024-05-21 01:01:22] [INFO ] Applying decomposition
[2024-05-21 01:01:22] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4414647622307318005.txt' '-o' '/tmp/graph4414647622307318005.bin' '-w' '/tmp/graph4414647622307318005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4414647622307318005.bin' '-l' '-1' '-v' '-w' '/tmp/graph4414647622307318005.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:01:22] [INFO ] Decomposing Gal with order
[2024-05-21 01:01:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:01:22] [INFO ] Removed a total of 58 redundant transitions.
[2024-05-21 01:01:22] [INFO ] Flatten gal took : 25 ms
[2024-05-21 01:01:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 01:01:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality4307109190912645989.gal : 4 ms
[2024-05-21 01:01:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality12113995268535811672.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/CTLCardinality4307109190912645989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12113995268535811672.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.51183e+22,1.18889,31308,4165,18,56785,230,601,85016,36,483,0


Converting to forward existential form...Done !
original formula: AF(((i12.u48.p164==1) + ((EF((i1.i1.u55.p186==1)) * AX(((i3.u16.p34==0)&&(i3.u16.p36==0)))) * (AF((i9.i1.u97.p306==1)) + ((((i15.i2.u92.p...288
=> equivalent forward existential formula: [FwdG(Init,!(((i12.u48.p164==1) + ((E(TRUE U (i1.i1.u55.p186==1)) * !(EX(!(((i3.u16.p34==0)&&(i3.u16.p36==0)))))...351
Reverse transition relation is NOT exact ! Due to transitions t95, t98, t121, t124, t156, t163, t178, t209, t224, t293, t295, t296, t297, i0.t111, i0.t108,...801
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 333/333 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 314 transition count 309
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 314 transition count 309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 314 transition count 304
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 61 place count 306 transition count 296
Iterating global reduction 1 with 8 rules applied. Total rules applied 69 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 304 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 304 transition count 294
Applied a total of 73 rules in 21 ms. Remains 304 /338 variables (removed 34) and now considering 294/333 (removed 39) transitions.
// Phase 1: matrix 294 rows 304 cols
[2024-05-21 01:01:53] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 01:01:53] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 01:01:53] [INFO ] Invariant cache hit.
[2024-05-21 01:01:53] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-21 01:01:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:01:58] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 6 ms to minimize.
[2024-05-21 01:01:59] [INFO ] Deduced a trap composed of 57 places in 219 ms of which 3 ms to minimize.
[2024-05-21 01:01:59] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 5 ms to minimize.
[2024-05-21 01:01:59] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 5 ms to minimize.
[2024-05-21 01:01:59] [INFO ] Deduced a trap composed of 50 places in 221 ms of which 5 ms to minimize.
[2024-05-21 01:01:59] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 4 ms to minimize.
[2024-05-21 01:02:00] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 5 ms to minimize.
[2024-05-21 01:02:00] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 3 ms to minimize.
[2024-05-21 01:02:00] [INFO ] Deduced a trap composed of 58 places in 190 ms of which 4 ms to minimize.
[2024-05-21 01:02:00] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 3 ms to minimize.
[2024-05-21 01:02:00] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 3 ms to minimize.
[2024-05-21 01:02:01] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 4 ms to minimize.
[2024-05-21 01:02:01] [INFO ] Deduced a trap composed of 54 places in 251 ms of which 5 ms to minimize.
[2024-05-21 01:02:01] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 3 ms to minimize.
[2024-05-21 01:02:01] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 5 ms to minimize.
[2024-05-21 01:02:02] [INFO ] Deduced a trap composed of 53 places in 228 ms of which 5 ms to minimize.
[2024-05-21 01:02:02] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 3 ms to minimize.
[2024-05-21 01:02:02] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 3 ms to minimize.
[2024-05-21 01:02:02] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 3 ms to minimize.
[2024-05-21 01:02:03] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:02:06] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 4 ms to minimize.
[2024-05-21 01:02:06] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 4 ms to minimize.
[2024-05-21 01:02:06] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 4 ms to minimize.
[2024-05-21 01:02:06] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 3 ms to minimize.
[2024-05-21 01:02:06] [INFO ] Deduced a trap composed of 54 places in 182 ms of which 4 ms to minimize.
[2024-05-21 01:02:07] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 4 ms to minimize.
[2024-05-21 01:02:07] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 4 ms to minimize.
[2024-05-21 01:02:07] [INFO ] Deduced a trap composed of 47 places in 248 ms of which 10 ms to minimize.
[2024-05-21 01:02:08] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 3 ms to minimize.
[2024-05-21 01:02:08] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 3 ms to minimize.
[2024-05-21 01:02:08] [INFO ] Deduced a trap composed of 63 places in 131 ms of which 4 ms to minimize.
[2024-05-21 01:02:08] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-05-21 01:02:08] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 3 ms to minimize.
[2024-05-21 01:02:08] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 ms to minimize.
[2024-05-21 01:02:08] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-05-21 01:02:09] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 3 ms to minimize.
[2024-05-21 01:02:09] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 4 ms to minimize.
[2024-05-21 01:02:09] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 3 ms to minimize.
[2024-05-21 01:02:09] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 3 ms to minimize.
[2024-05-21 01:02:09] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:02:10] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 4 ms to minimize.
[2024-05-21 01:02:10] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 4 ms to minimize.
[2024-05-21 01:02:11] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 4 ms to minimize.
[2024-05-21 01:02:11] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 4 ms to minimize.
[2024-05-21 01:02:11] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 4 ms to minimize.
[2024-05-21 01:02:11] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 4 ms to minimize.
[2024-05-21 01:02:12] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 4 ms to minimize.
[2024-05-21 01:02:12] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 4 ms to minimize.
[2024-05-21 01:02:12] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-21 01:02:13] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
[2024-05-21 01:02:13] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-05-21 01:02:13] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-21 01:02:14] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-21 01:02:14] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 01:02:14] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-21 01:02:14] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-05-21 01:02:14] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-21 01:02:14] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 3 ms to minimize.
[2024-05-21 01:02:14] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 3 ms to minimize.
[2024-05-21 01:02:14] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:02:15] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 3 ms to minimize.
[2024-05-21 01:02:15] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 3 ms to minimize.
[2024-05-21 01:02:16] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 4 ms to minimize.
[2024-05-21 01:02:16] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 3 ms to minimize.
[2024-05-21 01:02:17] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 4 ms to minimize.
[2024-05-21 01:02:17] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:02:23] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2024-05-21 01:02:23] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/598 variables, and 96 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 68/96 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:02:27] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 3 ms to minimize.
[2024-05-21 01:02:27] [INFO ] Deduced a trap composed of 62 places in 156 ms of which 3 ms to minimize.
[2024-05-21 01:02:28] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (OVERLAPS) 294/598 variables, 304/403 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 293/696 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:02:36] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 3 ms to minimize.
[2024-05-21 01:02:36] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-05-21 01:02:36] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 3 ms to minimize.
[2024-05-21 01:02:37] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 4 ms to minimize.
[2024-05-21 01:02:38] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 5/701 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:02:50] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 4 ms to minimize.
[2024-05-21 01:02:51] [INFO ] Deduced a trap composed of 60 places in 184 ms of which 4 ms to minimize.
[2024-05-21 01:02:51] [INFO ] Deduced a trap composed of 60 places in 175 ms of which 4 ms to minimize.
[2024-05-21 01:02:52] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 4 ms to minimize.
[2024-05-21 01:02:52] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 3 ms to minimize.
[2024-05-21 01:02:52] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 3 ms to minimize.
[2024-05-21 01:02:53] [INFO ] Deduced a trap composed of 61 places in 174 ms of which 4 ms to minimize.
[2024-05-21 01:02:53] [INFO ] Deduced a trap composed of 60 places in 148 ms of which 3 ms to minimize.
[2024-05-21 01:02:53] [INFO ] Deduced a trap composed of 58 places in 159 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 710 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 85/85 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 304/338 places, 294/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60607 ms. Remains : 304/338 places, 294/333 transitions.
[2024-05-21 01:02:53] [INFO ] Flatten gal took : 16 ms
[2024-05-21 01:02:53] [INFO ] Flatten gal took : 12 ms
[2024-05-21 01:02:53] [INFO ] Input system was already deterministic with 294 transitions.
[2024-05-21 01:02:53] [INFO ] Flatten gal took : 11 ms
[2024-05-21 01:02:53] [INFO ] Flatten gal took : 12 ms
[2024-05-21 01:02:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality14212617081820151006.gal : 4 ms
[2024-05-21 01:02:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality688494975926952899.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/CTLCardinality14212617081820151006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality688494975926952899.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,5.14719e+22,19.9209,463312,2,129777,5,1.54453e+06,6,0,1512,2.92427e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 01:03:23] [INFO ] Flatten gal took : 8 ms
[2024-05-21 01:03:23] [INFO ] Applying decomposition
[2024-05-21 01:03:23] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14314269582172778622.txt' '-o' '/tmp/graph14314269582172778622.bin' '-w' '/tmp/graph14314269582172778622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14314269582172778622.bin' '-l' '-1' '-v' '-w' '/tmp/graph14314269582172778622.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:03:23] [INFO ] Decomposing Gal with order
[2024-05-21 01:03:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:03:23] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-21 01:03:23] [INFO ] Flatten gal took : 30 ms
[2024-05-21 01:03:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 01:03:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality15058952925738128221.gal : 5 ms
[2024-05-21 01:03:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality14637276969610440964.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/CTLCardinality15058952925738128221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14637276969610440964.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,5.14719e+22,0.443909,13524,2258,14,20511,199,607,25444,28,409,0


Converting to forward existential form...Done !
original formula: EG(EX((i13.i2.u108.p343==0)))
=> equivalent forward existential formula: [FwdG(Init,EX((i13.i2.u108.p343==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t104, t107, t130, t133, t151, t158, t180, t195, t202, t217, t283, t285, t286, t287, i0.t147, ...751
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 333/333 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 337 transition count 227
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 116 rules applied. Total rules applied 221 place count 232 transition count 216
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 228 place count 229 transition count 212
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 232 place count 225 transition count 212
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 232 place count 225 transition count 169
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 318 place count 182 transition count 169
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 333 place count 167 transition count 154
Iterating global reduction 4 with 15 rules applied. Total rules applied 348 place count 167 transition count 154
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 348 place count 167 transition count 145
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 366 place count 158 transition count 145
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 456 place count 113 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 462 place count 113 transition count 94
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 474 place count 107 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 475 place count 106 transition count 87
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 479 place count 102 transition count 87
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 479 place count 102 transition count 83
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 487 place count 98 transition count 83
Applied a total of 487 rules in 32 ms. Remains 98 /338 variables (removed 240) and now considering 83/333 (removed 250) transitions.
// Phase 1: matrix 83 rows 98 cols
[2024-05-21 01:03:54] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 01:03:54] [INFO ] Implicit Places using invariants in 101 ms returned [43, 57, 81, 86, 91, 97]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 102 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 92/338 places, 83/333 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 88 transition count 79
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 88 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 87 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 87 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 86 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 86 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 85 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 85 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 84 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 84 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 82 transition count 73
Applied a total of 20 rules in 9 ms. Remains 82 /92 variables (removed 10) and now considering 73/83 (removed 10) transitions.
// Phase 1: matrix 73 rows 82 cols
[2024-05-21 01:03:54] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 01:03:54] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 01:03:54] [INFO ] Invariant cache hit.
[2024-05-21 01:03:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 01:03:54] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 82/338 places, 73/333 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 318 ms. Remains : 82/338 places, 73/333 transitions.
[2024-05-21 01:03:54] [INFO ] Flatten gal took : 2 ms
[2024-05-21 01:03:54] [INFO ] Flatten gal took : 2 ms
[2024-05-21 01:03:54] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-21 01:03:54] [INFO ] Flatten gal took : 2 ms
[2024-05-21 01:03:54] [INFO ] Flatten gal took : 2 ms
[2024-05-21 01:03:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality13390307092876031523.gal : 1 ms
[2024-05-21 01:03:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality16062804289276203117.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/CTLCardinality13390307092876031523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16062804289276203117.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,3.42842e+08,0.028875,4204,2,495,5,3274,6,0,399,3111,0


Converting to forward existential form...Done !
original formula: EF(EG(E((EF((p47==1)) * ((p334==0)||(p330==1))) U (E((p304==1) U ((p74==0)||(p181==1))) + A(((p16==0)||(p223==1)) U (p238==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),E((E(TRUE U (p47==1)) * ((p334==0)||(p330==1))) U (E((p304==1) U ((p74==0)||(p181==1))) + ...251
Reverse transition relation is NOT exact ! Due to transitions t53, t55, t65, t69, Intersection with reachable at each step enabled. (destroyed/reverse/int...179
(forward)formula 0,1,2.08488,58704,1,0,550,317130,192,271,2379,342127,649
FORMULA AutoFlight-PT-04b-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 333/333 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 316 transition count 311
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 316 transition count 311
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 316 transition count 307
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 56 place count 308 transition count 299
Iterating global reduction 1 with 8 rules applied. Total rules applied 64 place count 308 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 307 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 307 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 306 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 306 transition count 297
Applied a total of 68 rules in 22 ms. Remains 306 /338 variables (removed 32) and now considering 297/333 (removed 36) transitions.
// Phase 1: matrix 297 rows 306 cols
[2024-05-21 01:03:56] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 01:03:56] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 01:03:56] [INFO ] Invariant cache hit.
[2024-05-21 01:03:57] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-05-21 01:03:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:04:03] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 4 ms to minimize.
[2024-05-21 01:04:03] [INFO ] Deduced a trap composed of 50 places in 161 ms of which 4 ms to minimize.
[2024-05-21 01:04:04] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-05-21 01:04:04] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 3 ms to minimize.
[2024-05-21 01:04:04] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 3 ms to minimize.
[2024-05-21 01:04:04] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 3 ms to minimize.
[2024-05-21 01:04:04] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 3 ms to minimize.
[2024-05-21 01:04:04] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 3 ms to minimize.
[2024-05-21 01:04:05] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 3 ms to minimize.
[2024-05-21 01:04:05] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 3 ms to minimize.
[2024-05-21 01:04:05] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 2 ms to minimize.
[2024-05-21 01:04:05] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 3 ms to minimize.
[2024-05-21 01:04:05] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
[2024-05-21 01:04:05] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
[2024-05-21 01:04:05] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 3 ms to minimize.
[2024-05-21 01:04:06] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 3 ms to minimize.
[2024-05-21 01:04:06] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 4 ms to minimize.
[2024-05-21 01:04:06] [INFO ] Deduced a trap composed of 51 places in 148 ms of which 3 ms to minimize.
[2024-05-21 01:04:06] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 2 ms to minimize.
[2024-05-21 01:04:06] [INFO ] Deduced a trap composed of 64 places in 131 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:04:10] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 4 ms to minimize.
[2024-05-21 01:04:10] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 4 ms to minimize.
[2024-05-21 01:04:10] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-05-21 01:04:11] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2024-05-21 01:04:11] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 4 ms to minimize.
[2024-05-21 01:04:11] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 3 ms to minimize.
[2024-05-21 01:04:11] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
[2024-05-21 01:04:11] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 3 ms to minimize.
[2024-05-21 01:04:12] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 3 ms to minimize.
[2024-05-21 01:04:12] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 3 ms to minimize.
[2024-05-21 01:04:12] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 3 ms to minimize.
[2024-05-21 01:04:12] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 3 ms to minimize.
[2024-05-21 01:04:12] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 3 ms to minimize.
[2024-05-21 01:04:12] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 3 ms to minimize.
[2024-05-21 01:04:13] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 3 ms to minimize.
[2024-05-21 01:04:13] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 3 ms to minimize.
[2024-05-21 01:04:13] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 3 ms to minimize.
[2024-05-21 01:04:13] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 3 ms to minimize.
[2024-05-21 01:04:14] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 4 ms to minimize.
[2024-05-21 01:04:14] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:04:16] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 01:04:16] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:04:19] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 3 ms to minimize.
[2024-05-21 01:04:20] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/603 variables, and 72 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 44/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:04:31] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2024-05-21 01:04:31] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 3 ms to minimize.
[2024-05-21 01:04:31] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-05-21 01:04:31] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2024-05-21 01:04:31] [INFO ] Deduced a trap composed of 57 places in 193 ms of which 4 ms to minimize.
[2024-05-21 01:04:31] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 3 ms to minimize.
[2024-05-21 01:04:31] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 3 ms to minimize.
[2024-05-21 01:04:32] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 3 ms to minimize.
[2024-05-21 01:04:32] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 3 ms to minimize.
[2024-05-21 01:04:32] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 3 ms to minimize.
[2024-05-21 01:04:33] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 3 ms to minimize.
[2024-05-21 01:04:33] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 4 ms to minimize.
[2024-05-21 01:04:33] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 4 ms to minimize.
[2024-05-21 01:04:33] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 3 ms to minimize.
[2024-05-21 01:04:33] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 3 ms to minimize.
[2024-05-21 01:04:33] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 3 ms to minimize.
[2024-05-21 01:04:34] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 3 ms to minimize.
[2024-05-21 01:04:34] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 2 ms to minimize.
[2024-05-21 01:04:34] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 4 ms to minimize.
[2024-05-21 01:04:35] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:04:36] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 3 ms to minimize.
[2024-05-21 01:04:36] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 3 ms to minimize.
[2024-05-21 01:04:38] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 2 ms to minimize.
[2024-05-21 01:04:38] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:04:40] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 3 ms to minimize.
[2024-05-21 01:04:40] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 2 ms to minimize.
[2024-05-21 01:04:42] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (OVERLAPS) 297/603 variables, 306/405 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 296/701 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:04:48] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-21 01:04:48] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-21 01:04:48] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-21 01:04:49] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 3 ms to minimize.
[2024-05-21 01:04:49] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 3 ms to minimize.
[2024-05-21 01:04:49] [INFO ] Deduced a trap composed of 56 places in 182 ms of which 4 ms to minimize.
[2024-05-21 01:04:49] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 3 ms to minimize.
[2024-05-21 01:04:50] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 3 ms to minimize.
[2024-05-21 01:04:50] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 3 ms to minimize.
[2024-05-21 01:04:50] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 3 ms to minimize.
[2024-05-21 01:04:51] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 4 ms to minimize.
[2024-05-21 01:04:51] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 4 ms to minimize.
[2024-05-21 01:04:52] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
[2024-05-21 01:04:53] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/603 variables, and 715 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 85/85 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 306/338 places, 297/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60734 ms. Remains : 306/338 places, 297/333 transitions.
[2024-05-21 01:04:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:04:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:04:57] [INFO ] Input system was already deterministic with 297 transitions.
[2024-05-21 01:04:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:04:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:04:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality852982550636956090.gal : 3 ms
[2024-05-21 01:04:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality17205762859626334257.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/CTLCardinality852982550636956090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17205762859626334257.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,6.04909e+22,23.2044,472424,2,133512,5,1.57183e+06,6,0,1523,2.9805e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 01:05:27] [INFO ] Flatten gal took : 7 ms
[2024-05-21 01:05:27] [INFO ] Applying decomposition
[2024-05-21 01:05:27] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6069597770673805014.txt' '-o' '/tmp/graph6069597770673805014.bin' '-w' '/tmp/graph6069597770673805014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6069597770673805014.bin' '-l' '-1' '-v' '-w' '/tmp/graph6069597770673805014.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:05:27] [INFO ] Decomposing Gal with order
[2024-05-21 01:05:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:05:27] [INFO ] Removed a total of 57 redundant transitions.
[2024-05-21 01:05:27] [INFO ] Flatten gal took : 17 ms
[2024-05-21 01:05:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 01:05:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality4218397642126515162.gal : 5 ms
[2024-05-21 01:05:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality10701486910304946845.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/CTLCardinality4218397642126515162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10701486910304946845.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,6.04909e+22,0.771725,19648,3714,24,33877,257,608,41081,43,505,0


Converting to forward existential form...Done !
original formula: (EG(((i10.i1.u103.p326==0) + AG((i9.u95.p307==0)))) + (AG(AX(!(A(((i10.i1.u53.p192==0)||(i10.i0.u49.p182==1)) U (i8.u41.p144==1))))) * EG...234
=> equivalent forward existential formula: ([((EY(FwdU((Init * !(EG(((i10.i1.u103.p326==0) + !(E(TRUE U !((i9.u95.p307==0)))))))),TRUE)) * !(EG(!((i8.u41.p...471
Reverse transition relation is NOT exact ! Due to transitions t95, t105, t108, t131, t152, t159, t183, t205, t220, t286, t288, t289, t290, i0.u43.t10, i0.u...784
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 333/333 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 319 transition count 314
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 319 transition count 314
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 319 transition count 311
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 312 transition count 304
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 312 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 311 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 311 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 310 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 310 transition count 302
Applied a total of 59 rules in 19 ms. Remains 310 /338 variables (removed 28) and now considering 302/333 (removed 31) transitions.
// Phase 1: matrix 302 rows 310 cols
[2024-05-21 01:05:57] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 01:05:57] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-21 01:05:57] [INFO ] Invariant cache hit.
[2024-05-21 01:05:58] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-21 01:05:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/310 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:06:04] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 5 ms to minimize.
[2024-05-21 01:06:05] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 9 ms to minimize.
[2024-05-21 01:06:05] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 5 ms to minimize.
[2024-05-21 01:06:05] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 5 ms to minimize.
[2024-05-21 01:06:05] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 5 ms to minimize.
[2024-05-21 01:06:06] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 3 ms to minimize.
[2024-05-21 01:06:06] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 4 ms to minimize.
[2024-05-21 01:06:06] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 4 ms to minimize.
[2024-05-21 01:06:06] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 4 ms to minimize.
[2024-05-21 01:06:06] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 5 ms to minimize.
[2024-05-21 01:06:07] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 4 ms to minimize.
[2024-05-21 01:06:07] [INFO ] Deduced a trap composed of 71 places in 176 ms of which 4 ms to minimize.
[2024-05-21 01:06:07] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 3 ms to minimize.
[2024-05-21 01:06:07] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 4 ms to minimize.
[2024-05-21 01:06:08] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 4 ms to minimize.
[2024-05-21 01:06:08] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 4 ms to minimize.
[2024-05-21 01:06:08] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 2 ms to minimize.
[2024-05-21 01:06:08] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 3 ms to minimize.
[2024-05-21 01:06:08] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 3 ms to minimize.
[2024-05-21 01:06:09] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:06:13] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 4 ms to minimize.
[2024-05-21 01:06:13] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 3 ms to minimize.
[2024-05-21 01:06:13] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-05-21 01:06:13] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 3 ms to minimize.
[2024-05-21 01:06:13] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 3 ms to minimize.
[2024-05-21 01:06:13] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-05-21 01:06:14] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 4 ms to minimize.
[2024-05-21 01:06:14] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 3 ms to minimize.
[2024-05-21 01:06:14] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 4 ms to minimize.
[2024-05-21 01:06:14] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 3 ms to minimize.
[2024-05-21 01:06:14] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 3 ms to minimize.
[2024-05-21 01:06:14] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 3 ms to minimize.
[2024-05-21 01:06:14] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-21 01:06:15] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 3 ms to minimize.
[2024-05-21 01:06:15] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 3 ms to minimize.
[2024-05-21 01:06:15] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 3 ms to minimize.
[2024-05-21 01:06:15] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 3 ms to minimize.
[2024-05-21 01:06:15] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 3 ms to minimize.
[2024-05-21 01:06:15] [INFO ] Deduced a trap composed of 62 places in 132 ms of which 3 ms to minimize.
[2024-05-21 01:06:16] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:06:16] [INFO ] Deduced a trap composed of 55 places in 199 ms of which 4 ms to minimize.
[2024-05-21 01:06:16] [INFO ] Deduced a trap composed of 54 places in 197 ms of which 4 ms to minimize.
[2024-05-21 01:06:17] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 3 ms to minimize.
[2024-05-21 01:06:17] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 4 ms to minimize.
[2024-05-21 01:06:17] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 4 ms to minimize.
[2024-05-21 01:06:17] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 3 ms to minimize.
[2024-05-21 01:06:18] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 4 ms to minimize.
[2024-05-21 01:06:18] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 3 ms to minimize.
[2024-05-21 01:06:18] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 3 ms to minimize.
[2024-05-21 01:06:18] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-21 01:06:18] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-21 01:06:18] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-21 01:06:18] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-21 01:06:19] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
[2024-05-21 01:06:20] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 3 ms to minimize.
[2024-05-21 01:06:20] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 4 ms to minimize.
[2024-05-21 01:06:20] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 4 ms to minimize.
[2024-05-21 01:06:20] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 3 ms to minimize.
[2024-05-21 01:06:20] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 4 ms to minimize.
[2024-05-21 01:06:21] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:06:22] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 3 ms to minimize.
[2024-05-21 01:06:23] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/612 variables, and 90 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/310 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/310 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 62/90 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:06:31] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 01:06:31] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-21 01:06:32] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 4 ms to minimize.
[2024-05-21 01:06:33] [INFO ] Deduced a trap composed of 63 places in 168 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:06:35] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 4 ms to minimize.
[2024-05-21 01:06:35] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-21 01:06:36] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-21 01:06:37] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 4 ms to minimize.
[2024-05-21 01:06:37] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:06:40] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 3 ms to minimize.
[2024-05-21 01:06:41] [INFO ] Deduced a trap composed of 57 places in 180 ms of which 3 ms to minimize.
[2024-05-21 01:06:41] [INFO ] Deduced a trap composed of 62 places in 189 ms of which 4 ms to minimize.
[2024-05-21 01:06:41] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:06:45] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 2 ms to minimize.
[2024-05-21 01:06:45] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 4 ms to minimize.
[2024-05-21 01:06:45] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:06:47] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 3 ms to minimize.
[2024-05-21 01:06:49] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (OVERLAPS) 302/612 variables, 310/418 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/612 variables, 301/719 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-21 01:06:55] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-21 01:06:56] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 01:06:56] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 3 ms to minimize.
[2024-05-21 01:06:57] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 3 ms to minimize.
[2024-05-21 01:06:57] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 4 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 Int declared 612/612 variables, and 724 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 85/85 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 310/338 places, 302/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60711 ms. Remains : 310/338 places, 302/333 transitions.
[2024-05-21 01:06:58] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:06:58] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:06:58] [INFO ] Input system was already deterministic with 302 transitions.
[2024-05-21 01:06:58] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:06:58] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:06:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality5062379960824729776.gal : 2 ms
[2024-05-21 01:06:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality267141572713396218.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/CTLCardinality5062379960824729776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality267141572713396218.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 01:07:28] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:07:28] [INFO ] Applying decomposition
[2024-05-21 01:07:28] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11615314363839770814.txt' '-o' '/tmp/graph11615314363839770814.bin' '-w' '/tmp/graph11615314363839770814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11615314363839770814.bin' '-l' '-1' '-v' '-w' '/tmp/graph11615314363839770814.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:07:28] [INFO ] Decomposing Gal with order
[2024-05-21 01:07:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:07:28] [INFO ] Removed a total of 54 redundant transitions.
[2024-05-21 01:07:28] [INFO ] Flatten gal took : 17 ms
[2024-05-21 01:07:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 01:07:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality6199938276301399841.gal : 4 ms
[2024-05-21 01:07:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality11884033816920124174.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/CTLCardinality6199938276301399841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11884033816920124174.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.60582e+22,2.20504,58732,6943,22,106916,250,615,178069,45,504,0


Converting to forward existential form...Done !
original formula: AX(E(!((EG(AF((i3.u9.p29==0))) * (i2.u13.p38==0))) U AG((((!((i0.i1.u123.p377==0)||(i7.i1.u35.p125==1)))&&(((i8.u114.p354==0)||(i5.u20.p7...311
=> equivalent forward existential formula: [(EY(Init) * !(E(!((EG(!(EG(!((i3.u9.p29==0))))) * (i2.u13.p38==0))) U !(E(TRUE U !((((!((i0.i1.u123.p377==0)||(...376
Reverse transition relation is NOT exact ! Due to transitions t93, t96, t119, t122, t132, t155, t164, t186, t201, t208, t223, t291, t293, t294, t295, i0.i1...800
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
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 333/333 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 315 transition count 310
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 315 transition count 310
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 315 transition count 305
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 59 place count 307 transition count 297
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 305 transition count 295
Applied a total of 71 rules in 24 ms. Remains 305 /338 variables (removed 33) and now considering 295/333 (removed 38) transitions.
// Phase 1: matrix 295 rows 305 cols
[2024-05-21 01:07:58] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 01:07:58] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-21 01:07:58] [INFO ] Invariant cache hit.
[2024-05-21 01:07:59] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-21 01:07:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-21 01:08:05] [INFO ] Deduced a trap composed of 48 places in 242 ms of which 5 ms to minimize.
[2024-05-21 01:08:05] [INFO ] Deduced a trap composed of 17 places in 271 ms of which 5 ms to minimize.
[2024-05-21 01:08:05] [INFO ] Deduced a trap composed of 57 places in 257 ms of which 5 ms to minimize.
[2024-05-21 01:08:05] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 3 ms to minimize.
[2024-05-21 01:08:06] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 5 ms to minimize.
[2024-05-21 01:08:06] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 5 ms to minimize.
[2024-05-21 01:08:06] [INFO ] Deduced a trap composed of 51 places in 231 ms of which 4 ms to minimize.
[2024-05-21 01:08:06] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 4 ms to minimize.
[2024-05-21 01:08:06] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 4 ms to minimize.
[2024-05-21 01:08:07] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 4 ms to minimize.
[2024-05-21 01:08:07] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 4 ms to minimize.
[2024-05-21 01:08:07] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 4 ms to minimize.
[2024-05-21 01:08:07] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 4 ms to minimize.
[2024-05-21 01:08:08] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 5 ms to minimize.
[2024-05-21 01:08:08] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 3 ms to minimize.
[2024-05-21 01:08:08] [INFO ] Deduced a trap composed of 47 places in 236 ms of which 4 ms to minimize.
[2024-05-21 01:08:08] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 6 ms to minimize.
[2024-05-21 01:08:08] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 4 ms to minimize.
[2024-05-21 01:08:09] [INFO ] Deduced a trap composed of 57 places in 220 ms of which 5 ms to minimize.
[2024-05-21 01:08:09] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-21 01:08:12] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 4 ms to minimize.
[2024-05-21 01:08:12] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 2 ms to minimize.
[2024-05-21 01:08:12] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 3 ms to minimize.
[2024-05-21 01:08:12] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
[2024-05-21 01:08:13] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 2 ms to minimize.
[2024-05-21 01:08:13] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-05-21 01:08:13] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 3 ms to minimize.
[2024-05-21 01:08:13] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 3 ms to minimize.
[2024-05-21 01:08:13] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 3 ms to minimize.
[2024-05-21 01:08:14] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-05-21 01:08:14] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 3 ms to minimize.
[2024-05-21 01:08:14] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 3 ms to minimize.
[2024-05-21 01:08:14] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 4 ms to minimize.
[2024-05-21 01:08:14] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
[2024-05-21 01:08:15] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 3 ms to minimize.
[2024-05-21 01:08:15] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-21 01:08:15] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 3 ms to minimize.
[2024-05-21 01:08:15] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 4 ms to minimize.
[2024-05-21 01:08:15] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-05-21 01:08:15] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-21 01:08:16] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 4 ms to minimize.
[2024-05-21 01:08:16] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 3 ms to minimize.
[2024-05-21 01:08:16] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-21 01:08:17] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 3 ms to minimize.
[2024-05-21 01:08:17] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 5 ms to minimize.
[2024-05-21 01:08:17] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 4 ms to minimize.
[2024-05-21 01:08:17] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 3 ms to minimize.
[2024-05-21 01:08:18] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 2 ms to minimize.
[2024-05-21 01:08:18] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 4 ms to minimize.
[2024-05-21 01:08:19] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 3 ms to minimize.
[2024-05-21 01:08:19] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2024-05-21 01:08:20] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 3 ms to minimize.
[2024-05-21 01:08:20] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-21 01:08:20] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-21 01:08:22] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-05-21 01:08:23] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 3 ms to minimize.
[2024-05-21 01:08:23] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 3 ms to minimize.
[2024-05-21 01:08:23] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 4 ms to minimize.
[2024-05-21 01:08:24] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 3 ms to minimize.
[2024-05-21 01:08:24] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 3 ms to minimize.
[2024-05-21 01:08:24] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 3 ms to minimize.
[2024-05-21 01:08:24] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-21 01:08:28] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 4 ms to minimize.
[2024-05-21 01:08:28] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 3 ms to minimize.
[2024-05-21 01:08:29] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/600 variables, and 93 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 65/93 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-21 01:08:33] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-21 01:08:33] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 3 ms to minimize.
[2024-05-21 01:08:33] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
[2024-05-21 01:08:34] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-05-21 01:08:34] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-21 01:08:37] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 4 ms to minimize.
[2024-05-21 01:08:38] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 3 ms to minimize.
[2024-05-21 01:08:38] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-21 01:08:41] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 3 ms to minimize.
[2024-05-21 01:08:43] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-21 01:08:45] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 3 ms to minimize.
[2024-05-21 01:08:45] [INFO ] Deduced a trap composed of 63 places in 146 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (OVERLAPS) 295/600 variables, 305/410 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 294/704 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-21 01:08:54] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 5 ms to minimize.
[2024-05-21 01:08:54] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 4 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 1)
(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 1)
(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 1)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 706 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 79/79 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 305/338 places, 295/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60818 ms. Remains : 305/338 places, 295/333 transitions.
[2024-05-21 01:08:59] [INFO ] Flatten gal took : 12 ms
[2024-05-21 01:08:59] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:08:59] [INFO ] Input system was already deterministic with 295 transitions.
[2024-05-21 01:08:59] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:08:59] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:08:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality3930932730440364200.gal : 3 ms
[2024-05-21 01:08:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality5433907395779420863.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/CTLCardinality3930932730440364200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5433907395779420863.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,5.23986e+22,20.4721,471556,2,134803,5,1.56382e+06,6,0,1517,2.97982e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 01:09:29] [INFO ] Flatten gal took : 7 ms
[2024-05-21 01:09:29] [INFO ] Applying decomposition
[2024-05-21 01:09:29] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6362808654965759065.txt' '-o' '/tmp/graph6362808654965759065.bin' '-w' '/tmp/graph6362808654965759065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6362808654965759065.bin' '-l' '-1' '-v' '-w' '/tmp/graph6362808654965759065.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:09:29] [INFO ] Decomposing Gal with order
[2024-05-21 01:09:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:09:29] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-21 01:09:29] [INFO ] Flatten gal took : 14 ms
[2024-05-21 01:09:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 01:09:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality12486399589219499571.gal : 4 ms
[2024-05-21 01:09:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality12356064808161734231.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/CTLCardinality12486399589219499571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12356064808161734231.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,5.23986e+22,0.340449,12760,2853,20,19306,226,578,19242,35,403,0


Converting to forward existential form...Done !
original formula: EG(((i1.i0.u3.p8==0) * (AF(EX((i16.i0.u83.p279==0))) + ((i0.i1.u64.p233==0)&&(i2.i0.u6.p16==1)))))
=> equivalent forward existential formula: [FwdG(Init,((i1.i0.u3.p8==0) * (!(EG(!(EX((i16.i0.u83.p279==0))))) + ((i0.i1.u64.p233==0)&&(i2.i0.u6.p16==1)))))...165
Reverse transition relation is NOT exact ! Due to transitions t105, t108, t131, t134, t152, t159, t181, t196, t203, t218, t283, t284, t286, t287, t288, i0....769
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 333/333 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 317 transition count 312
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 317 transition count 312
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 47 place count 317 transition count 307
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 310 transition count 300
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 310 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 309 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 309 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 308 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 308 transition count 298
Applied a total of 65 rules in 22 ms. Remains 308 /338 variables (removed 30) and now considering 298/333 (removed 35) transitions.
// Phase 1: matrix 298 rows 308 cols
[2024-05-21 01:09:59] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 01:09:59] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 01:09:59] [INFO ] Invariant cache hit.
[2024-05-21 01:09:59] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2024-05-21 01:09:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:10:06] [INFO ] Deduced a trap composed of 49 places in 257 ms of which 6 ms to minimize.
[2024-05-21 01:10:06] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 3 ms to minimize.
[2024-05-21 01:10:07] [INFO ] Deduced a trap composed of 58 places in 230 ms of which 4 ms to minimize.
[2024-05-21 01:10:07] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 3 ms to minimize.
[2024-05-21 01:10:07] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 4 ms to minimize.
[2024-05-21 01:10:07] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 4 ms to minimize.
[2024-05-21 01:10:07] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 4 ms to minimize.
[2024-05-21 01:10:08] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 4 ms to minimize.
[2024-05-21 01:10:08] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 3 ms to minimize.
[2024-05-21 01:10:08] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 3 ms to minimize.
[2024-05-21 01:10:08] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 5 ms to minimize.
[2024-05-21 01:10:09] [INFO ] Deduced a trap composed of 50 places in 225 ms of which 4 ms to minimize.
[2024-05-21 01:10:09] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 4 ms to minimize.
[2024-05-21 01:10:09] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 4 ms to minimize.
[2024-05-21 01:10:09] [INFO ] Deduced a trap composed of 57 places in 168 ms of which 4 ms to minimize.
[2024-05-21 01:10:09] [INFO ] Deduced a trap composed of 63 places in 166 ms of which 3 ms to minimize.
[2024-05-21 01:10:10] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 4 ms to minimize.
[2024-05-21 01:10:10] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 4 ms to minimize.
[2024-05-21 01:10:10] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 4 ms to minimize.
[2024-05-21 01:10:10] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:10:14] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 4 ms to minimize.
[2024-05-21 01:10:14] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 4 ms to minimize.
[2024-05-21 01:10:14] [INFO ] Deduced a trap composed of 58 places in 243 ms of which 5 ms to minimize.
[2024-05-21 01:10:14] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 7 ms to minimize.
[2024-05-21 01:10:15] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 5 ms to minimize.
[2024-05-21 01:10:15] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 3 ms to minimize.
[2024-05-21 01:10:15] [INFO ] Deduced a trap composed of 59 places in 180 ms of which 4 ms to minimize.
[2024-05-21 01:10:16] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 3 ms to minimize.
[2024-05-21 01:10:16] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 3 ms to minimize.
[2024-05-21 01:10:16] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 3 ms to minimize.
[2024-05-21 01:10:16] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 4 ms to minimize.
[2024-05-21 01:10:16] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 3 ms to minimize.
[2024-05-21 01:10:16] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 3 ms to minimize.
[2024-05-21 01:10:17] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 3 ms to minimize.
[2024-05-21 01:10:17] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 3 ms to minimize.
[2024-05-21 01:10:17] [INFO ] Deduced a trap composed of 54 places in 164 ms of which 3 ms to minimize.
[2024-05-21 01:10:17] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 4 ms to minimize.
[2024-05-21 01:10:17] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 3 ms to minimize.
[2024-05-21 01:10:18] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 3 ms to minimize.
[2024-05-21 01:10:18] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:10:19] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 4 ms to minimize.
[2024-05-21 01:10:19] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 4 ms to minimize.
[2024-05-21 01:10:19] [INFO ] Deduced a trap composed of 63 places in 186 ms of which 4 ms to minimize.
[2024-05-21 01:10:19] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 4 ms to minimize.
[2024-05-21 01:10:19] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 3 ms to minimize.
[2024-05-21 01:10:20] [INFO ] Deduced a trap composed of 56 places in 177 ms of which 3 ms to minimize.
[2024-05-21 01:10:20] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 4 ms to minimize.
[2024-05-21 01:10:20] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 3 ms to minimize.
[2024-05-21 01:10:21] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 3 ms to minimize.
[2024-05-21 01:10:21] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 3 ms to minimize.
[2024-05-21 01:10:21] [INFO ] Deduced a trap composed of 63 places in 182 ms of which 3 ms to minimize.
[2024-05-21 01:10:21] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 4 ms to minimize.
[2024-05-21 01:10:21] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 4 ms to minimize.
[2024-05-21 01:10:22] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 3 ms to minimize.
[2024-05-21 01:10:22] [INFO ] Deduced a trap composed of 63 places in 170 ms of which 4 ms to minimize.
[2024-05-21 01:10:22] [INFO ] Deduced a trap composed of 70 places in 175 ms of which 4 ms to minimize.
[2024-05-21 01:10:22] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 4 ms to minimize.
[2024-05-21 01:10:23] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 3 ms to minimize.
[2024-05-21 01:10:23] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 19/87 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:10:25] [INFO ] Deduced a trap composed of 59 places in 180 ms of which 4 ms to minimize.
[2024-05-21 01:10:26] [INFO ] Deduced a trap composed of 57 places in 177 ms of which 4 ms to minimize.
[2024-05-21 01:10:26] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 4 ms to minimize.
[2024-05-21 01:10:26] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 4 ms to minimize.
[2024-05-21 01:10:26] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 4 ms to minimize.
[2024-05-21 01:10:26] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 4 ms to minimize.
[2024-05-21 01:10:26] [INFO ] Deduced a trap composed of 55 places in 152 ms of which 4 ms to minimize.
[2024-05-21 01:10:27] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 4 ms to minimize.
[2024-05-21 01:10:27] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 3 ms to minimize.
[2024-05-21 01:10:27] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 5 ms to minimize.
[2024-05-21 01:10:27] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 4 ms to minimize.
[2024-05-21 01:10:29] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 3 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 308/606 variables, and 99 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/308 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 71/99 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:10:34] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 3 ms to minimize.
[2024-05-21 01:10:34] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 3 ms to minimize.
[2024-05-21 01:10:34] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 3 ms to minimize.
[2024-05-21 01:10:35] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 3 ms to minimize.
[2024-05-21 01:10:36] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 3 ms to minimize.
[2024-05-21 01:10:36] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 3 ms to minimize.
[2024-05-21 01:10:36] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 2 ms to minimize.
[2024-05-21 01:10:37] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 01:10:37] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 3 ms to minimize.
[2024-05-21 01:10:37] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:10:39] [INFO ] Deduced a trap composed of 73 places in 171 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:10:42] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2024-05-21 01:10:42] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-21 01:10:43] [INFO ] Deduced a trap composed of 61 places in 177 ms of which 3 ms to minimize.
[2024-05-21 01:10:43] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:10:46] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 3 ms to minimize.
[2024-05-21 01:10:48] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-21 01:10:48] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 4 ms to minimize.
[2024-05-21 01:10:49] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:10:50] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 4 ms to minimize.
[2024-05-21 01:10:50] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 4 ms to minimize.
[2024-05-21 01:10:50] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 3 ms to minimize.
[2024-05-21 01:10:51] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 3 ms to minimize.
[2024-05-21 01:10:51] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 3 ms to minimize.
[2024-05-21 01:10:52] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (OVERLAPS) 298/606 variables, 308/432 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/606 variables, 297/729 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-21 01:10:59] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-21 01:10:59] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 01:10:59] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 4 ms to minimize.
[2024-05-21 01:11:00] [INFO ] Deduced a trap composed of 64 places in 173 ms of which 3 ms to minimize.
SMT process timed out in 60196ms, After SMT, problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LTL mode, iteration 1 : 308/338 places, 298/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60653 ms. Remains : 308/338 places, 298/333 transitions.
[2024-05-21 01:11:00] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:11:00] [INFO ] Flatten gal took : 12 ms
[2024-05-21 01:11:00] [INFO ] Input system was already deterministic with 298 transitions.
[2024-05-21 01:11:00] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:11:00] [INFO ] Flatten gal took : 10 ms
[2024-05-21 01:11:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality1916760911753260600.gal : 3 ms
[2024-05-21 01:11:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality12716390977205437290.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/CTLCardinality1916760911753260600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12716390977205437290.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 01:11:30] [INFO ] Flatten gal took : 7 ms
[2024-05-21 01:11:30] [INFO ] Applying decomposition
[2024-05-21 01:11:30] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7708900305192228112.txt' '-o' '/tmp/graph7708900305192228112.bin' '-w' '/tmp/graph7708900305192228112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7708900305192228112.bin' '-l' '-1' '-v' '-w' '/tmp/graph7708900305192228112.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:11:30] [INFO ] Decomposing Gal with order
[2024-05-21 01:11:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:11:30] [INFO ] Removed a total of 55 redundant transitions.
[2024-05-21 01:11:30] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:11:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 01:11:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality12262392945922910558.gal : 4 ms
[2024-05-21 01:11:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality2528076998733454038.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/CTLCardinality12262392945922910558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2528076998733454038.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,6.04808e+22,0.702391,21588,4063,20,36870,239,550,51491,35,433,0


Converting to forward existential form...Done !
original formula: EX(((AX(FALSE) + AG(EX(((i21.u114.p353==0)||(i16.u72.p252==1))))) * ((EG(AF((i2.u11.p32!=0))) + AG((i8.u25.p86==1))) + AG((i14.u59.p216==...161
=> equivalent forward existential formula: (([FwdG((EY(Init) * (!(EX(!(FALSE))) + !(E(TRUE U !(EX(((i21.u114.p353==0)||(i16.u72.p252==1)))))))),!(EG(!((i2....468
Reverse transition relation is NOT exact ! Due to transitions t107, t120, t123, t154, t161, t176, t183, t205, t220, t287, t289, t290, i0.t97, i0.t96, i0.t9...760
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 333/333 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 316 transition count 311
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 316 transition count 311
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 316 transition count 307
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 56 place count 308 transition count 299
Iterating global reduction 1 with 8 rules applied. Total rules applied 64 place count 308 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 307 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 307 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 306 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 306 transition count 297
Applied a total of 68 rules in 19 ms. Remains 306 /338 variables (removed 32) and now considering 297/333 (removed 36) transitions.
// Phase 1: matrix 297 rows 306 cols
[2024-05-21 01:12:00] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 01:12:00] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 01:12:00] [INFO ] Invariant cache hit.
[2024-05-21 01:12:00] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-05-21 01:12:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:12:07] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 6 ms to minimize.
[2024-05-21 01:12:07] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 5 ms to minimize.
[2024-05-21 01:12:07] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 5 ms to minimize.
[2024-05-21 01:12:08] [INFO ] Deduced a trap composed of 54 places in 224 ms of which 5 ms to minimize.
[2024-05-21 01:12:08] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 5 ms to minimize.
[2024-05-21 01:12:08] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 4 ms to minimize.
[2024-05-21 01:12:08] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 4 ms to minimize.
[2024-05-21 01:12:09] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 4 ms to minimize.
[2024-05-21 01:12:09] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 4 ms to minimize.
[2024-05-21 01:12:09] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-05-21 01:12:09] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 4 ms to minimize.
[2024-05-21 01:12:09] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 3 ms to minimize.
[2024-05-21 01:12:10] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 4 ms to minimize.
[2024-05-21 01:12:10] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 4 ms to minimize.
[2024-05-21 01:12:10] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 3 ms to minimize.
[2024-05-21 01:12:10] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 3 ms to minimize.
[2024-05-21 01:12:10] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 4 ms to minimize.
[2024-05-21 01:12:11] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 4 ms to minimize.
[2024-05-21 01:12:11] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 4 ms to minimize.
[2024-05-21 01:12:11] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:12:15] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 5 ms to minimize.
[2024-05-21 01:12:15] [INFO ] Deduced a trap composed of 62 places in 215 ms of which 4 ms to minimize.
[2024-05-21 01:12:15] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 4 ms to minimize.
[2024-05-21 01:12:15] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2024-05-21 01:12:15] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 3 ms to minimize.
[2024-05-21 01:12:16] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 4 ms to minimize.
[2024-05-21 01:12:16] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 4 ms to minimize.
[2024-05-21 01:12:17] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 4 ms to minimize.
[2024-05-21 01:12:17] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 4 ms to minimize.
[2024-05-21 01:12:18] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 3 ms to minimize.
[2024-05-21 01:12:18] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:12:20] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 3 ms to minimize.
[2024-05-21 01:12:21] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 4 ms to minimize.
[2024-05-21 01:12:21] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
[2024-05-21 01:12:21] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 3 ms to minimize.
[2024-05-21 01:12:21] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 3 ms to minimize.
[2024-05-21 01:12:22] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-21 01:12:23] [INFO ] Deduced a trap composed of 63 places in 159 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:12:24] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 4 ms to minimize.
[2024-05-21 01:12:25] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 4 ms to minimize.
[2024-05-21 01:12:25] [INFO ] Deduced a trap composed of 52 places in 214 ms of which 5 ms to minimize.
[2024-05-21 01:12:26] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 3 ms to minimize.
[2024-05-21 01:12:26] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 3 ms to minimize.
[2024-05-21 01:12:26] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/603 variables, and 72 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 44/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:12:35] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 4 ms to minimize.
[2024-05-21 01:12:35] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 3 ms to minimize.
[2024-05-21 01:12:35] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 3 ms to minimize.
[2024-05-21 01:12:35] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:12:38] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 4 ms to minimize.
[2024-05-21 01:12:38] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 4 ms to minimize.
[2024-05-21 01:12:39] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 3 ms to minimize.
[2024-05-21 01:12:39] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:12:43] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:12:46] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 4 ms to minimize.
[2024-05-21 01:12:46] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 3 ms to minimize.
[2024-05-21 01:12:47] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 3 ms to minimize.
[2024-05-21 01:12:47] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 3 ms to minimize.
[2024-05-21 01:12:47] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 3 ms to minimize.
[2024-05-21 01:12:47] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 3 ms to minimize.
[2024-05-21 01:12:48] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 3 ms to minimize.
[2024-05-21 01:12:48] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 297/603 variables, 306/395 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/603 variables, 296/691 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 01:12:56] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 2 ms to minimize.
[2024-05-21 01:12:56] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 4 ms to minimize.
[2024-05-21 01:12:56] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 3 ms to minimize.
[2024-05-21 01:12:57] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 3 ms to minimize.
[2024-05-21 01:12:57] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 3 ms to minimize.
[2024-05-21 01:12:57] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 4 ms to minimize.
[2024-05-21 01:12:58] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
[2024-05-21 01:13:00] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/603 variables, and 699 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 69/69 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 306/338 places, 297/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60508 ms. Remains : 306/338 places, 297/333 transitions.
[2024-05-21 01:13:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 01:13:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 01:13:00] [INFO ] Input system was already deterministic with 297 transitions.
[2024-05-21 01:13:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 01:13:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 01:13:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality10161504618711768099.gal : 3 ms
[2024-05-21 01:13:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality6244003630623726610.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/CTLCardinality10161504618711768099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6244003630623726610.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,6.05115e+22,20.7153,469896,2,133199,5,1.56297e+06,6,0,1523,2.96634e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 01:13:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:13:31] [INFO ] Applying decomposition
[2024-05-21 01:13:31] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4408362662445659252.txt' '-o' '/tmp/graph4408362662445659252.bin' '-w' '/tmp/graph4408362662445659252.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4408362662445659252.bin' '-l' '-1' '-v' '-w' '/tmp/graph4408362662445659252.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:13:31] [INFO ] Decomposing Gal with order
[2024-05-21 01:13:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:13:31] [INFO ] Removed a total of 58 redundant transitions.
[2024-05-21 01:13:31] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:13:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 01:13:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality8705640796594384885.gal : 4 ms
[2024-05-21 01:13:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality14041915567598073023.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/CTLCardinality8705640796594384885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14041915567598073023.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,6.05115e+22,0.374219,14084,2506,22,21874,260,618,23290,45,553,0


Converting to forward existential form...Done !
original formula: EX(E((AX((AF((i6.u20.p63==1)) + (i3.i0.u8.p19!=1))) * !(AF(((i17.u92.p301==0)||(i18.i0.u104.p329==1))))) U E((i12.i1.u56.p208==1) U (EF((...247
=> equivalent forward existential formula: [FwdG((FwdU(FwdU(EY(Init),(!(EX(!((!(EG(!((i6.u20.p63==1)))) + (i3.i0.u8.p19!=1))))) * !(!(EG(!(((i17.u92.p301==...316
Reverse transition relation is NOT exact ! Due to transitions t95, t118, t152, t159, t181, t203, t220, t286, t288, t289, t290, i0.t287, i0.i1.t71, i0.i2.t2...778
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 333/333 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 337 transition count 220
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 128 rules applied. Total rules applied 240 place count 225 transition count 204
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 246 place count 219 transition count 204
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 246 place count 219 transition count 159
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 336 place count 174 transition count 159
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 349 place count 161 transition count 146
Iterating global reduction 3 with 13 rules applied. Total rules applied 362 place count 161 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 362 place count 161 transition count 138
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 378 place count 153 transition count 138
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 472 place count 106 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 478 place count 106 transition count 85
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 4 with 12 rules applied. Total rules applied 490 place count 100 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 491 place count 99 transition count 78
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 494 place count 96 transition count 78
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 494 place count 96 transition count 75
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 500 place count 93 transition count 75
Applied a total of 500 rules in 27 ms. Remains 93 /338 variables (removed 245) and now considering 75/333 (removed 258) transitions.
// Phase 1: matrix 75 rows 93 cols
[2024-05-21 01:14:01] [INFO ] Computed 25 invariants in 0 ms
[2024-05-21 01:14:01] [INFO ] Implicit Places using invariants in 89 ms returned [41, 55, 70, 76, 81, 86, 92]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 105 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 86/338 places, 75/333 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 81 transition count 70
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 81 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 80 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 80 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 79 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 79 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 78 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 78 transition count 67
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 0 with 2 rules applied. Total rules applied 18 place count 77 transition count 66
Applied a total of 18 rules in 11 ms. Remains 77 /86 variables (removed 9) and now considering 66/75 (removed 9) transitions.
// Phase 1: matrix 66 rows 77 cols
[2024-05-21 01:14:01] [INFO ] Computed 18 invariants in 0 ms
[2024-05-21 01:14:01] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 01:14:01] [INFO ] Invariant cache hit.
[2024-05-21 01:14:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 01:14:01] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 77/338 places, 66/333 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 317 ms. Remains : 77/338 places, 66/333 transitions.
[2024-05-21 01:14:01] [INFO ] Flatten gal took : 2 ms
[2024-05-21 01:14:01] [INFO ] Flatten gal took : 2 ms
[2024-05-21 01:14:01] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-21 01:14:01] [INFO ] Flatten gal took : 3 ms
[2024-05-21 01:14:01] [INFO ] Flatten gal took : 3 ms
[2024-05-21 01:14:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality1430840078732982021.gal : 1 ms
[2024-05-21 01:14:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality6160878604359490768.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/CTLCardinality1430840078732982021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6160878604359490768.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,4.51215e+07,0.024792,4176,2,358,5,2646,6,0,368,3135,0


Converting to forward existential form...Done !
original formula: A(AG(((p299==0)||(p220==1))) U (p192==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p192==1))))) * !(E(!((p192==1)) U (!(!(E(TRUE U !(((p299==0)||(p220==1)))))) * !((p192==1)))))...166
Reverse transition relation is NOT exact ! Due to transitions t3, t62, t63, t65, Intersection with reachable at each step enabled. (destroyed/reverse/inte...178
(forward)formula 0,0,1.44025,52408,1,0,456,292833,162,227,2180,330840,541
FORMULA AutoFlight-PT-04b-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 333/333 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 314 transition count 309
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 314 transition count 309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 314 transition count 304
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 61 place count 306 transition count 296
Iterating global reduction 1 with 8 rules applied. Total rules applied 69 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 304 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 304 transition count 294
Applied a total of 73 rules in 36 ms. Remains 304 /338 variables (removed 34) and now considering 294/333 (removed 39) transitions.
// Phase 1: matrix 294 rows 304 cols
[2024-05-21 01:14:02] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 01:14:03] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-21 01:14:03] [INFO ] Invariant cache hit.
[2024-05-21 01:14:03] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-21 01:14:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:14:09] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 5 ms to minimize.
[2024-05-21 01:14:09] [INFO ] Deduced a trap composed of 57 places in 268 ms of which 5 ms to minimize.
[2024-05-21 01:14:09] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 5 ms to minimize.
[2024-05-21 01:14:09] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 5 ms to minimize.
[2024-05-21 01:14:10] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 4 ms to minimize.
[2024-05-21 01:14:10] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 3 ms to minimize.
[2024-05-21 01:14:10] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 5 ms to minimize.
[2024-05-21 01:14:10] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 4 ms to minimize.
[2024-05-21 01:14:10] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 3 ms to minimize.
[2024-05-21 01:14:11] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 2 ms to minimize.
[2024-05-21 01:14:11] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 4 ms to minimize.
[2024-05-21 01:14:11] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 3 ms to minimize.
[2024-05-21 01:14:11] [INFO ] Deduced a trap composed of 54 places in 164 ms of which 3 ms to minimize.
[2024-05-21 01:14:11] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 3 ms to minimize.
[2024-05-21 01:14:12] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 4 ms to minimize.
[2024-05-21 01:14:12] [INFO ] Deduced a trap composed of 53 places in 256 ms of which 5 ms to minimize.
[2024-05-21 01:14:12] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 4 ms to minimize.
[2024-05-21 01:14:12] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 4 ms to minimize.
[2024-05-21 01:14:12] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-21 01:14:13] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:14:16] [INFO ] Deduced a trap composed of 58 places in 185 ms of which 3 ms to minimize.
[2024-05-21 01:14:16] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 4 ms to minimize.
[2024-05-21 01:14:16] [INFO ] Deduced a trap composed of 53 places in 203 ms of which 4 ms to minimize.
[2024-05-21 01:14:16] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 4 ms to minimize.
[2024-05-21 01:14:17] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 3 ms to minimize.
[2024-05-21 01:14:17] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 5 ms to minimize.
[2024-05-21 01:14:17] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 4 ms to minimize.
[2024-05-21 01:14:18] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 5 ms to minimize.
[2024-05-21 01:14:18] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 4 ms to minimize.
[2024-05-21 01:14:18] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 3 ms to minimize.
[2024-05-21 01:14:18] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 3 ms to minimize.
[2024-05-21 01:14:18] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 3 ms to minimize.
[2024-05-21 01:14:18] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 3 ms to minimize.
[2024-05-21 01:14:19] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 3 ms to minimize.
[2024-05-21 01:14:19] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-21 01:14:19] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 2 ms to minimize.
[2024-05-21 01:14:19] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 4 ms to minimize.
[2024-05-21 01:14:19] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 3 ms to minimize.
[2024-05-21 01:14:19] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 3 ms to minimize.
[2024-05-21 01:14:19] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:14:20] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 4 ms to minimize.
[2024-05-21 01:14:20] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
[2024-05-21 01:14:21] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-21 01:14:21] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 4 ms to minimize.
[2024-05-21 01:14:21] [INFO ] Deduced a trap composed of 70 places in 159 ms of which 4 ms to minimize.
[2024-05-21 01:14:21] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 3 ms to minimize.
[2024-05-21 01:14:21] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 3 ms to minimize.
[2024-05-21 01:14:21] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 3 ms to minimize.
[2024-05-21 01:14:22] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-21 01:14:22] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 3 ms to minimize.
[2024-05-21 01:14:23] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 3 ms to minimize.
[2024-05-21 01:14:23] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 3 ms to minimize.
[2024-05-21 01:14:24] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 3 ms to minimize.
[2024-05-21 01:14:24] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 01:14:24] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-05-21 01:14:24] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 4 ms to minimize.
[2024-05-21 01:14:24] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 3 ms to minimize.
[2024-05-21 01:14:25] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 4 ms to minimize.
[2024-05-21 01:14:25] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
[2024-05-21 01:14:25] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:14:26] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 3 ms to minimize.
[2024-05-21 01:14:26] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 3 ms to minimize.
[2024-05-21 01:14:26] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 4 ms to minimize.
[2024-05-21 01:14:26] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 3 ms to minimize.
[2024-05-21 01:14:27] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-05-21 01:14:28] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:14:33] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 3 ms to minimize.
[2024-05-21 01:14:33] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/598 variables, and 96 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 68/96 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:14:36] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 2 ms to minimize.
[2024-05-21 01:14:37] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 3 ms to minimize.
[2024-05-21 01:14:37] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (OVERLAPS) 294/598 variables, 304/403 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 293/696 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:14:42] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 3 ms to minimize.
[2024-05-21 01:14:43] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-21 01:14:43] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-21 01:14:43] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 3 ms to minimize.
[2024-05-21 01:14:44] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 5/701 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-21 01:14:55] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 3 ms to minimize.
[2024-05-21 01:14:56] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 3 ms to minimize.
[2024-05-21 01:14:57] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 3 ms to minimize.
[2024-05-21 01:14:57] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 2 ms to minimize.
[2024-05-21 01:14:57] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
[2024-05-21 01:14:57] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 3 ms to minimize.
[2024-05-21 01:14:57] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 3 ms to minimize.
[2024-05-21 01:14:58] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 3 ms to minimize.
[2024-05-21 01:14:58] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 710 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 85/85 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 304/338 places, 294/333 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60822 ms. Remains : 304/338 places, 294/333 transitions.
[2024-05-21 01:15:03] [INFO ] Flatten gal took : 5 ms
[2024-05-21 01:15:03] [INFO ] Flatten gal took : 8 ms
[2024-05-21 01:15:03] [INFO ] Input system was already deterministic with 294 transitions.
[2024-05-21 01:15:03] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:15:03] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:15:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality4268839073383027527.gal : 1 ms
[2024-05-21 01:15:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality5924551842637757804.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/CTLCardinality4268839073383027527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5924551842637757804.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,5.14719e+22,19.6935,463888,2,129777,5,1.54453e+06,6,0,1512,2.92427e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 01:15:33] [INFO ] Flatten gal took : 6 ms
[2024-05-21 01:15:33] [INFO ] Applying decomposition
[2024-05-21 01:15:33] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6011918409902939468.txt' '-o' '/tmp/graph6011918409902939468.bin' '-w' '/tmp/graph6011918409902939468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6011918409902939468.bin' '-l' '-1' '-v' '-w' '/tmp/graph6011918409902939468.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:15:33] [INFO ] Decomposing Gal with order
[2024-05-21 01:15:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:15:33] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-21 01:15:33] [INFO ] Flatten gal took : 15 ms
[2024-05-21 01:15:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 01:15:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality12076880616651476554.gal : 3 ms
[2024-05-21 01:15:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality13903187001524170833.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/CTLCardinality12076880616651476554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13903187001524170833.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,5.14719e+22,0.533896,14408,2630,14,23402,210,533,25709,28,414,0


Converting to forward existential form...Done !
original formula: EX(AX(EX(E(EF((i13.u66.p234==1)) U !(((i7.u33.p120==0)||(i14.u79.p268==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EX(E(E(TRUE U (i13.u66.p234==1)) U !(((i7.u33.p120==0)||(i14.u79.p268==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t104, t107, t130, t133, t151, t158, t180, t202, t217, t283, t285, t286, t287, i0.t120, i0.t11...699
(forward)formula 0,1,6.41378,229568,1,0,563553,210,3556,767534,124,414,1170572
FORMULA AutoFlight-PT-04b-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-05-21 01:15:40] [INFO ] Flatten gal took : 7 ms
[2024-05-21 01:15:40] [INFO ] Flatten gal took : 7 ms
[2024-05-21 01:15:40] [INFO ] Applying decomposition
[2024-05-21 01:15:40] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2998825132137180515.txt' '-o' '/tmp/graph2998825132137180515.bin' '-w' '/tmp/graph2998825132137180515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2998825132137180515.bin' '-l' '-1' '-v' '-w' '/tmp/graph2998825132137180515.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:15:40] [INFO ] Decomposing Gal with order
[2024-05-21 01:15:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:15:40] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-21 01:15:40] [INFO ] Flatten gal took : 32 ms
[2024-05-21 01:15:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 01:15:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality11973413786159991927.gal : 6 ms
[2024-05-21 01:15:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality9499951559197632374.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/CTLCardinality11973413786159991927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9499951559197632374.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 9 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,2.83019e+23,2.99255,74612,11680,25,129933,327,691,248279,48,796,0


Converting to forward existential form...Done !
original formula: AG(EF((EF(((i9.u46.p144==0)&&(i9.u91.p276==1))) + (AX(AF((i18.i1.u115.p330==0))) * ((A((i15.i0.u84.p260==1) U (i16.i1.u96.p285==0)) + (i6...198
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (E(TRUE U ((i9.u46.p144==0)&&(i9.u91.p276==1))) + (!(EX(!(!(EG(!((i18.i1.u115.p33...345
Reverse transition relation is NOT exact ! Due to transitions t132, t181, t198, t231, t321, t322, t324, t325, i0.i0.u62.t22, i0.i0.u62.t136, i0.i1.t134, i1...1087
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
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-21 01:17:31] [INFO ] Applying decomposition
[2024-05-21 01:17:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 01:17:31] [INFO ] Decomposing Gal with order
[2024-05-21 01:17:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:17:31] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-21 01:17:31] [INFO ] Flatten gal took : 11 ms
[2024-05-21 01:17:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 10 ms.
[2024-05-21 01:17:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality16339837893437141695.gal : 7 ms
[2024-05-21 01:17:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality18371523219203673321.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/CTLCardinality16339837893437141695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18371523219203673321.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 9 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,2.83019e+23,870.604,14550072,136035,958,1.83524e+07,2060,831,1.48235e+08,308,12835,0


Converting to forward existential form...Done !
ITS-tools command line returned an error code 137
[2024-05-21 01:37:25] [INFO ] Flatten gal took : 26 ms
[2024-05-21 01:37:25] [INFO ] Input system was already deterministic with 333 transitions.
[2024-05-21 01:37:25] [INFO ] Transformed 338 places.
[2024-05-21 01:37:25] [INFO ] Transformed 333 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-21 01:37:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality10349656652730158890.gal : 3 ms
[2024-05-21 01:37:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality8019302486456867921.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/CTLCardinality10349656652730158890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8019302486456867921.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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 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,2.83019e+23,114.206,1704588,2,561262,5,5.94763e+06,6,0,1687,9.97868e+06,0


Converting to forward existential form...Done !
ITS-tools command line returned an error code 137
Total runtime 3562308 ms.

BK_STOP 1716256438014

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-04b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-smll-171620167000113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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