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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 159K 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 AutonomousCar-PT-05b-CTLCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2023-12
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2023-13
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2023-14
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716324785616

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 20:53:08] [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 20:53:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:53:08] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2024-05-21 20:53:08] [INFO ] Transformed 255 places.
[2024-05-21 20:53:08] [INFO ] Transformed 490 transitions.
[2024-05-21 20:53:08] [INFO ] Found NUPN structural information;
[2024-05-21 20:53:08] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 404 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 145 ms.
Support contains 109 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 490/490 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 241 transition count 476
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 241 transition count 476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 240 transition count 475
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 240 transition count 475
Applied a total of 30 rules in 116 ms. Remains 240 /255 variables (removed 15) and now considering 475/490 (removed 15) transitions.
// Phase 1: matrix 475 rows 240 cols
[2024-05-21 20:53:09] [INFO ] Computed 10 invariants in 29 ms
[2024-05-21 20:53:09] [INFO ] Implicit Places using invariants in 558 ms returned []
[2024-05-21 20:53:09] [INFO ] Invariant cache hit.
[2024-05-21 20:53:10] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
Running 474 sub problems to find dead transitions.
[2024-05-21 20:53:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-21 20:53:20] [INFO ] Deduced a trap composed of 19 places in 423 ms of which 59 ms to minimize.
[2024-05-21 20:53:20] [INFO ] Deduced a trap composed of 29 places in 333 ms of which 6 ms to minimize.
[2024-05-21 20:53:21] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 4 ms to minimize.
[2024-05-21 20:53:21] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 2 ms to minimize.
[2024-05-21 20:53:21] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 5 ms to minimize.
[2024-05-21 20:53:22] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 4 ms to minimize.
[2024-05-21 20:53:22] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 3 ms to minimize.
[2024-05-21 20:53:22] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:53:22] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2024-05-21 20:53:22] [INFO ] Deduced a trap composed of 37 places in 272 ms of which 4 ms to minimize.
[2024-05-21 20:53:23] [INFO ] Deduced a trap composed of 41 places in 322 ms of which 4 ms to minimize.
[2024-05-21 20:53:23] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 4 ms to minimize.
[2024-05-21 20:53:23] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 3 ms to minimize.
[2024-05-21 20:53:24] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 3 ms to minimize.
[2024-05-21 20:53:24] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 2 ms to minimize.
[2024-05-21 20:53:24] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 3 ms to minimize.
[2024-05-21 20:53:25] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 3 ms to minimize.
[2024-05-21 20:53:25] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 2 ms to minimize.
[2024-05-21 20:53:25] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 2 ms to minimize.
[2024-05-21 20:53:25] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-21 20:53:26] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 3 ms to minimize.
[2024-05-21 20:53:26] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 4 ms to minimize.
[2024-05-21 20:53:26] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 4 ms to minimize.
[2024-05-21 20:53:27] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 3 ms to minimize.
[2024-05-21 20:53:27] [INFO ] Deduced a trap composed of 44 places in 258 ms of which 4 ms to minimize.
[2024-05-21 20:53:27] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 4 ms to minimize.
[2024-05-21 20:53:28] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 3 ms to minimize.
[2024-05-21 20:53:28] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 3 ms to minimize.
[2024-05-21 20:53:28] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 3 ms to minimize.
[2024-05-21 20:53:29] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 3 ms to minimize.
[2024-05-21 20:53:29] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 2 ms to minimize.
[2024-05-21 20:53:29] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 3 ms to minimize.
[2024-05-21 20:53:29] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-05-21 20:53:29] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 3 ms to minimize.
[2024-05-21 20:53:30] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 4 ms to minimize.
[2024-05-21 20:53:30] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 2 ms to minimize.
[2024-05-21 20:53:30] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 2 ms to minimize.
[2024-05-21 20:53:31] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 3 ms to minimize.
[2024-05-21 20:53:31] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-05-21 20:53:31] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-21 20:53:37] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 4 ms to minimize.
[2024-05-21 20:53:37] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 4 ms to minimize.
[2024-05-21 20:53:37] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 4 ms to minimize.
[2024-05-21 20:53:37] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 4 ms to minimize.
[2024-05-21 20:53:38] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 4 ms to minimize.
[2024-05-21 20:53:38] [INFO ] Deduced a trap composed of 22 places in 246 ms of which 3 ms to minimize.
[2024-05-21 20:53:38] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 3 ms to minimize.
[2024-05-21 20:53:38] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/715 variables, and 58 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/240 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-21 20:53:47] [INFO ] Deduced a trap composed of 61 places in 211 ms of which 3 ms to minimize.
[2024-05-21 20:53:48] [INFO ] Deduced a trap composed of 36 places in 306 ms of which 4 ms to minimize.
[2024-05-21 20:53:48] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 5 ms to minimize.
[2024-05-21 20:53:49] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-05-21 20:53:49] [INFO ] Deduced a trap composed of 34 places in 256 ms of which 3 ms to minimize.
[2024-05-21 20:53:49] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 3 ms to minimize.
[2024-05-21 20:53:50] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 4 ms to minimize.
[2024-05-21 20:53:50] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 3 ms to minimize.
[2024-05-21 20:53:51] [INFO ] Deduced a trap composed of 52 places in 228 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-21 20:53:55] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 4 ms to minimize.
[2024-05-21 20:53:56] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-05-21 20:53:56] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 3 ms to minimize.
[2024-05-21 20:53:56] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-21 20:54:03] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/715 variables, and 72 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/240 constraints, PredecessorRefiner: 0/474 constraints, Known Traps: 62/62 constraints]
After SMT, in 61860ms problems are : Problem set: 0 solved, 474 unsolved
Search for dead transitions found 0 dead transitions in 61909ms
Starting structural reductions in LTL mode, iteration 1 : 240/255 places, 475/490 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63273 ms. Remains : 240/255 places, 475/490 transitions.
Support contains 109 out of 240 places after structural reductions.
[2024-05-21 20:54:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 20:54:12] [INFO ] Flatten gal took : 159 ms
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 20:54:12] [INFO ] Flatten gal took : 82 ms
[2024-05-21 20:54:12] [INFO ] Input system was already deterministic with 475 transitions.
Support contains 101 out of 240 places (down from 109) after GAL structural reductions.
RANDOM walk for 40000 steps (144 resets) in 2591 ms. (15 steps per ms) remains 9/71 properties
BEST_FIRST walk for 40000 steps (24 resets) in 321 ms. (124 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40002 steps (75 resets) in 105 ms. (377 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (67 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (64 resets) in 69 ms. (571 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40001 steps (42 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (60 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (84 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
[2024-05-21 20:54:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 197/213 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/240 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 475/715 variables, 240/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/715 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 715/715 variables, and 250 constraints, problems are : Problem set: 0 solved, 4 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 197/213 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/240 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 475/715 variables, 240/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 4/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 20:54:15] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 2 ms to minimize.
[2024-05-21 20:54:15] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 2 ms to minimize.
[2024-05-21 20:54:15] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 3 ms to minimize.
[2024-05-21 20:54:15] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 2 ms to minimize.
[2024-05-21 20:54:16] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 3 ms to minimize.
[2024-05-21 20:54:16] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 3 ms to minimize.
[2024-05-21 20:54:16] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 2 ms to minimize.
[2024-05-21 20:54:16] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-05-21 20:54:16] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 2 ms to minimize.
[2024-05-21 20:54:16] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/715 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 20:54:17] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/715 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 20:54:17] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 2 ms to minimize.
[2024-05-21 20:54:17] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/715 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/715 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/715 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 715/715 variables, and 267 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3180 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 13/13 constraints]
After SMT, in 3690ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2681 ms.
Support contains 16 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 475/475 transitions.
Graph (trivial) has 197 edges and 240 vertex of which 2 / 240 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 746 edges and 239 vertex of which 236 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 236 transition count 391
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 103 rules applied. Total rules applied 185 place count 156 transition count 368
Reduce places removed 11 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 18 rules applied. Total rules applied 203 place count 145 transition count 361
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 210 place count 138 transition count 361
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 210 place count 138 transition count 356
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 220 place count 133 transition count 356
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 238 place count 115 transition count 338
Iterating global reduction 4 with 18 rules applied. Total rules applied 256 place count 115 transition count 338
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 102 rules applied. Total rules applied 358 place count 115 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 359 place count 114 transition count 236
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 359 place count 114 transition count 234
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 363 place count 112 transition count 234
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 367 place count 108 transition count 218
Iterating global reduction 6 with 4 rules applied. Total rules applied 371 place count 108 transition count 218
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 439 place count 74 transition count 184
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 446 place count 67 transition count 144
Iterating global reduction 6 with 7 rules applied. Total rules applied 453 place count 67 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 454 place count 67 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 455 place count 67 transition count 142
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 461 place count 67 transition count 136
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 467 place count 61 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 469 place count 61 transition count 134
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 471 place count 61 transition count 134
Applied a total of 471 rules in 240 ms. Remains 61 /240 variables (removed 179) and now considering 134/475 (removed 341) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 61/240 places, 134/475 transitions.
RANDOM walk for 40000 steps (202 resets) in 349 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (408 resets) in 252 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (362 resets) in 319 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (426 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (285 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1201380 steps, run timeout after 3001 ms. (steps per millisecond=400 ) properties seen :2 out of 4
Probabilistic random walk after 1201380 steps, saw 187060 distinct states, run finished after 3006 ms. (steps per millisecond=399 ) properties seen :2
// Phase 1: matrix 134 rows 61 cols
[2024-05-21 20:54:24] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 20:54:24] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/58 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/192 variables, 58/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 53/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/195 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/58 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/192 variables, 58/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 53/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/195 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 278ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 300 ms.
Support contains 9 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 134/134 transitions.
Graph (trivial) has 28 edges and 61 vertex of which 2 / 61 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 346 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 59 transition count 127
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 54 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 54 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 53 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 53 transition count 125
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 53 transition count 122
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 50 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 50 transition count 120
Applied a total of 23 rules in 48 ms. Remains 50 /61 variables (removed 11) and now considering 120/134 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 50/61 places, 120/134 transitions.
RANDOM walk for 40000 steps (1693 resets) in 325 ms. (122 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (490 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
// Phase 1: matrix 120 rows 50 cols
[2024-05-21 20:54:25] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 20:54:25] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/42 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 119/161 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 53/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/170 variables, 8/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/170 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/42 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 119/161 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 53/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/170 variables, 8/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/170 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 120/120 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 50 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 48 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 47 transition count 116
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 47 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 46 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 45 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 44 transition count 114
Applied a total of 11 rules in 22 ms. Remains 44 /50 variables (removed 6) and now considering 114/120 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 44/50 places, 114/120 transitions.
RANDOM walk for 40000 steps (1046 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (537 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 39321 steps, run visited all 1 properties in 44 ms. (steps per millisecond=893 )
Probabilistic random walk after 39321 steps, saw 7696 distinct states, run finished after 49 ms. (steps per millisecond=802 ) properties seen :1
[2024-05-21 20:54:25] [INFO ] Flatten gal took : 43 ms
[2024-05-21 20:54:25] [INFO ] Flatten gal took : 46 ms
[2024-05-21 20:54:25] [INFO ] Input system was already deterministic with 475 transitions.
Computed a total of 46 stabilizing places and 47 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 216 transition count 451
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 216 transition count 451
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 148 place count 216 transition count 351
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 152 place count 212 transition count 347
Iterating global reduction 1 with 4 rules applied. Total rules applied 156 place count 212 transition count 347
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 211 transition count 346
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 211 transition count 346
Applied a total of 158 rules in 23 ms. Remains 211 /240 variables (removed 29) and now considering 346/475 (removed 129) transitions.
// Phase 1: matrix 346 rows 211 cols
[2024-05-21 20:54:25] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 20:54:25] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 20:54:25] [INFO ] Invariant cache hit.
[2024-05-21 20:54:26] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-21 20:54:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-05-21 20:54:31] [INFO ] Deduced a trap composed of 20 places in 217 ms of which 4 ms to minimize.
[2024-05-21 20:54:31] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 4 ms to minimize.
[2024-05-21 20:54:31] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 4 ms to minimize.
[2024-05-21 20:54:31] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 3 ms to minimize.
[2024-05-21 20:54:31] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-21 20:54:32] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 3 ms to minimize.
[2024-05-21 20:54:32] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 4 ms to minimize.
[2024-05-21 20:54:32] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 3 ms to minimize.
[2024-05-21 20:54:32] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 3 ms to minimize.
[2024-05-21 20:54:33] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 2 ms to minimize.
[2024-05-21 20:54:33] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 4 ms to minimize.
[2024-05-21 20:54:33] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 2 ms to minimize.
[2024-05-21 20:54:33] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 2 ms to minimize.
[2024-05-21 20:54:33] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 3 ms to minimize.
[2024-05-21 20:54:34] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 3 ms to minimize.
[2024-05-21 20:54:34] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 4 ms to minimize.
[2024-05-21 20:54:34] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 3 ms to minimize.
[2024-05-21 20:54:34] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 2 ms to minimize.
[2024-05-21 20:54:35] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-05-21 20:54:35] [INFO ] Deduced a trap composed of 54 places in 184 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-05-21 20:54:35] [INFO ] Deduced a trap composed of 20 places in 244 ms of which 3 ms to minimize.
[2024-05-21 20:54:36] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 4 ms to minimize.
[2024-05-21 20:54:36] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 4 ms to minimize.
[2024-05-21 20:54:36] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 3 ms to minimize.
[2024-05-21 20:54:36] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 3 ms to minimize.
[2024-05-21 20:54:36] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 3 ms to minimize.
[2024-05-21 20:54:37] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 3 ms to minimize.
[2024-05-21 20:54:37] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 2 ms to minimize.
[2024-05-21 20:54:37] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 2 ms to minimize.
[2024-05-21 20:54:37] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 2 ms to minimize.
[2024-05-21 20:54:38] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 2 ms to minimize.
[2024-05-21 20:54:38] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 2 ms to minimize.
[2024-05-21 20:54:38] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 3 ms to minimize.
[2024-05-21 20:54:38] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 3 ms to minimize.
[2024-05-21 20:54:38] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 3 ms to minimize.
[2024-05-21 20:54:39] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 3 ms to minimize.
[2024-05-21 20:54:39] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 3 ms to minimize.
[2024-05-21 20:54:40] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 3 ms to minimize.
[2024-05-21 20:54:40] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-21 20:54:40] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-05-21 20:54:43] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 3 ms to minimize.
[2024-05-21 20:54:43] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 3 ms to minimize.
[2024-05-21 20:54:43] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 3 ms to minimize.
[2024-05-21 20:54:44] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 3 ms to minimize.
[2024-05-21 20:54:44] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 3 ms to minimize.
[2024-05-21 20:54:44] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 3 ms to minimize.
[2024-05-21 20:54:45] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 3 ms to minimize.
[2024-05-21 20:54:45] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 2 ms to minimize.
[2024-05-21 20:54:45] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
[2024-05-21 20:54:46] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:54:46] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-05-21 20:54:46] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-05-21 20:54:47] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-05-21 20:54:50] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 3 ms to minimize.
[2024-05-21 20:54:50] [INFO ] Deduced a trap composed of 56 places in 183 ms of which 4 ms to minimize.
[2024-05-21 20:54:50] [INFO ] Deduced a trap composed of 45 places in 198 ms of which 4 ms to minimize.
[2024-05-21 20:54:50] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 3 ms to minimize.
[2024-05-21 20:54:50] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 3 ms to minimize.
[2024-05-21 20:54:51] [INFO ] Deduced a trap composed of 56 places in 194 ms of which 3 ms to minimize.
[2024-05-21 20:54:51] [INFO ] Deduced a trap composed of 56 places in 188 ms of which 3 ms to minimize.
[2024-05-21 20:54:51] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 3 ms to minimize.
[2024-05-21 20:54:51] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 4 ms to minimize.
[2024-05-21 20:54:52] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 3 ms to minimize.
[2024-05-21 20:54:52] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-21 20:54:52] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:54:53] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 2 ms to minimize.
[2024-05-21 20:54:53] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 14/77 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-05-21 20:54:56] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 4 ms to minimize.
[2024-05-21 20:54:56] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 3 ms to minimize.
[2024-05-21 20:54:56] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 3 ms to minimize.
SMT process timed out in 30508ms, After SMT, problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 30515ms
Starting structural reductions in LTL mode, iteration 1 : 211/240 places, 346/475 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30985 ms. Remains : 211/240 places, 346/475 transitions.
[2024-05-21 20:54:56] [INFO ] Flatten gal took : 36 ms
[2024-05-21 20:54:56] [INFO ] Flatten gal took : 32 ms
[2024-05-21 20:54:56] [INFO ] Input system was already deterministic with 346 transitions.
[2024-05-21 20:54:56] [INFO ] Flatten gal took : 29 ms
[2024-05-21 20:54:56] [INFO ] Flatten gal took : 30 ms
[2024-05-21 20:54:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality16323696008693190776.gal : 31 ms
[2024-05-21 20:54:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality3776828589452942063.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16323696008693190776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3776828589452942063.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 20:55:27] [INFO ] Flatten gal took : 27 ms
[2024-05-21 20:55:27] [INFO ] Applying decomposition
[2024-05-21 20:55:27] [INFO ] Flatten gal took : 22 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/graph5395875344059053547.txt' '-o' '/tmp/graph5395875344059053547.bin' '-w' '/tmp/graph5395875344059053547.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5395875344059053547.bin' '-l' '-1' '-v' '-w' '/tmp/graph5395875344059053547.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:55:27] [INFO ] Decomposing Gal with order
[2024-05-21 20:55:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:55:27] [INFO ] Removed a total of 451 redundant transitions.
[2024-05-21 20:55:27] [INFO ] Flatten gal took : 100 ms
[2024-05-21 20:55:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 18 ms.
[2024-05-21 20:55:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality12271976514184300853.gal : 10 ms
[2024-05-21 20:55:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality10935734756349764793.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/CTLCardinality12271976514184300853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10935734756349764793.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,4.02286e+10,0.205547,9492,660,100,10987,1024,519,16636,88,3629,0


Converting to forward existential form...Done !
original formula: (EG(AX(((E((i0.u66.p214==1) U (i5.i1.u22.p73==1)) * AX((i2.i1.u7.p27==0))) * (AF((i8.u35.p116==1)) * (AG((i6.u26.p85==1)) + (i11.i1.u53.p...228
=> equivalent forward existential formula: ([FwdG(EY(FwdU((Init * !(EG(!(EX(!(((E((i0.u66.p214==1) U (i5.i1.u22.p73==1)) * !(EX(!((i2.i1.u7.p27==0))))) * (...530
Reverse transition relation is NOT exact ! Due to transitions t199, t205, t260, t295, t343, i0.t54, i0.u64.t39, i0.u64.t40, i0.u66.t35, i1.t197, i3.i1.t190...733
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
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 a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
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
(forward)formula 0,0,18.3773,533256,1,0,1.1169e+06,4626,4353,1.36442e+06,513,30733,1229295
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 219 transition count 454
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 219 transition count 454
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 142 place count 219 transition count 354
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 144 place count 217 transition count 352
Iterating global reduction 1 with 2 rules applied. Total rules applied 146 place count 217 transition count 352
Applied a total of 146 rules in 15 ms. Remains 217 /240 variables (removed 23) and now considering 352/475 (removed 123) transitions.
// Phase 1: matrix 352 rows 217 cols
[2024-05-21 20:55:46] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 20:55:46] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 20:55:46] [INFO ] Invariant cache hit.
[2024-05-21 20:55:46] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 351 sub problems to find dead transitions.
[2024-05-21 20:55:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-21 20:55:52] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 7 ms to minimize.
[2024-05-21 20:55:52] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 3 ms to minimize.
[2024-05-21 20:55:53] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 3 ms to minimize.
[2024-05-21 20:55:53] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 4 ms to minimize.
[2024-05-21 20:55:53] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 4 ms to minimize.
[2024-05-21 20:55:54] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 3 ms to minimize.
[2024-05-21 20:55:54] [INFO ] Deduced a trap composed of 63 places in 198 ms of which 4 ms to minimize.
[2024-05-21 20:55:54] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 3 ms to minimize.
[2024-05-21 20:55:54] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
[2024-05-21 20:55:54] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 3 ms to minimize.
[2024-05-21 20:55:55] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 3 ms to minimize.
[2024-05-21 20:55:55] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 3 ms to minimize.
[2024-05-21 20:55:55] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 3 ms to minimize.
[2024-05-21 20:55:55] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 3 ms to minimize.
[2024-05-21 20:55:56] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 3 ms to minimize.
[2024-05-21 20:55:56] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 3 ms to minimize.
[2024-05-21 20:55:56] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:55:56] [INFO ] Deduced a trap composed of 60 places in 137 ms of which 2 ms to minimize.
[2024-05-21 20:55:56] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 2 ms to minimize.
[2024-05-21 20:55:56] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-21 20:55:57] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 2 ms to minimize.
[2024-05-21 20:55:57] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 3 ms to minimize.
[2024-05-21 20:55:57] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2024-05-21 20:55:57] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 2 ms to minimize.
[2024-05-21 20:55:58] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 2 ms to minimize.
[2024-05-21 20:55:58] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
[2024-05-21 20:55:58] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 2 ms to minimize.
[2024-05-21 20:55:58] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 2 ms to minimize.
[2024-05-21 20:55:58] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-05-21 20:55:59] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 3 ms to minimize.
[2024-05-21 20:55:59] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-05-21 20:55:59] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-05-21 20:55:59] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 3 ms to minimize.
[2024-05-21 20:56:00] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 2 ms to minimize.
[2024-05-21 20:56:01] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 15/45 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-21 20:56:05] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2024-05-21 20:56:05] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-05-21 20:56:05] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-21 20:56:06] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:56:06] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-05-21 20:56:07] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2024-05-21 20:56:07] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-21 20:56:08] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-21 20:56:08] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 3 ms to minimize.
[2024-05-21 20:56:08] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
[2024-05-21 20:56:08] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 3 ms to minimize.
[2024-05-21 20:56:09] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-21 20:56:09] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-21 20:56:09] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 7 (OVERLAPS) 352/569 variables, 217/276 constraints. Problems are: Problem set: 2 solved, 349 unsolved
[2024-05-21 20:56:15] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-05-21 20:56:15] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 569/569 variables, and 278 constraints, problems are : Problem set: 2 solved, 349 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 2 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 349 unsolved
At refinement iteration 1 (OVERLAPS) 2/217 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 51/61 constraints. Problems are: Problem set: 2 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 349 unsolved
At refinement iteration 4 (OVERLAPS) 352/569 variables, 217/278 constraints. Problems are: Problem set: 2 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 349/627 constraints. Problems are: Problem set: 2 solved, 349 unsolved
[2024-05-21 20:56:25] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:56:25] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-21 20:56:25] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-05-21 20:56:26] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:56:26] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:56:27] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 6/633 constraints. Problems are: Problem set: 2 solved, 349 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 0/633 constraints. Problems are: Problem set: 2 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/569 variables, and 633 constraints, problems are : Problem set: 2 solved, 349 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 349/351 constraints, Known Traps: 57/57 constraints]
After SMT, in 60590ms problems are : Problem set: 2 solved, 349 unsolved
Search for dead transitions found 2 dead transitions in 60598ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 217/240 places, 350/475 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 350
Applied a total of 1 rules in 7 ms. Remains 216 /217 variables (removed 1) and now considering 350/350 (removed 0) transitions.
// Phase 1: matrix 350 rows 216 cols
[2024-05-21 20:56:47] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 20:56:47] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 20:56:47] [INFO ] Invariant cache hit.
[2024-05-21 20:56:47] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 216/240 places, 350/475 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61766 ms. Remains : 216/240 places, 350/475 transitions.
[2024-05-21 20:56:47] [INFO ] Flatten gal took : 25 ms
[2024-05-21 20:56:47] [INFO ] Flatten gal took : 25 ms
[2024-05-21 20:56:47] [INFO ] Input system was already deterministic with 350 transitions.
[2024-05-21 20:56:47] [INFO ] Flatten gal took : 19 ms
[2024-05-21 20:56:47] [INFO ] Flatten gal took : 24 ms
[2024-05-21 20:56:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality11885120368205247449.gal : 6 ms
[2024-05-21 20:56:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality774729025429257180.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/CTLCardinality11885120368205247449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality774729025429257180.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 20:57:18] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:57:18] [INFO ] Applying decomposition
[2024-05-21 20:57:18] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1511928094020435453.txt' '-o' '/tmp/graph1511928094020435453.bin' '-w' '/tmp/graph1511928094020435453.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1511928094020435453.bin' '-l' '-1' '-v' '-w' '/tmp/graph1511928094020435453.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:57:18] [INFO ] Decomposing Gal with order
[2024-05-21 20:57:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:57:18] [INFO ] Removed a total of 451 redundant transitions.
[2024-05-21 20:57:18] [INFO ] Flatten gal took : 39 ms
[2024-05-21 20:57:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 7 ms.
[2024-05-21 20:57:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality11146450757809805477.gal : 7 ms
[2024-05-21 20:57:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality1594060101259607724.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/CTLCardinality11146450757809805477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1594060101259607724.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,5.02511e+10,0.245318,9280,794,105,11800,1067,539,15532,81,3827,0


Converting to forward existential form...Done !
original formula: A((i12.i0.u65.p199==0) U ((AX(AF((i8.i2.u49.p154==1))) * EX(AG(AF((i12.i1.u63.p194==1))))) * (((i4.u2.p13==0)||(i15.i1.u76.p237==1)) + ((...421
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EX(!(!(EG(!((i8.i2.u49.p154==1))))))) * EX(!(E(TRUE U !(!(EG(!((i12.i1.u63.p194==1)))))))))...1360
Reverse transition relation is NOT exact ! Due to transitions t202, t208, t233, t263, t283, t303, t347, i2.t193, i2.u10.t172, i2.u16.t176, i2.u16.t177, i2....735
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 1
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,20.01,592720,1,0,1.32572e+06,4438,3897,1.38203e+06,442,31787,1525284
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Graph (trivial) has 199 edges and 240 vertex of which 4 / 240 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 237 transition count 385
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 109 rules applied. Total rules applied 197 place count 150 transition count 363
Reduce places removed 12 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 18 rules applied. Total rules applied 215 place count 138 transition count 357
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 225 place count 132 transition count 353
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 227 place count 130 transition count 353
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 227 place count 130 transition count 347
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 239 place count 124 transition count 347
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 255 place count 108 transition count 331
Iterating global reduction 5 with 16 rules applied. Total rules applied 271 place count 108 transition count 331
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Iterating post reduction 5 with 101 rules applied. Total rules applied 372 place count 108 transition count 230
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 372 place count 108 transition count 229
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 374 place count 107 transition count 229
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 377 place count 104 transition count 218
Iterating global reduction 6 with 3 rules applied. Total rules applied 380 place count 104 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 382 place count 104 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 383 place count 103 transition count 216
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 8 with 52 rules applied. Total rules applied 435 place count 77 transition count 190
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 439 place count 73 transition count 167
Iterating global reduction 8 with 4 rules applied. Total rules applied 443 place count 73 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 444 place count 73 transition count 166
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 447 place count 73 transition count 166
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 449 place count 71 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 450 place count 70 transition count 164
Applied a total of 450 rules in 84 ms. Remains 70 /240 variables (removed 170) and now considering 164/475 (removed 311) transitions.
// Phase 1: matrix 164 rows 70 cols
[2024-05-21 20:57:38] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 20:57:38] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 20:57:38] [INFO ] Invariant cache hit.
[2024-05-21 20:57:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:57:38] [INFO ] Implicit Places using invariants and state equation in 127 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 198 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 69/240 places, 164/475 transitions.
Applied a total of 0 rules in 7 ms. Remains 69 /69 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 289 ms. Remains : 69/240 places, 164/475 transitions.
[2024-05-21 20:57:38] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:57:38] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:57:38] [INFO ] Input system was already deterministic with 164 transitions.
[2024-05-21 20:57:38] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:57:38] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:57:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality252718642706200034.gal : 6 ms
[2024-05-21 20:57:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality10278606552783465741.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/CTLCardinality252718642706200034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10278606552783465741.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,1.04077e+07,2.47257,53672,2,5303,5,179111,6,0,437,160169,0


Converting to forward existential form...Done !
original formula: AG(((A(E(A(((p188==0)||(p129==1)) U (p22==1)) U EF(((p142==0)||(p79==1)))) U (AF((p64==0)) + ((p253==1)&&((p50==1)||(p104==1))))) + A(AG(...243
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((!((E(!((!(EG(!((p64==0)))) + ((p253==1)&&((p50==1)||(p104==1))))) U (!(E(!((E(!((p22==1...1103
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t8, t11, t12, t14, t16, t18, t20, t21, t25, t26, t31, t33, t38, t40, t54, t58...656
Detected timeout of ITS tools.
[2024-05-21 20:58:08] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:58:08] [INFO ] Applying decomposition
[2024-05-21 20:58:08] [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/graph11190944808737400160.txt' '-o' '/tmp/graph11190944808737400160.bin' '-w' '/tmp/graph11190944808737400160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11190944808737400160.bin' '-l' '-1' '-v' '-w' '/tmp/graph11190944808737400160.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:58:08] [INFO ] Decomposing Gal with order
[2024-05-21 20:58:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:58:08] [INFO ] Removed a total of 332 redundant transitions.
[2024-05-21 20:58:08] [INFO ] Flatten gal took : 24 ms
[2024-05-21 20:58:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 5 ms.
[2024-05-21 20:58:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality12345674697899673013.gal : 5 ms
[2024-05-21 20:58:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality2893711861132839856.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/CTLCardinality12345674697899673013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2893711861132839856.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,1.04077e+07,0.057555,4412,164,80,1363,435,232,2105,75,2207,0


Converting to forward existential form...Done !
original formula: AG(((A(E(A(((u21.p188==0)||(i4.u12.p129==1)) U (i6.u0.p22==1)) U EF(((i4.u13.p142==0)||(i2.u6.p79==1)))) U (AF((i2.u5.p64==0)) + ((i7.u25...333
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((!((E(!((!(EG(!((i2.u5.p64==0)))) + ((i7.u25.p253==1)&&((u3.p50==1)||(i3.u8.p104==1)))))...1429
Reverse transition relation is NOT exact ! Due to transitions t54, t58, t70, t74, t89, t93, t103, t113, t118, t128, t133, t138, t148, t153, u3.t40, u3.t87,...447
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 a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 8
(forward)formula 0,0,2.21869,64604,1,0,124065,1829,1724,197182,395,9395,181104
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Graph (trivial) has 228 edges and 240 vertex of which 4 / 240 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 237 transition count 369
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 137 rules applied. Total rules applied 241 place count 134 transition count 335
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 261 place count 114 transition count 335
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 261 place count 114 transition count 330
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 271 place count 109 transition count 330
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 287 place count 93 transition count 314
Iterating global reduction 3 with 16 rules applied. Total rules applied 303 place count 93 transition count 314
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 303 place count 93 transition count 313
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 305 place count 92 transition count 313
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 309 place count 88 transition count 282
Iterating global reduction 3 with 4 rules applied. Total rules applied 313 place count 88 transition count 282
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 319 place count 88 transition count 276
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 322 place count 85 transition count 276
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 380 place count 56 transition count 247
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 387 place count 49 transition count 172
Iterating global reduction 5 with 7 rules applied. Total rules applied 394 place count 49 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 398 place count 49 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 400 place count 47 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 401 place count 47 transition count 167
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 403 place count 45 transition count 165
Applied a total of 403 rules in 97 ms. Remains 45 /240 variables (removed 195) and now considering 165/475 (removed 310) transitions.
// Phase 1: matrix 165 rows 45 cols
[2024-05-21 20:58:11] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 20:58:11] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 20:58:11] [INFO ] Invariant cache hit.
[2024-05-21 20:58:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:58:11] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [38, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 295 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 43/240 places, 165/475 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 42 transition count 164
Applied a total of 2 rules in 16 ms. Remains 42 /43 variables (removed 1) and now considering 164/165 (removed 1) transitions.
// Phase 1: matrix 164 rows 42 cols
[2024-05-21 20:58:11] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 20:58:11] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 20:58:11] [INFO ] Invariant cache hit.
[2024-05-21 20:58:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:58:11] [INFO ] Implicit Places using invariants and state equation in 139 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 : 42/240 places, 164/475 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 627 ms. Remains : 42/240 places, 164/475 transitions.
[2024-05-21 20:58:11] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:58:11] [INFO ] Flatten gal took : 14 ms
[2024-05-21 20:58:11] [INFO ] Input system was already deterministic with 164 transitions.
[2024-05-21 20:58:11] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:58:11] [INFO ] Flatten gal took : 16 ms
[2024-05-21 20:58:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality7399143438639739961.gal : 12 ms
[2024-05-21 20:58:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality16451583615088033539.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/CTLCardinality7399143438639739961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16451583615088033539.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,467366,2.74469,54568,2,4014,5,147244,6,0,330,123775,0


Converting to forward existential form...Done !
original formula: AF(EG(EF((p3==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U (p3==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t26, t29, t30, t31, t32, t33,...391
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,16.9146,329788,1,0,655,1.39842e+06,359,309,5927,1.04822e+06,737
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Graph (trivial) has 227 edges and 240 vertex of which 4 / 240 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 237 transition count 371
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 135 rules applied. Total rules applied 237 place count 136 transition count 337
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 258 place count 116 transition count 336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 259 place count 115 transition count 336
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 259 place count 115 transition count 331
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 269 place count 110 transition count 331
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 286 place count 93 transition count 314
Iterating global reduction 4 with 17 rules applied. Total rules applied 303 place count 93 transition count 314
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 403 place count 93 transition count 214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 403 place count 93 transition count 212
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 407 place count 91 transition count 212
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 411 place count 87 transition count 196
Iterating global reduction 5 with 4 rules applied. Total rules applied 415 place count 87 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 421 place count 87 transition count 190
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 424 place count 84 transition count 190
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 480 place count 56 transition count 162
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 487 place count 49 transition count 122
Iterating global reduction 7 with 7 rules applied. Total rules applied 494 place count 49 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 4 rules applied. Total rules applied 498 place count 49 transition count 118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 500 place count 47 transition count 118
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 501 place count 47 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 503 place count 45 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 504 place count 44 transition count 116
Applied a total of 504 rules in 59 ms. Remains 44 /240 variables (removed 196) and now considering 116/475 (removed 359) transitions.
// Phase 1: matrix 116 rows 44 cols
[2024-05-21 20:58:29] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 20:58:29] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 20:58:29] [INFO ] Invariant cache hit.
[2024-05-21 20:58:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:58:29] [INFO ] Implicit Places using invariants and state equation in 163 ms returned [36, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 264 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 42/240 places, 116/475 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 42 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 41 transition count 115
Applied a total of 2 rules in 6 ms. Remains 41 /42 variables (removed 1) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 41 cols
[2024-05-21 20:58:29] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 20:58:29] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 20:58:29] [INFO ] Invariant cache hit.
[2024-05-21 20:58:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:58:29] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 41/240 places, 115/475 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 578 ms. Remains : 41/240 places, 115/475 transitions.
[2024-05-21 20:58:29] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:58:29] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:58:29] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-21 20:58:29] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:58:29] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:58:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality12144923744475241888.gal : 3 ms
[2024-05-21 20:58:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality9404875938662218827.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/CTLCardinality12144923744475241888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9404875938662218827.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,293406,0.361246,9372,2,737,5,16226,6,0,277,21699,0


Converting to forward existential form...Done !
original formula: EG(((p245==0)||(p17==1)))
=> equivalent forward existential formula: [FwdG(Init,((p245==0)||(p17==1)))] != FALSE
Hit Full ! (commute/partial/dont) 93/0/22
(forward)formula 0,1,1.14028,22572,1,0,56,62552,19,4,2511,77105,55
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 213 transition count 448
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 213 transition count 448
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 154 place count 213 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 159 place count 208 transition count 343
Iterating global reduction 1 with 5 rules applied. Total rules applied 164 place count 208 transition count 343
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 207 transition count 342
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 207 transition count 342
Applied a total of 166 rules in 15 ms. Remains 207 /240 variables (removed 33) and now considering 342/475 (removed 133) transitions.
// Phase 1: matrix 342 rows 207 cols
[2024-05-21 20:58:30] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 20:58:30] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 20:58:30] [INFO ] Invariant cache hit.
[2024-05-21 20:58:31] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2024-05-21 20:58:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 20:58:37] [INFO ] Deduced a trap composed of 20 places in 281 ms of which 5 ms to minimize.
[2024-05-21 20:58:37] [INFO ] Deduced a trap composed of 51 places in 267 ms of which 4 ms to minimize.
[2024-05-21 20:58:37] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 3 ms to minimize.
[2024-05-21 20:58:37] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-21 20:58:38] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 3 ms to minimize.
[2024-05-21 20:58:38] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 4 ms to minimize.
[2024-05-21 20:58:38] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 3 ms to minimize.
[2024-05-21 20:58:38] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2024-05-21 20:58:39] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 4 ms to minimize.
[2024-05-21 20:58:39] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 3 ms to minimize.
[2024-05-21 20:58:39] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 3 ms to minimize.
[2024-05-21 20:58:39] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 4 ms to minimize.
[2024-05-21 20:58:40] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 3 ms to minimize.
[2024-05-21 20:58:40] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-05-21 20:58:40] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-21 20:58:41] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 2 ms to minimize.
[2024-05-21 20:58:41] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-05-21 20:58:41] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 3 ms to minimize.
[2024-05-21 20:58:41] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 3 ms to minimize.
[2024-05-21 20:58:42] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 20:58:42] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 3 ms to minimize.
[2024-05-21 20:58:42] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 3 ms to minimize.
[2024-05-21 20:58:43] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 3 ms to minimize.
[2024-05-21 20:58:43] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 3 ms to minimize.
[2024-05-21 20:58:43] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 3 ms to minimize.
[2024-05-21 20:58:43] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 4 ms to minimize.
[2024-05-21 20:58:44] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 4 ms to minimize.
[2024-05-21 20:58:44] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 5 ms to minimize.
[2024-05-21 20:58:44] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 3 ms to minimize.
[2024-05-21 20:58:45] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 2 ms to minimize.
[2024-05-21 20:58:45] [INFO ] Deduced a trap composed of 48 places in 212 ms of which 4 ms to minimize.
[2024-05-21 20:58:45] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 3 ms to minimize.
[2024-05-21 20:58:46] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 3 ms to minimize.
[2024-05-21 20:58:46] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 4 ms to minimize.
[2024-05-21 20:58:46] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 4 ms to minimize.
[2024-05-21 20:58:46] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-05-21 20:58:47] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 3 ms to minimize.
[2024-05-21 20:58:47] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:58:47] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 3 ms to minimize.
[2024-05-21 20:58:47] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 20:58:50] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 3 ms to minimize.
[2024-05-21 20:58:51] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 3 ms to minimize.
[2024-05-21 20:58:51] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 3 ms to minimize.
[2024-05-21 20:58:51] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 3 ms to minimize.
[2024-05-21 20:58:52] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-05-21 20:58:52] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:58:52] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2024-05-21 20:58:52] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 2 ms to minimize.
[2024-05-21 20:58:53] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 20:58:56] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-21 20:58:56] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 341 unsolved
SMT process timed out in 30423ms, After SMT, problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 30429ms
Starting structural reductions in LTL mode, iteration 1 : 207/240 places, 342/475 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30795 ms. Remains : 207/240 places, 342/475 transitions.
[2024-05-21 20:59:01] [INFO ] Flatten gal took : 16 ms
[2024-05-21 20:59:01] [INFO ] Flatten gal took : 16 ms
[2024-05-21 20:59:01] [INFO ] Input system was already deterministic with 342 transitions.
[2024-05-21 20:59:01] [INFO ] Flatten gal took : 16 ms
[2024-05-21 20:59:01] [INFO ] Flatten gal took : 16 ms
[2024-05-21 20:59:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality1453883084402761827.gal : 5 ms
[2024-05-21 20:59:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality4661887640292102290.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/CTLCardinality1453883084402761827.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4661887640292102290.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 20:59:31] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:59:31] [INFO ] Applying decomposition
[2024-05-21 20:59:31] [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/graph1734063728222514279.txt' '-o' '/tmp/graph1734063728222514279.bin' '-w' '/tmp/graph1734063728222514279.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1734063728222514279.bin' '-l' '-1' '-v' '-w' '/tmp/graph1734063728222514279.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:59:31] [INFO ] Decomposing Gal with order
[2024-05-21 20:59:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:59:31] [INFO ] Removed a total of 446 redundant transitions.
[2024-05-21 20:59:31] [INFO ] Flatten gal took : 40 ms
[2024-05-21 20:59:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 9 ms.
[2024-05-21 20:59:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality8414767338729362228.gal : 5 ms
[2024-05-21 20:59:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality8866393444237594832.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/CTLCardinality8414767338729362228.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8866393444237594832.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.84316e+10,0.230183,7796,692,106,8276,1145,484,10499,83,3463,0


Converting to forward existential form...Done !
original formula: EX(AG(AF((i5.u23.p73==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(!((i5.u23.p73==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t195, t202, t217, t252, t272, t292, t339, i0.i1.t25, i1.t193, i3.i1.t186, i3.i1.u10.t166, i3....712
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
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,17.5439,507812,1,0,1.13228e+06,4157,3254,1.14804e+06,447,26159,1266620
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 217 transition count 452
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 217 transition count 452
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 146 place count 217 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 214 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 214 transition count 349
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 213 transition count 348
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 213 transition count 348
Applied a total of 154 rules in 16 ms. Remains 213 /240 variables (removed 27) and now considering 348/475 (removed 127) transitions.
// Phase 1: matrix 348 rows 213 cols
[2024-05-21 20:59:49] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 20:59:49] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 20:59:49] [INFO ] Invariant cache hit.
[2024-05-21 20:59:49] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2024-05-21 20:59:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-05-21 20:59:54] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 3 ms to minimize.
[2024-05-21 20:59:54] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 3 ms to minimize.
[2024-05-21 20:59:54] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 3 ms to minimize.
[2024-05-21 20:59:54] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-21 20:59:55] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 2 ms to minimize.
[2024-05-21 20:59:55] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 2 ms to minimize.
[2024-05-21 20:59:55] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 4 ms to minimize.
[2024-05-21 20:59:55] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 3 ms to minimize.
[2024-05-21 20:59:56] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 4 ms to minimize.
[2024-05-21 20:59:56] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 3 ms to minimize.
[2024-05-21 20:59:56] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 3 ms to minimize.
[2024-05-21 20:59:56] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 3 ms to minimize.
[2024-05-21 20:59:57] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 3 ms to minimize.
[2024-05-21 20:59:57] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:59:57] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-21 20:59:57] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 2 ms to minimize.
[2024-05-21 20:59:57] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 3 ms to minimize.
[2024-05-21 20:59:58] [INFO ] Deduced a trap composed of 52 places in 175 ms of which 3 ms to minimize.
[2024-05-21 20:59:58] [INFO ] Deduced a trap composed of 54 places in 180 ms of which 3 ms to minimize.
[2024-05-21 20:59:58] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-05-21 20:59:58] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 3 ms to minimize.
[2024-05-21 20:59:59] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 3 ms to minimize.
[2024-05-21 20:59:59] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 3 ms to minimize.
[2024-05-21 20:59:59] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:00:00] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 4 ms to minimize.
[2024-05-21 21:00:00] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 4 ms to minimize.
[2024-05-21 21:00:00] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 2 ms to minimize.
[2024-05-21 21:00:00] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 3 ms to minimize.
[2024-05-21 21:00:01] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 4 ms to minimize.
[2024-05-21 21:00:01] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 3 ms to minimize.
[2024-05-21 21:00:01] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 3 ms to minimize.
[2024-05-21 21:00:02] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 3 ms to minimize.
[2024-05-21 21:00:02] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 3 ms to minimize.
[2024-05-21 21:00:02] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-05-21 21:00:02] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 3 ms to minimize.
[2024-05-21 21:00:03] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 3 ms to minimize.
[2024-05-21 21:00:03] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 3 ms to minimize.
[2024-05-21 21:00:03] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 3 ms to minimize.
[2024-05-21 21:00:04] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 3 ms to minimize.
[2024-05-21 21:00:04] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-05-21 21:00:07] [INFO ] Deduced a trap composed of 14 places in 250 ms of which 4 ms to minimize.
[2024-05-21 21:00:07] [INFO ] Deduced a trap composed of 30 places in 239 ms of which 4 ms to minimize.
[2024-05-21 21:00:07] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 3 ms to minimize.
[2024-05-21 21:00:08] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 4 ms to minimize.
[2024-05-21 21:00:08] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 3 ms to minimize.
[2024-05-21 21:00:08] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 3 ms to minimize.
[2024-05-21 21:00:08] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 3 ms to minimize.
[2024-05-21 21:00:09] [INFO ] Deduced a trap composed of 45 places in 248 ms of which 3 ms to minimize.
[2024-05-21 21:00:09] [INFO ] Deduced a trap composed of 33 places in 204 ms of which 3 ms to minimize.
[2024-05-21 21:00:09] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 4 ms to minimize.
[2024-05-21 21:00:10] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 2 ms to minimize.
[2024-05-21 21:00:10] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-21 21:00:11] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 2 ms to minimize.
[2024-05-21 21:00:11] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-05-21 21:00:12] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-05-21 21:00:15] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-05-21 21:00:16] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 4 ms to minimize.
[2024-05-21 21:00:16] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-05-21 21:00:18] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 3 ms to minimize.
[2024-05-21 21:00:18] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-05-21 21:00:18] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 3 ms to minimize.
[2024-05-21 21:00:19] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 3 ms to minimize.
[2024-05-21 21:00:19] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 213/561 variables, and 73 constraints, problems are : Problem set: 0 solved, 347 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/213 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-05-21 21:00:25] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2024-05-21 21:00:25] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 3 ms to minimize.
[2024-05-21 21:00:25] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 3 ms to minimize.
[2024-05-21 21:00:26] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-05-21 21:00:29] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-21 21:00:29] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2024-05-21 21:00:29] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-05-21 21:00:29] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-05-21 21:00:31] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:00:32] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 4 ms to minimize.
[2024-05-21 21:00:33] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 3 ms to minimize.
[2024-05-21 21:00:33] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 3 ms to minimize.
[2024-05-21 21:00:34] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-05-21 21:00:37] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 347 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD307 is UNSAT
At refinement iteration 8 (OVERLAPS) 348/561 variables, 213/300 constraints. Problems are: Problem set: 2 solved, 345 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 345/645 constraints. Problems are: Problem set: 2 solved, 345 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/561 variables, and 645 constraints, problems are : Problem set: 2 solved, 345 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 345/347 constraints, Known Traps: 77/77 constraints]
After SMT, in 60339ms problems are : Problem set: 2 solved, 345 unsolved
Search for dead transitions found 2 dead transitions in 60344ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 213/240 places, 346/475 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 346
Applied a total of 1 rules in 4 ms. Remains 212 /213 variables (removed 1) and now considering 346/346 (removed 0) transitions.
// Phase 1: matrix 346 rows 212 cols
[2024-05-21 21:00:50] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 21:00:50] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 21:00:50] [INFO ] Invariant cache hit.
[2024-05-21 21:00:50] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 212/240 places, 346/475 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61281 ms. Remains : 212/240 places, 346/475 transitions.
[2024-05-21 21:00:50] [INFO ] Flatten gal took : 17 ms
[2024-05-21 21:00:50] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:00:50] [INFO ] Input system was already deterministic with 346 transitions.
[2024-05-21 21:00:50] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:00:50] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:00:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality14669510014097701207.gal : 4 ms
[2024-05-21 21:00:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality9821626220217281882.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/CTLCardinality14669510014097701207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9821626220217281882.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 21:01:20] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:01:20] [INFO ] Applying decomposition
[2024-05-21 21:01: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/graph9189005515014975015.txt' '-o' '/tmp/graph9189005515014975015.bin' '-w' '/tmp/graph9189005515014975015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9189005515014975015.bin' '-l' '-1' '-v' '-w' '/tmp/graph9189005515014975015.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:01:21] [INFO ] Decomposing Gal with order
[2024-05-21 21:01:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:01:21] [INFO ] Removed a total of 457 redundant transitions.
[2024-05-21 21:01:21] [INFO ] Flatten gal took : 28 ms
[2024-05-21 21:01:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 6 ms.
[2024-05-21 21:01:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality7119487982035527024.gal : 4 ms
[2024-05-21 21:01:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality6707417925430191467.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/CTLCardinality7119487982035527024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6707417925430191467.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,4.28033e+10,0.10939,6624,629,100,4306,1028,557,7067,82,4123,0


Converting to forward existential form...Done !
original formula: (EX(EG(((i1.i0.u13.p44==0)||(i4.i1.u23.p76==1)))) * EF((A(A((((i4.i2.u28.p90==1)||(i13.u2.p211==0))||(i10.u58.p182==1)) U (i10.u50.p158==...283
=> equivalent forward existential formula: ([((FwdU((Init * EX(EG(((i1.i0.u13.p44==0)||(i4.i1.u23.p76==1))))),TRUE) * !(EG(!((i5.i1.u33.p98==1))))) * !(E(!...626
Reverse transition relation is NOT exact ! Due to transitions t200, t203, t223, t258, t278, t298, t343, i1.i1.t191, i1.i1.u8.t171, i1.i1.u17.t172, i2.u14.t...752
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 a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,18.5669,447240,1,0,907856,5106,4624,1.21196e+06,464,43463,930775
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 215 transition count 450
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 215 transition count 450
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 150 place count 215 transition count 350
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 155 place count 210 transition count 345
Iterating global reduction 1 with 5 rules applied. Total rules applied 160 place count 210 transition count 345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 209 transition count 344
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 209 transition count 344
Applied a total of 162 rules in 15 ms. Remains 209 /240 variables (removed 31) and now considering 344/475 (removed 131) transitions.
// Phase 1: matrix 344 rows 209 cols
[2024-05-21 21:01:39] [INFO ] Computed 10 invariants in 6 ms
[2024-05-21 21:01:39] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 21:01:39] [INFO ] Invariant cache hit.
[2024-05-21 21:01:40] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 343 sub problems to find dead transitions.
[2024-05-21 21:01:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-21 21:01:46] [INFO ] Deduced a trap composed of 20 places in 265 ms of which 4 ms to minimize.
[2024-05-21 21:01:46] [INFO ] Deduced a trap composed of 17 places in 310 ms of which 4 ms to minimize.
[2024-05-21 21:01:46] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 3 ms to minimize.
[2024-05-21 21:01:47] [INFO ] Deduced a trap composed of 63 places in 224 ms of which 4 ms to minimize.
[2024-05-21 21:01:47] [INFO ] Deduced a trap composed of 38 places in 257 ms of which 4 ms to minimize.
[2024-05-21 21:01:47] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 3 ms to minimize.
[2024-05-21 21:01:48] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 4 ms to minimize.
[2024-05-21 21:01:48] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 3 ms to minimize.
[2024-05-21 21:01:48] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 3 ms to minimize.
[2024-05-21 21:01:48] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 3 ms to minimize.
[2024-05-21 21:01:48] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 3 ms to minimize.
[2024-05-21 21:01:49] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 3 ms to minimize.
[2024-05-21 21:01:49] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 4 ms to minimize.
[2024-05-21 21:01:49] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 3 ms to minimize.
[2024-05-21 21:01:50] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 3 ms to minimize.
[2024-05-21 21:01:50] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 3 ms to minimize.
[2024-05-21 21:01:50] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-05-21 21:01:50] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 2 ms to minimize.
[2024-05-21 21:01:50] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-05-21 21:01:50] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-21 21:01:51] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 3 ms to minimize.
[2024-05-21 21:01:51] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 3 ms to minimize.
[2024-05-21 21:01:51] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 3 ms to minimize.
[2024-05-21 21:01:52] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 3 ms to minimize.
[2024-05-21 21:01:52] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 3 ms to minimize.
[2024-05-21 21:01:52] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 3 ms to minimize.
[2024-05-21 21:01:52] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 3 ms to minimize.
[2024-05-21 21:01:52] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 4 ms to minimize.
[2024-05-21 21:01:53] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 3 ms to minimize.
[2024-05-21 21:01:53] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 3 ms to minimize.
[2024-05-21 21:01:53] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 3 ms to minimize.
[2024-05-21 21:01:54] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 3 ms to minimize.
[2024-05-21 21:01:54] [INFO ] Deduced a trap composed of 53 places in 229 ms of which 3 ms to minimize.
[2024-05-21 21:01:54] [INFO ] Deduced a trap composed of 52 places in 212 ms of which 3 ms to minimize.
[2024-05-21 21:01:55] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-05-21 21:01:55] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 3 ms to minimize.
[2024-05-21 21:01:55] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
[2024-05-21 21:01:55] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 4 ms to minimize.
[2024-05-21 21:01:55] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 3 ms to minimize.
[2024-05-21 21:01:56] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-21 21:01:59] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 3 ms to minimize.
[2024-05-21 21:01:59] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 3 ms to minimize.
[2024-05-21 21:01:59] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 2 ms to minimize.
[2024-05-21 21:01:59] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-21 21:01:59] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-21 21:02:00] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 3 ms to minimize.
[2024-05-21 21:02:00] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 3 ms to minimize.
[2024-05-21 21:02:01] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 4 ms to minimize.
[2024-05-21 21:02:01] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2024-05-21 21:02:01] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:02:01] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-21 21:02:01] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 3 ms to minimize.
[2024-05-21 21:02:02] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 2 ms to minimize.
[2024-05-21 21:02:02] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-05-21 21:02:02] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 3 ms to minimize.
[2024-05-21 21:02:02] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-21 21:02:05] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 4 ms to minimize.
[2024-05-21 21:02:06] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-05-21 21:02:06] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-05-21 21:02:07] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 3 ms to minimize.
[2024-05-21 21:02:07] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 209/553 variables, and 71 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/209 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD303 is UNSAT
At refinement iteration 4 (OVERLAPS) 344/553 variables, 209/280 constraints. Problems are: Problem set: 2 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 341/621 constraints. Problems are: Problem set: 2 solved, 341 unsolved
[2024-05-21 21:02:27] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 1/622 constraints. Problems are: Problem set: 2 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 622 constraints, problems are : Problem set: 2 solved, 341 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 341/343 constraints, Known Traps: 62/62 constraints]
After SMT, in 60569ms problems are : Problem set: 2 solved, 341 unsolved
Search for dead transitions found 2 dead transitions in 60575ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 209/240 places, 342/475 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 208 transition count 342
Applied a total of 1 rules in 4 ms. Remains 208 /209 variables (removed 1) and now considering 342/342 (removed 0) transitions.
// Phase 1: matrix 342 rows 208 cols
[2024-05-21 21:02:40] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 21:02:41] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-21 21:02:41] [INFO ] Invariant cache hit.
[2024-05-21 21:02:41] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 208/240 places, 342/475 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61657 ms. Remains : 208/240 places, 342/475 transitions.
[2024-05-21 21:02:41] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:02:41] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:02:41] [INFO ] Input system was already deterministic with 342 transitions.
[2024-05-21 21:02:41] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:02:41] [INFO ] Flatten gal took : 17 ms
[2024-05-21 21:02:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality13134578431716924203.gal : 4 ms
[2024-05-21 21:02:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality4457795876666862432.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/CTLCardinality13134578431716924203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4457795876666862432.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 21:03:11] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:03:11] [INFO ] Applying decomposition
[2024-05-21 21:03:11] [INFO ] Flatten gal took : 10 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/graph14434953444429722302.txt' '-o' '/tmp/graph14434953444429722302.bin' '-w' '/tmp/graph14434953444429722302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14434953444429722302.bin' '-l' '-1' '-v' '-w' '/tmp/graph14434953444429722302.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:03:11] [INFO ] Decomposing Gal with order
[2024-05-21 21:03:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:03:11] [INFO ] Removed a total of 459 redundant transitions.
[2024-05-21 21:03:11] [INFO ] Flatten gal took : 25 ms
[2024-05-21 21:03:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2024-05-21 21:03:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality6009746671071720612.gal : 3 ms
[2024-05-21 21:03:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality11800053715946488348.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/CTLCardinality6009746671071720612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11800053715946488348.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,4.0054e+10,0.10178,6592,738,100,4676,1025,525,6551,82,3671,0


Converting to forward existential form...Done !
original formula: AX(EF((((EG((((i15.i0.u73.p243==1)||(i12.i0.u59.p194==0))||(i4.i1.u28.p90==1))) * AF((i7.i0.u34.p105==0))) * ((i2.i2.u18.p58==0)&&(i12.i0...217
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (((EG((((i15.i0.u73.p243==1)||(i12.i0.u59.p194==0))||(i4.i1.u28.p90==1))) * !(EG(!((i7.i...276
Reverse transition relation is NOT exact ! Due to transitions t196, t198, t218, t253, t273, t293, t339, i0.u63.t32, i0.u63.t35, i0.u63.t36, i0.u63.t37, i2....739
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,12.8006,348208,1,0,707572,4532,3769,900373,433,38359,801914
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Graph (trivial) has 226 edges and 240 vertex of which 4 / 240 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 237 transition count 372
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 132 rules applied. Total rules applied 233 place count 137 transition count 340
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 253 place count 118 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 254 place count 117 transition count 339
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 254 place count 117 transition count 332
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 268 place count 110 transition count 332
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 284 place count 94 transition count 316
Iterating global reduction 4 with 16 rules applied. Total rules applied 300 place count 94 transition count 316
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 400 place count 94 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 400 place count 94 transition count 215
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 402 place count 93 transition count 215
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 406 place count 89 transition count 199
Iterating global reduction 5 with 4 rules applied. Total rules applied 410 place count 89 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 416 place count 89 transition count 193
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 419 place count 86 transition count 193
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 473 place count 59 transition count 166
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 480 place count 52 transition count 126
Iterating global reduction 7 with 7 rules applied. Total rules applied 487 place count 52 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 4 rules applied. Total rules applied 491 place count 52 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 493 place count 50 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 494 place count 50 transition count 121
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 496 place count 48 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 497 place count 47 transition count 119
Applied a total of 497 rules in 31 ms. Remains 47 /240 variables (removed 193) and now considering 119/475 (removed 356) transitions.
// Phase 1: matrix 119 rows 47 cols
[2024-05-21 21:03:24] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 21:03:24] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 21:03:24] [INFO ] Invariant cache hit.
[2024-05-21 21:03:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:03:24] [INFO ] Implicit Places using invariants and state equation in 162 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 244 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 46/240 places, 119/475 transitions.
Applied a total of 0 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 281 ms. Remains : 46/240 places, 119/475 transitions.
[2024-05-21 21:03:24] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:03:24] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:03:24] [INFO ] Input system was already deterministic with 119 transitions.
[2024-05-21 21:03:24] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:03:24] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:03:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality5260787974174632943.gal : 2 ms
[2024-05-21 21:03:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality589127300138050181.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/CTLCardinality5260787974174632943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality589127300138050181.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,657304,0.232612,7552,2,852,5,14034,6,0,301,15529,0


Converting to forward existential form...Done !
original formula: EG(((p221==0)||(p205==1)))
=> equivalent forward existential formula: [FwdG(Init,((p221==0)||(p205==1)))] != FALSE
Hit Full ! (commute/partial/dont) 115/0/4
(forward)formula 0,1,0.94095,23708,1,0,71,71620,19,4,2515,88642,69
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Graph (trivial) has 208 edges and 240 vertex of which 2 / 240 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 238 transition count 383
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 116 rules applied. Total rules applied 207 place count 148 transition count 357
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 223 place count 134 transition count 355
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 225 place count 132 transition count 355
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 225 place count 132 transition count 347
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 241 place count 124 transition count 347
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 258 place count 107 transition count 330
Iterating global reduction 4 with 17 rules applied. Total rules applied 275 place count 107 transition count 330
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 102 rules applied. Total rules applied 377 place count 107 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 378 place count 106 transition count 228
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 378 place count 106 transition count 226
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 382 place count 104 transition count 226
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 386 place count 100 transition count 210
Iterating global reduction 6 with 4 rules applied. Total rules applied 390 place count 100 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 392 place count 100 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 393 place count 99 transition count 208
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 8 with 48 rules applied. Total rules applied 441 place count 75 transition count 184
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 447 place count 69 transition count 150
Iterating global reduction 8 with 6 rules applied. Total rules applied 453 place count 69 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 4 rules applied. Total rules applied 457 place count 69 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 459 place count 67 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 460 place count 67 transition count 145
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 461 place count 67 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 462 place count 66 transition count 144
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 464 place count 66 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 466 place count 64 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 467 place count 63 transition count 142
Applied a total of 467 rules in 40 ms. Remains 63 /240 variables (removed 177) and now considering 142/475 (removed 333) transitions.
// Phase 1: matrix 142 rows 63 cols
[2024-05-21 21:03:25] [INFO ] Computed 9 invariants in 0 ms
[2024-05-21 21:03:26] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-21 21:03:26] [INFO ] Invariant cache hit.
[2024-05-21 21:03:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:03:26] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [53, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 351 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/240 places, 142/475 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 60 transition count 141
Applied a total of 2 rules in 4 ms. Remains 60 /61 variables (removed 1) and now considering 141/142 (removed 1) transitions.
// Phase 1: matrix 141 rows 60 cols
[2024-05-21 21:03:26] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 21:03:26] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 21:03:26] [INFO ] Invariant cache hit.
[2024-05-21 21:03:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:03:26] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 60/240 places, 141/475 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 595 ms. Remains : 60/240 places, 141/475 transitions.
[2024-05-21 21:03:26] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:03:26] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:03:26] [INFO ] Input system was already deterministic with 141 transitions.
[2024-05-21 21:03:26] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:03:26] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:03:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality6289770442693274553.gal : 2 ms
[2024-05-21 21:03:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality14617415381080754023.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/CTLCardinality6289770442693274553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14617415381080754023.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.27642e+06,1.74444,38920,2,2749,5,149643,6,0,378,140133,0


Converting to forward existential form...Done !
original formula: (E(AG((AG(((p235==1)&&(p74==1))) * (p192==1))) U (p164==1)) + EG(((p28==0) * AF((((p184==0)||(p152==0)) + !(A(((p190==0)||(p146==1)) U (p...169
=> equivalent forward existential formula: ([(FwdU(Init,!(E(TRUE U !((!(E(TRUE U !(((p235==1)&&(p74==1))))) * (p192==1)))))) * (p164==1))] != FALSE + [FwdG...310
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t10, t11, t13, t18, t20, t21, t24, t25, t27, t29, t31, t36, t38, t47, t48, t61, t62, ...562
Detected timeout of ITS tools.
[2024-05-21 21:03:56] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:03:56] [INFO ] Applying decomposition
[2024-05-21 21:03:56] [INFO ] Flatten gal took : 5 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/graph8304629267908509063.txt' '-o' '/tmp/graph8304629267908509063.bin' '-w' '/tmp/graph8304629267908509063.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8304629267908509063.bin' '-l' '-1' '-v' '-w' '/tmp/graph8304629267908509063.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:03:56] [INFO ] Decomposing Gal with order
[2024-05-21 21:03:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:03:56] [INFO ] Removed a total of 294 redundant transitions.
[2024-05-21 21:03:56] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:03:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 1 ms.
[2024-05-21 21:03:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality16245765490578295535.gal : 1 ms
[2024-05-21 21:03:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality11638110811163680462.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/CTLCardinality16245765490578295535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11638110811163680462.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,1.27642e+06,0.026268,4048,117,69,893,301,196,1402,61,1303,0


Converting to forward existential form...Done !
original formula: (E(AG((AG(((i8.u22.p235==1)&&(i2.u4.p74==1))) * (i7.u18.p192==1))) U (i6.i0.u12.p164==1)) + EG(((i6.i1.u0.p28==0) * AF((((i6.i1.u16.p184=...243
=> equivalent forward existential formula: ([(FwdU(Init,!(E(TRUE U !((!(E(TRUE U !(((i8.u22.p235==1)&&(i2.u4.p74==1))))) * (i7.u18.p192==1)))))) * (i6.i0.u...398
Reverse transition relation is NOT exact ! Due to transitions t52, t62, t78, t89, t99, t104, t109, t120, t127, t135, t140, u11.t18, u11.t24, i1.u1.t38, i1....408
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 a local SCC at level 2
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,0.437917,17244,1,0,30942,1193,1159,40373,287,5802,42306
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 219 transition count 454
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 219 transition count 454
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 216 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 216 transition count 451
Applied a total of 48 rules in 12 ms. Remains 216 /240 variables (removed 24) and now considering 451/475 (removed 24) transitions.
// Phase 1: matrix 451 rows 216 cols
[2024-05-21 21:03:57] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 21:03:57] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 21:03:57] [INFO ] Invariant cache hit.
[2024-05-21 21:03:57] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 450 sub problems to find dead transitions.
[2024-05-21 21:03:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 21:04:05] [INFO ] Deduced a trap composed of 30 places in 293 ms of which 4 ms to minimize.
[2024-05-21 21:04:05] [INFO ] Deduced a trap composed of 27 places in 277 ms of which 4 ms to minimize.
[2024-05-21 21:04:05] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 3 ms to minimize.
[2024-05-21 21:04:06] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 4 ms to minimize.
[2024-05-21 21:04:06] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 4 ms to minimize.
[2024-05-21 21:04:06] [INFO ] Deduced a trap composed of 33 places in 265 ms of which 4 ms to minimize.
[2024-05-21 21:04:06] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 3 ms to minimize.
[2024-05-21 21:04:07] [INFO ] Deduced a trap composed of 36 places in 283 ms of which 3 ms to minimize.
[2024-05-21 21:04:07] [INFO ] Deduced a trap composed of 39 places in 274 ms of which 4 ms to minimize.
[2024-05-21 21:04:07] [INFO ] Deduced a trap composed of 29 places in 300 ms of which 3 ms to minimize.
[2024-05-21 21:04:08] [INFO ] Deduced a trap composed of 40 places in 283 ms of which 4 ms to minimize.
[2024-05-21 21:04:08] [INFO ] Deduced a trap composed of 39 places in 271 ms of which 3 ms to minimize.
[2024-05-21 21:04:08] [INFO ] Deduced a trap composed of 40 places in 261 ms of which 3 ms to minimize.
[2024-05-21 21:04:08] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 4 ms to minimize.
[2024-05-21 21:04:09] [INFO ] Deduced a trap composed of 38 places in 263 ms of which 4 ms to minimize.
[2024-05-21 21:04:09] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 5 ms to minimize.
[2024-05-21 21:04:10] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 4 ms to minimize.
[2024-05-21 21:04:10] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 3 ms to minimize.
[2024-05-21 21:04:10] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 3 ms to minimize.
[2024-05-21 21:04:10] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 21:04:11] [INFO ] Deduced a trap composed of 56 places in 278 ms of which 4 ms to minimize.
[2024-05-21 21:04:11] [INFO ] Deduced a trap composed of 69 places in 271 ms of which 4 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 3 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 4 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 41 places in 278 ms of which 3 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 51 places in 226 ms of which 4 ms to minimize.
[2024-05-21 21:04:13] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 3 ms to minimize.
[2024-05-21 21:04:13] [INFO ] Deduced a trap composed of 14 places in 264 ms of which 3 ms to minimize.
[2024-05-21 21:04:13] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:04:14] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 3 ms to minimize.
[2024-05-21 21:04:14] [INFO ] Deduced a trap composed of 42 places in 254 ms of which 3 ms to minimize.
[2024-05-21 21:04:14] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 3 ms to minimize.
[2024-05-21 21:04:15] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 3 ms to minimize.
[2024-05-21 21:04:15] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:04:15] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 3 ms to minimize.
[2024-05-21 21:04:15] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 3 ms to minimize.
[2024-05-21 21:04:16] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 2 ms to minimize.
[2024-05-21 21:04:16] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 3 ms to minimize.
[2024-05-21 21:04:16] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2024-05-21 21:04:16] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 21:04:20] [INFO ] Deduced a trap composed of 53 places in 236 ms of which 3 ms to minimize.
[2024-05-21 21:04:21] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 3 ms to minimize.
[2024-05-21 21:04:21] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 2 ms to minimize.
[2024-05-21 21:04:22] [INFO ] Deduced a trap composed of 31 places in 279 ms of which 4 ms to minimize.
[2024-05-21 21:04:22] [INFO ] Deduced a trap composed of 54 places in 270 ms of which 3 ms to minimize.
[2024-05-21 21:04:22] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:04:22] [INFO ] Deduced a trap composed of 34 places in 250 ms of which 3 ms to minimize.
[2024-05-21 21:04:23] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2024-05-21 21:04:23] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-05-21 21:04:23] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 3 ms to minimize.
[2024-05-21 21:04:23] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 3 ms to minimize.
[2024-05-21 21:04:24] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-05-21 21:04:24] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2024-05-21 21:04:24] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-21 21:04:25] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-05-21 21:04:25] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 3 ms to minimize.
[2024-05-21 21:04:26] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 3 ms to minimize.
[2024-05-21 21:04:26] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 3 ms to minimize.
[2024-05-21 21:04:26] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 4 ms to minimize.
[2024-05-21 21:04:26] [INFO ] Deduced a trap composed of 16 places in 248 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 21:04:28] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
[2024-05-21 21:04:28] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 216/667 variables, and 72 constraints, problems are : Problem set: 0 solved, 450 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/216 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 450 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 21:04:33] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-21 21:04:33] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:04:34] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-05-21 21:04:35] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-05-21 21:04:35] [INFO ] Deduced a trap composed of 54 places in 236 ms of which 3 ms to minimize.
[2024-05-21 21:04:35] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 4 ms to minimize.
[2024-05-21 21:04:36] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 3 ms to minimize.
[2024-05-21 21:04:36] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 3 ms to minimize.
[2024-05-21 21:04:36] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 4 ms to minimize.
[2024-05-21 21:04:36] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 3 ms to minimize.
[2024-05-21 21:04:37] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 21:04:40] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 2 ms to minimize.
[2024-05-21 21:04:41] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 3 ms to minimize.
[2024-05-21 21:04:41] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 6 (OVERLAPS) 451/667 variables, 216/302 constraints. Problems are: Problem set: 2 solved, 448 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 448/750 constraints. Problems are: Problem set: 2 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 667/667 variables, and 750 constraints, problems are : Problem set: 2 solved, 448 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 448/450 constraints, Known Traps: 76/76 constraints]
After SMT, in 61308ms problems are : Problem set: 2 solved, 448 unsolved
Search for dead transitions found 2 dead transitions in 61316ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 216/240 places, 449/475 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 449
Applied a total of 1 rules in 3 ms. Remains 215 /216 variables (removed 1) and now considering 449/449 (removed 0) transitions.
// Phase 1: matrix 449 rows 215 cols
[2024-05-21 21:04:58] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 21:04:59] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 21:04:59] [INFO ] Invariant cache hit.
[2024-05-21 21:04:59] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 215/240 places, 449/475 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62359 ms. Remains : 215/240 places, 449/475 transitions.
[2024-05-21 21:04:59] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:04:59] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:04:59] [INFO ] Input system was already deterministic with 449 transitions.
[2024-05-21 21:04:59] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:04:59] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:04:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality8859019583433936707.gal : 9 ms
[2024-05-21 21:04:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality7459121512591055203.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/CTLCardinality8859019583433936707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7459121512591055203.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 21:05:29] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:05:29] [INFO ] Applying decomposition
[2024-05-21 21:05:29] [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/graph14282003414028241253.txt' '-o' '/tmp/graph14282003414028241253.bin' '-w' '/tmp/graph14282003414028241253.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14282003414028241253.bin' '-l' '-1' '-v' '-w' '/tmp/graph14282003414028241253.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:05:29] [INFO ] Decomposing Gal with order
[2024-05-21 21:05:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:05:29] [INFO ] Removed a total of 714 redundant transitions.
[2024-05-21 21:05:29] [INFO ] Flatten gal took : 32 ms
[2024-05-21 21:05:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 5 ms.
[2024-05-21 21:05:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality16444355419095797986.gal : 3 ms
[2024-05-21 21:05:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality2759050971449876905.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/CTLCardinality16444355419095797986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2759050971449876905.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.90454e+10,0.115712,6960,686,117,5780,1383,547,7983,96,6206,0


Converting to forward existential form...Done !
original formula: AX((AX(((i14.i2.u77.p248==0)||(i5.i1.u38.p109==1))) * (AG((A((i6.u37.p119==0) U (i10.u54.p176==1)) * E((i1.i2.u15.p50==0) U (i14.i1.u73.p...312
=> equivalent forward existential formula: ([(EY(EY(Init)) * !(((i14.i2.u77.p248==0)||(i5.i1.u38.p109==1))))] = FALSE * (([(EY((EY(Init) * !(!(E(TRUE U !((...865
Reverse transition relation is NOT exact ! Due to transitions t199, t201, t221, t251, t321, t361, t401, t446, u65.t203, i1.i2.t192, i1.i2.u9.t172, i1.i2.u1...771
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,8.91164,249048,1,0,484711,5951,4122,680226,575,53988,557854
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Graph (trivial) has 184 edges and 240 vertex of which 4 / 240 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 238 transition count 398
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 91 rules applied. Total rules applied 167 place count 163 transition count 382
Reduce places removed 7 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 18 rules applied. Total rules applied 185 place count 156 transition count 371
Reduce places removed 11 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 13 rules applied. Total rules applied 198 place count 145 transition count 369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 199 place count 144 transition count 369
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 199 place count 144 transition count 362
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 213 place count 137 transition count 362
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 227 place count 123 transition count 348
Iterating global reduction 5 with 14 rules applied. Total rules applied 241 place count 123 transition count 348
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 5 with 2 rules applied. Total rules applied 243 place count 123 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 244 place count 122 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 244 place count 122 transition count 345
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 246 place count 121 transition count 345
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 247 place count 120 transition count 344
Iterating global reduction 7 with 1 rules applied. Total rules applied 248 place count 120 transition count 344
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 308 place count 90 transition count 314
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 314 place count 84 transition count 250
Iterating global reduction 7 with 6 rules applied. Total rules applied 320 place count 84 transition count 250
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 326 place count 84 transition count 250
Applied a total of 326 rules in 42 ms. Remains 84 /240 variables (removed 156) and now considering 250/475 (removed 225) transitions.
// Phase 1: matrix 250 rows 84 cols
[2024-05-21 21:05:38] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 21:05:38] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 21:05:38] [INFO ] Invariant cache hit.
[2024-05-21 21:05:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 21:05:38] [INFO ] Implicit Places using invariants and state equation in 151 ms returned [75, 83]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 261 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 82/240 places, 250/475 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 81 transition count 249
Applied a total of 2 rules in 11 ms. Remains 81 /82 variables (removed 1) and now considering 249/250 (removed 1) transitions.
// Phase 1: matrix 249 rows 81 cols
[2024-05-21 21:05:39] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 21:05:39] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 21:05:39] [INFO ] Invariant cache hit.
[2024-05-21 21:05:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:05:39] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 81/240 places, 249/475 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 566 ms. Remains : 81/240 places, 249/475 transitions.
[2024-05-21 21:05:39] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:05:39] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:05:39] [INFO ] Input system was already deterministic with 249 transitions.
[2024-05-21 21:05:39] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:05:39] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:05:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality13871961431633021129.gal : 2 ms
[2024-05-21 21:05:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality5507589954107255774.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/CTLCardinality13871961431633021129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5507589954107255774.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.60456e+07,4.17599,94200,2,8039,5,217309,6,0,571,218494,0


Converting to forward existential form...Done !
original formula: A(EG(((((p233!=1)||(p224==1))||(((p119==0)||(p105==1))&&((p74==0)||(p134==1)))) * (((EF(((p0==0)||(p160==1))) + (p246==0)) + ((p92==1)||(...385
=> equivalent forward existential formula: [((Init * !(EG(!(!((!((E(!(EG(((p246==0)||(p156==1)))) U (!(((p151==0)||(p108==1))) * !(EG(((p246==0)||(p156==1)...909
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t7, t12, t13, t20, t22, t24, t28, t30, t36, t39, t41, t46, t47, t71, t76, t77, t78, t...1086
Detected timeout of ITS tools.
[2024-05-21 21:06:09] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:06:09] [INFO ] Applying decomposition
[2024-05-21 21:06:09] [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/graph4023727665633698581.txt' '-o' '/tmp/graph4023727665633698581.bin' '-w' '/tmp/graph4023727665633698581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4023727665633698581.bin' '-l' '-1' '-v' '-w' '/tmp/graph4023727665633698581.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:06:09] [INFO ] Decomposing Gal with order
[2024-05-21 21:06:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:06:09] [INFO ] Removed a total of 646 redundant transitions.
[2024-05-21 21:06:09] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:06:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 3 ms.
[2024-05-21 21:06:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality15638476221407359893.gal : 1 ms
[2024-05-21 21:06:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality5240654490575105271.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/CTLCardinality15638476221407359893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5240654490575105271.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,3.60456e+07,0.041801,4564,215,79,1690,428,271,3102,85,1092,0


Converting to forward existential form...Done !
original formula: A(EG(((((i7.i1.u29.p233!=1)||(i7.i1.u27.p224==1))||(((i2.u13.p119==0)||(i2.u11.p105==1))&&((i1.i0.u6.p74==0)||(i3.u16.p134==1)))) * (((EF...591
=> equivalent forward existential formula: [((Init * !(EG(!(!((!((E(!(EG(((i7.i1.u24.p246==0)||(i5.u20.p156==1)))) U (!(((i3.u18.p151==0)||(i2.u12.p108==1)...1317
Reverse transition relation is NOT exact ! Due to transitions t86, t87, t102, t103, t118, t128, t138, t148, t158, t168, t178, t189, t209, t219, t229, t248,...524
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
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,4.18262,134716,1,0,247369,2336,1799,425726,446,13071,246875
FORMULA AutonomousCar-PT-05b-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 213 transition count 448
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 213 transition count 448
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 154 place count 213 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 159 place count 208 transition count 343
Iterating global reduction 1 with 5 rules applied. Total rules applied 164 place count 208 transition count 343
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 207 transition count 342
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 207 transition count 342
Applied a total of 166 rules in 10 ms. Remains 207 /240 variables (removed 33) and now considering 342/475 (removed 133) transitions.
// Phase 1: matrix 342 rows 207 cols
[2024-05-21 21:06:13] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 21:06:13] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 21:06:13] [INFO ] Invariant cache hit.
[2024-05-21 21:06:14] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2024-05-21 21:06:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:06:17] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 3 ms to minimize.
[2024-05-21 21:06:18] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 2 ms to minimize.
[2024-05-21 21:06:18] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 2 ms to minimize.
[2024-05-21 21:06:18] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:06:18] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 2 ms to minimize.
[2024-05-21 21:06:18] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 2 ms to minimize.
[2024-05-21 21:06:19] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-05-21 21:06:19] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-21 21:06:19] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 2 ms to minimize.
[2024-05-21 21:06:19] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-05-21 21:06:19] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 3 ms to minimize.
[2024-05-21 21:06:19] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 3 ms to minimize.
[2024-05-21 21:06:19] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-05-21 21:06:20] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:06:20] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-21 21:06:20] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:06:20] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:06:20] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-21 21:06:21] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 3 ms to minimize.
[2024-05-21 21:06:21] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:06:21] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 4 ms to minimize.
[2024-05-21 21:06:22] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 3 ms to minimize.
[2024-05-21 21:06:22] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 3 ms to minimize.
[2024-05-21 21:06:22] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 4 ms to minimize.
[2024-05-21 21:06:23] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 3 ms to minimize.
[2024-05-21 21:06:23] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:06:23] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 4 ms to minimize.
[2024-05-21 21:06:24] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 3 ms to minimize.
[2024-05-21 21:06:24] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 3 ms to minimize.
[2024-05-21 21:06:24] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-05-21 21:06:24] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 3 ms to minimize.
[2024-05-21 21:06:25] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 3 ms to minimize.
[2024-05-21 21:06:25] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 3 ms to minimize.
[2024-05-21 21:06:25] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 3 ms to minimize.
[2024-05-21 21:06:25] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 3 ms to minimize.
[2024-05-21 21:06:26] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-05-21 21:06:26] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 3 ms to minimize.
[2024-05-21 21:06:26] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2024-05-21 21:06:26] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-05-21 21:06:26] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:06:29] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 3 ms to minimize.
[2024-05-21 21:06:30] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 3 ms to minimize.
[2024-05-21 21:06:30] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 3 ms to minimize.
[2024-05-21 21:06:31] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 3 ms to minimize.
[2024-05-21 21:06:31] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:06:31] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 3 ms to minimize.
[2024-05-21 21:06:31] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-05-21 21:06:32] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 2 ms to minimize.
[2024-05-21 21:06:32] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:06:35] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
[2024-05-21 21:06:36] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD301 is UNSAT
At refinement iteration 7 (OVERLAPS) 342/549 variables, 207/268 constraints. Problems are: Problem set: 2 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 268 constraints, problems are : Problem set: 2 solved, 339 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 2 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 2/207 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 51/61 constraints. Problems are: Problem set: 2 solved, 339 unsolved
[2024-05-21 21:06:47] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 3 ms to minimize.
[2024-05-21 21:06:48] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 3 ms to minimize.
[2024-05-21 21:06:48] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-05-21 21:06:48] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 4/65 constraints. Problems are: Problem set: 2 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/65 constraints. Problems are: Problem set: 2 solved, 339 unsolved
At refinement iteration 5 (OVERLAPS) 342/549 variables, 207/272 constraints. Problems are: Problem set: 2 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 339/611 constraints. Problems are: Problem set: 2 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/611 constraints. Problems are: Problem set: 2 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 611 constraints, problems are : Problem set: 2 solved, 339 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 339/341 constraints, Known Traps: 55/55 constraints]
After SMT, in 60342ms problems are : Problem set: 2 solved, 339 unsolved
Search for dead transitions found 2 dead transitions in 60345ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 207/240 places, 340/475 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 206 transition count 340
Applied a total of 1 rules in 3 ms. Remains 206 /207 variables (removed 1) and now considering 340/340 (removed 0) transitions.
// Phase 1: matrix 340 rows 206 cols
[2024-05-21 21:07:14] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 21:07:14] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 21:07:14] [INFO ] Invariant cache hit.
[2024-05-21 21:07:14] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 206/240 places, 340/475 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61105 ms. Remains : 206/240 places, 340/475 transitions.
[2024-05-21 21:07:14] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:07:14] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:07:14] [INFO ] Input system was already deterministic with 340 transitions.
[2024-05-21 21:07:14] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:07:14] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:07:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality4521145519073173392.gal : 4 ms
[2024-05-21 21:07:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality8637925027141673267.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/CTLCardinality4521145519073173392.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8637925027141673267.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 21:07:44] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:07:44] [INFO ] Applying decomposition
[2024-05-21 21:07:44] [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/graph16588442838813055029.txt' '-o' '/tmp/graph16588442838813055029.bin' '-w' '/tmp/graph16588442838813055029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16588442838813055029.bin' '-l' '-1' '-v' '-w' '/tmp/graph16588442838813055029.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:07:45] [INFO ] Decomposing Gal with order
[2024-05-21 21:07:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:07:45] [INFO ] Removed a total of 454 redundant transitions.
[2024-05-21 21:07:45] [INFO ] Flatten gal took : 24 ms
[2024-05-21 21:07:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 3 ms.
[2024-05-21 21:07:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality2873495959590479877.gal : 3 ms
[2024-05-21 21:07:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality15189634632321419501.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/CTLCardinality2873495959590479877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15189634632321419501.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,3.84316e+10,0.103031,6728,606,103,5713,746,479,7483,81,2455,0


Converting to forward existential form...Done !
original formula: A((i3.i1.u10.p49==1) U !(E(EX(TRUE) U !(EG(((i5.i1.u27.p90==0)||(i3.i1.u10.p48==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(EX(TRUE) U !(EG(((i5.i1.u27.p90==0)||(i3.i1.u10.p48==1)))))))))) * !(E(!(!(E(EX(TRUE) U !(E...311
Reverse transition relation is NOT exact ! Due to transitions t194, t204, t219, t254, t274, t294, t337, i0.t192, i2.u15.t169, i2.u15.t172, i2.u16.t170, i3....718
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
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,25.7628,728056,1,0,1.49347e+06,3850,3574,1.97062e+06,461,22226,1546007
FORMULA AutonomousCar-PT-05b-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 214 transition count 449
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 214 transition count 449
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 152 place count 214 transition count 349
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 157 place count 209 transition count 344
Iterating global reduction 1 with 5 rules applied. Total rules applied 162 place count 209 transition count 344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 208 transition count 343
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 208 transition count 343
Applied a total of 164 rules in 9 ms. Remains 208 /240 variables (removed 32) and now considering 343/475 (removed 132) transitions.
// Phase 1: matrix 343 rows 208 cols
[2024-05-21 21:08:10] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 21:08:11] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 21:08:11] [INFO ] Invariant cache hit.
[2024-05-21 21:08:11] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 342 sub problems to find dead transitions.
[2024-05-21 21:08:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:08:17] [INFO ] Deduced a trap composed of 20 places in 244 ms of which 4 ms to minimize.
[2024-05-21 21:08:17] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 3 ms to minimize.
[2024-05-21 21:08:17] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 3 ms to minimize.
[2024-05-21 21:08:17] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 3 ms to minimize.
[2024-05-21 21:08:18] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 3 ms to minimize.
[2024-05-21 21:08:18] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 3 ms to minimize.
[2024-05-21 21:08:18] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 3 ms to minimize.
[2024-05-21 21:08:19] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 3 ms to minimize.
[2024-05-21 21:08:19] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 3 ms to minimize.
[2024-05-21 21:08:19] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 3 ms to minimize.
[2024-05-21 21:08:19] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 3 ms to minimize.
[2024-05-21 21:08:19] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 3 ms to minimize.
[2024-05-21 21:08:20] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 3 ms to minimize.
[2024-05-21 21:08:20] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 3 ms to minimize.
[2024-05-21 21:08:20] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 3 ms to minimize.
[2024-05-21 21:08:20] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 2 ms to minimize.
[2024-05-21 21:08:20] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
[2024-05-21 21:08:21] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 2 ms to minimize.
[2024-05-21 21:08:21] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2024-05-21 21:08:21] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:08:21] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 3 ms to minimize.
[2024-05-21 21:08:21] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 4 ms to minimize.
[2024-05-21 21:08:22] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 3 ms to minimize.
[2024-05-21 21:08:22] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 3 ms to minimize.
[2024-05-21 21:08:22] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 3 ms to minimize.
[2024-05-21 21:08:23] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 3 ms to minimize.
[2024-05-21 21:08:23] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:08:23] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 3 ms to minimize.
[2024-05-21 21:08:23] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 3 ms to minimize.
[2024-05-21 21:08:24] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
[2024-05-21 21:08:24] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-05-21 21:08:24] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2024-05-21 21:08:24] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 2 ms to minimize.
[2024-05-21 21:08:24] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 3 ms to minimize.
[2024-05-21 21:08:25] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-05-21 21:08:25] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-05-21 21:08:25] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2024-05-21 21:08:25] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-05-21 21:08:25] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 3 ms to minimize.
[2024-05-21 21:08:26] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:08:29] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 3 ms to minimize.
[2024-05-21 21:08:30] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:08:30] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 4 ms to minimize.
[2024-05-21 21:08:30] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 4 ms to minimize.
[2024-05-21 21:08:30] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 3 ms to minimize.
[2024-05-21 21:08:32] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 2 ms to minimize.
[2024-05-21 21:08:32] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 2 ms to minimize.
[2024-05-21 21:08:32] [INFO ] Deduced a trap composed of 39 places in 227 ms of which 3 ms to minimize.
[2024-05-21 21:08:33] [INFO ] Deduced a trap composed of 39 places in 227 ms of which 3 ms to minimize.
[2024-05-21 21:08:34] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:08:35] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 3 ms to minimize.
[2024-05-21 21:08:35] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 2 ms to minimize.
[2024-05-21 21:08:35] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 3 ms to minimize.
[2024-05-21 21:08:35] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 3 ms to minimize.
[2024-05-21 21:08:36] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 3 ms to minimize.
[2024-05-21 21:08:36] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 3 ms to minimize.
[2024-05-21 21:08:36] [INFO ] Deduced a trap composed of 55 places in 217 ms of which 3 ms to minimize.
[2024-05-21 21:08:37] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 4 ms to minimize.
[2024-05-21 21:08:37] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 3 ms to minimize.
[2024-05-21 21:08:37] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 3 ms to minimize.
[2024-05-21 21:08:38] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 3 ms to minimize.
[2024-05-21 21:08:38] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 3 ms to minimize.
[2024-05-21 21:08:38] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 4 ms to minimize.
[2024-05-21 21:08:39] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 3 ms to minimize.
[2024-05-21 21:08:39] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 3 ms to minimize.
[2024-05-21 21:08:39] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:08:41] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 3 ms to minimize.
SMT process timed out in 30608ms, After SMT, problems are : Problem set: 0 solved, 342 unsolved
Search for dead transitions found 0 dead transitions in 30611ms
Starting structural reductions in LTL mode, iteration 1 : 208/240 places, 343/475 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30994 ms. Remains : 208/240 places, 343/475 transitions.
[2024-05-21 21:08:41] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:08:41] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:08:41] [INFO ] Input system was already deterministic with 343 transitions.
[2024-05-21 21:08:41] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:08:41] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:08:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality1618298886360609883.gal : 4 ms
[2024-05-21 21:08:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality15561700091688772712.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/CTLCardinality1618298886360609883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15561700091688772712.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 21:09:12] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:09:12] [INFO ] Applying decomposition
[2024-05-21 21:09:12] [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/graph17600928281143395136.txt' '-o' '/tmp/graph17600928281143395136.bin' '-w' '/tmp/graph17600928281143395136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17600928281143395136.bin' '-l' '-1' '-v' '-w' '/tmp/graph17600928281143395136.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:09:12] [INFO ] Decomposing Gal with order
[2024-05-21 21:09:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:09:12] [INFO ] Removed a total of 449 redundant transitions.
[2024-05-21 21:09:12] [INFO ] Flatten gal took : 20 ms
[2024-05-21 21:09:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 3 ms.
[2024-05-21 21:09:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality16174568816620241821.gal : 4 ms
[2024-05-21 21:09:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality16244469308201520912.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/CTLCardinality16174568816620241821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16244469308201520912.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.93301e+10,0.103786,6576,686,103,4673,1144,514,7150,88,4073,0


Converting to forward existential form...Done !
original formula: EF((AX((i13.u63.p210==1)) + EG(((i10.u54.p177==0)&&(i6.u34.p116==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!((i13.u63.p210==1)))))] != FALSE + [FwdG(FwdU(Init,TRUE),((i10.u54.p177==0)&&(i6.u34....176
Reverse transition relation is NOT exact ! Due to transitions t196, t198, t248, t273, t293, t340, i2.t187, i2.u9.t167, i2.u15.t171, i2.u15.t172, i2.u15.t17...717
(forward)formula 0,1,0.485625,16344,1,0,27804,1289,2821,33543,402,4583,98987
FORMULA AutonomousCar-PT-05b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 214 transition count 449
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 214 transition count 449
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 152 place count 214 transition count 349
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 157 place count 209 transition count 344
Iterating global reduction 1 with 5 rules applied. Total rules applied 162 place count 209 transition count 344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 208 transition count 343
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 208 transition count 343
Applied a total of 164 rules in 14 ms. Remains 208 /240 variables (removed 32) and now considering 343/475 (removed 132) transitions.
// Phase 1: matrix 343 rows 208 cols
[2024-05-21 21:09:12] [INFO ] Computed 10 invariants in 5 ms
[2024-05-21 21:09:12] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 21:09:12] [INFO ] Invariant cache hit.
[2024-05-21 21:09:13] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 342 sub problems to find dead transitions.
[2024-05-21 21:09:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:09:19] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 4 ms to minimize.
[2024-05-21 21:09:19] [INFO ] Deduced a trap composed of 51 places in 228 ms of which 4 ms to minimize.
[2024-05-21 21:09:19] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 3 ms to minimize.
[2024-05-21 21:09:19] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:09:20] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 4 ms to minimize.
[2024-05-21 21:09:20] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 3 ms to minimize.
[2024-05-21 21:09:20] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 3 ms to minimize.
[2024-05-21 21:09:20] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 3 ms to minimize.
[2024-05-21 21:09:20] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-05-21 21:09:21] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 3 ms to minimize.
[2024-05-21 21:09:21] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 3 ms to minimize.
[2024-05-21 21:09:21] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 3 ms to minimize.
[2024-05-21 21:09:21] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 3 ms to minimize.
[2024-05-21 21:09:21] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-21 21:09:22] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
[2024-05-21 21:09:22] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-05-21 21:09:22] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-21 21:09:23] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-21 21:09:23] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-21 21:09:23] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:09:24] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 3 ms to minimize.
[2024-05-21 21:09:24] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 4 ms to minimize.
[2024-05-21 21:09:24] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 3 ms to minimize.
[2024-05-21 21:09:25] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 3 ms to minimize.
[2024-05-21 21:09:25] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 3 ms to minimize.
[2024-05-21 21:09:25] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2024-05-21 21:09:26] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2024-05-21 21:09:26] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 3 ms to minimize.
[2024-05-21 21:09:26] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 2 ms to minimize.
[2024-05-21 21:09:27] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 3 ms to minimize.
[2024-05-21 21:09:27] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 3 ms to minimize.
[2024-05-21 21:09:27] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 4 ms to minimize.
[2024-05-21 21:09:28] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 3 ms to minimize.
[2024-05-21 21:09:28] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 3 ms to minimize.
[2024-05-21 21:09:28] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 3 ms to minimize.
[2024-05-21 21:09:28] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 3 ms to minimize.
[2024-05-21 21:09:28] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 4 ms to minimize.
[2024-05-21 21:09:29] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 3 ms to minimize.
[2024-05-21 21:09:29] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 3 ms to minimize.
[2024-05-21 21:09:29] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:09:32] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 3 ms to minimize.
[2024-05-21 21:09:32] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 3 ms to minimize.
[2024-05-21 21:09:32] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 4 ms to minimize.
[2024-05-21 21:09:33] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 3 ms to minimize.
[2024-05-21 21:09:33] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 3 ms to minimize.
[2024-05-21 21:09:33] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 3 ms to minimize.
[2024-05-21 21:09:33] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 3 ms to minimize.
[2024-05-21 21:09:33] [INFO ] Deduced a trap composed of 46 places in 207 ms of which 3 ms to minimize.
[2024-05-21 21:09:34] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 2 ms to minimize.
[2024-05-21 21:09:35] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 3 ms to minimize.
[2024-05-21 21:09:35] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 2 ms to minimize.
[2024-05-21 21:09:36] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 3 ms to minimize.
[2024-05-21 21:09:36] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD302 is UNSAT
At refinement iteration 6 (OVERLAPS) 343/551 variables, 208/271 constraints. Problems are: Problem set: 2 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 271 constraints, problems are : Problem set: 2 solved, 340 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 2 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 2/208 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 53/63 constraints. Problems are: Problem set: 2 solved, 340 unsolved
[2024-05-21 21:09:47] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 3 ms to minimize.
[2024-05-21 21:09:47] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 3 ms to minimize.
[2024-05-21 21:09:48] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 3 ms to minimize.
[2024-05-21 21:09:48] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 3 ms to minimize.
[2024-05-21 21:09:49] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 3 ms to minimize.
[2024-05-21 21:09:49] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 3 ms to minimize.
[2024-05-21 21:09:49] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 3 ms to minimize.
[2024-05-21 21:09:49] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 2 ms to minimize.
[2024-05-21 21:09:50] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 9/72 constraints. Problems are: Problem set: 2 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/72 constraints. Problems are: Problem set: 2 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 343/551 variables, 208/280 constraints. Problems are: Problem set: 2 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 340/620 constraints. Problems are: Problem set: 2 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/620 constraints. Problems are: Problem set: 2 solved, 340 unsolved
[2024-05-21 21:10:07] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/551 variables, 1/621 constraints. Problems are: Problem set: 2 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 621 constraints, problems are : Problem set: 2 solved, 340 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 340/342 constraints, Known Traps: 63/63 constraints]
After SMT, in 60522ms problems are : Problem set: 2 solved, 340 unsolved
Search for dead transitions found 2 dead transitions in 60529ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 208/240 places, 341/475 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 341
Applied a total of 1 rules in 3 ms. Remains 207 /208 variables (removed 1) and now considering 341/341 (removed 0) transitions.
// Phase 1: matrix 341 rows 207 cols
[2024-05-21 21:10:13] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 21:10:13] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 21:10:13] [INFO ] Invariant cache hit.
[2024-05-21 21:10:14] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 207/240 places, 341/475 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61456 ms. Remains : 207/240 places, 341/475 transitions.
[2024-05-21 21:10:14] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:10:14] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:10:14] [INFO ] Input system was already deterministic with 341 transitions.
[2024-05-21 21:10:14] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:10:14] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:10:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality3257579846395299337.gal : 3 ms
[2024-05-21 21:10:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality9873321066137547521.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/CTLCardinality3257579846395299337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9873321066137547521.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 21:10:44] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:10:44] [INFO ] Applying decomposition
[2024-05-21 21:10:44] [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/graph2264633763236220190.txt' '-o' '/tmp/graph2264633763236220190.bin' '-w' '/tmp/graph2264633763236220190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2264633763236220190.bin' '-l' '-1' '-v' '-w' '/tmp/graph2264633763236220190.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:10:44] [INFO ] Decomposing Gal with order
[2024-05-21 21:10:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:10:44] [INFO ] Removed a total of 452 redundant transitions.
[2024-05-21 21:10:44] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:10:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2024-05-21 21:10:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality17150970750476447116.gal : 5 ms
[2024-05-21 21:10:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality15850500121882099763.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/CTLCardinality17150970750476447116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15850500121882099763.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.84316e+10,0.273608,8936,731,127,10765,1144,508,12931,90,3444,0


Converting to forward existential form...Done !
original formula: EX(AG((((i3.u15.p52==0)||(i6.u34.p117==1)) + AX(E(((i3.u16.p57==0)||(i13.u57.p208==1)) U (i0.u2.p5==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((((i3.u15.p52==0)||(i6.u34.p117==1)) + !(EX(!(E(((i3.u16.p57==0)||(i13.u57.p208==1)) U...188
Reverse transition relation is NOT exact ! Due to transitions t194, t199, t219, t254, t274, t294, t338, i0.t192, i0.u2.t195, i0.u2.t196, i3.t185, i3.u10.t1...728
(forward)formula 0,0,6.8948,217760,1,0,412951,6910,3538,657995,446,68412,627902
FORMULA AutonomousCar-PT-05b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-21 21:10:51] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:10:51] [INFO ] Flatten gal took : 23 ms
Total runtime 1063211 ms.

BK_STOP 1716325851371

--------------------
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="AutonomousCar-PT-05b"
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 AutonomousCar-PT-05b, 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-171620167400289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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